Multi-strategy based bare bones particle swarm for numerical optimisation
by Jinwei Liu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 2, 2015

Abstract: Particle swarm optimisation (PSO) is a population-based stochastic search algorithm, which simulates the social behaviour of bird flocking or fish schooling. Many previous studies have shown that PSO is an effective optimisation technique in evolutionary optimisation community. However, the standard PSO still suffers from premature convergence when solving complex multimodal problems. In this paper, we propose a new PSO algorithm called multi-strategy based bare bones PSO (MPSO). The MPSO introduces generalised opposition-based learning (GOBL) and two neighbourhood search strategies into the original bare bones PSO. Simulation study is conducted on 13 well-known benchmark functions. The results show that MPSO achieves better results than the standard PSO and two other PSO algorithms.

Online publication date: Sun, 17-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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