JPH0798619B2 - Elevator group management device - Google Patents

Description

TECHNICAL FIELD The present invention relates to an elevator group management device for selecting and allocating a service car for a landing call from a plurality of elevator cars.

[Prior art] When multiple elevators are installed side by side, normal group management operation is performed. There is an allocation method as one of the group management operations. It calculates the allocation evaluation value for each car as soon as the hall call is registered, and selects the car with the best evaluation value as the car to service. By assigning only the assigned car to the above-mentioned landing call, the operation efficiency is improved and the waiting time for the landing is shortened. Also,
In such group-controlled elevators of the allocation method, generally, an arrival forecast light is provided for each car and each direction at the landing on each floor so that the forecast of the allocated car is displayed to the passengers waiting at the landing. Therefore, waiting customers can wait for the car in front of the forecast car with peace of mind.

By the way, the allocation evaluation value in the hall call allocation method as described above is calculated from the viewpoint of which car is best to allocate the hall call if the current situation progresses as it is. That is, based on the current car position and car direction, and the currently registered landing call and car call, the predicted value of the time required for the car to sequentially respond to the above calls and arrive at the landing on each floor (hereinafter, This is called the estimated arrival time) and the time that has elapsed since the hall call was registered (hereinafter referred to as the continuation time), and the estimated arrival time and the continuation time are added together and all currently registered. Calculate the estimated waiting time of the hall call. Then, the sum of these predicted waiting times or the predicted waiting time of 2
The sum of the product values is set as the assigned evaluation value, and the hall call is assigned to the car with the smallest assigned evaluation value. In such a conventional method, when allocating a hall call, the newly registered hall call after the allocation becomes long waiting because it is judged whether or not it is optimal on an extension of the current situation. There was a problem that.

An example of this failure occurrence will be described with reference to FIGS. 12 to 15. In Fig. 12, A and B are the cars of Units 1 and 2, respectively, Unit 1 is in the process of rising to respond to the 6th floor call (6c), and Unit 2 is the 5th floor upcall (5u ), And is rising to respond to the uplink allocation (5uB). In such a situation, as shown in FIG.
It is assumed that the down call (9d) is registered on the floor. According to the allocation evaluation value of the above conventional allocation method, since the 9th floor downlink call (9d) is allocated to car A so that the waiting time is minimized as a whole, Unit 1 has the 9th floor downlink allocation (9dA). As a result, both cars will drive upward.

If the up call (1u) is registered on the lower floor, for example, on the first floor shortly after the allocation of the down call (9d) on the ninth floor, the up call (1u) on the first floor is assigned to the car A and the car. It becomes the back call of B, and even if it is assigned to any of the cars, it takes a long time to be answered and a long wait occurs.

On the other hand, if the 9th floor downcall (9d) is assigned to car B,
After about 15 seconds, as shown in Fig. 14, car A becomes an empty car on the 6th floor and is in a standby state, and car B is in service on the 5th floor (the car call (10c) on the 10th floor is registered on this floor). Expected). Therefore, after that, the first floor upcall (1u)
Even if the car is registered, as shown in Fig. 15, car A waiting on the 6th floor does not have to wait long because car A provides direct service. In order to prevent long waits in this way, considering how cars will be laid out in the near future and the possibility of empty cars occurring, even if a long waiting time is assigned, the number of cars will be one. It is necessary to assign hall calls so that people do not gather at the place.

[Problems to be Solved by the Invention] Conventionally, various methods have been proposed as described below for assigning hall calls so that cars do not gather in one place, but sufficient effects have not been obtained.

The Elevata group control device disclosed in Japanese Examined Patent Publication No. Sho 55-326525 has a hall call registration to prevent the cars from gathering in one place and improve the driving efficiency, as in the above zone allocation system. It is an assignment method that assigns a car scheduled to stop to the floor near the call. In this allocation method as well, only attention is paid to the presence / absence of a car to be stopped on the adjacent floor, and how long it takes for the car to be stopped to reach that floor and how other hall calls are distributed. It has been registered and will be answered soon, there is no car that is likely to become an empty car in the near future, and which floor is the other car on which direction are you going to operate? Since we did not make a judgment that accurately grasped changes in the car layout, there was the problem that long wait calls would still occur.

Furthermore, in the elevator group management control method disclosed in Japanese Patent Publication No. 62-56076, in which a car is made to stand by at a drop-off position, when a new hall call is generated, this hall call is temporarily assigned to each car. Estimate the drop-off position of the temporarily assigned car, calculate the degree of dispersion of the car from the expected position of the temporary allocation car and the positions of other cars, and assign at least the above dispersion degree as the evaluation value of each assigned car as the degree of dispersion increases. This is an allocation method in which the allocated car is determined from the above-mentioned evaluation value of each car so as to be easily handled. As a result, the services will be distributed even after the service is finished at the hall calls, and it will be possible to prevent wasted operation of empty cars due to distributed standby, which will have a great effect on energy conservation and eliminate the suspicion of building residents. Is to have. However, as is clear from its purpose, this allocation method is intended for off-peak hours such as at night, and is premised on the case where one hall call is registered while all cars are waiting in the empty car. There is. Therefore, this allocation method cannot be applied to the landing call allocation in a traffic state in which landing calls are registered one after another and each car is operating while responding to the calls, resulting in long waiting. there were. In other words, such a problem arises because the purpose is to balance the placement of empty cars, so it is not configured to consider changes in car position over time for cars other than the provisionally assigned car ( Based on that assumption, it is not necessary to consider the car position change of other cars), and the car position at the time when the above-mentioned provisionally allocated car is abandoned (at that time, all cars become empty cars and are in a standby state) The reason is that the call allocation is decided by focusing only on.

Furthermore, the Electrical and Information Related Society of Japan in 1988 (10
Held 3rd to 5th of the month, Venue: Faculty of Engineering, Niigata University "Elevator group management" (Proceedings Vol. 2 P2)
-117-120) proposed a new group management method that applies the fuzzy theory. Here are some examples of fuzzy rules:

(Rule Rm) IF (calls occur on the upper floor) and (When assigned to a certain car (A), the cars concentrate on the upper floor) THEN (Exclude cars with the above properties (A) ) (Assigning the car with the smallest evaluation value from the allocation candidate cars) Furthermore, when a 10F down call is registered in the situation shown in Fig. 16 as a simulation example, empty cars No. 2 and No. 4 are It is said that it is good to select the car with the best evaluation value (Unit 3) from the Units 1 and 3 that have been saved and have a car call on the upper floor as the assigned car. According to this, allocation can be performed in consideration of call generation in the near future, and long wait can be prevented. However, the judgment that "the cars are concentrated on the upper floor" is made only on the condition that "the car has a call on the upper floor" or "the car has an assigned call on the upper floor". It is not configured to take into account changes in the positional relationship of. Therefore, the car may reach the upper floor eventually, but the positional relationship of other cars is not clearly defined. Therefore, it may be considered that the car may not actually "concentrate on the upper floor". In that case, However, there was a problem that the waiting time was rather lengthened because the car was preserved. In addition, since we do not consider the prediction of the occurrence of cars (= predicted empty cars) that will wait in the closed state after answering the call in the near future, we prevent the occurrence of long waits in the near future. There was a problem that the effect was not sufficient.

The present invention has been made in order to solve such a problem, and shortens the waiting time for a hall call from the present time to the near future in consideration of the change in the car layout with the passage of time and the possibility of becoming an empty car. It is an object of the present invention to obtain an elevator group management device that can be used.

[Means for Solving the Problems] An elevator group management system according to the present invention includes a hall call registration means for registering a hall call when a hall button is operated, and a plurality of cars for the hall call. Assigning means for selecting and allocating cars to be serviced, performing operation control such as car direction determination, departure, stop, door opening and closing,
In a group management device for an elevator equipped with a car call and a car control means for responding to the assigned hall call, a car that does not answer all the calls to be answered arrives at the final call floor The estimated time until arrival is calculated, and the estimated time until all the calls to be answered are answered based on this estimated time of arrival is calculated. Predictive empty car detection means for detecting as a car, and when the predicted empty car is detected, makes it more difficult to allocate the predicted empty car to a landing call than other cars or assigns to exclude the predicted car from allocation targets And an allocation restricting means for performing a restricting operation, wherein the allocation means selects an allocation car based on the output of the allocation restricting means.

An elevator group management device according to another invention selects a car to be serviced from a plurality of cars for a car call registration unit that registers a car call when a car button is operated. Group management of elevators including allocation means for allocating the car and determining operation direction of the car, operation control such as departure, stop, door opening and closing, and car control means for making the car respond to the car call and the allocated hall call. In the device, an empty car detecting means for detecting an empty car as a car that has answered all calls to be answered, and answering all calls to be answered within a first predetermined time of the cars other than the empty car A predictive empty car detecting means for detecting a car expected to be in the finished state as a predictive empty car, a car position predicting means for predicting and calculating a car position after a second predetermined time, and this car. A car number predicting unit that predicts the number of cars after the second predetermined time has passed for each floor or zone based on the prediction calculation value of the storage predicting unit; and when the predicted empty car is detected, Based on the presence or absence of an empty car and the number of cars predicted on the specific floor or zone by the number-of-cars predicting means, it is more difficult to allocate the predicted empty car to a hall call than other cars, or the predicted empty car is assigned And an allocation limiting means for performing an allocation restriction operation to be excluded, wherein the allocation means selects an allocation car based on an output of the allocation restriction means.

Further, an elevator group management device according to another invention is a hall call registration means for registering a hall call when a hall button is operated, and a car to be serviced from a plurality of cars for the hall call. Group management of elevators including allocation means for allocating the car and determining operation direction of the car, operation control such as departure, stop, door opening and closing, and car control means for making the car respond to the car call and the allocated hall call. Prediction of a car that is expected to be in a state where all calls to be answered have been answered within the first predetermined time among cars that have not answered all calls to be answered in the device Based on the empty car detection means, the car position prediction means for predicting and calculating the car position after the second predetermined time, and the predicted calculation value of the car position prediction means,
A car number predicting unit that predicts the number of cars after the second predetermined time has passed for each floor or zone, and when the predicted empty car is detected, Based on the number of predicted cars, allocation limit value setting means for setting the degree of making the predicted empty car harder to allocate to landing calls than other cars as an allocation limit value, the predicted empty car detection means, car number prediction means,
And an allocation limit value setting means for calculating respective allocation limit values when the second predetermined time is set to a plurality of different values, and further combining these allocation limit values to set a total allocation limit value. Allocation limiting means, and the allocation means selects an allocation car based on the total allocation restriction value.

And an elevator group management device according to another invention selects a car to be serviced from a plurality of cars for a car call registration means for registering a car call when a car button is operated. Group management of elevators including allocation means for allocating the car and determining operation direction of the car, operation control such as departure, stop, door opening and closing, and car control means for making the car respond to the car call and the allocated hall call. Prediction of a car that is expected to be in a state where all calls to be answered have been answered within the first predetermined time among cars that have not answered all calls to be answered in the device Based on the empty car detection means, the car position prediction means for predicting and calculating the car position after the second predetermined time, and the predicted calculation value of the car position prediction means,
The frequency of hall calls is high based on the number of cars predicting means for predicting the number of cars after the second predetermined time for each floor or zone and the characteristics of the floor or the past hall call generation record. Traffic condition judging means for judging whether each floor or zone is lower or lower, and when the predicted empty car is detected, the number of cars predicted on the specific floor or the specific zone by the car number predicting means and the traffic condition judging means Allocation control means for performing allocation control operation of the hall call to the predicted empty car based on the determination result of the frequency of occurrence of the hall call by the allocation means, the allocation means selecting an allocation car based on the output of the allocation restriction means. To do.

[Operation] In the present invention, among the cars that have not finished answering all the calls to be answered, a car that is expected to be in a state where all the calls to be answered have been answered within a predetermined time is detected as a predictive car. Since the allocation limiting operation is performed on the predicted empty car, the cars are less likely to be concentrated in one place in the near future. As a result, the waiting time for a hall call can be shortened.

In another invention, a predicted empty car and an empty car are detected, and the number of cars after the predetermined time has elapsed is predicted for each floor or zone based on the predicted car position after a predetermined time. Since the allocation restriction operation is performed on the predicted empty car on the condition of the presence or absence of the above and the predicted number of cars on the specific floor or in the specific zone, it is less likely that the allocation restriction is unnecessarily applied to the predicted empty car. , In the near future, it will be less likely that one car will be concentrated in one place. As a result, the waiting time for a hall call can be further shortened.

Further, in another invention, the predicted car position after a predetermined time, the predicted number of cars for each floor or zone, and the allocation limit value for the predicted empty car corresponding thereto are set to a plurality of different values for the predetermined time. In each case, the calculation is performed for each case, and the allocation limit values are combined to set the total equivalent limit value to perform the allocation limit operation for the predicted empty car. At the same time, there will be less chance to carry out the car, and at the same time from the present time to the near future, the car will not be concentrated in one place. As a result, the waiting time for a hall call can be further shortened.

Then, in another invention, the predicted car position after a predetermined time and the predicted number of cars for each floor or zone are calculated, and it is determined for each floor or zone whether the frequency of hall calls is high or low. However, it is less likely to wastefully limit the allocation to the predicted empty car based on the determination result of the predicted number of cars and the occurrence frequency of the hall call. As a result, the waiting time for a hall call can be further shortened.

