一种更简化而高效的粒子群优化算法-硬件和射频工程师.pdf

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.18, No.4, April 2007, pp.861−868 http://www.j DOI: 10. 1360/jos1 80861 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 一种更简化而高效的粒子群优化算法 + 胡 旺 , 李志蜀 ( 四川大学 计算机学院, 四川 成都 610065) A Simpler and More Effective Particle Swarm Optimization Algorithm + HU Wang , LI Zhi-Shu (School of Computer Science and Engineering, Sichuan University, Chengdu 610065, China) + Corresponding author: Phn: +86-28 E-mail: scuhuwang@126.com, Hu W, Li ZS. A simpler and more effective particle swarm optimization algorithm. Journal of Sof tware, 2007, 18(4):861−868. /1000-9825/18/861.htm Abstract: The basic particle swarm optimization (bPSO) has some demerits, such as relapsing into local extremum, slow convergence velocity and low convergence precision in the late evolutionary. Three algorithms, based on the simple evolutionary equations and the extrenum disturbed arithmetic operators, are proposed to overcome the demerits of the bPSO. The simple PSO (sPSO) discards the particle velocity and reduces the bPSO from the second order to the first order difference equation. The evolutionary process is only controlled by the variables of the particles position. The extremum disturbed PSO (tPSO) accelerates the particles to overstep the local extremum. The experiment results of some classic benchmark functions show that the sPSO improves extraordinarily the convergence velocity and precision in the evolutionary optimization, and the tPSO can ef