论文标题
使用救援指南的人群的平均疏散时间最小化:一种基于方案的方法
Minimization of mean-CVaR evacuation time of a crowd using rescue guides: a scenario-based approach
论文作者
论文摘要
如果在公共空间中受到威胁,则应该将其移至庇护所或撤离而没有延误。公共场所中的风险管理和疏散计划也应考虑到人群流量流量的不确定性。考虑到不确定性的一种方法是利用安全人员或指南,将人群根据疏散计划导致人群离开建筑物。然而,解决最低时间撤离计划是一个计算要求的问题。在本文中,我们将疏散的人群和指南建模为具有社会力量模型的多代理系统。为了表示不确定性,我们构建了概率的情况。疏散计划平均应该效果很好,并且对于表现最差的情况都应该很好。因此,我们将问题提出为双目标场景优化问题,其中撤离时间的平均值和条件价值(CVAR)是目标。提出了结合数值模拟和遗传算法的解决方案程序。我们将其应用于虚构乘客码头的撤离。在均值最佳的解决方案中,指导指南将人群带到最近的出口,而在CVAR最佳解决方案中,重点是解决最坏情况下发生的物理拥塞。在每个出口附近的每个代理组后面都放置一个指南,因此获得了最小化两个目标的计划。
In case of a threat in a public space, the crowd in it should be moved to a shelter or evacuated without delays. Risk management and evacuation planning in public spaces should also take into account uncertainties in the traffic patterns of crowd flow. One way to account for the uncertainties is to make use of safety staff, or guides, that lead the crowd out of the building according to an evacuation plan. Nevertheless, solving the minimum time evacuation plan is a computationally demanding problem. In this paper, we model the evacuating crowd and guides as a multi-agent system with the social force model. To represent uncertainty, we construct probabilistic scenarios. The evacuation plan should work well both on average and also for the worst-performing scenarios. Thus, we formulate the problem as a bi-objective scenario optimization problem, where the mean and conditional value-at-risk (CVaR) of the evacuation time are objectives. A solution procedure combining numerical simulation and genetic algorithm is presented. We apply it to the evacuation of a fictional passenger terminal. In the mean-optimal solution, guides are assigned to lead the crowd to the nearest exits, whereas in the CVaR-optimal solution the focus is on solving the physical congestion occurring in the worst-case scenario. With one guide positioned behind each agent group near each exit, a plan that minimizes both objectives is obtained.