融合局部搜索与二次插值的粒子群优化算法

计算机科学 ›› 2013, Vol. 40 ›› Issue (9): 204-207.

融合局部搜索与二次插值的粒子群优化算法

钱伟懿,刘光雷

渤海大学数理学院锦州121000;渤海大学数理学院锦州121000

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金项目(10871033),辽宁省自然科学基金项目(20102003)资助

Particle Swarm Optimization Algorithm Combining Local Search and Quadratic Interpolation

QIAN Wei-yi and LIU Guang-lei

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 针对粒子群优化算法易早熟和求解精度差等问题,提出一种融合局部搜索与二次插值的粒子群优化算法。首先由标准粒子群优化算法产生N个位置,从这N个位置中随机选取3个不同位置,进行二次插值操作产生每个粒子的新位置,更新每个粒子的历史最好位置的全局最好位置；然后经过一定迭代步后,利用Hooke-Jeeves局部搜索技术,对得到的当前全局最优位置进行局部搜索；最后,对9个典型测试函数进行仿真实验并与其它算法进行比较,数值结果表明所提出的算法具有较快的收敛速度和较强的全局搜索能力。

关键词: 粒子群优化,二次插值,局部搜索,全局优化中图法分类号TP18文献标识码A

Abstract: To the problems of premature convergence frequently appeared in Particle Swarm Optimization(PSO)algorithm and its poor convergence accuracy,a particle swarm optimization algorithm combining local search and quadratic interpolation was proposed．Firstly,we randomly chose three positions from the N positions which are generated by standard Particle Swarm Optimization algorithm,and the new position was generated by using quadratic interpolation operator for each particle,and the previous best position of each particle and the global best position of swarm were updated.Then after some iteration steps,the Hooke-Jeeves local search technique optimized the global best position of the swarm found so far．Finally,simulation experiment on a set of 9benchmark functions was given,and the comparisons with other algorithms were provided．The numerical results show that the proposed algorithm has a fast convergence speed and good global search capability.

Key words: Particle swarm optimization,Quadratic interpolation,Local search,Global optimization

钱伟懿,刘光雷. 融合局部搜索与二次插值的粒子群优化算法[J]. 计算机科学, 2013, 40(9): 204-207. https://doi.org/

QIAN Wei-yi and LIU Guang-lei. Particle Swarm Optimization Algorithm Combining Local Search and Quadratic Interpolation[J]. Computer Science, 2013, 40(9): 204-207. https://doi.org/

参考文献

[1] Kennedy J,Eberhartr C．Particle swarm optimization:[C]∥Proceedings of IEEE International Conference on Neural Networks．Perth Australia,IEEE Service Center,1995:1942-1948
[2] Angeline P J．Using selection to improve particle swarm optimization[C]∥Proceedings of the IEEE congress on Evolutionary Computation．Anchorage,Alaska,IEEE press,1998:84-89
[3] 窦全胜,周春光,张忠波,等．基于微分演化的PSO参数选择策略[J]．计算机科学,2007,34(4):288-230
[4] Ratnaweera A,Halgamuge S K,Watson H C．Self- organizinghierarchical particle swarm optimizer with time varying accele-rating coefficients [J]．IEEE Transactions on Evolutionary Computation,2004,8(3):240-255
[5] Grimaccia F,Mussetta M,Zich R E．Genetical swarm optimization:self-adaptive hybrid evolutionary algorithm for electromagnetics[J]．IEEE Transactions on Evolutionary Computation,2007,55(3):781-785
[6] 章慧云,黄晓伟,张红华,等．混合型粒子群优化算法研究[J]．计算机应用研究,2011,8(5):131-133
[7] 肖丽,张伟,张元清．一种结合自适应局部搜索的粒子群优化算法[J]．计算机科学,2007,34(8):199-201
[8] 陈红安,张英杰,吴建辉．基于非线性共轭梯度法的混沌微粒群优化算法[J]．计算机应用,2009,29(12):3273-3276
[9] 徐文星,耿志强,朱群雄,等．基于SQP局部搜索的混沌粒子群优化算法[J]．控制与决策,2012,27(4):557-561
[10] 吴建辉,章兢,陈红安．融合Powell搜索的粒子群优化算法[J]．控制与决策,2012,27(3):343-348
[11] 高卫峰,刘三阳．一种高效粒子群优化算法[J]．控制与决策,2011,26(8):1158-1161
[12] Hooke R,Jeevers T A．Direct search solution of numerical and statistical problems [J]．Journal of the Association for Computing Machinery,1961,8:212-229
[13] Yao X,Liu Y,Lin G．Evolutionary programming made faster[J]．IEEE Transactions on Evolutionary Computation,1999,3(2):82-101
[14] Shi Y,Eberhart R C．Empirical study of particle swarm optimization [C]∥Proc of Congress on Computational Intelligence．Washington,USA,IEEE Service Center,1999:1945-1950
[15] Zhan Z H,Zhang J,Li Y,et al．Adaptive particle swarm optimization [J]．IEEE Trans on Systems,Man,and Cybernetics:Part B,2009,39(6):1362-1381

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed