A Neutral Mutation Operator in Grammatical Evolution

Oesch, Christian and Maringer, Dietmar. (2015) A Neutral Mutation Operator in Grammatical Evolution. In: Intelligent System'2014, 322. Cham, Heidelberg, New York, Dordrecht, London, pp. 439-449.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/42299/

Downloads: Statistics Overview


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.
Faculties and Departments:06 Faculty of Business and Economics > Departement Wirtschaftswissenschaften > Professuren Wirtschaftswissenschaften > Computational Economics and Finance (Maringer)
UniBasel Contributors:Maringer, Dietmar and Oesch, Christian
Item Type:Book Section, refereed
Book Section Subtype:Book Chapter
Publisher:Springer International Publishing
Series Name:Advances in Intelligent Systems and Computing
Issue Number:322
Note:Publication type according to Uni Basel Research Database: Book item
Identification Number:
Last Modified:13 Apr 2018 06:16
Deposited On:19 Oct 2016 09:53

Repository Staff Only: item control page