Combining Markov-Chain analysis and drift analysis: The (1+1) evolutionary algorithm on linear functions reloaded

Algorithmica (New York)

Volumn 59, Issue 3, 2011, Pages 409-424

  Jägersküpper, Jens ^a  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Direct search; Drift analysis; Evolutionary algorithms; Genetic algorithms; Heuristic optimization; Markov Chain analysis; Randomized algorithms

Indexed keywords

DIRECT SEARCH; DRIFT ANALYSIS; HEURISTIC OPTIMIZATION; MARKOV-CHAIN ANALYSIS; RANDOMIZED ALGORITHMS;

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION;

HEURISTIC ALGORITHMS;

EID: 79951673782     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9396-y     Document Type: Article

References (11)

1. S. Droste T. Jansen I. Wegener 2002 On the analysis of the (1+1) evolutionary algorithm Theor. Comput. Sci. 276 1-2 51 82 1002.68037 10.1016/S0304-3975(01)00182-7 1896347 (Pubitemid 34295606)
2. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Proc. 20th Int'l Symposium on Theoretical Aspects of Computer Science (STACS). LNCS, vol. 2607, pp. 415-426. Springer, Berlin (2003)
3. 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)
4. J. He X. Yao 2002 Erratum to: Drift analysis and average time complexity of evolutionary algorithms (He and Xao 2001) Artif. Intell. 140 1/2 245 248 1052.68113 10.1016/S0004-3702(02)00260-6 1928198 (Pubitemid 34965462)
5. 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)
6. J. Jägersküpper 2007 Algorithmic analysis of a basic evolutionary algorithm for continuous optimization Theor. Comput. Sci. 379 3 329 347 1149.90147 10.1016/j.tcs.2007.02.042 (Pubitemid 46754584)
7. Jägersküpper, J.: A blend of Markov-chain and drift analysis. In: Proc. 10th Int'l Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, vol. 5199, pp. 41-51. Springer, Berlin (2008)
8. Jägersküpper, J., Witt, C.: Rigorous runtime analysis of a (μ+1) ES for the Sphere function. In: Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), pp. 849-856. ACM, New York (2005) (Pubitemid 43226385)
9. G. Rudolph 1998 Finite Markov chain results in evolutionary computation: A tour d'horizon Fundam. Inform. 35 1-4 67 89 0943.68060 1685143 (Pubitemid 128435959)
10. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization. Int'l Series in Operations Research & Management Science, vol. 48, pp. 349-369. Kluwer Academic, Dordrecht (2003)
11. I. Wegener C. Witt 2005 On the optimization of monotone polynomials by simple randomized search heuristics Comb. Probab. Comput. 14 1-2 225 247 1062.68049 10.1017/S0963548304006650 2128091 (Pubitemid 40303861)