Optimization by Simulated Annealing

  title={Optimization by Simulated Annealing},
  author={Scott Kirkpatrick and Charles D. Gelatt and Michelle Vecchi},
  pages={671 - 680}
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… 
Modelling of Complex Systems by Simulated Annealing
Just as Nature manages to cool a macroscopic system into or very close to its ground state in a short period of time even though its number of degrees of freedom is of the order of Avogadro’s number, so does simulated annealing rapidly find a good guess of the solution of the posed problem.
Configuration Space Analysis for Optimization Problems
Simulated annealing (a stochastic algorithm based on the Monte Carlo method) is used to find approximate solutions to complex optimization problems involving frustrated disordered systems.
Stochastic Models of Parallel Systems for Global Optimization
The objective of this paper is to consider an interacting particle system model of a many searcher system and to reformulate some simple ideas from statistical physics in this context.
Natural and simulated annealing
Simulated annealing is an optimization procedure based on the behavior of condensed matter at low temperatures that mirrors the annealing process that takes place in nature. The procedure employs
Application of statistical mechanics to NP-complete problems in combinatorial optimisation
Recently developed techniques of the statistical mechanics of random systems are applied to the graph partitioning problem. The averaged cost function is calculated and agrees well with numerical
Statistical Mechanics: a General Approach to Combinatorial Optimization
The aim of this work was to investigate the possibility of using statistical mechanics as an alternative framework to study complex combinatorial optimization problems by proposing a selecting procedure which favours the choice of neighbouring trial solutions.
Statistical Physics and Optimization: Binary Sequences with Small Autocorrelations
For long sequences, the energy minima found with the simulated annealing procedure differ by about a factor of 2 from the conjectured “true” minimum, indicating that the lowest-energy configurations are extremely isolated in configuration space.
Optimization of Production Lines by Methods from Statistical Physics
This article shows how simulated annealing and related Monte Carlo optimization algorithms can be adapted to the optimization of a certain type of assembly line, which can be related to a TSP with additional constraints.


Equation of state calculations by fast computing machines
A general method, suitable for fast computing machines, for investigating such properties as equations of state for substances consisting of interacting individual molecules is described. The method
Solvable Model of a Spin-Glass
We consider an Ising model in which the spins are coupled by infinite-ranged random interactions independently distributed with a Gaussian probability density. Both "spinglass" and ferromagnetic
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
The shortest path through many points
ABSTRACT We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend
Computer solutions of the traveling salesman problem
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
The present study convincingly establishes the usefulness of mathematically proven good cutting-planes as an invaluable algorithmic tool for difficult combinatorial optimization problems.
Design Automation for Digital Systems
Design automation in IBM
Within the context of the changing design requirements of digital systems spanning the semiconductor era, this paper describes the significant steps in the development of Design Automation technology