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

A model for estimating the optimal cycle length of demand responsive feeder transit services

Author

Listed:
  • Chandra, Shailesh
  • Quadrifoglio, Luca

Abstract

The general lack of first/last mile connectivity is one of the main challenges faced by today’s public transit. One of the possible actions towards a solution to this problem is the planning, design and implementation of efficient feeder transit services. This paper develops an analytical model which allows for an easy computation of near optimal terminal-to-terminal cycle length of a demand responsive feeder service to maximize service quality provided to customers, defined as the inverse of a weighted sum of waiting and riding times. The model estimates the recommended cycle length by only plugging in geometrical parameters and demand data, without relying on extensive simulation analyses or rule of thumbs. Simulation experiments and comparisons with real services validate our model, which would allow planners, decision makers and practitioners to quickly identify the best feeder transit operating design of any given residential area.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:51:y:2013:i:c:p:1-16
    DOI: 10.1016/j.trb.2013.01.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261513000192
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2013.01.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.
    2. Shailesh Chandra & Chung-Wei Shen & Luca Quadrifoglio, 2011. "A Simulation Study to Derive the Optimal Cycle Length for Feeder Transit Services," International Journal of Information Systems in the Service Sector (IJISSS), IGI Global, vol. 3(3), pages 27-46, July.
    3. Ahouissoussi, Nicolas B. C. & Wetzstein, Michael E., 1998. "A comparative cost analysis of biodiesel, compressed natural gas, methanol, and diesel for transit bus systems," Resource and Energy Economics, Elsevier, vol. 20(1), pages 1-15, March.
    4. Patrick Jaillet, 1988. "A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited," Operations Research, INFORMS, vol. 36(6), pages 929-936, December.
    5. 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.
    6. Gérard C. Clarens & V. F. Hurdle, 1975. "An Operating Strategy for a Commuter Bus System," Transportation Science, INFORMS, vol. 9(1), pages 1-20, February.
    7. Wardman, Mark, 2004. "Public transport values of time," Transport Policy, Elsevier, vol. 11(4), pages 363-377, October.
    8. 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.
    9. 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.
    10. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    11. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    12. 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.
    13. Badami, Madhav G. & Haider, Murtaza, 2007. "An analysis of public bus transit performance in Indian cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(10), pages 961-981, December.
    14. 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.
    15. Jaw, Jang-Jei & Odoni, Amedeo R. & Psaraftis, Harilaos N. & Wilson, Nigel H. M., 1986. "A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 243-257, June.
    16. Edward Ignall & Peter Kolesar, 1974. "Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal," Operations Research, INFORMS, vol. 22(5), pages 1008-1024, October.
    17. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    18. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    19. John M. Gleason & Darold T. Barnum, 1982. "Toward Valid Measures of Public Sector Productivity: Performance Measures in Urban Transit," Management Science, INFORMS, vol. 28(4), pages 379-386, April.
    20. 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.
    21. Cayford, Randall & Yim, Y. B. Youngbin, 2004. "Personalized Demand-Responsive Transit Service," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt29j111ts, Institute of Transportation Studies, UC Berkeley.
    22. 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.
    23. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    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. Alan Lee & Martin Savelsbergh, 2017. "An extended demand responsive connector," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 25-50, March.
    2. Sohani Liyanage & Hussein Dia & Gordon Duncan & Rusul Abduljabbar, 2024. "Evaluation of the Impacts of On-Demand Bus Services Using Traffic Simulation," Sustainability, MDPI, vol. 16(19), pages 1-37, September.
    3. Li, Xin & Wang, Tianqi & Xu, Weihan & Li, Huaiyue & Yuan, Yun, 2022. "A novel model and algorithm for designing an eco-oriented demand responsive transit (DRT) system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    4. Jin Zhang & Wenquan Li & Guoqing Wang & Jingcai Yu, 2021. "Feasibility Study of Transferring Shared Bicycle Users with Commuting Demand to Flex-Route Transit—A Case Study of Nanjing City, China," Sustainability, MDPI, vol. 13(11), pages 1-21, May.
    5. Rich, Jeppe & Seshadri, Ravi & Jomeh, Ali Jamal & Clausen, Sofus Rasmus, 2023. "Fixed routing or demand-responsive? Agent-based modelling of autonomous first and last mile services in light-rail systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    6. Xianglong Sun & Sai Liu, 2022. "Research on Route Deviation Transit Operation Scheduling—A Case Study in Suburb No. 5 Road of Harbin," Sustainability, MDPI, vol. 14(2), pages 1-16, January.
    7. Badia, Hugo & Jenelius, Erik, 2021. "Design and operation of feeder systems in the era of automated and electric buses," Transportation Research Part A: Policy and Practice, Elsevier, vol. 152(C), pages 146-172.
    8. 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.
    9. Kim, Myungseob (Edward) & Schonfeld, Paul, 2015. "Maximizing net benefits for conventional and flexible bus services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 116-133.
    10. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.
    11. 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.
    12. Kim, Myungseob (Edward) & Schonfeld, Paul, 2014. "Integration of conventional and flexible bus services with timed transfers," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 76-97.
    13. Myungseob (Edward) Kim & Eungcheol Kim, 2023. "Joint Optimization of Distance-Based Fares and Headway for Fixed-Route Bus Operations," Sustainability, MDPI, vol. 15(21), pages 1-14, October.
    14. Chandra, Shailesh & Vadali, Sharada, 2014. "Evaluating accessibility impacts of the proposed America 2050 high-speed rail corridor for the Appalachian Region," Journal of Transport Geography, Elsevier, vol. 37(C), pages 28-46.
    15. Chandra, Shailesh & Bari, Muhammad Ehsanul & Devarasetty, Prem Chand & Vadali, Sharada, 2013. "Accessibility evaluations of feeder transit services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 52(C), pages 47-63.
    16. Anastasios Charisis & Christina Iliopoulou & Konstantinos Kepaptsoglou, 2018. "DRT route design for the first/last mile problem: model and application to Athens, Greece," Public Transport, Springer, vol. 10(3), pages 499-527, December.
    17. 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.
    18. Nicole Ronald & Russell Thompson & Stephan Winter, 2015. "Simulating Demand-responsive Transportation: A Review of Agent-based Approaches," Transport Reviews, Taylor & Francis Journals, vol. 35(4), pages 404-421, July.
    19. Shixiong Jiang & Wei Guan & Liu Yang & Wenyi Zhang, 2020. "Feeder Bus Accessibility Modeling and Evaluation," Sustainability, MDPI, vol. 12(21), pages 1-17, October.
    20. Xin Li & Wanying Liu & Jingyuan Qiao & Yanhao Li & Jia Hu, 2023. "An Enhanced Semi-Flexible Transit Service with Introducing Meeting Points," Networks and Spatial Economics, Springer, vol. 23(3), pages 487-527, September.
    21. Di Huang & Weiping Tong & Lumeng Wang & Xun Yang, 2019. "An Analytical Model for the Many-to-One Demand Responsive Transit Systems," Sustainability, MDPI, vol. 12(1), pages 1-17, December.
    22. Ansari Esfeh, Mohammad & Saidi, Saeid & Wirasinghe, S.C. & Kattan, Lina, 2022. "Waiting time and headway modeling considering unreliability in transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 155(C), pages 219-233.
    23. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    24. Itani, Alaa & Klumpenhouwer, Willem & Shalaby, Amer & Hemily, Brendon, 2024. "Guiding principles for integrating on-demand transit into conventional transit networks: A review of literature and practice," Transport Policy, Elsevier, vol. 147(C), pages 183-197.
    25. G. Dikas & I. Minis, 2018. "Scheduled Paratransit Transport Enhanced by Accessible Taxis," Transportation Science, INFORMS, vol. 52(5), pages 1122-1140, October.

    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. 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.
    2. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    3. 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.
    4. 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.
    5. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    6. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
    7. 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.
    8. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    9. 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.
    10. Rui Yao & Shlomo Bekhor, 2021. "A Dynamic Tree Algorithm for Peer-to-Peer Ridesharing Matching," Networks and Spatial Economics, Springer, vol. 21(4), pages 801-837, December.
    11. Kirchler, Dominik & Wolfler Calvo, Roberto, 2013. "A Granular Tabu Search algorithm for the Dial-a-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 120-135.
    12. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    13. 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.
    14. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.
    15. 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.
    16. 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.
    17. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    18. 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.
    19. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
    20. 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.

    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:51:y:2013:i:c:p:1-16. 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.