紧急疏散模式下电梯调度问题研究

RESEARCH ON THE ELEVATOR SCHEDULING FOR EMERGENCY EVACUATION

简要介绍清华一东芝联合研究小组对于紧急疏散模式下电梯调度问题的研究成果。针对所有待疏散人员在疏散开始时刻全部到达的理想情况,我们构建了该确定性问题的整数线性规划模型，指出它是分批配送车辆路径规划问题的一种特例,并给出求解该问题的精确算法和启发式算法。在此基础上，我们研究了更接近实际的情况,即待疏散人员在疏散开始后的一段时间内陆续到达的情况，对此我们设计了有效的疏散规则,提出了基于规则的紧急疏散电梯调度算法，并用理想情况的结果衡量所提算法的改进空间。数值实验结果验证了所提出算法的良好疏散性能。

The research result on the elevator scheduling for emergency evacuation that jointly carried out by Tsinghua-Toshiba research team is briefly introduced. For the ideal case that all the evacuees are arrived at the beginning of evacuation, we formulate the problem as an integer linear programming problem, point out that it is a special case of split delivery vehicle routing problem and propose an exact algorithm and a heuristic algorithm for solving it. Based on these results, we analyzed the case closer to actual, in which the evacuees arrive gradually within a period of time. Effective evacuation strategies are designed and a rule-based elevator scheduling algorithm for emergency evacuation is proposed. The room for improvement of the proposed algorithm is measured by the results of ideal case and numerical results verified the performance of the proposed algorithm.