JPH11322205A - Group supervisory control system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve waiting time of elevator service and provide efficient operating allocation for an elevator. SOLUTION: This group supervisory control system controls at least the nearest one of a plurality of elevator cars with priority by operating a plurality of hall buttons fitted on the same floor, and selecting the nearest elevator to the operated hall call button with priority, wherein the estimated vertical arrival waiting time TV of respective elevators in response to a call from the originated hall and the estimated horizontal moving time TH are computed (S2), (S3), the waiting time and the estimated moving time are compared with each other for selecting the larger one as an general evaluation ϕ(k) (S4). The process is applied to all the elevators for selecting an elevator with minimum one of all general evaluations (S6), thus it is possible to allocate the elevator to the call from its originated hall (S7).

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an elevator group management control method and, more particularly, to a technique for preventing a driver from missing a ride due to passage of an elevator and reducing a long waiting time of the elevator.

[0002]

2. Description of the Related Art Conventionally, in a group control elevator,
For example, JP-A-60-56784 and JP-A-6-29
As disclosed in Japanese Patent No. 8466, the call reservation registration of the hall button of the elevator is performed in such a manner that the distance between the registered hall button and the car position is short and the elevator close to the operated hall button is assigned with priority. It was a method. For this reason, when a plurality of elevators are arranged facing each other on the front side and the back side across the hall, and when the hall button on the front side is operated in an elevator hall having a pillar in the middle part of the hall, this operation was performed. With respect to the buttons, the frequency of assignment to the elevators on the rear side and the elevators located in front of the pillars in the middle of the hall was reduced, thereby shortening the travel distance of the waiting customers and improving convenience.

[0003]

However, in the above-mentioned prior art, for example, when the waiting time of the elevator is long, the car with the long moving distance of the waiting customer from the operated hall button has a short waiting time. Regardless, since the elevator was assigned near the operated hall button without assigning the car, the waiting time for a predetermined time (for example, 60 s or more) was increased. If the waiting time is 60 seconds or more, even if you have a large baggage, have a handicap, or use a wheelchair, consider the time obtained by adding the time to travel between units and the time to notice the reserved light However, there is a case where it is not necessary to wait long if a car with a long travel distance is assigned, so there is a problem with the conventional proximity call assignment method in which the elevator near the registered hall button is always given priority. I was

SUMMARY OF THE INVENTION [0004] In view of the above, it is an object of the present invention to improve elevator waiting time service and to provide an efficient elevator operation assignment.

[0005]

The object of the present invention is to calculate a predicted vertical arrival waiting time of each elevator and a predicted horizontal movement time of a passenger in response to a generated hall call, and to compare the waiting time with the predicted movement time. The problem is solved by selecting the larger one as the overall evaluation value, performing this for all elevators, selecting the smallest elevator among all the overall evaluation values, and assigning it to the generated hall call. Here, when the predicted horizontal movement time is longer than the predicted vertical arrival waiting time, the priority control of the elevator is suppressed. On the other hand, when the predicted horizontal movement time is shorter than the predicted vertical arrival waiting time, the priority control of the elevator is not suppressed.

[0006]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 shows a layout of holes in a ten-car group management in a face-to-face arrangement of five cars to which the present invention is applied. In FIG. 1, Units 1 to 5 (front side)
Units 6 to 10 (rear side) are arranged to face each other across the hall. A, B, C, D to H, and P indicate the positions of the hole buttons.

FIG. 2 is a diagram showing a prediction of a user's horizontal movement in response to a generated hall call in consideration of the position of the operated hole button and the amount of extra time and travel time required for the user to get on each elevator. The time _TH is shown. In particular, the rear side is set to be relatively large because there is a delay in noticing the lighting of the service guide light. 2, for example, the horizontal movement to take the prediction time (horizontal movement time) T _H is 0 s, 30s, 5 Unit is to Unit 3 to 15s, 4 Units to Unit 1 or Unit 2 from the hall button A position 45s, 15s to Unit 6, 15s to Unit 7, 15s to Unit 8,
It is 30s for Unit 9 and 45s for Unit 10.

FIG. 3 and FIG. 4 are prior art priority assignment diagrams of the hall button proximity elevator. Conventionally, as shown in FIG. 3, to prioritize the elevator close to the hall buttons, handles horizontal movement time T _H as a penalty, was added to the estimated arrival time T _V. That is, the evaluation value Φ for evaluating the total waiting time is expressed by the following equation. Evaluation value Φ = estimated arrival time T _V + horizontal movement time T _H (penalty term) For example, when the hall button A (▼) is pressed, the estimated arrival time T _V of the second car is 90 s, and the estimated arrival time T of the tenth car. _V to 4
Assuming that 6 s and the horizontal movement time T _H is 0 s for Unit 2 and 45 s for Unit 10, the evaluation value Φ of Unit 2 is 90 s + 0.
s = 90s, the evaluation value Φ of Unit 10 is 46s + 45s = 9
1s. Here, the predicted arrival time T _V is shorter for the No. 10 than for the No. 2 and is 46 s, and the horizontal movement time T _H to the No. 10 is 45 s. Then the elevator arrives. Therefore, the waiting time of the No. 10 machine is shorter than that of the No. 2 machine. However, in the conventional proximity call assignment, although the estimated arrival time T _V relative direction of Unit 2 ▼ becomes long waits than 10 Units, to give a penalty (in this case 45s), Unit 2 In this case, the evaluation value Φ was smaller than that of the No. 10, so that the No. 2 was assigned. For this reason, the result was an increase in long waiting times.

