The K landscapes: a tunably difficult benchmark for genetic programming

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

  author =       "Leonardo Vanneschi and Mauro Castelli and 
                 Luca Manzoni",
  title =        "The K landscapes: a tunably difficult benchmark for
                 genetic programming",
  booktitle =    "GECCO '11: Proceedings of the 13th annual conference
                 on Genetic and evolutionary computation",
  year =         "2011",
  editor =       "Natalio Krasnogor and Pier Luca Lanzi and 
                 Andries Engelbrecht and David Pelta and Carlos Gershenson and 
                 Giovanni Squillero and Alex Freitas and 
                 Marylyn Ritchie and Mike Preuss and Christian Gagne and 
                 Yew Soon Ong and Guenther Raidl and Marcus Gallager and 
                 Jose Lozano and Carlos Coello-Coello and Dario Landa Silva and 
                 Nikolaus Hansen and Silja Meyer-Nieberg and 
                 Jim Smith and Gus Eiben and Ester Bernado-Mansilla and 
                 Will Browne and Lee Spector and Tina Yu and Jeff Clune and 
                 Greg Hornby and Man-Leung Wong and Pierre Collet and 
                 Steve Gustafson and Jean-Paul Watson and 
                 Moshe Sipper and Simon Poulding and Gabriela Ochoa and 
                 Marc Schoenauer and Carsten Witt and Anne Auger",
  isbn13 =       "978-1-4503-0557-0",
  pages =        "1467--1474",
  keywords =     "genetic algorithms, genetic programming",
  month =        "12-16 " # jul,
  organisation = "SIGEVO",
  address =      "Dublin, Ireland",
  DOI =          "doi:10.1145/2001576.2001773",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  size =         "8 pages",
  abstract =     "The NK landscapes are a well known benchmark for
                 genetic algorithms (GAs) in which it is possible to
                 tune the ruggedness of the fitness landscape by simply
                 modifying the value of a parameter K. They have
                 successfully been used in many theoretical studies,
                 allowing researchers to discover interesting properties
                 of the GAs dynamics in presence of rugged landscapes. A
                 similar benchmark does not exist for genetic
                 programming (GP) yet. Nevertheless, during the EuroGP
                 conference debates of the last few years, the necessity
                 of defining new benchmark problems for GP has
                 repeatedly been expressed by a large part of the
                 attendees. This paper is intended to fill this gap, by
                 introducing an extension of the NK landscapes to tree
                 based GP, that we call K landscapes. In this benchmark,
                 epistasis are expressed as growing mutual interactions
                 between the substructures of a tree as the parameter K
                 increases. The fact that the problem becomes more and
                 more difficult as the value of K increases is
                 experimentally demonstrated. Interestingly, we also
                 show that GP bloats more and more as K increases.",
  notes =        "Also known as \cite{2001773} GECCO-2011 A joint
                 meeting of the twentieth international conference on
                 genetic algorithms (ICGA-2011) and the sixteenth annual
                 genetic programming conference (GP-2011)",

Genetic Programming entries for Leonardo Vanneschi Mauro Castelli Luca Manzoni