Sciweavers

Share
GECCO
2007
Springer

Empirical analysis of ideal recombination on random decomposable problems

9 years 7 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifically, additively decomposable problems of order k whose subsolution fitnesses are sampled from the standard uniform distribution U[0, 1] are analyzed. The scalability of the selectorecombinative GA is investigated for 10,000 rADP instances. The validity of facetwise models in bounding the population size, run duration, and the number of function evaluations required to successfully solve the problems is also verified. Finally, rADP instances that are easiest and most difficult are also investigated. Categories and Subject Descriptors
Kumara Sastry, Martin Pelikan, David E. Goldberg
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where GECCO
Authors Kumara Sastry, Martin Pelikan, David E. Goldberg
Comments (0)
books