[Embodiment] FIGS. 1 to 10 are views showing an embodiment of the present invention.
In this embodiment, it is assumed that four cars are installed in a 12-story building.

FIG. 1 is an overall configuration diagram. The group management device (10) and the car control devices (11) for the first to fourth units controlled by the group management device (10).
It is composed of (14). (10A) is a hall call registration means, which registers and cancels hall calls (uplink calls and downlink calls) on each floor and calculates the elapsed time after the hall calls are registered, that is, the duration time. (10B) is an estimated arrival time calculating means, which calculates an estimated value of the time required for each car to arrive at the hall (by direction) on each floor, that is, an estimated arrival time. (10C) is an allocation means for selecting and allocating one of the best cars for servicing a hall call, and performs an allocation calculation based on a predicted waiting time of the hall call and a determination result by an allocation limiting means described later. (10D) is a car position predicting means for predicting and calculating the car position and car direction after a predetermined time T has passed from the present time. (10E) is a car number predicting means for predicting the number of cars that will be in a predetermined floor area after a predetermined time T has elapsed based on the predicted car position and the predicted car direction. (10F) is a waiting means, and when the car finishes answering all the calls, it makes the car stand by on the floor or specific floor where it has finished answering. (10G) is an empty car detection means that detects a car that has no door to answer and is in a closed state as an empty car. (10H) is a predictive empty car detection means, which is a car that has a call to answer at this moment (including the car that is answering the call) and is expected to be an empty car after a lapse of a predetermined time T. Detect as a predicted empty basket. (10J)
Is a quota limiting means for determining whether or not the quota of the hall call for the predicted empty car is restricted or excluded.

(11A) is a well-known landing call canceling means, which is provided in the car control device (11) for Unit 1 and outputs a landing call cancellation signal for a landing call on each floor. (11B) is a well-known car call registration means for similarly registering car calls on each floor. (11C) is a well-known arrival forecast light control means, which similarly controls the lighting of arrival forecast lights (not shown) on each floor. (11D) is a well-known operation direction control means that determines the operation direction of the car. (11
E) is a well-known operation control means that controls the running and stopping of the car in order to respond to the car call and the assigned hall call. (11F) is a well-known door control means that controls opening and closing of the door. In addition, the car control device for Units 2 to 4 (12)
~ (14) are also constructed in the same manner as the car control device (11) for the first car.

FIG. 2 is a configuration block diagram of the group management device (10). The group management device (10) is composed of a microcomputer (hereinafter, referred to as a microcomputer), and MPU (micro processing unit) (101), ROM (102). , RAM (103), input circuit (10
4) and an output circuit (105). The input circuit (104) has a hall button signal (19) from a hall button on each floor,
And the state signals of the No. 1 to No. 4 units from the car control devices (11) to (14) for No. 1 to No. 4 units are input, and the signals from the output circuit (105) to the hall button lights built in each hall button. (2
0), and car control devices (11) to (1) for Units 1 to 4
The command signal to 4) is output.

Next, the operation of this embodiment will be described with reference to FIGS. FIG. 3 is a flowchart showing a group management program stored in the ROM (102) of the microcomputer constituting the group management device (10), FIG. 4 is a flowchart showing the empty car detection program (33), and FIG. Similarly, a flowchart showing a car position prediction program (35), FIG. 6 is a flowchart showing a car number prediction program (36), FIG. 7 is a flowchart showing an allocation limit calculation program (37), and FIG. 8 is a building. It is a figure showing the state divided into a plurality of floor areas (zones).

First, the outline of the group management operation of FIG. 3 will be described.

The input program of step (31) is the hall button signal (1
9), Status signals (car position, direction, stop, running, door open / close status, car load, car call, landing call cancellation signal, etc.) from the car control devices (11) to (14) for Units 1 to 4 It is well-known to input.

In the empty car detection program in step (33), as shown in FIG. 4, a car in the closed state that does not have a call to respond to is detected as an empty car. In FIG. 4, step (46), that is, steps (42) to (45), represents a procedure for detecting whether or not the first car is currently an empty car. If Unit 1 does not have a car call or assigned hall call and is in a non-directional, door-closed state, step (42) → step (44) →
Proceed to step (45) where the empty car flag AV ₁ is set to "1". In cases other than the above, the empty car flag AV ₁ is reset to “0” in step (43). Performs detection of the car in also step (47) - (49) with respect to 4 Units Unit 2 sets the empty car flag AV ₂ ~AV _4.

In the estimated arrival time calculation program of step (34), each hall i (i = 1,2,3, ..., 11
Are B2, B1,1, ..., 9th floor uphill platform, i ＝ 12,13,
・ ・ ・ 21 and 22 are the expected arrival times Aj (i) at 10, 9 ...
Calculate every 1, 2, 3, 4). The estimated arrival time is calculated, for example, assuming that it takes 2 seconds for the car to advance to the first floor and 10 seconds for one stop, and that the car sequentially travels around the entire hall once. The calculation of the estimated arrival time is well known.

In the car position prediction program for step (35),
Predicted car position F ₁ (T) to F ₄ after the predetermined time T of Unit ₄
(T) and the prediction car directions D ₁ (T) to D ₄ (T) are calculated for each car. This will be described in detail with reference to FIG.

