Gaussian-valued particle swarm optimization
Loading...
Date
Authors
Harrison, Kyle Robert
Ombuki-Berman, Beatrice M.
Engelbrecht, Andries P.
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
This paper examines the position update equation of the particle swarm optimization (PSO) algorithm, leading to the proposal of a simplified position update based upon a Gaussian distribution. The proposed algorithm, Gaussian-valued particle swarm optimization (GVPSO), generates probabilistic positions by retaining key elements of the canonical update procedure while also removing the need to specify values for the traditional PSO control parameters. Experimental results across a set of 60 benchmark problems indicate that GVPSO outperforms both the standard PSO and the bare bones particle swarm optimization (BBPSO) algorithm, which also employs a Gaussian distribution to generate particle positions.
Description
Keywords
Particle swarm optimization (PSO), Gaussian-valued particle swarm optimization (GVPSO), Bare bones particle swarm optimization (BBPSO), Gaussian distribution, Swarm intelligence, Bench-mark problems, Control parameters, Particle position, Position updates, Standard PSO
Sustainable Development Goals
Citation
Harrison K.R., Ombuki-Berman B.M., Engelbrecht A.P. (2018) Gaussian-Valued Particle Swarm Optimization. In: Dorigo M., Birattari M., Blum C., Christensen A., Reina A., Trianni V. (eds) Swarm Intelligence. ANTS 2018. Lecture Notes in Computer Science, vol 11172. Springer, Cham,