该文研究单电梯紧急疏散调度问题,即在紧急情况下,如何调度楼内可用的1部电梯,以在最短时间内将各楼层已知人员全部疏散的问题。在已有整数规划模型及求解方法的基础上,通过增加电梯运行约束以及线性化非线性约束等方法,将问题表达为等价的整数线性规划问题,并提出改进的启发式算法,算法的核心思想在于使每个往返疏散的人数尽可能多且楼层被访问次数尽可能少。数值实验表明:该算法比现有算法具有更好的疏散效果。 This paper studies the single-elevator emergency evacuation scheduling problem, that is, how to schedule one elevator available in the building in case of emergency so as to evacuate all the known persons in each floor in the shortest time. On the basis of existing integer programming models and solving methods, the problems are expressed as equivalent integer linear programming problems by adding elevator operation constraints and linearized nonlinear constraints, and an improved heuristic algorithm is proposed. The core of the algorithm The idea is to make as many people as possible each round trip and as few floors as possible. Numerical experiments show that this algorithm has better evacuation effect than the existing ones.