Optimization by Simulated Annealing

There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. This connection to statistical mechanics exposes new information and provides an unfamiliar perspective on traditional optimization problems and methods.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  S. Kirkpatrick.  Frustration and ground-state degeneracy in spin glasses , 1977 .

[3]  S. Kirkpatrick,et al.  Solvable Model of a Spin-Glass , 1975 .

[4]  C. Castellani,et al.  Disordered Systems and Localization , 1982 .

[5]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[6]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[7]  A. P. Young,et al.  Low-temperature behavior of the infinite-range Ising spin-glass: Exact statistical mechanics for small samples , 1982 .

[8]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[9]  William M. van Cleemput,et al.  Design Automation for Digital Systems , 1984, Computer.

[10]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[11]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

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

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

[14]  S. Lin,et al.  Heuristic Programming as an Aid to Network Design , 1975, Networks.

[15]  M. Correia,et al.  Design automation in IBM , 1981 .

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

[17]  S. Kirkpatrick,et al.  Infinite-ranged models of spin-glasses , 1978 .