期刊
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
卷 20, 期 2, 页码 316-321出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2015.2444793
关键词
Convergence rate; evolutionary algorithms (EAs); evolutionary optimization; Markov chain; matrix analysis
资金
- Engineering and Physical Sciences Research Council [EP/I009809/1] Funding Source: researchfish
- EPSRC [EP/I009809/1] Funding Source: UKRI
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 fitness 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据