Journal of System Simulation ›› 2016, Vol. 28 ›› Issue (12): 2887-2896.doi: 10.16182/j.issn1004731x.joss.201612002

Previous Articles     Next Articles

Self-adaptive Multi-swarm Particle Swarm Optimization Algorithm

Xia Xuewen1, Wang Bojian1, Jin Chang1, He Guoliang2, Xie Chengwang1, Wei Bo1   

  1. 1. Intelligence optimization & Information Process Lab., East China Jiaotong University, School of Software, Nanchang 330013, China;
    2. School of Computer, Wuhan University, Wuhan 430079, China
  • Received:2015-12-21 Revised:2016-03-01 Online:2016-12-08 Published:2020-08-13

Abstract: To overcome the shortcomings of poor ability to escape a local optimal, premature convergence and low precision of the traditional particle swarm optimization algorithm (PSO), a self-adaptive multi-swarm particle swarm optimization (SMPSO) was proposed. In SMPSO, the whole population was divided into many parallel-evolution multi-swarms, the aim of which was to keep diversity of the population. Furthermore, a self-adaptive regrouping operator was proposed to reinforce the information sharing and interaction between different swarms. In addition, particles’ historical information were periodic sampling and the statistics results were used to direct the best solution to carry out a detecting operator. The aim of the strategy was to improve PSO’s global searching ability and to help the population escape a local optimal solution. To accelerate convergence speed and improve solutions’ accuracy of PSO, two local search strategies were proposed. The comparisons of SMPSO with other five PSO algorithms on some benchmark functions and an engineering application indicate that the proposed strategies can effectively enhance the ability of escaping local optimal solution, and speed up the convergence and raised solutions’ accuracy.

Key words: particle swarm optimization, multi-swarm, self-adaptive, detecting operator, local search

CLC Number: