Abstract
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain difficult problems, including NP-hard combinatorial problems such as the travelling salesman, Steiner trees and others. There is an appealing physical analogy for its operation, but a more formal model seems desirable. In this paper we present such a model and prove that the algorithm converges with probability arbitrarily close to 1. We also show that there are cases where convergence takes exponentially long—that is, it is no better than a deterministic method. We study how the convergence rate is affected by the form of the problem. Finally we describe a version of the algorithm that terminates in polynomial time and allows a good deal of ‘practical’ confidence in the solution.
Similar content being viewed by others
References
A. Berman and R.J. Plemmons,Non-negative matrices in the mathematical sciences (Academic Press, New York, 1979).
V. Cerny, “A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm”,Journal of Optimization Theory and Applications (1984), to appear.
A.W.F. Edwards, “Minimal evolution” (Unpublished, 1966).
B. Everitt,Cluster analysis (Heineman Educational Books, London, 1977).
M.R. Garey and D.S. Johnson,Computers and intractability: A guide to the theory of NP-completeness (W.H. Freeman, San Francisco, 1979).
S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images“,IEEE Transactions PAMI 6(6) (1984) 721–741.
D.P. Heyman and M.J. Sobel,Stochastic models in operations research, Volume 1: Stochastic processes and operating characteristics (McGraw-Hill Inc., New York, 1982).
D.S. Johnson, private communication, 1984.
F.P. Kelly,Reversibility and stochastic networks (Wiley, Chichester, 1979).
S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, “Optimization by simulated annealing”, Research Report RC 9355, IBM (Yorktown Heights, NY, 1982).
M. Lundy, “Applications of the annealing algorithm to combinatorial problems in statistics“,Biometrika 72 (1) (1985) 191–198.
M. Lundy, “The annealing algorithm”, Ph.D. Thesis, University of Cambridge (Cambridge, 1984).
N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth and A.H. Teller, “Equation of state calculation by fast computing machines“,Journal of Chemical Physics 21 (1953) 1087–1092.
F. Romeo and A. Sangiovanni-Vincentelli, “Probabilistic hill-climbing algorithms: Properties and applications”, Memorandum No. UCB/ERL M84/34, University of California (Berkeley, CA, March 1984).
B.M. Schwarzschild, “ Statistical mechanics algorithm for Monte Carlo optimization“, Physics Today (May 1982) 17–19.
E. Seneta,Non-negative matrices and Markov chains (Springer-Verlag, New York, 2nd Edition, 1981).
E.A. Thompson, “The method of minimum evolution“,Annals of Human Genetics 26 (1973) 333–340.
C. Tovey, “On the number of iterations of local improvement algorithms“,Operations Research Letters 2 (5) (1983) 231–238.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lundy, M., Mees, A. Convergence of an annealing algorithm. Mathematical Programming 34, 111–124 (1986). https://doi.org/10.1007/BF01582166
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582166