Rigorous analyses of simple diversity mechanisms

It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no rigorous analysis pointing out the use of different mechanisms with respect to the runtime behavior. We consider evolutionary algorithms that differ from each other in the way they ensure diversity and point out situations where the right mechanism is crucial for the success of the algorithm. The algorithms considered either diversify the population with respect to the search points or with respect to function values. Investigating simple plateau functions, we show that using the “right” diversity strategy makes the difference between an exponential and a polynomial runtime. Categories and Subject Descriptors: F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms: Theory, Algorithms, Performance

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
• Keywords: Diversity Mechanisms, Evolutionary Algorithms, GECCO 2007, Simple Plateau Functions