On the Ability to Search the Space of Programs of Standard, One-point and Uniform Crossover in Genetic Programming

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

@TechReport{poli:1998:localTR,
  author =       "Riccardo Poli and William B. Langdon",
  title =        "On the Ability to Search the Space of Programs of
                 Standard, One-point and Uniform Crossover in Genetic
                 Programming",
  institution =  "University of Birmingham, School of Computer Science",
  number =       "CSRP-98-7",
  month =        jan,
  year =         "1998",
  file =         "/1998/CSRP-98-07.ps.gz",
  URL =          "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-07.ps.gz",
  abstract =     "In this paper we study and compare the search
                 properties of different crossover operators in genetic
                 programming (GP) using probabilistic models and
                 experiments to assess the amount of genetic material
                 exchanged between the parents to generate the
                 offspring. These operators are: standard crossover,
                 one-point crossover and a new operator, uniform
                 crossover. Our analysis suggests that standard
                 crossover is a local and biased search operator not
                 ideal to explore the search space of programs
                 effectively. One-point crossover is better in some
                 cases as it is able to perform a global search at the
                 beginning of a run, but it suffers from the same
                 problems as standard crossover later on. Uniform
                 crossover largely overcomes these limitations as it is
                 global and less biased.",
  keywords =     "genetic algorithms, genetic programming",
  note =         "Presented at GP-98",
  notes =        "see \cite{poli:1998:local}",
}

Genetic Programming entries for Riccardo Poli William B Langdon

Citations