Performance and design of mobility allowance shuttle transit services: Bounds on the maximum longitudinal velocity

Transportation Science

Volumn 40, Issue 3, 2006, Pages 351-363

  Quadrifoglio, Luca ^a   Hall, Randolph W ^a   Dessouky, Maged M ^a  

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

Author keywords

Continuous approximations; Performance; Public transportation; Transit service design

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; MACHINE DESIGN; PARAMETER ESTIMATION; PERFORMANCE; VEHICLES;

CONTINUOUS APPROXIMATIONS; PUBLIC TRANSPORTATION; TRANSIT SERVICE DESIGN;

BUS TRANSPORTATION;

EID: 33746629063     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1050.0137     Document Type: Article

References (47)

1. Aldaihani, M. M., M. M. Dessouky. 2003. Hybrid scheduling methods for paratransit operations. Comput. Indust. Engrg. 45 75-96.
2. Aldaihani, M. M., L. Quadrifoglio, M. M. Dessouky, R. W. Hall. 2004. Network design for a grid hybrid transit service. Transportation Res. Part A 38 511-530.
3. Beardwood, J., J. H. Halton, J. M. Hammersley. 1959. The shortest path through many points. Proc. Cambridge Philos. Soc. 55 299-327.
4. Bouwkamp, C. J. 1977. On the average distance between points in two coplanar non-overlapping circular disks. J. Appl. Sci. Engrg. A2 183-186.
5. Ceder, A., N. H. M. Wilson. 1986. Bus network design. Transportation Res. Part B 20 331-344.
6. Chang, S. K., P. M. Schonfeld. 1991a. Multiple period optimization of bus transit systems. Transportation Res. Part B. 25 453-478.
7. Chang, S. K., P. M. Schonfeld. 1991b. Optimization models for comparing conventional and subscription bus feeder services. Transportation Sci. 25 281-298.
8. Chien, S., P. M. Schonfeld. 1997. Optimizing of grid transit system in heterogeneous urban environment. J. Transportation Engrg. 123 28-35.
9. Christofides, N., S. Eilon. 1969. Expected distances in distribution problems. Oper. Res. Quart. 20 437-443.
10. Cortés, C. E., R. Jayakrishnan. 2002. Design and operational concepts of a high coverage point-to-point transit system. Transportation Res. Record 1783 178-187.
11. Crainic, T. G., F. Malucelli, M. Nonato. 2001. Flexible many-to-few+few-to-many = an almost personalized transit system. TRISTAN IV, São Miguel, Azores Islands, Portugal, 435-440.
12. Daganzo, C. F. 1978. An approximate analytic model of many-to-many demand responsive transportation systems. Transportation Res. 12 325-333.
13. Daganzo, C. F. 1980. Network representation, continuum approximations and a solution to the spatial aggregation problem of traffic assignment. Transportation Res. Part B 14 229-239.
14. Daganzo, C. F. 1984a. The length of tours in zones of different shapes. Transportation Res. Part B 18 135-145.
15. Daganzo, C. F. 1984b. The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application. Transportation Sci. 18 331-350.
16. Daganzo, C. F. 1984c. Checkpoint dial-a-ride systems. Transportation Res. Part B 18 315-327.
17. Daganzo, C. F. 1991. Logistic. Systems Analysis. Lecture Notes in Economics and Mathematical Systems, No. 361. Springer-Verlag, Heidelberg, Germany.
18. Dessouky, M. M., F. Ordóñez, L. Quadrifoglio. 2005. Productivity and cost-effectiveness of demand responsive transit systems. PATH/Caltrans Technical Report, Berkeley, CA.
19. Diana, M., M. M. Dessouky, N. Xia. 2006. A model for the fleet sizing of demand responsive transit services with time windows. Transportation Res. Part B Forthcoming.
20. Faithorne, D. 1965. Distances between pairs of points in towns of simple geometrical shapes. Proc. 2nd Internat. Sympos. Theory Traffic Flow, OECD, Paris, France, 391-406.
21. Ghosh, B. 1951. Random distances within a rectangle and between two rectangles. Bull. Calcutta Math. Soc. 43 17-24.
22. Hall, R. W. 1986. Discrete models/continuous models. Omega Internat. J. Management Sci. 14 213-220.
23. Horn, M. E. T. 2002a. Multi modal and demand responsive passenger transport systems: A modeling framework with embedded control systems. Transportation Res. Part A 36 167-188.
24. Horn, M. E. T. 2002b. Fleet scheduling and dispatching for demand responsive passenger services. Transportation Res. Part C 10 35-63.
25. Jacobson, J. 1980. Analytical models for comparison of alternative service options for the transportation handicapped. Transportation Res. Part A 14 113-118.
26. Jaillet, P. 1988. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36 929-936.
27. Koshizuka, T., O. Kurita. 1991. Approximate formulas of average distances associated with regions and their applications to location problems. Math. Programming 52 99-123.
28. Kuah, G. K., J. Perl. 1988. Optimization of feeder bus routes and bus-stop spacing. J. Transportation Engrg. 114 331-354.
29. Langevin, A., P. Mbaraga, J. F. Campbell. 1996. Continuous approximation models in freight distribution: An overview. Transportation Res. Part B 30 163-188.
30. LeBlanc, L. J. 1988. Transit system network design. Transportation Res. Part B 22 383-390.
31. Lesley, L. J. S. 1976a. Optimum bus-stop spacing: Part 1. Traffic Engrg. Control 17 399-401.
32. Lesley, L. J. S. 1976b. Optimum bus-stop spacing: Part 2. Traffic Engrg. Control 17 472-473.
33. Malucelli, F., M. Nonato, S. Pallottino. 1999. Demand adaptive systems: Some proposals on flexible transit. T. Ciriania, E. Johnson, R. Tadei, eds. Operations Research in Industry. 157-182.
34. Mandl, C. E. 1980. Evaluation and optimization of urban public transport networks. Eur. J. Oper. Res. 6 31-56.
35. Newell, G. F. 1979. Some issues relating to the optimal design of bus routes. Transportation Sci. 13 20-35.
36. Quadrifoglio, L., M. M. Dessouky, K. Palmer. 2006. An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services. J. Scheduling. Forthcoming.
37. Rhee, W. T. 1993. On the stochastic traveling salesperson problem for distributions with unbounded support. Math. Oper. Res. 18 252-259.
38. Ruben, H. 1978. On the distance between points in polygons. R. Miles, J. Serra, eds. Lecture Notes in Biomathematics, No. 23. Springer-Verlag, Berlin, Germany.
39. Schweitzer, P. A. 1968. Moments of distances of uniformly distributed points. Amer. Math. Monthly 75 802-804.
40. Stadje, W. 1995. Two asymptotic inequalities for the stochastic traveling salesman problem. Sankhya: Indian J. Statist. 57A1 33-40.
41. Stein, D. M. 1978. Scheduling dial-a-ride transportation problems. Transportation Sci. 12 232-249.
42. Stone, R. E. 1991. Some average distance results. Transportation Sci. 25 83-91.
43. Szplett, D. B. 1984. Approximate procedures for planning public transit systems: A review and some examples. J. Advanced Transportation 18 245-257.
44. Vaughan, R. J. 1984. Approximate formula for average distances associated with zones. Transportation Sci. 18 231-244.
45. Verblunsky, S. 1951. On the shortest path through a number of points. Proc. Amer. Math. Soc. 6 904-913.
46. Wirasinghe, S. C., N. S. A. Ghoneim. 1981. Spacing of bus-stops for many-to-many travel demand. Transportation Sci. 15 210-221.
47. Zhao, J., M. M. Dessouky. 2004. Optimal service capacity for a single-bus mobility allowance shuttle transit (MAST) system. Working paper.