Neutrality in Evolutionary Algorithms... What do we know?

Created by W.Langdon from gp-bibliography.bib Revision:1.4549

  author =       "Edgar Galvan-Lopez and Riccardo Poli and 
                 Ahmed Kattan and Michael O'Neill and Anthony Brabazon",
  title =        "Neutrality in Evolutionary Algorithms... What do we
  journal =      "Evolving Systems",
  year =         "2011",
  volume =       "2",
  number =       "3",
  pages =        "145--163",
  month =        sep,
  keywords =     "genetic algorithms, genetic programming, Neutrality,
                 Phenotypic mutation rates, Problem hardness,
                 Genotype-phenotype mappings, Evolutionary algorithms",
  ISSN =         "1868-6478",
  DOI =          "doi:10.1007/s12530-011-9030-5",
  size =         "19 pages",
  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 the community needs to address.",

Genetic Programming entries for Edgar Galvan Lopez Riccardo Poli Ahmed Kattan Michael O'Neill Anthony Brabazon