Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Căutare Tabu Stocastică× | Recalire simulată× | |
|---|---|---|
| Domeniu≠ | Simulare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1990s | 1983 |
| Autorul original≠ | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) | — |
| Tip≠ | Stochastic metaheuristic optimizer | Probabilistic metaheuristic / local search |
| Sursa seminală≠ | Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Denumiri alternative≠ | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Înrudite | 5 | 5 |
| Rezumat≠ | 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. | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. |
| ScholarGateSet de date ↗ |
|
|