Analysis of ideal recombination on random decomposable problems
8 April 2006Sastry, K., Pelikan, M., Goldberg, D. E. (2006). IlliGAL report no. 2006016, and MEDAL report no. 2006004. University of Illinois at Urbana Champaign. [Full paper - PDF] [Full paper - PS] .
Abstract:
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.
Related Posts:
- Empirical Analysis of ideal recombination on random decomposable problems
- Hierarchical BOA on random decomposable problems
- Generator and interface for random decomposable problems in C
- Substructrual surrogates for learning decomposable classification problems: implementation and first results
- Linkage learning, overlapping building blocks, and a systematic strategy for scalable recombination
No comments yet
