© 2014In 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.
https://doi.org/10.1016/j.jksues.2014.04.007Cite as:
@article{Afshar_Nadjafi_2017,
doi = {10.1016/j.jksues.2014.04.007},
url = {https://doi.org/10.1016%2Fj.jksues.2014.04.007},
year = 2017,
month = {jan},
publisher = {Elsevier {BV}},
volume = {29},
number = {1},
pages = {29--34},
author = {Behrouz Afshar-Nadjafi and Alireza Afshar-Nadjafi},
title = {A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet},
journal = {Journal of King Saud University - Engineering Sciences}
}