JPS647946B2 - - Google Patents

Description

[Detailed description of the invention]

(Industrial Application Field) This invention relates to an improvement in a group management control method for elevators. (Prior Art) Generally, group management control of elevators is performed in order to efficiently operate a plurality of elevators arranged in parallel. Conventionally, dedicated sequence circuits have often been used as group management control devices for elevators. However, in order to satisfy various specifications such as the configuration of the applicable elevator body, the conditions of the building in which it is installed, and the special requirements of users, it is necessary to change the circuit design and parts each time. There were drawbacks such as unsatisfactory performance and incompatibility of hardware configurations. For this reason,
Recently, group management control devices that combine small electronic computers have been considered. Such a group management control device scans the situation in each hall of the building and, based on an appropriate evaluation formula, determines which floors are experiencing all calls.
The most suitable car is determined and the elevator is operated. (Problem to be Solved by the Invention) However, the time it takes to complete the service of each individual hall call, that is, the time from when a hall call occurs until the service car arrives at the same floor and when the passenger finishes boarding. Elapsed time, number of calls for each time period, for example, number of calls for each hole per hour, and maximum unanswered time for each time period. For example, it is difficult to equalize each time period on a daily or weekly basis. It is. For example, if a tenant changes and the initial traffic demand changes drastically,
In each case, it is necessary to use human resources or bring in measuring instruments to collect data, analyze this data, and reconsider the evaluation parameters. Furthermore, although the situation in which hall calls occur during normal times differs depending on each time zone and even from building to building, conventional group management control devices are not relevant to each building. During normal times, the system is controlled by the same parameters all at once, and even if daily actual data is fed back to the group management control circuit under group management control, it has the disadvantage that it cannot be corrected by the equipment itself. The present invention has been made in view of the above-mentioned circumstances, and it is an object of the present invention to provide a group management control method for elevators that can equalize the service for each hall during normal times. (Example) The method of this invention will be explained below with reference to the drawings.
The device shown in the figure will be explained. In the figure, registers and interface devices having the same function, which are provided in each elevator, are distinguished by letters A to H at the end of the reference numerals. Furthermore, the arrow lines connecting each register and interface device indicate a plurality of parallel signal lines, for example, 12 lines. All registers have the number of bits equivalent to one word in a small computer. In Figure 1, 1
is a hall call registration circuit in which the corresponding floor and direction are set in a register when registering a hall call, and are reset when the car arrives at the hall call floor. 3A to 3H are car status buffers, and each of these car status signals is sent to the wiper select circuit 8.
in the memory of the small computer 10 via
It is configured to be input to RAM (Random Access Memory). 4A to 4H are car call registration circuits, which are set at the time of car call registration and reset when the car arrives at the call registration floor. 5A to 5H are sub-car call registration circuits that store the hall call assigned to the car and are reset when the car arrives at the hall call floor. 6A to 6H are signal synthesis circuits, which output the logical sum of the outputs of the car call registration circuits 4A to 4H and the outputs of the quasi-car call registration circuits 5A to 5H. 7A to 7H are operation control devices for each elevator. 9 is a decoding circuit, which decodes the output signal of the output register 13 and sends the sub-car call registration circuits 5A to 5H in the direction of the corresponding floor of the corresponding car.
This is to set the . 10 is a small computer, for example, uses a 12-bit microcomputer, and has a ROM (read-on memory) as shown in FIG.
It has a memory including the RAM and a plurality of registers 11-14. An output register 11 outputs a sub-advice designation signal to the wiper select circuit, and has a function of holding the same output until the next output. 12 is an input register, 1
3 is an output register, and 14 is an output register.
This output register 14 is sent to the cassette magnetic tape device 15 for each hall and for each time period, which is calculated by the small computer 10 based on the information input from the hall call registration circuit 1 and the car status buffers 3A to 3H. number of hall calls, average unanswered time,
This is a dedicated register for transmitting information such as maximum unresponsive time. Here, the unresponsive time refers to the time (response time) from the generation of a hall call until the elevator responds. FIG. 12 shows an example of the configuration of the memory in the computer 10.
The master condition table (MCT) shown in the figure,
A car status table (CCT) shown in FIG. 3, a hall call status table (HCT) shown in FIG. 4, and a conversion table shown in FIG. 9b are provided. Third
4 shows the bit configurations of the car status table CCT and the hall call status table HCT. The car status table CCT specifies the car number using a subaddress, and the contents of the car status buffer 3 are taken into the small computer 10 and used in correspondence with each bit as shown in the figure. Car call information and allocated hall call information (hereinafter referred to as quasi-car calls) are input to the wiper selection circuit 8 via signal synthesis circuits 6A to 6H. This wiper select circuit 8
is to sequentially select the output signals from the hall call registration circuit 1, the car status buffers 3A to 3H, and the signal synthesis circuits 6A to 6H by the subaddress designation signal from the output register 11, which is shown in FIG. The wiper select circuit 1 is shown as being installed outside the small computer 10.
It is assumed that the function of 0 is performed within the small computer 10. As shown in the hall call status table HCT in Figure 4, this information is divided into sub-addresses from the 10th floor down call 10D to the 9th floor up call 9 indicated on the right end.
The bit configuration up to U is shown in the figure. For example 7
When a call occurs to D, the 11th bit becomes 1, a good car to service is found, and when the allocation is completed, the 10th and 11th bits become 1, and the car that has been allocated and the car that has a hall call to that floor. The corresponding bits 0 to 7 become 1, and are reset to 0 along with bits 10 and 11 when the response is completed and the call is reset. The information is processed within the small computer 10, and when the allocated machine number is determined, it is output from the output register 13 in the format shown in FIG. This output signal is decoded by the decoding circuit 9, and the quasi-car call registration circuits 5A to 5H on the corresponding floor and in the corresponding direction are decoded by the decoding circuit 9.
flip-flop is set. Each car is operated by a circuit (not shown) in response to the car call of that car and the sub-car call assigned to that car in the same direction as the car's traveling direction, and similarly, calls to the destination of that car disappear. and answer calls in the opposite direction. Note that in the above explanation, each table MCT (second
), CCT (Fig. 3), HCT (Fig. 4), and conversion table (Fig. 9b) are provided in the RAM of the computer 10, but these tables can be installed in the small computer 10. The information from each information source may be constantly taken in by a separate external storage device through hard connections. By doing so, the number of data memories and program memories can be reduced and the calculation speed can be increased. Further, in the above description, the function of the wiper select circuit 8 is performed in the small computer 10, but it may be performed in an external computer other than the small computer 10. By doing this, it is not necessary to operate all floors and all machines for each bit as described above, and the calculation time can be significantly reduced. Here, how to obtain the service priority required for the method of the present invention will be explained with reference to FIGS. 13 to 15. Figure 13 shows the number of hall calls for each hall at 8 am on a certain day (H10D...H9u), the maximum unanswered time (max10D...max9u), and the cumulative value of unanswered time (HUSM10D...HUSM9u).
and the average unanswered time [cumulative unanswered time ÷ number of hall calls] (HAVE10D…HAVE9u)
These data are stored in RAM and transferred to the cassette magnetic tape device 15. Then, as shown in FIG. 6d, the data stored in the magnetic tape device 15 is read out between 4:00 and 5:00 a.m., when there are almost no elevator users, and based on this, the data stored in the magnetic tape device 15 is read out as shown in FIG. 14. Service priorities are assigned in descending order of average unanswered time, service priorities are assigned in descending order of the number of hall calls, or service priorities are assigned in descending order of maximum unanswered time, and hall calls are assigned in descending order of service priority. Obtain allocation data with rearranged calls. The allocation data obtained in this way at 8 a.m. is similarly used as shown in Figure 15 at 9 a.m., 10 a.m., etc.
I keep asking. Next, the method of the present invention will be explained using the flowchart shown in FIG. Here, the data is used on a daily basis, but the same applies even on a weekly basis. That is, when the program starts as shown in Figure 6a, after initializing the RAM (Random Access Memory) table, the cassette magnetic tape device (indicated as cassette MT in Figure 6) is installed based on the previous day's statistical values. )
The service priority and hall call frequency written in 15 are read, and the hall index is sorted from 0 in order of service priority. And for example the first
In the standby floor storage memory provided in the spare area in the RAM shown in Figure 2 (memorizes the floor where the car is placed on standby when there are no hall calls, such as the 1st floor, as this is a floor where hall calls occur frequently). stores the floors in order of the number of hall calls. This storage is performed every time. Next, the master condition table shown in FIG. 2 is resident in the RAM of the small computer 10 and written by the output of the wiper select circuit 8.
Read the MCT and check whether group control is possible for each car. Then, the car status table CCT is read, and the position, direction, MG status, and load information of each car are read into the computer. The external signal obtained in this way is sent to the computer 10.
After reading in, scan the hole state. First, the subaddress _I0 is set to 0 in order to scan holes as shown in FIG. 6b. This sub-address _I0 is counted by a fixed number counter, for example, if there are 10 floors, it is always 0,
1, 2...17, 0, 1,...17 are repeated. Then, the hold index I that takes service priority into consideration is converted into a conversion table INDEX in RAM.
Calculate from (I ₀ ). Next, read the hall call status table HCT corresponding to hold index I=I ₀ (10D),
The state of the hole is determined by the combination of bits 10 and 11 in FIG. When bits 10 and 11 are “01”,
Since 10D has a hall call and is not assigned, the hall request counter (which counts the time elapsed since the hall call was generated) is incremented by 1.
After setting the parameter R _I = 1 (I is the hole index) to detect that a call has been deleted,
It is checked whether each car can be allocated, and if the car cannot be allocated, the process moves to the next car. Here, the procedure for determining whether allocation is possible will be explained based on the flowchart of FIG. In Figure 7, the corresponding machine (initially J = J ₀ and A
Is group control possible (in the group)? Is it not full? Is the floor with hall index I allowed? Is the number of floors scheduled for stopping within the limit value? Can deceleration be performed on hall index I? If all the conditions are satisfied, the car is considered to be assignable, and the evaluation is calculated using the following formula (1).If the car does not satisfy all the conditions, the evaluation value E is set to an appropriately large value (allocation is prohibited). value), then set the car index to J=J ₀ +1 and move on to the next car. The evaluation formula used to determine the optimal car is generally expressed by the following formula (1). E=D _J +S _J +C _J +W _J (1) Here, D _J is the relative floor difference between the current car position and the allocated hall, and S _J is the time element.
As shown in Figure c, the number of floors the car stops on the way from its current position to the allocated hall is also a time element. D _J is an in-car call, that is, the presence or absence of a car on the floor to which it is assigned, and if the evaluation values are the same, it is more rational to assign it to a car that is scheduled to stop at the floor to which it is assigned, in terms of elevator efficiency. be.
W _J is a parameter representing the degree of crowding of the car, and is an element related to comfort level and boarding/alighting time. Further, the above-mentioned evaluation formula is calculated by Equation (1) if the hall request counter T _J is below a certain value, and by E=D _J +S _J (2) if it is above a certain value. Using the evaluation formula described above,
After calculating the evaluation for all assignable baskets,
The basket with the minimum evaluation value is selected and output as an assigned basket. Next, when the 10th and 11th bits of the hall call status table HCT are "11", the allocation has already been completed, so after incrementing the hole re-request counter T _I by 1 as shown in Figure 6b, T _I is allowed. If it is within the value, proceed to the next hole, and if T _I is greater than the allowable value, cancel the assigned output and wait for the state to change. Next, the operation when the 10th and 11th bits of the hall call status table HCT are "00" will be explained based on the flowchart of FIG. That is, if the value of the data R _I (which has a table in the random access memory RAM in the small computer 10 for each floor) that checks whether the hall call has disappeared for the first time at D is 1, the hall call has expired. Since it has now been deleted, add 1 to the value of the hall request counter T _I , that is, the unanswered time and the number of hall calls for each floor (for each floor of index I), and then calculate the cumulative unanswered time (by hall index). Calculate and store it in the computer's memory. At the same time, the maximum unresponsive time for each time period and each floor is compared with the current hall request counter T _I , and if the current hall request counter T _I is larger, the maximum unresponsive time is updated. Further, the data regarding the hole information mentioned above is obtained on an hourly basis. data
When R _I =0, the request counter T _I and data R _I are cleared to 0 and the process moves to the next hole. When the above operations are performed sequentially up to 9U and completed for all floors, the system timer inside the computer checks whether one hour has elapsed, and if it has not elapsed, it restarts and returns to REPEAT START. Hall-related data, i.e., the total value of unanswered time for each floor in hourly units, the number of hall calls, and the maximum unanswered time for all floors after being transferred to the cassette magnetic tape device 15 and stored, and the total unanswered time. Clear all values, call count register, and maximum non-response time storage register, move to REPEAT START, and repeat this process from now on. In the example described above, the priorities determined from the previous day's actual data are 10D, 9D,...2D, 1U, 2U,
...The explanation has been made assuming that the priority order is 9U, but if the priority is not in the above order, the random access memory table RAM (in the computer before starting group management) in which the prioritized floors are stored. All you have to do is search in order according to That is, as shown in FIG. 9b, 9
D, 8D,...2D, 1U...6U, 10D, 7U,
A case where the priorities are determined in the order of 9U will be explained. At that time, a conversion table INDEX (i) (i = 0 to
17) is set as shown in FIG. 9b. Next, in Fig. 9, between the Nth and N+1th hole scan, 6U and 1
The case where 0D occurs and the service elevator has not been determined will be described, but here, to simplify the explanation, an example of two elevators, NoA and NoB, will be described. In other words, elevator NoA is ascending the 4th floor and there is a scheduled car call stop on the 5th floor.
Elevator NoB is ascending to the 2nd floor and there is a scheduled car call stop on the 5th floor. This is a case where a new hole call of 6U and 10D is made between the Nth and N+1th scans. At this time, the flowchart in Figure 6 and the conversion table INDEX(i) (i=0
17), the service elevators are determined in the order of 6U and 10D as shown in FIG. Therefore, to first determine the service number of 6U, start the evaluation calculation according to FIGS. 6b, 6c, and 7. Since S _J , C _J , and W _J are all the same in the evaluation formula, NoA is selected as the service elevator based on S _J (relative floor difference), and then the service elevator of 10D is determined. In other words, D _J has fewer NoAs for the 2nd floor, but NoA has 2 car calls on the 5th floor and UP hall calls on the 6th floor before responding to 10D.
NoB stops on the 1st floor of the car call on the 5th floor and responds to 10D. Therefore, for example
If the difference between the second floor of D _J is 2 seconds in time, and the stoppage of one floor is 10 seconds in time, NoB
becomes the 10D service elevator. Next, as shown in Fig. 11, the scanning order of the holes (same as the priority order) is set to 10D, 9D,..., 2D,
Consider the case of 1U, 6U, . . . 9U {the case of normal scan in FIG. 9a}. First, when determining the service elevator for 10D in Figure 11, it will be assigned to NoA based on the difference in D _J , and then the 6U service elevator will be assigned to NoA if the time conversion is the same as in Figure 10.
Assigned to the machine number. Therefore, if the service of 6U becomes extremely poor, if the next day's hole scan order (priority) is raised to 6U,
When assigned to NoA machine, the non-response time is shorter than when assigned to NoB machine. (NoA's
_{D _} At 4:00 a.m., when the machine is not in the office, the part where the statistical values of the cassette magnetic tape unit 15 are stored is read out, and after reading the statistical values into the random access memory RAM, the number of hall calls and the cumulative value of the non-response time are calculated. Calculate the average unresponsive time for each floor in each time period (hourly), calculate the maximum unresponsive time, and once all floors have been completed, sort them in descending order of average unanswered time (for each floor, direction). Separately) Service priorities (degrees) are assigned to each time zone. Furthermore, the floors are restored in descending order of the number of hall calls and are written in the cassette magnetic tape device 15 along with the above-mentioned order of service priority. In this case, the hall calls are written to the cassette magnetic tape device MT in order of priority and in the order of the floor with the lowest number of hall calls for each time period. The system timer starts when the timer reaches, for example, 5 a.m., and this process is repeated thereafter. According to the priority written in the cassette magnetic tape device 15, elevators are assigned to the floors where hall calls occur, and each elevator is operated accordingly. By repeating this process periodically, for example, every day, the service for each hole can be made uniform during normal times. This will be explained here, but in order to simplify the explanation, it is assumed that the case in Figure 10 occurs once every day, and Tables 1 and 2 are for elevators that do not take conventional priority into account. 3 shows the non-response time and the cumulative value of the non-response time for the elevator group management control method and the elevator group management control method in consideration of the priority of the present invention.

【table】

[Table] As is clear from this table, in the conventional method, if the unanswered time on the first day of hall call 10D is -10 seconds, the unanswered time on the 30th day is also -10 seconds, so The cumulative value of unresponsive time for 30 days is -10 x 30 = -
It will be 300 seconds. Similarly, if the unanswered time for hall call 6U is +5 seconds, the unanswered time will also be +5 seconds on the 30th day.
5 seconds, therefore the cumulative value of non-response time for 30 days is +
5×30=+150 seconds. On the other hand, since the method of the present invention takes priority into account, hall call 10D with the best service (unanswered time -10 seconds) on the first day has the worst service on the second day. Hall call 6U has the worst service on the first day, with a response time of +10 seconds and an unanswered time of +5 seconds, and has the best service on the second day, with an unanswered time of -5 seconds. Thereafter, in order to repeat such a process, the unresponsive time for each hall call, for example, 10D and 6U, is gradually unified, so that the service for each hall is made uniform. [Effects of the Invention] According to the invention described above, any one of the actual maximum unanswered time, average unanswered time, and number of hall calls for each hall is calculated for each time slot divided in advance. The system determines the service priority for each hall in descending order of the determined elements, changes this service priority according to the time period, and allocates hall calls in descending order of service priority. Therefore, it is possible to provide a group management control method for elevators that can standardize the service for each hall during normal times.

