The dial-a-ride problem: models and algorithms
Top Cited Papers
- 5 May 2007
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 153 (1), 29-46
- https://doi.org/10.1007/s10479-007-0170-8
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problemEuropean Journal of Operational Research, 2006
- A Branch-and-Cut Algorithm for the Dial-a-Ride ProblemOperations Research, 2006
- A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windowsTransportation Research Part B: Methodological, 2004
- Hybrid scheduling methods for paratransit operationsComputers & Industrial Engineering, 2003
- Ambulance location and relocation modelsEuropean Journal of Operational Research, 2003
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- Modeling and Optimizing Dynamic Dial‐a‐Ride ProblemsInternational Transactions in Operational Research, 2001
- Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride SystemPublished by Springer Science and Business Media LLC ,1999
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986