Abstract
In this paper a simulated annealing algorithm for continuous global optimization will be considered. The algorithm, in which a cooling schedule based on the distance between the function value in the current point and an estimate of the global optimum value is employed, has been first introduced in Bohachevsky, Johnson and Stein (1986) [2], but without any proof of convergence. Here it will be proved that, under suitable assumptions, the algorithm is convergent
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belisle, C.J.P. (1992), Convergence theorems for a class of simulated annealing algorithms on Rd, Journal of Applied Probability 29: 885-892.
Bohachevsky, I.O., Johnson, M.E. and Stein, M.L. (1986), Generalized simulated annealing for function optimization, Technometrics 28: 209-217.
Brooks, D.G. and Verdini, W.A. (1988), Computational experience with generalized simulated annealing over continuous variables, Amer. J. of Mathematical and Management Sciences 8: 425-449.
Černy, V. (1985), Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl. 45: 41-51.
Coleman, T., Shalloway, D. and Zhijun Wu (1994), A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing, J. of Global Optimization 4: 171-185.
Corana, A., Marchesi, M., Martini, C. and Ridella, S. (1987), Minimizing multimodal functions of continuous variables with the 'simulated Annealing' algorithm, ACM Trans. Math. Software 13: 262-280.
Gelfand, S.B. and Mitter, S.K. (1993), Metropolis-type annealing algorithms for global optimization in Rd, SIAM J. of Control and Optimization 31(1): 111-131.
Jones, A.E.W. and Forbes, G.W. (1995), An adaptive simulated annealing algorithm for global optimization over continuous variables, J. of Global Optimization 6: 1-37.
Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983), Optimization by simulated annealing, Science 220(4598): 671-680.
Locatelli, M. (1996), Convergence properties of simulated annealing for continuous global optimization, J. of Applied Probability 33: 1127-1140.
Locatelli, M. (2000), Simulated annealing algorithms for continuous global optimization: convergence conditions, J. of Optimization Theory and Applications 104: 121-133.
Locatelli, M. (1999), On convergence of simulated annealing algorithms for continuous ´ global optimization, Technical Report 01-99, Dip. di Sistemi e Informatica, Universita di Firenze, also available at the web site www.dsi.unifi.it / users / locatell / dist4.ps
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N. and Teller, A.H. (1953), Equation of state calculations by fast computer machines, J. Chem. Phys. 21: 1087.
Romeijn, H.E. and Smith, R.L. (1994), Simulated annealing and adaptive search in global optimization, Probability in the Engineering and Informational Sciences 8: 571-590.
Romeijn, H.E. and Smith, R.L. (1994), Simulated annealing for constrained global optimization, J. of Global Optimization 5: 101-126.
Vanderbilt, D. and Louie, S.G. (1984), A Monte Carlo simulated annealing approach to optimization over continuous variables, J. of Computational Physics 56: 259-271.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Locatelli, M. Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization. Journal of Global Optimization 18, 219–233 (2000). https://doi.org/10.1023/A:1008339019740
Issue Date:
DOI: https://doi.org/10.1023/A:1008339019740