Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem
- 30 April 1983
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 17 (2), 133-145
- https://doi.org/10.1016/0191-2615(83)90041-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- 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
- An approximate analytic model of many-to-many demand responsive transportation systemsTransportation Research, 1978
- Scheduling Dial-a-Ride Transportation SystemsTransportation Science, 1978
- Some Examples of Difficult Traveling Salesman ProblemsOperations Research, 1978
- An Asymptotic, Probabilistic Analysis of a Routing ProblemMathematics of Operations Research, 1978
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957