Enhancing cuckoo search algorithm with complement strategy
by Hu Peng; Hua Lu; Changshou Deng
International Journal of Innovative Computing and Applications (IJICA), Vol. 13, No. 5/6, 2022

Abstract: Cuckoo search (CS) algorithm is proposed by Yang and Deb, which is a simple and effective swarm intelligence algorithm. In each iteration, the CS search for new solutions by the global explorative random walk and the local random walk, the greedy strategy is used to choose a better solution. However, the CS uses a single strategy and fixed parameters, in which performance of the CS in balancing exploitation and exploration is inadequate, which results in poor convergence performance of the CS. To cope with this problem, a novel CS variant with complement strategy (CoCS) was proposed by us, in which the new solution is generated by two strategies in a random manner. One of the strategy is an improved Lêvy flights, and the other is adaptive to determine the step size according to the fitness value of the step size and the number of current iterations. The algorithm also uses an improved random walk. The proposed CoCS, the standard CS, and other excellent CS variants were tested on 28 benchmark functions of CEC 2013 test suite. Experimental results prove that the CoCS is superior to these competitors.

Online publication date: Mon, 23-Jan-2023

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 Innovative Computing and Applications (IJICA):
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