Abstract
Recently simulated annealing, a probabilistic heuristic motivated by an analogy between statistical mechanics and combinatorial optimization, has been used to obtain good solutions to various combinatorial problems. The method minimizes a function f(s) whose arguments are the elements of a finite set S of feasible configurations (or solutions when applied to a combinatorial optimization problem) by a sequence of actions called local exchanges. All exchanges which improve f are accepted where as exchanges which increase f are accepted with a probability depending on a parameter called the temperature. At a given temperature level, a sequence of local exchanges, the so called inner loop iterations, are executed until the system reaches an equilibrium. The number of temperature levels and the way the temperature is lowered is called the annealing schedule.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
V. Cerny, “Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm”, Journal Of Optimization Theory And Applications Vol 45, 41–51 (1985).
B.L. Golden and C.C. Skiscim, “Using Simulated Annealing to Solve Routing and Location Problems”, Naval Research Logistics Quarterly, Vol 33, 261–279 (1986).
S. Kirkpatrick, CD. Gelatt Jr. and M.P. Vecchi, “Optimization by Simulated Annealing”, Science, Vol 220, 671–680 (1983).
Y. Rossier, M. Trcyon and Th.M. Liebling, “Probabilistic Exchange Algorithms and Euclidian Travelling Salesman Problems”, Or Spektrum, Vol 8, 151–164 (9186).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spälti, K. (1989). Equilibrium Definitions in Simulated Annealing: A Computational Experiment. In: Wallace, S.W. (eds) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83724-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-83724-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83726-5
Online ISBN: 978-3-642-83724-1
eBook Packages: Springer Book Archive