Skip to main content
SpringerLink
Log in

Vehicle Routing Problem with Time Windows

  • Chapter
Column Generation

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.

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

Access this chapter

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ascheuer, N., Fischetti, M., and Grötschel, M. (2000). Polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36:69–79.

    Article  MathSciNet  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • Balas, E., Fischetti, M., and Pulleyblank, W.R. (1995). The precedence-constrained asymmetric travelling salesman polytope. Mathematical Programming 68:241–265.

    MathSciNet  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Chabrier, A. (2005). Vehicle routing problem with elementary shortest path based column generation. Forthcoming in: Computers and Operations Research.

    Google Scholar 

  • 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 

  • 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 

  • 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 

  • Crowder, H. and Padberg, M. (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26:495–509.

    MathSciNet  Google Scholar 

  • 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 

  • 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 

  • 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.

    MathSciNet  Google Scholar 

  • 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 

  • 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 

  • 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.

    MathSciNet  Google Scholar 

  • Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42:977–978.

    MATH  Google Scholar 

  • Dumitrescu, I., and Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42:135–153.

    Article  MathSciNet  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Halse, K. (1992). Modeling and solving complex vehicle routing problems. Ph.D Thesis, Technical University of Denmark.

    Google Scholar 

  • Homberger, J. and Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFORMS 37:297–318.

    Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • 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 

  • 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 

  • Kallehauge, B. (2000). Lagrangian duality and non-differentiable optimization—Applied on vehicle routing [in Danish]. Master’s Thesis, Technical University of Denmark.

    Google Scholar 

  • 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 

  • 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 

  • Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. Ph.D Thesis, Technical University of Denmark.

    Google Scholar 

  • 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 

  • 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.

    MathSciNet  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • 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 

  • Laporte, G., Nobert, Y., and Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations Research 33:1050–1073.

    MathSciNet  Google Scholar 

  • Larsen, J. (1999). Parallelization of the vehicle routing problem with time windows. Ph.D Thesis, Technical University of Denmark.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • du Merle, O., Villeneuve, D., Desrosiers, J., and Hansen, P. (1999). Stabilized column generation. Discrete Mathematics 199:229–237.

    Google Scholar 

  • 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 

  • Rousseau, L.-M., Gendreau, M., and Pesant, G. (2004). Solving VRPTWs with constraint programming based column generation. Annals of Operations Research 130:199–216.

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University of Denmark, Denmark

    Brian Kallehauge, Jesper Larsen & Oli B.G. Madsen

  2. Northeastern University, USA

    Marius M. Solomon

  3. Northeastern University, Gerad, Canada

    Marius M. Solomon

Authors
  1. Brian Kallehauge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesper Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oli B.G. Madsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marius M. Solomon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GERAD and École Polytechnique de Montréal, Canada

    Guy Desaulniers

  2. GERAD and HEC Montréal, Canada

    Jacques Desrosiers

  3. GERAD and Northeastern University, Boston

    Marius M. Solomon

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M. (2005). Vehicle Routing Problem with Time Windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation. Springer, Boston, MA. https://doi.org/10.1007/0-387-25486-2_3

Download citation

Publish with us

Policies and ethics

Search

Navigation