In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on maximum number of the vehicles in depots must be satisfied. The problem is formulated as a mixed integer programming model. A constructive heuristic procedure is proposed for the problem. Also, the efficiency of the proposed algorithm is evaluated on 180 test problems. The obtained computational results indicate that the procedure is capable to obtain a satisfying solution.
A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet
2017
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
British Library Online Contents | 2007
|Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows
BASE | 2018
|Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
Online Contents | 2007
|Vehicle Routing Problem with Multi Depot, Heterogeneous Fleet, and Multi Period: A Real Case Study
Springer Verlag | 2021
|