JPH0217470B2 - - 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 technique for averaging the occurrence distribution of hall call waiting times.

(b) Description of the Prior Art In recent years, group management control devices that control a plurality of elevators have generally used small-sized computers such as microcomputers. In such a case, in order to determine the service response elevator for a hall call command that occurs,
A so-called evaluation formula is used. Although there are various forms of this evaluation formula, the evaluation value f is usually expressed by the following formula 1.

f = F (MX, KXmax) ... (1) where KXmax = KXi + Tj MX: Predicted arrival time to the hall call to be allocated, KXi: Predicted arrival time to the already allocated call, Tj: Time after the hall call is registered Duration time, KXmaX: Maximum predicted arrival time of an assigned call. Generally, as a service index for elevator group management, the time from the time a hall call occurs until the elevator arrives in response to that hall call (hereinafter referred to as waiting time) is the service index for elevator group management. (abbreviated as time) is short, the maximum waiting time is small, and individual waiting times are averaged out.

In conventional group management, when allocating a newly generated hall call, an attempt is made to average the waiting time by using the maximum predicted arrival time of the previously allocated call as an evaluation element for each car. came.

However, the above method is expected to indirectly average the service by determining the allocation based on the above-mentioned evaluation, and has poor follow-up ability when traffic demand changes suddenly, resulting in a decrease in hall call waiting time. The occurrence distribution, that is, the distribution of service time, covers a wide range, and it is not possible to obtain an allocation that provides fair service.

(c) Purpose and Summary of the Invention The present invention has been made in view of the above-mentioned points. In an elevator group management control method in which a service elevator is determined using a predetermined evaluation calculation method, when determining a service elevator for a newly generated hall call, the hall call service distribution for a certain period of time or a certain number of past hall calls is used. In other words, mathematical indicators such as the average value, maximum value, standard deviation value, etc. of the response distribution are calculated, and based on these mathematical indicators, the evaluation function for performing the predetermined evaluation calculation is selectively changed, and the hall call service is When traffic demand fluctuates rapidly, the distribution, that is, the response rate distribution, is actively controlled to be distributed within a narrow range centered on the maximum cumulative value of the number of services, and the hall call services are quantitatively averaged. However, the present invention provides a service group management control method that allows fair service to be obtained.

(d) Embodiment of the Invention An embodiment of the present invention will be described below with reference to the drawings.

First, a building targeted by this embodiment will be explained with reference to FIG. The building schematically shown in Figure 1 is a 10-story building with four elevators, A, B, C, and D. The second to sixth floors are express zones, so that each elevator does not stop. It's getting old.

Each of the elevators A to D installed in such a building is controlled by a group management control device shown in FIGS. 2 and 3.

In Figures 2 and 3, 1 is a hall call command registration circuit, in which registers for the corresponding floor and direction are set when registering a hall call command, and are reset when the car arrives at the hall call command floor. It is. 2A to 2D are elevator operation control devices provided for each of the four elevators A to D, and car state storage circuits 3A to 3D and car call storage circuits 4A to 4D are provided respectively. The car state memory circuits 3A to 3D are buffers for the car position, driving direction, load signal, etc.
The car call storage circuits 4A to 4D are set when a car call command is registered, and are reset when the car arrives at the floor where the call command is registered.

5 is a wiper select circuit. For example, 6 is 8
This is a small computer using a BIT microcomputer, and has an output register 7, an input register 8, and an output register 9. Above output register 7
and 9 have a function of holding the same output until the next output is issued. Reference numeral 10 denotes a master condition storage circuit which stores information on whether or not each elevator can be inserted into a group. This information is stored in the RAM as the MCT shown in FIG. 3.

In the device having such a configuration, the wiper select circuit 5 operates according to the sub-address signal output from the output register 7 of the small computer 6, and selects data from the traffic data group according to the select code output from the output register 7. Predetermined traffic data is sequentially selected, and information outside the computer is stored in a memory area within the computer via the input register 8 of the small computer 6. Based on this information, the allocated car is determined for the hall call command generated, and the RAM of the computer 6 is
memorize it internally.

