Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Stokastisk Tabusökning× | Tabu Search× | |
|---|---|---|
| Ämnesområde≠ | Simulering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1990s | 1989 |
| Upphovsperson≠ | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) | Fred Glover |
| Typ≠ | Stochastic metaheuristic optimizer | Local-search metaheuristic |
| Ursprungskälla≠ | Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Alias≠ | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Närliggande≠ | 5 | 4 |
| Sammanfattning≠ | 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. | Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems. |
| ScholarGateDatamängd ↗ |
|
|