JPH055747B2 - - Google Patents

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention provides an elevator group management control method that is effective in allocating a hall call to an optimal elevator when a plurality of elevators are installed in parallel. It is related to.

[Problems to be solved by conventional technology and invention]

In current elevators, the mainstream group management control is assignment control using evaluation functions.

This method calculates numerically for each car each time a hall call is best assigned to which car it is best to assign the call to, using evaluation functions for various evaluation indicators, and selects the car with the highest value or It is assigned to small baskets, and advanced control is possible by appropriately selecting evaluation indicators and devising evaluation functions.

On the other hand, recently, in order to perform more advanced control, call assignment control using an expert system using fuzzy theory has been proposed.

This is based on the waiting time for hall calls, the probability of long waiting,
This method considers various evaluation indicators such as first-arrival probability as fuzzy quantities, uses a set of rules that describe an appropriate allocation method in IF-THEN format, and selects and allocates the optimal basket based on the degree of suitability for the set of rules.

By the way, regardless of the allocation method, the typical evaluation indicators are the expected waiting time for a hall call, the expected arrival time to each floor (waiting time from the present moment), or the duration of the hall call (waiting time from the present moment). This is related to waiting time, such as waiting time).

However, if such waiting time is used as an evaluation index, when the traffic volume increases and the load becomes high for the entire group, the index value will naturally increase, and the balance with evaluation indexes other than waiting time will become unbalanced. It becomes impossible to keep it. Additionally, the evaluation function (membership function in expert systems) for evaluating waiting time is basically set to perform optimal evaluation for normal traffic volume, so the load is high and the waiting time is If the waiting time exceeds the normal range, it becomes difficult to accurately evaluate each machine by looking only at the waiting time.

In order to prevent such a situation, for example, the evaluation function can be switched depending on the size of the traffic volume, the shape of the function can be changed by changing the parameters, or the evaluation sensitivity for normal traffic volume can be sacrificed a little in advance. Countermeasures can be considered, such as creating a function that has some sensitivity to the high load side, or switching using fuzzy rules in an expert system, but in either case, it would be extremely complicated or would not be sufficiently effective. There was a problem that I was told was not possible.

In order to solve these problems, this invention provides group management that allows for appropriate evaluation of waiting time in a simple manner, even during busy times when waiting time increases, and that also maintains a balance with other evaluation indicators. The present invention provides a control method.

[Means to solve the problem]

Therefore, in the present invention, the average duration of each hall call is measured, and when the value exceeds a predetermined value T,
The index value regarding the waiting time is a value obtained by subtracting (-T) from the actual index value, and the waiting time is evaluated based on this value.

〔Example〕

Hereinafter, one embodiment of the present invention will be described based on the drawings.

FIG. 1 is a diagram showing the configuration of a group control device to which the present invention is applied. In the figure, 11 is a group control device, and 12 is a communication interface for exchanging signals with the operation control device (not shown) of each aircraft. 13 is an input/output interface unit that exchanges signals with external equipment such as hall call buttons and answering lights; 14 is an input/output interface unit that performs statistical calculations on various traffic information and uses learning to predict call occurrences and other traffic 15 is a data collection unit that inputs and stores various traffic data such as the occurrence of calls, the position of each car, and the driving status, and measures the average duration of each hall call; 16
is an allocation determining unit that calculates an evaluation value for each car based on a predetermined evaluation formula based on the situation of each car, and selects and allocates an optimal car from among the evaluation values.

FIG. 2 is a flowchart showing an outline of the call allocation program executed by the allocation determining unit 16.

Note that the case of call assignment control using fuzzy theory is shown here as an example. Also, consider the following two evaluation indicators.

One is, assuming that an unassigned hall call (the hall call that is about to be assigned) is assigned to car i, the expected arrival time for the assigned hall call whose service will deteriorate and the expected arrival time for this unassigned hall call. The maximum value among these, that is, the deterioration index of service for hall calls, is defined as Wi.

The other is the distance to the unassigned hall calls of the i car (the sum of the number of floors in the driving direction and the number of assigned hall calls that should be stopped between), that is, the risk of service deterioration for the unassigned hall calls. , and its index value is designated as Xi.

In FIG. 2, when the program starts, it is first determined in step S11 whether or not there is an unassigned hall call, and if so, the process advances to step S12. Processing S
Step 12 predicts future call occurrences and the operation of each car from the present time, and calculates the expected arrival time to each floor and direction of each car. Next, in step S13, the above-mentioned index value Wi is calculated for each car. In step S14, when the average duration of each hall call exceeds a predetermined value T, that is, when the load is high, the actual index value Wi is changed from (-
The value obtained by subtracting T) is set as the index value Wi, and if not, the actual index value Wi is set as Wi.

In step S15, the above-mentioned index value is calculated for each machine.
Xi is calculated, and each index value is converted into a fuzzy amount in step S16, and the allocation suitability Ri for each rule is calculated to determine the allocated machine number.

Note that the prediction of the occurrence of a call, the calculation of the expected arrival time of the car to each floor, etc. in the above-mentioned processes S12, S13, and S15 are well-known techniques, and detailed explanations thereof will be omitted.

Next, the procedure for determining the average duration of each hall call will be explained with reference to the flowchart of FIG.

In FIG. 3, when the program starts, initialization is performed in step S21, and the work variable σ and the average duration of hall calls are set to zero.

In step S22, it is detected whether or not a new hall call has occurred. If a new hall call has occurred, in step S23, the floor of the hall call that has occurred is set to j, and the direction of the hall call is set to k. In step S24, the current time is set in τjk as the generation time of the hall call in the k direction on the j floor. Then, in step S25, it is detected whether or not the car has arrived at the floor where the car is called, and if it has arrived, in step S26, if j is the floor where the car arrived and k is the direction of arrival, then The duration of the hall call is determined as the current time (arrival time of the car) - the time of occurrence of the hall call τjk. and step S
As shown in Figure 27, by calculating with a well-known formula using the work variable σ and a 1/N filter (N is a natural number and a filter constant) and repeating the above steps S22 to S27, the average duration of each hall call can be calculated. You can ask for it.

In the present invention, this average duration time is used, and when this value exceeds a predetermined value T, the excess time is subtracted from the actual index value Wi, as shown in step S14, and the value is set as the index value Wi at that time. .

By doing this, even when the average duration of hall calls is long, that is, when the load is high for the entire group, the index value Wi becomes too large than the other index values, making it impossible to maintain a balance in the evaluation. Furthermore, even if we only consider the index value Wi, the value subtracted from each unit is the same, that is, the difference in index value Wi between each unit is maintained, so the evaluation of each unit with respect to the index value Wi is also It will be done properly.

Next, the present invention will be applied to an eight
A specific calculation example when applied to a building with three floors will be explained below.

Figures 4a to 4d are diagrams showing the positional relationship between the calls and each car, and Figure 4a is the unassigned hall call that occurred in the descending direction on the 8th floor (the hall call to be allocated now).
8HD and the car call 1C on the first floor that is expected to transition (derived) from it. Figures 4 b to d show the car calls 1 to 3 at the time when the hall call 8HD occurred (currently). It is a diagram showing the car position and the hall calls (△) and car calls (○) that each car is in charge of. Note that solid lines indicate calls that have already occurred, and dotted lines indicate calls that are expected to occur.

Figures 5 a to c are diagrams showing the calculation results of the expected arrival time for each floor and direction from the current moment of each car, assuming there is no hall call 8HD, and a to c correspond to cars 1 to 3, respectively. do.

Figures 6 a to c are diagrams showing the calculation results of the expected arrival time for each floor and direction from the current moment of each car, assuming that a hall call of 8HD is assigned to each car. Compatible with machines No. 3 to No. 3.

As is clear from Figures 4a to 4d, there is no hall call assigned further away than hall call 8HD from the position of each car, and therefore the index value Wi of each car is
The value of Wi is the expected arrival time for unallocated hall call 8HD. Therefore, from FIGS. 6a to 6c, the index values Wi in step S13 for each car are W ₁ =48, W ₂ =40, and W ₃ =54.

Furthermore, if the average duration t of hall calls at the present moment is 29 seconds and the predetermined value T is 15 seconds, the current load is high and the difference (29-15
= 14) is subtracted from the index value Wi, therefore, the index value Wi after the calculation in step S14 is W ₁ = 48-14 = 34 W ₂ = 40-14 = 26 W ₃ = 54-14 = 40 .

On the other hand, as for the index value Xi, as shown in Figure 4 a to d, the floor distance between Car 1 and hall call 8HD is 6 floors, and there are two hall calls to answer between, so X ₁ = 8 + 2 = 10 Similarly, since there are no calls to answer on the way for the 2nd and 3rd machines, X ₂ = 13 and X ₃ = 10, respectively.

Next, the fuzzy rules are evaluated based on the index values of each car, but here, the following two rules will be considered as examples.

Rule IF Wi=G, THEN Ri=G Rule IF Xi=B, THEN Ri=B Here, each signal represents Ri: the allocation suitability of the i-th machine G: good B: bad, and therefore the rule is as follows. It means something like.

Rule: If the index value Wi is good when allocating to the i-th machine, then the suitability of the i-th machine is good.

Rule: If the index value Xi is bad when allocating to the i-th machine, the suitability of the i-th machine is bad.

Then, the degree of conformity to such a group of rules is determined for each basket, and the optimal basket is selected.The degree of conformity of each basket is calculated by calculating the fuzzy amount corresponding to each index value using the membership function shown in Figure 7. Find from.

Figure 7a shows the membership function representing the fuzzy set of Wi=G, Figure 7b shows the membership function representing the fuzzy set of Wi=B, and similarly, Figure 7c shows the membership function of Xi=G, and Figure 7d shows the membership function representing the fuzzy set of Wi=G. is Xi=B, Fig. 7e
is a membership function representing a fuzzy set for Ri=G, and FIG. 7f is a fuzzy set for Ri=B.

