多层建筑物应急疏散模型和算法  

Multi-storied Building Emergency Evacuation Model and Algorithm

作　　者：杨建芳[1,2] 高岩[1] 王宏杰[1] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]杭州电子科技大学运筹与控制研究所,杭州310018

出　　处：《系统仿真学报》2014年第2期267-273,共7页Journal of System Simulation

基　　金：国家自然科学基金(11071219,11171221);上海市科委(10550500800);浙江省自然科学基金(Y1090465);浙江省教育厅基金(Y201016901)

摘　　要：城市的大型公共建筑物一旦发生火灾、人员拥挤踩踏、毒气泄漏、恐怖袭击等突发性公共安全事件,需要以最快的速度把室内人员转移到建筑物外部。有效的疏散计划对于减少人员伤亡,减轻经济损失具有重要的意义。在多层建筑物中,由于各个楼层到达底层出口的时间不同,待疏散人员的总数不同,模型的建立和算法设计不同于单层建筑。在考虑路径容量受限的多层建筑物疏散问题时,以疏散结束时间最小化为目标建立数学模型,利用动态网络流来设计算法。首先确定实际可能参与疏散的路径,优先饱和疏散所需时间长的楼层,以达到均衡疏散时间的目的,从而确定疏散方案。最后通过算例验证了该算法的有效性和可行性。Emergency evacuation from out of large public buildings becomes necessary in case of an accident such as fire, the personnel crowded trample, leak of toxic gas, terrorist attacks and other unexpected public security events. The purpose is to evacuate people from the danger zone through exits within the shortest possible time. It is important to give effective evacuation plan in order to reduce casualties and economic loss. In multi-storied buildings, because evacuation time of each floor to exits and the total number of evacuees are different, the establishment of the model and algorithm design is different from the single-storied building. A mathematical model was given with objective function minimizing evacuation time and an algorithm was designed based on dynamic network flow. Then the algorithm could be realized by calculating the feasible path sets and giving the largest possible number of evacuees on the paths of the floor. Finally, a numerical example shows the effectiveness and feasibility of this algorithm.

关 键 词：应急疏散 多层建筑物 容量限制 动态网络流 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]