Efficient feasibility testing for dial-a-ride problems
Authors:
- Brady HunsakerBHBrady Hunsaker
- Martin SavelsberghMSMartin Savelsbergh
- 1 June 2002
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 30 (3) , 169-173
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 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
- k-Interchange procedures for local search in a precedence-constrained routing problemEuropean Journal of Operational Research, 1983
- An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time WindowsTransportation Science, 1983
- 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