JPS6141827B2 - - Google Patents

Description

[Detailed description of the invention]

The present invention puts a plurality of elevators into service for a plurality of floors, determines an appropriate elevator to respond to a call at the landing using an appropriate evaluation function (notifies the landing, and causes the elevator to respond). This invention relates to a group management control method for elevators. Elevator group management control is performed to efficiently operate a plurality of elevators installed in parallel. Conventionally, a dedicated sequence circuit has often been used as a group management control device, but depending on the configuration of the elevator body to which it is applied, the conditions of the building in which it is installed, etc.
In order to satisfy various specifications such as special requests from users, it is necessary to change the circuit design and parts each time, and as a result, there are drawbacks such as not being able to fully satisfy the specifications or incompatibility of hardware configurations. It was hot. For this reason, recently, group management control devices using digital computers such as small computers have appeared, which scan the situation of the hall on each floor and select the most suitable elevator when a hall call is occurring. Group management control began to be used to provide services to In this type of group management control, the optimal car is determined after calculating an appropriate evaluation formula for each car for the floor where the hall call occurred.
For example, as in the case of Figure 8, if there are three free cars A, B, and C, and a down hall call occurs on the 6th, 7th, and 8th floors, the evaluation value is the relationship between the car and the floor where the hall call occurred. Considering the distance and the number of floors planned to stop on the way, the optimal car for each hall call is determined, as shown by the lights in the diagram, A for the 6th floor call, B for the 7th floor call, and C for the 8th floor call. be done. Here, when the evaluation values are the same, the priority is determined in the order of alphabets A, B, and C. Therefore, if the time required for the car to arrive at the floor where the hall call occurs for a hall call that occurs arbitrarily is the main parameter for determining the optimal car, free cars should be allocated as shown in the figure. There are many. However, if one hall call is assigned to each free car, the following problem arises. In other words, after a reverse call assignment (assigning a call for a landing hall that has occurred to a car in the direction opposite to that of the call) is issued, the free car is serviced to the floor to which it has been assigned, as shown in Figure 8. In the example, the train ascends, but in this case, it is not possible to allocate an intermediate ascending call or a descending call above the reverse call allocation floor, so the train goes directly to the reverse call floor. This means that for a hall call that occurs arbitrarily, the car that will arrive in the shortest time is instantly determined, so if a hall call that occurs after that is also assigned, the hall call at the first point, that is, the opposite floor, will be generated. This is because the car calculated at this point, that is, the car that can be serviced in the shortest time, will actually be unable to service the opposite called floor in the shortest time. In this way, at a certain point, the car that can be serviced in the shortest time is selected, the forecast is displayed on the hole, and then the car is driven directly to the same hole, resulting in the creation of a hole that is temporarily unresponsive (for example, as shown in Figure 8). (ascending calls for the 1st to 10th floors and descending calls for the 9th and 10th floors),
When a call (hall call) occurs in such a hall, the service deteriorates significantly. Therefore, even if there are three free cars (these cars can service all halls) as shown in Figure 8, if a descending call is made as in the case of Figure 8, three free cars will be available. The drawback was that the cars were allocated and services for other halls were temporarily unavailable. The present invention has been made in order to eliminate the above-mentioned drawbacks, and allows the allocation of hall calls that respond to reverse calls (referring to descending calls above the car stopping floor or ascending calls below the car stopping floor) to a free number of cars. This is an elevator designed to prevent the increase in the number of landings where it becomes temporarily impossible to respond even if there are many calls for reverse calls, and to standardize the service at each landing and further improve the service. The purpose of this study is to provide a group management control method. Therefore, in the present invention, allocations are made as shown in (1) to (4) below. (1) When the number of free cars is less than a certain number, search for a car that is responding to a reverse call, and if the same car exists and the response time of the previously assigned reverse call floor is the same even if it is assigned to the same car, the reverse call is answered. Assign to basket. That is, if the car is ascending, the newly generated reverse call floor is below the floor to which it has already been assigned, and if the car is descending, the newly generated reverse call floor is above the already assigned floor. It is. (2) Even if the number of free cars is less than a certain number and there is a car responding to a reverse call, a new reverse call assignment is made to the same car and the response time of the previously assigned reverse call floor increases. Reverse call allocation is put on hold and waits for the status to change. That is, if the car is ascending, the newly generated floor is above the already allocated floor, and when the car is descending, the newly generated floor is below the already allocated floor. (3) When the number of free cars exceeds a certain number, some of them (set in memory in advance) are sent to the reverse call response car, and the remaining few cars are left as free cars. I'll keep it. (4) When the number of free cars is less than a certain number and there is no car responding to a reverse call, allocation is suspended until the reverse call becomes a long-waiting call. An embodiment of the present invention will be described below with reference to the drawings. FIG. 2 is a block diagram showing the basic configuration of a group management control device to which the present invention is applied. In FIG. 1, reference numerals 7A to 7H are registers and interface devices having the same function, provided one for each elevator, and are distinguished by alphanumeric characters A to H. FIG. 1 shows a case where there are eight elevators. Further, the arrow lines connecting each register and interface device in FIG. 1 indicate a plurality (12) of parallel signal lines. Every register has the number of bits equivalent to one word in a small computer. In FIG. 1, reference numeral 1 denotes a common hall call registration circuit, in which registers for the corresponding floor and direction are set when registering a hall call, and are reset when a car arrives. 3A to 3H are basket status buffers, and the third
It has the format shown in the figure. 4A to 4H are car call registration circuits that are set at the time of car call registration and reset when the car arrives. 5A to 5H are quasi-car call registration circuits that store the hall call assigned to the car and are reset when the car arrives. Signal synthesis circuits 6A to 6H output OR outputs of car call registration registers 4A to 4H and quasi-car call registration registers 5A to 5H, respectively. 8
is a wiper select circuit, 9 is a decoding circuit, 1
0 is a small computer, such as a 12-bit microcomputer, and 11 is an output register, which has the function of holding the same output until the next output is issued. 12 is an input register, and 13 is an output register. FIGS. 3 and 4 show the bit configurations of the car status table CCT and the hall call table HCT. Each bit in FIG. 3 has the following meaning.

[Tables] Rather than placing these tables inside the computer, these tables are placed outside the computer and information from each information source is constantly taken in through hard connections, thereby reducing the number of data memories and program memories, and increasing the calculation speed. is increasing. The car status table CCT designates a car by a subaddress, and as shown in the figure, the contents of the car information buffer 3 are taken into the computer and used in correspondence with each bit. The car call information and the allocated hall call information (hereinafter referred to as quasi-car call) enter the wiper select circuit 8 via the signal synthesis circuit 6. The OR operation by the signal synthesis circuit 6 may be performed within the computer 10, but it is more practical to perform it externally since the operation for all units on all floors must be performed for each bit, which significantly increases the calculation time. . As shown in FIG. 4, this information is distinguished from the 10th floor DOWN call 10D to the 9th floor UP call 9U by sub-address, and each has the bit configuration shown in the figure. For example, when DOWN call 7D occurs on the 7th floor, the 11th bit becomes "1", and when a car suitable for service is found and the allocation is completed, the 10th and 11th bits become "1", and the allocated car and Bits 0 to 7 corresponding to the car that has a car call to that floor become "1". When the response is completed and the call is reset, both bits 10 and 11 become “0”.
will be reset to The information is processed within the computer, and when the allocated machine is determined, it is output to the output register 13 in the format shown in FIG. The decoding circuit 9 decodes the output signal and sets the flip-flop of the sub-car call register 5 for the corresponding floor and direction of the corresponding car. Each car is operated by a circuit not shown in the figure 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 when there are no more calls to the car ahead of that car. Calls in the opposite direction are answered in the same way. FIG. 2 shows the format of the master condition table MCT, where "1" indicates that the group is under control, and "0" indicates that the group is out of control. Next, the present invention will be explained using the flowchart shown in FIG. Incidentally, FIG. 7 is a flowchart detailing the determination conditions of A4 in FIG. 6. First, read the master condition table MCT and check whether group control is possible for each car. Next, the car status table CCT is read and the position, direction, drive motor status, and load information of each car are stored in the computer 10. Next, it is determined for each car whether it is a free car or not, and if it is a free car, a counter for the number of free cars in the small computer 10 is incremented, and if not, the process moves to the next car. After determining the free cars for all machines, the hall status is scanned by counting the current number of free cars. That is, the hole condition table HCT with hole index I=I ₀ (10D) is read, and the hole condition is determined based on a combination of 10 bits and 11 bits of HCT. That is, when the 10th and 11th bits are “00”, there is no hall call, so the hall request timer T _I =0.
Then move on to the next hole (9D). If the 10th and 11th bits are "01", 10D has a hall call and has not been allocated, so after setting the hall request timer T _I = T _I +1, check whether allocation is possible for each car, and check whether the car can be allocated. If allocation is not possible, move to another basket. Here, the procedure for determining whether or not allocation is possible is explained in step 7.
This will be explained using the flowchart shown in the figure. In other words, whether the corresponding machine (initially, machine A with J=J ₀ ) is capable of group control, whether the load is full, and whether the hole to be allocated (in this case
10D) can be serviced (physically
Regarding whether it is possible to go to 10D and elevator group control,
(Is the current traffic demand permitted for operation, etc.?), Is the number of floors scheduled for stopping until reaching 10D exceeding a certain number, and whether it is possible to start deceleration and stop at 10D now? First, only the cars that satisfy all the above conditions proceed to the next step, and for the cars that do not, set the evaluation value E to an appropriately large value (a value that is prohibited from being assigned) and change the car index to J=J. Set it to ₀ +1 and move on to the next machine. At S2, it is determined whether or not there is a call for car J to reverse direction during the response time. If there is no call for direction reversal, the process proceeds to step S4. If there is a call for direction reversal, it is checked whether the corresponding car J is a free car. If the corresponding car J is a free car (○a), check whether the previously calculated number of free cars (calculated in A1 in Figure 6) is greater than or equal to a predetermined number, and if it is greater than a certain number. Proceeding to step S4, the evaluation value of the corresponding car J is calculated as a car to be allocated. In addition, when the number of free cars is less than a certain number, only long waiting hall calls are allowed to be allocated. Therefore, even if the free car evaluated in step S4 becomes a service car, a certain number of free cars are secured. If the call whose direction is reversed during a car response is a car other than a free car (○), it is determined whether the number of free cars is greater than a certain number, and if the number of free cars is greater than a certain number, another reverse call is given to the car responding to the reverse call. Hall allocation is prohibited, and if the number is less than a certain number, the process moves to step S3 and subsequent steps even if the car is responding to a reverse call. In S3, cases are differentiated depending on whether the car is ascending or descending, and if it is ascending (the ascending car is targeted in response to the DOWN call), the allocation target hole I = I ₀ is currently the car J responding. Check to see if you are on a higher floor than the hall you are trying to access. If the target hall I=I ₀ is located above the expected response floor, the assignment is prohibited, and if it is on the lower floor, the assignment is permitted. When the car is descending, contrary to the case when the car is ascending, allocation is prohibited when the allocation target hole I = I ₀ is located below the UP call that car J is trying to respond to, and allocation is disabled when the car is located on the upper floor. Allow. In this case, the evaluation value of the unassignable basket is set to ∞ and the step is
Proceed to A04, and allocatable baskets are shown in Figure 6.
Proceed to A02, perform the prescribed evaluation calculation, and then step
Proceed to A04. Based on the above explanation, when there are many hall calls that are reverse calls for each car, the free car will be selected if the car that can respond in the shortest time is selected for each hall. Because the system operates directly to the reverse call hall, it becomes difficult to create a free car, and there are many halls that are temporarily unresponsive. However, by adding the determination after S2 in the flowchart in Figure 7, even if there are many hall calls that result in reverse calls for each car, first of all, if the car is responding to a reverse call and the response time does not increase much. By selecting and allocating a suitable car or by directing a free car only when the number of free cars exceeds a certain number, the number of temporarily unresponsive cars is minimized. Furthermore, if the 10th and 11th bits of the hole condition table HCT are "11", then the allocation has already been completed, so scanning of the next hole is started. As a result of the above operation, when the hall condition table HCT is "01", only the cars that are allowed to enter the evaluation calculation after going through the service availability determination shown in Figure 7 will enter the evaluation calculation after A02 in the flowchart. . The evaluation value is generally expressed as shown below. E=DJ+SJ+CJ+WJ Here, DJ is the relative floor difference between the current car position and the allocated hall and is a time element. SJ is the number of floors that the car stops on the way from its current position to the allocated hall, and this is also a time element. C.J.
It is the presence or absence of an intra-car call (to the floor to be assigned), and if the evaluation values are the same, it is more rational to assign the car to the car that is scheduled to stop at the assigned floor in terms of elevator efficiency. . WJ 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 the above-mentioned formula if the hall request timer T ₁ after the occurrence of a hall call is below a certain value, and by the following equation if it is below a certain value. E=DJ+SJ After evaluating the above parameters for all machines, select the car with the lowest evaluation value from Hall I.
Output as an allocated basket. Repeat the above-mentioned operations until all floors are completed, then return to REPEAT START and repeat the same process cyclically. Conventionally, when a free car is assigned to a reverse call hall, the free car responds (in addition, until the free car responds, other hall calls are not assigned and the car runs directly to the service hall), so the call of the hall that responds to the reverse call If this occurred frequently, many holes would become temporarily unserviceable, resulting in uneven service. However, in the present invention, (1) reverse call response is permitted for free cars only when the number of free cars is greater than a certain number. (2) When the number of free cars is less than a certain number, further allocation is made to cars responding to reverse calls. (3) If the conditions in the preceding paragraphs (1) and (2) are not met, in principle, service to the reverse call floor will be temporarily prohibited, and assignment will be permitted only when the call on the reverse call floor becomes a long-waiting call. do. Provided is a group management control method for elevators that can minimize areas where service is temporarily unavailable, level out service on each floor, and shorten service time as much as possible. can do.

[Brief explanation of the drawing]

1 to 7 are diagrams for explaining one embodiment of the present invention. FIG. 1 is a system configuration diagram of a group management control device, and FIGS. 2, 3, and 4 are diagrams of a master controller. Figure 5 shows the output format when allocating hall calls, and Figure 6 shows the flowchart of the program used in group management control. , FIG. 7 is a flowchart for selecting an allocatable car, and FIG. 8 is a diagram for explaining service car selection under conventional group control. 1... Hall call registration circuit, 3A to 3H... Car status buffer, 4A to 4H... Car call registration circuit, 5
A to 5H...Semi-car call registration circuit, 6A to 6H...Signal synthesis circuit, 8...Wiper selection circuit, 9...Decoding circuit, 10...Small computer.

Claims (1)

[Scope of Claims] 1. A method for placing a plurality of elevators in service for a plurality of floors, and determining the most suitable elevator to respond to a call at a landing using an appropriate evaluation function. In group management control,
To assign a call from a landing that has occurred to a car in the direction opposite to the direction of the call: (1) If the number of free cars is greater than a predetermined number, that predetermined number of cars remains free and the remaining free cars are allows reverse call assignment. (2) If the number of free cars is less than the predetermined number, a search is made for a car that is responding to a reverse call, and if no car is found, the allocation is suspended and the process waits for the situation to change. (3) If there is a car responding to a reverse call in the previous two paragraphs, a newly generated reverse call will be assigned on the condition that the response time of the reverse call hall to which the car is currently responding does not change. A group management control method for elevators that equalizes the service on each floor.