Calculation of the elevator round-trip time under destination group control using offline batch allocations and real-time allocations

Abstract

The use of Destination Group Control (DGC), or Hall Call Allocation (HCA), in elevator traffic system group control is the current trend in intelligent and advanced supervisory control and is expected to dominate the market in the future. In the conventional elevator traffic design process, designers usually start with a simple calculation in order to obtain a conceptual estimate of the suggested design prior to moving onto simulation. But due to the lack of a suitable set of equations for elevator traffic calculation for DGC systems, designers are forced to carry out the elevator traffic design process for a system controlled by DGC solely by using simulation. Due to the dependence on the simulator and the algorithms it uses, different simulation packages will produce different resultant designs. Thus, the motivation for this paper is to use calculation in order to achieve more transparency and repeatability in the design of DGC systems.In order to enable the designer to carry out a calculation for the DGC system, equations are needed to evaluate the values of H (the highest reversal floor) and S (the expected number of stops in a round trip) in order to evaluate the value of the round-trip time under destination group control. Although equations are available to compute the highest reversal floor, H, and expected number of stops, S, of a DGC system, these equations assume idealized conditions. If designers use them to design the elevator traffic system, the design will be under-sized and inadequate. They do not take into consideration many of the practical implementation issues and non-ideal conditions such as: unequal floor population, real time call allocation of calls to elevator cars, and the different floor to sector arrangements, as well as the practicalities of allocating elevator cars to sectors.In this paper, more detailed consideration is given to the estimation of H and S under both offline and real-time call allocations. Three methods of sectoring are suggested to take care of different combinations of the number of floors, the number of elevators, the car capacity and the floor population distribution. The results of this research would help the designer carry out a more reasonable and practical calculation of the round-trip time under DGC and thus arrive at a transparent and repeatable elevator traffic design.The designer is still expected to move onto a simulation phase in order to understand the effect of the group controller on the system performance.

Probability-Based City-Scale Risk Assessment of Passengers Trapped in Elevators under Earthquakes

“…For example, the bottom floors of a high-rise building may be used for commercial activities, whereas the remaining floors are for residential purposes. The spatial variations in building occupancy will significantly affect the distribution pattern of elevator passengers on different stories [26]. (c) Furthermore, the elevator traffic data of a specific building may be affected by the weather and season.…”

Investigation of Optimization Techniques on the Elevator Dispatching Problem

“…The number of the elevators are sequenced to the virtual sectors in the building to equalize the handling capacities of the sectors. [4] An EGCS is one of the important matters in vertical transportation systems in buildings, it is required to tackle some optimization problems. It dispatches the elevators under its control to perform each passenger's call.…”

“…For the studied case implemented on the PSO, the simulations best solution (route to be taken) is[4,20,18,13,11,10,12,8,1,16,0,2,3,19,5,17,15,14,6,9,7]. The average journey time of the optimized solution is approximately 553.3 seconds.For the studied case implemented on the WOA, the simulations best solution (route to be taken) is[4,5,9,10,16,18,12,1,13,2,14,19,6,20,17,3,8,15,11,7,0]. The average journey time of the optimized solution is approximately 541.3 seconds.…”

A Real-Time Matrix Iterative Optimization Algorithm of Booking Elevator Group and Numerical Simulation Formed by Multi-Sensor Combination

“…Another elevator scheduling algorithm can be combined with the Monte Carlo method for simulation. For the DGC (Destination Group Control) system, the value of the elevator round trip time can be calculated under destination group control using (the highest reversal floor) and S (the expected number of stops in a round trip) [11]. In literature [12], with the help of order statistics, round-trip time estimation of the 2D or 3D system analytically estimated, this method can also be verified by Monte Carlo simulation.…”

“…up . The remaining tasks will be assigned to Elevator-B, and the entering matrix of elevator B is M B 1 in , the internal data vectorization is expressed as: (4,8,2, 1); (6,9,2,1); (7,11,2,2).…”