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

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.

[1]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  George Wolberg,et al.  Restoration of binary images using stochastic relaxation with annealing , 1985, Pattern Recognit. Lett..

[4]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[5]  Alberto Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, DAC 1986.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  R. G. Paxman,et al.  Application of Simulated Annealing to Coded-Aperture Design and Tomographic Reconstruction , 1985, IEEE Transactions on Nuclear Science.

[8]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[9]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Joos Vandewalle,et al.  Sailplane: a simulated annealing based CAD-tool for the analysis of limit-cycle behaviour , 1985 .

[12]  P. Carnevali,et al.  Image processing by stimulated annealing , 1985 .

[13]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  E. Sontag,et al.  Image restoration and segmentation using the annealing algorithm , 1985, 1985 24th IEEE Conference on Decision and Control.

[15]  Emile H. L. Aarts,et al.  A Parallel Statistical Cooling Algorithm , 1986, STACS.

[16]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[17]  R. Holley,et al.  Rapid Convergence to Equilibrium in One Dimensional Stochastic Ising Models , 1985 .

[18]  D. Mitra,et al.  Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[19]  Paolo Carnevali,et al.  Image Processing by Simulated Annealing , 1985, IBM J. Res. Dev..

[20]  Hon Wai Leong,et al.  SIMULATED-ANNEALING CHANNEL ROUTER. , 1985 .

[21]  H H Barrett,et al.  Reconstruction of objects from coded images by simulated annealing. , 1983, Optics letters.

[22]  Bruce Hajek,et al.  A tutorial survey of theory and applications of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[23]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[24]  B. Gidas.  Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .

[25]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[27]  Emile H. L. Aarts,et al.  Design-for-Testability of PLA'S Using Statistical Cooling , 1986, DAC 1986.