Single elevator scheduling problem with complete information: An exact model using mixed integer linear programming

In this paper, we model a single elevator scheduling problem as a mixed integer linear program (MILP). Based on an industrial prototype model for elevator moving dynamics, the nonlinear travel activities for the elevator are linearized in the scheduling problem. We propose a set of cutting planes that accelerate the computation time for solving the MILP for a set of testing cases under different scenarios. For the first time, an exact scheduling model is modeled with MILP, and the elevator moving dynamics model is based on a high-accuracy industrial prototype model. According to the model structure, it can be easily extended to various objectives and can be easily implemented. This model can serve as benchmarks for other approaches in simulation.