FIG. 4 shows specific examples of prior art priority assignment of the hall button proximity elevator as Case 1 and Case 2. In Case 1, when you press the hole button A (▼), 2 Unit of waiting time (estimated arrival time) T _V 44s,
When the horizontal movement time T _H and 0 s, the evaluation value Φ is 44s +
0 s = 44s. On the other hand, 10 Units of waiting time (estimated arrival time) 10s and T _V, when the 45s the horizontal movement time T _H, the evaluation value Φ a 10s + 45s = 55s. In this case, naturally, the second car is assigned. In Case 2, Unit 2 of the waiting time (estimated arrival time) T _V
Is 90 s and the horizontal movement time T _H is 0 s, the evaluation value Φ
The 90s + 0s = 90s. On the other hand, 10 Units of waiting time (estimated arrival time) 46s and T _V, when the 45s the horizontal movement time T _H, the evaluation value Φ becomes 46s + 45s = 91 s. In this case, the second unit arriving later than the tenth unit is assigned.

Next, an embodiment of the present invention will be described. Elevator group control method of the present invention, the horizontal movement estimated time passengers for the elevator vertical ETA waiting time T _V for calls generated hall generated hall call T _H
Is selected as the overall evaluation value, and this is performed for all elevators, and at this time, that is, the elevator having the minimum overall evaluation value Φ (k) is assigned. FIG. 5 shows a specific case of the hall button proximity elevator priority assignment of the present invention as Case 1 and Case 2. Case 1, a 2 Unit generation hall call elevator vertical arrival forecasted waiting time T _V for the 44s, the horizontal movement prediction time T _H of passengers for calls generated hall 0 s (Unit 2 in the hall button has been operated 0
s. ). When comparing the T _V and T _H,
Since the direction of T _V is large, comprehensive evaluation value Φ (k) is T _H (= 9
0s). That is, the total evaluation value Φ (k) = max (T _V , T _H ) = max (4
4, 0) = 44s in the same manner, the elevator vertical arrival forecasted waiting time T _V for 10 Unit generated hall call and 10s, 45s horizontal movement prediction time T _H of passengers for calls generated hall
And Then, when T _V and T _H are compared, T _H is larger, so that the total evaluation value Φ (k) is T _H (= 45 s). That is, the total evaluation value Φ (k) = max (Tv, T _H ) = max (1
(0,45) = 46 s Then, when the total evaluation value Φ (k) of both is compared and the elevator having the minimum total evaluation value Φ (k) is selected, the second elevator is obtained. In this case, the predicted horizontal movement time T of the customer
_H (= 45s) for elevator vertical expected arrival waiting time T _V (= 10s) is earlier than, Unit 2 is assigned a 10 Unit A pass. Here, comparing the conventional case diagram 4 with the case diagram 5 of the present invention, as a result, in both the conventional case and the present invention, the second car is assigned after passing the 10 car which arrives too early. By this, the elevator farther than the operated hall button (in this case, No. 10)
It is not necessary to run at the same time as the arrival of the elevator, and it is also possible to prevent the driver from getting lost due to the passage of the elevator. Operation can be performed, and an elevator with good operation efficiency can be assigned without lowering the operation efficiency of the entire elevator. Case 2, the elevator vertical arrival forecasted waiting time Tv for call 2 Unit generation hole and 90s, 0 s (Unit 2 horizontal movement prediction time T _H of passengers for calls generated hall near the hall button has been operated Therefore, it is 0 s.). And _TV
And Comparing T _H, since towards T _H is large, total evaluation value [Phi (k) becomes T _H (= 90s). That is, the total evaluation value Φ (k) = max (T _V , T _H ) = max (9
0,0) = 90s in the same manner, the 10 Units elevator vertical arrival forecasted waiting time T _V for generating hall call with 46s, 45s horizontal movement prediction time T _H of passengers for calls generated hall
And When T _V and T _H are compared, T _V is larger, so that the total evaluation value Φ (k) is T _H (= 46 s). That is, the total evaluation value Φ (k) = max (T _V , T _H ) = max (4
(6, 45) = 46 s Then, when the overall evaluation value Φ (k) is compared with each other and the elevator having the minimum total evaluation value Φ (k) is selected, the elevator is No. 10. In this case, No. 10 arriving faster than No. 2 is assigned. Here, a comparison between the conventional case FIG. 4 and the case FIG. 5 of the present invention shows that
Considering the distance traveled by users, the waiting time for Unit 2 is assigned to Unit 2 despite the fact that it is better to assign to Unit 10, which has the fastest arrival time. Had reduced the operating efficiency. On the other hand, in the case of the present invention, since the No. 10 car with the fast arrival time is assigned, the long waiting time is not increased unnecessarily unlike the conventional case, and the irritation caused by the long waiting time felt by the user is reduced. In addition, the efficiency of the entire elevator can be increased. Also, in the conventional case, the second unit is assigned a long wait of 47 s to 90 s, but in the case of the present invention, since the second unit is finely assigned, it is particularly effective in an elevator with a reserved light. is there.

[0011] Case 1 and Case 2 are the same as Unit 2 and 1
Although No. 0 is specifically shown, the present invention determines the overall evaluation value Φ (k) for all the units, selects the elevator with the smallest overall evaluation value Φ (k), and assigns the elevator to the elevator. Needless to say.

FIG. 6 shows a flowchart for determining the elevator allocation when an arbitrary hall call occurs in the hall button proximity call allocation method of the present invention described above. In order to determine which elevator is optimal, a loop process is performed for the number of elevators 1 to n between (1) to (5). (2) In calculates the elevator vertical arrival forecasted waiting time T _V for calls generated hall. The predicted waiting time is the sum of the hall call elapsed time indicating the elapsed time from the occurrence of the hall call to the present and the estimated arrival time. The following (3) calculates the horizontal movement prediction time T _H of passengers for calls generated hall. T _H = L × α + T _R L × α: Moving distance between cars in the hall, where α is a ratio indicating the degree of congestion T _R : Confirmation time until the user notices when the elevator behind is assigned Is used for the time calculated by the distance traveled by the passengers in the hall and when the elevator behind is assigned, or for the passengers at the end of a protruding pillar, even if there are reserved lights It is the sum of the confirmation time until the customer notices. In addition, (4) the larger of the evaluation value T _V and T _H is a comprehensive evaluation value of the Unit Φ (k). Then, (5) determines whether or not the calculation of the evaluation value has been completed for all elevators, and if it has been completed, the process jumps to the next (6). The minimum total evaluation value Φ (k) is selected by the calculation of (6). This gives the optimum overall evaluation value Φ
The elevator (k) will be selected. (7)
Assigns a hall call to the most appropriate elevator and guides the car to Sahavis at the landing. As described above, in the present embodiment, it is possible to secure extra time in the hall for preventing further misses without unnecessarily increasing the long wait time.
The service of the customer can be greatly improved.

[0013] The present invention is not limited to the above description, the estimated arrival time T _V is the elevator above 45s can be realized by a simple method such as stopping the addition of the penalty values.

[0014]

As described above, according to the present invention,
Reduce the waiting time for elevators to passengers compared to the conventional example,
It is possible to realize the control for preventing the driver from missing, and to improve the operation efficiency of the entire elevator. In addition, since the control is performed in consideration of the relationship between the elevator arranged in the horizontal direction and the operated hole button, it is possible to provide a service that balances the waiting time and convenience in the hall of the customer.

[Brief description of the drawings]

FIG. 1 is a diagram showing a layout of a hall in a management of a group of five vehicles in a face-to-face arrangement.

FIG. 2 is an explanatory diagram of time required for boarding in a hall.

FIG. 3 is a prior art priority allocation diagram of a hall button proximity elevator (1)

FIG. 4 is a prior art priority allocation diagram of a hall button proximity elevator (2)

FIG. 5 is a diagram showing priority assignment of a hall button proximity elevator according to the present invention;

FIG. 6 is a flowchart for determining an elevator assignment for an arbitrary hall call according to the present invention.

[Explanation of symbols]

 (1) to (7): Steps in the flowchart

Claims (4)

[Claims] An elevator group management for operating a plurality of hall buttons installed on the same floor, preferentially selecting an elevator close to the operated hall call button, and priority controlling at least one adjacent elevator from a plurality of cars. In the control method, a vertical arrival predicted waiting time of each elevator for the generated hall call and a horizontal movement predicted time of the user are calculated, and the waiting time and the magnitude of the movement predicted time are compared to obtain an overall evaluation value, An elevator group management control method, wherein an elevator having the smallest overall evaluation value is selected and assigned to the hall call. 2. The elevator group management control method according to claim 1, wherein when the horizontal movement prediction time is longer than the vertical arrival prediction waiting time, priority control of the elevator is suppressed. 3. The elevator group management control method according to claim 1, wherein when the predicted horizontal movement time is shorter than the predicted vertical arrival waiting time, priority control of the elevator is not suppressed. 4. The elevator group management control method according to claim 1, wherein the predicted horizontal movement time _TH is obtained by the following equation. T _H = L × α + T _R L × α: Moving distance between the cars in the hall, where α is the ratio indicating the degree of congestion T _R : Confirmation time until the customer notices when the elevator behind is assigned