JPS59203073A - Controller for group of elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a group management system for elevators, and more particularly to a device suitable for managing and controlling a group of elevators using a computer.

[Background of the invention]

Conventionally, in elevator group management control, ill is the time taken for the elevator to arrive at the hall call floor, or
A method has been proposed in which the evaluation value is the time it takes for an elevator to arrive at a hall call floor, pick up a passenger, and then unload the passenger at the destination floor (service completion time).

However, there are some difficulties in calculating the evaluation value with high accuracy. In other words, even if it is possible to accurately predict the time at which elevator E will arrive at hall call Hl when hall call H1 occurs, the new hall call 112 will be between elevator E and hall call Hl after that. If the elevator occurs on the floor of Elevator E and is assigned to elevator E, Elevator E will stop at hall call H2 before arriving at hall call H1. Therefore, the time it takes for the elevator-E to arrive at the hall call H1 is different from the predicted time calculated when the hall call H1 occurs.

Also, if hall call H3 is already assigned to elevator-E between hall call Hl and elevator-E (C), a car call will occur after hall call H3 service. If the error occurs between Elevator -E and hall call Hl, as a result, the time it takes for elevator E to arrive at hall call Hl will be different from the predicted time calculated when hall call H1 occurs.

As a method to improve the above disadvantages,
The following method is proposed in Publication No. 66.

In other words, there is a method for predicting the destination floor of a hall or the floor where a call has occurred based on past information (information on floors where calls have occurred in the past) and correcting the error in the predicted arrival time of the elevator due to car calls. be.

However, this method has the disadvantage that it requires a large amount of memory and computation because the destination floor of each hall call is collected for all floors and directions, and the floor with the highest probability is predicted as the destination floor. Kameru.

Similarly, the above-mentioned difficulties exist when accurately calculating the service completion time, but from the time the elevator arrives at the hall call floor and picks up passengers,
It is even more difficult because it is necessary to predict the time it will take to drop off passengers at the destination floor when the hall call occurs.

Furthermore, only for passengers who are already in the car,
Japanese Patent Application Laid-Open No. 161760/1984 proposes a system in which the boarding time is calculated and added to the waiting time to allocate the generated hall call to the elevator with the lowest overall evaluation value. However, this method has the drawback that the boarding time of passengers boarding from each floor is not predicted in advance when a hall call occurs, and therefore call allocation control is not performed using the service completion time as an evaluation value.

[Purpose of the invention]

SUMMARY OF THE INVENTION An object of the present invention is to provide an elevator group management control device that is capable of improving service even after passengers board the elevator in a case where a plurality of elevators are installed in parallel. .

[Summary of the invention]

It is difficult to predict in advance the destination floor of a passenger who has boarded the train by hall call, and it is difficult to improve the accuracy even with a large processing device. Further, even if the prediction is made, if a call to be serviced occurs on the way to the destination floor, the elevator will stop at that floor, so it does not mean that the service quality for the passengers has been predicted.

By the way, as a result of investigating the traffic demand of Pill, it was found that there is a typical flow of elevator users, and the characteristics are also reflected in the boarding time of those passengers.

This passenger riding time is considered to be the service quality for the passengers.

Therefore, the present invention collects passenger ride times in the past, adds this collected ride time to an element of the evaluation index, and
By selecting a service elevator for a hall call using an evaluation index that includes this boarding time, it is possible to calculate the passenger's boarding time. Ii1. The group management control included in the control element has been realized, thereby making it possible to improve the service to passengers.

In particular, the boarding time has significant characteristics depending on the floor on which the passenger boarded according to the hall call K, the direction in which the passenger travels, and the state of traffic demand or time of day. Therefore, by collecting and using the riding time for each of these characteristics, further service improvement can be expected, but these points will be explained in detail in one embodiment below.

[Embodiments of the invention]

In order to facilitate understanding of a specific embodiment of the present invention, the first
First, I will explain the concept of the city 1 using a diagram.

As shown in FIG. 1, the content of this embodiment is divided into past processing and current processing.

