Scheduling dial-a-ride paratransit under time-varying, stochastic congestion
- 31 July 2002
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 36 (6), 485-506
- https://doi.org/10.1016/s0191-2615(01)00014-5
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Estimation of time‐dependent, stochastic route travel times using artificial neural networksTransportation Planning and Technology, 2000
- Improving Paratransit Scheduling by Accounting for Dynamic and Stochastic Variations in Travel TimeTransportation Research Record: Journal of the Transportation Research Board, 1999
- Expected shortest paths in dynamic and stochastic traffic networksTransportation Research Part B: Methodological, 1998
- Vehicle-routeing with Time Windows and Time-varying CongestionJournal of the Operational Research Society, 1991
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience CostsTransportation Science, 1990
- A HEURISTIC ALGORITHM FOR THE TRAVELLING SALESMAN PROBLEM WITH TIME-VARYING TRAVEL COSTSEngineering Optimization, 1987
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. SchedulingTransportation Science, 1985
- An approximate analytic model of many-to-many demand responsive transportation systemsTransportation Research, 1978
- Scheduling Dial-a-Ride Transportation SystemsTransportation Science, 1978