Sciweavers

GECCO
2003
Springer

Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage

14 years 4 months ago
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. The population-sizing model suggests that for moderate-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for single-point crossover scales as O 2k
Kumara Sastry, David E. Goldberg
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GECCO
Authors Kumara Sastry, David E. Goldberg
Comments (0)