摘要
对于9个典型的复杂BenchMark测试函数,分别利用PSO算法和GuoA算法进行数值计算比较,大量实验结果表明:GuoA算法更具有通用性和坚韧性,在全局收敛趋势方面较优,但是速度相对较慢;PSO算法的收敛速度很快,而且对于某些极难问题更具有优越性,但成功率相对较低,且容易早熟。
In this paper,for 9 typical and complex BenchMark testing functions,authors use the PSO and GuoA for function optimization problems.The results show that GuoA is more all-purpose and superiority on global convergence,but the velocity of convergence is more lower.The velocity of PSO is faster,and it can solve certain difficult optimization problem.But the success rate of PSO is more lower,and the premature convergence is a great drawback.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第11期100-103,共4页
Computer Engineering and Applications
基金
河北省教育厅科研项目(the Research Project of Department of Education of Hebei Province of China under Grant No.2004454)
河北省科技公关项目(No.052135152)。
关键词
演化算法
微粒群算法
郭涛算法
BenchMark函数
evolutionary algorithm
Particle Swarm Optimization (PSO)
GuoTao algorithm
BenchMark function