Projects per year
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 language | English |
|---|---|
| Article number | 7122298 |
| Pages (from-to) | 316-321 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Evolutionary Computation |
| Volume | 20 |
| Issue number | 2 |
| Early online date | 11 Jun 2015 |
| DOIs | |
| Publication status | Published - 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.Projects
- 1 Finished
-
Evolutionary Approximation Algorithms for Optimization: Algorithm design and Complexity Analysis
He, J. (Project Lead)
Engineering and Physical Sciences Research Council
01 May 2011 → 31 Oct 2015
Project: Externally funded research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver