Abstract:
The invention relates to a method for allocating elevators of an elevator group to landing calls given in the elevator group, the elevator group having a control unit (32) having a destination call control (36), which elevator control unit is connected to determining means (37) for the prevailing traffic condition in the elevator group. Further the control unit comprises at least a first and second operating mode which are selected according to the prevailing traffic condition, wherein the first operating mode uses immediate call allocation of the elevators which includes the display of the allocated elevator on a destination operating panel (10) immediately after having issued a landing call and wherein the second mode comprises the allocation of an elevator to a landing call before the arrival of the allocated elevator call to the landing where the landing call has been issued. The invention allows an adaption of destination control to different traffic situations.
Abstract:
A plurality of floors served by elevator cars are scanned by direction to detect car positions and hall calls. For each of the cars, a predetermined number is counted up for each scan slot after detection of a car position to determine the service load of each car to be borne before arrival at each floor. When a hall call is detected by scanning, a car with minimum service load in the related slot is selected and the hall call is allotted to that car. When the failure of a car to run to an end floor is predicted in counting the service load of the car, switch is made to count down in response to directional reversal when the scanning has reached the end floor. At the time of subsequent detection of an allotted hall call by scanning, switching is again made to count up, thus determining a proper service load of the cars.
Abstract:
A system 110 includes an input/output 113 unit for receiving a user request to call an elevator 101, 102 and a processor 111 for processing the user request to assign an elevator to the user 105. The processor performs one of a first assignment process and a second assignment process. The first assignment process includes determining whether a delay condition exists for delaying assignment of the elevator to the user 202, delaying assignment of the elevator to the user based on determining that the delay condition exists 203, and assigning the elevator to the user based on determining that the delay condition does not exist 204. The second assignment process includes assigning the elevator to the user and notifying the user of the assignment, determining whether an assignment change condition exists 206, changing the assignment to another elevator based on determining that the assignment change condition exists 207, and notifying the user of the assignment change 208.
Abstract:
There is provided an elevator group control system, in which even after an assigned car has been determined, the assigned car can be changed as necessary, and therefore comfortable service can be offered to a user. This group control system includes a call registration device by the use of which a user registers a hall destination call before getting into a car, a car position detection part for detecting the car position of each elevator, and a call registration storage part for storing, for each elevator, a hall destination call having been registered. When a hall destination call having the same contents as those of an already registered hall destination call stored in the call registration storage part is registered newly from the call registration device, if a non-assigned car has already arrived at the floor on which the call registration device is installed, the newly registered hall destination call is assigned to the non-assigned car.
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, andg) 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.
Abstract:
A method schedules elevator cars in a group elevator system in a building by first generating a set of probability distributions for arrivals of future passengers at any floor of the building, wherein the set of probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of service requests by the future passengers and a probability of possible times of the service requests. A schedule for the elevator cars is based on the set of probabilistic distribution. Then, the schedule is provided to a controller of the group elevator system to move the elevator cars according to the schedule.
Abstract:
An elevator group management system improving operational efficiency in consideration of a situation change that has occurred after a destination floor registration in a hall. An assigned car review mechanism executes assigned car review processing in units of review registration information sets each including at least one piece of provisionally assigned car registration information managed by a registered destination floor hall call management section during a review period. After ending the assigned car review processing, the assigned car review mechanism modifies the contents of the provisionally assigned car registration information in the registered destination floor hall call management section based on the contents of the review registration information set after modification. That is, the assigned car review mechanism newly registers the provisionally assigned car registration information after review and erases the provisionally assigned car registration information before review at the same time.