JP2641747B2 - Group control elevator control device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a group control elevator control device, and more particularly to an elevator for a building having a plurality of floors with high traffic demand (hereinafter referred to as a "congestion floor"). The present invention relates to a group management elevator controller suitable for use in performing system call assignment.

2. Description of the Related Art Generally, entrances and exits of buildings are concentrated on one floor, and such floors are treated by names such as a lobby floor and a reference floor in elevator operation control, and a special floor is used on that floor. Control is being performed. However, among many buildings to be constructed, there are buildings having an entrance to an underpass, an entrance to a pedestrian bridge, and the like in addition to a main entrance. In an elevator system installed in such a building, since the congested floors are distributed over a plurality of floors, the floors serving as reference floors are switched and controlled according to traffic demand, or the reference floors are controlled on a plurality of floors. It performs specific control. In the case of an elevator control system of a call allocation system installed in such a building, for example, a method of simultaneously allocating a plurality of elevators to a crowded floor such as a lobby floor (centralized service control) or the like is adopted.

As a conventional technique relating to this type of elevator control system, for example, a technique described in Japanese Patent Application Laid-Open No. 52-11553 is known.

[Problems to be Solved by the Invention] According to the conventional technology based on the centralized service control described above, when there is only one congested floor, unloaded passengers can be processed by elevators arriving one after another, so that efficient elevator operation can be performed. Although possible, the following drawbacks occur when there are two or more congested floors. That is, one of them is that the number of elevators to be serviced is limited, so that the same elevator is often assigned to both of the two congested floors. It means that it becomes full and passes through the second congested floor, for example, the first floor. This disadvantage is likely to occur during times of extremely high traffic demand, such as when going to work. Further, in the elevator system of the reservation guide system, in such a case, reservation changes frequently occur. The second drawback is that it is likely to occur during normal hours, and when the same elevator services two congested floors, a large number of passengers get into the elevator, which causes a problem. Many elevator car calls were made, and the elevator ride time,
The problem is that the round-trip time becomes longer, and the riding time and the round-trip time of each car become non-uniform, so that trouble phenomena such as passing and overtaking tend to occur.

SUMMARY OF THE INVENTION An object of the present invention is to solve the above-described problems of the prior art, and in a call assignment type elevator system, when there are a plurality of congested floors in the same direction, reduce the number of occupied passengers, get on time for each car, An object of the present invention is to provide a group control elevator control device that can make the round trip time uniform, reduce passage and overtaking, and enable efficient group control operation of elevators.

[Means for Solving the Problems] According to the present invention, the object is to provide an elevator to be stopped at one of a plurality of congested floors in the same direction or to which a call for that floor is assigned. This is achieved by making it difficult to assign calls for other congested floors other than the congested floor.

[Operation] By providing the above-described configuration, the present invention increases the possibility that a plurality of congested floors will be serviced by separate elevators in many cases, and that the occupants will be able to go to work during busy hours during extremely busy traffic. Can be reduced, the unevenness of the riding time during normal times, and the non-uniformity of each car in one round time can be reduced, and the passing and overtaking phenomena can be reduced.

In addition, the present invention does not prohibit the assignment of an elevator that is scheduled to stop on one of the congested floors or is assigned a call on that floor to a congested floor other than that floor. If arrival at another congested floor is likely to be delayed, another congested floor can be serviced by the same elevator.

Further, according to the present invention, it is possible to limit the call assignment according to the degree of congestion on the congested floor, for example, when there is a high possibility of being full, such as when going to work, the degree of restriction is increased, Can be more easily allocated to the crowded floor, so that it is possible to reduce the possibility that the allocated elevator will pass through the floor.

In addition, the present invention exerts a sufficient effect even when a congested floor is designated as a floor which is divided in advance as described above, for example, a basement floor and a first floor. If the demand is learned and detected, it is possible to perform more appropriate elevator control for each time zone and traffic demand. That is, in general, the congested floor changes with time not only depending on the structure of the building but also depending on the presence or absence of an event on each floor, and the present invention also changes the traffic demand in such a case. By learning, it is possible to specify a congested floor and perform appropriate elevator control.

