z-logo
open-access-imgOpen Access
Particle swarm optimisation with Kalman correction
Author(s) -
Naha A.,
Deb A.K.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2012.4367
Subject(s) - particle swarm optimization , convergence (economics) , kalman filter , benchmark (surveying) , mathematical optimization , computer science , algorithm , mathematics , artificial intelligence , geodesy , geography , economics , economic growth
A novel particle swarm optimisation (PSO) method with guaranteed convergence is proposed which is useful for various optimisation problems. This proposed algorithm searches for the optimum point by the PSO algorithm and at each iteration the optimum location found so far are corrected by the Kalman correction mechanism. This global convergence Kalman PSO (GKPSO) algorithm has been tested for many benchmark problems and the results compared with another popular PSO algorithm with a neighbourhood operator. The proposed algorithm converges faster than the other and also provides better quality of solution. Convergence to the global optimum for this proposed algorithm has been proved.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here