Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control

An Elevator Group Control System (EGCS) assigns an elevator of a group to each passenger transportation request by solving a snapshot optimization problem, the Elevator Dispatching Problem (EDP). In the destination control, passengers register their destination floors in the elevator lobbies, after which the EGCS completes the assignment at once and is not allowed to change it later. Therefore, the EDP is formulated as a stochastic optimal control problem, where uncertain future passenger arrivals are modeled by a Poisson and a geometric Poisson process. The EDP is considered as a certainty equivalent controller in which the uncertain quantities are replaced by their expected values, and as a robust controller in which they take multiple values according to risk scenarios. Numerical experiments show that the expectations do not accurately predict EDP variables. The modeling with the geometric Poisson process results in better forecasting accuracy than with the Poisson process and many scenarios that closely match the realizations of the variables. Hence, the scenarios can be used as a basis for a robust EDP which simultaneously minimizes a passenger service quality criterion and its variation due to uncertain demand.

[1]  Jan Arild Audestad,et al.  Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector , 2006, Ann. Oper. Res..

[2]  Marja-Liisa Siikonen,et al.  DOUBLE-DECK DESTINATION CONTROL SYSTEM , 2006 .

[3]  Panos M. Pardalos,et al.  A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm , 2007, J. Glob. Optim..

[4]  Pablo Cortes,et al.  A Survey of Elevator Group Control Systems for Vertical Transportation: A Look at Recent Literature , 2015, IEEE Control Systems.

[5]  S. Scholtes,et al.  Nondifferentiable and two-level mathematical programming , 1997 .

[6]  N. A. Alexandris,et al.  Statistical models in lift systems , 1977 .

[7]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[8]  Jana Koehler,et al.  An AI-Based Approach to Destination Control in Elevators , 2002, AI Mag..

[9]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[10]  Peter B. Luh,et al.  Pricing problems with a continuum of customers as stochastic Stackelberg games , 1987 .

[11]  Christos G. Cassandras,et al.  Optimal dispatching control for elevator systems during uppeak traffic , 1997, IEEE Trans. Control. Syst. Technol..

[12]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[13]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[14]  Benjamin Hiller,et al.  An exact reoptimization algorithm for the scheduling of elevator groups , 2014 .

[15]  Gina Carol Barney,et al.  Elevator traffic handbook , 2002 .

[16]  Harri Ehtamo,et al.  Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis , 2016, Eur. J. Oper. Res..

[17]  Peter B. Luh,et al.  Group Elevator Scheduling With Advance Information for Normal and Emergency Modes , 2008, IEEE Transactions on Automation Science and Engineering.

[18]  Michael Patriksson,et al.  Stochastic mathematical programs with equilibrium constraints , 1999, Oper. Res. Lett..

[19]  Marja-Liisa Siikonen,et al.  Planning and Control Models for Elevators in High-Rise Buildings , 1997 .

[20]  Harri Ehtamo,et al.  Optimal control of double-deck elevator group using genetic algorithm , 2003 .

[21]  Harri Ehtamo,et al.  A study on the arrival process of lift passengers in a multi-storey office building , 2012 .

[22]  Matthew Brand,et al.  Marginalizing Out Future Passengers in Group Elevator Control , 2003, UAI.

[23]  Patrice Marcotte,et al.  Two-stage stochastic bilevel programming over a transportation network , 2013 .

[24]  Marja-Liisa Siikonen,et al.  The Elevator Trip Origin-Destination Matrix Estimation Problem , 2015, Transp. Sci..

[25]  Tsutomu Inamoto,et al.  An application of branch-and-bound method to deterministic optimization model of elevator operation problems , 2002, Proceedings of the 41st SICE Annual Conference. SICE 2002..

[26]  Marja-Liisa Siikonen,et al.  PASSENGER TRAFFIC FLOW SIMULATION IN TALL BUILDINGS , 2007 .

[27]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[28]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Vol. II , 1976 .

[29]  Abdel Lisser,et al.  On a stochastic bilevel programming problem , 2012, Networks.

[30]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[31]  Harri Ehtamo,et al.  Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results , 2015, J. Comb. Optim..

[32]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[33]  Ma Yanfang,et al.  Vehicle routing problem with multiple decision-makers for construction material transportation in a fuzzy random environment , 2014 .

[34]  H. P. Galliher,et al.  Dynamics of Two Classes of Continuous-Review Inventory Systems , 1959 .

[35]  A. W. Kemp,et al.  Univariate Discrete Distributions: Johnson/Univariate Discrete Distributions , 2005 .

[36]  Andrew J. Schaefer,et al.  The bilevel knapsack problem with stochastic right-hand sides , 2010, Oper. Res. Lett..