Population Sizing for Entropy-based Model Building in Genetic Algorithms

This paper presents a population-sizing model for the entropy-based model building in genetic algorithms. Specifically, the population size required for building an accurate model is investigated. The effect of the selection pressure on population sizing is also incorporated. The proposed model indicates that the population size required for building an accurate model scales as £(mlog m), where m is the number of substructures and proportional to the problem size. Experiments are conducted to verify the derivations, and the results agree with the proposed model.

[1]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

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

[3]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[4]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[7]  Colin R. Reeves,et al.  Using Genetic Algorithms with Small Populations , 1993, ICGA.

[8]  Thomas Bck.  Generalized convergence models for tournament|and (1; ?)|selection , 1995 .

[9]  Thomas Bäck,et al.  Generalized Convergence Models for Tournament- and (mu, lambda)-Selection , 1995, ICGA.

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

[11]  Gernot D. Kleiter,et al.  The posterior probability of Bayes nets with strong dependences , 1999, Soft Comput..

[12]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

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

[14]  Masaharu Munetomo,et al.  Identifying Linkage Groups by Nonlinearity/Non-monotonicity Detection , 1999 .

[15]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

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

[17]  Thomas D. LaToza,et al.  On the supply of building blocks , 2001 .

[18]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

[19]  下平 丕作士,et al.  The Genetic and Evolutionary Computation Conference , 2002 .

[20]  Ivo Everts,et al.  Extended Compact Genetic Algorithm , 2004 .

[21]  David E. Goldberg,et al.  Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods , 2004, GECCO.

[22]  Alden H. Wright,et al.  An Estimation of Distribution Algorithm Based on Maximum Entropy , 2004, GECCO.

[23]  Marco Zaffalon,et al.  Distribution of mutual information from complete and incomplete data , 2004, Comput. Stat. Data Anal..

[24]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[25]  Petr Posík.  Estimation of Distribution Algorithms , 2006 .

[26]  David E. Goldberg,et al.  Conquering hierarchical difficulty by explicit chunking: substructural chromosome compression , 2006, GECCO '06.

[27]  Prabhas Chongstitvatana,et al.  Building-block Identification by Simultaneity Matrix , 2007, Soft Comput..