A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm

In this article, a dynamic-neighborhood-based switching PSO (DNSPSO) algorithm is proposed, where a new velocity updating mechanism is designed to adjust the personal best position and the global best position according to a distance-based dynamic neighborhood to make full use of the population evol...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on cybernetics Vol. 52; no. 9; pp. 9290 - 9301
Main Authors Zeng, Nianyin, Wang, Zidong, Liu, Weibo, Zhang, Hong, Hone, Kate, Liu, Xiaohui
Format Journal Article
LanguageEnglish
Published United States IEEE 01.09.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this article, a dynamic-neighborhood-based switching PSO (DNSPSO) algorithm is proposed, where a new velocity updating mechanism is designed to adjust the personal best position and the global best position according to a distance-based dynamic neighborhood to make full use of the population evolution information among the entire swarm. In addition, a novel switching learning strategy is introduced to adaptively select the acceleration coefficients and update the velocity model according to the searching state at each iteration, thereby contributing to a thorough search of the problem space. Furthermore, the differential evolution algorithm is successfully hybridized with the particle swarm optimization (PSO) algorithm to alleviate premature convergence. A series of commonly used benchmark functions (including unimodal, multimodal, and rotated multimodal cases) is utilized to comprehensively evaluate the performance of the DNSPSO algorithm. The experimental results demonstrate that the developed DNSPSO algorithm outperforms a number of existing PSO algorithms in terms of the solution accuracy and convergence performance, especially for complicated multimodal optimization problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2020.3029748