Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem with service choice. Transp. Sci. 40(4), 439–454 (2006)
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)
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)
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)
Rothenbächer, A.K.: Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transp. Sci. https://doi.org/10.1287/trsc.2018.0855
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)
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)
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)
Toth, P., Vigo, D. (eds.): Vehicle Routing. Society for Industrial and Applied Mathematics, Philadelphia (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Rothenbächer, AK. (2019). Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)