Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
From MaRDI portal
Publication:631208
DOI10.1016/j.orl.2010.11.004zbMath1208.90017OpenAlexW1971981099MaRDI QIDQ631208
Gerhard J. Woeginger, Murat Fırat
Publication date: 22 March 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/analysis-of-the-dialaride-problem-of-hunsaker-and-savelsbergh(52a70299-baf9-4ff0-b109-55682993e15b).html
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (7)
The dial-A-ride problem with transfers ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems ⋮ Graph representation of the fixed route dial-a-ride problem ⋮ Typology and literature review for dial-a-ride problems ⋮ Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem
Cites Work
- Unnamed Item
- A note on ``Efficient feasibility testing for dial-a-ride problems
- Efficient feasibility testing for dial-a-ride problems
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh