Abstract: This paper deals with a problem where the same vehicle performs several routes to serve a set of customers and arc traversal times vary along the planning horizon. The relationship with its time-invariant counterpart is investigated and a procedure to compute lower and upper bounds on the optimal solution value is developed.
Computational results on instances, based on the Paris (France) road graph, show the effectiveness of this approach.
Keywords: Time-dependent routing, multi-trip, capacitated vehicle routing problem, path ranking invariance
Adamo, T.; Ghiani, G.; Greco, P. and Guerriero, E. (2021). In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems – Volume 1: ICORES, ISBN 978-989-758-485-5, pages 82-87. DOI: http://doi.org/10.5220/0010322500820087