On the Search Properties of Different Crossover Operators in Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InProceedings{poli:1998:local,
-
author = "Riccardo Poli and William B. Langdon",
-
title = "On the Search Properties of Different Crossover
Operators in Genetic Programming",
-
booktitle = "Genetic Programming 1998: Proceedings of the Third
Annual Conference",
-
year = "1998",
-
editor = "John R. Koza and Wolfgang Banzhaf and
Kumar Chellapilla and Kalyanmoy Deb and Marco Dorigo and
David B. Fogel and Max H. Garzon and
David E. Goldberg and Hitoshi Iba and Rick Riolo",
-
pages = "293--301",
-
address = "University of Wisconsin, Madison, Wisconsin, USA",
-
publisher_address = "San Francisco, CA, USA",
-
month = "22-25 " # jul,
-
publisher = "Morgan Kaufmann",
-
keywords = "genetic algorithms, genetic programming",
-
ISBN = "1-55860-548-7",
-
URL = "http://www.cs.essex.ac.uk/staff/poli/papers/Poli-GP1998.pdf",
-
URL = "http://citeseer.ist.psu.edu/329745.html",
-
URL = "http://citeseer.ist.psu.edu/502272.html",
-
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.",
-
notes = "GP-98. Based on \cite{poli:1998:localTR}",
- }
Genetic Programming entries for
Riccardo Poli
William B Langdon
Citations