Evolutionary Algorithms with On-the-Fly Population Size Adjustment

In this paper we evaluate on-the-fly population (re)sizing mechanisms for evolutionary algorithms (EAs). Evaluation is done by an experimental comparison, where the contestants are various existing methods and a new mechanism, introduced here. These comparisons consider EA performance in terms of success rate, speed, and solution quality, measured on a variety of fitness landscapes. These landscapes are created by a generator that allows for gradual tuning of their characteristics. Our test suite covers a wide span of landscapes ranging from a smooth one-peak landscape to a rugged 1000-peak one. The experiments show that the population (re)sizing mechanisms exhibit significant differences in speed, measured by the number of fitness evaluations to a solution and the best EAs with adaptive population resizing outperform the traditional genetic algorithm (GA) by a large margin.

[1]  Thomas Bäck,et al.  An Empirical Study on GAs "Without Parameters" , 2000, PPSN.

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[3]  A. E. Eiben,et al.  A critical note on experimental research methodology in EC , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  Heinz Mühlenbein,et al.  Adaptation of population sizes by competing subpopulations , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[5]  J. Davenport.  Editor , 1960 .

[6]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

[7]  N. Hansen,et al.  Sizing the population with respect to the local progress in (1,/spl lambda/)-evolution strategies-a theoretical analysis , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

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

[9]  Zbigniew Michalewicz,et al.  Self-Adaptive Genetic Algorithm for Numeric Functions , 1996, PPSN.

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

[11]  Thomas Bäck,et al.  Evolutionary Algorithms: The Role of Mutation and Recombination , 2000 .

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

[13]  Zbigniew Michalewicz,et al.  GAVaPS-a genetic algorithm with varying population size , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[14]  A. Rosa,et al.  An experimental study on dynamic random variation of population size , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[15]  J. Roughgarden,et al.  Theory of Population Genetics and Evolutionary Ecology , 1979 .

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

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

[18]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.