Particle swarm optimisation with modified global search and local search exemplars for large-scale optimisation

Canonical particle swarm optimisation (cPSO) has been criticised for its premature convergence when tackling large-scale optimisation problems (LSOPs). During optimisation, the swarm diversity of cPSO rapidly decays, leading to its poor global search performance. To improve the global search ability of cPSO, a particle swarm optimisation with modified global search and local search exemplars (PSO-MGLE) is proposed. In PSO-MGLE, two novel exemplar selection strategies are designed to diversify the selection of global search and local search exemplars for updated particles, thereby preserving high swarm diversity. Second, a dynamic adjustment strategy for the acceleration coefficient is designed to encourage the swarm to prioritise the global search at the early stage while emphasising the local search at the later stage. PSO-MGLE is tested on the 2022 benchmark suite, scaled to 500, 1,000, and 2,000 dimensions. Experimental results demonstrate the competitive performance and good scalability of PSO-MGLE in comparison with seven state-of-the-art approaches.

Authors

Institutions

Publication Details

Journal
International Journal of Complexity in Applied Science and Technology
Published
2025-01-01
DOI
https://doi.org/10.1504/ijcast.2025.147066
Citations
9
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
22.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Particle swarm optimisation with modified global search and local search exemplars for large-scale optimisation

Hongye Li, Qi Yu, Xuejing Hou, Minchong Chen
9 citations
International Journal of Complexity in Applied Science and Technology
Metaheuristic Optimization Algorithms Research
22.33
article

Particle swarm optimisation with modified global search and local search exemplars for large-scale optimisation

Hongye Li, Qi Yu, Xuejing Hou, Minchong Chen
article en
9 citations

Abstract

Canonical particle swarm optimisation (cPSO) has been criticised for its premature convergence when tackling large-scale optimisation problems (LSOPs). During optimisation, the swarm diversity of cPSO rapidly decays, leading to its poor global search performance. To improve the global search ability of cPSO, a particle swarm optimisation with modified global search and local search exemplars (PSO-MGLE) is proposed. In PSO-MGLE, two novel exemplar selection strategies are designed to diversify the selection of global search and local search exemplars for updated particles, thereby preserving high swarm diversity. Second, a dynamic adjustment strategy for the acceleration coefficient is designed to encourage the swarm to prioritise the global search at the early stage while emphasising the local search at the later stage. PSO-MGLE is tested on the 2022 benchmark suite, scaled to 500, 1,000, and 2,000 dimensions. Experimental results demonstrate the competitive performance and good scalability of PSO-MGLE in comparison with seven state-of-the-art approaches.

International Journal of Complexity in Applied Science and TechnologyVol. 1(4)
Tongji University (CN)
Openalex Percentile: Top 1%
Metaheuristic Optimization Algorithms Research
22.33
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.

Particle swarm optimisation with modified global search and local search exemplars for large-scale optimisation — Hongye Li, Qi Yu, et al. · International Journal of Complexity in Applied Science and Technology (2025) | TGRS Research Map | TGRS