Abstract
We consider the Time-Dependent Vehicle Routing Problem (tdvrptw), a generalization of the Vehicle Routing Problem with Time Windows (vrptw) where the travel time between any pair of clients can vary over the time. Its purpose is to better handle the dynamic nature of the travel time, especially in urban areas where traffic congestion can have a significant impact on the transportation. We propose a heuristic based on column generation and on Variable Neighborhood Descent (vnd) for solving the tdvrptw. Several neighborhoods are used to identify improving columns at each iteration of the column generation process. Those columns are then stored in a shared pool. In the same time, the integer master problem is solved and its solution is then improved by the vnd. Both total distance and number of vehicle criteria are considered. Numerical results are then presented to show the interest of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brimberg, J., Hansen, P., Mladenovic, N., Taillard, E.D.: Improvements and comparison of heuristics for solving the multisource weber problem. Oper. Res. 48, 444–460 (1997)
Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992)
Donati, A.V., Gambardella, L.M., Rizzoli, A.E., Casagrande, N., Montemanni, R.: Time dependent vehicle routing problem with an ant colony system. Eur. J. Oper. Res. 185, 1174–1191 (2008)
Golden, B., Raghavan, S., Wasil, E. (eds.): Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research Computer Science Interfaces, vol. 43. Springer, New York (2008)
Haghani, A., Jung, S.: A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32, 2959–2986 (2005)
Hill, A.V., Benton, W.C.: Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. J. Oper. Res. Soc. 43, 343–351 (1992)
Ichoua, S., Gendreau, M., Potvin, J.Y.: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144, 379–396 (2003)
Kuo, Y.: Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput. Ind. Eng. 59(1), 157–165 (2010)
Malandraki, C., Daskin, M.S.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 26, 185–200 (1992)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, vol. 9. SIAM, Philadelphia, PA (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Huart, V., Perron, S., Caporossi, G., Duhamel, C. (2016). A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows. In: Fonseca, R., Weber, GW., Telhada, J. (eds) Computational Management Science. Lecture Notes in Economics and Mathematical Systems, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-20430-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-20430-7_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20429-1
Online ISBN: 978-3-319-20430-7
eBook Packages: Business and ManagementBusiness and Management (R0)