Drift analysis with tail bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6238 LNCS, Issue PART 1, 2010, Pages 174-183

  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

CLASSICAL PROBLEMS; DRIFT ANALYSIS; EULERIAN CYCLES; EVOLUTIONARY COMPUTATIONS; HIGH PROBABILITY; LINEAR FUNCTIONS; MINIMUM SPANNING TREES; RUNTIMES; SHORTEST PATH;

EVOLUTIONARY ALGORITHMS; GRAPH THEORY; THEOREM PROVING;

PROBLEM SOLVING;

EID: 78149233934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_18     Document Type: Conference Paper

References (26)

1. Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P.P., Neumann, F.: Computing single source shortest paths using single-objective fitness. In: Proceedings of FOGA 2009, pp. 59-66. ACM, New York (2009)
2. Doerr, B., Hebbinghaus, N., Neumann, F.: Speeding up evolutionary algorithms through restricted mutation operators. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 978-987. Springer, Heidelberg (2006)
3. Doerr, B., Goldberg, L.A.: Adaptive drift analysis. In: Proceedings of PPSN XI. Springer, Heidelberg (to appear, 2010)
4. Doerr, B., Happ, E., Klein, C.: A tight bound for the (1+1)-EA on the single-source shortest path problem. In: Proceedings of CEC 2007, pp. 1890-1895. IEEE, Los Alamitos (2007)
5. Doerr, B., Johannsen, D.: Adjacency list matchings - an ideal genotype for cycle covers. In: Proceedings of GECCO 2007, pp. 1203-1210. ACM, New York (2007)
6. Doerr, B., Johannsen, D.: Edge-based representation beats vertex-based representation in shortest path problems. In: Proceedings of GECCO 2010. ACM, New York (to appear, 2010)
7. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Proceedings of CEC 2010. IEEE, Los Alamitos (to appear, 2010)
8. Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. In: Proceedings of GECCO 2010. ACM, New York (to appear, 2010)
9. Doerr, B., Klein, C., Storch, T.: Faster evolutionary algorithms by superior graph representation. In: Proceedings of FOCI 2007, pp. 245-250. IEEE, Los Alamitos (2007)
10. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51-81 (2002)
11. Dyer, M., Greenhill, C.: Random walks on combinatorial objects. In: Surveys in Combinatorics 1999, pp. 101-136. University Press (1999)
12. Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii academiae scientiarum Petropolitanae 8, 128-140 (1741)
13. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 415-426. Springer, Heidelberg (2003) (Pubitemid 36309294)
14. Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multi-objective optimization. In: Proceedings of GECCO 2006, pp. 651-658. ACM, New York (2006)
15. Grimmett, G.R., Stirzaker, D.R.: Probability and random processes, 2nd edn. The Clarendon Press Oxford University Press, New York (1992)
16. Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability 13, 502-525 (1982)
17. Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Proceedings of GECCO 2008, pp. 953-960. ACM, New York (2008)
18. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 57-85 (2001)
19. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3, 21-35 (2004) (Pubitemid 39127657)
20. Hierholzer, C.: Über die Möglichkeit, einen Linenzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen 6, 30-32 (1873)
21. Neumann, F.: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. In: Proceedings of CEC 2004, pp. 904-910. IEEE, Los Alamitos (2004)
22. Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Proceedings of GECCO 2009, pp. 835-842. ACM, New York (2009)
23. Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Compututer Science 378, 32-40 (2007) (Pubitemid 46711139)
24. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 82-91. Springer, Heidelberg (2008)
25. Reichel, J., Skutella, M.: Evolutionary algorithms and matroid optimization problems. In: Proceedings of GECCO 2007, pp. 947-954. ACM, New York (2007)
26. Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 4, 349-366 (2004) (Pubitemid 40317583)