In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This chapter proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution methods. First and foremost, it provides a comprehensive survey on the subject. © 2005 Springer Science+Business Media, Inc.
CITATION STYLE
Irnich, S., & Desaulniers, G. (2005). Shortest path problems with resource constraints. In Column Generation (pp. 33–65). Springer US. https://doi.org/10.1007/0-387-25486-2_2
Mendeley helps you to discover research relevant for your work.