Hereinafter, an embodiment of a group management elevator control device according to the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing an overall configuration of an embodiment of the present invention, FIG. 2 is a diagram showing a software table configuration of a group management control device, and FIG. 3 is a flowchart for explaining overall processing of the group management control device. FIGS. 4 and 5 (a) are flow charts for explaining the call assignment process, FIG. 5 (b) is a diagram showing a ride congestion floor spec table, and FIG. 5 (c) is a ride congestion floor evaluation. It is a figure showing a graph which asks for a value. In FIG. 1, 1 is an elevator control device, 2 is a group management control device, 3 is a car control device, 4 is a car, 5 is a car call button, 6 is a hall call button, 7 is a hall lantern, and 8 is a display device. , 9 is a voice guidance device, and 10 is a load detection device.

In the embodiment of the present invention shown in FIG. 1, the elevator control device 1 includes a group management control device 2 and a plurality of car control devices 3, and the elevator car 4 is provided with a car call button. 5 is provided, and its signal is input to the car controller 3. Each floor 1F to 16F is provided with a hall call button 6 and its signal is transmitted to the group management controller 2
Is input to The group management control device 2 includes each unit control device 3
One elevator is assigned to the newly generated call from the hall call button 6 in consideration of the position, direction, car call status, congestion degree in the car, etc. A lighting signal is sent to the car controller 3. In addition, when the assigned elevator becomes full or the arrival is about to be delayed, the group management control device reassigns another elevator to the hall call, determines the guidance display content and voice guidance content for each floor. Then, control for transmitting to the car controller is also performed.

The unit control device 3 controls the operation of the elevator and the opening / closing of the door, and also continuously lights the hall lantern 7 in response to the reserved lamp lighting signal from the group management control device 2. When the elevator arrives, the hall lantern in the driving direction is operated. 7 is controlled to blink. In addition, the car control device 3 controls the display device 8 and the voice guidance device 9 at the landing on each floor, and provides guidance according to the contents instructed by the group management control device 2. Further, the car control device 3 converts the load change detected by the load detection device 10 attached below the floor of the car 4 into the number of people getting on and off the elevator,
This is transmitted to the group management control device 2.

FIG. 2 shows a software table configuration of the group management control device 2 that performs the above-described control. Below,
Only the configuration of the table will be described, and a method of using the table will be described together with a description of a processing operation described later.

(1) Hall call table “HC”: Records the registration status of hall calls on each floor by direction.

(2) Allocated hall call table "HAT"
Record the assignment status by direction and floor. With this signal, the elevator is operated for the hall call.

(3) Assigned hall call display command table "HLT" ...
Record the lighting status of reserved lights by unit, direction, and floor. The reservation light on each floor is turned on by this signal.

(4) Valid car call table "CC": Record valid car calls for each machine, direction, and floor. The valid car call is a car call ahead of the elevator in the traveling direction, the car call of the floor that has passed through is not recorded, and the table in the direction opposite to the driving direction is filled with “0” data on all floors.

(5) Elevator status table "ECD": Records data such as the position of the elevator, the driving direction, and the load in the car for each car.

(6) Predicted arrival time table "HARIVT" ... Records the predicted arrival time for each car, direction, and floor.

(7) Predicted car number table "HWT" ... The predicted car number at the time of arrival is recorded for each car, direction, and floor.

(8) Number of people getting on and off detection table “HPTW”: The amount of load change detected by the load detection device in the car when the elevator stops at each direction and floor is converted into the number of people getting on and off and recorded.

(9) Boarding / leavement number learning table "HPT": Record the number of people getting on and off by traffic demand, direction, and floor. The traffic demand is classified by demand such as going to work, normal times, lunch, leaving work, and the like, and a learning method thereof can be, for example, a method disclosed in Japanese Patent Application Laid-Open No. 59-39669.

(10) Ride congestion floor spec table "HPF": Record floors with a lot of congestion on each floor by direction.

(11) Data buffer table “DBT” for transmission to Unit No.
This is a table in which transmission data is temporarily recorded.

(12) Other tables: tables used for other functions such as dispersion and VIP operation.

Each of the various tables described above is configured in a RAM, and can be written and read by a processing program.

Next, the overall processing of the group management control device 2 will be described with reference to the flowchart shown in FIG. Usually, the software for group management employs a multi-task configuration. However, this configuration method is not directly related to the present invention. , The processing flow is shown.

(1) First, when the power is turned on, a memory, a control signal of an input / output device, and the like are initialized (steps).
S10).

(2) Next, input processing of a signal from the car controller and a hall call signal from the hall call button is performed to execute a call assignment process (steps S20 to S40).

(3) Detecting the number of getting on and off, classifying the detected number of getting on and off by traffic demand, and executing a process of learning the number of getting on and off (Step S50).

