Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis

04/30/2015
by   Alexander Raß, et al.
0

Particle Swarm Optimization (PSO) is a nature-inspired meta-heuristic for solving continuous optimization problems. In the literature, the potential of the particles of swarm has been used to show that slightly modified PSO guarantees convergence to local optima. Here we show that under specific circumstances the unmodified PSO, even with swarm parameters known (from the literature) to be good, almost surely does not yield convergence to a local optimum is provided. This undesirable phenomenon is called stagnation. For this purpose, the particles' potential in each dimension is analyzed mathematically. Additionally, some reasonable assumptions on the behavior if the particles' potential are made. Depending on the objective function and, interestingly, the number of particles, the potential in some dimensions may decrease much faster than in other dimensions. Therefore, these dimensions lose relevance, i.e., the contribution of their entries to the decisions about attractor updates becomes insignificant and, with positive probability, they never regain relevance. If Brownian Motion is assumed to be an approximation of the time-dependent drop of potential, practical, i.e., large values for this probability are calculated. Finally, on chosen multidimensional polynomials of degree two, experiments are provided showing that the required circumstances occur quite frequently. Furthermore, experiments are provided showing that even when the very simple sphere function is processed the described stagnation phenomenon occurs. Consequently, unmodified PSO does not converge to any local optimum of the chosen functions for tested parameter settings.

READ FULL TEXT

page 6

page 19

research
03/25/2013

Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm

Particle swarm optimization (PSO) is a widely used nature-inspired meta-...
research
06/06/2020

The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a meta-heuristic for continuous bla...
research
06/06/2014

Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality

Particle Swarm Optimization (PSO) is a popular nature-inspired meta-heur...
research
11/04/2013

Q-Gaussian Swarm Quantum Particle Intelligence on Predicting Global Minimum of Potential Energy Function

We present a newly developed -Gaussian Swarm Quantum-like Particle Optim...
research
05/29/2019

Self-adaptive Potential-based Stopping Criteria for Particle Swarm Optimization

We study the variant of Particle Swarm Optimization (PSO) that applies r...
research
05/27/2011

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation

We reconsider stochastic convergence analyses of particle swarm optimisa...
research
04/20/2015

Multi-swarm PSO algorithm for the Quadratic Assignment Problem: a massive parallel implementation on the OpenCL platform

This paper presents a multi-swarm PSO algorithm for the Quadratic Assign...

Please sign up or login with your details

Forgot password? Click here to reset