Cooperative Double-center QPSO Algorithm with Self-adaptive Contraction-expansion Coefficient

doi:10.3969/j.issn.1000-3428.2014.03.049

Abstract

Abstract: Against the problems of Quantum Particle Swarm Optimization(QPSO) algorithm in the late part of iterations, such as decline of population diversity, slow convergence rate and easy to fall into the local optima, a cooperative double-center QPSO algorithm with self-adaptive contraction-expansion coefficient is proposed in this paper. It has two characteristics: (1)The contraction-expansion coefficient is self-adaptively adjusted, which can help jump out of the local optima and improve the global search ability; (2)It renews the global best location of every iteration in two ways, and one way of them is the same as that in QPSO, the other is that double-center particles, together with the current global optimal location, which is used to improve the way of renewing the global best location by cooperating in the corresponding dimensions among them. The performance of this algorithm is analyzed from fixed iterations and fixed precisions. Experimental results show that compared with QPSO, it has higher convergence rate and better search ability.

Key words: Quantum Particle Swarm Optimization(QPSO) algorithm, contraction-expansion coefficient, double-center particle, cooperative, global optimal location

摘要： 针对量子粒子群优化(QPSO)算法迭代后期种群多样性下降、收敛速度慢、易陷入局部最优的缺点，提出一种自适应收缩-扩张系数的双中心协作量子粒子群优化算法。该算法从2个方面进行改进：(1)自适应调节收缩-扩张系数，其目的是帮助粒子跳出局部最优点，提高粒子的全局搜索能力；(2)双重更新全局最优位置，即在每次迭代中，先后分别采用2种不同的方式更新全局最优位置。第1种方式与QPSO算法一致，第2种方式则引入双中心粒子，使其和当前全局最优位置在相应维度上合作，从而达到更新全局最优位置的目的。从固定迭代次数和固定精度角度分析算法性能，仿真结果表明，相比于QPSO算法，该算法在保证复杂度较低的情况下，可提高收敛速度，增强全局和局部搜索能力。

关键词: 量子粒子群优化算法, 收缩-扩张系数, 双中心粒子, 协作, 全局最优位置

CLC Number:

TP301.6

DING Ying, LI Fei. Cooperative Double-center QPSO Algorithm with Self-adaptive Contraction-expansion Coefficient[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2014.03.049.

丁颖，李飞. 自适应收扩系数的双中心协作QPSO算法[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2014.03.049.

/ / Recommend / Download Citations

URL: http://www.ecice06.com/EN/10.3969/j.issn.1000-3428.2014.03.049

http://www.ecice06.com/EN/Y2014/V40/I3/232

References

参考文献 [1] Sun Jun, Feng Bin, Xu Wenbo. Particle Swarm Optimization with Particles Having Quantum Behavior[C]//Proc. of 2004 Congress on Evolutionary Computation. Piscataway, USA: [s. n.], 2004. [2] Sun Jun, Xu Wenbo, Feng Bin. A Global Search Strategy of Quantum-behaved Particle Swarm Optimization[C]//Proc. of IEEE Conference on Cybernetics and Intelligent Systems. Singapore: IEEE Press, 2004. [3] 李盼池, 王海英. 量子势阱粒子群优化算法的改进研究[J]. 物理学报, 2012, 61(6): 19-27. [4] 方伟, 孙俊, 谢振平, 等. 量子粒子群优化算法的收敛性分析及控制参数研究[J]. 物理学报, 2010, 59(6): 3686- 3694. [5] 黄泽霞, 俞攸红. 惯性权自适应调整的量子粒子群算法[J].上海交通大学学报, 2012, 46(2): 228-232. [6] 程伟, 陈森发. 权重自适应调整的混沌量子粒子群优化[J]. 计算机工程与应用, 2010, 46(9): 46-48. [7] Gong Shangfu, Gong Xingyu, Bi Xiaoru. Feature Selection Method for Network Intrusion Based on GQPSO Attribute Reduction[C]//Proc. of International Conference on Multimedia Technology. Hangzhou, China: [s. n.], 2011. [8] Lu Kezhong, Fang Kangnian, Xie Guangqian. A Hybrid Quantum-behaved Particle Swarm Optimization Algorithm for Clustering Analysis[C]//Proc. of the 5th International Conference on Fuzzy Systems and Knowledge Discovery. Jinan, China: [s. n.], 2008. [9] 胡苓苓, 郭业才. 基于QPSO的小波分数间隔盲均衡算法[J]. 计算机工程, 2011, 37(24): 195-197. [10] 汤可宗, 柳炳祥. 双中心粒子优化算法[J]. 计算机研究与发展, 2012, 49(5): 1086-1094. [11] Li Yangyang, Xiang Ronggong, Jiao Licheng. An Improved Cooperative Quantum-behaved Particle Swarm Optimization [J]. Soft Computing, 2012, 16(6): 1061-1069. [12] Kennedy J, Eberhart R. Particle Swarm Optimization[C]//Proc. of IEEE International Conference on Neural Networks. Piscataway, USA: IEEE Press, 1995. [13] Sun Jun, Fang Wei, Wu Xiaojun. Quantum-behaved Particle Swarm Optimization: Analysis of the Individual Particle’s Behavior and Parameter Selection[J]. Evolutionary Compu- tation, 2012, 20(3): 349-393. [14] Zhu Haodong, Zhong Yong. Study of Optimized RBF Network in Feature Selection[J]. Journal of Microcomputer & Its Applications, 2009, 28(15): 76-79. [15] Liu Junhui, Li Na. Parallel Adaptive Immune Quantum-Behaved Particle Swarm Optimization Algorithm(PAIQPSO)[C]//Proc. of International Conference on Intelligent Systems Design and Engineering Application. Sanya, China: [s. n.], 2012. [16] 陈伟, 周頔, 孙俊陈, 等. 一种采用完全学习策略的量子行为粒子群优化算法[J]. 控制与决策, 2012, 27(5): 719- 730. 编辑金胡考

Please choose a citation manager

Content to export