Abstract
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environment by decomposition of the problem into a hierarchy of modules. As computer scientists and more generally as humans we tend to adopt a similar divide-and-conquer strategy in our problem solving. In this paper we consider the adoption of such a strategy for Genetic Algorithms. By adopting a modular representation in a Genetic Algorithm we can make efficiency gains that enable superior scaling characteristics to problems of increasing size. We present a comparison of two modular Genetic Algorithms, one of which is a Grammatical Genetic Programming algorithm, the meta-Grammar Genetic Algorithm (mGGA), which generates binary string sentences instead of traditional GP trees. A number of problems instances are tackled which extend the Checkerboard problem by introducing different kinds of regularity and noise. The results demonstrate some limitations of the modular GA (MGA) representation and how the mGGA can overcome these. The mGGA shows improved scaling when compared the MGA.
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.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Koza, J.R., Keane, M.A., Streeter, M.J., Mydlowec, W., Yu, J., Lanza, G.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, Boston (2003)
O’Neill, M., Brabazon, A.: mGGA: The Meta-Grammar Genetic Algorithm. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J.I., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 311–320. Springer, Heidelberg (2005)
Garibay, O.O., Garibay, I.I., Wu, A.S.: The Modular Genetic Algorithm: Exploiting Regularities in the Problem Space. In: Yazıcı, A., Şener, C. (eds.) ISCIS 2003. LNCS, vol. 2869, pp. 584–591. Springer, Heidelberg (2003)
O’Neill, M., Ryan, C.: Grammatical Evolution by Grammatical Evolution. In: Keijzer, M., O’Reilly, U.-M., Lucas, S.M., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 138–149. Springer, Heidelberg (2004)
O’Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language. Kluwer Academic Publishers, Boston (2003)
O’Neill, M.: Automatic Programming in an Arbitrary Language: Evolving Programs in Grammatical Evolution. PhD thesis, University of Limerick (2001)
O’Neill, M., Ryan, C.: Grammatical Evolution. IEEE Trans. Evolutionary Computation (2001)
Ryan, C., Collins, J.J., O’Neill, M.: Grammatical Evolution: Evolving Programs for an Arbitrary Language. In: Banzhaf, W., et al. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)
Dempsey, I., O’Neill, M., Brabazon, A.: Grammatical Constant Creation. In: Deb, K., et al. (ed.) GECCO 2004. LNCS, vol. 3103, pp. 447–458. Springer, Heidelberg (2004)
O’Neill, M., Cleary, R.: Solving Knapsack Problems with Attribute Grammars. In: Proceedings of the Grammatical Evolution Workshop 2004, GECCO’04, Seattle, USA (2004)
Shan, Y., McKay, R.I., Baxter, R., Abbas, H., Essam, D., Nguyen, H.X.: Grammar Model-based Program Evolution. In: Proceedings of the 2004 Congress on Evolutionary Computation. CEC 2004, vol. 1, Portland, USA,, pp. 478–485 (2004)
Chomsky, N.: Reflections on Language. Pantheon Books, New York (1975)
Pinker, S.: The language instinct: the new science of language and the mind. Penguin, London (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hemberg, E., Gilligan, C., O’Neill, M., Brabazon, A. (2007). A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds) Genetic Programming. EuroGP 2007. Lecture Notes in Computer Science, vol 4445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71605-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-71605-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71602-0
Online ISBN: 978-3-540-71605-1
eBook Packages: Computer ScienceComputer Science (R0)