Ignoble Trails - Where Crossover Is Provably Harmful

  • J. Neal Richter
  • Alden Wright
  • John Paxton
Conference paper

DOI: 10.1007/978-3-540-87700-4_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)
Cite this paper as:
Richter J.N., Wright A., Paxton J. (2008) Ignoble Trails - Where Crossover Is Provably Harmful. In: Rudolph G., Jansen T., Beume N., Lucas S., Poloni C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg

Abstract

Beginning with the early days of the genetic algorithm and the schema theorem it has often been argued that the crossover operator is the more important genetic operator. The early Royal Road functions were put forth as an example where crossover would excel, yet mutation based EAs were subsequently shown to experimentally outperform GAs with crossover on these functions. Recently several new Royal Roads have been introduced and proved to require expected polynomial time for GAs with crossover, while needing exponential time to optimize for mutation-only EAs. This paper does the converse, showing proofs that GAs with crossover require exponential optimization time on new Ignoble Trail functions while mutation based EAs optimize them efficiently.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • J. Neal Richter
    • 1
  • Alden Wright
    • 2
  • John Paxton
    • 1
  1. 1.Montana State UniversityUSA
  2. 2.University of MontanaUSA

Personalised recommendations