Group control for elevators

Abstract

With this group control the allocation of elevator cabins or cars to existing storey or floor calls should be timewise optimized and newly arriving storey calls should be immediately allocated. A computer device provided for each elevator computates at each landing or storey, irrespective of whether or not there is present a storey or landing call, from the distance between the storey and the cabin position indicated by a selector, the intermediate cabin stops to be expected within this distance and the momentary cabin load a sum proportional to the time losses of waiting passengers. In this way the cabin load prevailing at the computation time point is corrected such that the expected number of passengers entering and exiting the cabin, derived from the previously ascertained number of entering and exiting passengers, is taken into account for the future intermediate cabin stops. Such loss time sum, also referred to as the servicing cost, is stored in a cost storage or memory provided for each elevator and infed to a comparator. During a cost comparison cycle the servicing costs of all elevators are compared with one another, and in an allocation storage of the elevator with the lowest servicing cost there can be stored an allocation instruction which designates that storey or floor to which there can be optimumly allocated the relevant elevator cabin.