In the car position prediction program (35) shown in FIG. 5, step (65), that is, steps (51) to (64), includes the predicted car position F ₁ (T) and the predicted car direction after the predetermined time T of the _first car.
The procedure for calculating D ₁ (T) is shown. If there is a hall call assigned to Unit 1, step (51) → step (5
Proceed to 3), and predict that the terminal floor in front of the farthest assigned hall call will be the final calling floor of Unit 1, and the direction of arrival of the car on that floor (downward on the top floor, on the bottom floor, (Upward direction) is also taken into consideration and set as the final call prediction hall h ₁ . When Unit 1 has only the car call without the assigned hall call, step (51) → step (5
2) → Go to step (54), where the farthest car calling floor is predicted to be the final calling floor of Unit 1, and the final call prediction hall h ₁ is set in consideration of the car arrival direction at that time. . Further, when the first car does not have the assigned hall call or car call, the process proceeds to step (51) → step (52) → step (55), where the car position floor of the first car is the final call floor. Then, considering the car direction at that time, the final call prediction hall h ₁ is set.

When the final call prediction hall h ₁ is obtained in this way, then
In step (56), it is determined whether or not Unit 1 is an empty car.
When the first car is not an empty car (AV ₁ = “0”), the predicted value of the time required for the first car to become an empty car (hereinafter referred to as the empty car prediction time) t ₁ is obtained in step (57). The predicted empty car time t ₁ is the predicted arrival time A ₁ at the final call prediction landing h ₁ .
It is calculated by adding the predicted value T _S (= 10 seconds) of the stop time at the hall to (h ₁ ). In addition, the car position floor is the final call prediction platform
When set as h ₁ , the car condition (running, decelerating,
The remaining time of the stop time is predicted according to the door opening operation, the door opening operation, the door closing operation, etc., and this is set as the empty car prediction time t ₁ .

Next, in step (58), 1 is reached before the predetermined time T elapses.
Determine if the car will be in an empty basket. When the predicted empty car time t1 of the _first car is less than or equal to the predetermined time T, it means that the first car will be in the empty car before the predetermined time T elapses. Therefore, step (58) → step (59) ), Where the floor of the hall h ₁ is set as the predicted car position F ₁ (T) after the elapse of the predetermined time T based on the final call predicted hall h ₁ . In addition, the predicted car direction D ₁ (T) is set to “0”. The predicted car direction D ₁ (T) represents no direction when “0”, upward direction when “1”, and downward direction when “2”. Then, in step (60), the predicted empty car flag PAV ₁ of Unit 1 is set to "1".

On the other hand, when the predicted car time t _{1 of the first} car is longer than the predetermined time T, it means that the car has not become empty even after the predetermined time T has passed, so step (58) → step Proceed to (61), where estimated arrival time A ₁ (i-1) at hall i-1 and estimated arrival time A ₁ (i) at hall i are {A ₁
The floor of the hall i such that (i-1) + T _S ≤T <A ₁ (i) + T _S } is set as the predicted car position F ₁ (T) after the elapse of a predetermined time T. Predict same direction Car direction D
Set as ₁ (T). Then, in step (62), 1
Reset the forecast empty car flag PAV ₁ of Unit No. to “0”.

In step (56), the first car is empty (AV ₁ =
In the case of “1”), the empty car prediction time t ₁ is set to 0 seconds in step (63), and the floor of the hall h ₁ is set for a predetermined time based on the final call prediction hall h ₁ in step (64). Set as the predicted car position F ₁ (T) after T has elapsed. Also, the predicted car direction D ₁
Set (T) to "0". Then, in step (62), the predicted empty car flag PAV ₁ of Unit ₁ is reset to "0".

In this way, in step (65), the predicted car position F ₁ (T) and the predicted car direction D ₁ (T) for the _first car are calculated and the predicted empty car is detected, but the predicted cars for the second to fourth cars are calculated. Position F ₂ (T) to F ₄ (T), predicted car direction D ₂ (T) to D
₄ (T) and the predicted empty car flags PAV _{2 to} PAV ₄ are also set in steps (66) to (68), which have the same procedure as step (65).

Referring again to FIG. 3, in the car number prediction program of step (36), the number of cars on a predetermined floor or a predetermined floor area after a predetermined time T has passed, for example, as shown in FIG.
Floor area (zone) consisting of floors or multiple consecutive floors
The predicted car numbers N ₁ (T) to N ₆ (T) are calculated for Z _{1 to} Z ₆ , respectively. This will be described in detail with reference to FIG.

In the car number prediction program (36) of FIG. 6, the predicted car numbers N ₁ (T) to N ₆ (T) are set to “0” in step (71), and the machine number j and zone number m are set to “ Initially set to 1 ”. In step (72), based on the j Unit predicted car position F _j (T) and the predicted car direction D _j (T), it determines whether j Unit after a predetermined time T has elapsed is in the zone Zm. If Unit j is predicted to be in Zone Zm, the number of predicted cars Nm (T) in Zone Zm is determined in step (73).
Increase by one. In step (74), the machine number j is incremented by one, and in step (75) it is checked whether the judgment has been completed for all machines. If not completed, the process returns to step (72) and the above-mentioned processing is repeated.

When the processes of steps (72) and (73) are completed for the zone Zm of the zone number m, next, at step (76), the zone number m is incremented by 1 and the number j is set to "1". Initialize. Then, similarly, the processes of steps (72) to (75) are repeated until the machine number j> 4. All zones Z ₁ to Z ₆ processing zone concludes the step (77) the number of the above m> 6, and the ends the processing of the car number predictions for the zone Z ₁ to Z _6.

In steps (78) to (84), the number of empty cars NAV and the predicted number of empty cars NPAV are counted. In step (78), the number NAV and the number NPAV are set to "0" and the machine number j is initialized to "1". If No.j is an empty car, the process proceeds from step (79) to step (80), where the number of empty cars NAV is increased by one. If Unit j is a predicted empty car, step (79) → step (81) → step (82)
Then, increase the number of predicted empty cars NPAV. In step (83), the unit number j is incremented by one, and in step (84) it is checked whether or not all the units have been judged. If not, return to step (79),
The above process is repeated.

In this way, the predicted number of cars N ₁ (T) to N _{6 for} each zone
(T), number of empty cars NAV, and predicted number of empty cars NPAV
Is counted, and the processing of the car number prediction program (36) ends.

Steps (3) in the group management program (10) in FIG.
In the allocation restriction program of 7), when a hall call C is newly registered, the floor position of the hall call C, the predicted number of cars N ₁ (T) to N ₆ (T) at that time, and the number of empty cars Based on NAV and predicted number of empty cars NPAV, the above hall call C
It is determined whether or not the allocation of Nos. 1 to 4 is restricted, and allocation restriction evaluation values P _{1 to} P ₄ for making it difficult to allocate to the new hall call C are set. It should be noted that the quota evaluation value P ₁ ~P ₄ means that the degree of quota as a large value go up, this value will be equivalent to except from the from the beginning of the allocation target if to infinity. This determination procedure will be described in detail with reference to FIG.

In the allocation restriction program of FIG. 7, the new hall call C belongs to the upper floor zone (Z ₃ or Z ₄ ) and the empty car is 1
Many cars are expected to be in the upper floor zone (Z ₃ or Z ₄ ) after a lapse of a predetermined time T without any cars (NAV <1) (N ₃ (T) + N ₄ (T) ≧ Na) There are not many predicted empty baskets (1 ≦ NAV ≦ Nb), and there is a lower floor zone (Z
₁ or Z ₆ ) If the traffic condition is such that landing calls are likely to occur, step (81) → step (82) → step (83)
→ Go to step (84) → step (85) → step (86), where the allocation limit evaluation value Pk of the predicted empty car k (k ∈ {1,2,3,4}) is predicted to "99999". Not empty basket n
The allocation limit evaluation value Pn of (nε {1,2,3,4} and n ≠ k) is set to “0”. Other than the above, it sets the assigned limit evaluation value P ₁ to P ₄ of all of the cars to "0" at step (87). In this way, the allocation limit evaluation values P _{1 to} P ₄ are set.

