Details

Autor(en) / Beteiligte

• Li, Taiyong
• Shi, Jiayi
• Deng, Wu
• Hu, Zhenda

Titel

Pyramid particle swarm optimization with novel strategies of competition and cooperation

Ist Teil von

• Applied soft computing, 2022-05, Vol.121, p.108731, Article 108731

Ort / Verlag

Elsevier B.V

Erscheinungsjahr

2022

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Particle swarm optimization (PSO) has shown its advantages in various optimization problems. Topology and updating strategies are among its key concepts and have significant impacts on optimization ability. This paper proposes a pyramid PSO (PPSO) with novel competitive and cooperative strategies to update particles’ information. PPSO builds a pyramid and assigns each particle to a specific layer according to its fitness. The particles at the same layer will make a pairwise comparison to determine the winners and the losers. The losers will cooperate with their corresponding winners, while the winners will cooperate with the particles at the upper layer and those at the top layer. Each particle in PPSO has its own learning behavior, having more than one exemplar rather than the only global best to learn from. The diversity of the swarm is enhanced and it positively affects the performance of PSO. Extensive experiments demonstrate that the PPSO has superior performance in terms of accuracy, Wilcoxon signed-rank test and convergence speed, yet achieves comparable running time in most cases, when compared with the canonical PSO and eight state-of-the-art PSO variants. Furthermore, we analyze the influence of parameters for the PPSO. All these illustrate that the PPSO is promising for numerical optimization. •Pyramid structure is introduced into PSO.•Novel strategies of competition and cooperation are designed.•Experimental results validate the performance of the proposed approach.•Influence of parameter setting is analyzed.