Schema Theory for Genetic Programming with One-point Crossover and Point Mutation

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

@Article{poli:1998:schema,
  author =       "Riccardo Poli and William B. Langdon",
  title =        "Schema Theory for Genetic Programming with One-point
                 Crossover and Point Mutation",
  journal =      "Evolutionary Computation",
  year =         "1998",
  volume =       "6",
  number =       "3",
  pages =        "231--252",
  keywords =     "genetic algorithms, genetic programming, Schema
                 Theorem, One-point Crossover",
  URL =          "http://cswww.essex.ac.uk/staff/poli/papers/Poli-ECJ1998.pdf",
  URL =          "http://citeseer.ist.psu.edu/334847.html",
  DOI =          "doi:10.1162/evco.1998.6.3.231",
  size =         "30 pages",
  abstract =     "We review the main results obtained in the theory of
                 schemata in Genetic Programming (GP) emphasising their
                 strengths and weaknesses. Then we propose a new,
                 simpler definition of the concept of schema for GP
                 which is closer to the original concept of schema in
                 genetic algorithms (GAs). Along with a new form of
                 crossover, one-point crossover, and point mutation this
                 concept of schema has been used to derive an improved
                 schema theorem for GP which describes the propagation
                 of schemata from one generation to the next. We discuss
                 this result and show that our schema theorem is the
                 natural counterpart for GP of the schema theorem for
                 GAs, to which it asymptotically converges.",
  notes =        "see also \cite{poli:1997:schema} PMID: 10021748",
}

Genetic Programming entries for Riccardo Poli William B Langdon

Citations