计算机工程与应用2013，Vol.49Issue(4)：35-38,4.DOI:10.3778/j.issn.1002-8331.1110-0183
二次插值的粒子群优化算法
Quadratic interpolation Particle Swarm Optimization algorithm
摘要
Abstract
In order to overcome the problems of premature convergence frequently in Particle Swarm Optimization (PSO), a new PSO is proposed. After the update of the particle velocity and position, two positions from set of the current personal best position are closed at random. A new position is produced by the quadratic interpolation given through three positions, i.e., global best position and two other positions. The current personal best position and the global best position are updated by comparing with the new position. Simulation experimental results of six classic benchmark functions indicate that the new algorithm greatly improves the searching efficiency and the convergence rate of PSO.关键词
粒子群优化算法/二次插值/收敛速度/全局最优Key words
Particle Swarm Optimization/quadratic interpolation/convergence speech/global optimal分类
信息技术与安全科学引用本文复制引用
钱伟懿,卢静..二次插值的粒子群优化算法[J].计算机工程与应用,2013,49(4):35-38,4.基金项目
国家自然科学基金(No.10871033) （No.10871033）
辽宁省自然科学基金(No.20102003). （No.20102003）
