A simple two-module problem to exemplify building-block assembly under crossover

Watson, Richard A. (2004) A simple two-module problem to exemplify building-block assembly under crossover. Yao, X. and , et al. (eds.) In Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. vol. 3242, Springer. pp. 161-171 . (doi:10.1007/978-3-540-30217-9_17).

Record type: Conference or Workshop Item (Paper)

Abstract

Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa in other landscapes. Despite an extensive literature on the subject, and recent proofs of a principled distinction in the abilities of crossover and non-crossover algorithms for a particular theoretical landscape, building general intuitions about when and why crossover performs well when it does is a different matter. In particular, the proposal that crossover might enable the assembly of good building-blocks has been difficult to verify despite many attempts at idealized building-block landscapes. Here we show the first example of a two-module problem that shows a principled advantage for cross-over. This allows us to understand building-block assembly under crossover quite straightforwardly and build intuition about more general landscape classes favoring crossover or disfavoring it.

Text

watson_astmp_ppsn_2004.pdf - Other

Download (196kB)