JPS6147790B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a group management control system for elevators, and in particular to rational allocation of waiting time when allocating optimal elevators to common hall calls.

Group management control is performed to efficiently operate multiple elevators installed in parallel. Conventionally, dedicated sequence circuits have often been used as group management control devices, but in order to satisfy various specifications such as the configuration of the elevator body to which it is applied, the conditions of the building in which it is installed, and the special requirements of users, it is necessary to , the circuit design and parts used need to be changed each time, and as a result, the tenant for the building cannot be decided, and detailed specifications must be finalized at an early stage when there are many uncertainties. There were drawbacks such as lack of compatibility.

For this reason, recently, group management control devices using digital computers (hereinafter referred to as computers) such as microcomputers have been realized, and so-called demand control is being performed to select and service the most suitable elevator for a common hall call. It became. In this case, it is normal to provide an appropriate waiting time from the time a hall call occurs until the allocation is determined, but conventionally this waiting time was set to a constant value regardless of the floor of the hall call and the direction of the call. It was.
For this reason, the service level for each floor and direction is the same, but the actual level of service demand for elevators is not necessarily the same for each floor and direction depending on the conditions of the building in which it is installed, so the waiting time may vary. There were cases where it was unreasonable to make them equal for elevator group management.

The present invention was devised to solve the above-mentioned drawbacks. By setting the initial value of the hall waiting time counter _T1 for each floor direction, the service possibility for each floor and each direction can be adjusted according to the specific traffic demand of the building. The purpose of the present invention is to provide a rational elevator group management control device that is compatible with the following.

For example, if the traffic importance ranking of buildings is as shown in FIG. 7, initial values are given to the initial value table (HWIT) of the hall waiting time counter in the non-volatile memory PROM as shown in FIG. For example, if we take DOWN on the 4th and 9th floors as an example,
4FDOWN is the initial value of the hole waiting time counter
INIT (I ₀ +6) = +1, 9FDOWN is also INIT
Set (I ₀ +1) = -18, 9FDOWN and 4FDOWN
If demand occurs at the same rate, the hall waiting time counter T ₁ will always reach the lowest allocation level L ₀ counter 4FDOWN first.
It is processed with priority compared to 9FDOWN.

The present invention will be further explained below with reference to the drawings.

FIG. 1 is a system diagram showing the basic configuration of an elevator group management control device according to the present invention. Figure 1 shows a case in which an elevator group consists of eight units. Registers and interface devices with the same functions in each elevator are distinguished by alphanumeric symbols A to H to the right of the numbers. There is.
(However, this symbol may be omitted in the explanation as long as it does not cause confusion.) Further, the arrow lines connecting each register and interface device in FIG. 1 indicate a plurality of (for example, 12) parallel signal lines.
All registers consist of a number of bits equivalent to one computer word. 7A to 7H are operation control devices for each elevator.

In FIG. 1, 1 to 5 are registers each consisting of a flip-flop or gate, and are controlled by a wiper select circuit 8, which selects only the desired register according to the sub-address output to the selection register 11 of the computer 10. , is connected to the input register 12 of the computer 10 and is readable by the computer 10. One of the above registers is a master condition storage circuit that stores information such as the operation pattern and whether or not group control is activated for each elevator, and constitutes a 12-bit master condition information table MCT as shown in Figure 2. There is. 2 is a hall call registration circuit that stores a common hall call for each floor as is, 3A to 3H are car status storage circuits, 4A to 4H are car call registration circuits, and 5A to 5H are semi-car call registration circuits. The car status memory circuits 3A to 3H are 12-bit registers that digitally store the status of door opening/closing, running stop, MG operation, running direction, car position, car load, etc. as "0" or "1" using 12-bit registers. Information is stored in the car status information table CCT for all cars (if the number of cars is 8, index number J = J ₀ to J ₀ +7).
It consists of Car call registration circuits 4A to 4H store the registered destination floors of car calls called in each car. The semi-car call registration circuits 5A to 5H store the assigned floor when the car is assigned as the optimum car via the computer 10 for a common hall call for each floor, and thereby control the elevator operation. command. 6A to 6H are signal synthesis circuits, and car call registration circuits 4A to 6H, respectively.
4H, the information from the quasi-car call registration circuits 5A to 5H, and the hall call storage circuit 2 are combined and code-converted together with the information from the hall call registration circuit 2 by the wiper select circuit 8 to determine the destination floor as shown in FIG. The number of the running decision car for each running direction, the presence or absence of a hall call for each floor and direction, and whether or not the assignment has been completed are stored, and the hall condition information table HCT (for 10 floors) is stored as a whole. In this case, index numbers I=I ₀ to _{I 0} +17) are constructed. 8 is a wiper select circuit which selects information tables MCT,
CCT(J) and HCT(I) are sequentially read into the memory 14 in the computer via the input register 12. 9 is a decoding circuit which determines that the computer 10 is the optimum elevator for a common hall call and converts the car number information output from the output register 13 into the corresponding car index number J (J ₀
~J ₀ +7) and input the hall call floor number assigned to the sub-car call registration circuits 5A-5H of each car A-H. In addition to the above-mentioned input register 12, selection register 11, and output register 13, the computer 10 includes a nonvolatile random access memory (hereinafter referred to as RAM) 14, an arithmetic circuit 15, a PROM 17 for an initial value table for waiting time, and other functions for the operation of the computer. Contains the necessary basic circuit elements (not shown). The RAM 14 stores various information obtained through the input register 12 and supplies parameter information to the arithmetic circuit 15. The arithmetic circuit 15 calculates the evaluation value E of service suitability of each elevator using a predetermined evaluation formula for each hall call based on the above parameter information, selects the elevator with the minimum evaluation value E as the optimal elevator, It is output via the output register 13. The output register is also made up of 12-bit information bits as shown in FIG. 5, for example. Next, the operation of the computer according to the present invention will be explained using a flowchart. FIGS. 6A, B, and C are flowcharts showing the overall operation. In Figure 6A, section 1 of the flowchart is to synthesize external data,
This is a routine that initializes the memory (RAM) that stores information that is integrated and created inside the computer. In addition, the MCT reading routine of the selection controller reads from the master condition table (MCT) with the bit configuration shown in Figure 2.
It checks whether each elevator is under group management control, and compares the traffic pattern read at that time with the traffic pattern one cycle before. When the pattern changes, a turnaround floor unique to that pattern is determined at the section. Set. Next, in the section CCT reading routine, the door status, car direction,
Reads the MG ON/OFF status, car position, and car load status into the computer. Next, the sampling operation begins, and from this information, the direction and MG state of the car one cycle before are compared with the direction and MG state of the car this time, and if the state of the car changes, the direction and MG state of the car are compared for each car. Set the upper and lower limits of the turnaround floor, and make each elevator turn around at that floor. The above procedure is carried out for all the cars in sequence, and once the operation pattern for each car has been set, the state of the hall is next checked. In other words, the first hall index I is the 10th floor descending call 10.
For _I0 corresponding to D, information such as whether there is a hall call on that floor and whether the call has been allocated is read from the hall condition table (HCT) shown in the bit configuration shown in FIG. The 2 bits of HCT (bits 10 and 11 in Fig. 4) are used to detect hall call allocation and hall call occurrence, respectively, so when there is no hall call, 10 and 11 bits are used.
11 bits are in "00" mode, "01" mode when a hall call has occurred but a service elevator has not been determined, and "11" mode when a hall call has occurred and a service elevator has been determined. In the "00" mode, the hall waiting time counter _T1 is initialized to the initial value corresponding to the hall call based on the waiting time counter initial value table HWIT, and the next hall state investigation is started.
Hall waiting time counter T ₁ when in “11” mode
is incremented, and if T ₁ is within the allowable waiting time L ₄ , the state of the next hall is investigated, and if T ₁ is greater than the above-mentioned allowable waiting time, it is determined that the specified elevator is out of service due to a breakdown or other reason. It interprets the service, cancels the service for that car, and enters a routine that determines the service elevator in the next cycle. (In this case, the hall state mode changes in the order of "00" - "01" - "11" - "01" - "11".) Next, when the mode is "01", the service elevator is determined. For this purpose, first, the hole waiting time counter _T1 is incremented, and then _T1 is compared with a fixed set value _L0 . Then, the allocation evaluation calculation is not performed until T ₁ reaches L ₀ and the next hall call sampling is started with I=I+1. Only when the waiting time counter T ₁ reaches L ₀ does evaluation calculation begin for the allocatable cars. That is, J= _J0 is set, and a check is made to see if the car is an allocatable car. If it is an allocatable car, the process moves to the next evaluation calculation routine. In other words, first (a) the evaluation value W _J based on the car load.
Set to E. Next, (b) add the evaluation value D _J based on the real relative floor difference to E, then move to A2B in FIG. 6c (c) add the evaluation value S _J based on the number of stopped floors to E. Next, the waiting time T ₁ is sequentially compared with preset level values L ₁ and L ₂ , and when the level is 2 (T ₁ > L ₂ ), the sum of the above (a) to (c) E=W _J +D _J + S _J is determined for each elevator, and the one that takes the minimum value is determined as the service elevator for hall call I, and a forecast is displayed. Also, if T ₁
If it is at level 1 (L ₁ < T ₁ < L ₂ ), consider the schedule for each car and (d) find the evaluation U _J for inside and outside the operation schedule, the sum of the above (a) to (d) E = W _J + D _J + S _J
+U _J is determined for each elevator, and the elevator with the minimum value is determined as the service elevator for hall call I, and a forecast is displayed. Furthermore, when T ₁ is less than L ₁ , (e) MG is
Calculate the evaluation M _J based on whether it is ON or OFF, (f) Evaluation C _J of whether the car will stop at the target hall by car call, and g Evaluation N _J of whether there is a scheduled stop on the floor adjacent to the target hall. Sum of a to g E=W _J
+D _J +S _J +U _J +C _J +N _J are determined for each car, and the car with the minimum value among them is determined as the elevator that will service hall call I, and a forecast display is output.

