Conditions for the convergence of evolutionary algorithms

Jun He, Xinghuo Yu

Research output: Contribution to journalArticlepeer-review

52 Citations (SciVal)

Abstract

This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary and sufficient conditions, necessary conditions, and sufficient conditions for the convergence of evolutionary algorithms to the global optima are derived, which describe their limiting behaviors. Their relationships are explored. Upper and lower bounds of the convergence rates of the evolutionary algorithms are given.
Original languageEnglish
Pages (from-to)601-612
JournalJournal of Systems Architecture
Volume47
Issue number7
DOIs
Publication statusPublished - 01 Jul 2001

Keywords

  • evolutionary algorithms
  • markov chain
  • convergence
  • convergence rate

Fingerprint

Dive into the research topics of 'Conditions for the convergence of evolutionary algorithms'. Together they form a unique fingerprint.

Cite this