JPS5926870A - Method of controlling group 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] (a) Explanation of technical field The present invention relates to a group management control method for elevators.

In particular, the present invention relates to techniques for preventing long waiting hall calls and changing forecasts.

(bl Description of Prior Art) As high-rise buildings have become popular in recent years, multiple elevators are put into service for multiple service floors, a service-through elevator is determined for a hall call common to each elevator, and A group management control method has emerged that displays a forecast of elevators that will serve customers in response to sonoball calls.In such group management control methods, the most suitable elevator can be instantly determined in response to ever-changing traffic demands. 7. Therefore, when traffic demand increases rapidly within a certain period of time, or when demand is unevenly distributed to a certain floor, each car temporarily enters the Dango operation. When a new hall call occurs, a service elevator must be selected under poor conditions, resulting in a long waiting call.

Conventionally, long-waiting calls are judged only when calls that have passed a certain period of time after a hall call is generated are subject to review as long-waiting calls, so the conditions for changing the forecast are met before a certain period of time has elapsed, and changes are made after a certain period of time has elapsed. If the conditions do not hold, the already allocated elevator has to respond, resulting in a long waiting call.

(C1 Object of the present invention - Overview The present invention has been made in view of the points mentioned above. When a hall call is made after a predetermined period of time has elapsed after the hall call is generated, the present invention is re-serviced. The target floor for beta review (hereinafter referred to as the long-lasting reserve floor),
The predicted arrival time until the elevator that services the hall call responds is calculated, and if this predicted arrival time is determined to be after a certain period of time, then the arrival time of the other elevator's long-waiting reserve floor. can be answered within a certain amount of time6
In times of crisis, change the forecast to give priority to cars that do not increase the unanswered time of hall calls that have already been reserved as much as possible, proactively manage long-waiting hall calls, and minimize the number of long-waiting hall calls. A group management control method for elevators is provided.

(dl Description of Embodiment An embodiment of the present invention will be described below with reference to the drawings.

First, regarding the configuration of the system targeted by the present invention, ′χ1
This will be explained using FIG.

In the 1st M, 1 is a pole call registration circuit that acts commonly on all elevators, and when registering a hall call, the register for the corresponding floor and direction is set, and the car runs in the same direction to the next hall call floor. Reset when the conditions arrive.

28-2H is an elevator operation control device provided for each of the eight elevators, and the car status buffer 38-3
II, equipped with car call registration circuits 4A to 4H,
The above car status buffers 3A to 3■I&:L store information on the position of the car, driving direction, door opening/closing status, whether the car is decelerating or not, and the load inside the car for each car. Car call registration circuits 4A to 4H are set at the time of car call registration.
The car arrives at its call registration floor112. It is reset when the door is opened.

A small computer using an 8-digit, for example, 12-bit microcomputer, with internal input registers 5A to 5i-r, 6
It has A to 6 H and 7, and the I'1 part information of each of the above is taken into the small computer.

Figure 2 shows the hall condition table HCT in the small subtraction machine 8 of the hall call registration circuit 1, which contains 12-bit information about the halls on each floor from the 10th floor descending hall call (10D) to the 9th floor ascending hall call (9U). is stored in the form of

To specifically explain the information on the hall for each 0, when a hall call is registered, the HCT corresponding to that hall call
When the 11th bit of HCT becomes 1 and a service elevator is determined for that hall call VC, the 10th bit of HCT becomes 1, indicating that it has been allocated, and when the service elevator arrives at the floor where the hall call is registered, 10. All 11 pits are cleared to 0.

Figure 3 shows a car status table (CARC0NDITIONTAB) in the small computer 8 that shows the status of each elevator.
IJ) In the CCT, 12 bits represent each status of one car.

That is, the <θ> bit represents the open/closed state of the door, and is 1 when the door is closed, and 0 otherwise. <2> The pit is 1. while the car is running. It becomes O during deceleration. <3><4> Bits represent the direction of car operation; 1101 means UP direction, 101
1 indicates the DN direction, '00'' and till indicate that the car has no direction.

<5><9> Express the pit heel position in binary, (10
) (11) Pit represents the load of the car, '001 is 0
~45chi, -〇11 is 45chi ~ 60chi, -101 is 60chi
80%, "11" represents 80% or more.

FIG. 4 shows the car call table KCT in the small computer 8 of the car call registration circuits 48 to 4H for each elevator, which contains 12 car call information for floors 1 to 10 for each elevator.
It is stored in the form of bits, and when a car call is registered,
In response to the car call, the 11 pits of the CT become 1 and the elevator responds.

Next, the present invention will be explained using the flowcharts shown in FIGS. 5 to 13.

FIG. 5 (After the program starts, the FLAM table in the small A1 calculator 8 is initialized and the program goes to the repeat start point (R, 5P).

Next, by setting VcJ = 1, in other words, from car A, to check the car status information of the car status table CCT shown in Figure 3 and the presence or absence of car calls for each floor, the car call table KCT shown in Figure 4 is used. The car call information is read and carried out sequentially for all cars, starting with car B.

After completing reading of the condition of the twisting basket, set the hole index I to 0 in the sub 13 of FIG. HCT's (:10)〈11〉
Based on the value of the bit (C search for the already allocated hall call).

Already allocated hole calls are shown in the hole condition table HCT shown in Figure 2 c) <10><11> Bit force'
10' or 111N, so if the <10><11> bits of the hole condition table HCT are other than the above two cases, proceed to D in Figure 12, set the hole index E to 1, and scan the hole 9D. Move to.

When the hall call is an allocated hall call, if the elapsed time since the hall call occurs (TRCT (Il (see Figure 13)) does not exceed a predetermined constant value (for example, 30 seconds), Proceed to step D, and after the passage of time, it is determined that the floor is a long-lasting spare floor, and the expected unresponsive time until the service elevator K arrives at Hall 2 (i.e., the elapsed time since the hall call occurs) is estimated.C) Arrival Sum of time in dimensions TIT, E
SP(K) is determined by the following equation (1).

TLO8 (βm)...(1) Here, T RAN (αm, βm) is from αm floor to θ
n 0 running time to the 1st floor, TLO8 (βm) is the total of the door opening/closing time and opening time on the βm floor, l represents the number of floors the car stops on the way to the 1st floor, l~, IIl'tCT
(T) represents the elapsed time since the hole call for hole ■ was made.

The elapsed time of the hall call is determined by using a timer (not shown) in the small computer 8, as shown in the flowchart of FIG. Then, the interrupt processing routine shown in FIG. 13 is activated, and bits (10) and (11) of HCT become 1.
011.1111°When 1101, the HRCT value is +1
be done.

If the predicted non-response time TRE8P(K) of the allocation to the hole ■ calculated using the above formula (1) is within a predetermined constant value M (for example, 60 seconds), D in Fig. 12 is reached. If the number of cars continues and exceeds the predetermined value M, there is a strong possibility that there will be a long wait for Hall I, so check whether the car is suitable for the song or not according to the procedure shown below.

First, clear the storage register MINCAI (, FI!" In the case of , the process moves to step B4 to proceed to the next machine number.

If J is not equal to K, the predicted arrival time TI%ESP(I, J) until car J arrives at long-waiting reserve hall l is
It is calculated using the following equation (2).

TLO8(βm)...-(21) If TaESP (1, J) obtained by the above equation (2) is within a predetermined constant value N (for example, 15 seconds),
In addition, KC called the car on the 1st floor to find out if car J was scheduled to stop.
Check whether the value of 'r (I, J) is 1 or not (KCT (I, J) - 1 if there is a scheduled stop due to a car call), and if so, consider whether TRESP (1, J) is the minimum (i.e. The predicted arrival time to the first floor is set to MiNCAR.

After carrying out the above operation on all cars, the process proceeds to step 135, and if the corresponding car is set in MINCAR, the process proceeds to step C in FIG. 12, and if the corresponding car is not present, the process proceeds to the next check.

That is, if J = 1, as in the previous judgment, if Hall ■ has been allocated or not, or if the car has not been allocated and the predicted arrival time TRESP(I, J) to Hall ■ is the constant value N
If the value exceeds , the process advances to step B7 to determine the next machine.

If the car does not correspond to any of the above, check whether it has an allocated hall call before Hall I. If not, check whether TRESP (I, J) is the smallest car, and if it is the smallest car, assign the number to MINCAR. After setting index J and performing the same process for all machines, proceed to step B8.If the corresponding car is set in MINCAR, proceed to step C, and if the corresponding car is not set, proceed to the next check. move on. (The selection of a car that does not affect other allocated hall calls even if it stops at the long-lasting reserve hole ■ has been completed.) J = 1, the predicted arrival time TrLES to Hall I whether the car is already allocated or not allocated to Hall I.
If P(1, J) exceeds the above-mentioned constant value N, proceed to step BIO and proceed to check the next car. Katsukato J at the earlier allocated hall call
The predicted non-response time of the hall where is the service elevator is calculated using the above formula (1),
Only for cars that can respond within seconds, the next process, TRE
Check whether the car has the minimum value of SP(I, J) and store the minimum car in MINC,l.

Step B1 shown in Figure 10 after implementation for all units.
If the applicable car is stored in MINCAR, proceed to step C, and if the applicable car is not stored in MINCAR, the predicted non-response time TRESP(
If K) is within 90 seconds, proceed to step I) and proceed to check the next hole. (The forecast will not be changed.) Also, if TR, ESP (K) is tagged for more than 90 seconds, the car J
is different from the already allocated basket K in hall ■, and the basket J
Predicted arrival time TR, ESP (I , J
) is less than the predetermined value N described above, proceed to the next determination.

In other words, even if car J stops on the first floor of the hall,
If there is no hall call for which the predicted unanswered time of the previously allocated hall call exceeds 60 seconds, TItESP(I, J
) If there is an already allocated hall call that lasts for more than 60 seconds, the next car is checked, and after carrying out the same process for all cars, if the corresponding car is set in MINCAR, the car is checked. As shown in Figure 11, proceed to step C, and if the corresponding machine is not set, there is no car corresponding to the forecast change, so wait for the situation to change and proceed to step D, shown in Figure 12, to scan the next hole. Move to.

Also, if you come to step C in Figure 12, MI
This is when a machine that satisfies the predetermined conditions is set in NCAR, and the forecast for hole ■ can be changed, so cancel the forecast display for hole I. Car K was displayed as being in service. . ) Select the basket set in MINCAR as the new service for Hall □■, display the forecast in the hall, proceed to step D, change the hall index ■ to I = I + 1 [7 then move to 9D, all floors e) As explained in detail, according to the group management control method of the present invention, from the time when a certain period of time has elapsed after a hall call has occurred and a long-waiting call becomes possible. , Cars in good condition (1) Cars that are stopped when called to a hall that is expected to last a long time.

