A new local-enhanced cuckoo search algorithm
by Wei-Hong Yang; Jia-Rui Liu; Yi Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 2, 2017

Abstract: Cuckoo search algorithm is a recent proposed evolutionary algorithm. However, the local search capability is not efficient when dealing with some multi-modal numerical problems. In this paper, a new local-enhanced cuckoo search algorithm is designed aiming to solve it. Different from the standard version, the local search for each cuckoo is attracted by global best position found by entire swarm. Furthermore, to provide a balance between exploitation and exploration, an inertia weight is introduced. To test the performance, four other algorithms are employed to compare, and simulation results show it achieves the best performance when solve numerical optimisation benchmarks.

Online publication date: Fri, 21-Apr-2017

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