JPS6361260B2 - - Google Patents

Description

[Detailed description of the invention]

The present invention relates to an elevator group management control method for determining a service elevator in response to a newly generated hall call command. Recently, when a plurality of elevators are installed in parallel, responses to hall call commands from the halls on each floor are assigned to one of the elevators in order to improve the operating efficiency and service of the elevators. That is, when a hall call command occurs, the elevator suitable for handling the hall call command is predicted, and the elevator that responds to the hall call command is assigned at an early stage, while other elevators do not respond to the hall call command. That's what I do. As the above-mentioned allocation method, it has conventionally been considered that the best method is to predict which elevator will arrive first at the floor where the hall call command has been issued, and to allocate the call command to that elevator. Therefore, various methods have been considered for predicting which elevator will arrive first. For example, prediction is performed by calculating the predicted time until the elevator arrives at each floor. However, with the above allocation method, when considering the service for the entire hall call command, an inconvenient phenomenon occurs, especially when the hall is crowded. For example, if hall call commands that occur one after another are always assigned to the elevator that can handle the hall call commands first, the response to the hall call commands that have already been assigned will be delayed, resulting in a hall call command with a very long waiting time. arise. This phenomenon is
Even if it is judged that it can be dealt with quickly when a hall call command is assigned, other hall call commands may be assigned or a new car call command from inside the elevator may occur, causing the elevator operating status to deteriorate. It occurs because it changes. Therefore, when considering the waiting time for the entire hall call command, significant non-uniformity occurs. In particular, there is a high probability that a long-waiting call command with an extremely long waiting time will occur, causing a decrease in the reliability of the elevator service. Therefore, this invention provides highly reliable elevator group management that can calculate evaluation values according to the actual usage status of the hall and automatically equalizes the non-response time of each hall according to demand. The purpose is to obtain a control method. When determining a service elevator to respond to a newly generated hall call command from among a plurality of elevators provided for a plurality of floors, the invention provides a service elevator that responds to a newly generated hall call command and an existing hall call command. The predicted unanswered time for the assigned hall call command is calculated for each elevator, and the predicted unanswered time is the minimum value obtained by multiplying the average unanswered time for a certain period of time before the current time by a certain number. The present invention is characterized in that the elevator is weighted and converted into an evaluation value using a function having , and the elevator with the minimum average evaluation value is selected as the service elevator. Here, the minimum value is determined based on the average value of unresponsive time for a certain period of time in the past.The reason why the minimum value is determined is that the traffic demand in the building where the elevator is installed changes from moment to moment. This is because the target value) usually changes accordingly, so it is necessary to set the target value in line with the actual demand of the building.
Although it is set each time, the average value of the non-response time for a certain period of time in the past is used to improve followability. In addition, the reason why weighting is performed using a function with a minimum value is that it is necessary to set an optimal control target value, and using a function that increases or decreases monotonically may cause confusion among people waiting in a hall, etc. This is because the degree cannot be expressed. To give an example, if Unit A arrives in 5 seconds and Unit B arrives in 10 seconds, the difference is 5 seconds.
This is because it is unreasonable to treat the difference of 5 seconds between the arrival of Unit A in 35 seconds and the arrival of Unit B in 40 seconds as the same. By taking these into consideration, the non-response time of each hall can be automatically equalized according to demand, and highly reliable elevator group management control can be obtained. An embodiment of the present invention will be described below with reference to the drawings. First, a system to which the present invention is applied will be explained with reference to FIG. In FIG. 1, reference numeral 1 denotes a hall call command registration circuit, in which registers for the corresponding floor and direction are set when a hall call command is registered, and are reset when the car arrives at the hall call command floor.
2A to 2C are elevator operation control devices provided for each of the three elevators, including car status buffers 3A to 3C and car call command registration circuits 4A to 4.
C, quasi-car call command registration circuits 5A to 5C, and signal synthesis circuits 6A to 6C are provided separately. The car status buffers 3A to 3C are buffers that input the car status to a wiper select circuit 7, which will be described later. The car call command registration circuits 4A to 4C are
It is set when a car call command is registered, and is reset when the car arrives at the floor where the call command is registered. The semi-car call command registration circuits 5A to 5C store the hall call command assigned to the car,
It is reset when the car arrives at the hall call command floor. Command synthesis circuit 6A to 6C
outputs the logical sum of the outputs of the car call command registration circuits 4A to 4C and the outputs of the quasi-car call command registration circuits 5A to 5C. 7 is a wiper selection circuit, and 8 is a decoding circuit, which decodes an output signal from an output register 12, which will be described later, and sets secondary car call command registration circuits 5A to 5C for the corresponding floor direction of the corresponding car. 9 is a small computer using, for example, a 12-bit microcomputer, with output registers 10,
It has an input register 11, an output register 12, and an input register 13. Above output register 10
has the function of holding the same output until the next output. Note that the arrow lines connecting the registers and interface devices having the same function, which are provided in each elevator, indicate a plurality of parallel signal lines, for example, 12 lines. All registers have a number of bits corresponding to one word of the small computer 9. Next, the hall call allocation method and the automatic setting of the minimum value in this embodiment will be explained based on the flowcharts shown in FIGS. 2 to 4. In addition, the second
The figure shows the overall flowchart of this example.
FIG. 3 is a flowchart for determining a responding machine, and FIG. 4 is a flowchart for creating a weighting function table. First, start from step P1 in Figure 2,
In step P2, the writable memory in the computer is initialized, and in step P3, the status of each car (direction, position, door status, etc.) is read for all cars. Then, in step P4, the hole index K is set to O. Next, in step P5, the state of the hall (new hall call command issued, response to the hall call command completed, hall call command issued but service incomplete, hall call command not given) is determined by the method described below. That is, when the hall call command is registered in the hall call command registration circuit 1 shown in FIG. 1, the corresponding bit in the table storing the hall call command status shown in FIG. 5 becomes "1", and the hall call command is registered. When it runs out, it becomes "0". (Figure 5 is a table for determining registration/deletion of hall call commands. For example, in a building with 10 floors, the status of hall call commands is RAM
It is stored at addresses 100 and 101, and one bit corresponds to one hole. ) Therefore, when the corresponding bit changes from "0" to "1", it means that a new call command has been generated, and the process advances to step P6. Also, when the corresponding bit changes from "1" to "0", it means that the response to the hall call command has been completed.
After storing the unresponse time T _I of the hall call command in step P7, T _I =0 is set in step P8 and the process moves to step P9. If the corresponding bit changes from "1" to "1", there is a hall call command, but the service is not completed, so at step P10, the unresponse time T _I for the hall call command is counted up by "+1", and the process moves to step P9. . If the corresponding bit changes from “0” to “0”, there is no hall call command and there is no change, so the step
At P8, T _I is set to 0 and the process moves to step P9. Step P6
Now, in response to the newly generated hall call command, the responding machine is set to the third
It is determined by the method described in the flowchart in the figure, but
First, the allocation of hall call commands for the i floor will be explained using mathematical formulas. In other words, the predicted arrival time (predicted waiting time) T _j ⁱ of car j to the i-floor hall is determined by the time required for car j to travel from its current position to the i-floor hall, and the time required for car j to travel from its current position to the i-floor hall, as well as the time required to stop on the way to the i-floor hall. (mainly acceleration/deceleration time, door opening/closing time, and opening time)
It is found as the sum of Next, when the hall call command for floor i is assigned to car j, the predicted waiting time for the hall call commands already assigned for car j is T _j ^k1 , ..., T _j ^kn (kn = number of hall call commands already assigned). It is determined by the following formula. however,
Only the call command (assigned hall call command) that stops after the i floor changes (delays) the predicted waiting time. T _j ^kl = (time elapsed since the hall call command for the kl floor was issued) + (estimated waiting time until the car arrives at the kl floor) + (time required for car j to stop at the i floor)
...(1) However, the KL floor is a floor that stops after the i floor,
For the floor to be stopped first, the time required for the car to stop at the i floor is not required in the above equation. Based on the above formula, the hall call command for the i floor is A,
Average evaluation value when assigned to 3 cars B and C
E _j is determined by the method described below. First, the evaluation value for each call command is the predicted waiting time T _j ⁱ (j = A, B, C) of each car to the i floor, and the already allocated hall call command because the 1st floor hall call command has been assigned. The predicted waiting time T _j ^k1 ,..., T _j ^kn (j=A, B, C),
Using the characteristics shown in FIG. 6, which will be described later, f(T _j ⁱ ),
It is found as f(T _j ^k1 ), ..., f(T _j ^kn ). Therefore, the average evaluation value E _j (j=A, B, C) for each car
is determined by the formula below. E _j = 1/kn + 1 { _ko 〓 ^l=1 f (T _j ^l ) + f (T _j ⁱ )} ...(2) After calculating the average evaluation value of all three machines using this formula (2) , the minimum average evaluation value E _MIN is calculated using equation (3). E _MIN = min (E _A , E _B , E _C ) ...(3) The car corresponding to E _MIN in equation (3) becomes the service elevator in the hall on the i floor and displays a forecast in the hall. Incidentally, FIG. 6 is a characteristic diagram used for weighting the predicted waiting time when obtaining the evaluation value for each call command. This characteristic diagram shows the function as it is set in the P-ROM table, and the minimum value of the predicted waiting time T _j is
The initial setting is 15 seconds, and the function value at that time is 11.
It is. Furthermore, even if the average non-response time within a certain period of time is not 15 seconds, the shape is the same and it is simply moved horizontally in the direction of the time axis by the method described in the flowchart of FIG. Furthermore, when the predicted waiting time T _j is smaller than the minimum value, the function in FIG.
(T _j ) becomes large, which is disadvantageous. Furthermore, even if the predicted waiting time T _j takes a minimum value, the evaluation value f(T _j ) increases and becomes disadvantageous, but when the predicted waiting time T _j takes a minimum value, When the average non-response time becomes +15 seconds or more, the value of the evaluation value f (T _j ) increases rapidly,
Call commands that are predicted to have a long unanswered time are weighted to be disadvantageous. The above calculation will be explained using the flowchart shown in FIG. First, in step Q1, the predicted waiting time T _j of the floor where a new hall call command has been issued and the floor with a hall call command that has been allocated is calculated using equation (1) for machine A, and then in step Q2
Proceed to. In step Q2, the predicted waiting time T _j calculated above is
The evaluation value is determined by weighting the values according to the characteristics shown in FIG. Next, in step Q3, the average evaluation value E _j is calculated. When the A machine is completed, it is checked in step Q4 whether all the machines have been completed, and if all the machines are not completed, the process returns to step Q1, and the calculations are made for the B and C machines in the same way, and if all the machines are completed, the process goes to step Q5. Find the minimum value of the average evaluation value E _j ,
In step Q6, the elevator corresponding to the above minimum value is selected as the service elevator and the forecast is displayed in the hall. It is determined in step P9 of FIG. 2 whether or not the above operations have been carried out for all holes. If not, the process returns to step P4, and if it has been completed, the process proceeds to step P11. In step P11, it is determined whether a certain period of time has elapsed, and if it has not elapsed, the step is continued.
Return to P3, and if the time has elapsed, proceed to step P12. In step P12, calculate the average unresponsive time of all holes for a certain period of time (for example, one hour) before the current time, and if the average unresponsive time is 15 seconds, calculate the value multiplied by a certain number in step P13. (For example, the constant number is set to 1) It is set to have a minimum value at 15 seconds. Further, in accordance with the update of the set value of the non-reaction time which becomes the minimum value, the function conversion table is re-created in accordance with the flowchart of FIG. 4 in step P14. That is, in step R1 of FIG. 4, the set value B of the non-response time calculated every predetermined period of time is stored in D, and in step R2 E is set to 0, and then in step R3.
The setting value of the unresponsive time that becomes the minimum value at Store it in the area corresponding to the non-response time (average non-response time when it reaches the minimum value). For example, if the average non-response time at the minimum value is 15 seconds, TBLA (15) is
Store (0). Then, at step R5, B=B+
1. Set E=E+1 and repeat the above operation in step R6.
TBL the value corresponding to TBLA until B reaches 180.
Take it out and store it. Next, in step R7, E=181 and F=0 are set, and then D is stored in B in step R8. Then, in step R9, B=B-1 is set, and the process proceeds to step R10. In step R10, it is compared whether B is greater than or less than 0. If B≧0, the process proceeds to step R11, where E=E+F. Then press step R12.
- Load data from ROM table and TBL
Store (E) in C, then store C in step R13.
Store it in TBLA(B) and proceed to step R14. At step R14, F=F+1 is set, and the process returns to step R9, where B=B-1 is set again. In this way, the above operation is repeated until B (average non-response time when it has a minimum value) is from -1 to B=0. By the above operations (flowchart in FIG. 4), TBLA is created as a table with unresponsive time as an index. The function conversion table created in this way is as shown in FIG. Thereafter, the process returns to step P3 in FIG. 3 and repeats the same process. As described above, according to this embodiment, when determining a service elevator to respond to a newly generated hall call command from among a plurality of elevators provided for a plurality of floors, The predicted unanswered time for the hall call commands that have been assigned and the hall call commands that have already been assigned are calculated for each elevator, and the predicted unanswered time is calculated by adding a certain number to the average unanswered time for a certain period of time before the current time. The service elevator is weighted using a function that has the minimum multiplied value and converted into an evaluation value, and the elevator with the minimum average evaluation value is selected as the service elevator, so the evaluation is based on the actual usage status of the hall. A value calculation is made, and the non-response time of each hole can be automatically equalized according to demand, and reliability can be improved. Next, in order to explain the above description more specifically, the case of FIG. 9 will be explained as an example. Figure 9 is a schematic representation of a 10-story building with three elevators A, B, and C, and shows the assignment of car call commands and hall call commands and the positions of elevators A, B, and C in a certain state. It shows. In FIG. 9, □↑ and □↓ are the car, ▲ and ▼ are the assigned hall call commands, ● is the car call command, and 〓 is the hall call command that has just occurred. For example, as shown in Figure 9, Unit A goes to the 2nd floor in the up direction □↑, Unit B goes to the 4th floor in the up direction □↑, and Unit C goes down in the down direction □. Assume that you are on the 7th floor in ↓. Also, for Unit A,
There is a hall call command ▲ in the ascending direction on the 3rd floor and a car call command ● for the 8th floor. For Car B, a hall call command ▲ in the ascending direction for the 6th, 8th, and 9th floors, and a car call command ● for the 10th floor have been issued. C
For the machine, a hall call command in the downward direction on the 4th and 2nd floors▼, a car call command for the 1st floor●
is appearing. In this situation, if a hall call command is issued from the 5th floor in the upward direction, we will discuss which elevator it will be assigned to. Here, in calculating the preliminary waiting time, the hall call command,
The time required for one stop in response to a car call command is 10 seconds, and the travel time between floors is 2 seconds. In order to simplify the calculation, the elapsed time after the hall call command is generated is assumed to be 0 seconds in total. In response to the hall call command (5U) in the ascending direction from the 5th floor, B
The predicted arrival time T _B ^6U to the 6th floor in response to the hall call command from the 6th floor when assigned to the machine is as follows from equation (1): T _B ^6U = 2 × 2 + 10 × 1 = 14 (seconds) ... (4) . Using the above formula, calculate the three elevators A, B, and C and the generated call commands (car call command, allocated hall call command, and ascent to the 5th floor (5U))
When calculated and summarized in a table, the result is as follows.