The past process was a collection process. For example, a passenger who boarded the elevator or cabin on the first floor called out the destination floor and designated it using the button CB. In Figure 1, the second floor is indicated, so passengers get off at the second floor.

At this time, since the car call generation time is during the dispatch time, as shown by the dotted arrow ■, 1 is added to the number of car calls in the 1st floor UP direction during the dispatch time on the collection table.
As shown by the dotted arrow ■, the passenger presses the call button CB.
The time from when you press until you get off is added to the riding time for the 1st floor UP direction during the dispatch time period on the collection table.

In this way, boarding time and number of calls are collected for each floor by traffic demand and direction.

On the other hand, in the current process, consider a case where a hall call occurs on the first floor in the UP direction.

First, assuming that the current traffic demand is the dispatch time period, the evaluation function is calculated from the boarding time and the number of calls in the 1st floor UP direction during the dispatch time period in the collection table, as shown by the dotted arrows ■ and ■. Calculate the average riding time per call,
The service completion time for the hall call that occurred on the first floor is calculated by adding it to the predicted time for the elevator to arrive from its current position to the first floor. Using the above method, the evaluation value of the hall call that occurred in the 1st floor UP direction is determined for each elevator, and the maximum evaluation value is determined by considering the evaluation values of the hall calls and car calls that have already been assigned. . As a result, the elevator with the smallest maximum evaluation value is selected and the hall call generated in the UP direction of the first floor is assigned. As a result, this embodiment realizes a call allocation method using the service completion time as an evaluation value.

Next, an embodiment of the present invention using this concept is shown in FIGS.
This will be explained in detail using FIG. 20. In the description of the embodiments, first, the hardware configuration for realizing the present invention will be described, and then
Next, the overall software configuration and its control concept will be described, and finally, the software that realizes the above IT' control concept will be explained using table configuration diagrams and flowcharts.

FIG. 2 shows the overall hardware configuration of an embodiment of the present invention.

The elevator group management equipment MA has an elevator operation control function, a function to collect the number of hall calls and boarding time by time period, floor, and direction, and a function to collect the number of hall calls and boarding time by time zone, floor, and direction.
There is a microcomputer M that controls the function of calculating the average ride time per hall call for each direction.

The microcomputer Mt/C has a circuit PIA (periphery) that inputs and outputs the call signal H from the pole call device HD in parallel.
al ■interface Adapter). In addition, the microcomputer E
~E (here, it is assumed that the elevator number n is present) are serial communication processors 8DAl~SDAゎ and communication lines CMI~CM.

connected via.

In addition, the machine control microcomputer El-E is equipped with control input/output elements consisting of car call information, car load change information for each floor, various elevator safety limit switches, relays, and response lamps necessary for control. A circuit PIA for inputting and outputting one word is provided in parallel with EIO+ to EIO, and the circuits are connected via signal lines S10+ to SIO.

The present invention will be explained in detail using FIG. Microcomputer M
It has a built-in operation control program mainly for call assignment, and takes in the necessary information for the microcomputers El to E1 for controlling each machine and the hall call H direction control. Based on this information, the operation control program calculates the arrival time to the called floor after the hall call H service as the average boarding time, and calculates the time required for the elevator to service the hall call H and the above average boarding time. The evaluation time obtained by adding the times is calculated, and the maximum value of the evaluation time of calls serviced by the elevator is set as the evaluation time of each elevator.

Hall call H is then assigned to the elevator with the minimum evaluation time.

Here, the average riding time is during dispatch and during the first half of lunch.

Scams are spoofed at different times of the day, such as half past lunch, late lunch, normal hours, leaving work, and bacteria count time.

