Skip to main content
SpringerLink
Log in

Exact Solution of the Vehicle Routing Problem

  • Chapter
Fleet Management and Logistics

Part of the book series: Centre for Research on Transportation ((CRT))

Abstract

The Vehicle Routing Problem (VRP) is a hard and well-known combinatorial optimization problem which calls for the determination of the optimal routes used by a fleet of vehicles, based at one or more depots, to serve a set of customers. In practical applications of the VRP arising in the design and management of distribution systems, several operational constraints are imposed on the route construction. For example, the service may involve both deliveries and collections, the load along each route must not exceed the given capacity of the vehicles, the total length of each route must not be greater than a prescribed limit, the service of the customers must occur within given time windows, the fleet may contain heterogeneous vehicles, precedence relations may exist between the customers, the customer demands may not be completely known in advance, the service of a customer may be split among different vehicles, and some problem characteristics, as the demands or the travel times, may vary dynamically.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

  • Achuthan, N.R., L. Caccetta and S.P. Hill. (1995). An Improved Branch and Cut Algorithm for the Capacitated Vehicle Routing Problem. Technical report, School of Mathematics and Statistics, Curtin University of Technology, Perth, Australia.

    Google Scholar 

  • Achuthan, N.R., L. Caccetta and S.P. Hill. (1996). A New Subtour Elimination Constraint for the Vehicle Routing Problem. European Journal of Operational Research, 91:573–586.

    Article  Google Scholar 

  • Agarwal, Y., K. Mathur and H.M. Salkin. (1989). A Set-Partitioning-Based Exact Algorithm for the Vehicle Routing Problem. Networks, 19:731–749.

    Article  Google Scholar 

  • Araque, J.R., G. Kudva, T.L. Morin and J.F. Pekny. (1994). A Branch-and-Cut for Vehicle Routing Problems. Annals of Operations Research, 50:37–59.

    Article  Google Scholar 

  • Augerat, P., J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef and G. Rinaldi. (1995). Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report RR949-M, ARTEMIS-IMAG, Grenoble, France.

    Google Scholar 

  • Balinski, M. and R. Quandt. (1964). On an Integer Program for a Delivery Problem. Operations Research, 12:300–304.

    Article  Google Scholar 

  • Bellmore, M. and J.C. Malone. (1971). Pathology of Travelling Salesman Subtour-Elimination Algorithms. Operations Research, 19:278–307.

    Article  Google Scholar 

  • Bodin, L., B.L. Golden, A.A. Assad and M.O. Ball. (1983). Routing and Scheduling of Vehicles and Crews, the State of the Art. Computers and Operations Research, 10(2):63–212.

    Article  Google Scholar 

  • Bramel, J. and D. Simchi-Levi. (1997). On the Effectiveness of the Set Partitioning Formulation for the Vehicle Routing Problem. Operations Research, 45:295–301.

    Article  Google Scholar 

  • Campos, V., A. Corberán and E. Mota. (1991). Polyhedral Results for a Vehicle Routing Problem. European Journal of Operational Research, 52:75–85.

    Article  Google Scholar 

  • Carpaneto, G. and P. Toth. (1980). Some New Branching and Bounding Criteria for the Asymmetric Traveling Salesman Problem. Management Science, 26:736–743.

    Article  Google Scholar 

  • Christofides, N. (1985a). Vehicle Routing. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, editors, The Traveling Salesman Problem, pages 431–448. Wiley, Chichester.

    Google Scholar 

  • Christofides, N. (1985b). Vehicle Routing. In J.K. Lenstra and A.H.G. Rinnooy Kan, editors, Annotated Bibliographies in Combinatorial Optimization, pages 148–163. Wiley, Chichester.

    Google Scholar 

  • Christofides, N. and S. Eilon. (1969). An Algorithm for the Vehicle Dispatching Problem. Operational Research Quarterly, 20:309–318.

    Article  Google Scholar 

  • Christofides, N. and A. Mingozzi. (1989). Vehicle Routing: Practical and Algorithmic Aspects. In C.F.H. van Rijn, editor, Logistics: Where Ends Have to Meet, pages 30–48. Pergamon Press.

    Google Scholar 

  • Christofides, N., A. Mingozzi and P. Toth. (1979). The Vehicle Routing Problem. In N. Christofides, A. Mingozzi, P. Toth and C. Sandi, editors, Combinatorial Optimization, pages 315–338. Wiley, Chichester.

    Google Scholar 

  • Christofides, N., A. Mingozzi and P. Toth. (1981). Exact Algorithms for the Vehicle Routing Problem Based on the Spanning Tree and Shortest Path Relaxations. Mathematical Programming, 20:255–282.

    Article  Google Scholar 

  • Chvátal, V. (1973). Edmonds Polytopes and Weakly Hamiltonian Graphs. Mathematical Programming, 5:29–40.

    Article  Google Scholar 

  • Cornuéjols, G. and F. Harche. (1993). Polyhedral Study of the Capacitated Vehicle Routing Problem. Mathematical Programming, 60(1):21–52.

    Article  Google Scholar 

  • Desaulniers, G., J. Desrosiers, I. Ioachim, M.M. Solomon, F. Soumis and D. Villeneuve. (1997). A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. In T.G. Crainic and G. Laporte, editors, Fleet Management and Logistics, pages 57–93, Kluwer, Norwell, MA.

    Google Scholar 

  • Desrochers, M., J. Desrosiers and M.M. Solomon. (1992). A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research, 40:342–354.

    Article  Google Scholar 

  • Desrochers, M. and G. Laporte. (1991). Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints. Operations Research Letters, 10:27–36.

    Article  Google Scholar 

  • Desrosiers, J., Y. Dumas, M.M. Solomon and F. Soumis. (1995). Time Constrained Routing and Scheduling. In M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhuser, editors, Network Routing, Handbooks in Operations Research and Management Science, pages 35–139, North-Holland, Amsterdam.

    Google Scholar 

  • Dongarra, J.J. (1996). Performance of Various Computers using Standard Linear Equations Software. Technical Report CS-89-85, University of Tennessee, Knoxville.

    Google Scholar 

  • Fischetti, M., J.J. Salazar-Gonzalez and P. Toth. (1995). Experiments with a Multi-Commodity Formulation for the Symmetric Capacitated Vehicle Routing Problem. In Proceedings of the 3rd Meeting of the EURO Working Group on Transportation, Barcelona, Spain. Universitat Politècnica de Catalunya.

    Google Scholar 

  • Fischetti, M. and P. Toth. (1989). An Additive Bounding Procedure for Combinatorial Optimization Problems. Operations Research, 37:319–328.

    Article  Google Scholar 

  • Fischetti, M. and P. Toth. (1992). An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem. Mathematical Programming, 53:173–197.

    Article  Google Scholar 

  • Fischetti, M., P. Toth and D. Vigo. (1994). A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Operations Research, 42(5):846–859.

    Article  Google Scholar 

  • Fisher, M.L. (1985). An Application Oriented Guide to Lagrangian Relaxation. Interfaces, 15:10–21.

    Article  Google Scholar 

  • Fisher, M.L. (1994a). Optimal Solution of Vehicle Routing Problems using Minimum k-Trees. Operations Research, 42:626–642.

    Article  Google Scholar 

  • Fisher, M.L. (1994b). A Polynomial Algorithm for the Degree Constrained k-Tree Problem. Operations Research, 42(4):776–780.

    Google Scholar 

  • Fisher, M.L. (1995). Vehicle Routing. In M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, editors, Network Routing, Handbooks in Operations Research and Management Science, pages 1–33. North-Holland, Amsterdam.

    Google Scholar 

  • Fisher, M.L. and R. Jaikumar. (1981). A Generalized Assignment Heuristic for the Vehicle Routing Problem. Networks, 11:109–124.

    Article  Google Scholar 

  • Fleischmann, B. (1988). A New Class of Cutting Planes for the Symmetric Traveling Salesman Problem. Mathematical Programming, 40:225–246.

    Article  Google Scholar 

  • Golden, B.L. and A.A. Assad. (1988). Vehicle Routing: Methods and Studies. North-Holland, Amsterdam.

    Google Scholar 

  • Gomory, R. (1963). An Algorithm for Integer Solution to Linear Programs. In Recent Advances in Mathematical Programming, pages 269–302. McGraw-Hill, New York.

    Google Scholar 

  • Grötschel, M. and M.W. Padberg. (1979). On the Symmetric Traveling Salesman Problem: I-II. Mathematical Programming, 16:265–302.

    Article  Google Scholar 

  • Hadjiconstantinou, E., N. Christofides and A. Mingozzi. (1995). A New Exact Algorithm for the Vehicle Routing Problem Based on q-Paths and k-Shortest Paths Relaxations. Annals of Operations Research, 61:21–43.

    Article  Google Scholar 

  • Held, M. and R.M. Karp. (1971). The Traveling Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming, 1:6–25.

    Article  Google Scholar 

  • Hill, S.P. (1995). Branch-and-Cut Methods for the Symmetric Capacitated Vehicle Routing Problem. PhD thesis, Curtin University of Technology, Australia.

    Google Scholar 

  • Kulkarni, R.V. and P.V. Bhave. (1985). Integer Programming Formulations of Vehicle Routing Problems. European Journal of Operational Research, 20:58–67.

    Article  Google Scholar 

  • Laporte, G. (1992). The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, 59:345–358.

    Article  Google Scholar 

  • Laporte, G. (1997). Vehicle Routing. In M. Dell’Amico, F. Maffioli and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester.

    Google Scholar 

  • Laporte, G., H. Mercure and Y. Nobert. (1986). An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem. Networks, 16:33–46.

    Article  Google Scholar 

  • Laporte, G. and Y. Nobert. (1984). Comb Inequalities for the Vehicle Routing Problem. Methods of Operations Research, 51:271–276.

    Google Scholar 

  • Laporte, G., Y. Nobert and M. Desrochers. (1985). Optimal Routing under Capacity and Distance Restrictions. Operations Research, 33:1050–1073.

    Article  Google Scholar 

  • Laporte, G. and Y. Nobert. (1987). Exact Algorithms for the Vehicle Routing Problem. Annals of Discrete Mathematics, 31:147–184.

    Google Scholar 

  • Laporte, G. and I.H. Osman. (1995). Routing Problems: A Bibliography. Annals of Operations Research, 61:227–262.

    Article  Google Scholar 

  • Lenstra, J.K. and A.H.G. Rinnooy Kan. (1975). Some Simple Applications of the Traveling Salesman Problem. Operational Research Quarterly, 26:717–734.

    Article  Google Scholar 

  • Lin, S. and B.W. Kernighan. (1973). An Effective Heuristic Algorithm for the Travelling Salesman Problem. Operations Research, 21:498–516.

    Article  Google Scholar 

  • Magnanti, T.L. (1981). Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects. Networks, 11:179–214.

    Article  Google Scholar 

  • Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester.

    Google Scholar 

  • Miller, C.E., A.W. Tucker and R.A. Zemlin. (1960). Integer Programming Formulations and Traveling Salesman Problems. Journal of the ACM, 7:326–329.

    Article  Google Scholar 

  • Miller, D.L. (1995). A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems. ORSA Journal on Computing, 7(1): 1–9.

    Article  Google Scholar 

  • Miller, D.L. (1997). personal communication.

    Google Scholar 

  • Miller, D.L. and J.F. Pekny. (1995). A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities. ORSA Journal on Computing, 7:298–320.

    Article  Google Scholar 

  • Pekny, J.F. and D.L. Miller. (1994). A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph. ORSA Journal on Computing, 6:68–81.

    Article  Google Scholar 

  • Toth, P. and D. Vigo. (1995). An Exact Algorithm for the Capacitated Shortest Spanning Arborescence. Annals of Operations Research, 61:121–142.

    Article  Google Scholar 

  • Vigo, D. (1996). A Heuristic Algorithm for the Asymmetric Capacitated Vehicle Routing Problem. European Journal of Operational Research, 89:108–126.

    Article  Google Scholar 

Download references

Authors
  1. Paolo Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniele Vigo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal, Canada

    Teodor Gabriel Crainic

  2. École des Hautes Études Commerciales de Montréal, Canada

    Gilbert Laporte

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Toth, P., Vigo, D. (1998). Exact Solution of the Vehicle Routing Problem. In: Crainic, T.G., Laporte, G. (eds) Fleet Management and Logistics. Centre for Research on Transportation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5755-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5755-5_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7637-8

  • Online ISBN: 978-1-4615-5755-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation