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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A., Hopcroft, J. and Ullman, J. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974
Angeline, J. Subtree Crossover: Building Block Engine or Macromutation?, In Koza, J., Deb, K., Dorigo, M., Fogel, D. Garzon, M., Iba, H. and Riolo, R. editors, Proceedings of the Second Annual Conference Genetic Programming 1997 (GP97), pages 9–17, MIT Press, 1997
Iba, H., deGaris, H. and Sato, T. Genetic Programming using a Minimum Description Length Principle, In Kinnear, Jr. K. editor, Advances in Genetic Programming, pages 265–284, MIT Press, 1994
Ito, T. and Iba, H. and Kimura, M. Robustness of Robot Programs Generated by Genetic Programming, In Koza, J., Goldberg, D., Fogel, D. and Riolo, R. editors, Proceedings of the First Annual Conference Genetic Programming 1996 (GP96), pages 321–326, MIT Press, 1996
Ito, T. and Iba, H. and Sato, S. Depth-Dependent Crossover for Genetic Programming, In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC’98), 1998
Kinnear, Jr. K. Generality and Difficulty in Genetic Programming: Evolving a Sort, In Proceedings of 5th International Joint Conference on Genetic Algorithms MIT press, 1993
Koza, J. Genetic Programming: On the Programming of Computers by Natural Selection, MIT press, 1992
Rudolf, F. and Wilson, W. Statistical Methods, Academic Press, Inc. 1992
Slavov, V and Nikolaev, N Fitness Landscapes and Inductive Genetic Programming, In Smith, G. editor, Third International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA’97), Springer-Verlag, Vienna, 1997
Soule, T., Foster, J. and Dickinson, J. Code Growth in Genetic Programming, In Koza, J., Goldberg, D., Fogel, D. and Riolo, R. editors, Proceedings of the First Annual Conference Genetic Programming 1996 (GP96), pages 215–223, MIT Press, 1996
Soule, T. and Foster, J. Code Size and Depth Flows in Genetic Programming, In Koza, J., Deb, K., Dorigo, M., Fogel, D. Garzon, M., Iba, H. and Riolo, R. editors, Proceedings of the Second Annual Conference Genetic Programming 1997 (GP97), pages 313–320, MIT Press, 1997
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/BFb0055929
Download citation
DOI: https://doi.org/10.1007/BFb0055929
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64360-9
Online ISBN: 978-3-540-69758-9
eBook Packages: Springer Book Archive