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

Authors

  • 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

Keywords:

genetic programming, rewrite, neutrality

Abstract

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.

Accessibility Summary:

In accordance with Title II regulations this content meets all points of exemption as Archived web content and/or Preexisting conventional electronic documents.

Downloads

Published

18-04-2021

How to Cite

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

Issue

Vol. 34 (2021): Proceedings of FLAIRS-34

Section

Main Track