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ženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the American Control Conference s. 2894 - 2899
Hlavní autoři: Xu, Jingyang, Feng, Tianke
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: American Automatic Control Council (AACC) 01.07.2016
Témata:
Automobiles
Benchmarks
Computational modeling
Conferences
Cutting
Dynamic scheduling
Electronics
Elevators
Job shop scheduling
Mathematical model
Mixed integer
Prototypes
Scheduling
ISSN:2378-5861
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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.
Bibliografie: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