A novel multi-subpopulation cooperative particle swarm optimisation Online publication date: Thu, 19-Feb-2015
by Guohan Lin; Jing Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 1, 2015
Abstract: The basic particle swarm optimisation (PSO) algorithm is easily trapped in local optima. To deal with this problem, a multi-subpopulation cooperative particle swarm optimisation (MCPSO) is presented. In the proposed algorithm, the particles are divided into several normal subpopulations and an elite subpopulation. The selected individuals in normal subpopulation are memorised into the elite subpopulation, and some individuals in normal subpopulation are replaced by the best particles from the elite subpopulation. Different subpopulation adopts different evolution model. This strategy can maintain the diversity of the population and avoid the premature convergence. The performance of the proposed algorithm is evaluated by testing on standard benchmark functions. The experimental results show that the proposed algorithm has better convergent rate and high solution accuracy.
Online publication date: Thu, 19-Feb-2015
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 Computing Science and Mathematics (IJCSM):
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 firstname.lastname@example.org