计算机与现代化 ›› 2023, Vol. 0 ›› Issue (03): 113-120.

• 算法设计与分析 • 上一篇    下一篇

基于反向学习和精英提升的无速度项动态粒子群算法

  

  1. (同济大学电子与信息工程学院,上海 201804)
  • 出版日期:2023-04-17 发布日期:2023-04-17
  • 作者简介:曾依浦(1998—),男,福建漳州人,硕士研究生,研究方向:群智能优化算法,E-mail: 2032961@tongji.edu.cn; 戴毅茹(1972—),女,河南新蔡人,副研究员,博士,研究方向:系统工程,E-mail: zlydyr@tongji.edu.cn; 陈雨田(2001—),男,陕西西安人,本科生,研究方向:微电子,E-mail: 1953900@tongji.edu.cn。
  • 基金资助:
    上海市自然科学基金资助项目(19ZR1461500)

Dynamic Particle Swarm Optimization without Velocity Based on Opposition-based Learning and Elite Promotion

  1. (College of Electronic and Information Engineering, Tongji University, Shanghai 201804, China)
  • Online:2023-04-17 Published:2023-04-17

摘要: 针对粒子群优化算法在处理复杂优化问题时搜索精度低、收敛速度慢且易陷入局部最优的问题,提出一种基于反向学习和精英提升的动态多种群无速度项粒子群算法。首先基于无速度项的粒子位置更新模式,动态划分子群并采用不同的进化策略,利用反向学习为子群拓宽搜索范围,保证种群多样性的同时避免粒子过早陷入局部最优。然后为充分利用优秀粒子的信息并提高搜索精度,改进精英提升策略优化个体历史最优粒子,使用差分进化算法对种群最优粒子进行更新。最后通过CEC2006提出的22个测试函数进行性能测试。结果表明,本文提出的算法相比于其他算法在搜索精度和稳定性上拥有更加出色的性能,并能有效提升算法收敛速度。

关键词: 粒子群优化算法, 无速度项, 动态划分, 反向学习, 精英提升, 差分进化

Abstract: To resolve the problem that particle swarm optimization algorithm has low search accuracy, slow convergence speed and easy to fall into local optimization when dealing with complex optimization problems, a dynamic multi population particle swarm without velocity based on opposition-based learning and elite promotion is proposed. Firstly, based on the particle position update mode without velocity term, this algorithm dynamically divides subpopulations and adopts different evolutionary strategies. Opposition-based learning is used to broaden the search range for subgroups, ensuring population diversity and avoid particles falling into local optimization too early. Then, in order to make full use of the information of excellent particles and improve the search accuracy, the elite promotion strategy is improved to optimize the individual historical optimal particles. The differential evolution algorithm is used to update the optimal particle of the population. Finally, the performance is tested by 22 test functions proposed by CEC2006. The experimental results show that the proposed algorithm has more excellent performance in search accuracy and stability compared with other algorithms. In addition, the proposed algorithm can effectively improve the convergence speed.

Key words: particle swarm optimization algorithm, no-velocity term, dynamic partition, opposition-based learning, elite promotion, differential evolution