 Simulated annealing: An introductionE.H.L. Aarts and P.J.M. van Laarhoven Statistica Neerlandica, 1989, vol. 43, issue 1, 31-52 Abstract: Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. The algorithm is based on an intriguing combination of ideas from at first sight completely unrelated fields of science, viz. combinatorial optimization and statistical physics. On the one hand the algorithm can be viewed as an analogue of an algorithm used in statistical physics for computer simulation of the annealing of a solid to its minimum–energy state, on the other hand it can be considered as a generalization of the well–known iterative improvement approach to combinatorial optimization problems. In this introductory paper we give a mathematical description of the simulated annealing algorithm and discuss its behaviour from both a theoretical and a practical point of view. The latter is illustrated by applying the algorithm to the travelling salesman problem. This paper was written to familiarize the readers of Statistica Neerlandica with simulated annealing. It is a summary of papers written earlier by the authors and does not contain any new material. Date: 1989 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:43:y:1989:i:1:p:31-52 Ordering information: This journal article can be ordered from Access Statistics for this article Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.