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.
|Title of host publication||Pattern recognition, theory and applications (Proceedings NATO Advanced Study Institute, Spa-Balmoral, Belgium, June 9-20, 1986)|
|Editors||P.A. Devijver, J. Kittler|
|Place of Publication||Berlin|
|Number of pages||14|
|Publication status||Published - 1987|
|Name||NATO ASI Series, Series F: Computer and Systems Sciences|