Skip to main content
SpringerLink
Log in

Sensitivity Analyses over the Service Area for Mobility Allowance Shuttle Transit (MAST) Services

  • Conference paper
Computer-aided Systems in Public Transport

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 600))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aldaihani, M. M. and Dessouky, M. (2003). Hybrid scheduling methods for paratransit operations. Computers & Industrial Engineering, 45, 75–96.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Bodin, L. and Sexton, T. (1986). The multi-vehicle subscriber dial-a-ride problem. TIMS Studies in the Management Sciences, 22, 73–86.

    Google Scholar 

  • Cordeau, J. F. and Laporte, G. (2003). The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR, 1(2), 89–101.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Daganzo, C. F. (1978). An approximate analytic model of many-to-many demand responsive transportation systems. Transportation Research, 12, 325–333.

    Article  Google Scholar 

  • Daganzo, C. F. (1984). Checkpoint dial-a-ride systems. Transportation Research, 18B, 315–327.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Horn, M. E. T. (2002a). Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research, 10C, 35–63.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lu, Q. and Dessouky, M. (2004). An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science, 38, 503–514.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Okrent, M. M. (1974). Effect of transit service characteristics on passenger waiting time, MS thesis. Department of Civil Engineering, Northwestern University, Evanston.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Psaraftis, H. N. (1986). Scheduling large-scale advance-request dial-a-ride systems. American Journal of Mathematical and Management Sciences, 6, 327–367.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Savelsbergh, M.W. P. and Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29, 17–29.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Stein, D. M. (1977). Scheduling dial-a-ride transportation systems: an asymptotic approach. Technical report, No. 670, Harvard University, Division of Applied Science.

    Google Scholar 

  • Stein, D. M. (1978a). An asymptotic probabilistic analysis of a routing problem. Mathematics of Operations Research, 3, 89–101.

    Google Scholar 

  • Stein, D. M. (1978b). Scheduling dial-a-ride transportation problems. Transportation Science, 12, 232–249.

    Google Scholar 

  • Toth, P. and Vigo, D. (1997). Heuristic algorithm for the handicapped persons transportation problem. Transportation Science, 31, 60–71.

    Google Scholar 

  • Wilson, N. H. M. and Hendrickson, C. (1980). Performance models of flexibly routed transportation services. Transportation Research, 14B, 67–78.

    Google Scholar 

  • 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.

    Google Scholar 

  • Zhao, J. and Dessouky, M. (2004). Optimal service capacity for a single bus mobility allowance shuttle transit (MAST) system. Submitted for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California, 90089-0193

    Luca Quadrifoglio & Maged M. Dessouky

Authors
  1. Luca Quadrifoglio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maged M. Dessouky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Civil Engineering and Engineering Mechanics, University of Arizona, 1209 E. Second Street, Tucson, AZ, 85721-0072, USA

    Mark Hickman

  2. Department of Systems and Industrial Engineering, University of Arizona, 1127 E. James E. Rogers Way, Tucson, AZ, 85721-0020, USA

    Pitu Mirchandani

  3. Institute of Information Systems, Department of Business and Economics, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation