Particle swarm optimisation: time for uniformisation (Q391711)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Particle swarm optimisation: time for uniformisation |
scientific article; zbMATH DE number 6244414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Particle swarm optimisation: time for uniformisation |
scientific article; zbMATH DE number 6244414 |
Statements
Particle swarm optimisation: time for uniformisation (English)
0 references
10 January 2014
0 references
Summary: Particle swarm optimisation (PSO) is an evolutionary algorithm that has been successfully applied to many optimisation problems in different fields. PSO has been heuristically proposed based in a social analogy for large groups in nature. Since its publication, research has been carried to understand the PSO convergence and improving its numerical performance. Accordingly several modifications of the basic PSO have been proposed, mostly in a heuristic way. Nevertheless, many of these modifications were not really needed, since they were proposed based on a deficient mathematical analysis of the PSO stability conditions. PSO trajectories are stochastic processes and PSO can be considered as a discrete stochastic gradient algorithm. Nevertheless, PSO is not heuristic, since its convergence and the stability of particle trajectories are related. In conclusion, it is time for uniformisation, because paradoxically this wide range of PSO versions have generated mistrust, providing the impression that PSO success depends more on the version that has been adopted and on the skills of the PSO designer.
0 references
particle swarm optimisation
0 references
PSO variants
0 references
stability
0 references
convergence
0 references
PSO parameters
0 references