NobleBlocks

Research indexJournal article

An improved two particles PSO algorithm

Li, Yang, Yang

1 Jan 2008

NobleIDark:/48914/w1/20260521/AA9129F5DOI10.1109/wcica.2008.4594306

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

In order to reduce the size and improve the convergence of PSO (particle swarm optimization) algorithm, an improved PSO algorithm, called TPSO (two particles PSO) algorithm, is presented in this paper. The swarm is only composed of two particles in TPSO algorithm. The algorithm is guaranteed to converge to the global optimization solution with probability one. Its global search ability is enhanced through re-initialize the particles at every moment. Executing several stochastic searches continuously around the best position of the swarm can enhance its local search ability. Simulation results show that TPSO algorithm can converge to the global optimization solution of three standard nonlinear test functions rapidly.

Discussion

Citations

Topics

More

Suggest a correction or report