A Modified Particle Swarm Optimization Algorithm
Aiming at the weaknesses of Particle Swarm Optimization algorithm (PSO) such as the easiness to get trapped into local optimal, slow convergence speed, and low precision, an improved PSO algorithm called Selectivity-Particle Swarm Optimization algorithm (S-PSO) is proposed in this paper. Differently from traditional PSO, according to S-PSO particles can refer not only to the optimal strategy, but can also select a better strategy based on their own consideration and then imitate it. When selecting local better strategy, S-PSO is introduced to increase particles’ intelligent behaviors. Based on the authority of strategy, the overlay group of strategy and spatial distance between particles themselves and the overlay group, particles will select the local better strategy. Experimental simulation results show that the global searching ability and convergence speed and precision of S-PSO algorithm is much better than traditional PSO.
Authors
- Quan Mei (ORCID: https://orcid.org/0009-0000-6717-2702)
- Peng Fu-qiang
- Ling Zhou (ORCID: https://orcid.org/0000-0001-6835-4946)
- Chunyan Wu (ORCID: https://orcid.org/0000-0003-1619-2118)
- Dayong Zhou
- P.H. Jiao
Publication Details
- Published
- 2024-10-25
- DOI
- https://doi.org/10.1109/icemce64157.2024.10862446
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00