A fitness-based two roles adaptive inertia weight particle swarm optimization

Particle Swarm Optimization (PSO) has been widely applied to practical problems. Similar to other evolutionary algorithms, PSO is prone to premature convergence and local optima entrapment. To achieve a dynamic balance between exploration and exploitation, this paper proposes a fitness-based two roles adaptive inertia weight particle swarm optimization (FAIWPSO). The proposed algorithm divides the population into elite and ordinary subgroups according to individual fitness values, and adaptively reduces the number of elite particles as the iteration proceeds, thereby realizing a smooth transition from global exploration to local exploitation. The elite subgroup identifies and guides the population toward promising regions using neighborhood best information, while maintaining population diversity through non-uniform mutation. Guided by the elite subpopulation, the ordinary subpopulation adopts a weighted learning strategy to intensively exploit promising regions. Furthermore, to achieve a better balance between exploration and exploitation, a nonlinear adaptive inertia weight strategy based on both population evolution state and individual differences is introduced. Additionally, a dimension-adaptive Gaussian mutation strategy is developed, which mutates different dimensions of the global best solution depending on the evolutionary stage, enhancing the ability to escape local optima. To evaluate the effectiveness of FAIWPSO, comprehensive experiments were conducted, demonstrating that the proposed strategies substantially enhance the algorithm’s performance. On the CEC2014 test suite, FAIWPSO outperforms seven widely used PSO variants in terms of solution accuracy and stability. On the CEC2018 test suite, its overall performance surpasses that of APGSK-IMODE and MadDE. • FAIWPSO is a new PSO variant with high exploitation and exploration capabilities. • Adaptive inertia weight is adapted to the evolution state and fitness. • Weighted learning strategy based on fitness. • Dimension-adaptive Gaussian mutation avoids local optima via staged perturbation.

Authors

Institutions

Publication Details

Journal
Swarm and Evolutionary Computation
Published
2026-01-20
DOI
https://doi.org/10.1016/j.swevo.2026.102291
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A fitness-based two roles adaptive inertia weight particle swarm optimization

Jun Guan, Wenjun Yi, Shuanghui Ye
Swarm and Evolutionary Computation
Metaheuristic Optimization Algorithms Research
article

A fitness-based two roles adaptive inertia weight particle swarm optimization

Jun Guan, Wenjun Yi, Shuanghui Ye
article en

Abstract

Particle Swarm Optimization (PSO) has been widely applied to practical problems. Similar to other evolutionary algorithms, PSO is prone to premature convergence and local optima entrapment. To achieve a dynamic balance between exploration and exploitation, this paper proposes a fitness-based two roles adaptive inertia weight particle swarm optimization (FAIWPSO). The proposed algorithm divides the population into elite and ordinary subgroups according to individual fitness values, and adaptively reduces the number of elite particles as the iteration proceeds, thereby realizing a smooth transition from global exploration to local exploitation. The elite subgroup identifies and guides the population toward promising regions using neighborhood best information, while maintaining population diversity through non-uniform mutation. Guided by the elite subpopulation, the ordinary subpopulation adopts a weighted learning strategy to intensively exploit promising regions. Furthermore, to achieve a better balance between exploration and exploitation, a nonlinear adaptive inertia weight strategy based on both population evolution state and individual differences is introduced. Additionally, a dimension-adaptive Gaussian mutation strategy is developed, which mutates different dimensions of the global best solution depending on the evolutionary stage, enhancing the ability to escape local optima. To evaluate the effectiveness of FAIWPSO, comprehensive experiments were conducted, demonstrating that the proposed strategies substantially enhance the algorithm’s performance. On the CEC2014 test suite, FAIWPSO outperforms seven widely used PSO variants in terms of solution accuracy and stability. On the CEC2018 test suite, its overall performance surpasses that of APGSK-IMODE and MadDE. • FAIWPSO is a new PSO variant with high exploitation and exploration capabilities. • Adaptive inertia weight is adapted to the evolution state and fitness. • Weighted learning strategy based on fitness. • Dimension-adaptive Gaussian mutation avoids local optima via staged perturbation.

Swarm and Evolutionary ComputationVol. 101
Nanjing University of Science and Technology (CN), Jiangsu University of Science and Technology (CN)
Openalex Percentile: Top 84%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.