Genetic Programming with One-Point Crossover

  • Poli R
  • Langdon W
N/ACitations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent theoretical and experimental work onschemata in genetic programming we have proposed a newsimpler form of crossover in which the same crossoverpoint is selected in both parent programs. We call thisoperator one-point crossover because of its similaritywith the corresponding operator in genetic algorithms.One-point crossover presents very interestingproperties from the theory point of view. In this paperwe describe this form of crossover as well as a newvariant called strict one-point crossover highlightingtheir useful theoretical and practical features. Wealso present experimental evidence which shows thatone-point crossover compares favourably with standardcrossover.

Cite

CITATION STYLE

APA

Poli, R., & Langdon, W. B. (1998). Genetic Programming with One-Point Crossover. In Soft Computing in Engineering Design and Manufacturing (pp. 180–189). Springer London. https://doi.org/10.1007/978-1-4471-0427-8_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free