Particle swarm optimization with state-based adaptive velocity limit strategy
Xinze Li, Kezhi Mao, Fanfan Lin, Xin Zhang

TL;DR
This paper introduces PSO-SAVL, a particle swarm optimization variant that adaptively adjusts velocity limits based on the particles' evolutionary state, improving optimization performance especially in high-dimensional problems.
Contribution
The paper proposes a novel state-based adaptive velocity limit strategy for PSO, enhancing search efficiency and avoiding local optima compared to existing methods.
Findings
PSO-SAVL outperforms traditional PSO on benchmark functions.
The method scales well to high-dimensional and large-scale problems.
Hyper-parameter sensitivity analysis provides guidance for practical implementation.
Abstract
Velocity limit (VL) has been widely adopted in many variants of particle swarm optimization (PSO) to prevent particles from searching outside the solution space. Several adaptive VL strategies have been introduced with which the performance of PSO can be improved. However, the existing adaptive VL strategies simply adjust their VL based on iterations, leading to unsatisfactory optimization results because of the incompatibility between VL and the current searching state of particles. To deal with this problem, a novel PSO variant with state-based adaptive velocity limit strategy (PSO-SAVL) is proposed. In the proposed PSO-SAVL, VL is adaptively adjusted based on the evolutionary state estimation (ESE) in which a high value of VL is set for global searching state and a low value of VL is set for local searching state. Besides that, limit handling strategies have been modified and adopted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
