Estimation of distribution algorithms making use of both high quality and low quality individuals

To demonstrate the usefulness of low quality individuals for estimation of distribution algorithms, estimation of distribution algorithms using both high quality and low quality individuals are tested on several benchmark problems and their results are compared with those obtained by estimation of distribution algorithms where only high quality individuals are used. The usefulness of low quality individuals for speeding up the search of estimation of distribution algorithms is confirmed by the experimental results.

[1]  Yi Hong,et al.  Optimization of noisy fitness functions with univariate marginal distribution algorithm , 2005, 2005 IEEE Congress on Evolutionary Computation.

[2]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[3]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[4]  Yi Hong,et al.  Over-Selection: An attempt to boost EDA under small population size , 2007, 2007 IEEE Congress on Evolutionary Computation.

[5]  Heinz Mühlenbein,et al.  Application of the univariate marginal distribution algorithm to analog circuit design , 2002, Proceedings 2002 NASA/DoD Conference on Evolvable Hardware.

[6]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[7]  Pedro Larrañaga,et al.  Side chain placement using estimation of distribution algorithms , 2007, Artif. Intell. Medicine.

[8]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[9]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

[10]  Qingfu Zhang,et al.  Approaches to selection and their effect on fitness modelling in an Estimation of Distribution Algorithm , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[11]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[12]  Yuchou Chang,et al.  Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm , 2008, Pattern Recognit..

[13]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[14]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .