IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v42y2008i2p135-146.html
   My bibliography  Save this article

Service capacity design problems for mobility allowance shuttle transit systems

Author

Listed:
  • Zhao, Jiamin
  • Dessouky, Maged

Abstract

Transit agencies are currently seeking ways to improve service flexibility in a cost efficient manner. Mobility Allowance Shuttle Transit is a transportation concept that merges the flexibility of Demand Responsive Transit systems with the low cost operability of fixed-route bus systems. In this paper, we study the service capacity design problem for such a system. We analyze the relationship between service cycle time, and the length and width of the service area under a desired service level constraint. The analysis can be used as a guide for designing service area parameters. Given that a shuttle travels in a rectilinear pattern and utilizes a non-backtracking nearest-insertion algorithm, we derive closed-form approximate solutions for the service capacity design problem. We show that setting the length of the service area to half the travel speed of the shuttle multiplied by the cycle time is an effective approximation.

Suggested Citation

  • Zhao, Jiamin & Dessouky, Maged, 2008. "Service capacity design problems for mobility allowance shuttle transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 135-146, February.
    • Handle: RePEc:eee:transb:v:42:y:2008:i:2:p:135-146
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(07)00073-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    2. Daganzo, Carlos F., 1984. "Checkpoint dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 315-327.
    3. Wilson, Nigel H. M. & Hendrickson, Chris, 1980. "Performance models of flexibly routed transportation services," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 67-78.
    4. Ann Melissa Campbell & Martin Savelsbergh, 2004. "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 38(3), pages 369-378, August.
    5. Irina Ioachim & Jacques Desrosiers & Yvan Dumas & Marius M. Solomon & Daniel Villeneuve, 1995. "A Request Clustering Algorithm for Door-to-Door Handicapped Transportation," Transportation Science, INFORMS, vol. 29(1), pages 63-78, February.
    6. Quan Lu & Maged Dessouky, 2004. "An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 503-514, November.
    7. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    8. Jiamin Zhao & Maged Dessouky & Satish Bukkapatnam, 2006. "Optimal Slack Time for Schedule-Based Transit Operations," Transportation Science, INFORMS, vol. 40(4), pages 529-539, November.
    9. David M. Stein, 1978. "Scheduling Dial-a-Ride Transportation Systems," Transportation Science, INFORMS, vol. 12(3), pages 232-249, August.
    10. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    11. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    12. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    13. Palmer, Kurt & Dessouky, Maged & Abdelmaguid, Tamer, 2004. "Impacts of management practices and advanced technologies on demand responsive transit systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 495-509, August.
    14. Aldaihani, Majid M. & Quadrifoglio, Luca & Dessouky, Maged M. & Hall, Randolph, 2004. "Network design for a grid hybrid transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 511-530, August.
    15. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    16. Horn, M. E. T., 2002. "Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 167-188, February.
    17. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agatz, N.A.H. & Erera, A. & Savelsbergh, M.W.P. & Wang, X., 2010. "Sustainable Passenger Transportation: Dynamic Ride-Sharing," ERIM Report Series Research in Management ERS-2010-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. José I. Castillo-Manzano & Antonio Sánchez-Braza, 2011. "An Evaluation of the Establishment of a Taxi Flat Rate from City to Airport: The Case of Seville," Urban Studies, Urban Studies Journal Limited, vol. 48(9), pages 1909-1924, July.
    3. Liu, Xiaohan & Qu, Xiaobo & Ma, Xiaolei, 2021. "Improving flex-route transit services with modular autonomous vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    4. Rick Grahn & Sean Qian & Chris Hendrickson, 2023. "Optimizing first- and last-mile public transit services leveraging transportation network companies (TNC)," Transportation, Springer, vol. 50(5), pages 2049-2076, October.
    5. Sangveraphunsiri, Tawit & Cassidy, Michael J. & Daganzo, Carlos F., 2022. "Jitney-lite: a flexible-route feeder service for developing countries," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 1-13.
    6. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    7. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    8. Lownes, Nicholas E. & Machemehl, Randy B., 2010. "Exact and heuristic methods for public transit circulator design," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 309-318, February.
    9. Ellegood, William A. & Campbell, James F. & North, Jeremy, 2015. "Continuous approximation models for mixed load school bus routing," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 182-198.
    10. Teng Teng & Shengliang Zhang & Xiaodong Li & Yuan Chen, 2020. "Customer compliance with employee fuzzy requests in service encounters: a self-determination theory perspective," Service Business, Springer;Pan-Pacific Business Association, vol. 14(2), pages 217-240, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    2. Quadrifoglio, Luca & Dessouky, Maged M. & Ordóñez, Fernando, 2008. "A simulation study of demand responsive transit system design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(4), pages 718-737, May.
    3. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    4. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    5. Dessouky, Maged M. & Ordóñez, Fernando & Quadrifoglio, Luca, 2005. "Productivity and Cost-Effectiveness of Demand Responsive Transit Systems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qj1d5s0, Institute of Transportation Studies, UC Berkeley.
    6. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
    7. Quadrifoglio, Luca & Li, Xiugang, 2009. "A methodology to derive the critical demand density for designing and operating feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 922-935, December.
    8. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    9. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    10. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    11. Chen, Peng Will & Nie, Yu Marco, 2017. "Analysis of an idealized system of demand adaptive paired-line hybrid transit," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 38-54.
    12. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    13. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    14. Chandra, Shailesh & Quadrifoglio, Luca, 2013. "A model for estimating the optimal cycle length of demand responsive feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 1-16.
    15. Qiu, Feng & Shen, Jinxing & Zhang, Xuechi & An, Chengchuan, 2015. "Demi-flexible operating policies to promote the performance of public transit in low-demand areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 215-230.
    16. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    17. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    18. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    19. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    20. Luo, Sida & Nie, Yu (Marco), 2019. "Impact of ride-pooling on the nature of transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 175-192.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:42:y:2008:i:2:p:135-146. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.