Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems

  • Ann-Kathrin RothenbächerEmail author
Conference paper
Part of the Operations Research Proceedings book series (ORP)


This article deals with new exact branch-and-price-and-cut algorithms for the solution of routing problems. Specialized methods for the pickup-and-delivery problem (PDP), the truck-and-trailer routing problem (TTRP), the periodic vehicle routing problem (PVRP) and a service network design and hub location problem (SNDHLP) are presented. We develop a new technique for the acceleration of bidirectional labeling algorithms by a dynamic choice of the merge point. Moreover, for variants of the PDP, the bidirectional labeling can be effectively applied for the first time. In the TTRP, we model the extension to a 2 days planning horizon and the consideration of a quantity-dependent transfer time. The PVRP is treated with full flexible schedule structures for the first time. For these two last-mentioned problems, special techniques to tackle the symmetry are presented. The SNDHLP constitutes a new real-world problem in the application area of combined transport and is also solved with a problem-specific branch-and-price-and-cut algorithm.


Vehicle routing Column generation Bidirectional labeling 


  1. 1.
    Desrosiers, J., Lübbecke, M.: Branch-price-and-cut algorithms. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Inc., Hoboken (2011)CrossRefGoogle Scholar
  2. 2.
    Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem with service choice. Transp. Sci. 40(4), 439–454 (2006)CrossRefGoogle Scholar
  3. 3.
    Gschwind, T., Irnich, S., Rothenbächer, A.K., Tilk, C.: Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266(2), 521–530 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M. (eds.) Column Generation, pp. 33–65. Springer, New York (2005)CrossRefGoogle Scholar
  5. 5.
    Righini, G., Salani, M.: Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3(3), 255–273 (2006)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Rothenbächer, A.K.: Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transp. Sci.
  7. 7.
    Rothenbächer, A.K., Drexl, M., Irnich, S.: Branch-and-price-and-cut for a service network design and hub location problem. Eur. J. Oper. Res. 255(3), 935–947 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Rothenbächer, A.K., Drexl, M., Irnich, S.: Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transp. Sci. 52(5), 1174–1190 (2018)CrossRefGoogle Scholar
  9. 9.
    Tilk, C., Rothenbächer, A.K., Gschwind, T., Irnich, S.: Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur. J. Oper. Res. 261(2), 530–539 (2017)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Toth, P., Vigo, D. (eds.): Vehicle Routing. Society for Industrial and Applied Mathematics, Philadelphia (2014)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Chair of Logistics Management, Gutenberg School of Management and EconomicsJohannes Gutenberg UniversityMainzGermany

Personalised recommendations