IDEAS home Printed from https://ideas.repec.org/a/spr/nathaz/v121y2025i4d10.1007_s11069-024-06985-4.html
   My bibliography  Save this article

Optimization of emergency rescue routes after a violent earthquake

Author

Listed:
  • Xianmin Wang

    (China University of Geosciences
    China University of Geosciences
    China University of Geosciences
    China University of Geosciences)

  • Shuwang Wu

    (China University of Geosciences)

  • Zixiang Zhao

    (China University of Geosciences)

  • Haixiang Guo

    (China University of Geosciences)

  • Wenxue Chen

    (China University of Geosciences)

Abstract

A great earthquake usually causes heavy human casualties and extensive road damage. Rational rescue routing is vital to save lives. Massive loose deposits and unstable slope materials sourced from coseismic landslides severely endanger the safety of rescue workers and rescued persons. However, current rescue routing works concentrate on traffic conditions and neglect the threat of coseismic landslides. Safety and efficiency require to be taken into consideration comprehensively. This work for the first time involves coseismic landslide susceptibility as the safety factor into emergency rescue routing and determines the optimal routes by combining efficiency and safety. Furthermore this work employs the 2015 Mw 7.8 Gorkha earthquake as a benchmark and focuses on the significant scenario of multiple relief centers, multiple destructed residential areas, and limited rescue vehicles to conduct rescue route optimization. Two significant insights are suggested as follows. (1) In terms of about 20% of coseismic landslide data randomly selected (i.e., simulation of limited data collected just after an earthquake), coseismic landslide susceptibility along roads is predicted by LightGBM algorithm. The prediction Accuracy, Precision, Recall, F1-score, and AUC values attain 92.10%, 91.74%, 0.9245, 0.9209, and 0.9721, respectively. (2) The indices of road safety (landslide susceptibility), road accessibility, road length, and road grade are integrated to determine the optimal rescue routes by SPFA and Genetic algorithms. Compared with the optimal routes in terms of only efficiency, the ones coupling safety and efficiency feature lower landslide occurrence probability and smaller cost values. The involvement of landslide threat into rescue routing contributes to finding more rational rescue paths.

Suggested Citation

  • Xianmin Wang & Shuwang Wu & Zixiang Zhao & Haixiang Guo & Wenxue Chen, 2025. "Optimization of emergency rescue routes after a violent earthquake," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 121(4), pages 4585-4613, March.
  • Handle: RePEc:spr:nathaz:v:121:y:2025:i:4:d:10.1007_s11069-024-06985-4
    DOI: 10.1007/s11069-024-06985-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11069-024-06985-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11069-024-06985-4?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. Huanwei Wang & Shangjie Lou & Jing Jing & Yisen Wang & Wei Liu & Tieming Liu, 2022. "The EBS-A* algorithm: An improved A* algorithm for path planning," PLOS ONE, Public Library of Science, vol. 17(2), pages 1-27, February.
    2. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    3. Maocan Song & Lin Cheng & Huimin Ge & Chao Sun & Ruochen Wang, 2024. "Finding the $$\mathrm{K}$$ K Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty," Networks and Spatial Economics, Springer, vol. 24(2), pages 395-423, June.
    4. Muhammad Basharat & Muhammad Tayyib Riaz & M. Qasim Jan & Chong Xu & Saima Riaz, 2021. "A review of landslides related to the 2005 Kashmir Earthquake: implication and future challenges," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 108(1), pages 1-30, August.
    5. Nicole Feldl & Roger Bilham, 2006. "Great Himalayan earthquakes and the Tibetan plateau," Nature, Nature, vol. 444(7116), pages 165-170, November.
    6. Sérgio C. Oliveira & José L. Zêzere & Ricardo A. C. Garcia & Susana Pereira & Teresa Vaz & Raquel Melo, 2024. "Landslide susceptibility assessment using different rainfall event-based landslide inventories: advantages and limitations," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 120(10), pages 9361-9399, August.
    7. Himmich, Ilyas & El Hallaoui, Issmail & Soumis, François, 2024. "A multiphase dynamic programming algorithm for the shortest path problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 315(2), pages 470-483.
    8. Changyong Zhang, 2024. "An enhanced Benders decomposition method for unique shortest path routing," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 989-1012, September.
    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. Juan Li & Jin Zhang & Li Wang & Ao Zhao, 2024. "A Hierarchical Spatiotemporal Data Model Based on Knowledge Graphs for Representation and Modeling of Dynamic Landslide Scenes," Sustainability, MDPI, vol. 16(23), pages 1-17, November.
    2. 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.
    3. 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).
    4. A. Vanuvamalai & K. P. Jaya & V. Balachandran, 2018. "Seismic performance of tunnel structures: a case study," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 93(1), pages 453-468, August.
    5. 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.
    6. 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.
    7. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    8. Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    9. 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.
    10. Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
    11. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    12. Noruzoliaee, Mohamadhossein & Zou, Bo, 2022. "One-to-many matching and section-based formulation of autonomous ridesharing equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 72-100.
    13. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
    14. Zhu, Yiyang & Jin, Jian Gang & Wang, Hai, 2024. "Path-choice-constrained bus bridging design under urban rail transit disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    15. Mohamad Khattar Awad & Mohammed El‐Shafei & Tassos Dimitriou & Yousef Rafique & Mohammed Baidas & Ammar Alhusaini, 2017. "Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach," International Journal of Network Management, John Wiley & Sons, vol. 27(5), September.
    16. Juanzhu Liang & Shunyi Xie & Jinjian Bao, 2024. "Analysis of a Multiple Traffic Flow Network’s Spatial Organization Pattern Recognition Based on a Network Map," Sustainability, MDPI, vol. 16(3), pages 1-20, February.
    17. Herminia Calvete & Lourdes del-Pozo & José Iranzo, 2012. "Algorithms for the quickest path problem and the reliable quickest path problem," Computational Management Science, Springer, vol. 9(2), pages 255-272, May.
    18. Guo, Fang & Yang, Jun & Lu, Jianyi, 2018. "The battery charging station location problem: Impact of users’ range anxiety and distance convenience," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 1-18.
    19. Peter Davison & Bruce Cameron & Edward F. Crawley, 2015. "Technology Portfolio Planning by Weighted Graph Analysis of System Architectures," Systems Engineering, John Wiley & Sons, vol. 18(1), pages 45-58, January.
    20. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.

    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:spr:nathaz:v:121:y:2025:i:4:d:10.1007_s11069-024-06985-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.