Service capacity design problems for mobility allowance shuttle transit systems

Transportation Research Part B: Methodological

Volumn 42, Issue 2, 2008, Pages 135-146

  Zhao, Jiamin ^a   Dessouky, Maged ^b  

^a ORACLE CORPORATION   (United States)

^b University of Southern California ^*  (United States)

Author keywords

Approximation; Optimization; Transit shuttle

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COST EFFECTIVENESS; OPTIMIZATION; TRANSPORTATION ROUTES;

DEMAND RESPONSIVE TRANSIT SYSTEMS; FIXED-ROUTE BUS SYSTEMS; MOBILITY ALLOWANCE SHUTTLE TRANSIT; TRANSIT SHUTTLE;

BUS TRANSPORTATION;

ALGORITHM; BORN APPROXIMATION; MOBILITY; OPTIMIZATION; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

EID: 35448996512     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2007.07.002     Document Type: Article

References (35)

1. Aldaihani M.M., Quadrifoglio L., Dessouky M.M., and Hall R.W. Network Design for a Grid Hybrid Transit Service. Transportation Research Part A 38 (2004) 511-530
2. Aldaihani M.M., and Dessouky M.M. Hybrid Scheduling Methods for Paratransit Operations. Computers and Industrial Engineering 45 (2003) 75-96
3. Campbell A.M., and Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 38 (2004) 369-378
4. Cordeau J.F., and Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37 (2003) 579-594
5. Cortés C.E., and Jayakrishnan R. Design and operational concepts of a high coverage point-to-point transit system. Transportation Research Record 1783 (2002) 178-187
6. Crainic T.G., Malucelli F., and Nonato M. Flexible many-to-few + few-to-many = an almost personalized transit system. TRISTAN IV, São Miguel Azores Islands (2001) 435-440
7. Daganzo C.F. An approximate analytic model of many-to-many demand responsive transportation systems. Transportation Research 12 (1978) 325-333
8. Daganzo C.F. Checkpoint dial-a-ride systems. Transportation Research Part B 18 (1984) 315-327
9. Daganzo C.F. The length of tours in zones of different shapes. Transportation Research Part B 18 (1984) 135-145
10. Davies B. Integral Transforms and their Applications. second ed. (1985), Springer-Verlag, New York
11. Diana M., and Dessouky M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B 38 (2004) 539-557
12. Gohberg I.C., and Feldman I.A. Convolution equations and projection method for their solution. Translations of Mathematical Monographs vol. 41 (1974), American Mathematical Society, Providence, Rhode Island
13. Hart S.M. The modeling and solution of a class of dial-a-ride problems using simulated annealing. Control and Cybernetics 25 (1996) 131-157
14. Hochstadt H. Integral Equations (1973), John Wiley & Sons
15. Horn M.E.T. Multi modal and demand responsive passenger transport systems: a modeling framework with embedded control systems. Transportation Research Part A 36 (2002) 167-188
16. Horn M.E.T. Scheduling and dispatching for demand responsive passenger services. Transportation Research Part C 10 (2002) 35-63
17. Hunsaker B., and Savelsbergh M. Efficient feasibility testing for dial-a-ride problems. Operations Research Letters 30 (2002) 169-173
18. Ioachim I., Desrosiers J., Dumas Y., Solomon M., and Villeneuve D. A request clustering algorithm for door-to-door handicapped 'transportation'. Transportation Science 29 (1995) 63-78
19. Lindley D.V. The theory of queues with a single server. Proceedings of Cambridge Philosophy Society 48 (1952) 277-289
20. Lu Q., and Dessouky M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 (2004) 503-514
21. Lu Q., and Dessouky M. New insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research 175 (2006) 672-687
22. Madsen O.B.G., Ravn H.F., and Rygaard J.M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60 (1995) 193-208
23. Malucelli, F., Nonato, M., Pallottino, S., 1999. Demand adaptive systems: some proposals on flexible transit. In: Ciriania, T., Johnson, E., Tadei, R. (Eds.), Operations Research in Industry, pp. 157-182.
24. Palmer K., Dessouky M.M., and Abdelmaguid T. Impacts of management practices and advanced technologies on demand responsive transit systems. Transportation Research Part A: Policy and Practice 38 (2004) 495-509
25. Quadrifoglio L., Dessouky M.M., and Hall R.W. Performance and design of mobility allowance shuttle transit (mast) services: bounds on the maximum longitudinal velocity. Transportation Science 40 (2006) 351-363
26. Quadrifoglio, L., Dessouky, M.M., Ordóñez, F., in press. Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints. European Journal of Operational Research, to appear.
27. Quadrifoglio L., Dessouky M.M., and Palmer K. An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services. Journal of Scheduling 10 (2007) 25-40
28. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 (1995) 17-29
29. Savelsbergh M.W.P., and Sol M. Drive: dynamic routing of independent vehicles. Operations Research 46 (1998) 474-490
30. Stein, D.M., 1977. Scheduling dial-a-ride transportation systems: an asymptotic approach. Harvard University, Division of Applied Science, Technical Report No. 670.
31. Stein D.M. Scheduling dial-a-ride transportation systems. Transportation Science 12 (1978) 232-249
32. Toth P., and Vigo D. Heuristic algorithm for the handicapped persons transportation problem. Transportation Science 31 (1997) 60-71
33. Wilson, N.H.M., Sussman J.M., Wong Ho-Kwan, Higonnet, T., 1971. Scheduling algorithms for a dial-a-ride system. M.I.T, Urban Systems Laboratory, Technical Report USL TR-70-13.
34. Wilson N.H.M., and Hendrickson C. Performance models of flexibly routed transportation services. Transportation Research Part B 14 (1980) 67-78
35. Zhao J., Dessouky M.M., and Bukkapatnam S. Optimal slack time for schedule-based transit operations. Transportation Science 40 (2006) 529-539