Drift conditions for estimating the first hitting times of evolutionary algorithms

International Journal of Computer Mathematics

Volumn 88, Issue 1, 2011, Pages 37-50

  Chen, Yu ^a   Zou, Xiufen ^a   He, Jun ^b  

^a WUHAN UNIVERSITY   (China)

^b ABERYSTWYTH UNIVERSITY   (United Kingdom)

Author keywords

approximate solutions; complexity theory; evolutionary algorithm; first hitting time; global optimization

Indexed keywords

APPROXIMATE SOLUTION; COMPLEXITY THEORY; CONTINUOUS VARIABLES; EVOLUTIONARY ALGORITHMS (EAS); FIRST HITTING TIME; GLOBAL OPTIMIZATION PROBLEMS; HITTING TIME; UPPER BOUND;

ESTIMATION; GLOBAL OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 78650561726     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160903477167     Document Type: Article

References (21)

1. H. G. Beyer, H.-P. Schwefel, and I. Wegener, How to analyse evolutionary algorithms, Theoret. Comput. Sci. 287(2002), pp. 101-130.
2. H. Dong, J. He, H. Huang, and W. Hou, Evolutionary programming using a mixed mutation strategy, Inf. Sci. 177(2007), pp. 312-327.
3. A. E. Eiben and G. Rudolph, Theory of evolutionary algorithms: A bird eye view, Theoret. Comput. Sci. 229(1999), pp. 3-9.
4. T. Friedrich, N. Hebbinghaus, F. Neumann, J. He, and C. Witt, Approximating covering problems by randomized search heuristics using multi-objective models, in Proceedings of the 9th annual conference on Genetic and Evolutionary Computation - GECCO 2007, ACM, London, UK, 2007, pp. 797-804.
5. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
6. J. He and X. Yao, Drift analysis and average time complexity of evolutionary algorithms, Artif. Intell. 127(2001), pp. 57-85. (Pubitemid 32264935)
7. J. He and X. Yao, A study of drift analysis for estimating computation time of evolutionary algorithms, Nat. Comput. 3(2004), pp. 21-35.
8. J. He, X. Yao, and J. Li, A comparative study of three evolutionary algorithms incorporating different amount of domain knowledge for node covering problems, IEEE Trans. Syst. Man Cybern. 35(2005), pp. 266-271.
9. J. Jägersküpper, How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms, Theor. Comput. Sci. 361(2006), pp. 38-56.
10. J. Jägersküpper, Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Theor. Comput. Sci. 379(2007), pp. 329-347.
11. J. Jägersküpper, Lower bounds for randomized direct search with isotropic sampling, Oper. Res. Lett. 36(2008), pp. 327-332.
12. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Program, 3rd ed., Springer, New York, 1996.
13. F. Neumann, Expected runtimes of evolutionary algorithms for the Eulerian cycle problem, Comput. Oper. R. 35(2008), pp. 2750-2759.
14. F. Neumann and I. Wegener, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem, Theoret. Comput. Sci. 378(2007), pp. 32-40. (Pubitemid 46711139)
15. PS. Oliveto, J. He, and X. Yao, Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results, Int. J. Autom. Comput. 4(2007), pp. 281-293.
16. G. Rüdolph, Convergence rate of evolutionary algorithms for a class of convex objective functions, Control Cybernet. 26(1997), pp. 375-390. (Pubitemid 127156689)
17. G. Rüdolph, Finite Markov chain results in evolutionary computation: A tour dHorizon, Fund. Inform. 35(1998), pp. 67-89.
18. H. P. Schwefel, Evolution and Optimum Seeking, Wiley, New York, 1995.
19. C. Witt, Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions, Evol. Comput. 14(2006), pp. 65-86.
20. C. Witt, Worst-case and average-case approximations by simple randomized search heuristics, in Lecture Notes in Computer Science, Vol. 3405, Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), LNCS 3404, V. Diekert and B. Durand, eds., Springer, Berlin, Heidelberg, pp. 44-56.
21. Y. Zhou and J. He, A runtime analysis of evolutionary algorithms for constrained optimization problems, IEEE Trans. Evol. Comput. 11(2007), pp. 608-619.