Evolving Systems

, Volume 2, Issue 3, pp 145–163

Neutrality in evolutionary algorithms… What do we know?

  • Edgar Galván-López
  • Riccardo Poli
  • Ahmed Kattan
  • Michael O’Neill
  • Anthony Brabazon
Review

Abstract

Over the last years, the effects of neutrality have attracted the attention of many researchers in the Evolutionary Algorithms (EAs) community. A mutation from one gene to another is considered as neutral if this modification does not affect the phenotype. This article provides a general overview on the work carried out on neutrality in EAs. Using as a framework the origin of neutrality and its study in different paradigms of EAs (e.g., Genetic Algorithms, Genetic Programming), we discuss the most significant works and findings on this topic. This work points towards open issues, which we belive the community needs to address.

Keywords

Neutrality Phenotypic mutation rates Problem hardness Genotype–phenotype mappings Evolutionary algorithms 

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  • Edgar Galván-López
    • 1
  • Riccardo Poli
    • 2
  • Ahmed Kattan
    • 2
  • Michael O’Neill
    • 1
  • Anthony Brabazon
    • 1
  1. 1.Natural Computing and Research Application GroupUniversity College DublinDublinIreland
  2. 2.School of Computer Science and Electronic EngineeringUniversity of EssexColchesterUK

Personalised recommendations