Simulated annealing: past, present, and future

This paper provides an overview of the simulated annealing algorithm and describes its historical foundation in thermodynamics as well as the genesis and evolution for solving difficult optimization problems. An example illustrating its application to graph problems is provided as well as a look at ongoing, state-of-the-art research using SA.

[1]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[2]  Mark A. Fleischer,et al.  Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control , 1996, J. Heuristics.

[3]  Ronald G. Askin,et al.  A note on the effect of neighborhood structure in simulated annealing , 1991, Comput. Oper. Res..

[4]  Larry Goldstein,et al.  Neighborhood size in the Simulated Annealing Algorithm , 1988 .

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

[6]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

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

[8]  Sheldon Howard Jacobson,et al.  Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control , 1996 .

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

[10]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[11]  Xin Yao,et al.  Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..

[12]  M. E. Johnson,et al.  Generalized simulated annealing for function optimization , 1986 .

[13]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[14]  M. Fleischer,et al.  Assessing the performance of the simulated annealing algorithm using information theory , 1994 .

[15]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[16]  Norbert Wiener,et al.  Cybernetics, or control and communication in the animal and the machine, 2nd ed. , 1961 .

[17]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[19]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[20]  Robert Azencott,et al.  Simulated annealing : parallelization techniques , 1992 .

[21]  Kathryn A. Dowsland.  Modem heuristic techniques for combinatorial problems , 1993 .

[22]  Fred W. Glover,et al.  Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..

[23]  Craig A. Tovey,et al.  Simulated, simulated annealing , 1988 .

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

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

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

[27]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .