文档介绍：Discrete Applied Mathematics 154 (2006) 1908–1931
ate/dam
Online-optimization of multi-elevator transport systems with
reoptimization algorithms based on set-partitioning modelsଁ
Philipp Friesea,1, Jörg Rambaub,∗
aDepartment of Optimization, Zuse Institute Berlin, Germany
bDepartment of Mathematics, University of Bayreuth, Germany
Received 31 December 2004; received in revised form 18 May 2005; accepted 18 January 2006
Available online 6 June 2006
Abstract
We develop and pare policies for the control of a system of k elevators with capacity one in a transport
environment with floors, an idealized version of a pallet elevator system in a large distribution center of the Herlitz PBS AG in
Falkensee. Each elevator in the idealized system has an individual waiting queue of infinite capacity. On each floor, requests arrive
over time in global waiting queues of infinite capacity. The goal is to find a policy that, without any knowledge about future requests,
assigns an elevator to each request and a schedule to each elevator so that certain expected cost functions (., the average or the
maximal flow times) are minimized. We show that a reoptimization policy for minimizing average squared waiting times can be
implemented to run in real-time (1 s) using dynamic column generation. Moreover, in discrete event simulations with Poisson input
it outperforms monly used policies like multi-server variants of greedy and nearest neighbor.
© 2006 Elsevier . All rights reserved.
Keywords: Elevator group control; Policy; Reoptimization; Online; Real-time; Simulation
1. Introduction
Our research on elevator control was motivated by the following practical application. In a large distribution center
of Herlitz PBS AG, organized by pany eCom Logistik, there are two transportation modules consisting of five
elevators each. These elevator systems connect the missioning floors and the stacker crane terminals of the
large warehouse with the ground floor. The i