Adaptive population sizing schemes in genetic algorithms

Abstract

This chapter presents a review of adaptive population sizing schemes used in genetic algorithms. We start by briefly revisiting theoretical models which rely on a facetwise design decomposition, and then move on to various self-adjusting population sizing schemes that have been proposed in the literature. For each method, the major advantages and disadvantages are discussed. The chapter ends with recommendations for those who design and compare self-adjusting population sizing mechanisms for genetic and evolutionary algorithms. © Springer-Verlag Berlin Heidelberg 2007.