Design and implementation of an adaptive dispatching controller for elevator systems during uppeak traffic

Pepyne, D.L.; Cassandras, Christos G.

doi:10.1109/87.709499

Cited by 26 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among optimization methods, a steady-state policy based on queueing theory was developed to minimize the average wait time for up-peak without destination entry information, where the decision variable was the interval between successive elevator releases at the lobby [24], [25]. Passenger arrivals were assumed to follow a Poisson process.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Group Elevator Scheduling With Advance Information for Normal and Emergency Modes

Luh

Xiong

Chang

2008

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Abstract-Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complaints of building tenants. It now has a new significance driven by homeland security concerns. The problem, however, is difficult because of complicated elevator dynamics, uncertain traffic in various patterns, and the combinatorial nature of discrete optimization. With the advent of technologies, one important trend is to use advance information collected from devices such as destination entry, radio frequency identification, and sensor networks to reduce uncertainties and improve efficiency. How to effectively utilize such information remains an open and challenging issue. This paper presents the optimized scheduling of a group of elevators with destination entry and future traffic information for normal operations and coordinated emergency evacuation. Key problem characteristics are abstracted to establish a two-level separable formulation. A decomposition and coordination approach is then developed, where subproblems are solved by ordinal optimization-based local search, and top ranked nodes are selectively optimized by using dynamic programming. The approach is then extended to handle up-peak with little or no future traffic information, elevator parking for low intensity traffic, and coordinated emergency evacuation. Numerical testing results demonstrate near-optimal solution quality, computational efficiency, the value of future traffic information, and the potential of using elevators for emergency evacuation.Note to Practitioners-This paper studies group elevator scheduling with destination entry and future traffic information for normal operations, as well as for coordinated emergency evacuation. By exploiting the separable problem structure, a two-level formulation is established capable of modeling advance information. An approach is then developed by incorporating several innovative ideas into a decomposition and coordination framework, aiming to achieve near-optimal performance. The approach has also been extended for cases with little or no future traffic information and coordinated emergency evacuation. Numerical testing results are encouraging and further improvement is needed to reduce CPU time for online implementation.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…By collecting all the terms related to elevator from (24), the subproblem is obtained as (25) subject to (2) and (3). This subproblem is solved by using the ordinal optimization-based local search as presented in Section IV, where nodes of the search tree are first quickly evaluated and ranked by using the three-passage heuristics.…”

Section: And (3)mentioning

confidence: 99%

Group Elevator Scheduling With Advance Information for Normal and Emergency Modes

Luh

Xiong

Chang

2008

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…However, we find that statechart being a nice model for an elevator. In general, an elevator group may consist of multiple elevators [4,[10][11], each of which has its own car controller while the group controller is to coordinate the behavior of the elevator system. In this paper, however, we focus on a single elevator.…”

Section: Modeling Of Elevation Systemsmentioning

confidence: 99%

Modeling and Control of Elevators by Statecharts

Huang

Chung

Jeng

2004

Asian Journal of Control

View full text Add to dashboard Cite

Statechart has been utilized as a visual formalism for the modeling of complex and interactive systems for its illuminating features on describing properties of causality, concurrency, and synchronization. This paper presents the application of satechart to the modeling, design and implementation of an elevator system, whose system behavior involves aggregating complexity of state descriptions, and imposition of underlying control policy. Based on the operational flow of an elevator, we derive the associated statechart model by looking into the inherent hierarchical structure of the elevator. The advantage of the proposed approach is the clear presentation of system behavior in terms of conditions and events that cause the transitions in system dynamics. Implementation of the controlled elevator based on the modeled statechart is also presented.

show abstract

“…There has been a lot of research on the elevator problem. Most of them only utilize the information until the current time [1][2][3] . In recent years, there has been research on the elevator system taking use of more information.…”

Section: Introductionmentioning

confidence: 99%

Ant Colony Optimization for single car scheduling of elevator systems with full information

Shen

Zhao

2009

2009 4th IEEE Conference on Industrial Electronics and Applications

View full text Add to dashboard Cite

We concentrate on the single car, full information elevator problem. Here "full information" means that the arrival time, the origins and destinations of passengers are all assumed known beforehand. The importance of studying full information problem lies in that we can know the value of the future information and evaluate the existing scheduling methods for the elevator system. We aim to find the best solution of serving the passengers, and the performance is measured by the average service time. The problem is modeled into a graph and our goal is converted to finding a path on the graph corresponding to the best performance. An algorithm of Ant Colony Optimization (ACO) is applied. Different from applying ACO to solve the Traveling Salesman Problem, we have the time factor and the constraints in our problem. The modeling of the problem and the handling of the constraints are the contributions of this paper. Our method is compared with Branch and Bound method (BB) which can obtain the optimal solution and a popular heuristic rule in the literature named selective collective operation. The results of our ACO on small scale problems are very near to optimal, and for middle and large scale problems, our results are much better than the selective collective operation. These results show the effectiveness of our ACO.

show abstract

Design and implementation of an adaptive dispatching controller for elevator systems during uppeak traffic

Cited by 26 publications

References 15 publications

Group Elevator Scheduling With Advance Information for Normal and Emergency Modes

Group Elevator Scheduling With Advance Information for Normal and Emergency Modes

Modeling and Control of Elevators by Statecharts

Ant Colony Optimization for single car scheduling of elevator systems with full information

Contact Info

Product

Resources

About