We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/A Simpler and More Effective Particle Swarm Optimization Algorithm
PeriodicalsComputer Science & Information Technology

A Simpler and More Effective Particle Swarm Optimization Algorithm

Checking your access to this record.

Abstract & Overview

The basic particle swarm optimization (bPSO) has some demerits, such as relapsing into local extremum, slow convergence velocity and low convergence precision in the late evolutionary. Three algorithms, based on the simple evolutionary equations and the extrenum disturbed arithmetic operators, are proposed to overcome the demerits of the bPSO. The simple PSO (sPSO) discards the particle velocity and reduces the bPSO from the second order to the first order difference equation. The evolutionary process is only controlled by the variables of the particles position. The extremum disturbed PSO (tPSO) accelerates the particles to overstep the local extremum. The experiment results of some classic benchmark functions show that the sPSO improves extraordinarily the convergence velocity and precision in the evolutionary optimization, and the tPSO can effectively break away from the local extremum. tsPSO, combined the sPSO and tPSO, can obtain the splendiferous optimization results with smaller population size and evolution generations. The algorithms improve the practicality of the particle swarm optimization.

Cite this record

Hu Wang (2007). A Simpler and More Effective Particle Swarm Optimization Algorithm. Journal of Software, 18(4), 861–861. https://doi.org/10.1360/jos180861

Copy in another style

Wang, H. (2007). A Simpler and More Effective Particle Swarm Optimization Algorithm. Journal of Software, 18(4), 861–861. https://doi.org/10.1360/jos180861
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.