Towards an analytic framework for analysing the computation time of evolutionary algorithms

Jun HE, Xin YAO

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

164 Citations (Scopus)

Abstract

In spite of many applications of evolutionary algorithms in optimisation, theoretical results on the computation time and time complexity of evolutionary algorithms on different optimisation problems are relatively few. It is still unclear when an evolutionary algorithm is expected to solve an optimisation problem efficiently or otherwise. This paper gives a general analytic framework for analysing first hitting times of evolutionary algorithms. The framework is built on the absorbing Markov chain model of evolutionary algorithms. The first step towards a systematic comparative study among different EAs and their first hitting times has been made in the paper. © 2003 Published by Elsevier Science B.V.
Original languageEnglish
Pages (from-to)59-97
Number of pages39
JournalArtificial Intelligence
Volume145
Issue number1-2
DOIs
Publication statusPublished - Apr 2003
Externally publishedYes

Bibliographical note

Work partially supported by an EPSRC grant (GR/R52541/01) and the State Key Engineering at Wuhan University.

Keywords

  • Evolutionary algorithms
  • First hitting time
  • Markov chain
  • Time complexity

Fingerprint

Dive into the research topics of 'Towards an analytic framework for analysing the computation time of evolutionary algorithms'. Together they form a unique fingerprint.

Cite this