Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity

References

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