Advertisement

Vehicle Routing Problem with Time Windows

  • Brian Kallehauge
  • Jesper Larsen
  • Oli B.G. Madsen
  • Marius M. Solomon

Abstract

In this chapter we discuss the Vehicle Routing Problem with Time Windows in terms of its mathematical modeling, its structure and decomposition alternatives. We then present the master problem and the subproblem for the column generation approach, respectively. Next, we illustrate a branch-and-bound framework and address acceleration strategies used to increase the efficiency of branch-and-price methods. Then, we describe generalizations of the problem and report computational results for the classic Solomon test sets. Finally, we present our conclusions and discuss some open problems.

Keywords

Time Window Column Generation Master Problem Vehicle Rout Problem Short Path Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ascheuer, N., Fischetti, M., and Grötschel, M. (2000). Polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36:69–79.MathSciNetCrossRefGoogle Scholar
  2. Ascheuer, N., Fischetti, M., and Grötschel, M. (2001). Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90:475–506.MathSciNetCrossRefGoogle Scholar
  3. Balas, E., Fischetti, M., and Pulleyblank, W.R. (1995). The precedence-constrained asymmetric travelling salesman polytope. Mathematical Programming 68:241–265.MathSciNetGoogle Scholar
  4. Bard, J., Kontoravdis, G., and Yu, G. (2002). A Branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36:250–269.CrossRefGoogle Scholar
  5. Chabrier, A. (2005). Vehicle routing problem with elementary shortest path based column generation. Forthcoming in: Computers and Operations Research.Google Scholar
  6. Chabrier, A., Danna, E., and Claude Le Pape. (2002). Coopération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au routage de véhicules. In: Huitièmes Journées Nationales sur la Résolution de Problèmes NP-Complets (JNPC 2002).Google Scholar
  7. Cook, W. and Rich, J.L. (1999). A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report TR99-04. Department of Computational and Applied Mathematics, Rice University.Google Scholar
  8. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., and Soumis, F. (2002). The VRP with time windows. In: The vehicle routing problem (P. Toth and D. Vigo, eds.), pp. 157–193, SIAM Monographs on Discrete Mathematics and its Applications.Google Scholar
  9. Crowder, H. and Padberg, M. (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26:495–509.MathSciNetGoogle Scholar
  10. Danna, E. and Le Pape, C. (2005). Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. This volume.Google Scholar
  11. Desaulniers, G., Desrosiers, J., and Solomon, M.M. (2002). Accelerating Strategies in column generation methods for vehicle routing and crew scheduling problems. In: Essays and Surveys in Metaheuristics (C. Ribeiro and P. Hansen, eds.), pp. 309–324, Kluwer Academic Publishers.Google Scholar
  12. Desrosiers, M., Desrosiers, J., and Solomon, M.M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40:342–354.MathSciNetGoogle Scholar
  13. Desrochers, M. and Soumis, F. (1988). A generalized permanent labelling algorithm for the shortest path problem with time windows. INFORMS 26:191–212.Google Scholar
  14. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995). Time constrained routing and scheduling. In: Handbooks in Operations Research and Management Sciences (M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds.), vol. 8, Network Routing, pp. 35–139, North-Holland, Amsterdam.Google Scholar
  15. Desrosiers, J., Sauvé, M., and Soumis, F. (1988). Lagrangean relaxation methods for solving the minimum fleet size multiple travelling-salesman problem with time windows. Management Science 34:1005–1022.MathSciNetGoogle Scholar
  16. Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42:977–978.zbMATHGoogle Scholar
  17. Dumitrescu, I., and Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42:135–153.MathSciNetCrossRefGoogle Scholar
  18. Feillet, D., Dejax, P., Gendreau, M., and Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44:216–229.MathSciNetCrossRefGoogle Scholar
  19. Gélinas, S., Desrochers, M., Desrosiers, J., and Solomon, M.M. (1995). A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61:91–109.CrossRefGoogle Scholar
  20. Halse, K. (1992). Modeling and solving complex vehicle routing problems. Ph.D Thesis, Technical University of Denmark.Google Scholar
  21. Homberger, J. and Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFORMS 37:297–318.Google Scholar
  22. Ioachim, I., Gélinas, S., Desrosiers, J., and Soumis F. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31:193–204.MathSciNetCrossRefGoogle Scholar
  23. Irnich, S. and Villerieuve, D. (2005). The shortest path problem with κ-cycle elimination (κ ≥ 3): Improving a branch-and-price algorithm for the VRPTW. Forthcoming in: INFORMS Journal of Computing.Google Scholar
  24. Jörnsten, K., Madsen, O.B.G., and Sørensen, B. (1986). Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting, Research Report 5/1986, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark.Google Scholar
  25. Kallehauge, B. (2000). Lagrangian duality and non-differentiable optimization—Applied on vehicle routing [in Danish]. Master’s Thesis, Technical University of Denmark.Google Scholar
  26. Kallehauge, B. and Boland, N. (2004). Infeasible path inequalities for the vehicle routing problem with time windows. Technical Report, Centre for Traffic and Transport, Technical University of Denmark.Google Scholar
  27. Kallehauge, B., Larsen, J., and Madsen, O.B.G. (2000). Lagrangean duality and non-differentiable optimization applied on routing with time windows—Experimental results. Technical Report IMM-REP-2000-8, Department of Mathematical Modelling, Technical University of Denmark.Google Scholar
  28. Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. Ph.D Thesis, Technical University of Denmark.Google Scholar
  29. Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., and Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33:101–116.Google Scholar
  30. Kohl, N. and Madsen, O.B.G. (1997). An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation. Operations Research 45:395–403.MathSciNetGoogle Scholar
  31. Kolen, A.W.J., Rinnooy Kan, A.H.G., and Trienekens, H.W.J.M. (1987). Vehicle routing with time windows. Operations Research 35:266–273.MathSciNetCrossRefGoogle Scholar
  32. Kontoravdis, G. and Bard, J.F. (1995). A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing 7:10–23.Google Scholar
  33. Laporte, G., Nobert, Y., and Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations Research 33:1050–1073.MathSciNetGoogle Scholar
  34. Larsen, J. (1999). Parallelization of the vehicle routing problem with time windows. Ph.D Thesis, Technical University of Denmark.Google Scholar
  35. Larsen, J. (2004). Refinements of the column generation process for the vehicle routing problem with time windows. Journal of Systems Science and Systems Engineering 13(3):326–341.CrossRefGoogle Scholar
  36. Mak, V.H. (2001). On the asymmetric travelling salesman problem with replenishment arcs. Ph.D Thesis, Department of Mathematics and Statistics, The University of Melbourne.Google Scholar
  37. du Merle, O., Villeneuve, D., Desrosiers, J., and Hansen, P. (1999). Stabilized column generation. Discrete Mathematics 199:229–237.Google Scholar
  38. Naddef, D., and Rinaldi, G. (2002). Branch-and-cut algorithms for the capacitated VRP. In: The Vehicle Routing Problem (P. Toth and D. Vigo, eds.), SIAM Monographs on Discrete Mathematics and Applications, pp. 53–84, SIAM, Philadelphia.Google Scholar
  39. Rousseau, L.-M., Gendreau, M., and Pesant, G. (2004). Solving VRPTWs with constraint programming based column generation. Annals of Operations Research 130:199–216.MathSciNetCrossRefGoogle Scholar
  40. Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35:254–265.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Brian Kallehauge
    • 1
  • Jesper Larsen
    • 1
  • Oli B.G. Madsen
    • 1
  • Marius M. Solomon
    • 2
    • 3
  1. 1.Technical University of DenmarkDenmark
  2. 2.Northeastern UniversityUSA
  3. 3.Northeastern UniversityGeradCanada

Personalised recommendations