紧急疏散电梯调度算法  

Elevator scheduling algorithm for emergency evacuation

作　　者：王晶[1] 牟晓牧[1] 许鋆[1] 王书宁[1] 

机构地区：[1]清华大学自动化系,北京100084

出　　处：《清华大学学报（自然科学版）》2013年第7期1041-1045,共5页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金重点项目(61134012);国家自然科学基金面上项目(61074118;61104218)

摘　　要：当大楼内发生火灾等紧急情况时,利用电梯来疏散乘客可以缩短疏散时间。该文假设在疏散开始时刻所有待疏散乘客都到达楼层电梯口等待疏散,而且疏散层为某一特定楼层。基于常用的计算疏散时间的模型ELVAC,将紧急疏散电梯调度问题描述为一个整数规划问题,并证明该问题的简化问题(仅极小化停梯次数的整数规划问题)是NP难问题。对于该问题,给出一种启发式紧急疏散电梯调度算法,并与两站停靠调度方法和LINGO软件求解结果进行比较,说明了该调度算法的有效性。Elevators can reduce evacuation times during emergency evacuations of buildings. The model assumes that the people are already at the elevator hall of each floor when evacuation begins and that the discharge floor is specified. The emergency evacuation problem is then formulated as an integer programming problem. The simplified version of the integer programming problem which only minimizes the stopping times is proved to be NP-hard. A heuristic algorithm is then designed for elevator scheduling in emergency evacuations. Simulations compared with the two-stop evacuation approach and the LINGO solver show that this algorithm is more effective.

关 键 词：紧急疏散 电梯调度 整数规划 划分问题 

分 类 号：TU976.3[建筑科学]