JPS61211283A - Group control method of elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

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.

[Conventional technology and problems]

Generally, the hardware of a group management control device using a small calculator such as a microcomputer is configured as shown in FIG. That is, the microcomputer 1 reads hall call information from the hall call registration device 4 via the human output interface 2, and at the same time reads the hall call information from the hall call registration device 4 via the input/output interface 3. Various information regarding the status of the elevator is read, such as car call information, car driving direction, car running speed and position information, and car door opening/closing information.

Now, when a new hall call occurs, the program stored in microcomputer 1 calculates the appropriate service elevator for that hall call based on the information read earlier, and selects one of the A-0 elevators. Assign to any suitable elevator or elevators. The assignment signal is outputted to a corresponding one of the car control devices 5 to 7 via the input/output interface 3, and each elevator sequentially services the car call and the assigned hall call.

FIG. 2 is a flowchart showing an example of a conventional hall call allocation program.

That is, when a hall call occurs, the program shown in FIG. 2 is activated by interruption, and first, in step S10, an index register a indicating the car number is set to 1. Next, in step 11, an evaluation value for this hall call is calculated for car No. 1. Then, evaluation values are calculated for each car in sequence, and when the calculation is completed for all cars, the process proceeds from step S12 to step S14, and the hall call is assigned to the optimum car.

This program is activated not only when a new hall call occurs, but also when reassignment is required under predetermined conditions, such as when an extremely long waiting call occurs, and the same assignment is performed. In that case, the reallocation request is cleared in step sis after the reallocation is completed.

By the way, according to this conventional method, the optimal machine number is assigned to a newly generated hall call or a call that needs to be reallocated, but for this reason, the service is not available for calls that have already been assigned. This may result in a situation where the group as a whole is not necessarily assigned to the optimal machine number. This will be explained with reference to FIG.

For the sake of simplicity, the following explanation assumes that two elevators, A and B, serve a building with eight floors, and that only the waiting time is considered as the evaluation value.

In Figure 6, Car A is on the 3rd floor and is about to depart in the ascending direction, Car B is on the 2nd floor and is about to depart in the ascending direction, and 6C is the car call registered in the car of Car A, and 7HU is the car number registered in the car of Car A.
Yes, 7 occurred 2 seconds ago and has already been assigned to Unit B.
The ascending hall call, 8HD, is the 8th floor descending hall call that occurred 5 seconds ago and has already been assigned to Aircraft A, and 5HU is the 5th floor ascending hall call, which has newly occurred and has not yet been assigned.

Table 1 shows an example of the relationship between elevator travel distance (number of floors) and travel time.

Table 1 Now, assuming that each stoppage time is 5 seconds, and using Table 1 to find the waiting time for each allocated hall call in the state shown in Figure 6, Machine A will stop on the 6th floor and then head to the 8th floor. ,8g
The waiting time after the descending hole call 8HD occurs is 5+
10+5+ 8-28 seconds, 7th floor ascending hall call 7
The waiting time for the HU is 16 seconds, including the 2 seconds since the occurrence of the accident, since the distance traveled by Unit B is 5 floors.

If a new 5HU call for the 5th floor ascending hall occurs, the waiting time for this 5HU is as follows from Table 1.
When car No. A provides service, the time is 8 seconds, and when car No. B provides service, it takes 10 seconds.

According to the conventional method shown in Fig. 2, the most suitable machine is assigned to a newly generated hall call, regardless of the hall calls that have already been assigned, so here machine A, which has a short waiting time, is assigned. It turns out.

However, this 5th floor ascending hall is called 5HU f! : By assigning to machine A, the waiting time of hall call 8HD, which has already been assigned to machine A, changes. In other words, machine A is 5
Since it will stop on the 6th floor and the 6th floor, the hall call is 8HD.
The waiting time for hall calls has changed from 28 seconds to 36 seconds, and as a result, the waiting time for each hall call is 5HU-8 seconds and 7HU-1.
6 seconds, 8HD-36 seconds. Therefore, from the perspective of the entire group, the hall name is 5HU.
As a result, the maximum waiting time has changed from 28 seconds to 36 seconds.

On the other hand, if hall call 5HU is assigned to car B, the waiting time of hall call 7HU will change, and as a result, the waiting time of hall call 7HU will be 5HU - 10 seconds, 7HU - 25 seconds, 8HD - 28
seconds. Therefore, although the waiting time for hall call 7HU changes, the maximum waiting time for the entire group is 28 seconds, which is the same as before allocation of 5HU.

In other words, in the conventional method, the allocation is fixed for hall calls that have already been allocated, and the evaluation value is calculated only for newly generated hall calls and the optimal car number is assigned. Even if the allocation is optimal for the group, it may not necessarily be the optimal allocation from the perspective of the maximum waiting time of the entire group.

A similar case occurs not only from the perspective of maximum waiting time but also from the point of view of average waiting time.

[Means for solving problems]

This invention was made to solve the above-mentioned problems, and the main feature of this invention is that it does not fix the allocation of hall calls that have already been allocated, and each time a new hall call occurs, only that hall call is allocated. In addition, hall calls that have already been allocated are considered in the same way as newly generated hall calls, and the optimal combination of allocations (assignment pattern) is used for all hall calls or for multiple hall calls including newly generated hall calls. The point is that reallocation is performed.

〔Example〕

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

FIG. 4 is a flowchart showing an embodiment of the allocation program according to the present invention, and a case where this is applied to the state shown in FIG. 3 described above will be described.

First, when a hall call occurs, the program shown in FIG. 4 is started by interruption. In step T10, the number of hall calls that require reallocation, including newly generated hall calls, is detected. Here, all hall calls are to be reassigned, and if the number of registered hall calls is H and the number of cars is N, then the combination of assignments, that is, the assignment pattern is N.
Since there are eight patterns, index register K indicating the allocation pattern is set to 1 in step T11. The number of hall calls registered in Figure 3 is 5HU,
There are 6 cars, 7HU and 8HD, and the number of cars is 2, so there are 23-8 allocation patterns. Step T
12, for the first allocation pattern (for example, all hall calls 5HU, 7HU, and 8HD are allocated to car A), the maximum waiting time or each hall call is calculated as the evaluation value for the entire group, along with the waiting time of each hall call. Find the average waiting time. Similarly, evaluation values are sequentially calculated for a total of eight allocation patterns in this case. As mentioned above, assuming that each stop time is 5 seconds and the relationship between travel distance and travel time is based on Table 1 (however, 6C is a car call registration for car A, and car A stops on the 6th floor regardless of the allocation pattern). ), the calculation results of evaluation values for each allocation pattern are shown in FIG. In Fig. 5, for example (A, A, A) are hall numbers 5HU, 7HU, 8HD.
(A, A,
B) indicates that 5HU and 7HU are assigned to machine A, and 8HD is assigned to machine B. In the case of the assigned nog turn of (AI AT A), Car A will stop on each floor from 5th to 8th, so the waiting time for hall call 5HU is 8 seconds, and the waiting time for 7HU is from the time it occurs to the present time. Elapsed time until 2
The waiting time for 8HD is 43 seconds, including the 5 seconds that have elapsed since the occurrence of the call.The maximum waiting time for the group as a whole is 43 seconds for 8HD, and the average waiting time for each hall call is 43 seconds. The average waiting time is found to be 27 seconds. The allocation pattern for the following functions can be found in the same way.

When evaluation values have been calculated for all patterns, the process proceeds from step T13 to step T15, where the optimum pattern is reallocated to each car and the previous allocation is cleared.

In the case of FIG. 5, from the viewpoint of minimizing the maximum waiting time of the entire group, (B.

B, A) allocation pattern is optimal, hall call 5
HU and 7HU are assigned to machine B, and 8HD is assigned to machine A. Also, from the perspective of minimizing the average waiting time of the entire group, the allocation pattern (A, B, B) is optimal, and hall calls of 5HU and 7H are allocated to car No.
U and 8HD will be assigned to machine B.

Thereafter, the above-described operation is repeated every time a hall call occurs, and each time, the optimum allocation is performed for all hall calls from the perspective of the entire group.

In the above explanation, only the waiting time was considered as the evaluation value, but various other factors such as power consumption, startup frequency, load condition in the car, or a combination of these can also be considered, and the present invention similarly Can be applied. It goes without saying that there are no limitations on the number of floors in a building or the number of elevators.

In addition, in the above embodiment, calculations were performed for all allocation patterns, but as the number of elevators and the number of hall calls increases, the number of allocation patterns that are combinations thereof becomes enormous.
Dynamic programming, which is generally known in
gramming) and heuristic search (Heurist).
By using a method such as ic 5 search ), an optimal allocation pattern can be found with a small amount of calculation.

In addition, in the case where the allocation forecast is performed immediately after allocation, the above operation is not performed every time a hall call occurs.
The above operation may be performed only when specific conditions are met, such as when an extremely long waiting call occurs.

In addition, instead of reallocating all hall calls each time a hall call occurs, it is possible to reallocate newly generated hall calls and some hall calls that have already been allocated (for example, those whose waiting time exceeds a predetermined value). (Effect of the Invention) According to the present invention, without fixing the allocation of hall calls, all or part of the hall calls may be reassigned each time a hall call occurs. Since these hall calls are reallocated in the same way as calls that occur during the same period of time, optimal allocation can always be made from the perspective of the entire group, and highly efficient group management control can be performed.

[Brief explanation of drawings]

Figure 1 is a hardware configuration diagram of the group management control device, Figure 2
FIG. 3 is a flowchart of a hall call assignment program in a conventional group management control method, FIG. 3 is a diagram showing the relationship between calls and car positions for explaining the present invention, and FIG. FIG. 5 is a flowchart of the call allocation program, and is a diagram showing an example of the result of evaluation value calculation. 110. Microcomputer 2.611. Input/output interface 496. Hall call registration device 5-711. Each unit control device 5HU, , 5th floor ascending hall designation 7HU, , 7th floor ascending hall designation 8HD, , 8th floor descending hall designation 60, . 75th floor car call patent applicant Fujichik Co., Ltd. Figure 1 Hanging figure 3 HD No. 2 (21 Figure 4 Figure 5 [21

Claims (1)

[Claims] In a system in which a plurality of elevators are installed in parallel, an evaluation value is calculated for each elevator using a predetermined evaluation formula for a common hall call, and as a result of the calculation, the hall call is assigned to the most suitable elevator. An elevator characterized in that each time a call occurs, an evaluation value is calculated for each assignment pattern for a plurality of hall calls including the hall call, and the plurality of hall calls are reallocated using the optimal assignment pattern among them. Group management control method.