Simulated Annealing Algorithms for Continuous Global Optimization
In this chapter we will consider Simulated Annealing algorithms for continuous global optimization. After a description of the generic Simulated Annealing algorithm, its four main components (the distribution of the next candidate point, the acceptance function, the cooling schedule and the stopping criterion) will be analyzed in greater detail and some key ideas will be presented. In view of the strict connection with Simulated Annealing algorithms, we will also discuss the Langevin equation and its discretized version. The theoretical issue of convergence in probability to the set of global optima of the sequences of iterates and candidates will be explored. We will also give some insight into the properties of the objective functions for which a successful application of Simulated Annealing algorithms can be expected. Finally, some other issues such as applications, computational tests and parallelization of these algorithms will be discussed.
KeywordsLocal Search Simulated Annealing Global Optimization Feasible Region Langevin Equation
Unable to display preview. Download preview PDF.
- Bollweg, W., Kroll, H., and Maurer, H. (1997). Numerical prediction of crystal structures by simulated annealing. In Bomze, I.M., Csendes, T., Horst, R., and Pardalos, P.M., editors, Developments in Global Optimization. Kluwer Academic Publishers, Dordrecht.Google Scholar
- Desai, R. and Patil, R. (1996). SALO: combining simulated annealing and local optimization for efficient global optimization. In Proceedings of the 9th Florida AI Research Symposium (FLAIRS-’96), pages 233–237.Google Scholar
- Dixon, L.C.W. and Szegö, G.P. (1978). Towards Global Optimization 2. North-Holland, Amsterdam, The Netherlands.Google Scholar
- Gidas, B. (1985). Global minimization via the Langevin equation. In Proceedings of 24th Conf. on Decision and Control, pages 774–778, Ft. Lauderdale, FL.Google Scholar
- Hamma, B.S., Viitanen, S., and Torn, A. (1993). Parallel continuous simulated annealing for global optimization. Presented at the NATO Advanced Study Institute - Algorithms for Continuous Optimization: The State of the Art, Il Ciocco-Castelvecchio Pascoli, Italy.Google Scholar
- Horst, R. and Tuy, H. (1996). Global Optimization: Deterministic Approaches Springer, Heidelberg, 3rd enlarged edition.Google Scholar
- Locatelli, M. (2001). Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Mathematical Methods of Operations Research, to appear.Google Scholar
- Piccioni, M. (1987). A combined multistart-annealing algorithm for continuous global optimization. Technical Research Report 87–45, Systems and Research Center, The University of Maryland, College Park, MD.Google Scholar