Population Implosion in Genetic Programming

With the exception of a small body of adaptive-parameter literature, evolutionary computation has traditionally favored keeping the population size constant through the course of the run. Unfortunately, genetic programming has an aging problem: for various reasons, late in the run the technique become less effective at optimization. Given a fixed number of evaluations, allocating many of them late in the run may thus not be a good strategy. In this paper we experiment with gradually decreasing the population size throughout a genetic programming run, in order to reallocate more evaluations to early generations. Our results show that over four problem domains and three different numbers of evaluations, decreasing the population size is always as good as, and frequently better than, various fixed-sized population strategies.

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: Sean Luke, Gabriel Catalin Balan, Liviu Panait
• Keywords: GECCO 2003, Genetic Programming, Population Size, Population Size Constant