JPS6315230B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a group management control method for controlling the parallel operation of a plurality of elevators, and in particular, the raising and lowering hall lanterns of the same elevator are lit at the same time, for example, one of them flickers, The present invention relates to a group management control method for elevators to prevent the other side from being fully lit.

In recent years, elevator group management control devices that utilize computers (mainly small computers) have appeared, and in order to improve service to passengers, almost no hall call is made at any floor and at any time. A group management control device with an instant forecast display system that instantly determines the service elevator has appeared. A feature of this instant forecast display system is that it determines the service elevator almost simultaneously with the occurrence of a hall call, taking into account the waiting time in the hall, and immediately displays the service elevator in that hall.

By the way, in this type of group management control, when a hall call occurs in the direction opposite to the direction in which the car is currently traveling, the most suitable elevator is determined using a predetermined evaluation formula, and a forecast is displayed in the hall. will be carried out. In other words, when a car designated as a service elevator stops due to a car call on that floor, when it arrives at that floor and a deceleration command is issued, one lantern flickers on and the other lantern lights up fully.

This phenomenon is not necessarily irrational. For example, if this occurs on the middle floor of a high-rise building, the customers waiting in the hall will be notified that they will have to wait for a while until they return. However, for unaccustomed customers, they may not know the direction in which the carts are moving and may miss the carts, causing unnecessary confusion in the hall, or may be forced to wait again for the next cart, resulting in poor service. It was hot.

The purpose of the present invention is to make it difficult to assign a car to a car that stops in that hall when a hall call occurs, and to make it difficult to assign the car to a car in the opposite direction from the same hall, so that lanterns in two directions of the same car are lit. It is an object of the present invention to provide a group management control method for elevators that eliminates the above-mentioned drawbacks by minimizing the number of operations.

Hereinafter, the present invention will be explained in detail with reference to Examples.

Fig. 1 shows a system diagram showing the basic configuration of the group management control device, and 7A to 7H are one for each elevator.
This is an elevator operation control system consisting of registers and interface devices each having the same function, and is distinguished by the letters 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 of (for example, 12) parallel signal lines. All registers consist of a number of bits equivalent to one word in a small computer.

In Figure 1, numeral 1 is a master condition circuit that stores information such as the operating pattern and whether group control is activated for each elevator, as shown in Figure 2.
12-bit master condition table MCT
It has a format that constitutes. Reference numeral 2 denotes a common hall call registration circuit, in which registers for the corresponding floor and direction are set at the time of hall call registration, and are reset when a car arrives. 3A to 3H are car condition buffers, and the car condition table CCT (in the case of 8 cars, the sub address J
= J ₀ to J ₀ +7). 4A to 4H are car call registration circuits, which are set at the time of car call registration and reset when a 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 take the OR output of the car call registration circuits 4A to 4H and the quasi-car call registration circuits 5A to 5H. 8 is a wiper select circuit, 9 is a decoding circuit, 10 is a small computer (for example, a 12-bit microcomputer), and 11 is an output register, and this output register 11 has the function of holding the same output until the next output is output. Motsu. 12 is an input register, and 13 is an output register.

Car condition table shown in Figure 3
CCT, the hall call condition table HCT shown in Figure 4 is not placed inside the computer.
By constantly importing information from each information source externally through hard connections, it is possible to reduce the number of data memories and program memories, and to increase the calculation speed. The car condition table CCT is designed to designate a car with a subaddress, and take in and use the contents of the car condition buffers 3A to 3H in a computer in correspondence with each bit as shown in the figure.

The car call information and the assigned hall call information (hereinafter referred to as quasi-car call information) are ORed by the signal synthesis circuits 6A to 6H, and then input to the wiper selection circuit 8. This OR process is
Although it is possible to do this in the computer, it is more practical to do it externally because it requires operating all floors and all machines for each bit, which increases the calculation time considerably.

As shown in Figure 4, this information is displayed from the 10th floor DOWN call 10D to the 9th floor by sub-address.
They are distinguished up to UP designation 9U, and each has a bit configuration as shown in the figure. For example, when a call for 7D occurs, the 11th bit becomes "1", and when a good car to service is found and the allocation is completed, the 10th bit becomes "1", and the assigned car number and its Bits 0 to 7 corresponding to the car number that has a car call to the floor become "1". When the response is completed and the call is reset, bits 10 and 11 are both reset to "0".

When the information is processed within the computer and the assigned machine number is determined, an assigned output is output to the output register 13 in the format shown in FIG. The decoding circuit 9 is
decode the output signal from the output register 13,
The flip-flop of the secondary car call registration circuit 5 for the corresponding floor and direction of the corresponding car 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 the call to the destination of that car is made. When it runs out, calls in the opposite direction will be answered in the same way.

Next, the operation will be explained using flowcharts shown in FIGS. 6 to 10. First, in the flowchart shown in Figure 6, the master condition table is
Load the MCT and check whether group control is possible for each cage. Next, the car condition table CCT is read and information on the position, direction, MG status, and load of each car is stored in the computer.

As shown in FIG. 3, the meaning of each bit in the car condition table CCT is as follows.

0 bit...When the door is open = "1", when the door is closed = "0" 1 bit...Unused 2 bits...When the door is running = "1", when the door is stopped = "0" 3 and 4 bits...MG. OFF="00", direction
DOWN="01" Direction UP="10", MG・ON no direction="11" 5 to 9 bits...Car position.

