The task of an elevator control is to schedule the elevators ofa 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 (i. e., up/down buttons) and two variants of destination call systems, where a passenger enters his desti nation floor when calling an elevator. This research is part of an ongoing project with our industry partner Kollmorgen Steuerungstechnik.
【 预 览 】
附件列表
Files
Size
Format
View
Improving the performance of elevator systems using exact reoptimization algorithms?