期刊
COMPUTING
卷 102, 期 7, 页码 1587-1626出版社
SPRINGER WIEN
DOI: 10.1007/s00607-019-00782-9
关键词
Particle swarm optimization; Dynamic multi-swarm strategy; Continuous optimization problems
资金
- National Natural Science Foundation of China [61663009, 61762036, 61806204]
- National Natural Science Foundation of Jiangxi Province [20171BAB202012]
- Research Project of Jiangxi Provincial Department of Communication and Transportation [2017D0038]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据