Effect of model complexity for estimation of distribution algorithm in NK landscapes

Evolutionary algorithms (EAs) have been widely proved to be effective in solving complex problems. Estimation of distribution algorithm (EDA) is an emerging EA, which manipulates probability models instead of genes for evolution EDA creates probability models based on the promising solution in the population and generates offspring by sampling from these models. The model complexity is a key factor in the performance of EDA. Complex models can express the relations among variables more accurately than simple models. However, for some problems with strong interaction among variables, building a model for all the relations becomes unrealistic and impractical due to its high computational cost and requirement for a large population size. This study aims to understand the behaviors of EDAs with different model complexities in NK landscapes. Specifically, this study compares the solution quality and convergence speed of univariate marginal distribution algorithm (UMDA), bivariate marginal distribution algorithm (BMDA), and estimation of Bayesian network (EBNA) in the NK landscapes with different parameter settings. The comparative results reveal that high complexity does not imply high performance: Simple model such as UMDA and BMDA can outperform complex mode like EBNA on the tested NK landscape problems. The results also show that BMDA achieves a stable high probability of generating the best solution and satisfactory solution quality; by contrast, the probability for EBNA drastically declines after some generations.

[1]  Roberto Santana,et al.  Analyzing the probability of the optimum in EDAs based on Bayesian networks , 2009, 2009 IEEE Congress on Evolutionary Computation.

[2]  Roberto Santana,et al.  Toward Understanding EDAs Based on Bayesian Networks Through a Quantitative Analysis , 2012, IEEE Transactions on Evolutionary Computation.

[3]  Pedro Larrañaga,et al.  Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks , 2000 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[6]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

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

[8]  Qingfu Zhang,et al.  On the limits of effectiveness in estimation of distribution algorithms , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[9]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

[11]  David E. Goldberg,et al.  Model accuracy in the Bayesian optimization algorithm , 2011, Soft Comput..

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

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

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

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

[16]  E. D. Weinberger,et al.  The NK model of rugged fitness landscapes and its application to maturation of the immune response. , 1989, Journal of theoretical biology.

[17]  IEEE Symposium on Foundations of Computational Intelligence, FOCI 2013, Singapore, Singapore, April 16-19, 2013 , 2013, FOCI.

[18]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[19]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[20]  David E. Goldberg,et al.  Hierarchical Bayesian Optimization Algorithm , 2006, Scalable Optimization via Probabilistic Modeling.

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

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