摘要
突发灾害事故的应急疏散是减少生命财产损失,特别是减少群死群伤事故发生的有效手段.以往的研究忽视了多源点间疏散的相互影响,使得疏散线路的安排不太合理.同时考虑存在有优先顺序的多源点和容量限制情形下的应急疏散问题,建立了多源点疏散模型,设计了基于图论中网络优化思想的启发式算法.该算法引入K短路概念,并行处理多源点多线路的疏散过程,实时更新网络容量,从而得出满意的疏散线路和最短的疏散时间,并分析了算法复杂性,最后通过算例验证了该算法的有效性和可行性.
Emergency evacuation of unexpected disasters and accidents is one effective means to reduce the loss of lives and property, especially for the reduction of massive casualties in accidents. Previous studies ignored influence of the interrelated sources on evacuati on when there are more than one source, which causes unreasonable evacuation routes. In order to overcome this disadvantage, this paper considers the emergency evacuation problem of multi-sources with the order of priority as well as the capacity constraints. After the multi-source evacuation model is proposed, a novel heuristic algorithm based on network optimization in graph theory is given. By introducing the concept of K shortest path, the algorithm processes simultaneously the evacuation of multi-sources and multi-routes, and updates network capacity in real-time, therefore it can obtain satisfactory shortest evacuation routes and evacuation time. The computational complexity of the algorithm is also analyzed. Finally, a numerical example is presented to show the effectiveness and feasibility of this algorithm.
出处
《管理科学学报》
CSSCI
北大核心
2009年第3期111-118,共8页
Journal of Management Sciences in China
基金
国家自然科学基金重点资助项目(70432001
70832005)
国家自然科学基金资助项目(70673012)
教育部人文社会科学项目(06JA630018)
关键词
突发灾害事故
应急疏散
多源点疏散
K短路
算法
unexpected disasters and accidents
emergency evacuation
K multi-source evacuation
Kshortest path
algorithm
