Adaptive hierarchical update particle swarm optimization algorithm with a multi-choice comprehensive learning strategy

Since many PSO variants are easily trapped in local optima from which they can barely break free, this paper proposes an adaptive hierarchical update particle swarm optimization (AHPSO) algorithm. The new term “local optimum early warning” is first defined to reflect the risk of being trapped in a l...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied intelligence (Dordrecht, Netherlands) Netherlands), 2022, Vol.52 (2), p.1853-1877
Hauptverfasser: Zhou, Shangbo, Sha, Long, Zhu, Shufang, Wang, Limin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since many PSO variants are easily trapped in local optima from which they can barely break free, this paper proposes an adaptive hierarchical update particle swarm optimization (AHPSO) algorithm. The new term “local optimum early warning” is first defined to reflect the risk of being trapped in a local optimum. It plays a key role in the global coordinated control to determine the paradigm evolution direction and adjust the trajectory of particles in different risk environments. After that, the adaptive hierarchical update method generates two-layer and three-layer update formulas for the global exploration subpopulation and the local exploitation subpopulation, respectively, in order to improve the capability to resist the temptation of local optima. Consisting of the weighted synthesis sub-strategy and the mean evolution sub-strategy, the multi-choice comprehensive learning strategy is then employed to develop the most suitable learning paradigm to guide the motion path. Moreover, 18 benchmark functions and one real-world optimization problem are employed to evaluate the AHPSO against eight typical PSO variants. According to the experimental results, the AHPSO outperformed other methods in solving different types of functions by yielding high solution accuracy and high convergence speed.
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-021-02413-3