A novel particle swarms with mixed cooperative co-evolution for large scale global optimisation Online publication date: Wed, 18-Sep-2019
by Yufeng Wang; Wenyong Dong; Chunyu Xu
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 12, No. 1/2, 2019
Abstract: Identification of variable interaction and grouping of variables plays an important role in the divide-and-conquer algorithm. In this paper, a novel particle swarm optimisation with mixed cooperative co-evolution (MCCPSO) is proposed. It has two strategies and one mechanism: mixed grouping of variables (MGV) strategy, reallocate computational resources (RCR) strategy and a competitive leadership with a lifecycle mechanism. MGV can effectively identify the direct and indirect interactive variables and form a spare sub-group pool. RCR can give more computational resources to the more important subcomponents. The leader mechanism can prevent the PSO algorithm from falling into a local optimum. In order to understand the characteristics of MCCPSO, we have carried out extensive computational studies on the CEC'2010 benchmark function. The experimental results show that the performance of MCCPSO is better than the other four state-of-the-art algorithms.
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 Intelligent Information and Database Systems (IJIIDS):
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