A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
- 30 June 1986
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 20 (3), 243-257
- https://doi.org/10.1016/0191-2615(86)90020-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Routing and scheduling of vehicles and crews: The state of the artComputers & Operations Research, 1983
- 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
- An approximate analytic model of many-to-many demand responsive transportation systemsTransportation Research, 1978
- Scheduling Dial-a-Ride Transportation SystemsTransportation Science, 1978
- An Asymptotic, Probabilistic Analysis of a Routing ProblemMathematics of Operations Research, 1978