Cuckoo search with dual-subpopulation and information-sharing strategy
by Jun Xi; Li-Ming Zheng
International Journal of Computing Science and Mathematics (IJCSM), Vol. 14, No. 4, 2021

Abstract: Cuckoo search (CS) algorithm is simple and powerful in dealing with the global optimisation problem. However, how to strike a good balance between exploration and exploitation in CS is still an open question. The paper proposes a modified CS with dual-subpopulation and information-sharing strategy (DSIS_CS). In DSIS_CS, the population is divided into two subpopulations which are assigned different update tasks. Then, random solutions are selected from the dissimilar subpopulations in order to avoid the results from easily falling into the local optima. In addition, the DSIS strategy can be incorporated into other state-of-the-art CS variants to improve their optimisation performance. Extensive experiments on 28 functions chosen from CEC 2013 have been carried out. The results suggest that the DSIS strategy helps both the CS and its variants to achieve a better trade-off between exploration and exploitation.

Online publication date: Thu, 03-Feb-2022

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