单电梯紧急疏散调度问题求解
Solutions of the single elevator scheduling problem for emergency evacuations

该文研究单电梯紧急疏散调度问题, 即在紧急情况下, 如何调度楼内可用的1部电梯, 以在最短时间内将各楼层已知人员全部疏散的问题。在已有整数规划模型及求解方法的基础上, 通过增加电梯运行约束以及线性化非线性约束等方法, 将问题表达为等价的整数线性规划问题, 并提出改进的启发式算法, 算法的核心思想在于使每个往返疏散的人数尽可能多且楼层被访问次数尽可能少。数值实验表明: 该算法比现有算法具有更好的疏散效果。
Abstract：This study considers the minimization of the evacuation time for a single elevator for emergency conditions when all the evacuees are waiting in the elevator halls before the evacuation begins. Integer programming (IP) and a heuristic algorithm are used to formulate the problem as an equivalent integer linear programming problem that includes the elevator operation constraints and linearizes the nonlinear constraints. The heuristic algorithm maximizes the number of evacuees evacuated in each roundtrip while minimizing the number of visits to the floors. Numerical tests verify the improved evacuation speed given by this algorithm relative to existing algorithms.