Shortest Path Problems with Resource Constraints

Stefan Irnich () and Guy Desaulniers ()
Additional contact information
Stefan Irnich: RWTH Aachen University
Guy Desaulniers: École Polytechnique and GERAD

Chapter Chapter 2 in Column Generation, 2005, pp 33-65 from Springer

Abstract: Abstract 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.

Keywords: Resource Constraint; Sink Node; Constraint Programming; Short Path Problem; Feasible Path (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (223)

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:sprchp:978-0-387-25486-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9780387254869

DOI: 10.1007/0-387-25486-2_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().