(4) A process of selecting several congested floors according to the current traffic demand, for example, a process of detecting several floors in order from the floor with the largest number of passengers in that time zone, Search for the table “HPF”. Details of this processing are disclosed in Japanese Patent Application Laid-Open No. 59-39669 (step S60).

(5) Other processes such as dispersion and VIP floor control are executed, and signals such as an output command to the display unit and an assignment command are transmitted to the car controller 3 (steps S70 and S80).

The processing of the above-mentioned steps S20 to S80 is repeatedly executed until the power is turned off.

Next, the details of the call assignment process in step S40 will be described with reference to the flowcharts shown in FIGS. This call assignment process is a method of finding a total evaluation value for each car and allocating the call to a car having the smallest value.

(1) First, the direction and the initial value of the floor are set, and it is determined whether there is a newly generated hall call on the processing floor (step SA).
10, SA20).

(2) In step SA20, when there is no newly generated hall call, it is determined whether or not the processing on all floors and the up and down directions has been completed, and the process proceeds to the next floor (steps SA90 and SA20).

(3) In step SA20, if there is a newly generated hall call, the initial setting of the evaluation value calculation unit is performed, and the waiting time evaluation value T _s and the packed evaluation value T _fw are calculated. The waiting time evaluation value T _s, a method for evaluating the average waiting time, a method for evaluating the maximum value or the like, can be determined by various methods, may be determined using any evaluation methods. Also, full evaluation value
T _fw is a method of setting a value equivalent to prohibition of allocation when it is predicted that fullness will occur at a distance beyond the generated call, a method of increasing the evaluation value in response to an increase in the load in the car, etc.
Although it can be obtained by various methods, it may be obtained by any evaluation method. The calculation in this process is a known method performed using the predicted arrival time table “HARIVT” and the predicted car number table “HWT”, and therefore detailed description thereof is omitted (steps SA30 and SA40).

(4) Next, a ride congestion floor evaluation value T _cw is obtained. How to obtain this method will be described later in detail with reference to the flow shown in FIG. 5 (step SA50).

(5) Waiting time evaluation value obtained in steps SA40 and SA50
The weighting factors K1, K2, and K3 are multiplied by T _s , the packed evaluation value T _fw , and the riding congestion floor evaluation value T _cw , respectively, and they are added to obtain a total evaluation value for each car (step SA60).

(6) It is determined whether or not the process for obtaining the comprehensive evaluation value for all the units has been completed.
Repeat the process from, repeat the process of the next car, if finished, compare the overall evaluation value of each car, select the car with the smallest value, and assign it to the hall call that occurred ( Step SA70, SA80).

(7) It is determined whether or not the processing on all floors and in both the up and down directions has been completed. If the processing has not been completed, the process returns to step SA20. If the processing has been completed, the call assignment processing is completed (step SA9).
0).

Next, the process of _obtaining the riding congestion floor evaluation value T _cw will be described with reference to the flow shown in FIG.

(1) First, it is determined whether the generated call is a call generated on a congested floor. In this process, it is determined whether or not the call that has occurred is a call that has occurred in the floor and direction in which the floor name is registered in the congestion floor spec table “HPF” shown in FIG. 5B. This is the processing to be performed. The congested floor spec table "HPF" has an area in which the congested floors of the fourth floor in the ascending direction and the fourth floor in the descending direction can be registered, and the floor names of the congested floors are shown in the flow of FIG. It is registered in the process of step S60. In the example shown in FIG.
The 2nd floor UP call, the 1st floor UP call, the 10th floor DN call, and the 14th floor DN call are registered (step SB10).

(2) If it is determined in step SB10 that the call is not a call on the congested floor, the process proceeds to step SB60. If it is determined that the call is a call on the congested floor, the call is made in the same direction as the generated call. It is determined whether or not there is a congested floor. This process is a process of determining whether or not another floor name is recorded in the congestion floor spec table "HPF" shown in FIG. 5B (step SB20).

(3) In step SB20, if another congested floor is not recorded, the process proceeds to step SB60. If another congested floor is recorded, the call for the floor designated as the congested floor is already made. It is determined whether or not it has been assigned to the unit.
This process is a process of determining whether or not there is an assignment signal in an area indicating the congested floor and direction of the relevant car in the assignment hall call table “HAT”. (Step SB3
0).

