Resolving a vehicle routing problem with heterogeneous fleet, mixed backhauls and time windows using cuckoo behaviour approach

Berghida Meryem and Boukra Abdelmadjid

International Journal of Operational Research, 2015, vol. 24, issue 2, 132-144

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.

Keywords: vehicle routing problem; VRP; time windows; mixed backhauls; heterogeneous fleet; pickup and delivery; discrete cuckoo search. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=71491 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:24:y:2015:i:2:p:132-144

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().