A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover
Watson, Richard A., Yao, Xin and al, et (eds.) (2004) A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover. Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN-VIII), 161-171.
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 en-able 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.
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||21 Feb 2006|
|Last Modified:||18 Aug 2012 04:02|
|Contributors:||Watson, Richard A. (Author)
Yao, Xin (Editor)
al, et (Editor)
|Further Information:||Google Scholar|
|ISI Citation Count:||3|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)