Although the above example shows a case in which the evaluation formula is configured so that the evaluation value E of the optimal car is minimized, it is also possible to configure the evaluation formula such that the evaluation value E of the optimal car is maximized.

The hall call cancellation described above is performed by setting the third bit of the output register shown in FIG. 5 to "0". As described above, the car assignment or cancellation operation for each hall call is performed sequentially, and all hall calls (10D to 2D, 1U
~9U), returns to the first (REPEAT START) and repeats the sampling cycle starting with MCT reading again.

As explained above, according to the present invention, in the elevator group management control device that allocates the optimum elevator to a common hall call, an initial value of the waiting time counter is set for each elevator, and this initial value is set for each elevator. Rational elevator group management control that gives appropriate priority to elevator assignments to hall calls by making appropriate selections, thereby realizing services that match the specific conditions of the building in which the elevator group is installed. You can get the equipment.

[Brief explanation of the drawing]

FIG. 1 is a system diagram showing the basic configuration of an elevator group management control device according to the present invention, FIGS. Figures A, B, and C are flowcharts showing the operation of the present invention, and Figures 7 and 8 are diagrams showing the traffic demand level and the initial value of the waiting time count, respectively, in the present invention. 1... Master condition storage circuit, 2... Hall call registration circuit, 3A-3H... Car status storage circuit, 4A-4H... Car call registration circuit, 5A-5H
... Semi-car call registration circuit, 6A to 6H... Signal synthesis circuit, 8... Wiper selection circuit, 9... Decode circuit, 10... Computer, 16... Waiting time counter, 17... Non-volatile memory.

Claims (1)

[Claims] 1 In an elevator group management control system in which multiple elevators are installed in parallel, the evaluation value of each elevator is calculated based on a predetermined evaluation formula for a common hall call, and the elevator with the optimal evaluation value is assigned. a hall waiting time counter that counts while there is a call; an initial value setting means for setting the initial value of the hall waiting time counter for each floor and each direction;
A means for detecting that a waiting time count starting from the initial value of each of the waiting time counters to which an initial value is set has reached a predetermined value, and a means for calculating an allocation to a hall call using the detecting means. Elevator group management control device.