论文部分内容阅读
当大楼内发生火灾等紧急情况时,利用电梯来疏散乘客可以缩短疏散时间。该文假设在疏散开始时刻所有待疏散乘客都到达楼层电梯口等待疏散,而且疏散层为某一特定楼层。基于常用的计算疏散时间的模型ELVAC,将紧急疏散电梯调度问题描述为一个整数规划问题,并证明该问题的简化问题(仅极小化停梯次数的整数规划问题)是NP难问题。对于该问题,给出一种启发式紧急疏散电梯调度算法,并与两站停靠调度方法和LINGO软件求解结果进行比较,说明了该调度算法的有效性。
When an emergency such as a fire occurs in the building, the use of an elevator to evacuate passengers can shorten the evacuation time. The paper assumes that at the beginning of the evacuation, all the passengers to be evacuated arrive at the elevator level and wait for evacuation, and the evacuation level is a specific floor. Based on the commonly used model ELVAC, which calculates the evacuation time, the emergency evacuation elevator scheduling problem is described as an integer programming problem. It is proved that the simplified problem of the problem (minimizing the integer programming problem of stopping times) is an NP-hard problem. For this problem, a heuristic emergency evacuation elevator scheduling algorithm is given, which is compared with the stopping dispatching method of two stations and the solution of LINGO software, which shows the effectiveness of the scheduling algorithm.