JPH0253355B2 - - Google Patents

Description

[Detailed Description of the Invention] (a) Description of the Technical Field The present invention relates to a group management control method for elevators.
In particular, the present invention relates to a group management control method for elevators when there is a high demand for descending.

(b) Description of the Prior Art In recent years, as high-rise buildings have become popular, multiple elevators are put into service, and when a common hall call button is pressed for each elevator, the elevator that serves the hall call is immediately determined. A group management control method has emerged that displays to customers waiting in a hall a forecast of the elevator that will serve the hall call. In such a group management control method, it is necessary to instantly determine the most suitable elevator in response to ever-changing traffic demands, so it is especially important to respond to calls for ascending halls during lunch or leaving work in a building exclusively owned by one company. In contrast, when the demand for descending hall calls is extremely high, there are frequent cases where the hall becomes full in response to a descending hall call on a relatively upper floor, and the hall passes through a descending hall call on an intermediate floor. This phenomenon is more noticeable in halls on lower floors during the demand period.

(c) Purpose of the Invention The present invention has been made in view of the above points, and is intended to be used during demand periods when there are significantly more descending hall calls than ascending hall calls (referring to descending hall calls during lunch and leaving work).
Then, by storing and accumulating the load entered during the descending hall call for each floor, determining the floor with the least boarding load at that time, and servicing said floor with priority, the descending hall call The present invention provides a group management control method that can average the services on each floor even when there are frequent occurrences.

(d) Description of an embodiment of the invention An embodiment of the invention will be described below with reference to the drawings.

First, the configuration of a system to which the present invention is applied will be explained using FIG.

In Fig. 1, 1 is a hall call registration circuit that acts commonly on all elevators, and when registering a hall call, the corresponding floor and direction registers are set, and a condition is established for the car to travel to the hall call floor in the same direction as the hall call. It will be reset when you arrive.

2A to 2H are elevator operation control devices provided for each of the eight elevators, and are provided with car status buffers 3A to 3H and car call registration circuits 4A to 4H. Above basket status buffers 3A to 3H
stores information about the car's position, driving direction, door opening/closing status, whether the car is decelerating or not, and the load inside the car for each car. The car call registration circuits 4A to 4H are set at the time of car call registration, and are reset when the car arrives at the call registration floor and the door is opened.

8 is a small computer using, for example, a 12-bit microcomputer, and has internal input registers 5A to 8.
5H, 6A to 6H, and 7, each external information is taken into the small computer.

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

To explain the information on the hall for each floor in detail, when a hall call is registered, the 11 bits of the HCT corresponding to that hall call become 1, and the service elevator is determined for that hall call. , 10 bits of HCT become 1, indicating that it has been allocated,
When the service elevator arrives at the floor where the hall call is registered, bits 10 and 11 are both cleared to 0.

Figure 3 shows the car status table (CAR
CONDITION TABLE) CCT, 12 bits represent each condition of one car.

That is, the <0> bit represents the open/closed state of the door,
It becomes 1 when the door is closed, and 0 otherwise. <2> Bit is
It is 1 when the car is running and 0 when it is decelerating. <3><
4> Bit represents the direction of car operation, and is “10”.
If it is the UP direction, "01" means the DN direction, and "00" or "11" means the car has no direction. <5>～
<9> bits represent the car position in binary, <10>
<11> Bits represent the load of the car, and “00” is 0.
~45%, "01" is 45% ~ 60%, "10" is 60% ~ 80%,
“11” represents 80% or more.

Next, the present invention will be explained using the flowchart shown in FIG. 4 and subsequent figures.

In FIG. 4, after the program starts, the RAM table in the small computer 8 is initialized and the program goes to repeat, start, point (RSP).

Next, after reading the current state of the car for each car according to the CCT shown in Figure 3, check whether the door is closed or not, and if the door is closed, whether it was previously in front of the door or whether the door has started closing. , and calculate the amount of load change on the floor (index) where the car has stopped until now when the door is closed using equation (1) shown below.

△W(I)=Wcur(I)−Wprv(I) …(1) Here, Wcur(I) is the load on the floor when the door is closed,
Also, WprV(I) represents the load when the car starts decelerating to the floor.

Next, in order to find the increase in the load on the floor, check whether △W(I) obtained using equation (1) is positive, that is, if △W(I) becomes positive when the load increases, If not
Go to A1, and if it is positive, add △W(I) to the transport load WEIGHT(I) from the floor to the other floor up to this point.

Next, the number of users on a floor WCONST(I), (the number of users WCONST(I) can be determined in advance by knowing the number of tenants on each floor, and if it is a building exclusively owned by one company, each floor It is also easy to be informed of the number of people coming to work each day), and traffic demand that is expected to rapidly decrease (for example, during lunch time when the cafeteria floor is located on the basement floor, and at the time of leaving work) has started. By subtracting the transport load WEIGHT(I) for each floor from the point in time, the remaining transport load WIDO(I) of the actual total transport load on the day is calculated.

After calculating the above △W(I) and WIDO(I) for all machines, as shown in Figure 5, set the counter K of the unassigned hall call of the descending hall call to O, further set the hole index to 0, and set the symbol Proceed to B1.

In B1, <10> and <11> of the hole condition table HCT in the format shown in Figure 2 are used.
By checking the state of the hole with the bit, for example, if it is “00”, it means that the hole is not called and goes to B2.
If it is "11", there is a hole call and the allocation has already been completed, so in either case the process advances to B2, the hole index is set to +1, and the status of the next hole is determined.