FIG. 8 is a diagram showing the procedure for determining the degree of conformity to the above-mentioned rules for the first machine using these membership functions.

First, since the index value W ₁ of the first machine is 34 as mentioned above, the degree to which this value belongs to the fuzzy set of the rule W ₁ = G (degree of coincidence) is expressed as W ₁ = G
When calculated from the membership function of , it is 0.15 as shown in Figure 8a.

Therefore, since machine No. 1 satisfies the premise of rule 1 to a degree of 0.15, the allocation suitability R ₁ of machine No. 1 for rule 1 is the combination of the membership function of R ₁ = G and 0.15, as shown in Figure 8b. It is expressed as a logical product.

Similarly, regarding the rule, the index _value
It becomes 0.5 as shown in Figure c. Therefore, the suitability of allocation for the rule of machine No. 1 is expressed by the AND of this 0.5 and the membership function of Ri=B, as shown in FIG. 8d.

Then, we comprehensively evaluate the rules and determine the suitability of the assignment for Unit 1 (the suitability for the rules and the rules).This is done by taking a weighted average of the degree to which the rules are satisfied and the degree to which the rules are satisfied. It is determined by Specifically, as shown in Fig. 8e, Fig. 8b and Fig. 8d
It is determined by taking the logical sum of and calculating its center of gravity. As a result, the final allocation suitability of the first machine is R ₁ =0.382.

Similarly, Figures 9a to 9e show the rules for machine No. 2,
This figure shows the procedure for determining the degree of suitability for the assignment.The final degree of suitability for allocation is determined from the index values of the second unit (W ₂ = 26, X ₂ = 13), resulting in R ₂ =0.400.

Figures 10a to 10e also show the rules for Unit 3,
This figure shows the procedure for finding the goodness of fit for 3.
When the final allocation suitability is calculated using the index value of the machine (W ₃ = 40, X ₃ = 10), R ₃ = 0.304.

FIG. 11 shows the results of this calculation in a table.

For reference, FIG. 11 also shows calculation results using the conventional method.

As is clear from Figure 11, in the conventional method,
Actual index value (in this example
W ₁ = 48, W ₂ = 40, W ₃ = 54) are used as they are, so the degree of agreement with the membership function Wi = G of the rule is 0 for all aircraft 1 to 3, that is, the expected arrival time Due to the increase, all the index values Wi exceed the effective sensitivity range of the evaluation,
As a result, the allocation will be determined only based on the evaluation of the index value Xi, and in this example, the allocation will be made to the No. 1 car.

However, according to the present invention, by subtracting an amount proportional to the average duration of calls indicating an increase in traffic volume from the index value Wi regarding waiting time, the evaluation is effective while maintaining the difference in index values of each car. Since it is shifted within the sensitivity, a balance is maintained between the evaluation for the index value Wi and the evaluation for other index values, and as a result, in this example, it is assigned to the No. 2 car.

In addition, in the above embodiment, the expected arrival time at the hall call (waiting time from the present moment) was used as an evaluation index regarding waiting time, but of course, even if it is the expected waiting time from the time when the call occurs, Good and
Any other index may be used as long as it is substantially related to waiting time.

Further, in the above embodiment, the case where the present invention is applied to allocation control using fuzzy theory is explained, but it goes without saying that the present invention can be similarly applied to allocation control using an evaluation function.

[Effects of the Invention] According to the present invention, even when the entire group is in a high load state and the index value related to waiting time increases, it is possible to accurately evaluate each unit for waiting time, and to Evaluation and evaluation of other indicators can be performed in a well-balanced manner, and appropriate allocation can always be made in a simple manner regardless of the traffic situation.

[Brief explanation of the drawing]

Fig. 1 is a block diagram of a group management device to which the present invention is applied, Fig. 2 is a flowchart showing an outline of a call allocation program according to the present invention, and Fig. 3 is a procedure for calculating the average duration of a hall call according to the present invention. FIG. 4 is a diagram showing the positional relationship between the calls and each car to explain the present invention, FIGS. 5 and 6 are diagrams showing the expected arrival time to each floor of each car,
FIG. 7 is a diagram showing the membership function for explaining the present invention, FIGS. 8 to 10 are diagrams showing the evaluation procedure for explaining the present invention, and FIG. 11 is a diagram showing the calculation results of the evaluation. It is. 11... Group management device, 12... Communication interface unit, 13... Input/output interface unit,
14...Learning management department, 15...Data collection department, 1
6... Allocation deciding section.

Claims (1)

[Claims] 1. For a plurality of elevators installed in parallel, at least the waiting time for a common hall call is used as an evaluation index, and the index value is used to evaluate each elevator, and as a result, the evaluation In the elevator group management control method in which the most suitable elevator is assigned to the hall call, the average duration of each hall call is measured, and when the value exceeds a predetermined value T, the index value regarding the waiting time is , an elevator group management control method characterized in that the value is set as a value obtained by subtracting (-T) from an actual index value.