Date of Award
Doctor of Philosophy
Lee D. Han
Arun Chatterjee, Frederick J. Wegmann, Yueh-er Kuo
In the conventional evacuation planning process, evacuees are assigned to fixed destinations based mainly on the criterion of geographical proximity. However, such pre-specified destinations (OD table) almost always lead to sub-optimal evacuation efficiencies due to uncertain road conditions such as congestion, road blockage, and other hazards associated with the emergency. By relaxing the constraint of assigning evacuees to pre-specified destinations, a one-destination evacuation (ODE) concept has the potential of greatly improving the evacuation efficiency. A framework for simultaneous optimization of evacuation traffic distribution and assignment is therefore proposed in this study. Based on the concept of ODE, the optimal destination and route assignment can be determined by solving a one-destination (1D) traffic assignment problem on a modified network representation.
When tested on real-world networks for evacuation studies, the proposed 1D model presents substantial improvement over the conventional multiple-destination (nD) model. For instance, for a hypothetical county-wide evacuation, a nearly 80% reduction in the overall evacuation time can be achieved when modeling of traffic routing with en route information in the 1D framework, and the 1D optimization results can also be used to improve the planning OD tables, resulting in an up to 60% reduction in the overall evacuation time. More importantly, this framework can be actually implemented, and its efficiency enhancement can be realized simply by instructing evacuees to head for more efficient destinations determined from the 1D optimization performed beforehand.
Yuan, Fang, "A Proposed Framework for Simultaneous Optimization of Evacuation Traffic Distribution and Assignment. " PhD diss., University of Tennessee, 2005.