Duplication of Coding Segments in Genetic Programming

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

  author =       "Thomas Haynes",
  title =        "Duplication of Coding Segments in Genetic
  booktitle =    "Proceedings of the Thirteenth National Conference on
                 Artificial Intelligence",
  month =        "4-6 " # aug,
  year =         "1996",
  address =      "Portland, USA",
  volume =       "1",
  publisher =    "AAAI Press / MIT Press",
  ISBN =         "0-262-51091-X",
  pages =        "344--349",
  keywords =     "genetic algorithms, genetic programming",
  notes =        "see also tech report \cite{Haynes:1996:DCSa}",
  abstract =     "Research into the utility of non--coding segments, or
                 introns, in genetic--based encodings has shown that
                 they expedite the evolution of solutions in domains by
                 protecting building blocks against destructive
                 crossover. We consider a genetic programming system
                 where non--coding segments can be removed, and the
                 resultant chromosomes returned into the population.
                 This parsimonious repair leads to premature
                 convergence, since as we remove the naturally occurring
                 non--coding segments, we strip away their protective
                 backup feature. We then duplicate the coding segments
                 in the repaired chromosomes, and place the modified
                 chromosomes into the population. The duplication method
                 significantly improves the learning rate in the domain
                 we have considered. We also show that this method can
                 be applied to other domains.",
  URL =          "http://citeseer.ist.psu.edu/haynes96duplication.html",

Genetic Programming entries for Thomas D Haynes