Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66753
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Speeding up evolutionary algorithms through restricted mutation operators |
Author: | Doerr, B. Hebbinghaus, N. Neumann, F. |
Citation: | Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006 : Proceedings / T. P. Runarsson, H.-G. Beyer, E. Burke, J. J. Merelo-Guervós, L. D. Whitley, X. Yao (eds.), pp.978-987 |
Publisher: | Springer-Verlag Berlin |
Publisher Place: | Heidelberger Platz 3 Berlin Germany D-14197 |
Issue Date: | 2006 |
Series/Report no.: | Lecture Notes in Computer Science |
ISBN: | 3540389903 9783540389903 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | International Conference on Parallel Problem Solving from Nature (9th : 2006 : Reykjavik, Iceland) |
Editor: | Runarsson, T.P. Beyer, H.G. Burke, E. MereloGuervos, J.J. Whitley, L.D. Yao, X. |
Statement of Responsibility: | Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann |
Abstract: | We investigate the effect of restricting the mutation operator in evolutionary algorithms with respect to the runtime behavior. For the Eulerian cycle problem; we present runtime bounds on evolutionary algorithms with a restricted operator that are much smaller than the best upper bounds for the general case. It turns out that a plateau that both algorithms have to cope with is left faster by the new algorithm. In addition, we present a lower bound for the unrestricted algorithm which shows that the restricted operator speeds up computation by at least a linear factor. |
Description: | Also published as a journal article: Lecture Notes in Computer Science, 2006; 4193:978-987 |
Rights: | © Springer-Verlag Berlin Heidelberg 2006 |
DOI: | 10.1007/11844297_99 |
Published version: | http://dx.doi.org/10.1007/11844297_99 |
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.