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.
王晶, 王书宁. 单电梯紧急疏散调度问题求解[J]. 清华大学学报（自然科学版）, 2015, 55(5): 550-557.
WANG Jing, WANG Shuning. Solutions of the single elevator scheduling problem for emergency evacuations. Journal of Tsinghua University(Science and Technology), 2015, 55(5): 550-557.