Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows

  • Stefanie Kritzinger
  • Fabien Tricoire
  • Karl F. Doerner
  • Richard F. Hartl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6683)

Abstract

In this paper we present a variable neighborhood search for time-dependent vehicle routing problems with time windows. Unlike the well-studied routing problems with constant travel times, in the time-dependent case the travel time depends on the time of the day. This assumption approaches reality, in particular for urban areas where travel times typically vary during the day, e.g., because of traffic congestion due to rush hours. An experimental evaluation for the vehicle routing problem with soft time windows with and without time-dependent travel times is performed and it is shown that taking time-dependent travel times into account provides substantial improvements of the considered objective function.

Keywords

Vehicle routing problem time-dependent travel times time windows variable neighborhood search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bräysy, O.: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows. INFORMS Journal on Computing 15(4), 347–368 (2003)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science 39, 104–118 (2005)CrossRefGoogle Scholar
  3. 3.
    Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E., Gambardella, L.M.: Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research 185, 1174–1191 (2008)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Fleischmann, B., Gietz, M., Gnutzmann, S.: Time-Varying Travel Times in Vehicle Routing. Transportation Science 38, 160–173 (2004)CrossRefGoogle Scholar
  5. 5.
    Hansen, P., Mladenović, N.: Variable Neighborhood Search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 221–234. Oxford University Press, New York (2000)Google Scholar
  6. 6.
    Hansen, P., Mladenović, N.: Variable Neighborhood Search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Hansen, P., Mladenović, N., Moreno Pérez, J.A.: Variable neighborhood search: methods and applications. Annals of Operations Research 175, 367–407 (2010)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization 5, 434–456 (2008)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Ichoua, S., Gendreau, M., Potvin, J.-Y.: Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144, 379–396 (2003)CrossRefMATHGoogle Scholar
  10. 10.
    Malandraki, C., Daskin, M.S.: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. Transportation Science 26, 185–200 (1992)CrossRefMATHGoogle Scholar
  11. 11.
    Mladenović, N., Hansen, P.: Variable Neighborhood Search. Computers & Operations Research 24, 1097–1100 (1997)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Polacek, M., Doerner, K.F., Hartl, R.F., Reimann, M.: A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. Journal of Heuristics 10, 613–627 (2004)CrossRefGoogle Scholar
  13. 13.
    Schmid, V., Doerner, K.F.: Ambulance location and relocation problems with time-dependent travel times. European Journal of Operational Research 207, 1293–1303 (2010)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Soler, D., Albiach, J., Martínez, E.: A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows. Operations Research Letters 37, 37–42 (2009)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time constraints. Operations Research 35(2), 254–265 (1987)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Taillard, E.D., Badeau, P., Gendreau, M., Potvin, J.Y.: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science 31, 170–186 (1997)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Stefanie Kritzinger
    • 1
  • Fabien Tricoire
    • 1
  • Karl F. Doerner
    • 1
    • 2
  • Richard F. Hartl
    • 1
  1. 1.Department of Business AdminstrationUniversity of ViennaViennaAustria
  2. 2.Department of Production and LogisticsJohannes Kepler University LinzLinzAustria

Personalised recommendations