[Table] In this table, the evaluation value is also calculated on the right side of the predicted waiting time, and it is calculated using the method described below. For example, when T _B ^6U =14, the evaluation value f(T _j ) when the predicted waiting time T _j is 14 seconds is 12 when read from the graph of FIG. Therefore, the average evaluation value E _j for each elevator is determined as follows using the values in Table 2 and equation (2). E _A = 1/2 (24 + 12) = 18 ... (5) E _B = 1/4 (44 + 13 + 12 + 24) = 23.2 ... (6) E _c = 1/3 (20 + 14 + 72) = 35.3 ... (7) Therefore , 5U service elevator can be found using equation (3). E _MIN = min (E _A , E _B , E _C ) = 18.0 ...(8) Therefore, the hall call command for the 5th floor UP direction is A.
Assigned to machine number. Next, the effects of this embodiment will be described in comparison with the conventional method. In other words, in the conventional method of allocating to the car with the least waiting time, min(T _A ^5u , T _B ^5U , T _C ^5U ) = min(16, 2, 50) ...(9), so car B is Minimum waiting time, 5th floor
Hall call commands in the UP direction will be assigned to machine B. However, in that case, the waiting time for the UP direction hall call commands for the 6th, 8th, and 9th floors and the car call command for the 10th floor, which are assigned to car No. B, will each increase by 10 seconds. Therefore, the probability of long waiting increases, resulting in degraded and uneven service. However, according to the allocation method described in this example, the 5th floor
Since the hall call command in the UP direction is assigned to car No. A, the number of serviced elevators is made equal, which further equalizes the waiting time and improves the service. Next, other embodiments of the invention will be described. In the above embodiment, all halls are treated equally, but it is possible to set a specific floor and weight the non-response time of that floor by a certain constant, or to change the average non-response time to a specific floor. It may be calculated excluding In this case, the steps indicated by the dashed circle in FIG.
This can be easily realized by connecting the flowchart shown in FIG. 10 between step S1 and step S4 and using the weighting table shown in FIG. 11. Figure 11 shows that the service level of 10D (downward hall call command from the 10th floor) and 1U (hall call command in the upward direction from the 1st floor) is doubled compared to normal halls, and 9U (upward hall call command from the 9th floor) is doubled. An example of creating an OMOMI table is shown in which the level of hall call command (direction hall call command) is set to an extreme level and is not used to calculate the average non-response time. Therefore, when the response is completed, it is sufficient to take out the weighting value from the OMOMI table using the hole index K and multiply it by the unresponse time T _I. That is, K=0
(10D) and K=9 (1U), the non-response time is doubled, and when K=17 (9U), T _I is always 0. Note that this invention is not limited to the above embodiments. For example, in the embodiment described above, the characteristics shown in FIG. 6 were used when weighting the predicted waiting time.
FIG. 6 is an example, and the same applies to any function as long as it has the following characteristics. (a) There is one minimum evaluation value (minimum value), and the predicted waiting time at that time is not zero. (In Figure 6, the predicted waiting time is 15 seconds) (b) When the predicted waiting time exceeds a certain value, the evaluation value becomes worse. (In Figure 6, predicted waiting time > minimum value +
15 seconds) In addition, within the scope of not changing the gist of this invention,
Of course, various modifications are possible. As explained above, according to the present invention, evaluation values can be calculated according to the actual usage status of the hall, and the non-response time of each hall can be automatically equalized according to demand. A group management control method for elevators can be obtained.

