Adaptive drift analysis

Algorithmica

Volumn 65, Issue 1, 2013, Pages 224-250

  Doerr, Benjamin ^a   Goldberg, Leslie Ann ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STRINGS; DRIFT ANALYSIS; DRIFT FUNCTIONS; EXPECTED TIME; HIGH PROBABILITY; LINEAR OBJECTIVE FUNCTIONS; MUTATION RATES; OBJECTIVE FUNCTIONS; OPTIMISATIONS;

OPTIMIZATION;

THEOREM PROVING;

EID: 84872614502     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9585-3     Document Type: Article

References (23)

1. Bäck, T.: Optimal mutation rates in genetic search. In: Forrest, S. (ed.) International Conference on Genetic Algorithms (ICGA), pp. 2-8. Morgan Kaufmann, San Mateo (1993)
2. Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P.P., Neumann, F.: Computing single source shortest paths using single-objective fitness. In: FOGA '09: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms, pp. 59-66. ACM, New York (2009)
3. Doerr, B., Goldberg, L.: Adaptive drift analysis. In: Schaefer, R., Cotta, C., Kolodziej, J., Rudolph, G. (eds.) Parallel Problem Solving from Nature - PPSN XI. Lecture Notes in Computer Science, vol. 6238, pp. 32-41. Springer, Berlin (2011)
4. Doerr, B., Goldberg, L.: Drift analysis with tail bounds. In: Schaefer, R., Cotta, C., Kolodziej, J., Rudolph, G. (eds.) Parallel Problem Solving from Nature - PPSN XI. Lecture Notes in Computer Science, vol. 6238, pp. 174-183. Springer, Berlin (2011)
5. Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Optimizing monotone functions can be difficult. In: Schaefer, R., Cotta, C., Kolodziej, J., Rudolph, G. (eds.) Parallel Problem Solving from Nature - PPSN XI. Lecture Notes in Computer Science, vol. 6238, pp. 42-51. Springer, Berlin (2010)
6. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Congress on Evolutionary Computation (CEC-2010), pp. 1-8. IEEE Press, New York (2010)
7. Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. In: Genetic and Evolutionary Computation Conference (GECCO-2010), pp. 1449-1456. ACM, New York (2010)
8. Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with boolean inputs. Evol. Comput. 6(2), 185-196 (1998) (Pubitemid 128692902)
9. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2), 51-81 (2002) (Pubitemid 34295606)
10. Dyer, M., Greenhill, C.: Random walks on combinatorial objects. In: Surveys in Combinatorics 1999, pp. 101-136. Cambridge University Press, Cambridge (1999)
11. Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multi-objective optimization. In: GECCO '06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 651-658. ACM, New York (2006) (Pubitemid 44611385)
12. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, pp. 415-426. Springer, Berlin (2003)
13. Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes, 2nd edn. Oxford University Press, New York (1992)
14. Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 13(3), 502-525 (1982)
15. Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Ryan, C., Keijzer, M. (eds.) Genetic and Evolutionary Computation Conference (GECCO-2008), pp. 953-960. ACM, New York (2008)
16. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127(1), 57-85 (2001) (Pubitemid 32264935)
17. He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127(1):57-85, 2001]. Artif. Intell. 140(1/2), 245-248 (2002) (Pubitemid 34965462)
18. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21-35 (2004) (Pubitemid 39127657)
19. Jägersküpper, J.: Combining Markov-chain analysis and drift analysis - the (1+1) evolutionary algorithm on linear functions reloaded. Algorithmica 59(3), 409-424 (2011)
20. Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Rothlauf, F. (ed.) Genetic and Evolutionary Computation Conference (GECCO-2009), pp. 835-842. ACM, New York (2009)
21. Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1), 32-40 (2007) (Pubitemid 46711139)
22. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369-386 (2011)
23. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349-369. Kluwer Academic, Dordrecht (2002)