Dynamics and Stability of the Sampling Distribution ofParticle Swarm Optimisers via Moment Analysis

For stochastic optimisation algorithms, knowing the probability distribution with which an algorithm allocates new samples in the search space is very important, since this explains how the algorithm really works and is a prerequisite to being able to match algorithms to problems. This is the only w...

Full description

Saved in:
Bibliographic Details
Published in:Journal of artificial evolution and applications 2008-01, Vol.2008 (1)
Main Author: Poli, Riccardo
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For stochastic optimisation algorithms, knowing the probability distribution with which an algorithm allocates new samples in the search space is very important, since this explains how the algorithm really works and is a prerequisite to being able to match algorithms to problems. This is the only way to beat the limitations highlighted by the no‐free lunch theory. Yet, the sampling distribution for velocity‐based particle swarm optimisers has remained a mystery for the whole of the first decade of PSO research. In this paper, a method is presented that allows one to exactly determine all the characteristics of a PSO′s sampling distribution and explain how it changes over time during stagnation (i.e., while particles are in search for a better personal best) for a large class of PSO′s.
ISSN:1687-6229
1687-6237
DOI:10.1155/2008/761459