10, 11 bits...Car load.

Next, scanning of the hole sub-address I is started from I=I ₀ , that is, from the 10D hole. When bits 10 and 11 of the hall call condition table HCT are “00”, there is no hall call, so the hall request timer T _I is reset to 0 and the hall sub address I is set to I=I ₀ +1, that is, 9D. Move. Also, if the 10th and 11th bits are “01”, 10
Since there is a D-Hall call and it is in an unallocated state, the hall request timer T _I is set to T _I =T _I +1, and it is checked whether allocation is possible for each car.

The tenth
This will be explained based on the flowchart shown in the figure. In other words, whether the corresponding machine (initially J = J ₀ , machine A) can be controlled as a group, whether it is not full, and the hall to be allocated (the hall subaddress I indicates 10D in this case).
It is checked whether car J is allowed to serve the hall subaddress I, and whether car J can now start decelerating and stop at the floor of hall subaddress I, and only cars that satisfy all the conditions are evaluated. For cars that do not, set the evaluation value E to an appropriately large value (a value that is prohibited from being assigned), and set the car sub-address J to J.
= J ₀ +1 and move on to the next machine.

Cars that are determined to be allocatable by the above-mentioned check proceed to the next step, where their evaluation is calculated. The evaluation formula is generally expressed as follows.

E=D _J +S _J +C _J ...(1) Here, D _J is the relative floor difference between the current car position and the discount hall, and is a time element. S _J
This is the number of floors that the basket stops on the way from the floor it is currently on to the hall to be allocated (of address I), and this is also a time element. C _J is related to the presence or absence of a car call stop for the allocated hole, and when there is no car call, a certain number is added to the evaluation value.

After performing evaluation calculations and checking whether allocation is possible using the above evaluation formula for all units,
The basket with the minimum evaluation value is selected.

Next, the hole subaddress I is I ₀ (i.e. 1
0D) or I ₀ +9 (that is, 1U). Since hall call registration cannot be performed in two directions on the top floor and the bottom floor, the car with the minimum evaluation value is output as is, and the next hall is scanned. In addition, on other floors (for example, 9D), the hole subaddress is converted using the following formula to obtain the hole subaddress II in the opposite direction. (For example, I=I ₀ +1,9D
Then, II=I ₀ +17,9U. ) After converting the hall sub-address, check whether the car with the minimum evaluation value has a car call on the floor of sub-address II (that is, car call 9U in the direction of travel), and if so, check whether the lanterns in the two directions of the same car are Since the light is lit, all the cars whose difference in evaluation value between the minimum evaluation value cars is within a certain value are selected (the subaddresses of the corresponding cars are J〓, . . . J〓).

Next, if there is no car that is not scheduled to stop due to a car call on the floor of subaddress II among car subaddresses J〓, ...J〓, proceed to the next step, and if there is at least one car, that car Among them, the car with the smallest evaluation value (hereinafter referred to as the semi-minimum car) is selected again, and the semi-minimum car is designated as the service elevator on the I floor of the hall sub-address, and a forecast is displayed in the hall.

Next, if all cars J〓, ...J〓 stop at the floor of sub address II due to car calls, check whether there is an already allocated hall call that the car with the lowest evaluation value will service after the floor of hall sub address II. If there is a car call, it is expected that the arrival time to hall subaddress I will be longer because the car call is derived from an already allocated hall call, so it will be serviced after subaddress II in cars J〓,...J〓. If there is a car that has no assigned hall call, the quasi-minimum car is selected from among them and displayed in the hall as a service elevator for the I floor of the hall sub-address.

Further, only when the conditions for the cars with the minimum evaluation values for the cars J〓, .

The above-mentioned operations are repeated until completed for all floors, and after completing all floors, return to step 3 and repeat the same operations cyclically.

As mentioned above, in the past, the optimal elevator was calculated from an evaluation formula and displayed in the forecast, so there were many cases where lanterns in two directions for the same car were lit at the same time. For example, under certain conditions, the lanterns are assigned to a quasi-minimum car, reducing the number of cases in which lanterns in two directions to the same car are lit.

Therefore, in high-rise buildings with cafeterias on intermediate floors, customers can be served extremely smoothly even during times of high traffic demand, such as during lunch hours.

[Brief explanation of the drawing]

Fig. 1 is a system diagram of an elevator group management control device to which the present invention is applied, and Figs. 2 to 5 show MCTs, CCTs, and
HCT and output register bit configuration diagram, 6th
10 are flowcharts showing the operation of the present invention. 1... Master condition storage circuit, 2... 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, 1
0...Small computer, 11...Output register, 12...Input register, 13...Output register.

Claims (1)

[Scope of Claims] 1. Optimal in an elevator group management control method in which a plurality of elevators are put into service for a plurality of floors, a service elevator is determined early in response to a hall call that occurs, and a forecast is displayed in the hall. If the direction of the car and the direction of the assigned hall call are opposite, and the optimal car is scheduled to stop at the assigned hall before servicing the assigned hall, the optimal car A method for group management and control of an elevator, characterized in that another car with no scheduled car call stop and whose difference in evaluation value is within a predetermined value is selected as a service car for the hall to be allocated.