A rigorous view on neutrality

Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the search space and point out situations where the use of neutrality significantly influence the runtime of an evolutionary algorithm.

[1]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[2]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[3]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[4]  Carsten Witt,et al.  An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions , 2004, GECCO.

[5]  Stefan Droste,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax , 2003 .

[6]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[7]  Karsten Weicker,et al.  Burden and Benefits of Redundancy , 2000, FOGA.

[8]  Tobias Storch,et al.  On the Choice of the Population Size , 2004, GECCO.

[9]  Ingo Wegener,et al.  Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.

[10]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[11]  Igor Pak,et al.  On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes , 2001, Discret. Appl. Math..

[12]  Jamshid Ghaboussi,et al.  Implicit Representation in Genetic Algorithms Using Redundancy , 1997, Evolutionary Computation.

[13]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2006, Genetic Programming and Evolvable Machines.

[14]  Riccardo Poli,et al.  An empirical investigation of how and why neutrality affects evolutionary search , 2006, GECCO '06.

[15]  Stefan Droste,et al.  Not all linear functions are equally difficult for the compact genetic algorithm , 2005, GECCO '05.

[16]  Franz Rothlauf,et al.  Population Sizing for the Redundant Trivial Voting Mapping , 2003, GECCO.

[17]  Riccardo Poli,et al.  Some Steps Towards Understanding How Neutrality Affects Evolutionary Search , 2006, PPSN.

[18]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[19]  Marc Toussaint,et al.  Neutrality and self-adaptation , 2003, Natural Computing.

[20]  Carsten Witt,et al.  Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .

[21]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[22]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.