IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v15y2015i3p743-764.html
   My bibliography  Save this article

Clearance Time Estimation for Incorporating Evacuation Risk in Routing Strategies for Evacuation Operations

Author

Listed:
  • Yu-Ting Hsu
  • Srinivas Peeta

Abstract

This study seeks to develop an approximate but efficient approach for estimating evacuation clearance time which is defined as the time required to evacuate the population of a location to areas of safety. Elsewhere, this estimate of the clearance time is used as input to infer evacuation risk for a location which reflects whether the population of that location can be safely evacuated before the disaster impacts it. As the computed evacuation risk is used in a real-time stage-based framework for evacuation operations, the approach for clearance time estimation needs to be computationally efficient while being capable of approximating traffic flow dynamics reasonably. To address these needs, a dynamic routing policy labeled the location-priority routing is proposed, and the associated clearance time estimation problem is formulated as a dynamic network flow problem. The location-priority is based on the lead time that a location has until it is impacted by the disaster, and designates that the population at a location with a shorter lead time has higher priority in using roadway capacity for evacuation. By combining the location-priority routing with the consideration of a super sink, the routing problem for the evacuation network is transformed into sequential single-origin single-destination dynamic routing problems. It avoids expensive iterative search processes, enabling computational efficiency for real-time evacuation operations. The solution approach approximately captures the evolution of traffic dynamics across the stages of the operational framework. Results from numerical experiments illustrate that the proposed approach can address the aforementioned needs related to clearance time estimation. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Yu-Ting Hsu & Srinivas Peeta, 2015. "Clearance Time Estimation for Incorporating Evacuation Risk in Routing Strategies for Evacuation Operations," Networks and Spatial Economics, Springer, vol. 15(3), pages 743-764, September.
    • Handle: RePEc:kap:netspa:v:15:y:2015:i:3:p:743-764
    DOI: 10.1007/s11067-013-9195-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-013-9195-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-013-9195-5?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. Tao Yao & Supreet Mandala & Byung Chung, 2009. "Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach," Networks and Spatial Economics, Springer, vol. 9(2), pages 171-189, June.
    2. Yu-Ting Hsu & Srinivas Peeta, 2013. "An aggregate approach to model evacuee behavior for no-notice evacuation operations," Transportation, Springer, vol. 40(3), pages 671-696, May.
    3. Sherali, Hanif D. & Carter, Todd B. & Hobeika, Antoine G., 1991. "A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 439-452, December.
    4. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    5. John J. Jarvis & H. Donald Ratliff, 1982. "Note---Some Equivalent Objectives for Dynamic Network Flow Problems," Management Science, INFORMS, vol. 28(1), pages 106-109, January.
    6. L. G. Chalmet & R. L. Francis & P. B. Saunders, 1982. "Network Models for Building Evacuation," Management Science, INFORMS, vol. 28(1), pages 86-105, January.
    7. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    8. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    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. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    2. Liu, Jialin & Jiang, Rui & Liu, Yang & Jia, Bin & Li, Xingang & Wang, Ting, 2024. "Managing evacuation of multiclass traffic flow: Fleet configuration, lane allocation, lane reversal, and cross elimination," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    3. Satish V. Ukkusuri & Samiul Hasan & Binh Luong & Kien Doan & Xianyuan Zhan & Pamela Murray-Tuite & Weihao Yin, 2017. "A-RESCUE: An Agent based Regional Evacuation Simulator Coupled with User Enriched Behavior," Networks and Spatial Economics, Springer, vol. 17(1), pages 197-223, March.

    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. Xiaozheng He & Srinivas Peeta, 2014. "Dynamic Resource Allocation Problem for Transportation Network Evacuation," Networks and Spatial Economics, Springer, vol. 14(3), pages 505-530, December.
    2. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    3. Jian Li & Kaan Ozbay, 2015. "Evacuation Planning with Endogenous Transportation Network Degradations: A Stochastic Cell-Based Model and Solution Procedure," Networks and Spatial Economics, Springer, vol. 15(3), pages 677-696, September.
    4. Alf Kimms & Marc Maiwald, 2017. "An exact network flow formulation for cell‐based evacuation in urban areas," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 547-555, October.
    5. Ismaila Abderhamane Ndiaye & Emmanuel Neron & Antoine Jouglet, 2017. "Macroscopic evacuation plans for natural disasters," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 231-272, January.
    6. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    7. Liu, Jialin & Jiang, Rui & Liu, Yang & Jia, Bin & Li, Xingang & Wang, Ting, 2024. "Managing evacuation of multiclass traffic flow: Fleet configuration, lane allocation, lane reversal, and cross elimination," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    8. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    9. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    10. Bretschneider, S. & Kimms, A., 2011. "A basic mathematical model for evacuation problems in urban areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 523-539, July.
    11. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    12. H. W. Hamacher & S. Tufekci, 1987. "On the use of lexicographic min cost flows in evacuation modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(4), pages 487-503, August.
    13. Goerigk, Marc & Deghdak, Kaouthar & Heßler, Philipp, 2014. "A comprehensive evacuation planning model and genetic solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 82-97.
    14. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    15. Lim, Gino J. & Zangeneh, Shabnam & Reza Baharnemati, M. & Assavapokee, Tiravat, 2012. "A capacitated network flow optimization approach for short notice evacuation planning," European Journal of Operational Research, Elsevier, vol. 223(1), pages 234-245.
    16. Bish, Douglas R. & Sherali, Hanif D., 2013. "Aggregate-level demand management in evacuation planning," European Journal of Operational Research, Elsevier, vol. 224(1), pages 79-92.
    17. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2007. "Fast, Fair, and Efficient Flows in Networks," Operations Research, INFORMS, vol. 55(2), pages 215-225, April.
    18. Lichun Chen & Elise Miller‐Hooks, 2008. "The building evacuation problem with shared information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 363-376, June.
    19. Yunyue He & Zhong Liu & Jianmai Shi & Yishan Wang & Jiaming Zhang & Jinyuan Liu, 2015. "K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    20. Kimms, A. & Maiwald, M., 2018. "Bi-objective safe and resilient urban evacuation planning," European Journal of Operational Research, Elsevier, vol. 269(3), pages 1122-1136.

    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:kap:netspa:v:15:y:2015:i:3:p:743-764. 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.