Skip to main content
SpringerLink
Log in

Exact algorithms for routing problems under vehicle capacity constraints

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The solution of a vehicle routing problem calls for the determination of a set of routes, each performed by a single vehicle which starts and ends at its own depot, such that all the requirements of the customers are fulfilled and the global transportation cost is minimized. The routes have to satisfy several operational constraints which depend on the nature of the transported goods, on the quality of the service level, and on the characteristics of the customers and of the vehicles. One of the most common operational constraint addressed in the scientific literature is that the vehicle fleet is capacitated and the total load transported by a vehicle cannot exceed its capacity.

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 vehicle routing problems under capacity constraints, with a focus on the basic Capacitated Vehicle Routing Problem (CVRP) and on heterogeneous vehicle routing problems.

The most important mathematical formulations for the problem together with various relaxations are reviewed. The paper also describes the recent exact methods 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. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press.

    Google Scholar 

  • Araque, J. R., 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, J. M., 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, J. M., Benavent, E., Corberán, A., & Naddef, D. (1998). Separating capacity constraints in the CVRP using tabu search. European Journal of Operational Research, 106, 546–557.

    Article  Google Scholar 

  • Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120(2), 347–380.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Baldacci, R., Bodin, L., & Mingozzi, A. (2006). The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Computers and Operations Research, 33(9), 2667–2702.

    Article  Google Scholar 

  • Baldacci, R., Toth, P., & Vigo, D. (2007). Recent advances in vehicle routing exact algorithms. 4OR: A Quarterly Journal of Operations Research, 5(4), 269–298.

    Article  Google Scholar 

  • Baldacci, R., Battarra, M., & Vigo, D. (2008a). Routing a heterogeneous fleet of vehicles. In B. L. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (Vol. 43, pp. 3–27). Berlin: Springer.

    Chapter  Google Scholar 

  • Baldacci, R., Christofides, N., & Mingozzi, A. (2008b). An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming Ser. A, 115(2), 351–385.

    Article  Google Scholar 

  • Baldacci, R., Battarra, M., & Vigo, D. (2009, to appear). Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks. DOI: 10.1002/net.20331

  • Balinski, M., & Quandt, R. (1964). On an integer program for a delivery problem. Operations Research, 12, 300–304.

    Article  Google Scholar 

  • Bramel, J., & Simchi-Levi, D. (2002). Set-covering-based algorithms for the capacitated VRP. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications : Vol. 9. The vehicle routing problem (pp. 85–108). Philadelphia: SIAM.

    Chapter  Google Scholar 

  • Choi, E., & Tcha, D. W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34, 2080–2095.

    Article  Google Scholar 

  • Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309–318.

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  • Chvátal, V. (1973). Edmonds polytopes and weakly Hamiltonian graphs. Mathematical Programming, 5, 29–40.

    Article  Google Scholar 

  • Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105–119.

    Article  Google Scholar 

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

    Google Scholar 

  • Cornuéjols, G., & Harche, F. (1993). Polyhedral study of the capacitated vehicle routing. Mathematical Programming, 60, 21–52.

    Article  Google Scholar 

  • CPLEX. (2006). ILOG CPLEX 9.0 callable library. ILOG.

  • Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.

    Article  Google Scholar 

  • Finke, G., Claus, A., & Gunn, E. (1984). A two-commodity network flow approach to the traveling salesman problem. Congressus Numerantium, 41, 167–178.

    Google Scholar 

  • Fischetti, M., & Toth, P. (1989). An additive bounding procedure for combinatorial optimization problems. Operational Research, 37(2), 319–328.

    Google Scholar 

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

    Google Scholar 

  • Fischetti, M., Salazar González, J. J., & 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, M. L. (1994). Optimal solution of vehicle routing problems using minimum K-trees. Operational Research, 42, 626–642.

    Google Scholar 

  • Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., & Werneck, R.F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming (A), 106, 491–511.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1990). Computers and intractability; A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  • Gendreau, M., Laporte, G., & Potvin, J.-Y. (2002). Metaheuristics for the capacitated VRP. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications : Vol. 9. The vehicle routing problem (pp. 129–154). Philadelphia: SIAM.

    Chapter  Google Scholar 

  • Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7, 113–148.

    Article  Google Scholar 

  • Gouveia, L. (1995). A result on projection for the vehicle routing problem. European Journal of Operational Research, 85, 610–624.

    Article  Google Scholar 

  • Grötschel, M., & Padberg, M. W. (1979). On the symmetric traveling salesman problem: I and II. Mathematical Programming, 16, 265–280.

    Article  Google Scholar 

  • Grötschel, M., & Padberg, M. W. (1985). Polyhedral theory. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem: A guided tour of combinatorial optimization (pp. 231–305). Chichester: Wiley.

    Google Scholar 

  • Laporte, G., & Nobert, Y. (1984). Comb inequalities for the vehicle routing problem. Methods of Operations Research, 51, 271–276.

    Google Scholar 

  • Laporte, G., & Nobert, Y. (1987). Exact algorithms for the vehicle routing problem. Annals of Discrete Mathematics, 31, 147–184.

    Google Scholar 

  • Laporte, G., & Semet, F. (2002). Classical heuristics for the capacitated VRP. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications : Vol. 9. The vehicle routing problem (pp. 109–128). Philadelphia: SIAM.

    Chapter  Google Scholar 

  • Laporte, G., Nobert, Y., & Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operational Research, 33, 1058–1073.

    Google Scholar 

  • Letchford, A. N., & Salazar González J. J. (2006). Projection results for vehicle routing. Mathematical Programming, 105(2–3), 251–274.

    Article  Google Scholar 

  • Letchford, A. N., Eglese, R. W., & Lysgaard, J. (2002). Multistars, partial multistars and the capacitated vehicle routing problem. Mathematical Programming, 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, A. N., & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2), 423–445.

    Article  Google Scholar 

  • Naddef, D., & Rinaldi, G. (2002). Branch-and-cut algorithms for the capacitated VRP. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications : Vol. 9. The vehicle routing problem (pp. 53–81). Philadelphia: SIAM.

    Chapter  Google Scholar 

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

  • Östergård, P. R. J. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1–3), 197–207.

    Article  Google Scholar 

  • Pessoa, A., de Aragão, M. P., & Uchoa, E. (2008). Robust branch-cut-and-price algorithms for vehicle routing problems. In B. L. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges (Vol. 43, pp. 297–325). Berlin: Springer.

    Chapter  Google Scholar 

  • Pessoa, A., & Uchoa, E. de Aragão, M.P. (2009, to appear). A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks. DOI: 10.1002/net.20330

  • Ralphs, T. K., Kopman, L., Pulleyblank, W. R., & Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical Programming (B), 94, 343–359.

    Article  Google Scholar 

  • Toth, P., & Vigo, D. (2002). SIAM monographs on discrete mathematics and applications: Vol. 9. The vehicle routing problem. Philadelphia: SIAM.

    Google Scholar 

  • Yaman, H. D. (2006). Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming Ser. A, 106, 365–390.

    Article  Google Scholar 

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.

Additional information

This is an updated version of the paper “Recent advances in vehicle routing exact algorithms” that appeared in 4OR, 5(4), 269–298 (2007).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldacci, R., Toth, P. & Vigo, D. Exact algorithms for routing problems under vehicle capacity constraints. Ann Oper Res 175, 213–245 (2010). https://doi.org/10.1007/s10479-009-0650-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-009-0650-0

Search

Navigation