A Neutral Rewrite Mutation Operator for Genetic Programming applied to Boolean Domain Problems

Dmytro Vitel; Alessio Gaspar; Paul Wiegand

doi:10.32473/flairs.v34i1.128527

A Neutral Rewrite Mutation Operator for Genetic Programming applied to Boolean Domain Problems

Auteurs-es

Dmytro Vitel University of South Florida
Alessio Gaspar University of South Florida
Paul Wiegand Winthrop University

DOI :

https://doi.org/10.32473/flairs.v34i1.128527

Mots-clés :

genetic programming, rewrite, neutrality

Résumé

The effect of semantically neutral tree rewrites is analyzed in the context of genetic programming applied to Boolean domain problems. Different setups of the proposed Neutral Rewrite Operator are studied from the perspective of improving performance.

Téléchargements

PDF (English)

Publié-e

2021-04-18

Comment citer

Vitel, D., Gaspar, A., & Wiegand, P. (2021). A Neutral Rewrite Mutation Operator for Genetic Programming applied to Boolean Domain Problems. The International FLAIRS Conference Proceedings, 34. https://doi.org/10.32473/flairs.v34i1.128527