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

A sequential transit network design algorithm with optimal learning under correlated beliefs

Author

Listed:
  • Yoon, Gyugeun
  • Chow, Joseph Y.J.

Abstract

Mobility service route design requires demand information to operate in a service region. Transit planners and operators can access various data sources including household travel survey data and mobile device location logs. However, when implementing a mobility system with emerging technologies, estimating demand becomes harder because of limited data resulting in uncertainty. This study proposes an artificial intelligence-driven algorithm that combines sequential transit network design with optimal learning to address the operation under limited data. An operator gradually expands its route system to avoid risks from inconsistency between designed routes and actual travel demand. At the same time, observed information is archived to update the knowledge that the operator currently uses. Three learning policies are compared within the algorithm: multi-armed bandit, knowledge gradient, and knowledge gradient with correlated beliefs. For validation, a new route system is designed on an artificial network based on public use microdata areas in New York City. Prior knowledge is reproduced from the regional household travel survey data. The results suggest that exploration considering correlations can achieve better performance compared to greedy choices and other independent belief-based techniques in general. In future work, the problem may incorporate more complexities such as demand elasticity to travel time, no limitations to the number of transfers, and costs for expansion.

Suggested Citation

  • Yoon, Gyugeun & Chow, Joseph Y.J., 2024. "A sequential transit network design algorithm with optimal learning under correlated beliefs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 191(C).
    • Handle: RePEc:eee:transe:v:191:y:2024:i:c:s1366554524002989
    DOI: 10.1016/j.tre.2024.103707
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524002989
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103707?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. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    3. Basso, Rafael & Kulcsár, Balázs & Sanchez-Diaz, Ivan & Qu, Xiaobo, 2022. "Dynamic stochastic electric vehicle routing with safe reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    4. Wei Fan & Randy B. Machemehl, 2008. "A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem," Lecture Notes in Economics and Mathematical Systems, in: Mark Hickman & Pitu Mirchandani & Stefan Voß (ed.), Computer-aided Systems in Public Transport, pages 387-408, Springer.
    5. Zhang, Lin & Xu, Min & Wang, Shuaian, 2023. "Quantifying bus route service disruptions under interdependent cascading failures of a multimodal public transit system based on an improved coupled map lattice model," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    6. Li, Zhi-Chun & Guo, Qian-Wen & Lam, William H.K. & Wong, S.C., 2015. "Transit technology investment and selection under urban population volatility: A real option perspective," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 318-340.
    7. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    8. Ma, Tai-Yu & Rasulkhani, Saeid & Chow, Joseph Y.J. & Klein, Sylvain, 2019. "A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 417-442.
    9. Ralf Borndörfer & Martin Grötschel & Marc E. Pfetsch, 2007. "A Column-Generation Approach to Line Planning in Public Transport," Transportation Science, INFORMS, vol. 41(1), pages 123-132, February.
    10. Baxter, Matthew & Elgindy, Tarek & Ernst, Andreas T. & Kalinowski, Thomas & Savelsbergh, Martin W.P., 2014. "Incremental network design with shortest paths," European Journal of Operational Research, Elsevier, vol. 238(3), pages 675-684.
    11. Schmid, Verena, 2014. "Hybrid large neighborhood search for the bus rapid transit route design problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 427-437.
    12. An, Kun & Lo, Hong K., 2015. "Robust transit network design with stochastic demand considering development density," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 737-754.
    13. Haiyang Fang & Dali Jiang & Tinghong Yang & Ling Fang & Jian Yang & Wu Li & Jing Zhao, 2018. "Network evolution model for supply chain with manufactures as the core," PLOS ONE, Public Library of Science, vol. 13(1), pages 1-28, January.
    14. Yang, Shuang & Wu, Jianjun & Sun, Huijun & Qu, Yunchao, 2023. "Trip planning for a mobility-as-a-service system: Integrating metros and shared autonomous vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    15. John Current & Hasan Pirkul & Erik Rolland, 1994. "Efficient Algorithms for Solving the Shortest Covering Path Problem," Transportation Science, INFORMS, vol. 28(4), pages 317-327, November.
    16. Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
    17. Sunhyung Yoo & Jinwoo Brian Lee & Hoon Han, 2023. "A Reinforcement Learning approach for bus network design and frequency setting optimisation," Public Transport, Springer, vol. 15(2), pages 503-534, June.
    18. Zheng, Hankun & Sun, Huijun & Kang, Liujiang & Dai, Peiling & Wu, Jianjun, 2023. "Multi-route coordination for bus systems in response to road disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    19. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    20. Bunch, David S. & Bradley, Mark & Golob, Thomas F. & Kitamura, Ryuichi & Occhiuzzo, Gareth P., 1993. "Demand for clean-fuel vehicles in California: A discrete-choice stated preference pilot project," Transportation Research Part A: Policy and Practice, Elsevier, vol. 27(3), pages 237-253, May.
    21. Jose L. Walteros & Andrés L. Medaglia & Germán Riaño, 2015. "Hybrid Algorithm for Route Design on Bus Rapid Transit Systems," Transportation Science, INFORMS, vol. 49(1), pages 66-84, February.
    22. Verity Watson & Stéphane Luchini & Dean Regier & Rainer Schulz, 2020. "Monetary analysis of health outcomes," Post-Print hal-03586395, HAL.
    23. Joseph Y. J. Chow & Hamid R. Sayarshad, 2016. "Reference Policies for Non-myopic Sequential Network Design and Timing Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1183-1209, December.
    24. Chow, Joseph Y.J. & Regan, Amelia C., 2011. "Network-based real option models," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 682-695, May.
    25. Ilya O. Ryzhov & Martijn R. K. Mes & Warren B. Powell & Gerald van den Berg, 2019. "Bayesian Exploration for Approximate Dynamic Programming," Operations Research, INFORMS, vol. 67(1), pages 198-214, January.
    26. Wei Yu & Jun Chen & Xingchen Yan, 2019. "Space?Time Evolution Analysis of the Nanjing Metro Network Based on a Complex Network," Sustainability, MDPI, vol. 11(2), pages 1-17, January.
    27. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    28. Ilya O. Ryzhov & Warren B. Powell & Peter I. Frazier, 2012. "The Knowledge Gradient Algorithm for a General Class of Online Learning Problems," Operations Research, INFORMS, vol. 60(1), pages 180-195, February.
    29. Yixiao Huang & Lei Zhao & Warren B. Powell & Yue Tong & Ilya O. Ryzhov, 2019. "Optimal Learning for Urban Delivery Fleet Allocation," Transportation Science, INFORMS, vol. 53(3), pages 623-641, May.
    Full references (including those not matched with items on IDEAS)

    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. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2021. "Service operation design in a transit network with congested common lines," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 81-102.
    2. Pu, Song & Zhan, Shuguang, 2021. "Two-stage robust railway line-planning approach with passenger demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    3. Javier Durán-Micco & Pieter Vansteenwegen, 2022. "A survey on the transit network design and frequency setting problem," Public Transport, Springer, vol. 14(1), pages 155-190, March.
    4. Zheng, Hankun & Sun, Huijun & Wu, Jianjun & Kang, Liujiang, 2024. "Alternative service network design for bus systems responding to time-varying road disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 188(C).
    5. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    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. 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.
    8. Abdulkerim Benli & İbrahim Akgün, 2023. "A Multi-Objective Mathematical Programming Model for Transit Network Design and Frequency Setting Problem," Mathematics, MDPI, vol. 11(21), pages 1-23, October.
    9. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    10. Mahmoud Owais & Abdou S. Ahmed & Ghada S. Moussa & Ahmed A. Khalil, 2020. "An Optimal Metro Design for Transit Networks in Existing Square Cities Based on Non-Demand Criterion," Sustainability, MDPI, vol. 12(22), pages 1-28, November.
    11. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    12. Wang, Xiaohan & Chen, Xiqun (Michael) & Xie, Chi & Cheong, Taesu, 2024. "Coordinative dispatching of shared and public transportation under passenger flow outburst," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    13. Guo, Qian-Wen & Chen, Shumin & Schonfeld, Paul & Li, Zhongfei, 2018. "How time-inconsistent preferences affect investment timing for rail transit," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 172-192.
    14. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    15. Andreas Bärmann & Alexander Martin & Hanno Schülldorf, 2017. "A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany," Transportation Science, INFORMS, vol. 51(4), pages 1102-1121, November.
    16. Ni, Ni & Howell, Brendan J. & Sharkey, Thomas C., 2018. "Modeling the impact of unmet demand in supply chain resiliency planning," Omega, Elsevier, vol. 81(C), pages 1-16.
    17. Dezhi Zhang & Jiehui Jiang & Shuangyan Li & Xiamiao Li & Qingwen Zhan, 2017. "Optimal Investment Timing and Size of a Logistics Park: A Real Options Perspective," Complexity, Hindawi, vol. 2017, pages 1-12, December.
    18. Li, Lu & Lo, Hong K. & Huang, Wei & Xiao, Feng, 2021. "Mixed bus fleet location-routing-scheduling under range uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 155-179.
    19. 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.
    20. Chen, Yao & An, Kun, 2021. "Integrated optimization of bus bridging routes and timetables for rail disruptions," European Journal of Operational Research, Elsevier, vol. 295(2), pages 484-498.

    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:191:y:2024:i:c:s1366554524002989. 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.