Traffic-based floor preference for the scheduling of elevators in elevator group control system

Abstract

<p align="JUSTIFY"><span style="font-family: Arial, serif;"><span style="font-size: small;">Modern high-rise buildings require complex yet efficient Elevator Group Control Systems (EGCSs). In vertical transportation through an elevator, a passenger must make a hall call by pressing a landing call button installed at each floor and located near the cars of the elevator group. Conventionally, the EGCS allocates one of the cars for each hall call. Waiting time for the arrival of car and journey time inside a car are two parameters, which provide a suitable measure for quality and efficiency of EGCSs. The proposed system deals with this car-call allocation problem</span></span><span style="color: #505050;"><span style="font-family: Arial, serif;"><span style="font-size: small;">. </span></span></span><span style="font-family: Arial, serif;"><span style="font-size: small;">The proposed work analyzes the generated traffic patterns to dispatch a certain number of cars to certain floors in order to reduce overall wait time of passengers. The proposed algorithm is simulated for high-rise building with 20 floors and provides a better result with the reduced wait time for more number of passengers.</span></span></p>

Vertical Transportation Lift Capacity and Operating Policy Planning for Low-Rise Buildings with Circulatory Passengers

“…Lift scheduling is a stochastic process as there is always uncertainty about the number of passengers waiting for it and the time at which they will press the hall call button. Sale and Prakash (2019) showed that dynamic approach with time based floor preference in even/odd lifts betters existing lift scheduling system by reducing average passenger waiting time and travel time. Shearn (1983) developed dynamic programming algorithm for scheduling the stops of a single lift where the stops were either predefined or depended on the destination stops of the passengers in it.…”