[Brief explanation of drawings]

Fig. 1 is a block diagram of a system to which this invention is applied, Fig. 2 is an overall flowchart for explaining an embodiment of this invention, and Fig. 3 shows the response machine selection routine in Fig. 2 in detail. FIG. 4 is a flowchart showing in detail the procedure for creating the function conversion table shown in FIG. 2, FIG. 5 is a diagram showing a hall call command registration/deletion determination table,
Figure 6 is a characteristic diagram showing an example of a weighting function, Figure 7 is a characteristic diagram showing an example of a weighting function.
FIG. 8 is a diagram showing a weighting function table, FIG. 8 is a diagram showing a created function conversion table, FIG. 9 is an explanatory diagram of elevator operation for concretely explaining an embodiment of the present invention, and FIG. 10 is a diagram showing a created function conversion table. FIG. 11 is a flowchart for explaining a modification of the present invention, and is a diagram showing a weighting table for each floor of non-response time in the modification of FIG. 10. 1...Hall call command registration circuit, 2A to 2C...
...Elevator operation control device, 3A to 3C...Car status buffer, 4A to 4C...Car call command registration circuit, 5A to 5C...Semi-car call command registration circuit,
6A to 6C...Signal synthesis circuit, 7...Wiper selection circuit, 8...Decoding circuit, 9...Small computer.

Claims (1)

[Scope of Claims] 1. In an elevator group management control method for determining a service elevator to respond to a newly generated hall call command from among a plurality of elevators provided for a plurality of floors, the method comprises: When determining the service elevator for a newly generated hall call command, calculating a predicted non-response time for the newly generated hall call command and the already allocated hall call command for each elevator; The predicted non-response time is calculated by multiplying the average value of the non-response time a certain amount of time before the current time by a certain number, and converts it into an evaluation value by weighting it with a function that has a minimum value, and the average evaluation value becomes the minimum. A group management control method for elevators, characterized in that an elevator is selected as a service elevator. 2. An elevator group management and control method according to claim 1, characterized in that non-response time is weighted for a specific floor. 3. A group management and control method for elevators according to claim 1, characterized in that the average non-response time is calculated excluding a specific floor.