The Role of Neutral and Adaptive Mutation in an Evolutionary Search on the OneMax Problem

Abstract

We investigate neutrality in the simple Genetic Algorithms (SGA) and in our neutrality-enabled evolutionary system using the OneMax problem. The results show that with the support of limited neutrality, SGA is less effective than our system where a larger amount of neutrality is supported. In order to understand the role of neutrality in evolutionary search… (More)

8 Figures and Tables

Topics

  • Presentations referencing similar topics