Hall condition table HCT <10>,
When the <11> bit is “01”, there is a hall call and the allocation of this hall call has not been completed, that is, there is an unallocated hall call, so the hall index is stored in the unallocated hall call floor storage memory (symbol
FLOOR (K) is stored in the RAM area of the small computer 8 (not shown), and the process proceeds to determine the state of the hall on the next floor.

The above operation is performed until the hole index reaches FMAX.
-2 (Here, FMAX represents the number of floors served by the elevator, and the hall index is assigned as 0, 1, etc. from the top floor descending hall, so the first time to exceed FMAX -2 is , the lowest floor ascending hall), that is, after all descending hall searches are completed, when K = 0, that is, when there is no unassigned hall call among the descending halls, the symbol RSP is Go ahead, K
When ≠0, that is, when there is an unallocated hall of at least one floor or more among the descending halls, the process proceeds to symbol C.

In symbol C, as shown in Figure 6, the maximum value MAX of the remaining transport load WIDO(I) on each floor is MAX=O
Initializes the unassigned hall call floor storage memory floor FLOOR (L) of the descending hall call to the remaining transport load up to the present moment.
Compare the size of WIDO (M) and MAX with L=OK~K
If WIDO (M) is large, update the MAX value with the value of WIDO (M), store the maximum floor M in the maximum remaining transport load floor MAXF, and update the unassigned descending hall floors up to the present time. Find the floor with the maximum remaining transport load.

Next, assignment of unassigned hall calls to cars will be explained using the drawings. In the process shown in FIG. 7, the evaluation value of the arrival time of each car is calculated.

In the process shown in FIG. 8, the evaluation value of the arrival time of each aircraft is compared to select the optimal aircraft, and further,
Additional assignments are prohibited for the machine assigned to the floor with the maximum remaining transport load.

9 and 10 show details of the evaluation value calculation of the arrival time shown in FIG. 7.

In determining the service basket in this embodiment, first, among the multiple unassigned halls, the service basket is determined to the hall with the maximum remaining transport load, and then the service basket is determined sequentially from the unassigned halls on the higher floors. This is what we do.

In determining the service car, the evaluation value of the arrival time of each car is calculated, and the car with the minimum evaluation value is assigned as the car.

In this calculation of arrival time, it is possible to simply calculate the arrival time to an unassigned hall, but in this embodiment, the arrival time is calculated by taking into consideration the already allocated calls that are ahead of the unassigned hall call. It performs calculations.

Next, it will be explained in detail using the drawings.

First, the determination of the assigned car for the hall call on the floor with the maximum remaining transport load will be explained. As an example, let us assume that a building with 10 floors is the target, and the maximum remaining transport load is the 7th floor.

In FIG. 7, the value of the maximum remaining transport load floor MAXF is substituted into the hole index at symbol D. Since MAXF is on the 7th floor, the hall index is 3. Here, the hole index is a value that starts at "0" at the top floor and increases by "1" as it goes down. for example,
In a building with 10 floors, the hall index for the 10th floor is "0", the 9th floor is "1", and the 8th floor is "2".
Similarly, the hall index on the first floor is "10".

Next, it is determined whether the hole in the hole index is a hole with an unallocated hole call. Now, since the 7th floor with hall index = 3 is a floor with an unassigned hall call, the process of setting the car index J to "1" is executed. Here, in this embodiment, three elevators are targeted. Let the car index corresponding to car No. A be ``1'', the car index for car No. B be ``2'', and the car index for car No. C be ``3''.

Next, check whether additional allocation is prohibited for machine A, and if it is a prohibited car, set the evaluation value S(J) to ∞ (actually, set the largest positive integer among finite values), and change the car index. Let J be J=J+1,
Symbol D2 and subsequent symbols are executed for machine B.

Here, the evaluation value S(J), which will be described later, is a value obtained through a predetermined function of the arrival time, and the larger the value, the worse the evaluation, and the smaller the value, the better the evaluation.

If additional allocation is not prohibited for car A, the evaluation value S(1) of the arrival time is calculated, and by setting the car index J to J=J+1, the arrival time for other cars (car B, car C) is calculated. evaluation value S(2),
Perform the calculation of S(3).

The calculation of the evaluation value of the arrival time will be described in detail later. When the evaluation value calculation of the arrival time is completed for all the cars, as shown in Figure 8, the car with the smallest evaluation value S(J) is selected from all the cars and assigned to the call of the highest floor MAXF with remaining transport load. It will be done. For example, A
If the evaluation value S(1) of car No. 1 is the smallest, car No. A is selected, and car No. A is assigned to the hall call on the 7th floor, where the remaining transport load is the largest.

Next, the hall index is the floor with the maximum remaining transport load.
Check if MAXF is indicated. Now, the hall index is 3, which indicates the 7th floor, which has the maximum remaining transport load, so additional allocation is prohibited for the A car.

The above completes the assignment of the hall call for the floor with the maximum remaining transport load.

Next, set the hole index to “0” and 10
The search is performed sequentially from the descending hall call of the floor, and if there is an unassigned hall call, the assigned machine number is determined each time.

At this time, since additional allocation is prohibited for car A, car A will not be allocated to an unallocated hall call other than the floor with the maximum remaining transport load.

As described above, after first determining the machine number to be assigned to the unassigned hall call on the floor with the maximum remaining transport load, once the assignment is completed to the unassigned hall call on other floors, the symbol
Return to RSP.

Next, the calculation of the arrival time evaluation value S(J) will be explained in detail using FIGS. 9 and 10.

For example, allocation of the floor with the maximum remaining transport load (7th floor) to an unallocated hall call will be explained.

The calculation of the arrival time evaluation value S(1) for aircraft A will be explained. For example, suppose that a down hall call for the 7th floor occurs while the car of car A is ascending the 5th floor, and at that time, down hall calls for the 4th and 3rd floors have already been assigned to car A.

In this example, the evaluation value S(1) is defined as the arrival time to an unallocated hall call (7th floor hall call)
It is calculated from the sum of the evaluation value of TRESP(I) and the evaluation value of TRESP(ni), the arrival time to the allocated call before the unallocated hall call. FIG. 9 is a flowchart showing the process of calculating the evaluation value of the arrival time TRESP(I) to an unassigned hall call, and FIG.
FIG. 7 is a flowchart showing a process for calculating an evaluation value of TRESP(ni).

From symbol D2A, the arrival time TRESP(I) to the unallocated hall (7th floor) call is calculated from the following formula.

TRESP(3)=TRAN(5,7)...(1) TRAN(5,7) represents the travel time from the 5th floor to the 7th floor.

Next, the target average value TAVE of arrival time, which is set in advance by considering the traffic demand of the building, and the arrival time
Find the difference x from TRESP(I), round off x to an integer, use the first function if x is positive, and use the second function if x is negative,
Convert to evaluation value y.

In this embodiment, a case will be described in which a cubic function (inclination, ie, coefficient 1) is used as the first function, and a quadratic function (coefficient 1) is used as the second function.

Now, when x is positive, use TBL ₁ , which is a table of the first function, the cubic function (coefficient 1), as shown in Figure 11, and find the value of TBL ₁ corresponding to the corresponding x. When x=2, the evaluation value y is 8 (x
= 2, then TBL ₁ (2) = 8). Also, when x is negative, use the second function after converting x to positive,
As shown in Figure 12, the evaluation value y is determined using the quadratic function (coefficient 1) table TBL ₂ .

Next, the evaluation value y is set as the initial value of the evaluation value S(J).

For example, if the evaluation value y of TRAN (5, 7) is 27, the initial value of the evaluation value S(3) is 27.

Next, the _unallocated hole (7
Floor) Select the already allocated call ahead of the call.

In the figure, n ₁ ...n _k are hole indices of already allocated calls.

Currently, the descending hall calls for the 4th and 3rd floors are assigned to the machine A, which is ascending the 5th floor, so n ₁ = 6
Therefore, n ₂ =7. At this time, k=2.

Next, the arrival time of the assigned call TRESP(ni)(i=
1 to k) are determined by the following equation (2).

TRESP (ni) = _l-1 〓 ^m=1 TRAN (αm, βm) _l-1 〓 ^m=1 TLOS (βm) …(2) Here, TRAN (αm, βm) is
It represents the travel time to the floor, and TLOS (βm) represents the total time of door opening/closing and opening time on the βm floor.

Furthermore, l is the number of floors (including the nith floor) that the car stops on the way before reaching the nith floor.

When TRESP (n ₁ ) is calculated from the above formula (2), TRESP (n ₁ ) = TRAN (5, 7) + LOS (7) + TRAN (7,
4)…(3) becomes.

Next, in the same way that we obtained the evaluation value of the arrival time TRESP(3) to the unallocated hall (7th floor) call mentioned above,
The evaluation value y of TRESP(n ₁ ) is determined, and the evaluation value y of TRESP(n ₁ ) is added to S(1), which is the initial value of the evaluation value S(J), to update the evaluation value.

Next, i=i+1, so i=2,
The calculation of TRESP(n ₂ ) is similarly performed to obtain the evaluation value y, and the evaluation value S(1) is updated.

That is, the finally obtained evaluation value S(1) is the evaluation value of the arrival time to the unassigned hall (7th floor) call, the evaluation value of the arrival time to the allocated hall (4th floor) call, and the evaluation value of the arrival time to the unassigned hall (7th floor) call. This is the sum of the evaluation value of the arrival time to the allocated hall (3rd floor) call.

As described above, the evaluation value S(1) of machine A when an unallocated hall call occurs on the 7th floor is obtained.

As a result of the above, including the floor with the maximum remaining transport load,
For all unallocated hall calls, the evaluation value S(J) of the arrival time of all cars is calculated, and the car with the minimum S(J) is selected and notified to the customers waiting in the hall as a service car.

(e) Effects of the present invention As explained above, according to the present invention, the remaining transport load (WIDO) can be obtained by subtracting the transport load (WEIGHT) up to the present time from the number of users (WCONST) for each descending hole. Therefore, in order to find the floor with the minimum transport volume, that is, the floor with the maximum remaining transport load, and service that floor with the highest priority, it is possible to equalize the transport volume on each floor, that is, to equalize the service level on each floor. can.

The present invention can be expected to be even more effective when the demand for descending hall calls is extremely greater than for ascending hall calls, such as during lunch time and dismissal time in a building exclusively owned by one company.

[Brief explanation of drawings]

1 to 3 are diagrams showing the configuration of a system to which the present invention is applied, and FIGS. 4 to 10 are flowcharts illustrating the control method of the present invention.
1 and 12 are diagrams showing tables for obtaining evaluation values for selecting service elevators used for explaining the present invention. 1...Hall call recording circuit, 2A-2H...Operation control device, 3A-3H...Car status buffer, 4A-
4H...Car call registration circuit, 5A~5H, 6A~6
H, 7...Input register, 8...Small calculator, HCT
…Hole condition table, CCT…Cage condition table.

Claims (1)

[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, demand for descending hall calls is significantly higher than for ascending hall calls. At times, each time a car responds to a descending hall call, the boarding load at that floor is measured, and the remaining transport load for each floor is determined by subtracting the boarding load from the total transport load preset for each floor. A group management control method for elevators, characterized in that calculations are performed to determine a service car starting from the floor with the largest remaining transport load, and further allocation to this service car is prohibited.