Mutation rate matters even when optimizing monotonic functions

Evolutionary Computation

Volumn 21, Issue 1, 2013, Pages 1-27

  Doerr, Benjamin ^a   Jansen, Thomas ^b   Sudholt, Dirk ^c   Winzen, Carola ^a   Zarges, Christine ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY COLLEGE CORK   (Ireland)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Computational complexity; Evolutionary algorithms; Pseudo Boolean optimization; Runtime analysis

Indexed keywords

CONSTANT FACTORS; FUNCTION CLASS; LINEAR FUNCTIONS; MONOTONIC FUNCTIONS; MUTATION PROBABILITY; PSEUDO-BOOLEAN FUNCTION; PSEUDO-BOOLEAN OPTIMIZATION; RUN-TIME ANALYSIS;

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PROBABILITY;

BOOLEAN FUNCTIONS;

ALGORITHM; ARTICLE; MUTATION RATE;

ALGORITHMS; MUTATION RATE;

EID: 84875042081     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00055     Document Type: Article

References (35)

1. Aldous, D. (1983). Minimization algorithms and random walk on the d-cube. Annals of Probability, 11:403-413.
2. Alon, N., and Spencer, J. H. (2008). The probabilistic method (3rd ed.). New York:Wiley.
3. Bäck, T., Fogel, D., andMichalewicz, Z. (Eds.) (1997). Handbook of evolutionary computation. Oxford, UK: Oxford University Press.
4. Böttcher, S., Doerr, B., and Neumann, F. (2010). Optimal fixed and adaptive mutation rates for the leading ones problem. In 11th International Conference on Parallel Problem Solving from Nature (PPSN XI). Lecture Notes in Computer Science, Part I, Vol. 6238 (pp. 1-10). Berlin: Springer.
5. Cervantes, J., and Stephens, C. R. (2009). Limitations of existing mutation rate heuristics and how a rank GA overcomes them. IEEE Transactions on Evolutionary Computation, 13:369-397.
6. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge, MA: MIT Press.
7. Dasgupta, D., and Niño, L. F. (2008). Immunological computation: Theory and applications. Boston: Auerbach.
8. Doerr, B. (2011). Analyzing randomized search heuristics: Tools from probability theory. In A. Auger and B. Doerr (Eds.), Theory of randomized search heuristics, Vol. 1 of Series on Theoretical Computer Science (pp. 1-20). Singapore, World Scientific.
9. Doerr, B., and Goldberg, L. (2010a). Adaptive drift analysis. In Proceedings of Parallel Problem Solving from Nature (PPSN XI), Part I, Lecture Notes in Computer Science, Vol. 6238 (pp. 32-41). Berlin: Springer.
10. Doerr, B., and Goldberg, L. (2010b). Drift analysis with tail bounds. In Proceedings of Parallel Problem Solving from Nature (PPSN XI), Part I, Lecture Notes in Computer Science, Vol. 6238 (pp. 174-183). Berlin: Springer.
11. Doerr, B., Happ, E., and Klein, C. (in press). Crossover can provably be useful in evolutionary computation. Theoretical Computer Science, to appear. doi: DOI: 10.1016/j.tcs.2010.10.035.
12. Doerr, B., Jansen, T., and Klein, C. (2008). Comparing global and local mutations on bit strings. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 929-936.
13. Doerr, B., Jansen, T., Sudholt, D., Winzen, C., and Zarges, C. (2010). Optimizing monotonic functions can be difficult. In 11th International Conference on Parallel Problem Solving from Nature (PPSN XI), Part I, Lecture Notes in Computer Science, Vol. 6238 (pp. 42-51). Berlin: Springer.
14. Doerr, B., Johannsen, D., andWinzen, C. (2010a). Drift analysis and linear functions revisited. In Proceedings of IEEE Congress on Evolutionary Computation (CEC 2010), pp. 1967-1974.
15. Doerr, B., Johannsen, D., and Winzen, C. (2010b). Multiplicative drift analysis. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2010), pp. 1449-1456.
16. Droste, S., Jansen, T., andWegener, I. (1998). On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In Proceedings of Parallel Problem Solving from Nature (PPSN V), Lecture Notes in Computer Science, Vol. 1498 (pp. 13-22). Berlin: Springer.
17. Droste, S., Jansen, T., andWegener, I. (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81.
18. He, J., and Yao, X. (2001). Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127:57-85.
19. He, J., and Yao, X. (2002). Erratum to He and Yao (2001). Artificial Intelligence, 140:245-248.
20. Horn, J., Goldberg, D., and Deb, K. (1994). Long path problems. In Proceedings of Parallel Problem Solving from Nature (PPSN IV), Lecture Notes in Computer Science, Vol. 866 (pp. 149-158). Berlin: Springer.
21. Igel, C., and Toussaint, M. (2004). Ano-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms, 3:313-322.
22. Jägersküpper, J. (2011). Combining Markov-chain analysis and drift analysis-The (1+1) Evolutionary Algorithm on linear functions reloaded. Algorithmica, 59(3):409-424.
23. Jansen, T. (2007). On the brittleness of evolutionary algorithms. In Proceedings of Foundations of Genetic Algorithms (FOGA 2007), Lecture Notes in Computer Science, Vol. 4436 (pp. 54-69). Berlin: Springer.
24. Jansen, T., Oliveto, P. S., and Zarges, C. (2011). On the analysis of the immune-inspired b-cell algorithm for the vertex cover problem. In Proceedings of the International Conference on Artificial Immune Systems (ICARIS 2011), pp. 117-131.
25. Jansen, T., and Wegener, I. (2000). On the choice of the mutation probability for the (1+1) EA. In Proceedings of Parallel Problem Solving from Nature (PPSN VI), Lecture Notes in Computer Science, Vol. 1917 (pp. 89-98). Berlin: Springer.
26. Jansen, T., and Zarges, C. (2011). Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoretical Computer Science, 412:517-533.
27. Kelsey, J., and Timmis, J. (2003). Immune inspired somatic contiguous hypermutations for function optimisation. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), pp. 207-218.
28. Krasnogor, N., and Smith, J. (2005). A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
29. Mitzenmacher, M., and Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge, MA: Cambridge University Press.
30. Mühlenbein, H. (1992). How genetic algorithms really work. Mutation and hillclimbing. In Proceedings of Parallel Problem Solving from Nature (PPSN II), Lecture Notes in Computer Science, Vol. 6825 (pp. 15-25). Berlin: Springer.
31. Ochoa, G. (2002). Setting the mutation rate: Scope and limitations of the 1/L heuristic. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 495-502.
32. Oliveto, P., He, J., and Yao, X. (2007). Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4:281-293.
33. Oliveto, P. S., and Witt, C. (2011). Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica, 59:369-386.
34. Sudholt, D. (2011). A new method for lower bounds on the running time of evolutionary algorithms. ArXiv e-prints. Available from http://arxiv.org/abs/1109.1504
35. Witt, C. (2011). Tight bounds on the optimization time of the (1+1) EA on linear functions. ArXiv e-prints. Available from http://arxiv.org/abs/1108.4386v1