In other words, in FIG. 3, the master condition storage unit MCT14, the car condition storage unit CCT
15. The evaluation value calculation unit 18 calculates an evaluation value based on the evaluation formula (1) based on the information stored in the hall condition storage unit HCT 16 and the predicted arrival time storage unit YREST 17, and stores each evaluation value in the evaluation value storage unit 19. The evaluation value is stored for each car, and the optimum elevator calculation unit 20 determines the service elevator for a newly generated hall call, and outputs it from the output register 9.

The data output from the output register 9 is decoded by the decoding circuit 13 shown in FIG. 2, and stored as an assigned call in the hall call allocation memory circuits 12A to 12D of the assigned car. At the same time, the data is decoded by the hall lantern (not shown) of the assigned car. Display the forecast.

The hall call allocation memory circuits 12A to 12D are combined with the hall call memory circuit 1 to form the hall condition memory circuit 11, and are connected to the RAM of the hall condition memory unit HCT16 shown in FIG. 3 via the wiper select circuit 5. memorize it internally.

Note that the arrow lines connecting each circuit in FIGS. 2 and 3 indicate a plurality of parallel signal lines, for example eight. Furthermore, all the registers have a number of bits corresponding to one word of the small computer 6.

Further, the car condition table CCT15 stored in the RAM of the computer 6 has a bit configuration as shown in FIG. The 0th bit indicates running or stopping, and when it is "1" it is running, and when it is "0" it is running.
indicates a stop. The 1st and 2nd bits indicate the direction of elevator movement; "01" indicates the upward direction, "10" indicates the downward direction,
When it is “00”, there is no direction. Bits 3 to 7 indicate the elevator position, for example “00001”
When it is "00010", it is on the 1st floor, when it is "00010" it is on the 2nd floor,
“01010” indicates that you are on the 10th floor.

Hall condition table HCT is the fifth
The bit configuration is as shown in the figure. In addition,
Bits 0 to 3 are set bits for the allocated hall call command for each elevator, and bit 6 indicates completion of allocation when it is ``1'' and indicates incomplete allocation when it is ``0''. Further, the 7th bit indicates that there is a hall call command when it is "1" and that there is no hall call command when it is "0".

In the group management system described above, a hall call is now generated on an arbitrary floor, and the process of determining a service elevator for that hall call will be explained.

In Figure 6, starting from Q1 and starting from Q2
The RAM initialization subroutine entry address is set, and in Q3 the car status of each elevator is sent to the car condition storage unit CCT1 shown in FIG. 3 via the wiper select circuit 5 shown in FIG.
5. Store in the RAM of the car call storage unit KCT21 (select codes 8 to 21) Initialize the hall index J for scanning the hall status in Q4, and assign the newly generated hall call. Evaluation function described below used to determine
In step Q4 to select f _{( )} , the hole index J is set to J = 1 and 10D (10th floor downhole call).
Find out. The presence or absence of a hall call is indicated by the 7th bit "1" or "0" shown in FIG. 5 of the HCT of the hall condition storage unit 16 shown in FIG. Since it is given by "1" and "0" of the 6th bit shown in the figure, in step Q5, depending on the combination of the 6th and 7th bits, 0.0...No hole call...no assignment 0.1...with hole call...no assignment 1.1……Hall call present…Assignment present 1.0…Hall state not present…Assignment present condition can be used to determine the hall state.

Hole condition storage section 16 shown in FIG.
If the data combination of the 6th and 7th bits shown in Figure 5 of the HCT is (a) 0.0, in step Q6, set the hall call duration counter (not shown) to Tj = 0 and set D.
Proceed to.

(b) In the case of 1.0, the hall call duration counter is set to Tj=Tj+1 in step Q9, and the value of Tj at that time is stored in the hall call duration data table DATATBL21 shown in FIG. Hall call duration data table
A certain area is prepared in the RAM for DATATBL21, and when the newest data of the hall call duration is written, the oldest data will be erased if the data table 21 is already full. ing.

(c) In the case of 0.1, after setting the hall call duration counter to Tj = Tj + 1 in step Q2, in steps Q11 and Q12, the evaluation function f ( selected in step Q4) is added to the evaluation formula of equation ₍ 1). ₎ , the evaluation value f is calculated for all machines.

(d) In case of 1.1, set Tj=Tj+1 in step Q7 and proceed to D. In this way, the service elevator is determined for unallocated hall calls for all floors from J=1 to J=18.

Next, in step Q16 in Fig. 7, the hall call duration data table DATATBL shown in Fig. 3 is
21 data, the hall call service distribution, that is, the response rate distribution, calculates mathematical indicators such as the average value, maximum value, standard deviation value, etc.
Return to A in the diagram.

Figure 8 is a diagram showing an example of hall call service distribution, where the horizontal axis is the frequency of waiting time (for example, the waiting time is divided into 5 seconds), and the vertical axis is the cumulative number of services corresponding to each frequency. values, ie, response rates.

Note that the response rate here is the percentage of the number of hall calls for which service has been completed for each frequency to all hall calls that occurred in a predetermined period of time.

In Fig. 8, (a) is an example in which responses are frequently answered in a short time, but the long-lasting time T _MAX1 is large, and the average waiting time T _AVR1 is not in a good condition.
In (b), the center of the hall call service distribution is the long waiting time.
In this example, the average waiting time is T _MAX2 , and the average waiting time T _AVR2
( _c )
has a good center of hall call service distribution,
This is an example in which both the average waiting time T _AVR3 and the long waiting time T _MAX3 are small, and the state of the hall call service is close to ideal.

Next, the evaluation value f and the evaluation function will be explained. In this embodiment, the evaluation value f is calculated using the following equation (2). However, the evaluation function F(MX,
KXmax) is expressed as f _(i) (MX, KXmax) below. Here, f _(i) is the evaluation function system itself with index i
This indicates that the selection is made by

f=f _(i) (MX, KXmax) ...(2) MX: Predicted arrival time to the assigned hall call KXmax; (duration time after the hall call is registered) + (predicted arrival time to the farthest assigned hall call) Furthermore, in this embodiment, the evaluation function f _(i) is shown in Fig. 10a,
Three types of cases, b and c, were applied. That is, in Fig. 10, a indicates the case of the first evaluation function f ₁ , f=f ₁ (MX・KXmax)=f _1a (MX・KXmax) +f _1b (MX・KXmax) However, in 0t<t _G1 f _1b = 0 tt In _G1 , f _1a = 0, f _1b = (t-t _G1 ) 〓 At t = 0, f _1a = f ₁₀ In t = t, f = 0 in _G1 b is the second evaluation function f ₂ and f=f ₂ (MX・KXmax)=f _2a (MX・KXmax) +f _2b (MX・KXmax) However, 0t<t For _G2 , f _2b = 0 tt For _G2 , f _2a = 0, f _2b = (t −t _G2 )〓 At t=0, f _2a = f ₂₀ At t=t _G2, f=0 c indicates the case of the third evaluation function f ₃ , f=f ₃ (MX・KXmax)=f _3a (MX・KXmax) +f _3b (MX・KXmax) However, 0t<t In _G3 , f _3b = 0 tt _{In G3} , f _3a = 0, f _3b = (t-t _G3 )〓 At t=0, f _3a = f ₃₀ t=t In _G3 , t=0 In the first, second, and third evaluation functions above, the evaluation value at t=0 is f ₁₀ < f ₂₀ < f ₃₀ , and the power numbers of f _1b , f _2b , and f _3b are There is a relationship α<β<γ, and t _G1 , t _G2 ,
t _G3 is the value of t when f=0, and is a constant value unique to the building, and its value is determined in advance by simulation.

Note that f _1a , f _2a , and f _3a in FIG. 10 are monotonically decreasing functions that take values satisfying the relationship f _1a < f _2a < f _3a for the same time t. Specifically, as will be described later, evaluation values corresponding to each time t are set in the tables shown in FIGS. 11a to 11c. The evaluation value to be set may satisfy the relationship f _1a < f _2a < f _3a .

Next, the evaluation function shown in step Q4 in Figure 6
The selection of f _{( )} will be explained with reference to FIG.

A ₁ to B in Figure 9 is a detailed flowchart of A ₁ to B in Figure 6, where A ₁ has already been calculated in the previous cycle as described later.
The standard deviation S of the data in DATATBL21 has already been set as a pill-specific value in the reference index storage unit (not shown).
Compare with the reference standard deviation value _K1 set in .
If the comparison result is S≦K ₁ , it means that the hall call service distribution is distributed in a narrow range as shown in Figure 8c, so the distribution form of the hall call service distribution is considered to be level 0. Figure 10a
Select the evaluation function f ₁ shown in .

Furthermore, if the above comparison result is S>K ₁ , it is considered that the hall call service distribution is expanding, but the average value of waiting time has already been set as a building-specific value in the standard index storage unit. The standard maximum waiting time K ₃ is compared with the average waiting time value K 2 and if the result is ≦K ₂ , the maximum waiting time t _nax for answered calls has already been set in the standard index storage unit as a building-specific _value. If t _nax ≦K ₃ , the hall call service distribution has spread, but the service status of each hall call is considered to be good, so the distribution form of the hall call service distribution is considered to be level 0. Select evaluation function f ₁ .

If the above comparison is S>K ₁ , ≦K ₂ , t _nax >K ₃ , the hall call service distribution is estimated to be as shown in Figure 8a, so the distribution form of the hall call service distribution is set to level 1. Therefore, the evaluation function f ₂ shown in FIG. 10b is selected.

In addition, if the above comparison is S>K ₁ , >K ₂ , the hall call service distribution is estimated to be the distribution shown in Figure 8b, so the distribution form of the hall call service distribution is considered to be level 2, and the distribution form in Figure 10 is Select the evaluation function _f3 shown in c.

Each evaluation function f ₁ , f ₂ , f ₃ shown in FIG. 10 a to c
If the evaluation formulas f _1a , f _2a , and f _3a have the same t, the evaluation values of the evaluation formulas f _1a , f _2a , and f _3a in
The evaluation value is set to become worse in the order of f _1a , f _2a , and f _3a , and functions to determine allocation in a direction that prevents excessive service.

For f _1b , the evaluation value of f _2b and even f _3b increases exponentially, so if there is a call that is expected to have a long wait, other allocations will be effectively limited, and the Work at.

The function systems f _1a and f _1b , f _2a and f _2b , and f _3a and f _3b act so that the hall call service distribution is concentrated in a narrow range around the maximum cumulative frequency value.

The evaluation function system shown in Figures 10a to 10c is the 11th
This can be easily realized by having the tables shown in FIGS. a to c as representative examples in the ROM area.

Next, the details of the routine shown in step Q16 in FIG. 7 are shown in FIG.

In the example of FIG. 12, based on the hall waiting time data t _i of DATATBL, (a) Average value of hall waiting time (b) Standard deviation S of hall waiting time (c) Calculation of the maximum hall waiting time t _nax is executed for each program processing cycle in order to quantitatively calculate the hall call service distribution.

(e) Effect of the Invention As explained above, according to the elevator group management control method of the present invention, a plurality of elevators are put into service for a plurality of service floors, and new hall calls common to each elevator are handled. In this elevator group management control method, a service elevator is determined using a predetermined evaluation calculation method for a service elevator. Selective changes are made based on mathematical indicators such as the average value, maximum value, and standard deviation value, so that the hall call service distribution, that is, the response rate distribution, is distributed within a narrow range centered on the maximum value of the cumulative number of services. Since the hall call service is quantitatively averaged by actively controlling the system, it is possible to follow a sudden change in traffic demand easily and to obtain a fair service.

[Brief explanation of drawings]

Fig. 1 is a schematic diagram of a building to which the present invention applies, Figs. 2 and 3 are block diagrams of a group management control device to which the present invention applies, and Figs.
Figure 6 shows the configuration of the storage unit in Figures and Figure 3.
Figure 7 Figures 9 and 12 are flowcharts for explaining embodiments of the present invention, Figure 8 is a diagram for explaining the present invention, and Figure 10 is an evaluation to which the present invention is applied. FIG. 11 is a diagram showing an example of functions, and is a table showing the evaluation function of FIG. 10.

Claims (1)

[Claims] 1. In a group management control method in which a plurality of elevators are put into service for a plurality of service floors and a service elevator is determined using a predetermined evaluation calculation method for a newly generated hall call common to each elevator, As the evaluation function for calculating the predetermined evaluation, a plurality of functions are provided whose evaluation value takes a minimum value in the set waiting time, and the average value is calculated from the mathematical index of the response rate distribution of hall calls that have already been answered for a predetermined time or a predetermined number of calls. , calculate the maximum value and standard deviation value,
A group management control method for elevators, characterized in that one of the plurality of evaluation functions is selected according to the mathematical index.