(2) Carts that are not called for already allocated holes before holes that are expected to last a long time.

(3) Even if the car stops at a hall where a long waiting time is expected, the cars on the same floor that do not have a hall call with an unanswered time of more than 30 seconds are sorted and selected sequentially, and after the forecast change. Since the influence on calls in already allocated halls with service elevators is minimized, it is possible to more rationally prevent long waiting calls.

[Brief explanation of the drawing]

FIGS. 1 to 4 are diagrams showing the configuration of a system to which the present invention is applied, and FIGS. 5 to 13 are flowcharts explaining the control method of the present invention. 1°°゛Hall call registration circuit 28-21-i... Operation control device 38-3H゛°・Car status buffer 4N-4H・Pa Car call registration circuit 5A-5H, 6A-6H, 7-・・・Input register 8・°
° Compact computer HCT-1 hole condition f -7'le OCT・
... Cart status Tebuya KCT ... Car call table (7317) Agent Patent attorney Noriyuki Chika (
(and 1 other person) Figure 1 Figure 2 0: ・ Tree completed Figure 3 Figure 4 Halfway floor omitted Unit A ↓ Midway Unit Mibahi Halfway floor omitted O' ψ Ko Figure 5 Figure 6 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 Figure 12 Figure 13

Claims (4)

[Claims] (1) In an elevator group management control method in which multiple elevators are put into service for multiple service floors and these multiple elevators are centrally controlled, the elapsed time from the generation of a hall call is determined in advance. A long-lasting reserve floor belonging to a floor on which a first predetermined time has elapsed and whose predicted arrival time until the service elevator for the hall call arrives at the floor is expected to exceed a second predetermined time. 1. A group management control method for an elevator, characterized in that the method is selected as follows. (2) In the elevator group management control method, in which multiple elevators are put into service for multiple service floors, and these multiple elevators are centrally controlled and arrival forecast is made, the elapsed time from the occurrence of a hall call is calculated. The elevator belongs to a floor on which a predetermined first predetermined time has elapsed, and the predicted arrival time for the service elevator for the hall call to arrive at the floor is expected to exceed a predetermined second predetermined time. A predicted arrival time to the long-lasting spare floor of an elevator that is scheduled to stop at the long-lasting spare floor at a call is determined. A group management control method for elevators, characterized in that when the minimum predicted arrival time is smaller than a predetermined third predetermined time, the arrival forecast is changed to the elevator with the minimum predicted arrival time. (3) In an elevator group management control method in which multiple elevators are put into service for multiple service floors, and the multiple elevators are centrally controlled and arrival forecast is performed, the elapsed time from the generation of a hall call is predicted. A floor on which a predetermined first predetermined time has elapsed [belongs to a floor for which the predicted arrival time for the service elevator for the hall call to arrive at the floor is expected to exceed a predetermined second predetermined time] The predicted arrival time of an elevator that is selected as a long-lasting spare floor and does not have an assigned hall call before the long-lasting spare floor is calculated, and the minimum predicted arrival time is set to 75≧・, as determined by the predetermined rule. A group management control method for elevators, characterized in that the arrival forecast is changed to the elevator with the smallest predicted arrival time within a third predetermined time. (4) In an elevator group management control method in which multiple elevators are put into service for multiple service floors, and the multiple elevators are centrally controlled and arrival forecast is performed, the elapsed time from the generation of a hall call is predicted. A floor belonging to a floor for which a predetermined first predetermined time has elapsed, and for which the predicted arrival time for the service elevator for the hall call to arrive at the floor is expected to exceed a predetermined second predetermined time. The long-waiting spare floor of an elevator that is selected as a long-waiting spare floor, and the non-response time becomes longer than a predetermined fourth predetermined time by stopping at the long-waiting spare floor. An elevator characterized in that the predicted arrival time for the elevator is determined, and when the minimum predicted arrival time is within a predetermined third predetermined time, the arrival forecast is changed to the elevator with the minimum predicted arrival time. Group management control method.