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

Yu-Ting Hsu () and Srinivas Peeta ()

Networks and Spatial Economics, 2015, vol. 15, issue 3, 743-764

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

Keywords: Evacuation risk; Clearance time estimation; Dynamic network flow problem; Location-priority routing; The quickest flow (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s11067-013-9195-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:netspa:v:15:y:2015:i:3:p:743-764

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11067/PS2

DOI: 10.1007/s11067-013-9195-5

Access Statistics for this article

Networks and Spatial Economics is currently edited by Terry L. Friesz

More articles in Networks and Spatial Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().