Skip to main content
SpringerLink
Log in

Recent advances in vehicle routing exact algorithms

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This paper provides a review of the most recent developments that had a major impact in the current state-of-the-art of exact algorithms for the CVRP. The most important mathematical formulations for the problem together with various CVRP relaxations are reviewed. The paper also describes the recent exact methods for the CVRP and reports a comparison of their computational performances.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Applegate D, Bixby R, Chvátal V, Cook W (1994) Special session on tsp. In: 15th International Symposium on Mathematical Programming. University of Michigan, USA

  • Araque JR, Hall L, Magnanti T (1990) Capacitated trees, capacitated routing and associated polyhedra. Technical Report Discussion Paper 9061, CORE, Louvain La Nueve

  • Augerat P (1995) Approche polyèdrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble

  • Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble France

  • Augerat P, Belenguer JM, Benavent E, Corberán A and Naddef D (1998). Separating capacity constraints in the CVRP using tabu search. Euro J Oper Res 106: 546–557

    Article  Google Scholar 

  • Baldacci R, Hadjiconstantinou E and Mingozzi A (2004). An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52(5): 723–738

    Article  Google Scholar 

  • Baldacci R, Bodin L and Mingozzi A (2006). The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem. Comput Oper Res 33(9): 2667–2702

    Article  Google Scholar 

  • Baldacci R, Christofides N, Mingozzi A (2007) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program (A). doi:10.1007/s10107-007-0178-5

  • Balinski M and Quandt R (1964). On an integer program for a delivery problem. Oper Res 12: 300–304

    Google Scholar 

  • Bramel J, Simchi-Levi D (2002) Set-covering-based algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 85–108

  • Christofides N and Eilon S (1969). An algorithm for the vehicle dispatching problem. Oper Res Quart 20: 309–318

    Google Scholar 

  • Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides, N, Mingozzi, A, Toth, P, and Sandi, C (eds) Combinatorial optimization, Chap. 11, pp 315–338. Wiley, New York

    Google Scholar 

  • Christofides N, Mingozzi A and Toth P (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math Program 10: 255–280

    Article  Google Scholar 

  • Chvátal V (1973). Edmonds polytopes and weakly hamiltonian graphs. Math Program 5: 29–40

    Article  Google Scholar 

  • Cordeau J-F, Laporte G, Savelsbergh MWP and Vigo D (2007). Vehicle routing. In: Barnhart, C and Laporte, G (eds) Transportation handbooks in operations research and management science, vol 14, pp 367–428. North-Holland, Amsterdam

    Google Scholar 

  • Cornuéjols G and Harche F (1993). Polyhedral study of the capacitated vehicle routing. Math Program 60: 21–52

    Article  Google Scholar 

  • CPLEX. ILOG CPLEX 9.0 callable library. ILOG, 2006

  • Dantzig GB and Ramser JH (1959). The truck dispatching problem. Manage Sci 6(1): 80–91

    Google Scholar 

  • Finke G, Claus A and Gunn E (1984). A two-commodity network flow approach to the traveling salesman problem. Congress Numer 41: 167–178

    Google Scholar 

  • Fischetti M and Toth P (1989). An additive bounding procedure for combinatorial optimization problems. Oper Res 37(2): 319–328

    Article  Google Scholar 

  • Fischetti M, Toth P and Vigo D (1994). A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper Res 42: 846–859

    Google Scholar 

  • Fischetti M, Salazar González JJ, Toth P (1995) Experiments with a multi-commodity formulation for the symmetric capacitated vehicle routing problem. In: 3rd Meeting of the EURO working group on transportation Barcelona, pp 169–173

  • Fisher ML (1994). Optimal solution of vehicle routing problems using minimum K-trees. Oper Res 42: 626–642

    Google Scholar 

  • Fukasawa R, Longo H, Lysgaard J, Poggide Aragão M, Reis M, Uchoa E and Werneck RF (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program (A) 106: 491–511

    Article  Google Scholar 

  • Garey MR and Johnson DS (1990). Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman & Co., New York

    Google Scholar 

  • Golden BL, Magnanti TL and Nguyen HQ (1977). Implementing vehicle routing algorithms. Networks 7: 113–148

    Article  Google Scholar 

  • Gouveia L (1995). A result on projection for the vehicle routing problem. J Opl Res 85: 610–624

    Article  Google Scholar 

  • Grötschel M and Padberg MW (1979). On the symmetric traveling salesman problem: I and II. Math Program 16: 265–280

    Article  Google Scholar 

  • Grötschel M and Padberg MW (1985). Polyhedral theory. In: Lawler, EL, Lenstra, JK, Rinnooy Kan, AHG and Shmoys, DB (eds) The traveling salesman problem: a guided tour of combinatorial optimization, pp 231–305. Wiley, Chichester

    Google Scholar 

  • Laporte G and Nobert Y (1984). Comb inequalities for the vehicle routing problem. Met Oper Res 51: 271–276

    Google Scholar 

  • Laporte G and Nobert Y (1987). Exact algorithms for the vehicle routing problem. Ann Discr Math 31: 147–184

    Google Scholar 

  • Laporte G, Nobert Y and Desrochers M (1985). Optimal routing under capacity and distance restrictions. Oper Res 33: 1058–1073

    Google Scholar 

  • Letchford AN and Salazar González JJ (2006). Projection results for vehicle routing. Math Program 105(2–3): 251–274

    Article  Google Scholar 

  • Letchford AN, Eglese RW and Lysgaard J (2002). Multistars, partial multistars and the capacitated vehicle routing problem. Math Program 94: 21–40

    Article  Google Scholar 

  • Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical report, Dept. of Mgt. Science and Logistics, Aarhus School of Business

  • Lysgaard J, Letchford AN and Eglese RW (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2): 423–445

    Article  Google Scholar 

  • Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) he vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia

  • Niskanen S, Östergård PRJ (2003) Cliquer user’s guide. Technical Report 48, Helsinki University of Technology Communications Laboratory

  • Östergård PRJ (2002). A fast algorithm for the maximum clique problem. Discr Appl Math 120(1–3): 197–207

    Article  Google Scholar 

  • Ralphs TK, Kopman L, Pulleyblank WR and Trotter LE (2003). On the capacitated vehicle routing problem. Math Program (B) 94: 343–359

    Article  Google Scholar 

  • Toth P, Vigo D (2002) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia

Download references

Author information

Authors and Affiliations

  1. DEIS, University of Bologna, Via Venezia 52, 47023, Cesena, Italy

    Roberto Baldacci & Daniele Vigo

  2. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Paolo Toth

Authors
  1. Roberto Baldacci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniele Vigo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniele Vigo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldacci, R., Toth, P. & Vigo, D. Recent advances in vehicle routing exact algorithms. 4OR 5, 269–298 (2007). https://doi.org/10.1007/s10288-007-0063-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-007-0063-3

Keywords

MSC classification (2000)

Search

Navigation