(4) If it is determined in step SB30 that the allocation has already been performed, the process proceeds to step SB50. If it is determined that the allocation has not been performed, the vehicle stops in the same direction on the floor designated as the congested floor. It is determined whether or not there is a schedule. This process is a process for determining whether or not a car call signal is present in an area indicating a congested floor and direction of the car in the effective car call table “CC”. In addition to the registration of the car call, the determination of the presence / absence of the scheduled stop is based on the past operation results, the current arrangement status of the respective elevators, etc., obtaining a floor with a high probability of stopping, and adding the floor to the determination condition. This may be performed (step SB40).

(5) If it is determined in step SB40 that there is no scheduled stop, the process proceeds to step SB60. Then, when it is determined in step SB40 that there is a scheduled stop, and when it is determined in step SB30 that the allocation has already been performed, the boarding congestion floor evaluation value T _cw is obtained according to the congestion degree of the boarding congestion floor. This process is a process of obtaining an evaluation value from the “congestion degree-congestion evaluation value conversion graph” shown in FIG. 5 (c). In the example of FIG. 5 (c), as the value of the degree of congestion increases, the evaluation value of the congestion floor increases in the primary curve, but the evaluation value of the congestion floor is limited to this example. Instead, if it increases with the value of the degree of congestion, it may be obtained by using various graphs such as a quadratic curve and a curve increasing in a step shape. In FIG. 5 (c), the congestion degree on the horizontal axis of the graph uses the data of the direction and floor of the traffic demand amount in the boarding / alighting number learning table “HPT” (step SB50).

(6) step SB 10, the case of SB20 and the result of determination in SB40 is "NO", the riding congestion floor evaluation value T _cw "0" to end the excisional the processing (step SB60).

When the call generated on the congested floor is assigned to the car by the above-described processing, the evaluation of the car to which the hall call of the other congested floor is already assigned and the car which will be stopped on the other congested floor Only the value is the ride congestion floor evaluation value T
The value of _cw is set to “0” or more, and other vehicles are set to “0” as the boarding floor evaluation value T _cw . Increasing the value of the congested floor evaluation value increases the value of the overall evaluation value for each car described with reference to FIG. 4, thereby making it difficult to perform call assignment and limiting the assignment. . In other words, a car scheduled to stop on one floor among a plurality of congested floors in the same direction, or a call assigned to that floor, has calls for other congested floors other than that floor. It will be difficult to assign.

Although illustration is omitted because the description is complicated, the designated floor of the congested floor may be present on a plurality of floors. In such a case, the flow shown in FIG. It is necessary to repeat the processing of steps SB20 to SB60 by the number of designated congested floors. At this time, the finally obtained congested floor evaluation value T _cw is expressed by the following equation (1):
It can be obtained from the sum of the evaluation values of the congested floors corresponding to each floor.

i: Designated congestion floor T _cwi : Congestion evaluation value of each congestion floor i According to the above-described embodiment of the present invention, when a call generated on a congestion floor is assigned to a car, another congestion floor is already used. It is difficult to assign a call to a floor hall call to a car that is scheduled to be stopped at another congested floor, and it is difficult for one elevator to be assigned a call to more than one congested floor. As a result, it is possible to reduce the number of occupied vehicles and reduce the occurrence of troubles caused by the unevenness of the boarding time and the round-trip time of each car. Further, according to the above-described embodiment of the present invention, the congested floor is designated by learning the traffic demand of the building, so that appropriate elevator control can be performed.

Further, according to the above-described embodiment of the present invention, the total evaluation value is obtained by summing the evaluation value of the congested floor, the evaluation value of the waiting time, and the evaluation value of the full capacity, and the elevator to be assigned is determined based on the result. Therefore, when the following elevator is likely to be full or when arrival is likely to be delayed, it is possible to assign two or more congested floors to the preceding elevator. This condition can be set freely by adjusting the weighting factors K _{1 to} K ₃ of the overall evaluation value.

FIG. 6 is a software configuration diagram for explaining another embodiment of the present invention. In this embodiment, the riding congestion floor spec table "HPF" shown in FIG. 5 (b) is determined in advance.

The congestion floor can be roughly estimated if the layout within the building is determined at the time of planning the building. For example, the floor at which congestion occurs and the time can be predicted in advance from the presence or absence of an entrance and exit leading to an underpass or a pedestrian bridge, the layout of the dining room floor, and the like.

Therefore, the embodiment of the present invention uses the above-described prediction result as:
Each traffic demand is registered in advance in the traffic congestion floor table "HPTM" by traffic demand, and a simple traffic demand detection device PT
And a signal from the time management device TM, the traffic congestion floor designation device PMM causes the traffic congestion floor table “H
One of the PTMs is selected and copied to the congestion floor spec table "HPF", and the same control as in the above-described embodiment of the present invention is performed using this table.

