Kumara Sastry

Linkage learning, overlapping building blocks, and a systematic strategy for scalable recombination

Yu, T.-L., Sastry, K., Goldberg, D. E. (2005). Proceedings of the Genetic and Evolutionary Computation Conference. 1217—1224. [Full paper - PDF] [Full paper - PS] [Presentation slides].

Abstract:
This paper aims at an important, but poorly studied area in genetic algorithm (GA) field: How to design the crossover operator for problems with overlapping building blocks (BBs). To investigate this issue systematically, the relationship between an inaccurate linkage model and the convergence time of GA is studied. Specifically, the effect of the error of so-called false linkage is analogized to a lower exchange probability of uniform crossover. The derived qualitative convergence-time model is used to develop a scalable recombination strategy for problems with overlapping BBs. A set of problems with circularly overlapping BBs exemplify the recombination strategy.

Related Posts:

• Influence of selection and replacement strategies on linkage learning in BOA
• A survey of linkage learning techniques in genetic and evolutionary algorithms
• Influence of selection and replacement strategies on linkage learning in BOA
• Probabilistic model building and competent genetic programming
• Do not match, inherit: Fitness surrogates for genetics-based machine learning techniques

Comments are closed.