IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i18p8020-d1477616.html
   My bibliography  Save this article

Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator

Author

Listed:
  • Qiang Tu

    (College of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

  • Han He

    (Shenzhen General Integrated Transportation and Municipal Engineering Design & Research Institute Co., Ltd., Shenzhen 518033, China)

  • Xiaomin Lai

    (Shenzhen General Integrated Transportation and Municipal Engineering Design & Research Institute Co., Ltd., Shenzhen 518033, China)

  • Chuan Jiang

    (Chongqing Urban Investment Gold Card Information Industry (Group) Co., Ltd., Chongqing 401336, China)

  • Zhanji Zheng

    (College of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

Abstract

The primary traffic-based indicators for identifying critical links account for travel time, transportation efficiency, and traffic demand. These indicators are seldom applied to scenarios in which link capacity degradation occurs across the entire network. In addition, the commonly used traffic demand-based indicator, known as unsatisfied demand, can only work when there are disconnected origin–destination (OD) pairs in the network. In this context, this study incorporates the concept of a degradable road network to represent such scenarios and introduces a new network-wide traffic demand-based indicator, defined as late arrival demand (LAD), to identify critical links. Specifically, we built a late arrival rate (LAR)-based user equilibrium (UE) model to capture travel behavior and estimate the LAD in degradable road networks. Then, LAD and four other indicators were introduced to identify critical links in the framework of the LAR-based UE model. Finally, the Nguyen–Dupuis and Sioux Falls networks were employed for numerical experiments. The results, under various levels of traffic demand and degradation, demonstrate that LAD is a flexible and effective network-wide traffic demand-based indicator. This new approach provides insights that can help managers assess link criticality in degradable road networks from the perspective of traffic demand.

Suggested Citation

  • Qiang Tu & Han He & Xiaomin Lai & Chuan Jiang & Zhanji Zheng, 2024. "Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator," Sustainability, MDPI, vol. 16(18), pages 1-20, September.
    • Handle: RePEc:gam:jsusta:v:16:y:2024:i:18:p:8020-:d:1477616
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/18/8020/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/16/18/8020/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lo, Hong K. & Luo, X.W. & Siu, Barbara W.Y., 2006. "Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 792-806, November.
    2. Jin, Kun & Wang, Wei & Li, Xinran & Hua, Xuedong & Chen, Siyuan & Qin, Shaoyang, 2022. "Identifying the critical road combination in urban roads network under multiple disruption scenarios," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).
    3. 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.
    4. Douglas Bonett & Thomas Wright, 2000. "Sample size requirements for estimating pearson, kendall and spearman correlations," Psychometrika, Springer;The Psychometric Society, vol. 65(1), pages 23-28, March.
    5. Kurmankhojayev, Daniyar & Li, Guoyuan & Chen, Anthony, 2024. "Link criticality index: Refinement, framework extension, and a case study," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    6. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    7. Di, Xuan & Liu, Henry X., 2016. "Boundedly rational route choice behavior: A review of models and methodologies," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 142-179.
    8. Liang Wang & Lei Zhao & Xiaojian Hu & Xinyong Zhao & Huan Wang, 2023. "A Reliability-Based Traffic Equilibrium Model with Boundedly Rational Travelers Considering Acceptable Arrival Thresholds," Sustainability, MDPI, vol. 15(8), pages 1-19, April.
    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. Barati, Hojjat & Yazici, Anil & Almotahari, Amirmasoud, 2024. "A methodology for ranking of critical links in transportation networks based on criticality score distributions," Reliability Engineering and System Safety, Elsevier, vol. 251(C).
    2. Di, Zhen & Yang, Lixing, 2020. "Reversible lane network design for maximizing the coupling measure between demand structure and network structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    3. Tan, Heqing & Xu, Xiangdong & Chen, Anthony, 2024. "On endogenously distinguishing inactive paths in stochastic user equilibrium: A convex programming approach with a truncated path choice model," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    4. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    5. Xu, Xiangdong & Qu, Kai & Chen, Anthony & Yang, Chao, 2021. "A new day-to-day dynamic network vulnerability analysis approach with Weibit-based route adjustment process," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    6. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    7. Kurmankhojayev, Daniyar & Li, Guoyuan & Chen, Anthony, 2024. "Link criticality index: Refinement, framework extension, and a case study," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    8. Cao, Pengliang & Zheng, Yujing & Yuen, Kum Fai & Ji, Yuxiong, 2023. "Inter-terminal transportation for an offshore port integrating an inland container depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    9. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    10. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    11. Zhang, Fang & Lu, Jian & Hu, Xiaojian & Meng, Qiang, 2023. "Integrated deployment of dedicated lane and roadside unit considering uncertain road capacity under the mixed-autonomy traffic environment," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    12. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    13. Ehrgott, Matthias & Wang, Judith Y.T. & Watling, David P., 2015. "On multi-objective stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 704-717.
    14. Mahdi Takalloo & Changhyun Kwon, 2019. "On the Price of Satisficing in Network User Equilibria," Papers 1911.07914, arXiv.org.
    15. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    16. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    17. Ng, ManWo & Waller, S. Travis, 2010. "A computationally efficient methodology to characterize travel time reliability using the fast Fourier transform," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1202-1219, December.
    18. Li, Zhitao & Tang, Jinjun & Zhao, Chuyun & Gao, Fan, 2023. "Improved centrality measure based on the adapted PageRank algorithm for urban transportation multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    19. Wei, Tangjian & Batley, Richard & Liu, Ronghui & Xu, Guangming & Tang, Yili, 2024. "A method of time-varying demand distribution estimation for high-speed railway networks with user equilibrium model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    20. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.

    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:gam:jsusta:v:16:y:2024:i:18:p:8020-:d:1477616. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.