期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 60, 期 12, 页码 1749-1758出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/jors.2008.122
关键词
dynamic network flows; stochastic; time-varying networks; evacuation; building egress
资金
- NSF [CMS 0348552]
In 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. Journal of the Operational Research Society (2009) 60, 1749-1758. doi:10.1057/jors.2008.122 Published online 3 December 2008
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据