Skip to main content
SpringerLink
Log in

Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we propose an Integer Programming formulation and two branch-and-price implementations for the Two-Echelon Capacitated Vehicle Routing Problem. One algorithm considers routes that satisfy the elementarity condition, while the other relaxes such constraint when pricing routes. For instances that could not be solved to proven optimality within a given time limit, our computational experience suggests that the former provides sharper upper bounds while the latter offers tighter lower bounds. As a by-product, ten new best upper bounds and two new optimality certificates are provided here.

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

  1. Crainic, T.G., Ricciardi, N., Storchi, G.: Models for evaluating and planning city logistics systems. Transp. Sci. 43, 432–454 (2009)

    Article  Google Scholar 

  2. Crainic, T.G., Perboli, G., Mancini, S., Tadei, R.: Two-Echelon vehicle routing problem: a satellite location analysis. Procedia Soc. Behav. Sci. 2, 5944–5955 (2010)

    Article  Google Scholar 

  3. Jung, J., Mathur, K.: An efficient heuristic algorithm for a two-Echelon joint inventory and routing problem. Transp. Sci. 41, 55–73 (2009)

    Article  Google Scholar 

  4. Perboli, G., Tadei, R., Vigo, D.: The two-Echelon capacitated vehicle routing problem: models and math-based heuristics. Tech. Report CIRRELT-2008-55 (2008)

  5. Perboli, G., Tadei, R.: New families of valid inequalities for the two-echelon vehicle routing problem. Elet. N. Disc. Math. 36, 639–646 (2010)

    Article  Google Scholar 

  6. Perboli, G., Tadei, R., Vigo, D.: The Two-Echelon capacitated vehicle routing problem: models and math-based heuristics. Transp. Sci. 45, 364–380 (2011)

    Article  Google Scholar 

  7. Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Progr. Ser. B 94, 343–359 (2002)

    Article  MathSciNet  Google Scholar 

  8. Perboli, G., Pezzella, F., Tadei, R.: EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem math. Methods Oper. Res. 68, 361–382 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46, 316–329 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dondo, R., Méndez, C.A., Cerdá, J.: Managing distribution in supply chain networks. Ind. Eng. Chem. Res. 48, 9961–9978 (2009)

    Article  Google Scholar 

  11. Dondo, R., Méndez, C.A., Cerdá, J.: The multi-Echelon vehicle routing problem with cross docking in supply chain management. Comp. Chem. Eng. 35, 3002–3024 (2009)

    Article  Google Scholar 

  12. Salani, M.: Branch-and-price algorithms for vehicle routing problems. Ph.D. thesis, Universita degli studi di Milano, Italy (2005)

  13. Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem resource constraints: application to vehicle routing problems. Networks 44, 216–229 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jepsen, M.K., Petersen, B., Spoorendonk, S.: A Branch-and-Cut Algorithm for the elementary shortest path problem with a capacity constraint. Tech. Report 08/01 DIKU (2008)

  15. Santos, F.A., Mateus, G.R., da Cunha, A.S.: A novel column generation algorithm for the vehicle routing problem with cross-docking. Lect. N. Comput. Sci. 6701, 412–425 (2011)

    Article  Google Scholar 

  16. Mladenovic, N., Hansen, P.: A variable neighborhood search. Comp. O. R. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Glover, F.: A template for scatter search and path relinking. Lect. N. Comp. Sci. 1363, 13–54 (1997)

    Google Scholar 

  19. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math. Progr. 20, 255–282 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E.: Robust Branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Progr. 106, 491–511 (2006)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  22. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069–1072 (1990). http://people.brunel.ac.uk/~mastjjb/jeb/info.html

  23. Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Multi-start Heuristics for the Two-Echelon vehicle routing problem. Tech. Report CIRRELT-2010-30 (2010)

  24. Hadjar, A., Marcotte, O., Soumis, F.: A Branch-and-Cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54, 130–149 (2006)

    Article  MATH  Google Scholar 

Download references

Acknowledgments

Alexandre Salles da Cunha and Geraldo Robson Mateus are partially funded by CNPq and FAPEMIG.

Author information

Authors and Affiliations

  1. Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

    Fernando Afonso Santos, Alexandre Salles da Cunha & Geraldo Robson Mateus

Authors
  1. Fernando Afonso Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandre Salles da Cunha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Geraldo Robson Mateus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fernando Afonso Santos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Santos, F.A., da Cunha, A.S. & Mateus, G.R. Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem. Optim Lett 7, 1537–1547 (2013). https://doi.org/10.1007/s11590-012-0568-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0568-3

Keywords

Search

Navigation