Non-Destructive Depth-Dependent Crossover for Genetic Programming   [GP]

by

Ito, T., Iba, H. and Sato, S.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the First European Workshop on Genetic Programming (Conference proceedings), 1998, p. 71-82
Keywords:genetic algorithms, genetic programming
Abstract:
In our previous paper [Ito et al., 1998], 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 [BB] 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.
Notes:
EuroGP'98. Santa Fe artificial ant

LNCS E-print:
Volume   first page   
NB: Papers are in PDF, not all are online, and you need access to Springer's Link archive.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{ito:1998:nddx,
  author =       "Takuya Ito and Hitoshi Iba and Satoshi Sato",
  title =        "Non-Destructive Depth-Dependent Crossover for Genetic
                 Programming",
  booktitle =    "Proceedings of the First European Workshop on Genetic
                 Programming",
  year =         "1998",
  editor =       "Wolfgang Banzhaf and Riccardo Poli and Marc Schoenauer
                 and Terence C. Fogarty",
  volume =       "1391",
  series =       "LNCS",
  pages =        "71--82",
  address =      "Paris",
  publisher_address = "Berlin",
  month =        "14-15 " # apr,
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-64360-5",
  abstract =     "In our previous paper [Ito et al., 1998], 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.",
  notes =        "EuroGP'98. Santa Fe artificial ant",
}