Multipopulation cooperative particle swarm optimization with a mixed mutation strategy

Abstract

The traditional particle swarm optimization algorithm learns from the two best experiences: the best position previously learned by the particle itself and the best position learned by the entire population to date. This learning strategy is simple and ordinary, but when addressing high-dimensional optimization problems, it is unable to quickly find the global optimal solution due to its low efficiency. This paper proposes a multipopulation cooperative particle swarm optimization (MPCPSO) algorithm with a dynamic segment-based mean learning strategy and a multidimensional comprehensive learning strategy. In MPCPSO, the dynamic segment-based mean learning strategy (DSMLS), which is employed to construct learning exemplars, achieves information sharing and coevolution between populations. The multidimensional comprehensive learning strategy (MDCLS) is employed to speed up convergence and improve the accuracy of MPCPSO solutions. Additionally, a differential mutation operator is introduced to increase the population diversity and enhance the global exploration ability of MPCPSO. Sixteen benchmark functions and seven well-known PSO variants are employed to verify the advantages of MPCPSO. The comparison results indicate that MPCPSO has a faster convergence speed, obtains more accurate solutions, and is more robust.