Multiplicative drift analysis

Algorithmica

Volumn 64, Issue 4, 2012, Pages 673-697

  Doerr, Benjamin ^a   Johannsen, Daniel ^b   Winzen, Carola ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Drift analysis; Evolutionary algorithms; Randomized search heuristics; Runtime analysis

Indexed keywords

BIT-STRINGS; CLASSICAL PROBLEMS; COMBINATORIAL PROBLEM; DRIFT ANALYSIS; EULER TOUR; EXPECTED TIME; GLOBAL OPTIMUM; LINEAR FUNCTIONS; LOWER BOUNDS; MINIMUM SPANNING TREES; MULTIPLICATIVE VERSION; NATURAL PROOFS; PSEUDO-BOOLEAN FUNCTION; RANDOMIZED SEARCH HEURISTICS; RUN-TIME ANALYSIS; RUNTIMES; SHORTEST PATH;

BOOLEAN FUNCTIONS; GRAPH THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 84868354512     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-012-9622-x     Document Type: Article

References (27)

1. Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. Series on Theoretical Computer Science, vol. 1. World Scientific, Singapore (2011)
2. Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P., Neumann, F.: Computing single source shortest paths using single-objective fitness: FOGA'09: Proceedings of the 10th ACM Workshop on Foundations of Genetic Algorithms, pp. 59-66. ACM, New York (2009)
3. Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds: PPSN '10: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, pp. 174-183. Springer, Berlin (2010)
4. Doerr, B., Goldberg, L.A.: Adaptive drift analysis: PPSN '10: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, pp. 32-41. Springer, Berlin (2010)
5. Doerr, B., Johannsen, D.: Adjacency list matchings - an ideal genotype for cycle covers: GECCO'07: Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference, pp. 1203-1210. ACM, New York (2007)
6. Doerr, B., Johannsen, D.: Edge-based representation beats vertex-based representation in shortest path problems: GECCO '10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, pp. 759-766. ACM, New York (2010)
7. Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms: GECCO'10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, pp. 1457-1464. ACM, New York (2010)
8. Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Optimizing monotone functions can be difficult: PPSN '10: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, pp. 42-51. Springer, Berlin (2010)
9. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited: CEC '10: Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pp. 1967-1974. IEEE, New York (2010)
10. Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis: GECCO'10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, pp. 1449-1456. ACM, New York (2010)
11. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2), 51-81 (2002)
12. Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multi-objective optimization: GECCO'06: Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference, pp. 651-658. ACM, New York (2006)
13. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem: STACS '03: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2607, pp. 415-426. Springer, Berlin (2003)
14. Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 14(3), 387-403 (1982)
15. Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions: GECCO'08: Proceedings of the 10th Annual Genetic and Evolutionary Computation Conference, pp. 953-960. ACM, New York (2008)
16. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Acta Inform. 127(1), 51-81 (2001)
17. He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]. Acta Inform. 140(1-2), 245-248 (2002)
18. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21-35 (2004)
19. Jägersküpper, J.: A blend of Markov-chain and drift analysis: PPSN '08: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature, pp. 41-51. Springer, Berlin (2008)
20. Jansen, T., Oliveto, P.S., Zarges, C.: On the analysis of the immune-inspired B-Cell Algorithm for the vertex cover problem: ICARIS '11: Proceedings of the 10th International Conference on Artificial Immune Systems. Lecture Notes in Computer Science, vol. 6825, pp. 117-131. Springer, Berlin (2011)
21. Kano, M.: Maximum and kth maximal spanning trees of a weighted graph. Combinatorica 7(2), 205- 214 (1987)
22. Mühlenbein, H.: How genetic algorithms really work: mutation and hill-climbing: PPSN '92: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature, pp. 15-25 (1992)
23. Neumann, F.,Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanningtree problem. Theor. Comput. Sci. 378(1), 32-40 (2007)
24. Neumann, F., Oliveto, P.S.,Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency: GECCO'09: Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, pp. 835-842. ACM, New York (2009)
25. Oliveto, P.S.,Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369-386 (2011)
26. Scheder, D., Welzl, E.: Private communications (2008)
27. Witt, C.: Tight bounds on the optimization time of the (1+1) EA on linear functions: STACS '12: Proceedings of the 29th Annual Symposium on Theoretical Aspects of Computer Science (2012, to appear)