Learning probability distributions in continuous evolutionary algorithms – a comparative review

• Published in: Natural computing Vol. 3; no. 1; pp. 77 - 112
• Main Authors: Kern, Stefan, Müller, Sibylle D., Hansen, Nikolaus, Büche, Dirk, Ocenasek, Jiri, Koumoutsakos, Petros
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Nature B.V 01.03.2004
• Subjects: Algorithms; Evolutionary algorithms; Formulations; Learning; Mathematical analysis; Mathematical models; Optimization; Sampling; Studies
• ISSN: 1567-7818; 1572-9796
• DOI: 10.1023/B:NACO.0000023416.59689.4e

We present a comparative review of Evolutionary Algorithms that generate new population members by sampling a probability distributionconstructed during the optimization process. We present a unifying formulation for five such algorithms that enables us to characterize them based on the parametrization of the probability distribution, the learning methodology, and the use of historical information.The algorithms are evaluated on a number of test functions in order to assess their relative strengths and weaknesses. This comparative reviewhelps to identify areas of applicability for the algorithms and to guidefuture algorithmic developments.[PUBLICATION ABSTRACT]