Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66012
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators |
Author: | Doerr, B. Hebbinghaus, N. Neumann, F. |
Citation: | Evolutionary Computation, 2007; 15(4):401-410 |
Publisher: | MIT Press |
Issue Date: | 2007 |
ISSN: | 1063-6560 1530-9304 |
Statement of Responsibility: | Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann |
Abstract: | Successful applications of evolutionary algorithms show that certain variation operators can lead to good solutions much faster than other ones. We examine this behavior observed in practice from a theoretical point of view and investigate the effect of an asymmetric mutation operator in evolutionary algorithms with respect to the runtime behavior. Considering the Eulerian cycle problem we present runtime bounds for evolutionary algorithms using an asymmetric operator which are much smaller than the best upper bounds for a more general one. In our analysis it turns out that a plateau which both algorithms have to cope with changes its structure in a way that allows the algorithm to obtain an improvement much faster. In addition, we present a lower bound for the general case which shows that the asymmetric operator speeds up computation by at least a linear factor. |
Keywords: | Algorithms Models, Theoretical Computer Simulation |
Rights: | © 2007 by the Massachusetts Institute of Technology |
DOI: | 10.1162/evco.2007.15.4.401 |
Published version: | http://dx.doi.org/10.1162/evco.2007.15.4.401 |
Appears in Collections: | Aurora harvest 5 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.