Skip to main navigation Skip to search Skip to main content

Average Convergence Rate of Evolutionary Algorithms

  • Jun He
  • , Guangming Lin
  • Shenzhen Institute of Information Technology

Research output: Contribution to journal › Article › peer-review

85 Citations (Scopus)
467 Downloads (Pure)

Abstract

In evolutionary optimization, it is important to understand how fast evolutionary algorithms converge to the optimum per generation, or their convergence rates. This letter proposes a new measure of the convergence rate, called the average convergence rate. It is a normalized geometric mean of the reduction ratio of the fitneb difference per generation. The calculation of the average convergence rate is very simple and it is applicable for most evolutionary algorithms on both continuous and discrete optimization. A theoretical study of the average convergence rate is conducted for discrete optimization. Lower bounds on the average convergence rate are derived. The limit of the average convergence rate is analyzed and then the asymptotic average convergence rate is proposed.

Original languageEnglish
Article number7122298
Pages (from-to)316-321
Number of pages6
JournalIEEE Transactions on Evolutionary Computation
Volume20
Issue number2
Early online date11 Jun 2015
DOIs
Publication statusPublished - Apr 2016

Keywords

  • Markov chain
  • Matrix analysis
  • convergence rate
  • evolutionary algorithms
  • evolutionary optimization

Fingerprint

Dive into the research topics of 'Average Convergence Rate of Evolutionary Algorithms'. Together they form a unique fingerprint.

Cite this