Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Type: Conference paper
Title: Rigorous Analyses of Simple Diversity Mechanisms
Author: Friedrich, T.
Hebbinghaus, N.
Neumann, F.
Citation: GECCO 2007 : Genetic and Evolutionary Computation Conference, July 7-11, 2007 University College London, London, UK / Dirk Thierens, et al. (eds.), pp. 1219-1225
Publisher: ACM New York
Publisher Place: New York
Issue Date: 2007
ISBN: 1595936971
Conference Name: Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
Statement of
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
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 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.
Keywords: Diversity; Runtime Analysis; Selection Procedures
Rights: Copyright 2007 ACM
RMID: 0020107017
DOI: 10.1145/1276958.1277194
Description (link):
Published version:
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.