A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
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
doi:10.1007/11844297_99
fatcat:pgokxyuodncztg4m3zig54qeve