Simulated annealing : a pedestrian review of the theory and some applications

E.H.L. Aarts, P.J.M. Laarhoven, van

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


Simulated annealing is a combinatorial optimization method based on randomization techniques. The method originates from the analogy between the annealing of solids, as described by the theory of statistical physics, and the optimization of large combinatorial problems. Here we review the basic theory of simulated annealing and recite a number of applications of the method. The theoretical review includes concepts of the theory of homogeneous and inhomogeneous Markov chains, an analysis of the asymptotic convergence of the algorithm, and a discussion of the finite-time behaviour. The list of applications includes combinatorial optimization problems related to VLSI design, image processing, code design and artificial intelligence.
Original languageEnglish
Title of host publicationPattern recognition, theory and applications (Proceedings NATO Advanced Study Institute, Spa-Balmoral, Belgium, June 9-20, 1986)
EditorsP.A. Devijver, J. Kittler
Place of PublicationBerlin
Number of pages14
ISBN (Electronic)978-3-642-83069-3
ISBN (Print)978-3-642-83071-6
Publication statusPublished - 1987

Publication series

NameNATO ASI Series, Series F: Computer and Systems Sciences
ISSN (Print)1387-6694


Dive into the research topics of 'Simulated annealing : a pedestrian review of the theory and some applications'. Together they form a unique fingerprint.

Cite this