Abstract
A Mobility Allowance Shuttle Transit (MAST) system is an innovative concept that merges the flexibility of Demand Responsive Transit (DRT) systems with the low cost operability of fixed-route bus systems. It allows vehicles to deviate from the fixed path so that customers within the service area may be picked up or dropped off at their desired locations. In this paper, we summarize the insertion heuristic presented by Quadrifoglio et al. (2007) for routing and scheduling MAST services, and we carry out a set of simulations to show a sensitivity analysis of the performance of the algorithm and the capacity of the system over different shapes of the service area. The results show that a slim service area performs better in general, but also that the positive effects of a proper setting of the control parameters of the heuristic is much more evident for wider service areas. In addition, a performance comparison shows that MAST systems can provide a better service to customers than fixed-route ones even for a slim service area.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aldaihani, M. M. and Dessouky, M. (2003). Hybrid scheduling methods for paratransit operations. Computers & Industrial Engineering, 45, 75–96.
Aldaihani, M. M., Quadrifoglio, L., Dessouky, M., and Hall, R. W. (2004). Network design for a grid hybrid transit service. Transportation Research, 38A, 511–530.
Bodin, L. and Sexton, T. (1986). The multi-vehicle subscriber dial-a-ride problem. TIMS Studies in the Management Sciences, 22, 73–86.
Cordeau, J. F. and Laporte, G. (2003). The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR, 1(2), 89–101.
Cortés, C. E. and Jayakrishnan, R. (2002). Design and operational concepts of a high coverage point-to-point transit system. Transportation Research Record 1783, pages 178–187.
Crainic, T. G., Malucelli, F., and Nonato, M. (2001). Flexible many-to-few + few-tomany = an almost personalized transit system. In TRISTAN IV, São Miguel Azores Islands, pages 435–440.
Daganzo, C. F. (1978). An approximate analytic model of many-to-many demand responsive transportation systems. Transportation Research, 12, 325–333.
Daganzo, C. F. (1984). Checkpoint dial-a-ride systems. Transportation Research, 18B, 315–327.
Desaulniers, G., Erdmann, A., Solomon, M. M., and Soumis, F. (2000). The VRP with pickup and delivery. Technical report, Cahiers du GERARD G-2000-25, Ecole des Hautes Etudes Commerciales, Montréal.
Desrosiers, J., Dumas, Y., and Soumis, F. (1986). A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6, 301–325.
Desrosiers, J., Dumas, Y., and Soumis, F. (1988). The multiple dial-a-ride problem. In Computer Aided Transit Scheduling, volume 308 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin.
Diana, M. (2006). The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services. Journal of Advanced Transportation, 40(1), 23–46.
Diana, M. and Dessouky, M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research, 38B, 539–557.
Hickman, M. and Blume, K. (2001). A method for scheduling integrated transit service. In S. Voss and J. Daduna, editors, Computer Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems 505, pages 233–251. Springer, Berlin.
Horn, M. E. T. (2002a). Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research, 10C, 35–63.
Horn, M. E. T. (2002b). Multi-modal and demand-responsive passenger transport systems: a modeling framework with embedded control systems. Transportation Research, 36A, 167–188.
Jaw, J. J., Odoni, A. R., Psaraftis, H. N., and Wilson, N. H. M. (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research, 20B(3), 243–257.
Liaw, C. F., White, C. C., and Bander, J. L. (1996). A decision support system for the bimodal dial-a-ride problem. IEEE Transactions on Systems, Man, and Cybernetics, 26(5), 552–565.
Lu, Q. and Dessouky, M. (2004). An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science, 38, 503–514.
Lu, Q. and Dessouky, M. (2006). New insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research, 175, 672–687.
Madsen, O. B. G., Raven, H. F., and Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research, 60, 193–208.
Malucelli, F., Nonato, M., and Pallottino, S. (1999). Demand adaptive systems: some proposals on flexible transit. In T. Ciriania, E. Johnson, and R. Tadei, editors, Operations Research in Industry, pages 157–182. McMillan, London.
Okrent, M. M. (1974). Effect of transit service characteristics on passenger waiting time, MS thesis. Department of Civil Engineering, Northwestern University, Evanston.
Psaraftis, H. N. (1980). A dynamic programming solution to the single vehicle manyto-many immediate request dial-a-ride problem. Transportation Science, 14, 130–154.
Psaraftis, H. N. (1983). An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science, 17, 351–357.
Psaraftis, H. N. (1986). Scheduling large-scale advance-request dial-a-ride systems. American Journal of Mathematical and Management Sciences, 6, 327–367.
Quadrifoglio, L., Hall, R. W., and Dessouky, M. M. (2006). Performance and design of mobility allowance shuttle transit services: Bounds on the maximum longitudinal velocity. Transportation Science, 40, 351–363.
Quadrifoglio, L., Dessouky, M. M., and Palmer, K. (2007). An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services. Journal of Scheduling, 10, 25–40.
Savelsbergh, M.W. P. and Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29, 17–29.
Sexton, T. R. and Bodin, L. D. (1985a). Optimizing single vehicle many-to-many operations with desired delivery times: 1. Scheduling. Transportation Science, 19, 378–410.
Sexton, T. R. and Bodin, L. D. (1985b). Optimizing single vehicle many-to-many operations with desired delivery times: 2. Routing. Transportation Science, 19, 411–435.
Sexton, T. R. and Choi, Y. (1986). Pickup and delivery of partial loads with soft time windows. American Journal of Mathematical and Management Sciences, 6, 369–398.
Stein, D. M. (1977). Scheduling dial-a-ride transportation systems: an asymptotic approach. Technical report, No. 670, Harvard University, Division of Applied Science.
Stein, D. M. (1978a). An asymptotic probabilistic analysis of a routing problem. Mathematics of Operations Research, 3, 89–101.
Stein, D. M. (1978b). Scheduling dial-a-ride transportation problems. Transportation Science, 12, 232–249.
Toth, P. and Vigo, D. (1997). Heuristic algorithm for the handicapped persons transportation problem. Transportation Science, 31, 60–71.
Wilson, N. H. M. and Hendrickson, C. (1980). Performance models of flexibly routed transportation services. Transportation Research, 14B, 67–78.
Wilson, N. H. M., Sussman, J. M., Wong, H. K., and Higgonet, B. T. (1971). Scheduling algorithms for a dial-a-ride system. Technical report, USL TR-70-13, M.I.T, Urban Systems Laboratory.
Zhao, J. and Dessouky, M. (2004). Optimal service capacity for a single bus mobility allowance shuttle transit (MAST) system. Submitted for publication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quadrifoglio, L., Dessouky, M.M. (2008). Sensitivity Analyses over the Service Area for Mobility Allowance Shuttle Transit (MAST) Services. In: Hickman, M., Mirchandani, P., Voß, S. (eds) Computer-aided Systems in Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73312-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-73312-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73311-9
Online ISBN: 978-3-540-73312-6
eBook Packages: EngineeringEngineering (R0)