中文摘要：

针对多源多汇和容量限制情形下的应急疏散问题，以总疏散时间最小为目标函数，建立了基于路径的网络流控制应急疏散模型，设计了基于图论中网络优化思想和流控制理论的快速求解启发式算法。该算法引入K短路概念，采用时间窗记录疏散冲突，利用交通流用户最优平衡原理对疏散人员进行分组和疏导冲突人群，从而计算出满意的疏散路线和最短的疏散时间。然后，分析了算法的计算复杂性，表明该算法为一多项式算法，能够满足应用中的实时性要求，最后通过算例验证了模型和算法给出的疏散策略是有效的。

英文摘要：

Considering the emergency evacuation problem of multi-sources and multi-destinations with capacity con- straints, this paper proposed a path-based network flow control model to minimize the total evacuation time, and de- signed a fast novel heuristic algorithm based on network optimization theory and flow control theory. By introducing the concept of K shortest path, the algorithm identifies evacuation conflict with time windows, divides evacuees into groups and eases the conflict evacuees based on user optimal equilibrium theory of traffic flow, therefore obtains the satisfactory evacuation routes and the shortest evacuation time. The computational complexity of the algorithm is al- so analyzed. Results show that the algorithm is a polynomial algorithm and can meet the real-time requirements of applications. Finally, a numerical example is presented to show the effectiveness of the model and algorithm.