Graph Sparsification for the Vehicle Routing Problem with Time Windows

  • Christian Doppstadt
  • Michael Schneider
  • Andreas Stenger
  • Bastian Sand
  • Daniele Vigo
  • Michael Schwind
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) is one of the most important and widely studied NP-hard combinatorial optimization problems in the operations research literature. The problem calls for the determination of a minimum-cost set of routes for a fleet of identical vehicles with limited capacities to serve a set of customers that have a given demand and an associated time window in which they can be visited. Due to its computational complexity, VRPTW can only be solved by exact methods for instances of moderate size [2]. However, a large number of successful metaheuristic solution methods have been proposed, which are able to produce high-quality solutions for reasonably-sized instances in limited time. For an extensive review, the reader is referred to [5, 3].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Baldacci. Personal Communication, 2010.Google Scholar
  2. 2.
    R. Baldacci, E. Bartolini, A. Mingozzi, and R. Roberti. An exact solution framework for a broad class of vehicle routing problems. Computational Management Science, 7(3): 229–268, 2010.CrossRefGoogle Scholar
  3. 3.
    Olli Bräysy and Michel Gendreau. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1): 119–139, 2005.CrossRefGoogle Scholar
  4. 4.
    J. F. Cordeau, G. Desaulnier, J. Desrosiers, M. Solomon, and F. Soumis. The VRP with time windows. In Paolo Toth and Daniele Vigo, editors, The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001.Google Scholar
  5. 5.
    Michel Gendreau, Jean-Yves Potvin, Olli Bräysy, Geir Hasle, and Arne Løkketangen. Meta-heuristics for the vehicle routing problem and its extensions: A categorized bibliography. In Bruce L. Golden, editor, The Vehicle Routing Problem: Latest Advances and New Challenges, chapter 1, pages 143–169. Springer, 2008.Google Scholar
  6. 6.
    Fred Glover and Fred Laguna. Tabu Search. Kluwer, 1997.Google Scholar
  7. 7.
    M. W. P. Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research, 4(1): 285–305, 1985.CrossRefGoogle Scholar
  8. 8.
    M.W.P. Savelsbergh. An efficient implementation of local search algorithms for constrained routing problems. European Journal of Operational Research, 47(1): 75–85, 1990.CrossRefGoogle Scholar
  9. 9.
    Michael Schneider, Christian Doppstadt, Bastian Sand, Andreas Stenger, and Michael Schwind. A vehicle routing problem with time windows and driver familiarity. In Seventh Triennial Symposium on Transportation Analysis, Tromso, Norway, 2010.Google Scholar
  10. 10.
    Michael Schneider, Christian Doppstadt, Andreas Stenger, and Michael Schwind. Ant colony optimization for a stochastic vehicle routing problem with driver learning. In IEEE Congress on Evolutionary Computation, Barcelona, Spain, 2010.Google Scholar
  11. 11.
    Paolo Toth and Daniele Vigo, editors. The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001.Google Scholar
  12. 12.
    Toth, Paolo and Vigo, Daniele. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing, 15(4): 333–346, 2003.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Christian Doppstadt
    • 1
  • Michael Schneider
    • 2
  • Andreas Stenger
    • 1
  • Bastian Sand
    • 2
  • Daniele Vigo
    • 3
  • Michael Schwind
    • 1
  1. 1.IT-based LogisticsGoethe University FrankfurtFrankfurtGermany
  2. 2.BISORUniversity of KaiserslauternKaiserslauternGermany
  3. 3.DEISUniversity of BolognaBolognaItaly

Personalised recommendations