Drift conditions for time complexity of evolutionary algorithms

Jun HE, Xin YAO, Li-Shan KANG

Research output: Journal PublicationsJournal Article (refereed)peer-review

3 Citations (Scopus)


The computational time complexity is an important topic in the theory of evolutionary algorithms. This paper introduces drift analysis into analysing the average time complexity of evolutionary algorithms, which are applicable to a wide range of evolutionary algorithms and many problems. Based on the drift analysis, some useful drift conditions to determine the time complexity of evolutionary algorithms are studied. These conditions are applied into the fully deceptive problem to verify their efficiency.
Original languageEnglish
Pages (from-to)1775-1783
Number of pages9
JournalRuan Jian Xue Bao/Journal of Software
Issue number12
Publication statusPublished - 2001
Externally publishedYes


  • Combinatorial optimisation
  • Evolutionary algorithms
  • Markov chain
  • Time complexity


Dive into the research topics of 'Drift conditions for time complexity of evolutionary algorithms'. Together they form a unique fingerprint.

Cite this