Discrete cuckoo search applied to capacitated arc routing problem
by Badis Bensedira; Abdesslam Layeb; Zineb Habbas
International Journal of Metaheuristics (IJMHEUR), Vol. 6, No. 1/2, 2017

Abstract: Capacitated arc routing problem (CARP) is known as NP-hard combinatorial optimisation problem. Cuckoo search (CS) is a recent meta-heuristic algorithm inspired by breeding the behaviour of cuckoos. CS has proved to be very effective in solving continuous and discrete optimisation problems. In discrete CS for solving CARP (DCSARP), the solution is encoded as a sequence of integer numbers that are positioned according to the order between their components. This discretisation is the key for using CS for solving combinatorial optimisation problems. The experimental results showed that DCSARP can be better than some meta-heuristics in relation to the quality of solution and robustness.

Online publication date: Mon, 20-Mar-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 Metaheuristics (IJMHEUR):
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