Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/65942
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Comparison of simple diversity mechanisms on plateau functions |
Author: | Friedrich, T. Hebbinghaus, N. Neumann, F. |
Citation: | Theoretical Computer Science, 2009; 410(26):2455-2462 |
Publisher: | Elsevier Science BV |
Issue Date: | 2009 |
ISSN: | 0304-3975 1879-2294 |
Statement of Responsibility: | 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 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. © 2008 Elsevier B.V. All rights reserved. |
Keywords: | Evolutionary algorithms Diversity Runtime analysis |
Rights: | © 2008 Elsevier B.V. All rights reserved. |
DOI: | 10.1016/j.tcs.2008.08.021 |
Published version: | http://dx.doi.org/10.1016/j.tcs.2008.08.021 |
Appears in Collections: | Aurora harvest 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.