A Hybrid Adaptive Particle Swarm Optimization Algorithm for Enhanced Performance
Zhengfeng Jiang, Daoheng Zhu, Xiao-Yu Li, Ling Bo Han
Abstract
The traditional particle swarm optimization (PSO) algorithm often exhibits defects such as of slow convergence and easily falling into a local optimum. To overcome these problems, this paper proposes an enhanced variant featuring adaptive selection. Initially, a composite chaotic mapping model integrating Logistic and Sine mappings is employed to initialize the population for diversity and exploration capability. Subsequently, the global and local search capabilities of the algorithm are balanced through the introduction of adaptive inertia weights. The population is then divided into three subpopulations—elite, ordinary, and inferior particles—based on their fitness values, with each group employing a distinct position update strategy. Finally, a particle mutation strategy is incorporated to avoid convergence to local optima. Experimental results demonstrate that our algorithm outperforms existing algorithms on the standard benchmark functions. In practical engineering applications, our algorithm also has demonstrated better performance than other meta heuristic algorithms.