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

Post-disaster recovery sequencing strategy for road networks

Author

Listed:
  • Gokalp, Can
  • Patil, Priyadarshan N.
  • Boyles, Stephen D.

Abstract

Natural disasters cause significant disruption in road networks, rendering many crucial links unusable. We investigate how to identify a sequence for repairing these links that minimizes total travel time over the repair horizon, given that at each repair stage road traffic distributes according to the principle of user equilibrium. We derive an analogue of Bellman’s optimality principle, allowing us to solve the problem using methods of dynamic programming. We specifically develop a bidirectional search heuristic with customized pruning and branching strategies that exploit specific properties of traffic assignment. Our experiments show that our method is scalable and performs well even on networks involving thousands of links.

Suggested Citation

  • Gokalp, Can & Patil, Priyadarshan N. & Boyles, Stephen D., 2021. "Post-disaster recovery sequencing strategy for road networks," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 228-245.
  • Handle: RePEc:eee:transb:v:153:y:2021:i:c:p:228-245
    DOI: 10.1016/j.trb.2021.09.007
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.trb.2021.09.007?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. Zhu, Shanjiang & Levinson, David & Liu, Henry X. & Harder, Kathleen, 2010. "The traffic and behavioral effects of the I-35W Mississippi River bridge collapse," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(10), pages 771-784, December.
    2. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    3. David Rey & Hillel Bar-Gera & Vinayak V. Dixit & S. Travis Waller, 2019. "A Branch-and-Price Algorithm for the Bilevel Network Maintenance Scheduling Problem," Transportation Science, INFORMS, vol. 53(5), pages 1455-1478, September.
    4. Lichun Chen & Elise Miller-Hooks, 2012. "Resilience: An Indicator of Recovery Capability in Intermodal Freight Transport," Transportation Science, INFORMS, vol. 46(1), pages 109-123, February.
    5. Eric D. Vugrin & Mark A. Turnquist & Nathanael J.K. Brown, 2014. "Optimal recovery sequencing for enhanced resilience and service restoration in transportation networks," International Journal of Critical Infrastructures, Inderscience Enterprises Ltd, vol. 10(3/4), pages 218-246.
    6. Dial, Robert B., 2006. "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 917-936, December.
    7. Pirmin Fontaine & Stefan Minner, 2017. "A dynamic discrete network design problem for maintenance planning in traffic networks," Annals of Operations Research, Springer, vol. 253(2), pages 757-772, June.
    8. Hamid Farvaresh & Mohammad Sepehri, 2013. "A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem," Networks and Spatial Economics, Springer, vol. 13(1), pages 67-106, March.
    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. Rodelia Sansano & Makoto Chikaraishi, 2022. "Exploring Natural and Social Factors Affecting Road Disruption Patterns and the Duration of Recovery: A Case from Hiroshima, Japan," Sustainability, MDPI, vol. 14(18), pages 1-15, September.

    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. Wang, Guangmin & Gao, Ziyou & Xu, Meng, 2019. "Integrating link-based discrete credit charging scheme into discrete network design problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 176-187.
    2. Zou, Qiling & Chen, Suren, 2019. "Enhancing resilience of interdependent traffic-electric power system," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    3. Pirmin Fontaine & Stefan Minner, 2017. "A dynamic discrete network design problem for maintenance planning in traffic networks," Annals of Operations Research, Springer, vol. 253(2), pages 757-772, June.
    4. Faturechi, Reza & Miller-Hooks, Elise, 2014. "Travel time resilience of roadway networks under disaster," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 47-64.
    5. Nogal, M. & Honfi, D., 2019. "Assessment of road traffic resilience assuming stochastic user behaviour," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 72-83.
    6. Milan Janić, 2018. "Modelling the resilience of rail passenger transport networks affected by large-scale disruptive events: the case of HSR (high speed rail)," Transportation, Springer, vol. 45(4), pages 1101-1137, July.
    7. Bagloee, Saeed Asadi & Sarvi, Majid & Wolshon, Brian & Dixit, Vinayak, 2017. "Identifying critical disruption scenarios and a global robustness index tailored to real life road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 98(C), pages 60-81.
    8. Hosseini, Seyedmohsen & Barker, Kash & Ramirez-Marquez, Jose E., 2016. "A review of definitions and measures of system resilience," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 47-61.
    9. F. Hooshmand & S. A. MirHassani, 2018. "An Effective Bilevel Programming Approach for the Evasive Flow Capturing Location Problem," Networks and Spatial Economics, Springer, vol. 18(4), pages 909-935, December.
    10. Jakšić, Zoran & Janić, Milan, 2020. "Modeling resilience of the ATC (Air Traffic Control) sectors," Journal of Air Transport Management, Elsevier, vol. 89(C).
    11. Wang, Nanxi & Yuen, Kum Fai, 2022. "Resilience assessment of waterway transportation systems: Combining system performance and recovery cost," Reliability Engineering and System Safety, Elsevier, vol. 226(C).
    12. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    13. Andreas Lanz & Gregor Reich & Ole Wilms, 2022. "Adaptive grids for the estimation of dynamic models," Quantitative Marketing and Economics (QME), Springer, vol. 20(2), pages 179-238, June.
    14. Shi, Yi & Deng, Yawen & Wang, Guoan & Xu, Jiuping, 2020. "Stackelberg equilibrium-based eco-economic approach for sustainable development of kitchen waste disposal with subsidy policy: A case study from China," Energy, Elsevier, vol. 196(C).
    15. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    16. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    17. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    18. Chan Y. Han & Brian J. Lunday & Matthew J. Robbins, 2016. "A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 405-416, August.
    19. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    20. Grimm, Veronika & Schewe, Lars & Schmidt, Martin & Zöttl, Gregor, 2017. "Uniqueness of market equilibrium on a network: A peak-load pricing approach," European Journal of Operational Research, Elsevier, vol. 261(3), pages 971-983.

    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:153:y:2021:i:c:p:228-245. 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.