A dial-a-ride problem for client transportation in a health-care organization
- 1 March 2007
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 34 (3), 742-759
- https://doi.org/10.1016/j.cor.2005.03.024
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- Scheduling dial-a-ride paratransit under time-varying, stochastic congestionTransportation Research Part B: Methodological, 2002
- Modeling and Optimizing Dynamic Dial‐a‐Ride ProblemsInternational Transactions in Operational Research, 2001
- INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALINGEngineering Optimization, 1998
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. RoutingTransportation Science, 1985
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. SchedulingTransportation Science, 1985
- Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problemTransportation Research Part B: Methodological, 1983
- A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride ProblemTransportation Science, 1980
- Scheduling Dial-a-Ride Transportation SystemsTransportation Science, 1978