IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v76y2015icp160-175.html
   My bibliography  Save this article

Demand-responsive transit circulator service network design

Author

Listed:
  • Yu, Yao
  • Machemehl, Randy B.
  • Xie, Chi

Abstract

Commuter rail systems are being introduced into many urban areas as an alternative mode to automobiles for commuting trips. It is anticipated that the shift from the auto mode to rail mode can greatly help alleviate traffic congestion in urban road networks. However, the right-of-way of many existing commuter rail systems is usually not ideally located. Since the locations of rail systems were typically chosen long ago to serve the needs of freight customers, the majority of current commuter rail passengers have to take a non-walkable connecting trip to reach their final destinations after departing the most conveniently located rail stations. To make rail a more viable commuting option and thus more competitive to the auto mode, a bus feeder or circulator system is proposed for transporting passengers from their departing rail stations to final work destinations in a seamless transfer manner. The key research question with operating such a bus circulator system is how to optimally determine a bus route and stopping sequence for each circulating tour by using the real-time demand information. In this paper, we name this joint routing and stopping optimization problem the circulator service network design problem, the objective of which is to minimize the total tour cost incurred to bus passengers and operators with respect to minimizing the walk time of each individual bus passenger. A bi-level nonlinear mixed integer programming model is constructed and a tabu search method with different local search strategies and neighborhood evaluation methods is then developed for tackling the circulator service network design problem.

Suggested Citation

  • Yu, Yao & Machemehl, Randy B. & Xie, Chi, 2015. "Demand-responsive transit circulator service network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 160-175.
  • Handle: RePEc:eee:transe:v:76:y:2015:i:c:p:160-175
    DOI: 10.1016/j.tre.2015.02.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554515000423
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2015.02.009?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. Lucio Martins, Carlos & Vaz Pato, Margarida, 1998. "Search strategies for the feeder bus network design problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 425-440, April.
    2. Bruni, M.E. & Guerriero, F. & Beraldi, P., 2014. "Designing robust routes for demand-responsive transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 1-16.
    3. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    4. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    5. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    6. 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.
    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. 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.
    9. 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.
    10. Ceder, Avishai & Wilson, Nigel H. M., 1986. "Bus network design," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 331-344, August.
    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. Amirgholy, Mahyar & Shahabi, Mehrdad & Gao, H. Oliver, 2017. "Optimal design of sustainable transit systems in congested urban networks: A macroscopic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 261-285.
    2. 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.
    3. Sharif Azadeh, Shadi & van der Zee, J. & Wagenvoort, M., 2022. "Choice-driven service network design for an integrated fixed line and demand responsive mobility system," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 557-574.
    4. Peiqing Li & Longlong Jiang & Shunfeng Zhang & Xi Jiang, 2022. "Demand Response Transit Scheduling Research Based on Urban and Rural Transportation Station Optimization," Sustainability, MDPI, vol. 14(20), pages 1-17, October.
    5. Yinfei Feng & Zhichao Cao & Silin Zhang, 2022. "Shuttle Bus Timetable Adjustment in Response to Behind-Schedule Commuter Railway Disturbance," Sustainability, MDPI, vol. 14(24), pages 1-24, December.
    6. (Edward) Kim, Myungseob & Levy, Joshua & Schonfeld, Paul, 2019. "Optimal zone sizes and headways for flexible-route bus services," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 67-81.
    7. Shang, Huayan & Chang, Yi & Huang, Haijun & Zhao, Fangxia, 2022. "Integration of conventional and customized bus services: An empirical study in Beijing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).

    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. 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.
    2. 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.
    3. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    4. Bo Sun & Ming Wei & Chunfeng Yang & Zhihuo Xu & Han Wang, 2018. "Personalised and Coordinated Demand-Responsive Feeder Transit Service Design: A Genetic Algorithms Approach," Future Internet, MDPI, vol. 10(7), pages 1-14, July.
    5. 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.
    6. 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.
    7. Bo Sun & Ming Wei & Senlai Zhu, 2018. "Optimal Design of Demand-Responsive Feeder Transit Services with Passengers’ Multiple Time Windows and Satisfaction," Future Internet, MDPI, vol. 10(3), pages 1-15, March.
    8. 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).
    9. Kai Gutenschwager & Christian Niklaus & Stefan Voß, 2004. "Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 434-446, November.
    10. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    11. 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.
    12. Kishore Bhoopalam, A. & Agatz, N.A.H. & Zuidwijk, R.A., 2017. "Planning of Truck Platoons: a Literature Review and Directions for Future Research," ERIM Report Series Research in Management ERS-2017-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.
    13. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    14. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    15. MELIS, Lissa & SÖRENSEN, Kenneth, 2021. "The real-time on-demand bus routing problem: What is the cost of dynamic requests?," Working Papers 2021003, University of Antwerp, Faculty of Business and Economics.
    16. Wang, David Z.W. & Nayan, Ashish & Szeto, W.Y., 2018. "Optimal bus service design with limited stop services in a travel corridor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 70-86.
    17. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    18. Zahra Navidi & Nicole Ronald & Stephan Winter, 2018. "Comparison between ad-hoc demand responsive and conventional transit: a simulation study," Public Transport, Springer, vol. 10(1), pages 147-167, May.
    19. 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.
    20. 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.

    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:transe:v:76:y:2015:i:c:p:160-175. 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/600244/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.