Skip to main content

Grammatical Evolution Rules: The Mod and the Bucket Rule

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2278))

Abstract

We present an alternative mapping function called the Bucket Rule, for Grammatical Evolution, that improves upon the standard modulo rule. Grammatical Evolution is applied to a set of standard Genetic Algorithm problem domains using two alternative grammars. Applying GE to GA problems allows us to focus on a simple grammar whose effects are easily analysable. It will be shown that by using the bucket rule a greater degree of grammar independence is achieved.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banzhaf W., Nordin P., Keller R.E., Francone F.D. (1998) Genetic Programming — An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann.

    Google Scholar 

  2. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Boston, USA, Addison Wesley, Longman.

    MATH  Google Scholar 

  3. Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, USA, University of Michigan Press.

    Google Scholar 

  4. Keijzer M., Ryan C., O’Neill M., Cattolico M, Babovic V. (2001) Ripple Crossover in Genetic Programming. LNCS 2038, Proc. of the Fourth European Conference on Genetic Programming, Lake Como, Italy, April 2001, pp.74–86. Springer.

    Google Scholar 

  5. Koza, J.R. (1992). Genetic Programming. MIT Press.

    Google Scholar 

  6. Koza J.R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press.

    Google Scholar 

  7. Koza J.R., Andre D., Bennett III F.H., and Keane M. (1999) Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufman.

    Google Scholar 

  8. O’Neill M. (2001) Automatic Programming in an Arbitrary language: Evolving Programs with Grammatical Evolution. Ph.D. thesis, University of Limerick, 2001.

    Google Scholar 

  9. O’Neill M., Ryan C. (2001) Grammatical Evolution. IEEE Trans. Evolutionary Computation, Vol. 5 No. 4, August 2001.

    Google Scholar 

  10. Ryan C., Collins J.J., O’Neill M. (1998). Grammatical Evolution: Evolving Programs for an Arbitrary Language. LNCS 1391, Proc. of the First European Workshop on Genetic Programming, pp. 83–95. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keijzer, M., O’Neill, M., Ryan, C., Cattolico, M. (2002). Grammatical Evolution Rules: The Mod and the Bucket Rule. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds) Genetic Programming. EuroGP 2002. Lecture Notes in Computer Science, vol 2278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45984-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45984-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43378-1

  • Online ISBN: 978-3-540-45984-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics