Abstract:
The present invention discloses a method for optimal routing of the elevators in an elevator system in a situation where the supply power received by the system is limited e.g. due to emergency power operation. In the invention, routes are optimized by using a cost function to which has been added a term containing the summed instantaneous power consumed. Power consumption is monitored in real time, and the elevators need a start permission from the control system. A route alternative that exceeds the power limit is penalized in the cost function by a so-called penal term. With the elevator routing obtained as a result, the instantaneous power consumed by the system remains continuously below the set power limit. Some call can thus be postponed to be served later. By the method of the invention, the number of elevators serving passengers in an emergency power situation can be varied dynamically .
Abstract:
An elevator group control method for the allocation of calls, in which the method a given service time of the elevator group is assigned a target value. The service time may be passenger waiting time, call time, traveling time, riding time or an average value of one of these quantities. The method aims at fulfilling the assigned target value in such a way that the energy consumption of the elevator system is minimized. Optimization is implemented using a model of the elevator system, by means of which the desired service time can e predicted. This prediction is utilized in a controller controlling the optimizer. This makes it possible to improve the construction and operation of the controller and optimizer so that the energy consumption of the elevator system can be reduced while the condition regarding the target service time is fulfilled at the same time.
Abstract:
A system for group controlling a plurality of elevators in accordance with group control algorithm including a plurality of parameters. This system includes a means for searching an optimum set. An optimum set means an optimum combination among combinations of parameters to be given to the group control algorithm. A new set is generated by crossing-over or mutation. Superior sets are accumulated in a storage by utilizing the additional registration of excellent sets in a storage and the deletion poor sets therefrom. An optimum set is selected from these superior sets. Therefore, the searching of an optimum set can be done efficiently.
Abstract:
The present disclosure provides a system and a method for controlling motion of a bank of elevators. The method includes accepting current requests for service by the bank of elevators, accepting a partial trajectory of a motion of a person moving in an environment serviced by the bank of elevators, and obtaining a probability of a future elevator request. The method further includes processing the partial trajectory with a neural network trained to estimate a weighted combination of probability density functions that indicates an arrival time distribution of the person, and generating a set of possible future requests jointly representing the probability of the future elevator request and the arrival time distribution. The method further includes optimizing a schedule of the bank of elevators to serve the current requests and the set of possible future requests, and controlling the bank of elevators according to the schedule.
Abstract:
Each of a plurality of cars includes an in-car notification device configured to receive an announcement command from one of the individual car control devices, to thereby execute an announcement of the name of its own car. When an assignment command is received from a group management device, each of a plurality of individual car control devices causes the car to perform a door opening operation after causing the car to arrive at a floor on which a user is to ride in the car, and outputs the announcement command when it is determined after the door opening operation is finished that an elapsed period of time since the reception of the assignment command is equal to or longer than a period of time required for the user to arrive at an elevator landing after registering a destination floor call on the landing operation panel.
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:
The present invention discloses a solution for allocating hall calls in an elevator system, which comprises call input devices for registering hall calls at the floors, a group control system responsive to said hall calls, and a number of elevators controlled by elevator-specific elevator controllers on the basis of commands issued by the group control system. A number of route alternatives are generated on the basis of the calls active, and allocation calculation is decentralized by calculating elevator-specific cost terms associated with the route alternatives in the elevator controllers. The cost terms are returned to the group control system, which allocates the hall calls to the elevators according to the route alternative giving the lowest allocation cost.
Abstract:
A method of allocating calls of a lift installation with at least one lift and at least one car per lift to move passengers in a journey from at least one input floor to at least one destination floor, a system for executing the method and a computer readable memory with instructions for executing the method. The method includes receiving input calls from passengers travelling from an input floor to a destination floor, each call identifying at least one floor as an input floor or a destination floor. A start zone with identified input floors and a destination zone with identified destination floors are determined from the input calls and destination calls. Each identified floor within a corresponding zone is considered using at least one selection criterion and a stopping floor is selected which satisfies the criterion. The car is caused to stop at fewer than all the identified input floors and identified destination floors during the journey.
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.
Abstract:
A solution for the allocation of destination calls in an elevator system includes one or more single-deck elevators and one or more multi-deck elevators, in which system the passenger enters a destination call via a destination call device. The destination call entered by the passenger is received, an elevator type to serve the destination call is selected on the basis of an elevator type selection criterion, and the destination call is allocated to an elevator consistent with the elevator type thus selected.