Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Tabu Search× | Simulated Annealing – Probabilistisk Optimering× | |
|---|---|---|
| Ämnesområde | Optimering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1989 | 1983 |
| Upphovsperson≠ | Fred Glover | — |
| Typ≠ | Local-search metaheuristic | Probabilistic metaheuristic / local search |
| Ursprungskälla≠ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Alias | Tabu Araması (Tabu Search), TS, tabu metaheuristic | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Närliggande≠ | 4 | 5 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|