On the importance of diversity maintenance in estimation of distribution algorithms

25 June 2005

proceedings article
Published by Association for Computing Machinery (ACM)

p. 719-726
https://doi.org/10.1145/1068009.1068129

Abstract

The development of Estimation of Distribution Algorithms (EDAs) has largely been driven by using more and more complex statistical models to approximate the structure of search space. However, there are still problems that are difficult for EDAs even with models capable of capturing high order dependences. In this paper, we show that diversity maintenance plays an important role in the performance of EDAs. A continuous EDA based on the Cholesky decomposition is tested on some well-known difficult benchmark problems to demonstrate how different diversity maintenance approaches could be applied to substantially improve its performance.

Keywords

This publication has 4 references indexed in Scilit:

Clustering and Learning Gaussian Distribution for Continuous Optimization
IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2005
Learning probability distributions in continuous evolutionary algorithms – a comparative review
Natural Computing, 2004
Stochastic Simulation
Wiley Series in Probability and Statistics, 1987
On Information and Sufficiency
The Annals of Mathematical Statistics, 1951