Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
DOI10.1016/J.ORL.2010.11.004zbMATH Open1208.90017OpenAlexW1971981099MaRDI QIDQ631208FDOQ631208
Authors: Gerhard J. Woeginger, M. 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
Recommendations
- Feasibility testing for dial-a-ride problems
- Efficient feasibility testing for dial-a-ride problems
- An effective and fast heuristic for the dial-a-ride problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A note on ``Efficient feasibility testing for dial-a-ride problems
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Introduction to algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Efficient feasibility testing for dial-a-ride problems
- A note on ``Efficient feasibility testing for dial-a-ride problems
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Cited In (11)
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- A ride time-oriented scheduling algorithm for dial-a-ride problems
- 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
- A note on ``Efficient feasibility testing for dial-a-ride problems
- The dial-A-ride problem with transfers
- Feasibility testing for dial-a-ride problems
- Typology and literature review for dial-a-ride problems
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
This page was built for publication: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631208)
