Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
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.
KeywordsEvolutionary Algorithm Mutation Operator Search Point Current Path Jump Operator
Unable to display preview. Download preview PDF.
- 6.Neumann, F.: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 80–89. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 9.Raidl, G.R., Koller, G., Julstrom, B.A.: Biased mutation operators for subgraph-selection problems. IEEE Transactions on Evolutionary Computation (to appear, 2006)Google Scholar