arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.08117cs.NEmath.OC
收藏

进化算法的平均收敛速度

Average Convergence Rate of Evolutionary Algorithms

Jun He, Guangming Lin

摘要:

在进化优化中,重要的是要了解进化算法每代收敛到最优值的速度,或者它们的收敛速度。本文提出了一种新的收敛速度的度量,称之为平均收敛速度。它是每代适应度差异减少比率的归一化几何平均值。平均收敛速度的计算非常简单,适用于大多数连续和离散优化的进化算法。对离散优化问题的平均收敛速度进行了理论研究。的平均收敛速度的下界。分析了平均收敛速度的极限,提出了渐近平均收敛速度。

英文摘要:

In evolutionary optimization, it is important to understand how fast evolutionary algorithms converge to the optimum per generation, or their convergence rate. This paper proposes a new measure of the convergence rate, called average convergence rate. It is a normalised 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 analysed and then the asymptotic average convergence rate is proposed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