Optimal Scheduling of Evacuation Operations

Abstract

Evacuations necessitated by extreme events are usually envisioned as taking place with all people evacuating simultaneously; this leads to premature congestion on the surface streets and excessive delays. With the evacuating load onto the network staggered, the onset of congestion may be delayed, and people can evacuate more quickly. In this study, the problem of scheduling evacuation trips between a selected set of origin nodes and (safety) destinations was considered, with the objective of minimizing network clearance time. A modified system-optimal dynamic traffic assignment formulation is proposed; in it the total system evacuation time, as opposed to the total system trip time, is minimized. An iterative heuristic procedure is used to solve this problem: the method of successive averages is used to find the flow assignments for the next iteration; a traffic simulator, DYNASMART-P, is used to propagate the vehicles on their prescribed paths and determine the state of the system. Therefore, the simulator serves as a tool to satisfy the dynamic traffic assignment constraints implicitly while evaluating the objective function. The output of this model will be the departure time, route, and destination choices for each evacuee. The output is then aggregated to produce a time-dependent staging policy for each selected origin.

Get full access to this article

View all access options for this article.

References

Sheffi

, Mahmassani

, and Powell

W. B.

. A Transportation Network Evacuation Model. Transportation Research, Vol. 16A, No. 3, 1982, pp. 209–218.

Sheffi

, Mahmassani

, and Powell

W. B.

. Evacuation Studies for Nuclear Power Plant Sites: A New Challenge For Transportation Engineers. ITE Journal, Vol. 51, No. 6, 1982, pp. 25–28.

Hobeika

A. G.

, and Kim

. Comparison of Traffic Assignments in Evacuation Modeling. IEEE Transactions on Engineering Management, Vol. 45, No. 2, 1998, pp. 192–198.

Sattayhatewa

, and Ran

. Developing a Dynamic Traffic Management Model for Nuclear Power Plant Evacuation. Presented at 79th Annual Meeting of the Transportation Research Board, Washington, D.C., 2000.

Chiu

Y.-C.

, Rao

P. K.

, and Mirchandani

P. B.

. Dynamic Traffic Management for Evacuation. Presented at 84th Annual Meeting of the Transportation Research Board, Washington, D.C., 2005.

Jayakrishnan

, Mahmassani

H. S.

, and Hu.

T. Y.

An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks.

Transportation Research, Vol. 2C, No. 3, 1994, pp. 129–147.

Dong

, and Xue

. Intelligent Scheduling of Contraflow Control Operation Using Hierarchical Pattern Recognition and Constrained Optimization. Proc., IEEE International Conference on Systems, Man, and Cybernetics, 1997, pp. 135–140.

Wolshon

, and Theodoulou

. Modeling and Analyses of Freeway Contraflow to Improve Future Evacuations. Presented at 83rd Annual Meeting of the Transportation Research Board, Washington, D.C., 2004.

Tuydes

, and Ziliaskopoulos

. Network Redesign to Optimize Evacuation Contraflow. Presented at 83rd Annual Meeting of the Transportation Research Board, Washington, D.C., 2004.

10.

Chen

, and Zhan

F. B.

. Agent-Based Modeling and Simulation of Urban Evacuation: Relative Effectiveness of Simultaneous and Staged Evacuation Strategies. Presented at 83rd Annual Meeting of the Transportation Research Board, Washington, D.C., 2004.

11.

Jarvis

J. R.

, and Ratliff

D. H.

. Some Equivalent Objectives for Dynamic Network Flow Problems. Management Science, Vol. 28, 1982, pp. 106–109.

12.

Sheffi

Urban Transportation Networks. Prentice Hall, Englewood Cliffs, N.J., 1985.

13.

Peeta

, and Mahmassani

H. S.

. System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks. Annals of Operations Research, Vol. 60, 1995, pp. 81–113.