Elementary Bit String Mutation Landscapes

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

  author =       "W. B. Langdon",
  title =        "Elementary Bit String Mutation Landscapes",
  booktitle =    "Foundations of Genetic Algorithms",
  year =         "2011",
  editor =       "Hans-Georg Beyer and W. B. Langdon",
  pages =        "25--41",
  address =      "Schwarzenberg, Austria",
  month =        "5-9 " # jan,
  organisation = "SigEvo",
  publisher =    "ACM",
  keywords =     "genetic algorithms, genetic programming, search,
                 optimisation, graph theory, Laplacian, Hamming cube,
                 Walsh transform, fitness distance correlation,
                 elementary fitness autocorrelation, F.2.m, G.2.2,
                 G.1.6, G.3, I.2.8",
  isbn13 =       "978-1-4503-0633-1",
  URL =          "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/langdon_2011_foga.pdf",
  URL =          "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/langdon_2011_foga.ps.gz",
  DOI =          "doi:10.1145/1967654.1967658",
  size =         "17 pages",
  abstract =     "Genetic Programming parity with only XOR is not
                 elementary. GP parity can be represented as the sum of
                 k/2+1 elementary landscapes. Statistics, including
                 fitness distance correlation (FDC), of Parity's fitness
                 landscape are calculated. Using Walsh analysis the
                 eigen values and eigenvectors of the Laplacian of the
                 two bit, three bit, n-bit and mutation only Genetic
                 Algorithm fitness landscapes are given. Indeed all
                 elementary bit string landscapes are related to the
                 discrete Fourier functions. However most are rough
                 (lambda/d approx 1). Also in many cases fitness
                 autocorrelation falls rapidly with distance. GA runs
                 support eigenvalue/graph degree (lambda/d) as a measure
                 of the ruggedness of elementary landscapes for
                 predicting problem difficulty. The elementary needle in
                 a haystack (NIH) landscape is described.",
  notes =        "FOGA11 ACM order number 910114",

Genetic Programming entries for William B Langdon