Skip to main content
SpringerLink
Log in
Book cover

International Conference on Learning and Intelligent Optimization

LION 2011: Learning and Intelligent Optimization pp 61–75Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fleischmann, B., Gietz, M., Gnutzmann, S.: Time-Varying Travel Times in Vehicle Routing. Transportation Science 38, 160–173 (2004)

    Article  Google Scholar 

  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. Hansen, P., Mladenović, N.: Variable Neighborhood Search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hansen, P., Mladenović, N., Moreno Pérez, J.A.: Variable neighborhood search: methods and applications. Annals of Operations Research 175, 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ichoua, S., Gendreau, M., Potvin, J.-Y.: Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144, 379–396 (2003)

    Article  MATH  Google Scholar 

  10. Malandraki, C., Daskin, M.S.: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. Transportation Science 26, 185–200 (1992)

    Article  MATH  Google Scholar 

  11. Mladenović, N., Hansen, P.: Variable Neighborhood Search. Computers & Operations Research 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  15. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time constraints. Operations Research 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Adminstration, University of Vienna, Bruenner Strasse 72, 1210, Vienna, Austria

    Stefanie Kritzinger, Fabien Tricoire, Karl F. Doerner & Richard F. Hartl

  2. Department of Production and Logistics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040, Linz, Austria

    Karl F. Doerner

Authors
  1. Stefanie Kritzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabien Tricoire
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karl F. Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departmento de Computation, Centro de Investigacion y de Estudios, Avanzados del Instituto Politecnico Nacional (CINVESTAV-IPN), Av. IPN No. 2508, Col. San Pedro Zacatenco, D.F. 0360, Mexico, Mexico

    Carlos A. Coello Coello

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kritzinger, S., Tricoire, F., Doerner, K.F., Hartl, R.F. (2011). Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25566-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25565-6

  • Online ISBN: 978-3-642-25566-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation