Abstract
In this paper we propose a Neutral Mutation Operator (NMO) for Grammatical Evolution (GE). This novel operator is inspired by GE’s ability to create genetic diversity without causing changes in the phenotype. Neutral mutation happens naturally in the algorithm; however, forcing such changes increases success rates in symbolic regression problems profoundly with very low additional CPU and memory cost. By exploiting the genotype-phenotype mapping, this additional mutation operator allows the algorithm to explore the search space more efficiently by keeping constant genetic diversity in the population which increases the mutation potential. The NMO can be applied in combination with any other genetic operator or even different search algorithms (e.g. Differential Evolution or Particle Swarm Optimization) for GE and works especially well in small populations and larger problems.
Keywords
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
de la Puente, A.O., Alfonso, R.S., Moreno, M.A.: Automatic composition of music by means of grammatical evolution. ACM SIGAPL APL Quote Quad 32(4), 148–155 (2002)
Kimura, M.: The neutral theory of molecular evolution. Cambridge University Press (1984)
Koza, J.R.: Genetic Programming: on the programming of computers by means of natural selection. A Bradford Book. The MIT Press (1992)
Moore, J.H., Hahn, L.W.: Petri net modeling of high-order genetic systems using grammatical evolution. BioSystems 72(1), 177–186 (2003)
O’Neill, M., Brabazon, A., Ryan, C., Collins, J.J.: Evolving Market Index Trading Rules Using Grammatical Evolution. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoWorkshop 2001. LNCS, vol. 2037, pp. 343–352. Springer, Heidelberg (2001)
O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Transactions on Evolutionary Computation 5(4), 349–358 (2001)
Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Oesch, C., Maringer, D. (2015). A Neutral Mutation Operator in Grammatical Evolution. In: Angelov, P., et al. Intelligent Systems'2014. Advances in Intelligent Systems and Computing, vol 322. Springer, Cham. https://doi.org/10.1007/978-3-319-11313-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-11313-5_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11312-8
Online ISBN: 978-3-319-11313-5
eBook Packages: EngineeringEngineering (R0)