Skip to main content
Springer Nature Link
Log in

A unified exact method for solving different classes of vehicle routing problems

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper presents a unified exact method for solving an extended model of the well-known Capacitated Vehicle Routing Problem (CVRP), called the Heterogenous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles having different capacities, routing and fixed costs is used to supply a set of customers. The HVRP model considered in this paper contains as special cases: the Single Depot CVRP, all variants of the HVRP presented in the literature, the Site-Dependent Vehicle Routing Problem (SDVRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). This paper presents an exact algorithm for the HVRP based on the set partitioning formulation. The exact algorithm uses three types of bounding procedures based on the LP-relaxation and on the Lagrangean relaxation of the mathematical formulation. The bounding procedures allow to reduce the number of variables of the formulation so that the resulting problem can be solved by an integer linear programming solver. Extensive computational results over the main instances from the literature of the different variants of HVRPs, SDVRP and MDVRP show that the proposed lower bound is superior to the ones presented in the literature and that the exact algorithm can solve, for the first time ever, several test instances of all problem types considered.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  1. Baldacci, R., Battarra, M., Vigo, D.: Routing a heterogeneous fleet of vehicles. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43, Springer, Heidelberg (2008)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming Ser. A (2007). http://dx.doi.org/10.1007/s10107-007-0178-5

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Chao, I.M., Golden, B.L., Wasil, E.A.: A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37(3), 319–336 (1999)

    Google Scholar 

  6. Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2080–2095 (2007)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Cordeau, J.F., Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39, 292–298 (2001)

    Google Scholar 

  10. Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier, Amsterdam (2007)

    Google Scholar 

  11. CPLEX: ILOG CPLEX 10.1 callable library. ILOG (2007)

  12. Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176, 756–773 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, vol. 9, pp. 129–154. SIAM Monogr. Discrete Math. Appl., Philadelphia (2002)

    Google Scholar 

  15. Golden, B.L., Assad, A.A., Levy, L., Gheysens, F.G.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49–66 (1984)

    Article  MATH  Google Scholar 

  16. Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multi depot vehicle routing problems. Congressus Numerantium 44, 283–292 (1984)

    MathSciNet  Google Scholar 

  17. Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci 22, 161–172 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, vol. 9, pp. 109–128. SIAM Monogr. Discrete Math. Appl., Philadelphia (2002)

    Google Scholar 

  19. Li, F., Golden, B.L., Wasil, E.A.: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2734–2742 (2007)

    Article  MATH  Google Scholar 

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

  21. Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. Ser. A 100, 423–445 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nag, B., Golden, B.L., Assad, A.A.: Vehicle routing with site dependencies. In: Golden, B., Assad, A. (eds) Vehicle Routing: Methods and Studies, pp. 149–159. Elsevier, Amsterdam (1988)

    Google Scholar 

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

  24. Pessoa, A., Poggi de Aragão, M., Uchoa, E.: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem, Lecture Notes in Computer Science, vol. 4525, pp. 150–160. Springer, Berlin (2007)

  25. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  26. Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Rech. Opérationnelle 33, 1–14 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  27. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Monogr. Discrete Math. Appl. SIAM, Philadelphia (2002)

    MATH  Google Scholar 

  28. Yaman, H.D.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. Ser. A 106, 365–390 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Roberto Baldacci

  2. Department of Mathematics, University of Bologna, Via Sacchi 3, 47023, Cesena, Italy

    Aristide Mingozzi

Authors
  1. Roberto Baldacci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aristide Mingozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roberto Baldacci.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldacci, R., Mingozzi, A. A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120, 347–380 (2009). https://doi.org/10.1007/s10107-008-0218-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-008-0218-9

Keywords

Mathematics Subject Classification (2000)

Search

Navigation