Numerical Comparison of Neighbourhood Topologies in Particle Swarm Optimization
Mauro S. Innocente, Johann Sienz

TL;DR
This paper compares five different neighbourhood topologies in Particle Swarm Optimization, analyzing their effects on convergence and performance across various benchmark problems to identify effective configurations.
Contribution
It provides a numerical comparison of multiple neighbourhood topologies combined with different coefficients' settings in PSO, highlighting the importance of dynamic topologies for general optimization.
Findings
Dynamic neighbourhoods with increasing interconnections perform well.
Performance is problem-dependent but dynamic topologies are generally advantageous.
The choice of topology significantly influences convergence speed and solution quality.
Abstract
Particle Swarm Optimization is a global optimizer in the sense that it has the ability to escape poor local optima. However, if the spread of information within the population is not adequately performed, premature convergence may occur. The convergence speed and hence the reluctance of the algorithm to getting trapped in suboptimal solutions are controlled by the settings of the coefficients in the velocity update equation as well as by the neighbourhood topology. The coefficients settings govern the trajectories of the particles towards the good locations identified, whereas the neighbourhood topology controls the form and speed of spread of information within the population (i.e. the update of the social attractor). Numerous neighbourhood topologies have been proposed and implemented in the literature. This paper offers a numerical comparison of the performances exhibited by five…
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.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
