Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- 1 February 1986
- journal article
- research article
- Published by Informa UK Limited in American Journal of Mathematical and Management Sciences
- Vol. 6 (3-4), 327-367
- https://doi.org/10.1080/01966324.1986.10737199
Abstract
This paper examines the scheduling of large-scale advance-request dial-a-ride systems, describes two algorithms that have been developed recently to solve problems in this area, and provides analysis and insights into how these algorithms are expected to perform under various operational scenarios and in comparison with one another. The algorithms examined are the GCR (Grouping/Clustering/Routing) and ADARTW (Advanced Dial-A-Ride with Time Windows) procedures. The paper gives an overview of both algorithms, emphasizes the differences in their operational scenarios, describes computational experience with both procedures and includes worst-case considerations for ADARTW. Extensions and directions for further research are also discussed.Keywords
This publication has 9 references indexed in Scilit:
- 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
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride ProblemTransportation Science, 1980
- Worst-Case Analysis of Heuristic AlgorithmsManagement Science, 1980
- Some Examples of Difficult Traveling Salesman ProblemsOperations Research, 1978
- Approximate algorithms for the traveling salesperson problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973