Advertisement

A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows

  • Vincent Huart
  • Sylvain Perron
  • Gilles Caporossi
  • Christophe Duhamel
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 682)

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.

Keywords

Local Search Column Generation Master Problem Vehicle Route Problem Speed Profile 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Haghani, A., Jung, S.: A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32, 2959–2986 (2005)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Ichoua, S., Gendreau, M., Potvin, J.Y.: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144, 379–396 (2003)CrossRefGoogle Scholar
  8. 8.
    Kuo, Y.: Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput. Ind. Eng. 59(1), 157–165 (2010)CrossRefGoogle Scholar
  9. 9.
    Malandraki, C., Daskin, M.S.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 26, 185–200 (1992)CrossRefGoogle Scholar
  10. 10.
    Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, vol. 9. SIAM, Philadelphia, PA (2002)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Vincent Huart
    • 1
  • Sylvain Perron
    • 1
  • Gilles Caporossi
    • 1
  • Christophe Duhamel
    • 2
  1. 1.GERAD and HEC MontréalMontréalCanada
  2. 2.LIMOS, Université Blaise PascalClermont-FerrandFrance

Personalised recommendations