Creative Commons Attribution 4.0 International license
The task of an elevator control is to schedule the elevators of a group such that small average and maximal waiting and travel times for the passengers are obtained. We present a novel exact reoptimization algorithm for this problem. A reoptimization algorithm computes a new optimal 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 algorithm for a group of elevators. We use our algorithm to compare the potential performance that can be achieved for conventional (ie up/down buttons) and two variants of destination call systems, where a passenger enters his destination floor when calling an elevator. This research is part of an ongoing project with our industry partner Kollmorgen Steuerungstechnik.
@InProceedings{hiller_et_al:DagSemProc.09261.11,
author = {Hiller, Benjamin and Torsten Klug and Andreas Tuchscherer},
title = {{Improving the perfomance of elevator systems using exact reoptimization algorithms}},
booktitle = {Models and Algorithms for Optimization in Logistics},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9261},
editor = {Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.11},
URN = {urn:nbn:de:0030-drops-21799},
doi = {10.4230/DagSemProc.09261.11},
annote = {Keywords: Elevator control, reoptimization, online optimization}
}