A GP neutral function for the artificial ANT problem

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

  author =       "Esteban Ricalde and Katya Rodr\'{\i}guez V\'{a}zquez",
  title =        "A {GP} neutral function for the artificial {ANT}
  booktitle =    "Late breaking paper at Genetic and Evolutionary
                 Computation Conference {(GECCO'2007)}",
  year =         "2007",
  month =        "7-11 " # jul,
  editor =       "Peter A. N. Bosman",
  isbn13 =       "978-1-59593-698-1",
  pages =        "2565--2571",
  address =      "London, United Kingdom",
  keywords =     "genetic algorithms, genetic programming, evolutionary
                 computation, neutrality",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p2565.pdf",
  DOI =          "doi:10.1145/1274000.1274026",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, USA",
  abstract =     "This paper introduces a function that increases the
                 amount of neutrality (inactive code in Genetic
                 Programming) for the Artificial Ant Problem. The
                 objective of this approach is to try to smooth the
                 ridged fitness landscape of the Santa Fe trail.

                 Several experiments were carried out with different
                 crossover and mutation rates, in order to identify the
                 better settings to solve this problem and to compare
                 the normal representation and the one proposed in this
                 paper. The results indicate that the proposed approach
                 is better than the conventional one.

                 Also the difference between per individual and per node
                 mutation is showed and a way to relate them is pointed
  notes =        "Distributed on CD-ROM at GECCO-2007 ACM Order No.

Genetic Programming entries for Esteban Ricalde Katya Rodriguez-Vazquez