On the Avoidance of Fruitless Wraps in Grammatical Evolution

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

@InProceedings{ryan2:2003:gecco,
  author =       "Conor Ryan and Maarten Keijzer and Miguel Nicolau",
  title =        "On the Avoidance of Fruitless Wraps in Grammatical
                 Evolution",
  booktitle =    "Genetic and Evolutionary Computation -- GECCO-2003",
  editor =       "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and 
                 D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and 
                 R. Standish and G. Kendall and S. Wilson and 
                 M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and 
                 A. C. Schultz and K. Dowsland and N. Jonoska and 
                 J. Miller",
  year =         "2003",
  pages =        "1752--1763",
  address =      "Chicago",
  publisher_address = "Berlin",
  month =        "12-16 " # jul,
  volume =       "2724",
  series =       "LNCS",
  ISBN =         "3-540-40603-4",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, grammatical
                 evolution",
  DOI =          "doi:10.1007/3-540-45110-2_67",
  abstract =     "Grammatical Evolution (GE) is an evolutionary system
                 that employs variable length linear chromosomes to
                 represent computer programs. GE uses the individuals to
                 produce derivation trees that adhere to a Backus Naur
                 Form grammar, which are then mapped onto a program. One
                 unusual characteristic of the system is the manner in
                 which chromosomes can be {"}wrapped{"}, that is, if an
                 individual has used up all of its genes before a
                 program is completely mapped, the chromosome is reread.
                 While this doesn't guarantee that an individual will
                 map, prior work suggested that wrapping is beneficial
                 for the system, both in terms of increased success
                 rates and a reduced number of invalid individuals.
                 However, there has been no research into the number of
                 times an individual should be wrapped before the system
                 gives up, and an arbitrary upper limit is usually
                 chosen.

                 This paper discusses the different types of grammars
                 that could be used with this system, and indicates the
                 circumstances under which individuals will fail. It
                 then presents a heuristic to minimize the number of
                 wraps that have to be made before the system can
                 determine that an individual will fail. It is shown
                 that this can drastically reduce the amount of wrapping
                 on a pathologically difficult problem, as well as on
                 two classes of grammar often used by the system.",
  notes =        "GECCO-2003. A joint meeting of the twelfth
                 International Conference on Genetic Algorithms
                 (ICGA-2003) and the eighth Annual Genetic Programming
                 Conference (GP-2003)",
}

Genetic Programming entries for Conor Ryan Maarten Keijzer Miguel Nicolau

Citations