Population Sizing to Go: Online Adaptation Using Noise and Substructural Measurements

This chapter presents an online population size adjustment scheme for genetic algorithms. It utilizes substructural identification techniques to calculate the parameters used in facetwise population-sizing models. The methodology is demonstrated using the dependency structure matrix genetic algorithm on a set of boundedly-difficult problems. Empirical results indicate that the proposed method is both efficient and robust. If the initial population size is too large, the proposed method automatically decreases the population size, and thereby yields significant savings in the number of function evaluations required to obtain high-quality solutions; on the other hand, if the initial population size is too small, the proposed scheme increases the population size on-the-fly, thereby avoiding premature convergence.

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

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

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

[4]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[5]  David E. Goldberg,et al.  Genetic Algorithm Design Inspired by Organizational Theory: Pilot Study of a Dependency Structure Matrix Driven Genetic Algorithm , 2003, GECCO.

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

[7]  Fernando G. Lobo,et al.  A parameter-less genetic algorithm , 1999, GECCO.

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

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

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

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

[12]  Martin Pelikan,et al.  Parameter-less Genetic Algorithm: A Worst-case Time and Space Complexity Analysis , 2000, GECCO.

[13]  Dirk Thierens,et al.  Convergence Models of Genetic Algorithm Selection Schemes , 1994, PPSN.

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

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

[16]  D. V. Steward,et al.  The design structure system: A method for managing the design of complex systems , 1981, IEEE Transactions on Engineering Management.

[17]  David E. Goldberg,et al.  A Genetic Algorithm for Developing Modular Product Architectures , 2003 .

[18]  Robert E. Smith,et al.  Adaptively Resizing Populations: Algorithm, Analysis, and First Results , 1993, Complex Syst..

[19]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[20]  David E. Goldberg Using Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem , 1999, GECCO.

[21]  Martin Pelikan,et al.  Parameter-Less Hierarchical BOA , 2004, GECCO.

[22]  Robert E. Smith,et al.  Adaptively Resizing Populations: An Algorithm and Analysis , 1993, ICGA.