Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows

Behrouz Afshar-Nadjafi and Alireza Afshar-Nadjafi

International Journal of Operational Research, 2016, vol. 26, issue 1, 88-103

Abstract: Extensive research has been devoted to the vehicle routing problem (VRP). Most of these researches assume a homogenous fleet with constant travel times and single depot. In this paper, we consider the time dependent multi-depot vehicle routing problem. The objective is to minimise the total heterogeneous fleet cost assuming that the travel time between two locations depends on the departure time of vehicles. Also, hard time window constraints for the customers and transit restrictions should be satisfied. The problem is formulated as a mixed integer programming model. Due to NP-hardness of the problem a parameters-tuned simulated annealing (SA) is proposed to obtain a satisfying solution. The efficiency of the proposed SA is evaluated on 180 test problems. The obtained computational results indicate that the proposed procedure is efficient.

Keywords: vehicle routing problem; VRP; time dependent; hard time windows; heterogeneous fleet; simulated annealing; multiple depots; mixed integer programming; MIP. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=75651 (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:26:y:2016:i:1:p:88-103

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 ().