A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover

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 crossover. 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.

• Type: Conference
• Year: 2004
• Where: PPSN
• Authors: Richard A. Watson
• Keywords: Classes Favoring Crossover, Crossover, Distributed And Parallel Computing, Genetic Algorithm, PPSN 2004