Next, the specific hardware configuration of each microcomputer will be shown, but these microcomputers can be easily configured as shown in FIGS. 3 and 4. MPU is the center of the microcomputer
(Micro processing [Jnit
), 8-bit, 16-bit, etc. are used, and an 8-bit MPU is particularly suitable when no extra processing power is required for the machine control microcomputers E1 to Ea. On the other hand, the elevator
Since the operation control microcomputer M requires complex calculations, a 16-bit A (PU) with excellent calculation performance is suitable.

Now, each microcomputer has M as shown in Figures 3 and 4.
R that stores control programs, etc. on the PU bus @BUS
OM (Read Ool'/ MemorY)
and RAM (F) that stores control data, work data, etc.
Random Access Memory), a circuit PIA that inputs and outputs signals in parallel, and a dedicated processor f SDA (5e) that performs serial communication with other microcontrollers.
ria11)ata Adapter (for example, Hitachi HD43370) is connected.

In addition, in each microcomputer M, E, ~E, R, AM,
The ROM is composed of a plurality of elements depending on the size of its control program.

FIG. 3 shows the configuration of the elevator group management device.

In Fig. 4, elevator control unit data includes, for example, car call button CB, safety limit switch SWL, relay suction point 5Way, car weight Weig.
llt is imported from PIA as R, A M K , E+v.

On the other hand, data calculated by the MPU is output to control output elements such as I) IA response lamp and relay Ry.

Here, the hardware configuration of the processor SDA for serial communication between microcomputers used in FIGS. 3 and 4 mainly includes a transmission buffer TXB as shown in FIG.

RXI, P/S that performs parallel/serial conversion of data, S/P that performs inverse conversion, and controller CN that controls their timing, etc.
It is composed of many T. The above transmission buffer '1. ”X
s, the reception buffer RXB can be freely accessed by the microcomputer, and data can be loaded into and read out from the SF.

On the other hand, the SDA has a function of automatically transmitting the contents of the transmitting buffer Txs to the receiving buffer RXB of another SDA via the controller CNT.

Therefore, the microcomputer does not need to perform any transmission/reception processing, so it can concentrate on other processing. The detailed configuration and operation of this SDA are disclosed in Japanese Patent Laid-Open Nos. 56-37972 and 1987-37973.

Next, a software configuration according to an embodiment of the present invention will be described. First, the overall software configuration will be explained with reference to FIG.

In order to implement the present invention, the software of the group management control system M mainly includes an operation control program 5F14 that allocates a hall call to the optimal elevator using the service completion time as an evaluation value, and a program that calculates the optimal average boarding time. ,
Time zone classification signal creation program SF5, car call collection program SF6.

A ride time collection program SF8, an average ride time calculation program 5F10, and a program 5F12 for determining the optimal average ride time for the generated hall call are added.

FIG. 7 shows an elevator control I data table SFI and a hall call table SF2. This shows the four configurations of clock table SF3.

The elevator status table SF'la includes data indicating the elevator position, direction, stop, running, pause, etc. of each car. In the assigned hall call/car call tables SF'lb and 5FIC, the assigned hall call floor and direction, and the car call position floor are entered as data for each car.

The assigned hall call duration table 5F1d shows the elapsed time from the occurrence of a hall call that has already been assigned to a car to the present, and the assigned hall call predicted arrival time table 5F1e shows the elapsed time from the occurrence of a hall call that has already been assigned to a car. The predicted time until arrival is memorized.

The predicted time is calculated based on the travel time between floors and the presence or absence of a stop call.

The car call continuation time table 8Flb shows the elapsed time from when a car call is generated by a passenger who gets into the car after serving the assigned hall call until the present time.

The predicted car call arrival time table SF1g shows the predicted time from the elevator position after the assigned hall call service until the car arrives at the floor where the car call occurs. The allocated hall call arrival time table 5F1h shows the time from when a hall call is generated until it is serviced.
The data is stored until the car call service that occurs after the hall call service ends.

Figure 8 shows Table 8F4, which presets the start time of change in traffic demand on -day, and the time until the traffic demand classification signal indicating the start of change in traffic demand changes from each hall call floor. The number of calls table 8F7 stores the number of calls occurring on each floor as data.
It shows.

FIG. 9 is a boarding time table SF9 consisting of data collected for each floor and direction of the actual service time from the car call generation time.

