Resolving a vehicle routing problem with heterogeneous fleet, mixed backhauls and time windows using cuckoo behaviour approach
by Berghida Meryem; Boukra Abdelmadjid
International Journal of Operational Research (IJOR), Vol. 24, No. 2, 2015

Abstract: The vehicle routing problem (VRP) is one of the most famous NP-hard combinatorial optimisation problems. The use of exact methods for large instances of the problem, is not efficient. Thus, we propose in this paper, to solve a rarely studied case of VRP problem called vehicle routing problem with heterogeneous fleet, mixed backhauls and time windows (HVRPMBTW), using approximate method named cuckoo search algorithm. Our results show the effectiveness of this algorithm.

Online publication date: Mon, 31-Aug-2015

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 Operational Research (IJOR):
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