A Structure Preserving Crossover In Grammatical Evolution

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

  author =       "Robin Harper and Alan Blair",
  title =        "A Structure Preserving Crossover In Grammatical
  booktitle =    "Proceedings of the 2005 IEEE Congress on Evolutionary
  year =         "2005",
  editor =       "David Corne and Zbigniew Michalewicz and 
                 Marco Dorigo and Gusz Eiben and David Fogel and Carlos Fonseca and 
                 Garrison Greenwood and Tan Kay Chen and 
                 Guenther Raidl and Ali Zalzala and Simon Lucas and Ben Paechter and 
                 Jennifier Willies and Juan J. Merelo Guervos and 
                 Eugene Eberbach and Bob McKay and Alastair Channon and 
                 Ashutosh Tiwari and L. Gwenn Volkert and 
                 Dan Ashlock and Marc Schoenauer",
  volume =       "3",
  pages =        "2537--2544",
  address =      "Edinburgh, UK",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "2-5 " # sep,
  organisation = "IEEE Computational Intelligence Society, Institution
                 of Electrical Engineers (IEE), Evolutionary Programming
                 Society (EPS)",
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming, Grammatical
  ISBN =         "0-7803-9363-5",
  DOI =          "doi:10.1109/CEC.2005.1555012",
  abstract =     "Grammatical Evolution is an algorithm for evolving
                 complete programs in an arbitrary language. By using a
                 Backus Naur Form grammar the advantages of typing are
                 achieved. A separation of genotype and phenotype allows
                 the implementation of operators that manipulate (for
                 instance by crossover and mutation) the genotype (in
                 Grammatical Evolution - a sequence of bits)
                 irrespective of the genotype to phenotype mapping (in
                 Grammatical Evolution - an arbitrary grammar). This
                 paper introduces a new type of crossover operator for
                 Grammatical Evolution. The crossover operator uses
                 information automatically extracted from the grammar to
                 minimise any destructive impact from the crossover. The
                 information, which is extracted at the same time as the
                 genome is initially decoded, allows the swapping
                 between entities of complete expansions of
                 non-terminals in the grammar without disrupting useful
                 blocks of code on either side of the two point
                 crossover. In the domains tested, results confirm that
                 the crossover is (i) more productive than
                 hill-climbing; (ii) enables populations to continue to
                 evolve over considerable numbers of generations without
                 intron bloat; and (iii) allows populations (in the
                 domains tested) to reach higher fitness levels,
  notes =        "CEC2005 - A joint meeting of the IEEE, the IEE, and
                 the EPS.

                 LHS Replacement operator. Minesweeper, Taxi problems.
                 Santa Fe ant too easy for GE. 2500 generations.",

Genetic Programming entries for Robin Harper Alan Blair