Simulated Annealing — Probabilistic Optimization
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.
Pročitajte celu metodu
Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.
Method map
The neighbourhood of related methods — select a node to explore.
+9 more
Izvori
- Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI: 10.1126/science.220.4598.671 ↗
- van Laarhoven, P.J.M. & Aarts, E.H.L. (1987). Simulated Annealing: Theory and Applications. Springer. ISBN: 9789027725431
Kako citirati ovu stranicu
ScholarGate. (2026, June 1). Simulated Annealing. ScholarGate. https://scholargate.app/sr/optimization/simulated-annealing
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Optimizacija kolonijom mravaOptimizacija↔ compare
- Diferencijalna evolucijaOptimizacija↔ compare
- Genetički algoritamOptimizacija↔ compare
- Optimizacija rojem čestica (PSO)Optimizacija↔ compare
- Tabu SearchOptimizacija↔ compare
Citirana u
Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →