Drift analysis and average time complexity of evolutionary algorithms

Jun He, Xin Yao

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

377 Dyfyniadau (Scopus)

Crynodeb

The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a problem and conditions under which an EA will take at least exponential time (in problem size) to solve a problem. The paper first presents the general results, and then uses several problems as examples to illustrate how these general results can be applied to concrete problems in analyzing the average time complexity of EAs. While previous work only considered (1+1) EAs without any crossover, the EAs considered in this paper are fairly general, which use a finite population, crossover, mutation, and selection.
Iaith wreiddiolSaesneg
Tudalennau (o-i)57-85
Nifer y tudalennau29
CyfnodolynArtificial Intelligence
Cyfrol127
Rhif cyhoeddi1
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 15 Maw 2001

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Drift analysis and average time complexity of evolutionary algorithms'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn