The University of Southampton
University of Southampton Institutional Repository

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

A simple two-module problem to exemplify building-block assembly under crossover
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 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.
161-171
Springer
Watson, Richard A.
ce199dfc-d5d4-4edf-bd7b-f9e224c96c75
Yao, X.
, et al.
Watson, Richard A.
ce199dfc-d5d4-4edf-bd7b-f9e224c96c75
Yao, X.
, et al.

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)

More information

Published date: 2004
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 262005
URI: https://eprints.soton.ac.uk/id/eprint/262005
PURE UUID: d49189c6-5ece-4009-b407-477f7e2d1d2e

Catalogue record

Date deposited: 21 Feb 2006
Last modified: 05 Oct 2018 11:35

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×