Paper
19 July 2024 An effective particle swarm optimization algorithm with disturbance
Xiangyu Ba
Author Affiliations +
Proceedings Volume 13181, Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024); 1318154 (2024) https://doi.org/10.1117/12.3031091
Event: Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024), 2024, Beijing, China
Abstract
Particle swarm optimization (PSO) has been widely studied because of its advantages of fast convergence and few control parameters, therefore many improvements have been proposed. However, some variants of PSO inevitably increase the parameters needed to tune and computation cost and lose the advantages of faster convergence and easier implementation of the PSO algorithm. To overcome these problems, this paper proposes an improved PSO, which is called EPSO. Compared with the standard particle swarm optimization algorithm, the acceleration coefficient is removed and the learning factor is replaced to reduce the algorithm’s dependency on its parameters. Noise-based disturbance is introduced to escape local optima. Afterward, a large number of benchmark functions were used to detect the performance of EPSO, and experimental results showed that it had higher accuracy and faster convergence speed.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Xiangyu Ba "An effective particle swarm optimization algorithm with disturbance", Proc. SPIE 13181, Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024), 1318154 (19 July 2024); https://doi.org/10.1117/12.3031091
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Particle swarm optimization

Evolutionary algorithms

Particles

Statistical analysis

Evolutionary optimization

Back to Top