Comparison of simple diversity mechanisms on plateau functions

Authors:
Tobias Friedrich;Nils Hebbinghaus;Frank Neumann
Affiliations:
Max-Planck-Institut für Informatik, Campus E1 4, 66123 Saarbrücken, Germany;Max-Planck-Institut für Informatik, Campus E1 4, 66123 Saarbrücken, Germany;Max-Planck-Institut für Informatik, Campus E1 4, 66123 Saarbrücken, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 15
Cited 4

Drift analysis and average time complexity of evolutionary algorithms

Artificial Intelligence
On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Diversity-Guided Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary Algorithms and the Maximum Matching Problem

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Crossover is provably essential for the Ising model on trees

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions

Evolutionary Computation
Effects of diversity control in single-objective and multi-objective genetic algorithms

Journal of Heuristics
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

Theoretical Computer Science
Rigorous analyses of simple diversity mechanisms

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Speeding up evolutionary algorithms through asymmetric mutation operators

Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time

Evolutionary Computation
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Computers and Operations Research
Crossover can provably be useful in evolutionary computation

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Worst-case and average-case approximations by simple randomized search heuristics

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Evolutionary algorithms - how to cope with plateaus of constantfitness and when to reject strings of the same fitness

IEEE Transactions on Evolutionary Computation

Comparing Different Aging Operators

ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
On benefits and drawbacks of aging strategies for randomized search heuristics

Theoretical Computer Science
Review of phenotypic diversity formulations for diagnostic tool

Applied Soft Computing
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 how different diversity mechanisms influence 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 considered evolutionary algorithms 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. Later on, we examine how the drawback of the ''wrong'' diversity mechanism can be compensated by increasing the population size.