Perfectly convergent particle swarm optimisation in multidimensional space Online publication date: Tue, 04-Jan-2022
by Devinder Kumar; N.K. Jain; Uma Nangia
International Journal of Bio-Inspired Computation (IJBIC), Vol. 18, No. 4, 2021
Abstract: In this paper a novel evolutionary algorithm, perfectly convergent particle swarm optimisation (PCPSO) has been proposed. This is an intelligent algorithm which does not get trapped in local minima by using personal best value along with new parameters and new velocity update equation for better exploration in the search space. Velocity clamping is used to avoid the particles from escaping the search space by preventing the initial explosion of particle velocity. The velocity clamping effectively help to control the maximum velocity of the particles by limiting the particle step size and hence the particle will have to perform further steps in the search space to travel the same distance which determines its search precision for exploration or exploitation and finally align them towards the true global minimum. Experimental results show that by using perfect convergent particle swarm optimisation (PCPSO) approach computational efficiency is increased as compared to other variants of PSO and finds fast true global minimum.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook