期刊文献+

带偏向性轮盘赌的多算子协同粒子群优化算法 被引量:5

A multi-operator collaborative particle swarm optimization algorithm with biased roulette
原文传递
导出
摘要 针对粒子群优化算法在处理高维、大规模、多变量耦合、多模态、多极值属性优化问题时易早熟收敛等性能和技术瓶颈,基于粒子群优化算法行为学习算子和3种不同学习偏好的差分变异算子,建立带偏向性轮盘赌的多算子选择与融合机制,提出一种带偏向性轮盘赌的多算子协同粒子群优化算法MOCPSO.MOCPSO针对迭代粒子群榜样粒子集,首先通过对迭代种群及其榜样粒子集优劣分组,同时采用轮盘赌分别为每组榜样粒子集选配不同学习偏好的变异算子,并为每组榜样粒子适配差分基向量和最优基向量,预学习并优化迭代种群及其榜样粒子,以权衡算法的全局探索和局部开发;然后通过合并所有子种群,并结合粒子群优化算法行为学习算子,指导迭代种群状态更新,以提高算法的全局收敛性;最后结合精英学习策略,对群体历史最优进行高斯扰动,以提高算法的局部逃生能力,保障算法收敛的多样性.实验结果表明,MOCPSO算法与5种先进的同类型群智能算法在求解CEC2014基准测试问题上具备竞争力,且有更强的优化特性. To address the performance and technical bottlenecks of a particle swarm optimization algorithm in tackling optimization problems of high-dimensional,large-scale,multivariate coupling,multi-modal,multi-extreme attribute vulnerable to premature convergence,a multi-operator selection and fusion mechanism with biased roulette is established based on the behavioral learning operator of particle swarm optimization and three differential mutation operators with different learning preferences and a multi-operator collaborative particle swarm optimization algorithm with biased roulette is proposed(MOCPSO).For balancing the exploration-exploitation trade-off,MOCPSO first groups the iterative swarm into several subswarms with different learning tasks according to the fitness,where each subswarm configures a differential mutation operator that the differential mutation vectors selected among the exemplars of all subswarms through roulette selection,to pre-learn and optimize the iterative swarm and their exemplar particles.Then all subswarms are merged undergoing behavioral learning operation of the particle swarm optimization to improve the global convergence.Finally,for guaranteeing the diversity of algorithm convergence,the MOCPSO incorporates an elitist learning strategy to guide iterative swarm escaping the possible local traps by performing Gaussian perturbation on the current global best.Experimental results show that the proposed MOCPSO algorithm possesses stronger and more competitive optimization properties than five state-of-the-art swarm intelligence algorithms in solving the CEC2014 benchmark test suit.
作者 于海波 朱秦娜 康丽 乔钢柱 曾建潮 YU Hai-bo;ZHU Qin-na;KANG Li;QIAO Gang-zhu;ZENG Jian-chao(College of Computer Science and Technology,North University of China,Taiyuan 030051,China;Institute of Big Data and Visual Computing,North University of China,Taiyuan 030051,China;College of Environment and Safety Engineering,North University of China,Taiyuan 030051,China)
出处 《控制与决策》 EI CSCD 北大核心 2024年第4期1167-1176,共10页 Control and Decision
基金 国家自然科学基金青年基金项目(62106237) 国家自然科学基金联合基金项目(U21A20542) 山西省自然科学基金项目(201901D211237)。
关键词 粒子群优化 差分演化 多算子协同 榜样竞争 偏向性变异策略 精英学习 particle swarm optimization differential evolution multi-operator coordination exemplar competition biased mutation strategy elitist learning
  • 相关文献

参考文献5

二级参考文献43

  • 1徐震浩,顾幸生.不确定条件下具有零等待的流水车间免疫调度算法[J].计算机集成制造系统,2004,10(10):1247-1251. 被引量:21
  • 2温雯,郝志峰.一种基于动态拓扑结构的PSO改进算法[J].计算机工程与应用,2005,41(34):82-85. 被引量:13
  • 3王雪飞,王芳,邱玉辉.一种具有动态拓扑结构的粒子群算法研究[J].计算机科学,2007,34(3):205-207. 被引量:16
  • 4Kennedy J, Eberhartr C. Particle swarm optimization[C]. Proc of IEEE Int Conf on Neural Networks. Perth: IEEE Piscataway, 1995: 1942-1948.
  • 5Jiao B, Lian Z G, Gu X S. A dynamic inertia weight particle swarm optimization algorithm[J]. Chaos Solitons Fractals, 2008, 37(3): 698-705.
  • 6Liang J J, Qin A K, Suganthan P N, et al. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions[J]. IEEE Trans on Evolutionary Computation, 2006, 10(3): 281-295.
  • 7Hamzacebi C, Kutay E Continuous functions minimization by dynamic random search technique[J]. Applied Mathematical Modelling, 2007, 31(10): 2189-198.
  • 8Hamzacebi C. Improving genetic algorithms, performance by local search for continuous function optimization[J]. Applied Mathematics and Computation, 2008, 196(1): 309-317.
  • 9Yao X, Liu Y, Lin G. Evolutionary programming made faster[J]. IEEE Trans on Evolutionary Computation, 1999, 3(2): 82-102.
  • 10Zhao X C. A perturbed particle swarm algorithm for numerical optimization[J]. Applied Soft Computing, 2010, 10(1): 119-124.

共引文献78

同被引文献44

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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