According to another embodiment of the present invention, see Japanese Patent Application Laid-Open No. 59-39669.
The same effect as that of the previous embodiment of the present invention can be obtained without the learning function of the congested floor as disclosed in Japanese Patent Application Laid-Open Publication No. H10-15095.

Next, the effects of the above-described two embodiments of the present invention will be specifically described.

FIG. 7 (a) shows the result of call assignment using the conventional method, and FIG. 7 (b) shows the result of using the method according to the embodiment of the present invention.

Now, it is assumed that the building has three elevators on the 10th floor, an entrance on the first floor, and an entrance to the pedestrian bridge on the second floor. As a precondition for the explanation, it is determined that Unit 1 is traveling down the seventh floor and responds to the car call on the fifth floor and the UP call on the second floor. Unit 2 is traveling down the eighth floor It has been decided to respond to car calls on the 6th floor and UP calls on the 3rd floor.
Suppose that it is decided to answer a car call on the seventh and ninth floors while traveling up the fifth floor.

Assume that an UP call has occurred on the first floor in such a situation. In this case, the prior art call assignment method:
As shown in FIG. 7 (a), the first car ahead of the first floor is assigned to the UP call on the first floor. As a result, the first car is located on the first floor, which is
After both floor calls are assigned and the first and second floors are serviced, many car calls occur. On the other hand, Unit 2
You only have to respond to UP calls on the 3rd floor with a small number of riders,
It is driven with few car calls. Accordingly, the first car stops on each floor due to many car calls, so that the ride time of the user is prolonged, and the probability of being overtaken by the subsequent vacant elevator is increased. For this reason, user dissatisfaction is increased.

In the call assignment control method according to the two embodiments of the present invention, the first car to which the UP call on the second floor, which is a congested floor, is assigned, the assignment to the call on the first floor, which is another congested floor, is restricted. I have. If the degree of this control is equal to or greater than the value corresponding to the first-floor traveling in the waiting time, FIG. 7 (b)
As shown in the figure, the call on the first floor is assigned to the second car. As a result, in the embodiment of the present invention, a large number of persons do not get into the first car alone, and the occurrence of troubles as in the case of the related art can be reduced. The problem with the prior art is that on the congested floor, the arrival time of people to the hall is short, and people tend to collect in the hall. The longer the time, the greater the effect, but also from this point, as in the embodiment of the present invention,
Assigning the calls of two or more congested floors to different car numbers is effective for solving the above-mentioned problem.

Next, still another embodiment of the present invention will be described with reference to the drawings.

FIG. 8 is a flowchart for explaining a process for obtaining a ride congestion floor evaluation value in still another embodiment of the present invention. In this embodiment, the congested floor described with reference to FIG. 5 selects four floors in each of the ascending direction and the descending direction, whereas the designation of the congested floor is all floors. It is.

In this case, the congested floor evaluation value T _cw is obtained by the above-described equation (1) for all the allocated calls and the calls to be stopped. This embodiment has an effect that the number of persons in the car can be made uniform, in addition to the effects of the above-described two embodiments of the present invention. The effect is that even if the number of passengers on the floor is small, the number of hall calls assigned to many floors will be increased by as many people as possible. Is calculated by taking the sum of the evaluation values of the congested floors of the vehicle and, based on this evaluation value, increasing the number of allocated floors, increasing the degree of restriction on the allocation to other floors, and limiting the allocation. Can be done. Thus, when all floors are designated as congested floors, processing can be performed by a dedicated flow as shown in FIG. 8 without performing the processing as shown in FIG. 5 (a). .

(1) First, the evaluation value T _cw of the congested floor is initialized to “0” (step SC10).

(2) Next, the direction and the floor are initialized. The direction at this time is the same as the generated call (step SC20).

(3) The assigned hall call in the same direction as the generated call
It is determined whether or not it is on the floor (step SC30).

(4) If it is determined in step SC30 that the allocated hall call is not on the floor, the process proceeds to step SC50. If it is determined that the hall call is present, the evaluation value on the floor is obtained, and the evaluation value T on the congested floor is obtained. Add to _cw . The method of calculating the evaluation value of this floor is the same as the method described in step SB50 of FIG. 5 (a), and the number of passengers on this floor is determined by the direction of the traffic demand in the passenger learning table “HPT”. And from the area of the floor, and the value is converted into an evaluation value by a “congestion degree-congestion evaluation value conversion graph” (step SC40).

