Context preserving crossover in genetic programming

Author

D´haeseleer, Patrik

Author_Institution

LSI Logic, Atherton, CA, USA

fYear

1994

fDate

27-29 Jun 1994

Firstpage

256

Abstract

This paper introduces two new crossover operators for genetic programming (GP): strong context-preserving crossover and weak context-preserving crossover. Contrary to the regular GP crossover, the operators presented attempt to preserve the context in which subtrees appeared in the parent trees. A simple coordinate scheme for nodes in an S-expression tree is proposed, and crossovers are only allowed between nodes with exactly or partially matching coordinates

Keywords

genetic algorithms; optimisation; path planning; programming; trees (mathematics); S-expression tree; context-preserving crossover; crossover operators; genetic programming; matching coordinates; node coordinate scheme; subtrees; Biological cells; Convergence; Decision trees; Genetic algorithms; Genetic mutations; Genetic programming; Large scale integration; Logic programming; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-1899-4

Type

conf

DOI

10.1109/ICEC.1994.350006

Filename

350006

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2325508