A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- 1 December 1995
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 60 (1), 193-208
- https://doi.org/10.1007/bf02031946
Abstract
No abstract availableKeywords
This publication has 14 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
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986
- Pickup and Delivery of Partial Loads with “Soft” Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986
- Scheduling Large-Scale Advance-Request Dial-A-Ride SystemsAmerican Journal of Mathematical and Management Sciences, 1986
- 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
- Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problemTransportation Research Part B: Methodological, 1983
- 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