ABSTRACT
Traditional evolutionary algorithms are powerful problem solvers that have several fixed parameters which require prior specification. Determining good values for any of these parameters can be difficult, as these parameters are generally very sensitive, requiring expert knowledge to set optimally without extensive use of trial and error. Parameter control is a promising approach to achieving this automation and has the added potential of increasing EA performance based on both theoretical and empirical evidence that the optimal values of EA strategy parameters change during the course of executing an evolutionary run. While many methods of parameter control have been published that focus on removing the population size parameter, μ, all hampered by a variety of problems. This paper investigates the benefits of making μ a dynamic parameter and introduces two novel methods for population control. These methods are then compared to state-of-the-art population sizing EAs, exploring the strengths and weaknesses of each.
- J. Arabas, Z. Michalewicz, and J. Mulawka. GAVaPS-a genetic algorithm with varying population size. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 73--78, 1994.Google ScholarCross Ref
- T. Back, A. Eiben, and N. A. L. van der Vaart. An empirical study on GAs without parameters. In Proceedings of PPSN VI: the Sixth International Conference on Parallel Problem Solving from Nature, pages 315--324, 2000. Google ScholarDigital Library
- J. Clune, S. Goings, B. Punch, and E. Goodman. Investigations in meta-GAs: panaceas or pipe dreams? In Proceedings of GECCO 2005 Workshops on Genetic and Evolutionary Computation, pages 235--241, 2005. Google ScholarDigital Library
- A. Eiben, M. Schut, and A. deWilde. Is self-adaptation of selection pressure and population size possible? - a case study. In Proceedings of PPSN IX: the Ninth International Conference on Parallel Problem Solving from Nature, pages 900--909, 2006. Google ScholarDigital Library
- A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer, 2007. Google ScholarDigital Library
- G. Harik and F. Lobo. A parameter-less genetic algorithm. In Proceedings of GECCO 1999: the Genetic and Evolutionary Computation Conference, volume 1, pages 258--265, 1999.Google Scholar
- E. Holdener. The Art of Parameterless Evolutionary Algorithms. PhD thesis, Missouri University of Science and Technology, 2008.Google Scholar
- K. A. D. Jong, M. A. Potter, and W. M. Spears. Using problem generators to explore the effects of epistasis. In Proceedings of the International Conference on Genetic Algorithms, pages 338--345, 1997.Google Scholar
- F. G. Lobo and C. F. Lima. Revisiting evolutionary algorithms with On-the-fly Population Size Adjustment. In Proceedings of GECCO 2006: the Genetic and Evolutionary Computation Conference, pages 1241--1248, 2006. Google ScholarDigital Library
- V. Nannen, S. K. Smit, and A. E. Eiben. Costs and Benefits of Tuning Parameters of Evolutionary Algorithms. In Proceedings of PPSN X: the Tenth International Conference on Parallel Problem Solving from Nature, pages 528--538, 2008.Google ScholarCross Ref
- E. A. Smorodkina and D. R. Tauritz. Greedy Population Sizing for Evolutionary Algorithms. In Proceedings of CEC 2007 - IEEE Congress on Evolutionary Computation, pages 2181--2187, 2007.Google ScholarCross Ref
Index Terms
An exploration into dynamic population sizing
Recommendations
Revisiting evolutionary algorithms with on-the-fly population size adjustment
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computationIn an evolutionary algorithm, the population has a very important role as its size has direct implications regarding solution quality, speed, and reliability. Theoretical studies have been done in the past to investigate the role of population sizing in ...
Futility-based offspring sizing
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationParameter control in evolutionary algorithms (EAs) has been shown to be beneficial; however, the control of offspring size has so far received very little attention. This paper introduces Futility-Based Offspring Sizing (FuBOS), a method for controlling ...
A new approach to population sizing for memetic algorithms: A case study for the multidimensional assignment problem
Memetic algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting the population size is one of the most important among them. Most of the ...
Comments