96. Shortest Path Problems With Resource Constraints
Invited abstract in session FA-1: WOG OR4Logistics Plenary Stefan Irnich, stream Plenary.
Friday, 9:00 - 10:00Room: L226
Authors (first author is the speaker)
| 1. | Stefan Irnich
|
| Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz |
Abstract
In most vehicle routing and crew scheduling problems solved by column generation-based methods, the subproblem is a variant of the shortest path problem with resource constraints (SPPRC). The SPPRC has contributed to the success of these methods in at least two ways: First, its resource constraints provide a flexible tool for modeling complex cost structures as well as a wide variety of rules that define the feasibility of a route or a schedule. Second, efficient algorithms are available for at least for some important variants of the SPPRC. The talk presents selected examples of modeling with SPPRC and an overview of state-of-the-art methods for solving SPPRC.
Supported by FWO Scientific Research Community OR4Logistics (grant number W001321N).
Keywords
- Algorithms
Status: accepted
Back to the list of papers