Simulated Annealing: Theory of the Past, Practice of the Future?

Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. In this paper we first give a mathematical description of the algorithm and discuss its behaviour from both a theoretical and a practical point of view. We illustrate the practical use of the algorithm by discussing the application to a number of combinatorial optimization problems. In addition, we cite applications in such diverse areas as design of integrated circuits, image processing, code design and neural network theory, and discuss computational experience with the algorithm.

[1]  Daniel H. Rothman,et al.  Nonlinear inversion, statistical mechanics, and residual statics estimation , 1985 .

[2]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[3]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[5]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

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

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

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

[9]  J. Soukup.  Circuit layout , 1981, Proceedings of the IEEE.

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

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

[12]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[13]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[15]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[16]  P.J.M. van Laarhoven,et al.  Theoretical and Computational Aspects of Simulated Annealing. , 1990 .

[17]  Lane A. Hemaspaandra,et al.  Using simulated annealing to design good codes , 1987, IEEE Trans. Inf. Theory.