Figure 10 shows the hall call floor and the average ride time from the hall call floor until the elevator arrives at the destination floor, which is the call floor, by time of day, floor, and direction. Table 5 FII.

Figure 11 shows the average boarding time for each floor and direction from when a passenger boards the hall after the hall call service that occurs from each floor until the passenger arrives at the hall call service, which is the passenger's destination floor. Table S adapted to traffic demands
It shows F13.

FIG. 12 is a flowchart of the program SF5 for creating the current traffic demand classification signal.

In the figure, in step AIO, the clock data of clock table SF3 is substituted into variable T, and in step A20, 1 is set in variable T. In step A30, table 8
Traffic demand classification data Tr and T set in F4 are compared. If T is larger than T1 and I is not 8 (step A30), in step A60, the variable alK1 is added A-'r, and the process returns to step A30. In other words, although T is included in the next time period, it is checked in step A30,
If T≦T+, in step A40, 1 is subtracted from variable 1 to find out the current traffic demand. In step A70, the time zone classification signal TI is output to SIi'IO.

FIG. 13 is a program for counting the number of hall calls for each floor where hall calls occur and the destination floor.

In step BIO, the variable ■ is set to 1.

In step B20, it is checked whether a hall call has occurred on the first floor, and if so, in step B30, the elevator that services the generated hall call is set in a variable K. If it has not occurred, the process jumps to step B50. In step B40, elevator -K, which services the generated hall call on the first floor, is substituted into variable 1sH(I). In step B50, it is checked whether the current position of elevator-8H(I) is on the 1st floor. If so, the process goes to step B60, and if it is different from the 1st floor, the process goes to step B130.

In step B60, a variable Tc for counting the time until a car call occurs is set to O. In step B70,
It is checked if the corner call has occurred from the first floor. If it has occurred, the process goes to step B80, and the floor where the corner call has occurred is assigned to the variable ■. - If no force is generated, jump to step B130. In step B90, the first floor hall is called and the 7th day is called.

Assign the elevator-K that services the call whose floor is the 5th floor to the variable 5C (I, J). In step B100, CI, J) elements ((1 to force 1) of table SF7 are calculated, in step B110, 1 is added to variable #lTc, and in step B120, TC and car call occur -1-. Possible maximum time (maximum time from when the elevator arrives until the passenger who boarded from the relevant floor issues a car call) TST
Compared to OP, if Tc is smaller than 'J'5TOP, the process jumps to step B70 and waits for a car call when Tc becomes larger than 'I'5TOP.If TC is TSTO
If P becomes larger, jump to step B130 and set 1 to ■.
Add to check the next floor. In step B140, variable 1 is FLMAX2 (
1, the floor and direction are represented by the same variable 1)
If there is no response, the process ends; otherwise, the process jumps to step B20 and repeats the process until I becomes larger than I75KFLMAX2.

FIG. 14 shows 70- of the boarding time collection program SF8, and this program is the car call number collection program SF6.
will be started immediately after the

In step CIO, the floor variable 1 is set to 1. In step C20, it is checked whether the position of elevator 8H (I), which services the hall call on the first floor, is on the first floor. If it is on the first floor, in step C30, the start time of the hall call service on the first floor is set. Clock data T to TS (■
). If 5H(I) is different from ■, the process jumps to step C40. In step C40, 1 is added to the variable ■ to check the next floor, and in step C50,
is the maximum value FLMAX2 of the variable that represents the floor and direction at the same time
Check if it is greater than If it is smaller, jump to step C20. If larger, step C60
In step C70, ENG and J are set to 1, and in step C80, it is checked whether elevator-8C (I, J) is on the 5th floor. In step C90, if the car enters the fifth floor, the boarding time T' is calculated from the car call generation time TS(I) and the car call service end time T. In step C100, T' is added to the CI, J) element of table 8E9, and in step C110, 1 is added to variable J. Step Cl2O
Then, check whether J is larger than FLMAX2. If it is smaller, jump to step C80. If J is larger than FLMAX2, add IVCI at step C130, and set 1 and FLMAX2 at step C140.
Compare the size of. If ■ is larger than FLMAX2, the riding time will be added for each floor and direction for all floors and directions. If I is F'LMA
, X2 is smaller, the process jumps to step C70 and repeats.

Figure 15 is a flowchart of a program that calculates the average ride time for each floor and direction from the total number of calls and ride time determined in Figures 13 and 14, and stores it in the current traffic demand table. be.

In step DIO, the current time zone division signal is read into variables, and in steps D20 and D30, variables I and J are set to 1, respectively. In step D40, the eighth
The (I, J) element of the foot call number table SF7 in the figure is set to the variable C, and in step D50, the (I, J) element of the ride time table SF9 of FIG. 9 is set to the variable THC. In step D60, C is added to the variable C' for calculating the total number of calls from the hall call floor ■, and the boarding time TlIC from the hall call floor ■ is added to the variable Ti.
It is added to c. In step D70, 1 is added to the variable J, and in step D80, the sizes of J and FLMAX2 are checked. If J is FLMAX2
If it is smaller, jump to step D40 and J is FLMA.
If it is larger than X2, jump to step D90 and perform the 10th
The average/average boarding time from the construction floor is stored in one element of the time period of the average boarding time table 5FII shown in the figure. Step D1
00, 1 is added to ■, and in step D110, ■ and F are added.
Check the size of LMAX2, if ■ is FLMA
If X2 is smaller than FLMAX'2, jump to step D30; if X2 is larger than FLMAX'2, go to step D1
20, clear variables 5i ((I) and 5C (I, J), and further clear tables SF7 and SF'9.

FIG. 16 shows a program that determines the optimum average boarding time for hall calls that occur, and is started every time the time zone classification signal changes.

In step E10, the current time zone classification signal is set to L, and in E20, ■ is set to 1. In step E30, the current average riding time table SF'l in FIG.
Assign the ■ element of the time period in Table 5FII to one element of 3. At Step 7'E40, 1 is added to ■, and at step E50, the size of ■ and FLMAX2 is checked. If ■ is smaller than FLMAX2, the process jumps to step E30, and if it is larger, the average boarding time for all floors and directions has been transferred to the optimal average boarding time table 5F13.

FIG. 17 is a flowchart of the operation control program.
SF5. SF6. SF8.5FIO.

This program calculates a service completion time evaluation value using the optimal average boarding time calculated in 5F12, and allocates the generated hall call to an elevator according to the evaluation value.

In step FIO, the generated hall call H is read, and in step F20, 1 is set in the machine. In step F30, it is checked whether there is a hall call H on the first floor. If so, in step F40, the optimum elevator is determined according to the algorithm with the service completion time as an evaluation value, and in step F50, the hall call H Assign call H to the most suitable elevator. In step F60, 1 is added to ■, and in step F70, it is checked whether ■ is larger than FLMAX2. If ■ is smaller than FLMAX2, the process jumps to step F30. If ■ is FLM
If it is greater than AX2, all generated hall calls are assigned to the elevator.

FIG. 18 is a detailed flowchart of a program that implements the service completion time allocation algorithm (step F40) of FIG. 17.

In step F401, the variable K is set to elevator No. 1, and in step F402, the hall call evaluation value tJ++ (K) assigned to the elevator is calculated. In step F403, a car call evaluation 1iUc(K) for the elevator is calculated. In step F404, the evaluation value φK for the elevator is
(K,) and Uc (K) (I-J= 1, 2,
=-1C=1.2. ...) and determine it as the maximum value.

In step F405, add KKI and check whether K is larger than the maximum number of elevators KMAX (step F406). If K is smaller than KMAX J:, jump to step F402; if K is larger than KMAX, step F407 Then, the elevator with the smallest evaluation value among the evaluation values φx (K=1 to KMAX) for each elevator is selected as the optimum elevator.

FIG. 19 is a detailed flowchart of step F402 for calculating the hall call evaluation value UH(K) assigned to the elevator in FIG. 18.

In step F4021, the hall call duration time T) [(K) including the generated pole call H and allocated ahead is
(H=i, 2,...) is obtained from table SF'l. In step F4022, the generated hall call H
The predicted arrival time t++(K) (H= 1, 2, . . . ) of the hall call allocated ahead is determined from the table SF'l. In step F4023, the average boarding time 5i(K) (H= 1, 2) of the hall calls assigned ahead, including the generated hall call H.

...) from that floor and direction, table SFI 3
Find from. In Step F, 4024, H is set to 1, and in Step F'4025, the evaluation value UN(K) of the hall call assigned to the elevator is set to Ul((K)=TH(
K)+tH(K)+5a(K) (H= 1, 2.・
...). In step F4026, it is checked whether all assigned hole calls have been obtained.

