Simplified drift analysis for proving lower bounds in evolutionary computation

Algorithmica (New York)

Volumn 59, Issue 3, 2011, Pages 369-386

  Oliveto, Pietro S ^a   Witt, Carsten ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

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

Indexed keywords

DRIFT ANALYSIS; EVOLUTIONARY COMPUTATIONS; LOWER BOUNDS; RANDOMIZED SEARCH HEURISTICS; RUNTIME ANALYSIS;

COMPUTATIONAL COMPLEXITY; EXPONENTIAL FUNCTIONS; HEURISTIC ALGORITHMS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 79951672635     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9387-z     Document Type: Article

References (14)

1. S. Droste T. Jansen I. Wegener 2006 Upper and lower bounds for randomized search heuristics in black-box optimization Theory Comput. Syst. 39 4 525 544 1103.68115 10.1007/s00224-004-1177-z 2237512 (Pubitemid 43876884)
2. Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Theoretical analysis of diversity mechanisms for global exploration. In: Proc. of GECCO '08, pp. 945-952. ACM, New York (2008)
3. J. Garnier L. Kallel M. Schoenauer 1999 Rigorous hitting times for binary mutations Evol. Comput. 7 2 173 203 10.1162/evco.1999.7.2.173
4. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Proc. of STACS '03, pp. 415-426. Springer, Berlin (2003)
5. B. Hajek 1982 Hitting-time and occupation-time bounds implied by drift analysis with applications Adv. Appl. Probab. 13 3 502 525 10.2307/1426671 665291
6. Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Proc. of GECCO '08, pp. 953-960. ACM, New York (2008)
7. J. He X. Yao 2001 Drift analysis and average time complexity of evolutionary algorithms Artif. Intell. 127 1 57 85 0971.68129 10.1016/S0004-3702(01)00058-3 1831761 (Pubitemid 32264935)
8. J. He X. Yao 2004 A study of drift analysis for estimating computation time of evolutionary algorithms Nat. Comput. 3 1 21 35 1074.68062 10.1023/B:NACO.0000023417.31393.c7 2074034 (Pubitemid 39127657)
9. Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Proc. of GECCO '09, pp. 835-842. ACM, New York (2009)
10. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Proc. of PPSN'08. LNCS, vol. 5199, pp. 82-91. Springer, Berlin (2008)
11. Oliveto, P.S., He, J., Yao, X.: Evolutionary algorithms and the vertex cover problem. In: Proc. of CEC '07, pp. 1430-1438 (2007)
12. P.S. Oliveto J. He X. Yao 2007 Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results Int. J. Autom. Comput. 4 3 281 293 10.1007/s11633-007-0281-3 (Pubitemid 47167355)
13. G.H. Sasaki B. Hajek 1988 The time complexity of maximum matching by simulated annealing J. Assoc. Comput. Mach. 35 2 387 403 935258 (Pubitemid 18606930)
14. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization. Kluwer Academic, Dordrecht (2001)