Drift analysis in studying the convergence and hitting times of evolutionary algorithms: An overview



This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with Markov chains or supermartingales. Then the drift conditions which guarantee the convergence of evolutionary algorithms are described. And next the drift conditions which are used to estimate the hitting times of evolutionary algorithms are presented. Finally an example is given to show how to analyse hitting times of EAs by drift analysis approach.

Key words

evolutionary algorithms convergence hitting time drift analysis CLC number TP 301.5 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Back T, Fogel D B, Michalewicz Z.Handbook of Evolutionary Computation. Oxford: Oxford University Press, 1997.Google Scholar
  2. [2]
    Back T, Kok J N, DeGraaf J M, etal. Theory of Genetci Algorithms.Bulletin of the EATCS, 1997,63:161–192.MathSciNetGoogle Scholar
  3. [3]
    Rudolph, G. Finite Markov Chain Results in Evolutionary Computation: A Tour d’Horizon.Fundamenta Informaticae, 1998,35(1–4): 67–89.MATHMathSciNetGoogle Scholar
  4. [4]
    Eiben, A E, Rudolph G. Theory of Evolutionary Algorithms: A Bird Eye View.Theoretical Computer Science, 1999,229 (l/2):3–9.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Rudolph G. Convergence Analysis of Canonical Genetic Algorithms.IEEE Trans Actions on Neural Networks, 1994,5(1):96–101.CrossRefGoogle Scholar
  6. [6]
    Rudolph G.Convergence Properties of Evolutionary Algorithms. Hamburg: Kovavc, 1997.Google Scholar
  7. [7]
    Droste S, Jansen T, Wegener I. A rigorous Complexity Analysis of the (1+1) Evolutionary Algorithm for Linear Functions with Boolean Inputs.Evolutionary Computation, 1998,6(2):185–196.CrossRefGoogle Scholar
  8. [8]
    Droste S, Jansen T, Wegener I. Newblock on the Analysis of the (1+1) Evolutionary Algorithms.Theoretcial Computer Science, 2002,276(1–2):51–81.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    He J, Yao X. Drift Analysis and Average Time Complexity of Evolutionary Algorithms.Artificial Intelligence, 2001,127(1):57–85.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    He J, Yao X. Drift Analysis for Time Complexity of Evolutionary Algorithms and Application in Fully Deceptive Problem.Chinese Journal of Software, 2001,12(12):1775–1783(Ch).Google Scholar
  11. [11]
    He J, Yao X. From an Individual to a Population; An Analysis of the First Hitting Time of Population-based Evolutionary Algorithms.IEEE Transactions on Evolutionary Computation, 2002,6(5):495–511.CrossRefGoogle Scholar
  12. [12]
    He J, Kang Li S, Chen Y P. Convergence of Genetic Evolution Algorithms for Optimization.Parallel Algorithms and Applications, 1995,4(1):37–56.Google Scholar
  13. [13]
    He J, Kang L S. On the Convergence Rate of Genetic Algorithms.Theoretical Computer Science, 1999,229(1/2):23–39.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    He J, Yu X H. Conditions for the Convergence of Evolutionary Algorithms.Journal of Systems Architecture, 2001,47(7):601–612.CrossRefGoogle Scholar
  15. [15]
    Meyn S P. Tweedie R L.Markov chains and Stochastic Stability. New York: Springer-Verlag, 1993.MATHGoogle Scholar
  16. [16]
    Beyer H G.The Theory of Evolutionary Strategies. Berlin: Springer, 2001.Google Scholar
  17. [17]
    Chow Y S, Teicher T.Probability Theory: Indepedenece, Interchangeability and Martingales. New York: Sprnger-Verlag, 1988.Google Scholar

Copyright information

© Springer 2003

Authors and Affiliations

  1. 1.State Laboratory of Software EngineeringWuhan UniversityWuhan, HubeiChina
  2. 2.School of Computer ScienceUniversity of BirminghamBirminghamEngland

Personalised recommendations