Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Robust Tabu Search× | Pencarian Tabu Stokastik× | |
|---|---|---|
| Bidang | Simulasi | Simulasi |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1989 (TS); robust variant ~2000s | 1990s |
| Pengasas≠ | Glover, F. (Tabu Search); robustness extensions by various authors | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) |
| Jenis≠ | Metaheuristic with robustness mechanism | Stochastic metaheuristic optimizer |
| Sumber perintis≠ | 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 ↗ |
| Alias | RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search |
| Berkaitan≠ | 6 | 5 |
| Ringkasan≠ | 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. |
| ScholarGateSet data ↗ |
|
|