Advertisement

Mathematical Programming Computation

, Volume 9, Issue 1, pp 61–100 | Cite as

Improved branch-cut-and-price for capacitated vehicle routing

  • Diego Pecin
  • Artur Pessoa
  • Marcus Poggi
  • Eduardo Uchoa
Full Length Paper

Abstract

The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column generation. Some authors only used cuts expressed over the variables of the original formulation, in order to keep the pricing subproblem relatively easy. Other authors could reduce the duality gaps by also using a restricted number of cuts over the master LP variables, stopping when the pricing becomes prohibitively hard. A particularly effective family of such cuts are the subset row cuts. This work introduces a technique for greatly reducing the impact on the pricing of these cuts, thus allowing much more cuts to be added. The newly proposed branch-cut-and-price algorithm also incorporates and combines for the first time (often in an improved way) several elements found in previous works, like route enumeration and strong branching. All the instances used for benchmarking exact algorithms, with up to 199 customers, were solved to optimality. Moreover, some larger instances with up to 360 customers, only considered before by heuristic methods, were solved too.

Keywords

Integer programming Column generation Cut separation Algorithmic engineering 

Mathematics Subject Classification

90C10 Integer programming 90C39 Dynamic programming 90C57 Polyhedral combinatorics branch-and-bound branch-and-cut 

References

  1. 1.
    Achterberg, T.: Constraint integer programming. PhD thesis, Technische Universitat Berlin (2007)Google Scholar
  2. 2.
    Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2), 351–385 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269–1283 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Boland, N., Dethridge, J., Dumitrescu, I.: Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1), 58–68 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20, 309–318 (1969)CrossRefGoogle Scholar
  6. 6.
    Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley Interscience, New York (1979)Google Scholar
  7. 7.
    Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255–282 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Contardo, C.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Technical report, Archipel-UQAM 5078, Université du Québec à Montréal, Canada (2012)Google Scholar
  9. 9.
    Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342–354 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491–511 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Godinho, M.T., Gouveia, L., Magnanti, T., Pesneau, P., Pires, J.: On time-dependent models for unit demand vehicle routing problems. In: International Network Optimization Conference (INOC) (2007)Google Scholar
  14. 14.
    Golden, B., Wasil, E., Kelly, J., Chao, I.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Fleet Management and Logistics, pp. 33–56. Springer, Berlin (1998)Google Scholar
  15. 15.
    Irnich, S., Desaulniers, G., Desrosiers, J., Hadjar, A.: Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS J. Comput. 22(2), 297–313 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Irnich, S., Villeneuve, D.: The shortest-path problem with resource constraints and k-cycle elimination for k \(\ge \) 3. INFORMS J. Comput. 18(3), 391–406 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2), 497–511 (2008)CrossRefzbMATHGoogle Scholar
  18. 18.
    Kullmann, O.: Fundaments of branching heuristics. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 205–244. IOS Press, Amsterdam (2009)Google Scholar
  19. 19.
    Lysgaard, J.: CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Aarhus School of Business, Department of Management Science and Logistics (2003)Google Scholar
  20. 20.
    Lysgaard, J., Letchford, A., Eglese, R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100, 423–445 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Martinelli, R., Pecin, D., Poggi, M.: Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239, 102–111 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP, Chap. 3. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 53–84. SIAM (2002)Google Scholar
  23. 23.
    Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. In: Integer Programming and Combinatorial Optimization, pp. 393–403. Springer (2014)Google Scholar
  24. 24.
    Pessoa, A., Poggi de Aragão, M., Uchoa, E.: Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 297–325. Springer, Berlin (2008)CrossRefGoogle Scholar
  25. 25.
    Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: In-out separation and column generation stabilization by dual price smoothing. In: Symposium on Experimental Algorithms, pp. 354–365. Springer (2013)Google Scholar
  26. 26.
    Pessoa, A., Uchoa, E., Poggi de Aragão, M., Rodrigues, R.: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Math. Program. Comput. 2(3–4), 259–290 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Pessoa, A., Uchoa, E., Poggi de Aragão, M.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54(4), 167–177 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Poggi de Aragão, M., Uchoa, E.: Integer program reformulation for robust branch-and-cut-and-price. In: Wolsey, L. (ed.) Ann. Math. Program. Rio, pp. 56–61. Búzios, Brazil (2003)Google Scholar
  29. 29.
    Poggi de Aragão, M., Uchoa, E.: New exact algorithms for the capacitated vehicle routing problem. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, pp. 59–86. SIAM (2014)Google Scholar
  30. 30.
    Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3), 255–273 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3), 155–170 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Røpke, S.: Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation (2012)Google Scholar
  33. 33.
    Santos, H., Toffolo, T., Gomes, R., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239(1), 225–251 (2014)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society 2016

Authors and Affiliations

  • Diego Pecin
    • 1
  • Artur Pessoa
    • 2
  • Marcus Poggi
    • 1
  • Eduardo Uchoa
    • 2
  1. 1.Departamento de InformáticaPontifícia Universidade Católica do Rio de JaneiroRio de JaneiroBrazil
  2. 2.Departamento de Engenharia de ProduçãoUniversidade Federal FluminenseNiteróiBrazil

Personalised recommendations