A Neutral Mutation Operator in Grammatical Evolution
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.
KeywordsGrammatical Evolution Neutral Evolution Genetic Operator Genotype-Phenotype Mapping
Unable to display preview. Download preview PDF.
- 2.Kimura, M.: The neutral theory of molecular evolution. Cambridge University Press (1984)Google Scholar
- 3.Koza, J.R.: Genetic Programming: on the programming of computers by means of natural selection. A Bradford Book. The MIT Press (1992)Google Scholar
- 5.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)Google Scholar