Drift conditions for estimating the first hitting times of evolutionary algorithms

References

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