Duplication of Coding Segments in Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.7970
- @TechReport{Haynes:1996:DCSa,
-
author = "Thomas Haynes",
-
title = "Duplication of Coding Segments in Genetic
Programming",
-
number = "UTULSA-MCS-96-03",
-
institution = "The University of Tulsa",
-
month = mar # " 11,",
-
year = "1996",
-
keywords = "genetic algorithms, genetic programming",
-
notes = "Longer version of AAAI '96 paper
\cite{Haynes:1996:DCSb}",
-
broken = "http://euler.mcs.utulsa.edu/~haynes/tr_duplicate.ps",
-
URL = "http://citeseer.ist.psu.edu/cache/papers/cs/989/http:zSzzSzwww.umsl.eduzSz~hayneszSztr_duplicate.pdf/haynes96duplication.pdf",
-
URL = "http://citeseer.ist.psu.edu/haynes96duplication.html",
-
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.",
- }
Genetic Programming entries for
Thomas D Haynes
Citations