Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems
Ann-Kathrin Rothenbächer ()
Additional contact information
Ann-Kathrin Rothenbächer: Johannes Gutenberg University
A chapter in Operations Research Proceedings 2018, 2019, pp 29-35 from Springer
Abstract:
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.
Keywords: Vehicle routing; Column generation; Bidirectional labeling (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-18500-8_5
Ordering information: This item can be ordered from
http://www.springer.com/9783030185008
DOI: 10.1007/978-3-030-18500-8_5
Access Statistics for this chapter
More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().