Patent Application
20090032339
The present invention relates to an elevator group management control device for efficiently operating a plurality of elevators.
In the case where a plurality of elevators are operated within a building, group management control operation is normally carried out. A group management control device operates an elevator group which is under control of the group management control device in an organic manner so as to reduce waiting time. One of the purposes of employing his group management control device is to save energy.
In a conventional elevator group management control device, the number of calls acceptable is previously set for each floor, and when the number of hall calls registered at a certain floor is equal to or larger than the number of calls acceptable, assignment of an elevator to the floor is restricted (refer to, or example, Patent Document 1). As a consequence, use of the elevators is restricted so as to reduce energy consumption.
There is also another conventional elevator group management control device, in which: in a waiting control operation during off-peak operation, hail call occurrence probability of respective floors is estimated; when plural floors have the hall call occurrence probability limited within a predetermined range, a floor located near an available elevator among the plural floors is defined as a waiting floor assuming priority (refer to, for example, Patent Document 2). As a result, travel distances of the elevators to reach the waiting floor are reduced, as compared with that of the waiting floor fixed system, to thereby improve energy saving effects.
There is further another conventional elevator group management control device, in which an estimated value of energy required by each of the cars for reaching a target floor is calculated, an evaluation value calculated from this estimated value of energy is added to an evaluation value for determining a car to assigned with respect to a new hall call, to thereby achieve energy saving effects (refer to, for example, Patent Document 3).
Patent Document 1: JP 200′-67129 A
Patent Document 2: JP 10-36019 A
Patent Document 3: WO05/009880
However, in the above-explained conventional elevator group management control device, in such a case that the number of hall calls generated exceeds the preset number of car calls acceptable, passengers cannot get in an elevator at the floor. Therefore, there is a problem in that these passengers may feel very inconvenient. Also, when the number of hall calls generated is smaller than the preset number of car calls acceptable, the completely same effect as that of the normal elevator control operation is obtained. As a result, there is such a problem that the energy saving effect can be hardly expected.
Also, in the above-explained conventional elevator group management control device, although the effect of reducing the travel distances is achieved, the waiting control operation is rarely carried out, and further, the travel distances to the waiting floor are not so long. As a result, there is another problem in that the energy saving effect that can be achieved as a whole is very little.
Moreover, in the above-explained conventional elevator group management control device, the energy saving effect can be achieved while the call assigning operation is performed. However, if the evaluation with respect to this energy saving effect is increased, there is such a risk that the transportation efficiency is deteriorated, namely, the waiting time is increased, resulting in another problem.
The present invention has been made to solve the above explained problems, and therefore, it is an object of the invention to provide an elevator group management control device capable of operating a plurality of elevators in an organic manner, and thus, capable of achieving an energy saving effect without increasing waiting times.
The present invention provides an elevator group management control device for efficiently operating a plurality of elevators, including estimation calculating means for predicting an arrival time by which each car of the elevators can arrive from a present position to a floor where a hall call is generated; travel distance estimating means for estimating a travel distance for each car over which the car travels from the present positions respectively to stop in response to every car call that is to be handled by the car; evaluation calculating means for calculating a waiting time with respect to the hall call based upon the arrival time predicted by the estimation calculating means, for performing a waiting time evaluating calculation by employing a first evaluation function while the waiting time is employed as an evaluation index and also for performing a travel distance evaluating calculation by employing a second evaluation function while the travel distance estimated by the travel distance estimating means is employed as an evaluation index; and assigning means for performing a calculation of an integral evaluation function which contains at least the waiting time evaluation and the travel distance evaluation as to each of the cars, and for assigning a car whose integral evaluation function value is minimum with respect to the hall call.
The elevator group management control device according to the present invention is provided with the means for determining a car to be assigned. That is, in such a case that a hall call is generated in a building where a plurality of elevators are operated, the above-explained means determines the car to be assigned by evaluating a total travel distance when at least the respective cars are assigned to this hall call. As a consequence, such an effect can be achieved that the travel distances of the respective elevators can be reduced, and the energy saving effect can be achieved without increasing the waiting time.
Embodiment 1 and Embodiment 2 of the present invention will now be explained. It should be understood that the same reference numerals shown in the respective drawings are employed as those for denoting the same, or similar structural elements.
An elevator group management control device according to Embodiment 1 of the present invention will now be explained with reference to
In
Also, the group management control device 100 includes communication means 11, estimation calculating means 12, travel distance estimating means 13, evaluation calculating means 14, assigning means 15 and operation control means 16. The respective means 11 to 16 are constructed by software on a microcomputer.
The communication means 11 communicates information with respect to the each car control apparatuses 20, and the like. The estimation calculating means 12 performs a prediction calculation as to for example, how many seconds it takes for each of elevators to reach each of floors. The travel distance estimating means 13 estimates a travel distance until each of the elevators stops in response to all of elevator calls assigned thereto. The evaluation calculation means 14 calculates various sorts of evaluation items such as waiting time evaluation and travel distance evaluation based upon calculation results of the estimation calculating means 12 and the travel distance estimating means 13. The assigning means 15 performs integral evaluation based upon the evaluation calculation result of the evaluation calculating means 14 to assign a proper elevator (i.e., car) with respect to a new hall call. The operation control means 16 controls operation of each of the elevators according to an assigned result.
Next, operations of the elevator group management control device according to Embodiment 1 will now be described with reference to drawings.
First, when a hall call is newly registered in a step S100, the estimation calculating means 12 performs a prediction calculation with respect to each of the cars in a step S101. This prediction calculation includes arrival time prediction predicting, for example, how many seconds it takes for each of the cars to arrive at each floor, passenger number prediction on each floor, and in-car passenger number prediction made in connection with the above-mentioned passenger number prediction, while the prediction calculation is realized by, for instance, the method described in JP-A 54-102745. Since the prediction calculation has been so far widely employed in elevator group management systems, detailed explanations thereof are omitted.
Next, in a step S102, the travel distance estimating means 13 performs a prediction calculation of a travel distance. The prediction calculation of the travel distance will now be explained with reference to
In the opposite case with respect to the above-mentioned case in terms of travel direction of car etc., the travel distance estimation is made as described below. That is, in such a case that while the car travels from the lowermost floor (i.e., first floor) in an ascent direction, the car owns a car call at the uppermost floor (i.e., 10th floor) and an ascent hall call at an intermediate floor (i.e., 6th floor) between the lowermost floor and the uppermost floor, the travel distance estimating means 13 estimates a distance measured from the lowermost floor to the uppermost floor as the travel distance of the car.
In
Also, as the simplest method, such a method for predicting a just center floor between the uppermost floor and the get-in floor to be a prediction floor may be conceived
In the opposite case with respect to the above case in terms of travel direction of car etc., travel distance estimation is made as described below. That is, in such a case that while the car 30 travels from the lowermost floor (i.e., first floor) in an ascent direction, the car 30 owns a car call at the uppermost floor (i.e., 10th floor) and a descent hall call is generated at an intermediate floor (i.e., 6th floor) between the lowermost floor and the uppermost floor, the travel distance estimating means 13 predicts the destination floor as to the descent hall call, and also estimates a distance measured from the lowermost floor via the uppermost floor to the destination floor as the travel distance of the car.
Furthermore, in the case where the travel distance predicting means 13 predicts the destination floor as to the descent hall call, the travel distance estimating means 13 adds get-off probability of each floor from the lowermost floor up to the intermediate floor to each other, and then predicts such a floor that the added get-off probability becomes 50% to be the destination floor. Otherwise, the travel distance estimating means 13 predicts an intermediate floor between the lowermost floor and the intermediate floor to be the destination floor.
The predict on calculation of the step S101 and the travel distance estimation of the step S102 are carried out in such a case that a new hall call is provisionally assigned for every car, and also, in the case where the new hall call is not provisionally assigned for every car, and in order to represent this process operation, a return line is drawn from an exit of the step S102 to an entrance of the step S101.
Also, in a step S103, the evaluation calculating means 14 performs evaluation calculations of various sorts of evaluation indexes such as a waiting time and a travel distance based upon results of the prediction calculation executed in the steps S101 and S102. For instance, in the example shown in
It should also be noted that the above-mentioned procedures from the steps S101 to S103 are carried out with respect to each of the cars. In other words, the procedures from the prediction calculation to the evaluation calculation are carried out for each of these cars. In order to represent the procedures, a return line is drawn from the exit of the step S303 to the entrance of the step S101. Furthermore, as previously explained, the procedures of the step S101 and the step S102 are executed in both cases that the new hall call is assigned to each of the cars, and is not assigned thereto.
When the calculations of the various sorts of evaluation values are accomplished in the above-mentioned manner, the assigning means 15 performs integral evaluation of each of the cars in a step S104. As the method for the evaluation, for instance, the below-mentioned integral evaluation function “J(i)” is employed.
J(i)+w1E1(i)+w2E2(i)+w3E3(i)+w4E4(i) (1)
where:
symbols W1, W2, W3, and W4 each denote weight;
symbol E1(i) denotes a sum of waiting time evaluation with respect to each of car calls under execution in the case where a car “i” is assigned to a new hall call;
symbol E2(i) denotes a sum of mis-forecast probability evaluation with respect to each of car calls under execution in the case where the car “i” is assigned to a new hall call; symbol E3(i) denotes a sum of full-car probability evaluation with respect to each of car calls under execution in the case where the car “i” is assigned to a new hall call; and symbol E4(i) denotes a sum of travel distance evaluation with respect to each of car calls in the case where the car “i” is assigned to a new hall call.
Next, in a step S105, the assigning means 15 determines such a car that the value of the integral function “J(i)” calculated in the above-explained step S104 becomes optimal, namely a minimum value as the assigned car.
Then, in a step S106, the operation control means 16 outputs an assignment instruction to the assigned car via the communication means 11 and the each car control apparatuses 20.
As previously explained, in accordance with Embodiment the travel distances of the elevators can be reduced. As a result, it is apparent that the energy saving effect can be achieved. Also, as an indirect effect, useless travels of the respective elevators can be reduced, so the waiting time can be improved.
An elevator group management control device according to Embodiment 2 of the present invention will now be explained with reference to
In
Also the group management control device 100 includes communication means 11, estimation calculating means 12, evaluation calculating means 14, assigning means 15, operation control means 16, and candidate car selecting means 17. The respective means 11, 12 and 14 to 17 are constructed by software on a microcomputer.
The communication means 11 communicates information with respect to the each car control apparatuses 20, and the like. The estimation calculating means 12 performs a prediction calculation as to, for example, how many seconds it takes for each of elevators to reach each of floors. The candidate car selecting means 17 selects an assigned candidate car with respect to a new hall call according to positions and directions of the respective elevators, all of acceptable car calls, and the new hall call. The evaluation calculation means 14 calculates various sorts of evaluation items such as waiting time evaluation based upon calculation results of the estimation calculating means 12 with respect to the candidate car selected by the candidate car selecting means 17. The assigning means 15 performs integral evaluation based upon the evaluation calculation result of the evaluation calculating means 14 to assign a proper elevator (car) with respect to a new hall call. The operation control means 16 controls operations of each of elevators in response to an assigned result.
Next, operations of the elevator group management control device according to Embodiment 2 will now be described with reference to drawings.
First, when a hall call is newly registered in a step S200, the estimation calculating means 12 performs a prediction calculation with respect to each of the cars in a step S201. The prediction calculation is equivalent to the procedure of the step S101 of
Next, in a step S202, the candidate car selecting means 17 selects a candidate car which is assigned with respect to the new hall call. This procedure will now be explained by employing an example of
In an example of
In this example, the car operated under such the status is selected as the assigned candidate in a top priority to reduce the travel distance. As a concrete method for this purpose, for example, the below-mentioned first rule is employed:
IF ((car which owns car call at such a floor that new hall call is generated) or (car to which new hall call is assigned at own floor)), or ((car which is traveling, or is scheduled to travel in the same direction as new hall call) and (car which owns only one car call in the same direction and forward direction as those of new hall call)), THEN (relevant car is defined as assigned candidate car).
A front half portion and a rear half portion of a first “or” condition within the above-explained rule can clarify that a sum of the travel distances as to all of the cars becomes short if the following assigning case is conducted, as apparent from examples shown in
Also, a front half portion of “and” condition indicates such a case which corresponds to
Also, in the same meaning, the below-mentioned second rule may be employed in which the rear half portion of the “and” condition is changed:
IF ((car which owns car call at such a floor that new hall call is generated), or (car to which new hall call is assigned at own floor)), or ((car which is traveling, or is scheduled to travel in same direction as new hall call) and (car which does not generate long wait status even when new hall call is assigned)),
THEN (relevant car is defined as assigned candidate car).
In the step S202, a selection is made of an assigned candidate car with respect to the new hall call by employing the above-explained first rule and second rule. It should be understood that there are some possibilities that such a car capable of satisfying the above-mentioned first rule and second rule is not present in a certain case. In this case, all of the cars are newly selected as the candidate cars. Even in such a case, the assigned car may be determined in accordance with at least the same procedure as the conventional determining procedure.
Also, in a step S203, various sorts of evaluation values similar to those of the step S103 shown in
Next, in a step S204, the assigning means 15 performs integral evaluation with respect to each of the cars selected as the candidate car by employing, for example, an integral evaluation function “J(i)” represented in the below-mentioned formula (2):
J(i)=w1E1(i)+w2E2(i)+w3E3(i) (2)
where:
symbols W1, W2, and W3 each denote weight;
symbol E1(i) denotes a sum of waiting time evaluation with respect to each of car calls under execution in the case where a car “i” is assigned to a new hall call;
symbol E2(i) denotes a sum of mis-forecast probability evaluation with respect to each of car calls under execution in the case where the car “i” is assigned to a new hall call; and
symbol E3(i) denotes a sum of full-car probability evaluation with respect to each of car calls under execution in the case where the car “i” is assigned to a new hall call.
The above-mentioned formula (2) is equivalent to the formula (1) except that the evaluation item related to the travel distance is omitted.
Next, in a step S205, such a car is determined that the value of the integral function “J(i)” calculated in the above-explained step S204 becomes optimal, namely a minimum value as the assigned car. In a step 206 an assignment instruction is performed with respect to the assigned car.
In accordance with Embodiment 2, there is provided an assigning means for assigning such an elevator, at a top priority, which is raveling in the same direction as that of a new hall call in the building where a plurality of elevators are operated, in such a case that a hall call is generated. As a result, the travel distances of the respective elevators can be reduced, and the energy saving effect can be achieved without increasing the waiting time. Also, there is provided an assigning means for assigning such an elevator, at a top priority, which is traveling in the same direction as that of a new hall call in such a case that a hall call is issued without generating long waiting status even when a new hall call is assigned to an elevator. As a result, while the transportation efficiency is maintained, the travel distances of the respective elevators can be reduced, and the energy saving effect can be achieved without increasing the waiting time. Further, there is provided an assigning means for assigning such an elevator, at a top priority, which is traveling in the same direction as that of a new hall call, while the scheduled number of stop mimes is smaller than the predetermined number in the case where a hall call is generated. As a consequence, while the transportation efficiency is maintained, the travel distances of the respective elevators can be reduced, and the energy saving effect can be achieved without increasing the waiting time.
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/JP05/19675 | 10/26/2005 | WO | 00 | 2/21/2007 |
