License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10361.2
URN: urn:nbn:de:0030-drops-28146
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2814/
Go to the corresponding Portal

Langdon, William

2-bit Flip Mutation Elementary Fitness Landscapes

pdf-format:
10361.LangdonWilliam.Paper.2814.pdf (0.3 MB)

Abstract

Genetic Programming parity is not elementary.
GP parity cannot be represented as the sum of a small number
of elementary landscapes.
Statistics, including fitness distance correlation,
of Parity's fitness landscape are calculated.
Using Walsh analysis the
eigen values and eigenvectors of the Laplacian of the two bit flip
fitness landscape are given
and a ruggedness measure for elementary landscapes is proposed.
An elementary needle in a haystack (NIH) landscape is given.

BibTeX - Entry

@InProceedings{langdon:DagSemProc.10361.2,
  author =	{Langdon, William},
  title =	{{2-bit Flip Mutation Elementary Fitness Landscapes}},
  booktitle =	{Theory of Evolutionary Algorithms},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10361},
  editor =	{Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2814},
  URN =		{urn:nbn:de:0030-drops-28146},
  doi =		{10.4230/DagSemProc.10361.2},
  annote =	{Keywords: Genetic Algorithms, Genetic Programming, search, optimisation, graph theory, Laplacian, Hamming cube}
}

Keywords: Genetic Algorithms, Genetic Programming, search, optimisation, graph theory, Laplacian, Hamming cube
Collection: 10361 - Theory of Evolutionary Algorithms
Issue Date: 2010
Date of publication: 24.11.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI