Abstract
This paper introduces a new crossover operator for the genetic programming (GP)paradigm, the grammar-based crossover (GBX). This operator works with any grammar-guided genetic programming system. GBX has three important features: it prevents the growth of tree-based GP individuals (a phenomenon known as code bloat), it provides a satisfactory trade-off between the search space exploration and the exploitation capabilities by preserving the context in which subtrees appear in the parent trees and, finally, it takes advantage of the main feature of ambiguous grammars, namely, that there is more than one derivation tree for some sentences (solutions). These features give GBX a high convergence speed and low probability of getting trapped in local optima, as shown throughout the comparison of the results achieved by GBX with other relevant crossover operators in two experiments: a laboratory problem and a real-world task: breast cancer prognosis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Koza, J.R.: Genetically Breeding Populations of Computer Programs to Solve Problems in Artificial Intelligence. Stanford University, Department of Computer Science. CS-TR-90-1314 (1990)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Singleton, A.: Greediness. Posting of 8-21-1993 on genetic-programming@cs.standford.edu mailing list (1993)
Silva, S., Almeida, J.: Dynamic Maximum Tree Depth. A Simple Technique for Avoiding Bloat in Tree-Based GP. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1776–1787. Springer, Heidelberg (2003)
Langdon, W.B.: Size Fair and Homologous Tree Crossovers for Tree Genetic Program-ming. Genetic Programming and Evolvable Machines, vol. 1, pp. 95–119. Kluwer Academic Publishers, Boston (2000)
Crawford-Marks, R., Spector, L.: Size control via Size Fair Genetic Operators in the PushGP Genetic Programming System. In: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, pp. 733–739 (2002)
Barrios, D., Carrascal, A., Manrique, D., Ríos, J.: Optimization with Real-Coded Genetic Algorithms Based on Mathematical Morphology. Intern. J. Computer Math. 80(3), 275–293 (2003)
Whigham, P.A.: Grammatically-Based Genetic Programming. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, California, USA, pp. 33–41 (1995)
Hussain, T.S.: Attribute Grammar Encoding of the Structure and Behavior of Artificial Neural Networks. PhD Thesis, Queen’s University. Kingston, Ontario, Canada (2003)
Rodrigues, E., Pozo, A.: Grammar-Guided Genetic Programming and Automatically De-fined Functions. In: Proceedings of the 16th Brazilian Symposium on Artificial Intelligence, Recife, Brazil, pp. 324–333 (2002)
Grosman, B., Lewin, D.R.: Adaptive Genetic Programming for Steady-State Process Mod-eling. Computers and Chemical Engineering 28, 2779–2790 (2004)
Hoai, N.X., McKay, R.I.: Is Ambiguity Useful or Problematic for Grammar Guided Genetic Programming? A case of Study. In: Proceedings of the 4th Asia-Pacific Conference on Simu-lated Evolution and Learning, Singapore, pp. 449–453 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manrique, D., Márquez, F., Ríos, J., Rodríguez-Patón, A. (2005). Grammar Based Crossover Operator in Genetic Programming. In: Mira, J., Álvarez, J.R. (eds) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. Lecture Notes in Computer Science, vol 3562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499305_26
Download citation
DOI: https://doi.org/10.1007/11499305_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26319-7
Online ISBN: 978-3-540-31673-2
eBook Packages: Computer ScienceComputer Science (R0)