Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant

Although evolutionary algorithms (EAs) are often successfully used for dynamically changing problems, there are only few theoretical results about EAs for dynamic objective functions. Here, the runtime of the (1+1) EA is theoretically analyzed for a dynamic variant of ONEMAX. The main focus lies on determining the degree of change of the fitness function, where the expected runtime of the (1+1) EA rises from polynomial to super-polynomial. The proofs presented show methods of how to rigorously analyze EAs on dynamically changing objective functions.

[1]  Kenneth de Jong,et al.  The behavior of spatially distributed evolutionary algorithms in non-stationary environments , 1999 .

[2]  Yuval Rabani,et al.  A computational view of population genetics , 1995, STOC '95.

[3]  I. Wegener,et al.  A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  Riccardo Poli,et al.  Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.

[5]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .

[6]  I. Wegener,et al.  Dynamic Parameter Control in Simple Evolutionary Algorithms , 2001 .

[7]  Jason M. Daida,et al.  (1+1) genetic algorithm fitness dynamics in a changing environment , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[8]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[9]  K. Weicker,et al.  On evolution strategy optimization in dynamic environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Christopher Ronnewinkel,et al.  Dynamic fitness landscapes: expansions for small mutation rates , 2000, physics/0010045.

[11]  Thomas Jansen,et al.  On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help , 1999 .