Global optimization and simulated annealing

A. Dekkers, E.H.L. Aarts

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

315 Citaten (Scopus)
2 Downloads (Pure)


In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of n in which some real valued functionf assumes its optimal (maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as originally given for discrete optimization problems. The mathematical formulation is extended to continuous optimization problems, and we prove asymptotic convergence to the set of global optima. Furthermore, we discuss an implementation of the algorithm and compare its performance with other well-known algorithms. The performance evaluation is carried out for a standard set of test functions from the literature.
Originele taal-2Engels
Pagina's (van-tot)367-393
Aantal pagina's27
TijdschriftMathematical Programming
Nummer van het tijdschrift3
StatusGepubliceerd - 1991

Vingerafdruk Duik in de onderzoeksthema's van 'Global optimization and simulated annealing'. Samen vormen ze een unieke vingerafdruk.

Citeer dit