Computer Science – Neural and Evolutionary Computing
Scientific paper
2011-05-27
Computer Science
Neural and Evolutionary Computing
An extended version of a paper that will appear in the Proceedings of the 9th Metaheuristics International Conference (MIC 201
Scientific paper
We reconsider stochastic convergence analyses of particle swarm optimisation, and point out that previously obtained parameter conditions are not always sufficient to guarantee mean square convergence to a local optimum. We show that stagnation can in fact occur for non-trivial configurations in non-optimal parts of the search space, even for simple functions like SPHERE. The convergence properties of the basic PSO may in these situations be detrimental to the goal of optimisation, to discover a sufficiently good solution within reasonable time. To characterise optimisation ability of algorithms, we suggest the expected first hitting time (FHT), i.e., the time until a search point in the vicinity of the optimum is visited. It is shown that a basic PSO may have infinite expected FHT, while an algorithm introduced here, the Noisy PSO, has finite expected FHT on some functions.
Lehre Per Kristian
Witt Carsten
No associations
LandOfFree
Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-665503