Elise Miller-Hooks

Publications: Journal 29

“The Safest Escape Problem”

Journal of the Operational Research Society 60, 1749-1758.
Opasanon, S. and E. Miller-Hooks (2009)

Pub29In this paper, the Safest Escape (SEscape) problem is defined for providing evacuation plans for emergency egress from large buildings or a geographical region.

The objective of the SEscape problem is to determine the set of paths and number of evacuees to send along each path such that the minimum probability of arrival at an exit for any evacuee is maximized. Such paths minimize the risk incurred by the evacuees who are forced to take the greatest risk.

The problem is considered in a dynamic and time-varying network, where arc capacities are recaptured over time, arc traversal times are time-varying and arc capacities are random variables with probability distribution functions that vary with time. An exact algorithm, the SEscape algorithm, is proposed to address this problem.



Elise Miller-Hooks, Ph.D.
Bill & Eleanor Hazel Chair in Infrastructure Engineering

Phone: 703.993.1685
Email: miller@gmu.edu

Office: 4614 Nguyen Engineering Building

Sid and Reva Dewberry Department of Civil, Environmental and Infrastructure Engineering
George Mason University
4400 University Drive, MS 6C1
Fairfax, VA 22030


More Publications


Volgenau School of Engineering
George Mason University