(5) It is determined whether or not the processing for all floors has been completed,
If the processing has been completed, the processing is terminated. If not, the processing floor is updated and the processing after step SC30 is repeatedly executed (steps SC50 and SC60).

At the time when the processing of the flow shown in FIG. 8 is completed, the sum of the evaluation values of the congested floors of the assigned call floor has been obtained. The riding congestion floor evaluation value is as shown in the following equation (2).

i: Assigned hall call floor T _{cwi in the} same direction as the generated call T _cwi : Congestion evaluation value of each floor In the above-described still another embodiment of the present invention, the evaluation value of a floor having no assigned hall call and only a scheduled stoppage 5 is different from the flow shown in FIG. This is because when there is only a car call on a floor other than the congested floor, the evaluation value is not added because there are few passengers. However, even in such a case, it goes without saying that a process such as adding an evaluation value of the floor may be added to several floors of the congested floor.

[Effects of the Invention] As described above, according to the present invention, in the control of the group management elevator, if there are two or more congested floors in the same direction, the call of the congested floor is assigned.
Or, elevators that are scheduled to be stopped are restricted from assigning calls to other congested floors, so the same elevator can be assigned to two or more congested floors,
It is possible to reduce the number of stops and the number of occupied elevators passing full, and the riding time and round-trip time of each car become uneven,
This has the effect of reducing the occurrence of trouble phenomena such as passing and overtaking.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an overall configuration of an embodiment of the present invention, FIG. 2 is a diagram showing a software table configuration of a group management control device, and FIG. 3 is a flowchart for explaining overall processing of the group management control device. FIGS. 4 and 5 (a) are flow charts for explaining the call assignment process, FIG. 5 (b) is a diagram showing a ride congestion floor spec table, and FIG. 5 (c) is a ride congestion floor evaluation. FIG. 6 is a diagram showing a graph for calculating a value, FIG. 6 is a software configuration diagram for explaining another embodiment of the present invention, and FIGS. 7 (a) and 7 (b) are diagrams for explaining effects of the embodiment of the present invention;
FIG. 8 is a flowchart for explaining a process for obtaining a ride congestion floor evaluation value in still another embodiment of the present invention. 1 ... Elevator control device, 2 ... Group management control device,
3 ... Unit control device, 4 ... Car, 5 ... Car call button, 6 ... Hall call button, 7 ... Hall lantern, 8 ...
… Display device, 9… voice guidance device, 10… load detection device.

Continuation of the front page (72) Inventor Toshimitsu Tobita 4026 Kuji-cho, Hitachi City, Ibaraki Prefecture Within Hitachi Research Laboratory, Hitachi, Ltd. (56) References JP-A-60-52482 (JP, A) JP-A-59-177266 (JP) , A) Tokiko Sho 61-4748 (JP, B2)

Claims (6)

(57) [Claims] 1. An elevator system comprising: a plurality of elevators for servicing a plurality of floors; and a control device for assigning a hall call generated at the landing to one of the elevators, comprising means for designating a plurality of specific floors. A group to which an elevator to which a hall call of one of the plurality of specific floors is assigned is restricted from assigning a call of another specific floor in the same direction as the assigned call. Management elevator control device. 2. An elevator system comprising a plurality of elevators for servicing a plurality of floors and a control device for assigning a hall call generated at the landing to one of the elevators, comprising means for designating a plurality of specific floors. A lift that is scheduled to stop on one or more floors of the plurality of specific floors, the call allocation of another specific floor in the same direction as the stop direction is restricted. Management elevator control device. 3. The group control elevator control device according to claim 1, wherein the specific floor is a floor where traffic demand is high. 4. A method according to claim 1, wherein said means for designating a plurality of specific floors designates a predetermined floor for each ascending or descending direction. Item 4. The group control elevator control device according to Item 3. 5. The means for designating a plurality of specific floors is means for learning traffic demand for each direction of ascending or descending, and selecting and specifying a predetermined number of floors in descending order of ride demand. Claim 1, characterized in that there is,
Item 4. The group control elevator control device according to item 2 or 3. 6. The degree of restricting the call assignment is such that the higher the traffic demand of the already assigned call floor or the scheduled stop floor, the greater the degree of restriction on the call to be assigned. The group control elevator control device according to any one of claims 1 to 5, characterized in that: