Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Deterministinen simulointihehkutus× | Tabu Search× | |
|---|---|---|
| Tieteenala≠ | Simulointi | Optimointi |
| Menetelmäperhe | Process / pipeline | Process / pipeline |
| Syntyvuosi≠ | 1990 | 1989 |
| Kehittäjä≠ | Rose, K., Gurewitz, E., Fox, G. C. | Fred Glover |
| Tyyppi≠ | Deterministic metaheuristic — annealing schedule without probabilistic acceptance | Local-search metaheuristic |
| Alkuperäislähde≠ | Rose, K., Gurewitz, E., Fox, G. C. (1990). A deterministic annealing approach to clustering. Pattern Recognition Letters, 11(9), 589-594. DOI ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Rinnakkaisnimet≠ | DSA, Deterministic Annealing, Greedy Annealing, Temperature-Scheduled Descent | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Liittyvät≠ | 2 | 4 |
| Tiivistelmä≠ | Deterministic Simulated Annealing (DSA) is an optimization metaheuristic that adopts the cooling-schedule structure of classical simulated annealing but replaces the probabilistic Metropolis acceptance criterion with a strictly deterministic rule: only improving moves are accepted. This yields a reproducible, greedy-descent procedure guided by an annealing temperature schedule. | 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. |
| ScholarGateAineisto ↗ |
|
|