Abstract
In the static elevator dispatching problem the aim is to design a route for each capacitated elevator to satisfy a set of transportation requests such that a cost function is minimized while satisfying a number of constraints. This problem is a crucial part in the control of an elevator group. So far, the problem has been formulated in various algorithmic-dependent forms, where part of the constraints have been given only verbally. In this paper we present a mixed-integer linear programming formulation of the problem where all constraints are given in explicit mathematical form. This allows, e.g., polyhedral analysis of the problem. We also present some new valid inequalities to strengthen the formulation. Furthermore, we study the polyhedral structure of the problem in a generic case arising in the down-peak traffic pattern. In particular, we show which equalities define a minimal equality system for the polytope of the problem, which is defined as the convex hull of the feasible solutions. In addition, we provide the dimension of the polytope and analyze which valid inequalities derived are facet inducing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Archetti C, Savelsbergh MWP, Speranza MG (2008) To split or not to split: that is the question. Transp Res Part E 44:114–123
Ascheuer N, Fischetti M, Grötschel M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2):69–79
Balas E, Fischetti M, Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope. Math Program 68:241–265
Carrabs F, Cerulli R, Cordeau JF (2007) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading. Inf Syst Oper Res 45:223–238
Dantzig GB, Fulkerson DR, Johnson SM (1954) Solution of a large scale traveling salesman problem. Oper Res 2:393–410
Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342–354
Hiller B (2009) Online optimization: probabilistic analysis and algorithm engineering. PhD thesis, TU Berlin
Hiller B, Tuchscherer A (2008) Real-time destination-call elevator group control on embedded microcontrollers. In: Kalcsics J, Nickel S (eds) Operations research proceedings, pp 357–362
Hirasawa K, Eguchi T, Zhou J, Yu L, Hu J, Markon S (2008) A double-deck elevator group supervisory control system using genetic network programming. IEEE Trans Syst Man Cybern C Appl Rev 38(4):535–550
Ho M, Robertson B (1994) Elevator group supervisory control using fuzzy logic. In: Conference proceedings on electrical and computer engineering, pp 825–828
Ikeda K, Suzuki H, Markon S, Kita H (2006) Evolutionary optimization of a controller for multi-car elevators. In: IEEE international conference on industrial technology. ICIT 2006, pp 2474–2479
Inamoto T, Tamaki H, Murao H, Kitamura S (2003) Deterministic optimization model of elevetor operation problems and an application of branch-and-bound method. IEEJ Trans Electron Inf Syst 123:1334–1340
Koehler J, Ottiger D (2002) An AI-based approach to destination control in elevators. AI Mag 23:59–78
Levy D, Yadin M, Alexandrovits A (1977) Optimal control of elevators. Int J Syst Sci 8(3):310–320
Liu J, Liu Y (2007) Ant colony algorithm and fuzzy neural network-based intelligent dispatching algorithm of an elevator group control system. In: IEEE international conference on control and automation. ICCA 2007, pp 2306–2310
Luh PB, Xiong B, Chang SC (2008) Group elevator scheduling with advance information for normal and emergency modes. IEEE Trans Autom Sci Eng 5(2):245–258
Markon S, Kise H, Kita H, Bartz-Beielstein T (2006) Elevator group control by neural networks and stochastic approximation. In: Control of traffic systems in buildings. Springer, London, pp 163–186
Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 53–81
Pepyne D, Cassandras C (1997) Optimal dispatching control for elevator systems during uppeak traffic. IEEE Trans Control Syst Technol 5(6):629–643
Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43:267–286
Roschier NR, Kaakinen M (1979) New formulae for elevator round trip calculation. Supplement to Elevator World of ACIST Members, pp 189–197
Ruland KS, Rodin EY (1997) The pickup and delivery problem: faces and branch-and-cut algorithm. Comput Math Appl 33(12):1–13
Schröder J (1990) Advanced dispatching. Elevator World 40
Siikonen ML (1997) Elevator group control with artificial intelligence. Technical Report Systems Analysis Laboratory A67. Helsinki University of Technology
Sorsa J, Siikonen ML, Ehtamo H (2003) Optimal control of double-deck elevator group using genetic algorithm. Int Trans Oper Res 10:103–114
Tanaka S, Uraguchi Y, Araki M (2005a) Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: part I formulation and simulations. Eur J Oper Res 167:550–573
Tanaka S, Uraguchi Y, Araki M (2005b) Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: part II the solution algorithm. Eur J Oper Res 167:574–587
Tyni T, Ylinen J (2001) Genetic algorithms in elevator car routing problem. In: Spector L et al (eds) Proceedings of the genetic and evolutionary conference (GECCO-2001). Morgan Kaufman Publishers, San Francisco, pp 1413–1422
van Eijl C (1995) A polyhedral approach to the delivery man problem. Technical Report Memorandum COSOR. Eindhoven University of Technology, The Netherlands, pp 95–19
Yu L, Mabu S, Zhang T, Eto S, Hirasawa K (2009) Multi-car elevator group supervisory control system using genetic network programming. In: IEEE congress on evolutionary computation. CEC ’09, pp 2188–2193
Yu L, Mabu S, Hirasawa K (2010) Multi-car elevator system using genetic network programming for high-rise building. In: IEEE international conference on systems man and cybernetics (SMC), pp 1216–1222
Acknowledgments
This work was supported by the Research Foundation of Helsinki University of Technology. Some results were obtained by the help of Kimmo Berg. These supports are gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ruokokoski, M., Ehtamo, H. & Pardalos, P.M. Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results. J Comb Optim 29, 750–780 (2015). https://doi.org/10.1007/s10878-013-9620-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9620-1