If they have not yet been requested, the process jumps to step F4025, and if all have been requested, the process ends.

FIG. 20 is a detailed flowchart of the calculation step F403 of the elevator call evaluation value UC(K) (C20, 2, . . . ) in FIG. 18.

In step F4031, the front of the generated hall call H is determined from the table SFI. In Step I"4032, the predicted arrival time tc(K
)(C20, 2I...) is obtained from the table SF i. In step F4033, the elevator goes to the already serviced allocated hall call where the car call ahead of the generated hall call I4 occurs.
) is obtained from table SFI. In step F4034, C is set to 1, and in step F4035, the evaluation value Uc (K) of the call to the elevator is set to Uc (K).
= Tc (K) + tc (K-) + Sc
(K) and find C. In step F4036, it is checked whether evaluation values have been obtained for all car calls to the elevator, and if not, step F4035
Jump to, and if you are looking for it, finish it.

The above is an example of application to call assignment control using service completion time as an evaluation function.

In this embodiment, past boarding times are actually measured and the average value is predicted as the boarding time, so even if a new hall call is assigned to a floor halfway between the destination floors, there is little error in boarding time, and the service completion time is can be controlled with high precision.

Although the embodiment has been described above, the present invention can also be configured as follows.

First, although the actual riding time is collected, the estimated riding time may also be collected.

In this case, although the accuracy is lower than that of the actual measurement time, it is possible to achieve a reasonable effect. Further, the collection method can be such as collecting only by floor, only by direction, or by traffic demand condition or at a predetermined time. In other words, if there are characteristics when boarding each floor, but there are no characteristic movements in direction, etc.,
It is sufficient to collect boarding time on the floor side, and similarly, if the direction has more characteristics than the floor, for example, when going to work or leaving work, it is sufficient to collect only by direction. in this case,
Naturally, the time used for the evaluation index also corresponds to the information collected above. Moreover, the information is not limited to the above-mentioned traffic demand, but may be collected at predetermined times within - days and used as an evaluation index for the corresponding time.

Next, the evaluation index does not include many evaluation elements as in the above example, but simply uses a combination of the hall waiting time and the collected boarding time, or even only the boarding time. It can also be used for priority service, or for limiting the response of elevators that have the same boarding time.

That is, by combining the individual evaluation elements of the above embodiments or the well-known evaluation elements, it is possible to create an evaluation index according to the control purpose as appropriate, and even in this case, riding time is used as the evaluation element. Therefore, it is possible to improve the service after providing a ride.

In addition, the content of the ride time in this case is not limited to the average ride time as described above, but may also be the sum of collected ride times or only a specific ride time, and service performance can be obtained according to its characteristics. It is also clear that it is possible.

Second, the method of selecting a service elevator is not limited to the above embodiment, but may also be a method of simply selecting as a service elevator the one with the lowest evaluation value for the generated hall call, or the one with the evaluation value close to a specific value. good.

As described above, the evaluation index using the collected riding time of the present invention can be used alone, and can also be combined with well-known ones and applied and modified as appropriate.

〔Effect of the invention〕

According to the present invention, since the condition of the passengers after they have boarded the elevator is also used as an evaluation element for group management, it is possible to improve the service after the passengers have boarded the elevator.

