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 th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the American Control Conference s. 2894 - 2899
Hlavní autori: Xu, Jingyang, Feng, Tianke
Médium: Konferenčný príspevok.. Journal Article
Jazyk:English
Vydavateľské údaje: American Automatic Control Council (AACC) 01.07.2016
Predmet:
Automobiles
Benchmarks
Computational modeling
Conferences
Cutting
Dynamic scheduling
Electronics
Elevators
Job shop scheduling
Mathematical model
Mixed integer
Prototypes
Scheduling
ISSN:2378-5861
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2378-5861
DOI:10.1109/ACC.2016.7525358