Non-destructive depth-dependent crossover for genetic programming

  • Takuya Ito
  • Hitoshi Iba
  • Satoshi Sato
Conference paper

DOI: 10.1007/BFb0055929

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1391)
Cite this paper as:
Ito T., Iba H., Sato S. (1998) Non-destructive depth-dependent crossover for genetic programming. In: Banzhaf W., Poli R., Schoenauer M., Fogarty T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg

Abstract

In our previous paper [5], a depth-dependent crossover was proposed for GP. The purpose was to solve the difficulty of the blind application of the normal crossover, i.e., building blocks are broken unexpectedly. In the depth-dependent crossover, the depth selection ratio was varied according to the depth of a node. However, the depth-dependent crossover did not work very effectively as generated programs became larger. To overcome this, we introduce a non-destructive depth-dependent crossover, in which each offspring is kept only if its fitness is better than that of its parent. We compare GP performance with the depth-dependent crossover and that with the non-destructive depth-dependent crossover to show the effectiveness of our approach. Our experimental results clarify that the non-destructive depth-dependent crossover produces smaller programs than the depth-dependent crossover.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Takuya Ito
    • 1
  • Hitoshi Iba
    • 2
  • Satoshi Sato
    • 1
  1. 1.School of Information ScienceJapan Advanced Institute of Science and TechnologyTatsunokuchi, Nomi, IshikawaJapan
  2. 2.Machine Inference SectionElectrotechnical LaboratoryTsukuba, IbaragiJapan

Personalised recommendations