A Novel Particle Swarm Optimizer with Randomly Occurring Uncertainty
Particle Swarm Optimization (PSO) has been widely applied due to its simplicity and effectiveness in solving optimization problems. However, PSO often suffers from premature convergence and stagnation in local optima, especially in complex search spaces. This paper proposes a novel PSO algorithm by incorporating stochastic perturbations into the velocity updating mechanism. Specifically, the acceleration coefficients are perturbed by the introduced randomly occurring uncertainty to improve the search ability of the entire swarm. Experimental results on representative CEC benchmark functions demonstrate that the proposed algorithm outperforms several existing PSO variants.
Authors
- L. Leon Chen (ORCID: https://orcid.org/0009-0008-2328-038X)
- Xiaohui Liu (ORCID: https://orcid.org/0000-0003-4827-728X)
- Zidong Wang (ORCID: https://orcid.org/0000-0002-9576-7401)
- Weibo Liu (ORCID: https://orcid.org/0000-0002-8169-3261)
Institutions
- Brunel University of London (GB)
Publication Details
- Published
- 2025-08-27
- DOI
- https://doi.org/10.1109/icac65379.2025.11196536
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00