JPH0240584B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a group control method for elevators, and is particularly effective in a call allocation system.

[Conventional technology]

Multiple elevators are managed as a group, and when a hall call occurs, the evaluation value of each elevator is calculated based on the condition of each elevator (car position, driving direction, call situation, etc.) according to a predetermined evaluation formula. A so-called call allocation method is widely adopted in which the hall call is allocated to the most suitable elevator based on the following. Various parameters are used to calculate this evaluation value, and among them, there is one that uses the waiting time (or predicted waiting time) from the time a hall call occurs until the elevator arrives.

For example, when a hall call occurs, an evaluation method that calculates the waiting time for the hall call and other allocated hall calls and assigns the hall call to the elevator that minimizes the average value, or There is an evaluation method in which the maximum waiting time of the hall calls assigned to the elevator is determined for each elevator, and the hall call is assigned to the elevator that minimizes the maximum waiting time.

However, the above waiting time (predicted waiting time) is more precisely the waiting time for hall calls, not the actual waiting time for hall customers. That is, it is considered that at least one customer is waiting at the time when the hall call actually occurs, and several customers are waiting after that until the elevator arrives.

Therefore, the waiting time (predicted waiting time) determined using the conventional method is the waiting time for the person who first presses the hall button, and the waiting time for those who arrive at the hall later. Not considered. For this reason, whether one person is waiting for a hall call or a large number of people are waiting, the same treatment is applied, making it impossible to perform accurate evaluations.

[Means for solving problems]

The present invention has been made to solve the above problems, and includes a detection device for detecting hall customers on each floor, which adds up the product of the number of customers waiting at that time and a predetermined time every predetermined time. The feature is that the total waiting time of waiting customers (total predicted waiting time) is used to calculate the evaluation value.

〔Example〕

An embodiment of the present invention will be described below with reference to FIGS. 1 and 2.

Figure 1 is a diagram showing the relationship between the elapsed time after a hall call occurs on a certain floor and the change in the number of waiting customers.
For simplicity, here, hall calls occur only in the upward direction, and all waiting customers are assumed to be in the upward direction. In Figure 1, t ₁ is the time when a hall call occurs, and t ₂ is t ₁
The current time point 10 seconds after t ₃ indicates the expected arrival time of the elevator 20 seconds after t ₁ .

Here, in order to obtain the total upward waiting time Aux of all the waiting customers x seconds after the hall call is generated, for example, the waiting customer detection device detects the waiting customers in the hall at fixed time intervals, and then It can be found by adding the products of For example, if the constant time is 1 second and the number of customers waiting just i seconds after the hall call is generated is Ni, then Aux= _x 〓 ⁱ⁼¹ (1×Ni).

Therefore, in FIG. 1, the total waiting time Au ₁₀ at the current time t ₂ is Au ₁₀ = ₁₀ 〓 ⁱ⁼¹ (1×Ni) = 1×(1+1+2+3+3+3+4 +5+5+5)=32 seconds.

Also, from the current time t ₂ to the expected elevator arrival time t ₃
The total predicted waiting time Bu in the upward direction from t ₂ to t ₃
Assuming that the number of customers waiting will not change until then,
In Figure 1, Bu = 5 x 10 = 50 seconds. The current cumulative waiting time Au ₁₀ and the future cumulative waiting time Bu are used to calculate the evaluation value.
For example, in Figure 1, the hall call that occurred at time t ₁ is assigned to machine No. 1, and if a new hall call occurs on another floor at the current time t ₂ , then the evaluation value of machine No. 1 is _Au10 +
Bu's total waiting time (total predicted waiting time) and 1 other
If there is a hall call assigned to the car, it is calculated by calculating the cumulative waiting time at time t ₂ , and 1 for the hall call that occurred at time t ₂ .
Determine whether a machine is optimal by comparing it with the evaluation values of other machines. It should be noted that the method of allocating hall calls by using the waiting time for the already allocated hall calls in calculating the evaluation value is well known, so the explanation thereof will be omitted here.

