| 摘要 |
An elevator group control assigns a floor call, which is to be assigned to a car for the first time, immediately and finally after its input. The operating costs corresponding to the waiting times of passengers are computed merely for the input floor and the destination floor of the new call from data specific to each of the elevators and these costs are transferred into a cost register for all the elevators immediately after the input of the call. Thereafter, the comparison of these operating costs takes place at once, wherein the call is finally assigned to the elevator with the smallest operating costs. The operating costs computation extends over all traffic participants situated in the cars and at the floors, wherein the computer utilizes a traveling time table, in which the traveling times between each floor and every other floor are stored. The door opening and closing times of the elevator concerned are stored in a door time table, which times the computer utilizes for the computation of the stopping time of the car. By computing the operating costs in this manner, better comparison results are achieved and exact data on the actual waiting times of all traffic participants is available.
|
