The Multiple Vehicle DIAL-A-RIDE Problem
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraintsNetworks, 1986
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- 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
- Routing with time windows by column generationNetworks, 1984
- 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
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride ProblemTransportation Science, 1980