By Topic

Optimization of Group Elevator Scheduling With Advance Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jin Sun ; Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs Mansfield, CT, USA ; Qian-Chuan Zhao ; Luh, P.B.

Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improve elevator systems is to collect advance traffic information. Nevertheless, it remains a challenge to develop new scheduling methods which can effectively utilize such information. This paper is to solve the group elevator scheduling problem with advance traffic information. This problem is difficult due to various traffic patterns, complicated car dynamics, and combinatorial explosion of the search space. A two-level formulation is developed with passenger-to-car assignment at the high-level and single car dispatching that is innovatively formulated as passenger-to-trip assignment at the low-level. Detailed car dynamics are embedded in simulation models for performance evaluation. Taking advantage of advance information, a new door action control method is suggested to increase the flexibility of elevators. In view of the hierarchical problem structure, a two-level optimization framework is established. Key problem characteristics are exploited to develop an effective trip-based heuristic for single car dispatching, and a hybrid nested partitions and genetic algorithm method for passenger-to-car assignment which can be extended to solve a generic class of sequential decision problems. Numerical results demonstrate solution quality, computational efficiency, benefit of advance information and the new door action control method, and values of new features in our hybrid method.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:7 ,  Issue: 2 )