IDEAS home Printed from https://ideas.repec.org/p/cdl/itsrrp/qt6nm587mj.html
   My bibliography  Save this paper

How to Evaluate and Minimize the Risk of COVID-19 Transmission within Public Transportation Systems

Author

Listed:
  • Huang, Yiduo MSc
  • Shen, Zuo-Jun PhD

Abstract

During the COVID-19 outbreak, serious concerns were raised over the risk of spreading the infection on public transportation systems. As the pandemic recedes it will be important to determine optimal timetable design to minimize the risk of new infections as systems resume full service. In this study, we developed an integrated optimization model for service line reopening plans and timetable design. Our model combines a space-time passenger network flow problem and compartmental epidemiological models for each vehicle and platform in the transit system. The algorithm can help policy makers to design schedules under COVID-19 more efficiently. The report develops an optimized timetable for the Bay Area Rapid Transit system. We found that if passengers choose other mode of transportation when closing part of the system or decreasing the frequency of service can prevent the spread of infections, otherwise, if passengers choose to use the closest open station, closings will lead to longer waiting times, higher passenger density and greater infection risk. We found that the goal of stopping the spread of infection could be achieved by minimizing the total delay when infections were similar in different districts across the service area. Where infection rates are different in different districts, minimizing the risk of exposure can be achieved by minimizing weighted travel time where higher weights are applied to areas where the infection rate is highest.

Suggested Citation

  • Huang, Yiduo MSc & Shen, Zuo-Jun PhD, 2022. "How to Evaluate and Minimize the Risk of COVID-19 Transmission within Public Transportation Systems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt6nm587mj, Institute of Transportation Studies, UC Berkeley.
  • Handle: RePEc:cdl:itsrrp:qt6nm587mj
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/6nm587mj.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    2. Fan, Wenbo & Mei, Yu & Gu, Weihua, 2018. "Optimal design of intersecting bimodal transit networks in a grid city," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 203-226.
    3. Liu, Kang & Yin, Ling & Ma, Zhanwu & Zhang, Fan & Zhao, Juanjuan, 2020. "Investigating physical encounters of individuals in urban metro systems with large-scale smart card data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    4. Yiduo Huang & Zuojun Max Shen, 2021. "Optimizing timetable and network reopen plans for public transportation networks during a COVID19-like pandemic," Papers 2109.03940, arXiv.org.
    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. Yiduo Huang & Zuojun Max Shen, 2021. "Optimizing timetable and network reopen plans for public transportation networks during a COVID19-like pandemic," Papers 2109.03940, arXiv.org.
    2. 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.
    3. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    4. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    5. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    6. Chen, Jingxu & Wang, Shuaian & Liu, Zhiyuan & Guo, Yanyong, 2018. "Network-based optimization modeling of manhole setting for pipeline transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 38-55.
    7. Fan, Wenbo & Gu, Weihua & Xu, Meng, 2024. "Optimal design of ride-pooling as on-demand feeder services," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
    8. Caicedo, Angélica & Estrada, Miquel & Medina-Tapia, Marcos & Mayorga, Miguel, 2023. "Optimizing bike network design: A cost-effective methodology for heterogeneous travel demands using continuous approximation techniques," Transportation Research Part A: Policy and Practice, Elsevier, vol. 176(C).
    9. Li, Wenjie & Yang, Lixing & Wang, Li & Zhou, Xuesong & Liu, Ronghui & Gao, Ziyou, 2017. "Eco-reliable path finding in time-variant and stochastic networks," Energy, Elsevier, vol. 121(C), pages 372-387.
    10. Binder, Stefan & Maknoon, Yousef & Bierlaire, Michel, 2017. "Exogenous priority rules for the capacitated passenger assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 19-42.
    11. Di, Zhen & Yang, Lixing & Qi, Jianguo & Gao, Ziyou, 2018. "Transportation network design for maximizing flow-based accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 209-238.
    12. Hugo Badia, 2020. "Comparison of Bus Network Structures in Face of Urban Dispersion for a Ring-Radial City," Networks and Spatial Economics, Springer, vol. 20(1), pages 233-271, March.
    13. Gang Cheng & Shuzhi Zhao & Tao Zhang, 2019. "A Bi-Level Programming Model for Optimal Bus Stop Spacing of a Bus Rapid Transit System," Mathematics, MDPI, vol. 7(7), pages 1-14, July.
    14. Shang, Pan & Li, Ruimin & Guo, Jifu & Xian, Kai & Zhou, Xuesong, 2019. "Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 135-167.
    15. Gao, Kun & Yang, Ying & Li, Aoyong & Li, Junhong & Yu, Bo, 2021. "Quantifying economic benefits from free-floating bike-sharing systems: A trip-level inference approach and city-scale analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 144(C), pages 89-103.
    16. Feng, Tao & Lusby, Richard M. & Zhang, Yongxiang & Peng, Qiyuan, 2024. "Integrating train service route design with passenger flow allocation for an urban rail transit line," European Journal of Operational Research, Elsevier, vol. 313(1), pages 146-170.
    17. Yuan Liu & Yamin Ding & Pei Jiang & Xugang Jin & Xinlin Wu & Zhanji Zheng, 2024. "Joint Optimal Design of Electric Bus Service and Charging Facilities," Sustainability, MDPI, vol. 16(14), pages 1-16, July.
    18. Junpeng Cai & Dewang Chen & Shixiong Jiang & Weijing Pan, 2020. "Dynamic-Area-Based Shortest-Path Algorithm for Intelligent Charging Guidance of Electric Vehicles," Sustainability, MDPI, vol. 12(18), pages 1-20, September.
    19. Yin, Jiateng & Yang, Lixing & Tang, Tao & Gao, Ziyou & Ran, Bin, 2017. "Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 182-213.
    20. Wei, Yuguang & Avcı, Cafer & Liu, Jiangtao & Belezamo, Baloka & Aydın, Nizamettin & Li, Pengfei(Taylor) & Zhou, Xuesong, 2017. "Dynamic programming-based multi-vehicle longitudinal trajectory optimization with simplified car following models," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 102-129.

    More about this item

    Keywords

    Engineering; COVID-19; public transit; risk management; transit vehicle operations; ridership; schedules and scheduling; travel demand; epidemiology; algorithms;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cdl:itsrrp:qt6nm587mj. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucbus.html .

    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.