Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Zdeterminowane wyżarzanie× | Wyżarzanie symulowane× | |
|---|---|---|
| Dziedzina≠ | Symulacja | Optymalizacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1990 | 1983 |
| Twórca≠ | Rose, K., Gurewitz, E., Fox, G. C. | — |
| Typ≠ | Deterministic metaheuristic — annealing schedule without probabilistic acceptance | Probabilistic metaheuristic / local search |
| Źródło pierwotne≠ | Rose, K., Gurewitz, E., Fox, G. C. (1990). A deterministic annealing approach to clustering. Pattern Recognition Letters, 11(9), 589-594. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Inne nazwy≠ | DSA, Deterministic Annealing, Greedy Annealing, Temperature-Scheduled Descent | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Pokrewne≠ | 2 | 5 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|