Elevator – industrial lift truck – or stationary lift for vehicle – With call registration means – Shared by plural load supports
Patent
1997-10-21
1999-08-03
Nappi, Robert E.
Elevator, industrial lift truck, or stationary lift for vehicle
With call registration means
Shared by plural load supports
187380, 187247, 706 13, 706910, B66B 118
Patent
active
059328525
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a procedure for allocating the calls entered via landing call devices so that all calls will be served.
2. Description of Related Art
When a passenger wants to take an elevator from one floor of a building to another floor, he/she calls an elevator by pressing a landing call button mounted on their floor. The elevator control system receives the call and tries to determine which one of the elevators in the elevator bank will be best to serve the call. This operation is referred to as call allocation. The problem to be solved by allocation is to determining which one of the plurality of elevators will minimize a specified cost function. Allocation may involve minimizing passengers' waiting time, passengers' travelling time, the number of stoppages of the elevator or a combination of several cost factors of varying weight.
Conventionally, to establish which one of the elevators will be suited to serve a call, allocation is performed individually in each case by using complex condition structures. The ultimate aim of this operation is to minimize a cost factor describing the operation of the elevator group, typically the average waiting time for passengers. Since the elevator group has a complex variety of possible states, the condition structures are also complex and often have gaps. This leads to situations in which the control does not work in the best possible way. A typical example of this is the conventional collective control, in which each landing call is allocated to the one of the elevators which is currently closest to and moving toward the calling floor. However, this simple optimizing principle leads to an aggregation of the elevators, with the result being that the elevators travel together in the same direction, thereby deteriorating the performance of the elevator group as a whole.
When attempting to determine the cost factors of all possible alternative routes, the calculation load required may easily exceed the capacity of the processors. If the number of calls to be served is C and the building has L elevators, then the number of different alternative routes will be N=L.sup.C. As the number of alternative routes increases exponentially with the number of calls, it will be impossible, even in small elevator groups, to systematically analyze all the alternatives. This has limited the application of route optimization in practice.
SUMMARY OF THE INVENTION
The object of the present invention is to achieve a new solution for allocating landing calls for the elevators in an elevator group, using a relatively low computing capacity while still achieving superior results than previous solutions and at the same time taking different alternatives sufficiently into account. The procedure present allocation scheme creates several allocation options, each of which contains for each active landing call a call data item and an elevator data item. Theses data items together define the elevator to serve the landing call. A value of a cost function is calculated for each allocation option and one or more of the allocation options are repeatedly changed with respect to at least one of the data items. The values of the cost functions of the new allocation options are calculated and the best allocation option is selected based on the values of the cost functions so as to allocate the active elevator calls accordingly to the elevators in the elevator group.
The solution of the invention substantially reduces the computational complexity as compared with calculating all possible route alternatives. The solution is based on a genetic algorithm and is applicable in a decentralized environment when the computing tasks are executed simultaneously, several elevator control computers being used to perform part of the calculations in parallel with a group control computer.
The elevator group is treated as an entity, optimizing the cost function at the level of the elevator group as a whole. The problem of allocating landing calls
REFERENCES:
patent: 4935877 (1990-06-01), Koza
patent: 5239141 (1993-08-01), Tobita et al.
patent: 5394509 (1995-02-01), Winston
patent: 5612519 (1997-03-01), Chenais
patent: 5767461 (1998-06-01), Nakagawa et al.
patent: 5780789 (1998-07-01), Tsji
L. Davis, Handbook of Genetic Algorithmms, Chapters 1-5 and 21, 1991.
Tyni Tapio
Ylinen Jari
Kone OY
Nappi Robert E.
LandOfFree
Method and apparatus for allocating landing calls in an elevator does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for allocating landing calls in an elevator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for allocating landing calls in an elevator will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-851613