Method for allocating and serving destination calls in an elevator group

Abstract

The invention relates to a method for handling destination calls in an elevator group comprising several elevators using destination call control, which method comprises an allocation procedure for situations where the calls can't be served by all elevators of the elevator group in one round trip, in which situation "n" open calls and "m" fixed calls are present, which fixed calls are already allocated but not served, in which allocation procedure a genetic algorithm (GA) is used in which the following succession of steps is performed: a) chromosomes comprising genes are formed, in which chromosomes: - n first genes comprise a correlation of each open call and a corresponding elevator, - n second genes comprise a correlation of each open call and the corresponding number of the round trip in which the open call will be served, and - m third genes comprise a correlation of each fixed call and the corresponding number of the round trip in which the fixed call will be served, b) for each chromosome round trips are calculated for each elevator of the elevator group according to collective control, c) the round trips of all elevators calculated in step b) are evaluated according to known optimization criteria, as e.g. passenger riding time, passenger waiting time, energy consumption, minimum number of round trips etc., d) chromosomes which are evaluated in step c) as sufficient are put forward to the forming of a new generation by per se known GA methods, as e.g. cross-breeding, mutation, etc., e) the steps b) to d) are repeated for each chromosome of each new generation of chromosomes until a stop criterion is achieved, f) the calls are served in collective control according to the best chromosome of the last generation, and g) the destinations of each elevator in its travelling direction in the current round trip according to the best chromosome are shown on a at least one common display shortly before its arrival at said landing. The invention solves the elevator dispatching problem under consideration of more than the current round trip of the elevators in the elevator group.

Description

technical field [0001] The invention relates to a method for allocating and servicing destination calls in an elevator group comprising several elevators using destination call control. Background technique [0002] Usually, in destination call control, immediate call distribution is used, which means that the number of assigned elevators to be boarded is indicated to the passenger immediately after the call has been placed at the destination operating panel (DOP). The present invention now relates to a method for allocating and servicing a destination call when a call placed to an elevator group cannot be served by all elevators in the elevator group in one round trip. By the term "all" elevators, it is indicated all active elevators participating in call distribution, ie all elevators available to serve destination calls. The problem of assigning non-fixed destination calls to elevators and designing corresponding service routes is known as the elevator dispatch problem (...

AI Technical Summary

Problems solved by technology

This frustrates the passenger as he cannot even enter his destination call into the system

Images