Steps (3) in the group management program (10) in FIG.
In the waiting time evaluation program of 8), the new hall call C is 1
The evaluation values W _{1 to} W ₄ relating to the waiting time of each hall call when temporarily allocated to Units ₄ to ₄ are calculated. Since the calculation of the waiting time evaluation values W _{1 to} W ₄ is well known, detailed description thereof will be omitted. For example, when Unit 1 is provisionally allocated, prediction of each hall call i when Unit 1 is provisionally allocated is performed. Wait time U (i) (i
= 1,2, ..., 22: If the hall call is not registered, “0” seconds are calculated, and the sum of these squared values, that is, the waiting time evaluation value W ₁ = U (1) ² + U (2) ² + ...
Calculate with + U (22) ² .

Next, in the assigned car selection program in step (39),
_One assigned car is selected based on the above-mentioned quota restriction evaluation values P _{1 to} P ₄ and waiting time evaluation values W _{1 to} W ₄ . In this embodiment, the total evaluation value Ej when the new hall call C is provisionally assigned to Unit j is Ej = W
It is determined by j + k · Pj (k: constant), and the car with the smallest total evaluation value Ej is selected as a normally assigned car. An assignment command and a forecast command corresponding to the hall call C are set in the assigned car.

Further, in the standby operation program of step (40), when an empty car that has answered all the hall calls occurs, the above empty car is kept waiting on the floor of the final call so that the car does not become stuck in one place. It is determined whether or not to wait on the specific floor. When it is determined to wait on the specific floor, a standby command for traveling to the specific floor is set in the empty car.

Finally, in the output program of step (41), the hall button light signal (20) set as described above is sent to the hall, and allocation signals, forecast signals, standby commands, etc. are sent from Units 1 to 4 It is sent to the car control devices (11) to (14).

The above group management programs (31) to (41)
Is repeatedly executed.

Next, the operation of the group management program (10) in this embodiment will be described more specifically with reference to FIGS. 9 and 10. For the sake of simplicity, description will be given using the example used in FIGS. 12 to 15.

In the state shown in FIG. 12, it is assumed that the downward call (9d) on the 9th floor is registered as shown in FIG. The duration of the 5th floor ascending call (5u) is 10 seconds. At this time, when the 9th floor downcall (9d) is provisionally assigned to the car A, the predicted waiting times of the 9th floor downcall (9d) and the 5th floor upcall (5u) are 24 seconds and 16 seconds, respectively. The waiting time evaluation value W _{A at} time is W _A = 2
4 ² +16 ² = 832. On the other hand, 9 when temporarily assigned to car B
The predicted waiting times of the floor down call (9d) and the fifth floor up call (5u) are 28 seconds and 16 seconds, respectively, and the waiting time evaluation value W _B at this time is W _B = 28 ² ＋16 ² ＝ 1040 . Therefore, in the conventional allocation method, since W _A <W _B , the 9th floor down call (9
d) is assigned to car A.

Now, the car positions of the cars A and B after a predetermined time T (T = 20 seconds) have become like the car A'and the car B'as shown in FIG. Therefore, the predicted number of cars at this time is N ₃ (T) = 2, N ₁ (T) = N ₂ (T) = N ₄ (T) =
N ₅ (T) = N ₆ (T) = 0 cars, and the number of empty cars NAV = 0
Number of cars, predicted number of empty cars NPAV = 1 In this example, the non-directional car is regarded as the upward direction, but the direction may be appropriately determined according to the car position. Also, in this example,
If the fixed values Na = 2 units and Nb = 1 unit, N ₃ (T) = 2 units corresponds to the case where all the cars are in one zone, so the allocation restriction program (37) in Fig. 7 In step (86), the allocation limit evaluation value P _A of car A is set to 99999, and the allocation restriction evaluation value P _{B of} car B is set to 0. Therefore, the overall evaluation value is E _A = W _A + P _A = 99999 = 100831, E _B = W _B + P _B = 1040 + 0
= 1040, E _A > E _B , so the 9th floor descending call (9
d) is assigned to car B.

With the conventional allocation method, the car is allocated to car A and the car will be in a dangling operation in the near future. However, by assigning to the car B in consideration of the car arrangement after the elapse of the predetermined time T, such dumpling operation can be prevented.

As described above, in the above embodiment, the car sequentially responds to the call from the present time to predictively calculate the car position and car direction after a predetermined time has passed, and based on these, the predicted number of empty cars and the number of empty cars in each zone. The number of cars after a predetermined time has elapsed is predicted and calculated, and the allocation restriction operation for the predicted empty cars is performed according to these predicted numbers of cars, so the cars will not be concentrated in one place, and it will be close to the present time. The waiting time for landing calls can be shortened in the future.

In the above embodiment, when predicting the car position and car direction after the lapse of a predetermined time T, first, the car floor and the floor that will be the vacant car after answering the final call are predicted. After that, the car position and car direction after the predetermined time T has elapsed are predicted. This is because it is assumed that the car will wait as it is when the car is empty.

If it has been decided that an empty car will always wait on a specific floor, the car position and car direction can be predicted assuming that the car will travel to the specific floor. Further, the car position and the car direction can be predicted in consideration of a call that will be newly generated before the predetermined time T elapses. Furthermore, the calculation direction of the final call prediction hall is not simplified as in this embodiment, but may be finely predicted based on the statistically obtained probability of the car call or hall call.

Further, in the above embodiment, the building is divided into zones as shown in FIG. 8, but in addition to the number of floors and the number of installed cages, the time zone and the purpose of each floor (main floor, dining floor, meeting room floor, (Transfer floor, etc.)
It is easy to change the setting method of the successive zones according to the above. Moreover, it is not always necessary to decide the zone in consideration of the landing direction.

Furthermore, in the above embodiment, (a) when the new hall call C belongs to the upper floor zone, there is no empty car, and the number of cars expected to be in the upper floor zone after the elapse of the predetermined time T. There are many predicted empty cars, but there are not many and there is not so many, and it is a traffic condition where landing calls are likely to occur in the lower floor zone.

If any of the above conditions (1) to (3) is satisfied, the allocation restriction evaluation value (> 0) for restricting the allocation to the new hall call C for the predetermined predicted empty car is set.

I did it. However, the conditions for setting the quota evaluation value are not limited to this.

(B) When the new hall call C belongs to the lower floor zone, there is no empty car, and the number of cars expected to be in the lower floor zone after the elapse of the predetermined time T is large, and the predicted empty car is 1 There are pedestrians, but not many, and the traffic condition is such that landing calls are likely to occur in the upper floor zone.

It is also possible to apply the condition (b), and (c) when the new hall call C belongs to the middle floor zone, there is no empty car, and it is expected that it will be in the middle floor zone after a predetermined time T Although there are many cars to be closed and there is one predicted empty car, there are not many cars and the traffic conditions are such that landing calls are likely to occur in the upper floor zone or lower floor zone.

It is also possible to apply the condition (C). In addition, we use the inside out that the cars are concentrated in one zone.

(D) When a new hall call C is registered, there is no empty car, either in the upper floor zone, the lower floor zone, or the middle floor zone, in the zone to which the new hall call C does not belong, In addition, there is a zone where there is no car expected to be after the predetermined time T has passed, and there is one predicted empty car, but there are not many and there are not many. It is in a state.

The condition (d) can be applied. When this condition (d) is satisfied, it is desirable to control the allocation of the predicted car closest to the zone satisfying the above condition among the predicted empty cars.

Here, the conditional terms in the above conditions (a) to (d) are
It is provided to maximize the effect of preserving the predicted empty basket. The effect of the present invention is not significantly impaired even if there is no traffic condition in this condition.

Further, although the condition regarding the number of empty cars in the condition items in the above conditions (a) to (d) is set to 0 empty cars, the present invention can also be applied when the number of empty cars ≧ 1. . For example, (e) When the new hall call C belongs to the upper floor zone, there is one empty car in the upper floor zone, and there are many cars that are expected to be in the upper floor zone after the elapse of the predetermined time T. There is one predicted empty basket, but not many.

If the condition (e) is satisfied, it is possible to limit the allocation to the new hall call C to a predetermined predicted empty car. This condition (e) is effective when the traffic is not congested such that a hall call is generated immediately in the lower floor zone. That is, the empty car is effectively used for the new landing call C to be serviced in a short time, and the predicted empty space will soon become an empty car for the landing call that will be registered in the lower floor zone in the near future. It is intended to bring the car into service.

Furthermore, in the condition items in the above conditions (a) to (e), the condition that “the number of predicted empty cars is 1 or more and less than a certain value Nb” is added. This is because it is not always necessary to save the predicted empty car due to quota restrictions when there are many. In the process of selecting the predicted empty car that should be restricted by eliminating the condition of "below a certain value Nb", one or two specific cars (for example, empty car prediction time)
Select the car that is likely to become the empty car earliest using t _{1 to} t ₄ , or predict car position F ₁ (T) to F ₄ (T) and predict car direction D ₁ (T) to D ₄ ( (T) is used to select the car closest to the lower zone, and the same effect can be obtained.

Other than this, various conditions for restricting the allocation to the predicted empty car based on the predicted number of cars are conceivable, but it is obvious that the condition can be easily realized like the condition (a) shown in FIG.

Furthermore, in addition to the above (a) to (e), when a plurality of conditions according to each situation are provided, it is possible that two or more conditions are satisfied at the same time. In such a case, there arises a problem of which condition to decide the car to which the allocation is restricted. There are various methods for solving such a problem, and one of them is to use the well-known fuzzy theory. For example, as described in detail in the above-mentioned "Elevator group control device" (1988, Electrical and Information Related Society, Proceedings Vol. 2 pp. 2-117 to 120), the conditions that make up the conditions The membership function represents the degree to which each of the terms holds, and the minimum value is selected for AND connection and the maximum value is selected for OR connection by using them. In this method, the certainty factor is calculated and the condition with the highest certainty factor is finally selected. There is also a method of assigning weights according to the degree of certainty to the assignment restriction method corresponding to each condition, and assigning the cars accordingly. It is obvious that the present invention can be applied to the conditions in such a system. In this way, what is the condition under which the predicted number of cars that will be concentrated on a predetermined floor or a predetermined floor area and the predicted number of cars that will become empty cars in the near future are used? May be.

Furthermore, in the above-described embodiment, as a means for restricting allocation to hall calls, an allocation restriction evaluation value having a larger value than other cars is set for a specific car, and this is weighted and added to the waiting time evaluation value. Then, the overall evaluation value was obtained, and the car with the minimum overall evaluation value was selected as the regular assigned car. In this way, the quota evaluation value is combined with other evaluation values to be comprehensively evaluated and assigned, which is nothing but to preferentially assign a car having a low quota evaluation value. That is, a car having a large allocation restriction evaluation value is harder to allocate than other cars.

Further, the means for restricting the allocation to the hall calls is not limited to the above-mentioned embodiment, and a method of excluding a car satisfying the allocation restriction condition from the candidates for the allocated car in advance may be used.

Furthermore, in the above embodiment, the waiting time evaluation value is the sum of squared values of the predicted waiting time of hall calls, but the method of calculating the waiting time evaluation value is not limited to this. For example, the present invention can be applied even when using a method in which the sum of the predicted waiting times of a plurality of registered hall calls is used as the waiting time evaluation value, or the maximum predicted waiting time is also used as the waiting time evaluation value. Clearly applicable. Of course, the evaluation item to be combined with the allocation limit evaluation value is not limited to the waiting time, and may be combined with an evaluation index having an evaluation item such as a failure of prediction or fullness.

Further, in the above embodiment, the car position and car direction after a lapse of a predetermined time for one kind of predetermined time T are predicted for each car, and the allocation limit evaluation value is calculated based on this prediction. Predetermined time T1, T2, ..., Tr
For (T1 <T2 <... <Tr), predict the car position and car direction for each car after a predetermined time has elapsed, and after a predetermined time has elapsed for multiple types of predetermined time T1, T2, ..., Tr Predicted number of cars Nm (T1) to Nm (Tr)
Each is calculated for Zm (m = 1, 2, ...). It also calculates the predicted number of empty cars NPAV (T1) to NPAV (Tr). Then, each combination {N ₁ (T1), N ₂ (T
2), ..., NPAV (T1)}, {N ₁ (T2), N ₂ (T2), ・
.., NPAV (T2)}, ..., {N ₁ (Tr), N ₂ (Tr), ...
.. NPAV (Tr)}, weighting addition is performed on the allocation limit evaluation values P (T1), P (T2), ..., P (Tr). That is, P = k1 · P (T1) + k · P (T2)
＋ kr ・ P (Tr), (k1, k2, ..., kr are weighting factors)
It is also easy to set the final allocation limit evaluation value P by calculating according to the following formula. In this case, instead of paying attention to the car placement only at a certain point T, T1, T
Since the car layout at two or more points such as 2, ..., Tr will be evaluated globally, it is possible to further reduce the waiting time for a hall call from the present time to the near future. The weighting factors k1, k2, ..., Kr are, for example, the first
As shown in Fig. 1, there are several possible setting methods depending on when the car placement is emphasized, but it may be selected appropriately according to the traffic conditions and the characteristics of the building.

[Effects of the Invention] As described above, according to the present invention, a hall call registration means for registering a hall call when the hall button is operated, and a car to be serviced from a plurality of cars for the hall call are selected. Group management of elevators including allocation means for allocating the car and determining operation direction of the car, operation control such as departure, stop, door opening and closing, and car control means for making the car respond to the car call and the allocated hall call. The device calculates the expected arrival time until the car arrives at the final call floor for each car that has not answered all the calls that should be answered, and further determines the call that should be answered based on this expected arrival time. Predicted empty car detection means that calculates the predicted time until all the answers are completed and detects cars whose predicted time is within the predetermined time as a predicted empty car, and the predicted empty car When being issued, the allocation means for making the allocation of the predicted empty car harder to assign to a landing call than other cars, or allocation control means for performing an allocation limiting operation for excluding the predicted empty car from allocation targets, the allocation means, Since the car to be allocated is selected based on the output of the allocation limiting means, the car is less likely to be concentrated in one place in the near future, and as a result,
The effect is that the waiting time for a hall call can be shortened.

Another invention is, as described above, a hall call registration means for registering a hall call when a hall button is operated, and selecting a car to be serviced from a plurality of cars for the hall call. In an elevator group management device comprising allocation means for allocating, and operation control for determining the operating direction of a car, departure, stop, door opening and closing, and the like, and a car control means for making a car respond to a car call and the allocated landing call. , The empty car detecting means for detecting the car that has answered all the calls to be answered as an empty car, and all the calls to be answered within the first predetermined time among the cars other than the empty car Predicting empty car detecting means for detecting a car expected to be in a state as a predicted empty car, car position predicting means for predicting a car position after a second predetermined time, and this car position predicting means Car number predicting means for predicting the number of cars after the elapse of the second predetermined time for each floor or zone based on the predicted calculation value, and the presence or absence of the empty car when the predicted empty car is detected And the number of cars predicted on the specific floor or zone by the car number predicting means, the allocation is made to make it more difficult to allocate the predicted empty car to a hall call than other cars or to exclude the predicted empty car from allocation targets. Since the allocation means is configured to select an allocation car based on the output of the allocation restriction means, it is possible to reduce unnecessary allocation restriction to a predicted empty car at the same time. , In the near future, it is less likely that one car will be concentrated in one place, and as a result,
The waiting time for landing calls can be further shortened.

Further, as described above, another invention is, as described above, a hall call registration means for registering a hall call when the hall button is operated, and selecting a car to be serviced from a plurality of cars for the hall call. Allocating means and operation control such as car direction determination, departure, stop, door opening and closing,
In a group management device for an elevator equipped with a car call and a car control means for making a response to the assigned hall call, a response is made within a first predetermined time of the cars in a state in which all the calls to be answered have not been answered. A predictive vacant car detecting means for detecting a car expected to be in a state where all calls to be answered are predicted as a predictive vacant car, and a car position predicting means for predicting and calculating a car position after a second predetermined time. Based on the predictive calculation value of the car position predicting means, the second
Of the number of cars after the lapse of a predetermined time for each floor or zone, and when the predicted empty car is detected, the number of cars predicted for the specific floor or zone by the means for predicting the number of cars Based on the above, allocation limit value setting means for setting the degree of making it more difficult to allocate the predicted empty car to a hall call than other cars as an allocation limit value,
Using the predicted empty car detection means, the number-of-cars prediction means, and the allocation limit value setting means, the allocation limit values when the second predetermined time is set to a plurality of different values are respectively calculated, and the allocation thereof is further performed. Since the allocation means is configured to select the allocation car based on the total allocation limit value, the allocation allocation means for setting the total allocation restriction value by combining the restriction values is used. At the same time as the restriction is reduced, it is less likely that the car will be concentrated in one place from the present time to the near future, and as a result, the waiting time for the hall call can be further shortened.

And, as described above, another invention is, as described above, a hall call registration means for registering a hall call when the hall button is operated, and selecting a car to be serviced from a plurality of cars for the hall call. Assigning means to be assigned and operation control such as car driving height determination, departure, stop, door opening and closing,
In a group management device for an elevator equipped with a car call and a car control means for making a response to the assigned hall call, a response is made within a first predetermined time of the cars in a state in which all the calls to be answered have not been answered. A predictive vacant car detecting means for detecting a car expected to be in a state where all calls to be answered are predicted as a predictive vacant car, and a car position predicting means for predicting and calculating a car position after a second predetermined time. Based on the predictive calculation value of the car position predicting means, the second
Whether the frequency of hall calls is high or low based on the number of cars predicting means for each floor or zone after the lapse of a predetermined time, and the floor characteristics or past hall call occurrence records. And a traffic condition determining means for determining each floor or zone, and when the predicted empty car is detected, the predicted number of cars on the specific floor or the specific zone by the car number predicting means and the hall call by the traffic condition determining means Based on the determination result of the occurrence frequency of, the allocation limiting means for performing the allocation restriction operation of the hall call to the predicted empty car, the allocation means to select the allocation car based on the output of the allocation restriction means As a result, it is less likely to unnecessarily limit the quota for the predicted empty car, and as a result,
This has the effect of further reducing the waiting time for a hall call.

[Brief description of drawings]

FIG. 1 is a block diagram of the entire configuration of an elevator group management device according to an embodiment of the present invention, FIG. 2 is a configuration block diagram of the group management device (10) of FIG. 1, and FIG. 3 is a group management program (10 ), FIG. 4 is a flowchart of the empty car detection program (33) of FIG. 3, FIG. 5 is a flowchart of the car position prediction program (36) of FIG. 3, and FIG. The flow chart of the program (36), Fig. 7 shows the quota control program (3
7) Flowchart diagram, FIG. 8 is a diagram showing zone division of a building, FIGS. 9 and 10 are diagrams showing a relationship between call and car positions, and FIG. 11 is a diagram for explaining another embodiment of the present invention. It is a figure. FIG. 12 to FIG. 16 show a conventional elevator group management device, and are diagrams showing the relationship between the call and the car position. In the figure, (10A) ... Hall call registration means, (10C) ...
… Assignment means, (10D) …… Car position prediction means, (10E)…
… Car forecasting method, (10F) …… Standby method, (10G)…
… Empty cage detection means, (10H) …… Predicted empty cage detection means,
(10J) …… Allocation limiting means, (11) to (14) …… Car control means. In the drawings, the same reference numerals indicate the same or corresponding parts.

Claims (10)

[Claims] 1. A hall call registration means for registering a hall call when a hall button is operated, an allocation means for selecting and allocating a car to be serviced from a plurality of cars to the hall call, and a car In an elevator group management system equipped with a car control means for determining the direction of travel, departure, stop, door opening and closing, and controlling the car to respond to the car call and the assigned landing call, all the calls that should be answered For each car that has not finished answering, calculate the expected arrival time until it arrives at the floor of the final call, and based on this expected arrival time A predictive empty car detection unit that calculates a predicted time and detects a car whose predicted time is within a predetermined time as a predicted empty car; and when the predicted empty car is detected, the predicted empty car Or a quota limiting unit that performs quota limiting operation for making the predicted empty car less likely to be assigned to a hall call than other cars, and the assigning unit assigns based on the output of the quota limiting unit. Elevator group management device characterized by selecting a car. 2. The number of predicted cars is 1 in the allocation limiting means.
The elevator group management device according to claim 1, wherein when the number of vehicles is equal to or more than the number of vehicles and is equal to or less than a predetermined number, the hall call allocation limiting operation is enabled for the predicted empty car. 3. A hall call registration means for registering a hall call when a hall button is operated, an assigning means for selecting and allocating a car to be serviced from a plurality of cars to the hall call, and a car In an elevator group management system equipped with a car control means for determining the direction of travel, departure, stop, door opening and closing, and controlling the car to respond to the car call and the assigned landing call, all the calls that should be answered An empty car detecting means for detecting the car that has finished answering as an empty car, and a car that is expected to be in a state where all calls to be answered among the cars other than the empty car have been answered within the first predetermined time Based on the prediction calculation value of the car position prediction means for predicting and calculating the car position after the second predetermined time, and the prediction calculation value of the car position prediction means. And a car number predicting means for predicting the number of cars after the second predetermined time for each floor or zone, and the presence or absence of the empty car and the car number prediction when the predicted empty car is detected. Allocation restriction that makes it more difficult to allocate the predicted empty car to a hall call than other cars or excludes the predicted empty car from allocation targets on the condition of the predicted number of cars on a specific floor or zone by means Means for selecting an assigned car based on the output of the allocation limiting means. 4. The allocation limiting means, when the empty car is not detected and the number of cars predicted in the specific zone by the number-of-cars predicting means is equal to or more than a predetermined number, the specification is performed on the predicted empty car. When the vacant car call allocation limiting operation is enabled and the vacant car is detected or the predicted number of cars in the specific zone is less than a predetermined number, the queuing call of the specific zone is allocated to the predicted empty car. The elevator group management device according to claim 3, wherein the limiting operation is invalidated. 5. The allocation limiting means, when the empty car is not detected and the number of cars predicted in the specific zone by the number-of-cars predicting means is less than a predetermined number, the specification is performed on the predicted empty car. When the allocation restriction operation of hall calls other than zones is enabled and the empty car is detected or the number of predicted cars in the specific zone is equal to or more than a predetermined number, the hall calls other than the specific zone for the predicted empty car The group management device for an elevator according to claim 3, wherein the assignment restriction operation is invalidated. 6. A hall call registration means for registering a hall call when a hall button is operated, an allocating means for selecting and allocating a car to be serviced from a plurality of cars to the hall call, and In an elevator group management system equipped with a car control means for determining the direction of travel, departure, stop, door opening and closing, and controlling the car to respond to the car call and the assigned landing call, all the calls that should be answered A predictive vacant car detection means for detecting, as a predicted vacant car, a car that is expected to be in a state in which all the calls to be answered within the first predetermined time have been answered among the cars in the unfinished answer state; Based on the car position predicting means for predicting and calculating the car position after a predetermined time, and the number of cars after the second predetermined time has passed, based on the predictive calculation value of the car position predicting means, For each predicting car number predicting means, when the predicted empty car is detected, based on the predicted car number of the specific floor or the specific zone by the car number predicting means, the predicted empty car from other cars Also using the allocation limit value setting means for setting the degree of difficulty of allocation to the hall call as the allocation limit value, the predicted empty car detection means, the car number prediction means, and the allocation limit value setting means, the second predetermined time. And an allocation limiting unit that calculates the allocation limiting values when the values are set to a plurality of different values, and further combines the allocation limiting values to set a total allocation limiting value, wherein the allocating unit is the total allocation limiting value. An elevator group management device characterized by selecting an assigned car based on the following. 7. A hall call registration means for registering a hall call when a hall button is operated, an allocating means for selecting and allocating a car to be serviced from a plurality of cars to the hall call, and In an elevator group management system equipped with a car control means for determining the direction of travel, departure, stop, door opening and closing, and controlling the car to respond to the car call and the assigned landing call, all the calls that should be answered A predictive vacant car detection means for detecting, as a predicted vacant car, a car that is expected to be in a state in which all the calls to be answered within the first predetermined time have been answered among the cars in the unfinished answer state; Based on the car position predicting means for predicting and calculating the car position after a predetermined time, and the number of cars after the second predetermined time has passed, based on the predictive calculation value of the car position predicting means, For each floor or zone, a method for predicting the number of cars and a method for determining whether the frequency of hall calls is high or low based on floor characteristics or past hall call occurrence records When the predicted empty car is detected, based on the predicted car number of the specific floor or the specific zone by the car number predicting means and the judgment result of the landing call occurrence frequency by the traffic state judging means, the predicted empty car An elevator group management device, comprising: an allocation restricting unit configured to perform an allocation restricting operation of a hall call to a car, wherein the allocation unit selects an allocated car based on an output of the allocation restricting unit. 8. The allocation limiting means determines that the number of cars predicted in the specific zone by the number-of-cars predicting means is a predetermined number or more, and the traffic state determining means determines that a landing call is frequently generated in areas other than the specific zone. When the number of predicted cars in the specific zone is less than a predetermined number, or the frequency of hall calls occurring in a region other than the specific zone is valid. 8. The elevator group management device according to claim 7, wherein when it is determined that the elevator car is low, the operation of restricting the allocation of the hall calls in the specific zone is invalidated for the predicted empty car. 9. The allocation limiting means determines that the number of cars predicted in the specific zone by the number-of-cars predicting means is less than a predetermined number, and the traffic state determining means determines that a landing call is frequently generated in the specific zone. When the predicted number of cars in the specific zone is equal to or greater than a predetermined number, or the frequency of hall calls in the specific zone is 8. The elevator group management device according to claim 7, wherein when it is determined to be low, the operation of restricting the allocation of hall calls other than the specific zone is invalidated for the predicted empty car. 10. The predictive empty car detection means calculates the expected arrival time until the car arrives at the final call floor for all the cars that have not answered all the calls to be answered, and further arrives at this arrival. Claims characterized in that a predicted time until all the calls to be answered have been answered is calculated based on the predicted time, and a car whose predicted time is within a predetermined time is detected as a predicted empty car. Section 3,
The elevator group management device according to claim 6 or 7.