[Brief explanation of the drawing]

1 to 20 are diagrams related to an embodiment of the present invention, in which FIG. 1 is a conceptual explanatory diagram of the embodiment, FIG. 2 is a hardware configuration diagram of the entire elevator group management control, and FIG. Figure 3 is a hardware configuration diagram of the group management control unit, Figure 4 is a hardware configuration diagram of the machine control unit, Figure 5 is an internal configuration diagram of the serial communication processor, Figure 6 is an overall software diagram of the group management control unit, Figure 7 is a control data table map, Figure 8 is a table map of traffic demand change start time and number of car calls, Figure 9 is a table map of boarding time, Figure 10 is a table map of average boarding time, and Figure 11 is the current table map. Average riding time table map adapted to demand, Figure 12 is a flowchart of the traffic demand classification signal creation program, Figure 13 is a flowchart of a program to count the number of calls by destination on the floor where hall calls occur, Figure 14 is a ride time collection program 15 is a flowchart of the average ride time calculation program for each floor/direction, FIG. 16 is a 70-chart of the optimal average ride time determination program, FIG. 17 is a 70-chart of the operation control program, and FIG. 19 is a flowchart of the service completion time allocation program, FIG. 19 is a 70-chart of the allocation hole call ♂lζ value operation 9 program, and FIG. 20 is a flowchart of the df value calculation program. HD...Hall call device, MA...fj? 'Il
Embedded control device, M... microcomputer, EI-
El...Microcomputer for machine control, 5DAI
~8DA. ...Serial communication processor, E■φ1 to EIφ3...
Each 4th meter house S eye 7 prisoner 8 tuji 9 kufan 10 taku 13 kuchiha 14m 155 sulfur 1 tied to 1 17 Kasumu 18th 19 Kuchishima 20

Claims (1)

[Scope of Claims] 1. A plurality of elevators in service between multiple floors, a hall call device provided on the floors, and the elevators.
In an elevator equipped with an elevator call device installed in the elevator car, there is a means for collecting the riding time of passengers who board from each floor, and an evaluation index for each elevator is calculated using the arrival time as one element. and means for selecting an elevator that services a hall call using an evaluation index for each elevator.
Group management control device. 2. The elevator according to claim 1, wherein the boarding time collecting means is configured to collect boarding times of passengers who have boarded each floor in the past for each floor. Group management control device. 3. The elevator group management control according to claim 1 or 2, wherein the boarding time collection means is configured to collect past boarding times for each passenger's destination direction. Device. 4. Claims 1, 2, or 3 are characterized in that the ride time collection means is configured to collect one past ride time by traffic demand or predetermined time. Elevator group management control device. 5. In claim 1, the riding time is:
A group management control device for elevators, characterized in that the actual or predicted time from the occurrence of a car call until the elevator arrives at the car call floor. 6. A group of elevators according to claim 1, wherein the evaluation index calculation means is configured to calculate an evaluation index in which the boarding time corresponding to the generated hall call is one element. Management control device. 7. In claim 1, the evaluation index calculation means is for an elevator configured to calculate an evaluation index in which one element is the boarding time corresponding to a hall call already assigned to the elevator. Group management control device. 8. Permissible Claims In Clause 6 or 7, the boarding time corresponding to the hall call mentioned above means the boarding time for both the generated hall calls to be on the same floor or in the same direction, or on the same floor and in the same direction. An elevator group management control device characterized by: 96. An elevator group management control system according to claim 6 or 7, characterized in that the sum or average value of the boarding times is one element of the evaluation index. 10. The elevator group management control device according to claim 6 or 7, wherein the evaluation index includes an element of waiting time for the hall call. 11. In claim 1, the evaluation index includes the elements of the waiting time of the elevator until it arrives at the call and the hall waiting time at the floor where the car call occurs. An elevator group management control device characterized by the following. 12. An elevator t11' management control device, as set forth in claim 1, which is characterized in that it allocates the hall call to the selected elevator.