返回
Dynamic multi-swarm global particle swarm optimization
DOI:10.1007/s00607-019-00782-9.png)
摘要
En 中文
To satisfy the distinct requirements of different evolutionary stages, a dynamic multi-swarm global particle swarm optimization (DMS-GPSO) is proposed in this paper. In DMS-GPSO, the entire evolutionary process is segmented as an initial stage and a later stage. In the initial stage, the entire population is divided into a global sub-swarm and multiple dynamic multiple sub-swarms. During the evolutionary process, the global sub-swarm focuses on the exploitation under the guidance of the optimal particle in the entire population, while the dynamic multiple sub-swarms pour more attention on the exploration under the guidance of the neighbor's best-so-far position. Moreover, a store operator and a reset operator applied in the global sub-swarm are used to save computational resource and increase the population diversity, respectively. At the later stage, some elite particles stored in an archive are combined with the DMS sub-swarms as a single population to search for optimal solutions, intending to enhance the exploitation ability. The effect of the new introduced strategies is verified by extensive experiments. Besides, the comparison results among DMS-GPSO and other 9 peer algorithms on CEC2013 and CEC2017 test suites demonstrate that DMS-GPSO can effectively avoid the premature convergence when solving multimodal problems, and yield more favorable performance in complex problems.
Keyword:
Particle swarm optimization
Dynamic multi-swarm strategy
Continuous optimization problems
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques基于贝叶斯技术的自适应惯性权重粒子群优化算法
Total Optimization of Energy Networks in a Smart City by Multi-Swarm Differential Evolutionary Particle Swarm Optimization基于多种群差分进化粒子群算法的智慧城市能源网络整体优化

