Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Надійна Табу-пошук× | Стохастичний пошук з табу× | |
|---|---|---|
| Галузь | Імітаційне моделювання | Імітаційне моделювання |
| Родина | Process / pipeline | Process / pipeline |
| Рік появи≠ | 1989 (TS); robust variant ~2000s | 1990s |
| Автор методу≠ | Glover, F. (Tabu Search); robustness extensions by various authors | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) |
| Тип≠ | Metaheuristic with robustness mechanism | Stochastic metaheuristic optimizer |
| Основоположне джерело≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗ |
| Інші назви | RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search |
| Пов'язані≠ | 6 | 5 |
| Підсумок≠ | Robust Tabu Search (RTS) extends the classical Tabu Search metaheuristic by evaluating candidate solutions not only on their nominal objective value but also on their performance under uncertainty. Instead of seeking the best solution for a single scenario, RTS seeks solutions that perform well across a range of scenarios or realizations, trading peak optimality for reliability. | Stochastic Tabu Search (STS) is an extension of classical Tabu Search that introduces randomness into the neighborhood exploration and move-selection phases. By combining tabu memory — which forbids recently visited solutions — with probabilistic acceptance or random candidate sampling, STS escapes local optima more effectively and explores rugged solution landscapes that deterministic TS may fail to traverse. |
| ScholarGateНабір даних ↗ |
|
|