Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
DOI10.1016/j.ejor.2019.10.038zbMath1431.90071OpenAlexW2986513968WikidataQ126852066 ScholiaQ126852066MaRDI QIDQ2286924
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.10.038
routingbranch-and-price-and-cuttruck driver schedulingbidirectional labelinghours of service regulations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Cites Work
- Unnamed Item
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- The Canadian minimum duration truck driver scheduling problem
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- A unified solution framework for multi-attribute vehicle routing problems
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Column Generation
- Shortest Path Problems with Resource Constraints
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
This page was built for publication: Bidirectional labeling for solving vehicle routing and truck driver scheduling problems