How and why a bit-wise neutrality with and without locality affects evolutionary search

ABSTRACT

Despite the vast work on neutrality, there are not general conclusions on its effects. In this paper we make an effort to understand how neutrality influences evolution. For this purpose we will use a type of neutrality that allows locality (which is believed to be a desirable feature of neutrality).

REFERENCES

• 1: Edgar Galván-López , Riccardo Poli, An empirical investigation of how and why neutrality affects evolutionary search, Proceedings of the 8th annual conference on Genetic and evolutionary computation, July 08-12, 2006, Seattle, Washington, USA [doi>10.1145/1143997.1144180]
• 2: M. Kimura, Evolutionary rate at the molecular level. In Nature, volume 217, pages 624--626, 1968.
• 3: R. Poli and E. Galván-Lಫpez, On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness. FOGA IX, 8--11, Jan., 2007, Springer-Verlag.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

General Terms:
Algorithms

Keywords:
genetic algorithms, locality, neutrality