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… Expand
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. Expand
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. Expand
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. Expand
A Monte carlo simulated annealing approach to optimization over continuous variables
Numerical optimization methods based on thermodynamic concepts are extended to the case of continuous multidimensional parameter spaces, and a self-regulatory mechanism for choosing the random step distribution is described. Expand
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 employsExpand
Parallel simulated annealing for shape detection
The analogy between this problem and a combinatorial optimization problem was observed in [2] and [13]. Expand
Optimal ensemble size for parallel implementations of simulated annealing
Abstract We determine the optimal ensemble size for a simulated annealing problem based on assumptions about scaling properties of the system dynamics and of the density of states in the low energyExpand
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 numericalExpand
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. Expand
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. Expand


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 methodExpand
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 ferromagneticExpand
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. Expand
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 knowledgeExpand
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 generalExpand
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
We report the solution to optimality of ten large-scale symmetric travelling salesman problems. The travelling salesman problem (TSP) is one of the standard problems of the OperationsExpand
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  • R. Karp
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms. Expand
Design Automation for Digital Systems
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman
  • San Francisco,
  • 1979