An Exact Reoptimization Algorithm for the Scheduling of Elevator Groups
Please always quote using this URN: urn:nbn:de:0297-zib-16485
- The task of an elevator control is to schedule the elevators of a group such that small waiting and travel times for the passengers are obtained. We present an exact reoptimization algorithm for this problem. A reoptimization algorithm computes a new schedule for the elevator group each time a new passenger arrives. Our algorithm uses column generation techniques and is, to the best of our knowledge, the first exact reoptimization algorithms for a group of passenger elevators. To solve the column generation problem, we propose a Branch & Bound method.
Download full text files
Additional Services
| Author: | Benjamin HillerORCiD, Torsten Klug, Andreas Tuchscherer |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | elevator control, online optimization, reoptimization algorithms, column generation |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING |
| Date of first Publication: | 2012/11/15 |
| Series (Serial Number): | ZIB-Report (12-43) |
| ISSN: | 1438-0064 |
| Published in: | Appeared in: Flexible Services and Manufacturing Journal, April 2013 |
| DOI: | https://doi.org/10.1007/s10696-013-9175-6 |
| Licence (German): |  Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung |
