Fitness landscapes and problem hardness in evolutionary computation

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

  author =       "Leonardo Vanneschi and Sebastien Verel",
  title =        "Fitness landscapes and problem hardness in
                 evolutionary computation",
  booktitle =    "Genetic and Evolutionary Computation Conference
                 {(GECCO2007)} tutorial presentations",
  year =         "2007",
  month =        "7-11 " # jul,
  editor =       "Aniko Ekart",
  isbn13 =       "978-1-59593-698-1",
  pages =        "3690--3733",
  address =      "London, United Kingdom",
  keywords =     "genetic algorithms, genetic programming, evolutionary
                 algorithm, fitness landscape, problem Hardness",
  URL =          "",
  DOI =          "doi:10.1145/1274000.1274130",
  URL =          "",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, USA",
  notes =        "Intro-PART2-Vanneschi.pdf are GP theory slides:
                 Fitness Distance Correlation (fdc). Structural Distance
                 \cite{ekart:2002:EuroGP}: Structural Mutation Genetic
                 Programming (SMGP).

                 Negative Slope Coefficient (nsc). Fitness cloud. nsc:
                 Even Parity Problem and Artificial Ant on the Santa Fe
                 Trail, \cite{1277209} GECCO-2007, page 1341 'negative
                 slope coefficient is an empirical measure of problem
                 hardness based the analysis of offspring-fitness vs.
                 parent-fitness scatterplots'.

                 Crossover \cite{eurogp:GustafsonV05} SCD

                 Distributed on CD-ROM at GECCO-2007 ACM Order No.

Genetic Programming entries for Leonardo Vanneschi Sebastien Verel