Abstract
This paper describes the GAUGE system, Genetic Algorithms Using Grammatical Evolution. GAUGE is a position independent Genetic Algorithm that uses Grammatical Evolution with an attribute grammar to dictate what position a gene codes for. GAUGE suffers from neither under-specification nor over-specification, is guaranteed to produce syntactically correct individuals, and does not require any repair after the application of genetic operators.
GAUGE is applied to the standard onemax problem, with results showing that its genotype to phenotype mapping and position independence nature do not affect its performance as a normal genetic algorithm. A new problem is also presented, a deceptive version of the Mastermind game, and we show that GAUGE possesses the position independence characteristics it claims, and outperforms several genetic algorithms, including the competent genetic algorithm messyGA.
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
Bernier, J.L., Ilia Herraiz, C. Merelo, J.J., Olmeda, S., Prieto, A. 1996.Solving MasterMind using GAs and simulated annealing:a case of dynamic constraint optimization. In Proceedings PPSN, Parallel Problem Solving from Nature IV, LNCS 1141, pp. 554-563. Springer-Verlag.
Deb, K., Goldberg, D.E. 1991.mGA in C:A Messy Genetic Algorithm in C. Illinois Genetic Algorithms Laboratory (IlliGAL), report no. 91008.
Goldberg, David E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley.
Goldberg, D.E., Deb, K., and Korb, B. 1991. Don ’t worry, be messy. In Proceedings of the Fourth International Conference on Genetic Algorithms (San Mateo, CA), R. Belew and L. Booker, Eds., Morgan Kaufman, pp. 24–30
Holland, J.H. 1975.Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press.
IlliGAL website.http://www-illigal.ge.uiuc.edu/.
Kargupta, H., Deb, K., Goldberg, D.E. 1992. Ordering genetic algorithms and deceptions. In Parallel Problem Solving from Nature-PPSN II (pp.47-56).
Knjazew, D., and Goldberg, D.E.2000.OMEGA-Ordering Messy GA: Solving Problems with the Fast Messy Genetic Algorithm and Random Keys. In GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufman, pp. 181–188
Koza, J. 1992. Genetic Pro ramming. MIT Press.
Nelson, T. 1999. Investigations into the Master Mind Board Game. Website:http://www.tnelson.demon.co.uk/mastermind/index.html.
O’Neill M., Ryan C. 2001. Grammatical Evolution. IEEE Trans. Evolutionary Computation Vol. 5 No. 4, August 2001.
Ryan C., Collins J.J., O’Neill M. 1998. Grammatical Evolution:Evolving Programs for an Arbitrary Language. LNCS 1391, Proceedings of the First European Workshop on Genetic Pro ramming, pages 83–95. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, C., Nicolau, M., O’Neill, M. (2002). Genetic Algorithms Using Grammatical Evolution. 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_27
Download citation
DOI: https://doi.org/10.1007/3-540-45984-7_27
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