The above is a case where only an ascending call occurs in a hall, and the same is true when only a descending call occurs, but next, the cumulative waiting time when both an ascending hall call and a descending hall call occur in the same hall. We will explain how to find it.

Figure 2 is a diagram showing the relationship between the elapsed time and the number of waiting customers when a hall call in the ascending direction occurs on a certain floor and then a hall call in the descending direction occurs, where _t4 is the time when the ascending hall call occurs; t ₅ is the time when a descending hall call occurs, t ₆ is the current time, and t ₇ is the expected time of arrival of the elevator.

In Figure 2, if the number of customers waiting immediately before i seconds after the hall call is generated is Ni, then the number of customers before t ₅ is
All of N ₁ to _{N 5} can be regarded as waiting customers in the upward direction, and the total waiting time Au ₅ in the upward direction at time t ₅ can be obtained by the same calculation as described above. Regarding the first customer waiting data N ₆ after the occurrence of a descending call, there is always one customer waiting in the descending direction, and for N ₅ minutes, there are customers waiting in the ascending direction. If N ₆ increases by two or more people from N ₅ , the remaining _{"N 6 −} N ₅ −
As for 1" people, the direction is unknown, and they will be distributed according to the ratio of waiting customers for ascending and descending floors. This customer waiting ratio may be calculated by learning, etc., or it may be simply calculated as 1/
It can also be divided by 2 or the ratio of the number of floors by direction.

Here, for simplicity, it is assumed to be 1/2, and the total time in the upward direction after 6 seconds from the hall call occurrence Au ₆
Then, the total waiting time A _D6 in the downward direction is Au ₆ = Au ₅ + (N ₅ + N ₆ - N ₅ -1/2) x 1 second A _D6 = 0 + (1 + N ₆ - N ₅ - 1/2) x 1 seconds.

The same applies to N ₇ and later, and generally when a descending hall call occurs j seconds after an ascending hall call,
The total waiting time Aux and A _DX after x seconds are Aux= _j 〓 ⁱ⁼¹ (1×Ni) + _x 〓 ^i=j {(Nj+Ni−Nj−1/2)×1} A _DX = _x 〓 ^{i =j} {(1+Ni−Nj−1/2)×1} Further, the total expected waiting time from the current time to the expected arrival time of the elevator can be easily determined assuming that there is no change in the number of customers waiting at the current time, as described above.

In FIG. 2, the shaded area is the total waiting time in the downward direction, and the rest is the total expected waiting time in the upward direction.

In this way, for example, if a new hall call occurs on another floor at the current time t ₆ , the total waiting time (total expected waiting time) is calculated as above for the hall call that has already been assigned, and the new hall call is It is used to calculate the evaluation value of each machine for assigning hall calls.

〔Effect of the invention〕

According to the present invention, not only the waiting time after a hall call occurs, but also the total waiting time that takes into consideration the number of waiting customers, is used to calculate the evaluation value.
Even if the waiting time is the same, a floor with many customers waiting can be prioritized over a floor with only one customer waiting, which reduces the average waiting time per person and has a significant effect on improving operational efficiency as a whole. can demonstrate.

[Brief explanation of drawings]

1 and 2 are diagrams showing the relationship between the elapsed time from the occurrence of a hall call and changes in the number of waiting customers for explaining the present invention. t ₁ , t ₄ ... Time of rising hole call, t ₅ ... Time of descending hole call, t ₂ , t ₆ ... Current time, t ₃ ,
t ₇ ... Estimated arrival time of the elevator, Ni ... Number of waiting customers i seconds after the hall call is generated.

Claims (1)

[Claims] 1 Multiple elevators are put into service for multiple service floors, and when a hall call occurs, the evaluation value of each elevator is calculated based on the condition of the elevator according to a predetermined evaluation formula, and the optimal elevator is selected based on the results. In this system, each floor is equipped with a hall waiting customer detection device, and when a hall call occurs, the product of the number of customers waiting at that time and a certain time is added up every certain time, and the number of customers on that floor is 1. A group management control method for elevators, characterized in that the total waiting time or total predicted waiting time of all waiting customers is determined, and the total waiting time or total predicted waiting time is used as the evaluation value.