[Brief explanation of drawings]

Fig. 1 is a schematic diagram of an apparatus for carrying out the method of this invention, Figs. 2 to 5 are bit arrangement diagrams of each part of the apparatus of Fig. 1, and Figs. 6 to 8 explain the method of this invention. FIG. 9 is a flowchart for explaining the method of this invention, and is a diagram showing a conversion table for normal scan and scan with priority, and FIGS. 10 to 15 are for explaining the method of this invention. This is a diagram for 1... Hall call registration circuit, 3A-3H... Car status buffer, 4A-4H... Car call registration circuit, 5A-
5H...Semi-car call registration circuit, 6A to 6H...Signal synthesis circuit, 7A to 7H...Elevator operation control device,
8...Wiper select circuit, 9...Decode circuit,
10...Small calculator, 11...Output register, 12...
Input register, 13... Output register, 14... Output register, 15... Cassette magnetic tape device (MT).

Claims (1)

[Claims] 1. A plurality of elevators are put into service for a plurality of floors, and an evaluation value is determined using an evaluation formula for a hall call that occurs, and an optimal car is determined based on this evaluation value. In an elevator group management control method in which this is assigned, any one of the actual maximum unanswered time, average unanswered time, and number of hall calls for each hall is assigned to each pre-divided time period. The system determines the service priority for each hall in descending order of the determined elements, changes this service priority in accordance with the time period, and allocates hall calls in descending order of service priority. A group management control method for an elevator, characterized in that: