A model for the fleet sizing of demand responsive transportation services with time windows

Transportation Research Part B: Methodological

Volumn 40, Issue 8, 2006, Pages 651-666

  Diana, Marco ^a   Dessouky, Maged M ^b   Xia, Nan ^c  

^a POLITECNICO DI TORINO   (Italy)

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

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Continuous approximation models; Demand responsive transit systems; Paratransit services; Probabilistic models; Public transportation

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBABILITY;

CONTINOUS APPROXIMATION MODELS; DEMAND RESPONSIVE TRANSIT SYSTEMS; PARATRANSIT SERVICES; PROBABILISTIC MODELS; PUBLIC TRANSPORTATION; TIME WINDOWS;

FLEET OPERATIONS;

NUMERICAL MODEL; PROBABILITY; PUBLIC TRANSPORT; TRANSPORTATION SYSTEM;

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

References (40)

1. Adebisi, O., Hurdle, V.F., 1982. Comparing fixed-route and flexible-route strategies for intraurban bus transit. Transportation Research Record 854, Transportation Research Board, National Research Council, Washington, DC, pp. 37-43.
2. Aldaihani M.M., Quadrifoglio L., Dessouky M., and Hall R.W. Network design for a grid hybrid transit service. Transportation Research Part A 38 7 (2004) 511-530
3. Arrillaga B., and Medville D.M. Demand, supply and cost modelling framework for demand-responsive transportation systems. Transportation Research Board Special Report 147 (1974) 32-47
4. Batchelder, J.H., Kullman, B.C., 1977. Analysis of integrated urban public transportation systems. Transportation Research Record 639, Transportation Research Board, National Research Council, Washington, DC, pp. 25-29.
5. Beardwood J., Halton J.H., and Hammersley J.M. The shortest path through many points. Proceedings of the Cambridge Philosophical Society 55 4 (1959) 299-327
6. Chang, S.K.J., Lee, C.J., 1993. Welfare comparison of fixed- and flexible-route bus systems. Transportation Research Record 1390, Transportation Research Board, National Research Council, Washington, DC, pp. 16-22.
7. Chang S.K., and Schonfeld P.M. Optimization models for comparing conventional and subscription bus feeder services. Transportation Science 25 4 (1991) 281-298
8. Christofides N., and Eilon S. Expected distances in distribution problems. Operational Research Quarterly 20 4 (1969) 437-443
9. Daganzo C.F. An approximate analytic model of many-to-many demand responsive transportation systems. Transportation Research 12 5 (1978) 325-333
10. Daganzo C.F. The length of tours in zones of different shapes. Transportation Research Part B 18 2 (1984) 135-145
11. Daganzo C.F. Checkpoint dial-a-ride systems. Transportation Research Part B 18 4/5 (1984) 318-327
12. Daganzo C.F. The distance traveled to visit N points with a maximum of C stops per vehicle: an analytic model and an application. Transportation Science 18 4 (1984) 331-350
13. Daganzo C.F. Modeling distribution problems with time windows: Part I. Transportation Science 21 3 (1987) 171-179
14. Daganzo C.F. Logistic systems analysis. Lecture Notes in Economics and Mathematical Systems vol. 361 (1991), Springer-Verlag, Heidelberg
15. Daganzo, C.F., Hendrickson, C.T., Wilson, N.H.M., 1977. An approximate analytic model of many-to-one demand responsive transportation systems. In: Sasaki, T., Yamaoka, T. (Eds.), Proceedings of the 7th International Symposium on Transportation and Traffic Theory, Kyoto, pp. 743-772.
16. Del Castillo J.M. A heuristic for the traveling salesman problem based on a continuous approximation. Transportation Research Part B 33 2 (1999) 123-152
17. Desaulniers G., Desrosiers J., Erdmann A., Solomon M.M., and Soumis F. The VRP with pickup and delivery. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications vol. 9 (2001), SIAM, Society for Industrial and Applied Mathematics, Philadelphia 225-242
18. Diana M., and Dessouky M.M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B 38 6 (2004) 539-557
19. Donnelly K.P. Simulations to determine the variance and edge effect of total nearest-neighbour distance. In: Hodder I. (Ed). Simulation Studies in Archaeology (1978), Cambridge University Press, Cambridge 91-95
20. Eilon S., Watson-Gandy C., and Christofides N. Expected distances in distribution problems. Distribution Management: Mathematical Modelling and Practical Analysis (1971), Griffin, London pp. 151-179
21. Flusberg, M., Wilson, N.H.M. 1976. A descriptive supply model for demand responsive transportation system planning. In: Proceedings of the 17th Annual Meeting of the Transportation Research Forum, pp. 425-431.
22. Hall R.W. Pickup and delivery systems for overnight carriers. Transportation Research Part A 30 3 (1996) 173-187
23. Jaw J.J., Odoni A.R., Psaraftis H.N., and Wilson N.H.M. A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem. Transportation Research Part B 20 3 (1986) 243-257
24. Langevin A., Mbaraga P., and Campbell J.F. Continuous approximation models in freight distribution: an overview. Transportation Research Part B 30 3 (1996) 163-188
25. Langevin A., and Soumis F. Design of multiple-vehicle delivery tours satisfying time constraints. Transportation Research Part B 23 2 (1989) 123-138
26. Larson R.C., and Odoni A.R. Urban Operations Research (1981), Prentice-Hall, Englewood Cliffs
27. Lave, R.E., Teal, R., Piras, P., 1996. A handbook for acquiring demand-responsive transit software. Transit Cooperative Research Program Report #18, Transportation Research Board, Washington, DC.
28. Lerman S.R., and Wilson N.H.M. Analytic model for predicting dial-a-ride system performance. Transportation Research Board Special Report 147 (1974) 48-53
29. Mathai A.M. The nearest neighbor problem on a plane from Poisson arrivals of random points. An Introduction to Geometrical Probability (1999), Gordon and Breach, Amsterdam pp. 223-228
30. Newell G.F., and Daganzo C.F. Design of multiple-vehicle delivery tours-I. A ring radial network. Transportation Research Part B 20 5 (1986) 345-363
31. Palmer K., Dessouky M.M., and Abdelmaguid T. Impacts of management practices and advanced technologies on demand responsive transit systems. Transportation Research Part A 38 7 (2004) 495-509
32. Quadrifoglio, L., Dessouky, M.M., Ordóñez, F., submitted for publication. A simulation study of demand responsive transit system design.
33. Quadrifoglio, L., Hall, R.W., Dessouky, M.M., to appear. Design of mobility allowance shuttle transit (MAST) services: bounds on the maximum longitudinal velocity. Transportation Science.
34. Robusté F., Daganzo C.F., and Souleyrette R.R. Implementing vehicle routing models. Transportation Research Part B 24 4 (1990) 263-286
35. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 1 (1995) 17-29
36. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research 35 2 (1987) 254-265
37. Stein D.M. Scheduling dial-a-ride transportation problems. Transportation Science 12 3 (1978) 232-249
38. Stein D.M. An asymptotic probabilistic analysis of a routing problem. Mathematics of Operations Research 3 2 (1978) 89-101
39. Ward, D.E., 1975. Theoretical comparison of fixed route bus and flexible route subscription bus service in low density areas. Transportation Systems Center, USDOT.
40. Wilson N.H.M., and Hendrickson C. Performance models of flexibly routed transportation services. Transportation Research Part B 14 1/2 (1980) 67-78