种改进的自适应逃逸微粒群算法及实验分析.pdf

1000-9825/2005/16(12)2036 ©2005 Journal of Software 软 件 学 报 Vol.16, No.12 ∗ 一种改进的自适应逃逸微粒群算法及实验分析 1+ 1,2 1 1 1 赫 然 , 王永吉 , 王 青 , 周津慧 , 胡陈勇 1( 中国科学院 软件研究所 互联网软件技术实验室,北京 100080) 2( 中国科学院 软件研究所 计算机科学重点实验室,北京 100080) An Improved Particle Swarm Optimization Based on Self-Adaptive Escape Velocity 1+ 1,2 1 1 1 HE Ran , WANG Yong-Ji , WANG Qing , ZHOU Jin-Hui , HU Chen-Yong 1(Laboratory for Internet Software Technologies, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China) 2(Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China) + Corresponding author: Phn: +86-10ext 805, E-mail: heran@, Received 2004-10-25; Accepted 2005-04-10 He R, Wang YJ, Wang Q, Zhou JH, Hu CY. An improved particle swarm optimization based on self-adaptive escape velocity. Journal of Software, 2005,16(12):2036−2044. DOI: 10.1360/jos162036 Abstract: To deal with the problem of premature convergence and slow search speed, this paper proposes a novel particle swarm optimization (PSO) called self-adaptive escape PSO, which is guaranteed to converge to the global optimization solution with probability one. Considering that the organisms have the phenomena of escaping from the original cradle when they find the survival density is too high to live, this paper uses a special mutation –escape operator to make particles explore the search space more efficiently . The novel strategy produces a large speed value dynamically according to the variation of the speed, which makes the algorithm explore the loc