期刊文献+

具备预判能力和向最小距离学习的粒子群算法

Particle Swarm Optimization Algorithm with Predictive Ability and Learning from Minimum Distance
下载PDF
导出
摘要 针对粒子群算法求解问题时易早熟收敛,精度不高等问题,提出了具备预判能力和向最小距离学习的粒子群算法(MDPSO)。该算法中粒子的社会学习部分是从各个粒子的个体极值中提取有效信息进行学习,首先粒子对所有粒子的个体极值(包括自己)的信息进行分析,确保下一次寻优过程中向正确的方向飞行,即预判能力,防止了粒子向错误方向飞行而浪费太多时间;其次,粒子从预判的方向上选取一个最小距离来指导粒子社会部分的学习,使粒子较快的收敛到下一代较好食物的位置。最后,结合两策略的特点,可以有效的防止算法早熟收敛并提高其精度。MDPSO算法在CEC2017年版基准测试函数上的实验结果显示出该算法相比于其他的PSO算法的优势更为显著。 In order to solve the problem of particle swarm optimization,it is easy to converge prematurely and the accuracy is not high.A particle swarm optimization algorithm(MDPSO)with predictive ability and learning from the minimum distance is proposed.The social learning part of the particle in the algorithm is to extract effective information from the individual extremum of each particle for learning.First,the particle analyzes the individual extremum(including itself)information of all particles to ensure that the next op⁃timization process is correct.Fly in the direction of the particle,the predictive ability,prevents the particle from flying in the wrong di⁃rection and wasting too much time;secondly,the particle selects a minimum distance from the predictive direction to guide the learning of the social part of the particle,so that the particle quickly converges to Good food location for the next generation.Finally,combining the characteristics of the two strategies can effectively prevent the algorithm from premature convergence and improve its accuracy.The experimental results of the MDPSO algorithm on the CEC2017 benchmark test function show that the algorithm has more significant ad⁃vantages compared to other PSO algorithms.
作者 舒小丽 刘衍民 张倩 Shu Xiaoli;Liu Yanmin;Zhang Qian(School of Data Science and Information Engineering,Guizhou Minzu University,Guiyang 550025;School of Mathematics,Zunyi Normal University,Zunyi 563006;School of Mathematics and Statistics,Guizhou University,Guiyang 550025)
出处 《现代计算机》 2021年第28期45-49,54,共6页 Modern Computer
基金 国家自然科学基金(71461027)。
关键词 早熟收敛 粒子群算法 最小距离 PSO算法 寻优过程 MDP 求解问题 particle swarm optimization algorithm prediction minimum distance optimization precision
  • 相关文献

参考文献2

二级参考文献24

  • 1高鹰,谢胜利.混沌粒子群优化算法[J].计算机科学,2004,31(8):13-15. 被引量:103
  • 2Kennedy J, Eberhart R C. Particle swarm optimization[C]. Proc of IEEE Int Conf on Neural Networks. Piscataway, 1995: 1942-1948.
  • 3Suganthan P N. Particle swarm optimizer with neighborhood operator[C]. Proc of IEEE Congress on Evolution Computation. Washington, 1999: 1958-1962.
  • 4Mohais A S, Mendes R C. Neighborhood re-structuring in particle swarm optimization[C]. Proc of Australian Conf on Artificial Intelligence. Sydney, 2005: 776-785.
  • 5Peram T, Veeramachaneni K, Mohan C K. Fitness- distance-ratio based particle swarm optimization[C]. Proc of the IEEE Swarm Intelligence Symposium. Indianapolis, 2003: 174-181.
  • 6Mendes R, Kennedy J, Neves J. The fully informed particle swarm: Simpler, maybe better[J]. IEEE Trans on Evolutionary Computation, 2004, 7(8): 204-210.
  • 7Van D B F, Engelbrecht A E A cooperative approach to particle swarm optimization[J]. IEEE Trans on Evolutionary Computation, 2004, 6(8): 225-239.
  • 8Zhao S Z, Liang J J, Suganthan P N. Dynamic multi-swarm particle swarm optimizer with local search for large scale global optimization[C]. Proc of IEEE Swarm Intelligence Symposium. Hong Kong, 2008: 3845-3852.
  • 9Riget J, Vesterstroem J S. A diversity guided particle swarm optimizer-the ARPSO[R]. Aarhus: University of Aarhus, 2002.
  • 10Charles S E. Animal ecology[M]. Chicago: University of Chicago Press, 2001.

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部