Over-Selection: An attempt to boost EDA under small population size

Estimation of distribution algorithm (EDA) is a new class of evolutionary algorithms with a wide range of real-world applications. However, it has been well known that the performance of EDA is not satisfactory enough if its population size is small. But to simply increase its population size may result in slow convergence. To the best knowledge of the authors', very few work has been done on improving the performance of EDA under small population size. This paper illustrates why EDA does not work well under small population size and proposes a novel approach termed as Over-Selection to boost EDA under small population size. Experimental results on several benchmark problems demonstrate that Over-Selection based EDA is often able to achieve a better solution without significantly increasing its time consumption when compared with the original version of EDA.

[1]  Hussein A. Abbass,et al.  Sub-structural niching in estimation of distribution algorithms , 2005, GECCO '05.

[2]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[3]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[5]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[6]  J. McCall,et al.  Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

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

[9]  Pedro Larrañaga,et al.  GA-EDA: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms , 2004 .

[10]  Hisashi Handa.  Estimation of Distribution Algorithms with Mutation , 2005, EvoCOP.

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

[12]  Yi Hong,et al.  A comprehensive comparison between real population based tournament selection and virtual population based tournament selection , 2007, 2007 IEEE Congress on Evolutionary Computation.

[13]  Marcus Gallagher,et al.  Real-valued Evolutionary Optimization using a Flexible Probability Density Estimator , 1999, GECCO.

[14]  David E. Goldberg,et al.  Hierarchical Problem Solving and the Bayesian Optimization Algorithm , 2000, GECCO.

[15]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[16]  Roberto Santana.  A Markov Network Based Factorized Distribution Algorithm for Optimization , 2003, ECML.

[17]  Gilbert Syswerda,et al.  Simulated Crossover in Genetic Algorithms , 1992, FOGA.

[18]  Michael D. Lee,et al.  A Simple Method for Generating Additive Clustering Models with Limited Complexity , 2002, Machine Learning.

[19]  Marcus Gallagher,et al.  On the importance of diversity maintenance in estimation of distribution algorithms , 2005, GECCO '05.

[20]  D. E. Goldberg,et al.  Genetic Algorithm in Search , 1989 .

[21]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

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

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

[24]  Heinz Mühlenbein,et al.  Evolutionary optimization using graphical models , 2009, New Generation Computing.

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

[26]  Martin Pelikan,et al.  Bayesian Optimization Algorithm , 2005 .

[27]  Jonathan L. Shapiro,et al.  Diversity Loss in General Estimation of Distribution Algorithms , 2006, PPSN.

[28]  Yi Hong,et al.  Genetic drift in univariate marginal distribution algorithm , 2005, GECCO '05.

[29]  Yi Hong,et al.  Unit Bit Importance Evolutionary Algorithm , 2007, Soft Comput..

[30]  Dirk Thierens,et al.  Expanding from Discrete to Continuous Estimation of Distribution Algorithms: The IDEA , 2000, PPSN.

[31]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[32]  David E. Goldberg,et al.  Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence , 2000, GECCO.

[33]  Lothar Thiele,et al.  A Mathematical Analysis of Tournament Selection , 1995, ICGA.

[34]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..