Particle swarm optimisation: time for uniformisation
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.
- What makes particle swarm optimization a very interesting and powerful algorithm?
- Evolutionary Particle Swarm Optimization: A Metaoptimization Method with GA for Estimating Optimal PSO Models
- A review of particle swarm optimization. I: Background and development
- A novel particle swarm optimisation algorithm for continuous function optimisation
- Common model analysis and improvement of particle swarm optimizer
- Legendre cooperative PSO strategies for trajectory optimization
- Analytic solution of the continuous particle swarm optimization problem
- Uniform initialization in response space for PSO and its applications
- Particle swarm optimization based on local attractors of ordinary differential equation system
- A novel particle swarm optimisation algorithm for continuous function optimisation
- What makes particle swarm optimization a very interesting and powerful algorithm?
- Time vectors and particle swarms defined as polyhedra in spherically enfolded spaces
- Why standard particle swarm optimisers elude a theoretical runtime analysis
- Stability and convergence of the harmonious particle swarm optimizer and its application
- A novel particle swarm optimizer with time-delay
This page was built for publication: Particle swarm optimisation: time for uniformisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391711)
