JP3461564B2 - Elevator dispatch method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of allocating an elevator for allocating an optimum car from a group of cars to hall calls (hall calls) from each floor.

[0002]

2. Description of the Related Art When a hall call button is pressed on a floor of a building equipped with an elevator having a plurality of cars, a vehicle dispatch management device (operation control device or dispatcher) responds to the hall call by a group of cars. Select one from the inside and send it to that floor. That is, the "vehicle allocation" referred to in this specification means that a car is assigned according to a call and sent to a predetermined floor. Normally, the hall lantern lights up immediately before the car door opens, and informs the user (passenger) which car was dispatched to the hall call.

The vehicle allocation management device assigns a car to a hall call based on various elevator system parameters. The values of these system parameters change between the time when the hall call is registered and the time when the car is sent to the hall call. You may be reassigned the car many times before sending. The hall lantern does not become visible to the user because the hall lantern lights only after the car has arrived at the floor where the user is after the reallocations are made several times.

On the other hand, a vehicle allocation method called immediate car allocation (ICA) is to allocate a car to a hall call once and then maintain the allocation unchanged. Unlike the conventional elevator dispatch technology, ICA informs the user which car will arrive at the time when the car is first assigned to the hall call from the user (or immediately after that). . According to this method, the user is advantageous in that he / she can walk to the car scheduled to arrive in advance and wait in front of it so that the car can be boarded immediately when the car arrives. "Time to understand and walk (know and go
"time)" means the time from when a passenger knows which car will be dispatched to call his hall until he goes to that car and stands. Therefore, when the car arrives, in order for the user to wait in front of it,
You must avoid reassigning hall calls to different cars. This "time to understand and approach" is reduced by the time it takes for the reallocation by the vehicle allocation management device.

Up until now, the reason why reassignment has been tolerated multiple times has been to achieve an optimal assignment state. In the past, it was always possible to reassign, so it was possible to change the initial assignment that was not optimal when considering the events that occurred after the new hall call, car call, etc. However, it was not in the optimal allocation state. However, in ICA, the reassignment time is almost equal to zero, thus increasing the need to keep the preferred assignment state from the beginning. That is, this IC
In the vehicle allocation method according to A, since the initial allocation is retained and the reallocation is not performed in principle, it is necessary to make the initial allocation more appropriate, which car is allocated to the hall call.

When the ICA was first used, it was originally necessary to pay more attention to this problem. U.S. Pat. No. 4,363,381 "Relative
Relative system response (RSR) described in System Response Elevator Call Assignments is one of the commonly used methods assuming that multiple reassignments are possible. ICA is used with RSR, so this R
The SR / ICA method uses RSR to assign the first car to a hall call. RSR is a method that does not affect subsequent assignments (new hall calls or car calls) that may cause the quality of the first assignment to be affected. Even after the RSR / ICA, the first assignment is appropriate. The need to do so remained.

The "average registration time" is the time from when the hall call button is pressed until the hall call is canceled. This latter point in time depends on the elevator system. Some call off the hall call when the car arrives at the floor and gets on the floor.In general, the hall lantern is turned on when the car approaches the floor, and the hall call is canceled at the stop control point when the car starts decelerating. There are also things. This average registration time does not match the passenger waiting time. Not all passengers were waiting the same amount of time, and waiting time for all passengers cannot be measured.

The average registration time of an elevator system is a common measure of the performance of that elevator system. However, an appropriate average registration time is not always reliable and sometimes very long registration times are masked by frequent very short registration times. Engineers have found that there is typically only one hall call during a busy round trip, which waits for an extremely long time (eg, 135 seconds). It is rather rare that such a long waiting time occurs (for example, once or twice per 1000 hall calls). It is often the case that at least one (usually more than one) car associated with a hall call is skipped. In other words, such a "skipping" occurs because the car was unrelated to the hall call when it was skipped. If the car that ignores the hall call and skips is stopped in response to the hall call, an extremely long registration time can be shortened.

[0009]

The users have pointed out the necessity of shortening these extremely long registration times. By reducing the number of times hall calls are skipped, the vehicle dispatch management device can shorten the maximum registration time. However, at the same time, by sacrificing some of the other hall calls, the hall call with a long waiting time is dealt with specially, so that the average value of all registration times becomes long. In some markets, it is unavoidable that the average registration time will increase if the maximum registration time can be shortened.

FIG. 1 is a diagram for explaining the above-mentioned problem of the longest registration time and the fact that it cannot be focused on in the prior art. Car B is assigned to the hall call on the 7th floor, and is descending when a new hall call not yet assigned to any car is registered on the 9th floor. Car A is also going down, but if you look at this 9th floor hall call, it is farther than car B. Therefore, according to the conventional RSR method, since the car B is closer to the ninth floor than the car A, the car B is assigned to the new hall call registered on the ninth floor. This is convenient for the person who called the car in the hall on the 9th floor, but the person who called the car in the hall on the 7th floor where the car B was facing was the one who registered the call for the hall on the 9th floor. We have already waited 60 seconds. People on the 9th floor will have shorter waiting times, but those who have been waiting on the 7th floor will have to wait longer.

Therefore, it is an object of the present invention to maximize the "time to know and walk" by optimizing the initial allocation, and to shorten the maximum registration time to prevent the occurrence of an extremely long waiting time. It is in.

[0012]

Therefore, a vehicle allocation method for an elevator according to the present invention is a vehicle allocation method for assigning a hall call to a car, and is a first method for obtaining a remaining response time related to the car and the hall call. Step, a second step of obtaining a predicted registration time associated with the car and the hall call, a third step of obtaining an objective function according to the remaining response time and a predicted registration time, and the first step. ~ Comparing the fourth step of performing the third step for all cars available for allocation of the hall call with the objective function determined for all cars available for allocation of the hall call Then, a fifth step of obtaining a comparison result and a sixth step of allocating the hall call to a predetermined car according to the comparison result are configured.

Further, either or both of the longest predicted registration time and the relative system response amount may be included in the objective function.

[0014]

According to the present invention, the allocation of a car to a hall call is calculated based on the remaining response time (RRT), predicted registration time (PRT), longest predicted registration time (maxPRT), and relative system response (RSR) amount. Can be performed directly as a function of system parameters relating to passenger waiting time, including one or more of Further, according to the present invention, it is possible to perform car allocation for hall calls based on system parameters, prevent re-allocation, and implement instantaneous car allocation.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT The elevator dispatching method according to the present invention comprises two parts. The first part is to select a car for which a minimum value of the objective (semantic objective) function expressed by the following formula 1 is obtained from the group of cars for the newly generated hall call. Is to allocate the optimal car for.

[0016]

[Equation 1] OBJ (icar) = A ・ RRT + B ・ │PR
T-20│ + δ ・ C ・ (maxPRT-60) ² + D ・
Each item of the RSR will be described in detail later.

The use of the objective function in the elevator dispatch is not new per se. U.S. Pat. No. 4,947,965 to "Kuzunuki et al.," Group Control.
Method and Apparatus for an Elevator System with P
Lural Cages (Group management methods and devices for elevator systems with multiple cars). The RSR algorithm uses an objective function. The RSR algorithm and its various modifications are the RS
It can be said that the R algorithm includes various terms.
The basic component of the RSR amount is the estimated seconds required for the car to reach the floor where the hall call occurred.

However, by using a specific objective function, selecting an element in the objective function, using the objective function in combination with ICA, and directly calling the car as a hall call as a function of the performance measure of the elevator system. The points to be assigned are
It is novel along with the other content disclosed herein.

The second part of the invention is to perform instantaneous car assignment (ICA) in combination with an objective function. According to the present invention, a hall call that has some waiting while the car is already allocated is unlikely to be reassigned (reassigned) to another car. Reassignment more than once never occurs. Switching, or reassignment, is first of all significantly faster (eg at least 4) for the floor where the hall call originated, other than the already assigned cars.
0 sec) if there is a car that can arrive, or secondly, if the assigned car is moving away from the floor where the hall call originated (eg It is allowed only in two exceptional cases, such as when moving above the floor where the hall call occurred. When switching is allowed, allocation is performed based on the objective function. Each coefficient A shown in Equation 1,
The B, C, D values can be varied to reflect the building owner's preferences. Clearly, by setting all but one coefficient to zero, it is possible to assign cars based on only one measure.

R RT (Remaining Response Time) The term “remaining response time” refers to US Pat. No. 5,146,053 “Elev
ator Dispatching Based on Remaining Response Time
(Elevator vehicle allocation method based on remaining response time) ”. This "remaining response time" is
This is an estimated time (estimated second value) required for the car to reach the floor where the hall call is generated, in consideration of the combination of the assigned car call and the hall call. This is sometimes referred to in the elevator industry as Estimated Arrival Time (ETA).

FIG. 2 shows a car B moving downward to reach the twelfth floor in order to answer a car call to the ninth floor. At this point, a new hall call is registered on the 6th floor. The remaining response time of the car B for this new hall call is, for example, 15 seconds. A few seconds later,
When another new hall call on the 10th floor is assigned, car B is still descending in response to a car call to the 9th floor and a hall call on the 6th floor. Other new hall calls registered on the 10th floor extend the remaining response time on the 6th floor from 15 seconds to 25 seconds.

FIG. 3 shows the relationship between the car calls of cars B and C, the hall calls assigned to car B, and the floors in the building. FIG. 3 is a diagram for explaining the concept of the remaining response time after a hall call has already waited for a certain time such as 20 seconds. In FIG. 3, car B is moving downward to answer two car calls before the passengers have already waited for 20 seconds to answer the hall call assigned to car B. On the other hand, the car C is moving upward in order to respond to the car call to the floor (11th floor) above the floor (9th floor) in which the hall call is registered. Here, a problem arises as to whether the hall call on the 9th floor remains assigned to car B or is reassigned to car C.

If the car allocation for hall calls is made purely based on the remaining response time only:
The remaining response time of car B initially assigned and the remaining response time of car C are compared to assess the suitability of the current assignment, and switching from car B to car C, ie reassignment, is reasonable. Determine if there is.

Also, during the movement in the opposite direction until reaching the hall where the call is generated, if the hall call assigned to the movement direction is included, the car is said to go to the last floor in order to calculate the remaining response time. Make assumptions. (For example, because there was a car call to the 7th floor, move up from the 5th floor to 9
Consider the car assigned to the hall call on the floor. Here, a downward call is generated on the 10th floor. In order to predict the remaining response time of this car, the car will move downwards and will respond to the car call resulting from the hall call registered on the 9th floor before arriving on the 10th floor, to the top floor Suppose it is sent to. In other words, if a person boarding on the 5th floor designates the 7th floor (calling the car) and the car is moving up, and this car is assigned to the hall call on the 9th floor, a new descent on the 10th floor Assuming a hall call occurs, this car is 10 minutes after loading passengers on the 9th floor.
It is not always the case that you go upstairs to become a "downhill basket." This is because a person who gets on the 9th floor may specify the top floor. Therefore, it is clear that the assumption that the car goes to the top floor is not necessarily the worst case.

Assume that a car call to the top floor occurs as a result of an up hall call on the ninth floor. The situation may be worse if multiple people are waiting on the 9th floor where the hall call is registered and each pushes a different car call button. In such a worse case, the RRT is obviously longer due to the increased number of stops.

PRT (Predicted Registration Time) This measure is the total time of waiting time for a hall call (waiting time until now) and RRT. For a new hall call, there is no waiting time until now, so PRT = RRT. FIG. 4 is a diagram showing why it is insufficient to allocate a hall call based only on the remaining response time and why the predicted registration time is important for the allocation. Car B is currently on the 11th floor and is descending to answer the hall call assigned to it on the 6th floor. Now, when a new hall call is registered on the 9th floor, the waiting time of the passengers on the 6th floor is 50 seconds (extremely long). Another car C on the 14th floor is also descending. The remaining response time of car B for a new hall call registered on the 9th floor is 6 seconds. On the other hand, since the car C is farther from the car B on the 9th floor, the remaining response time of the car C for this new hall call generated on the 9th floor is 15 seconds. At this point, if logically selected, the car assigned to the new hall call becomes car B. However, in some situations, this assignment is improper because it affects other calls. If car B is assigned to the hall call on the 9th floor, the predicted registration time for the hall call on the 6th floor is 6
Extends to 5 seconds. On the other hand, if car C is assigned to the hall call on the 9th floor, the predicted registration time for the hall call on the 6th floor is 55 seconds. In this way, if car B is assigned to a new hall call registered on the 9th floor, based on only the short response time remaining when comparing the cars B and C of two aircraft, wait on the 6th floor. The estimated registration time for passengers is extremely long. The resulting expected registration time assigned as a function of such a pure remaining response time is 6
It will be tough for passengers on the floor. Since passenger frustration as a function of waiting time is non-linear, there is a difference between worried passengers and angry passengers, and an extra 10 seconds of waiting time for passengers on the 6th floor is not desirable. I can't say.

Therefore, in the present invention, the "predicted registration time" is included in the objective function in addition to the "remaining response time".

The scale of the estimated registration time is the estimated registration time and 2
It is included in the objective function as the absolute value of the difference from the time term T1 of 0 second. If the expected registration time is too long or too short, this term T1 will penalize the car.
This reflects a philosophy in the market where there are passengers who can wait about 20 seconds without feeling uncomfortable. Of course, this penalty term T1 is a variable and is not limited to 20 seconds. Therefore, it is advisable to allow a car capable of arriving at a floor where a hall call is generated in an extremely short time (for example, 5 seconds) to meet other more urgent traffic demands.

MaxPRT (maximum predicted registration time) A waiting time exceeding 90 seconds is considered to be extremely long,
This is not very frequent (one or two times every two hours during busy round trips). Waiting time affects passengers' frustration. It is important to reduce the number of times such a call with a long waiting time is generated and the waiting time. It is an object of the present invention that a car is assigned to an allocation only if it becomes the call with the longest waiting time (of all the hall calls currently waiting) waiting longer than the time term T2, ie 60 seconds. To deal with this long call by imposing a penalty on. Calls that have already waited 60 seconds are likely to exceed the 90 second threshold, so special care must be taken. This penalty term T2 is also a variable and is not limited to 60 seconds. In the objective function according to the present embodiment, this term is squared to reflect the frustration of the passenger, which nonlinearly increases as the waiting time exceeds 60 seconds and becomes longer. Of course, maxP
Like the PRT, the RT term is not necessarily squared, but it can be an argument for or against other functions for modeling passenger irritation. In the Dirac δ operator, when maxPRT is longer than T2 (60 seconds in this embodiment), the coefficient δ shown in Expression 1 is set to 1, and in other cases, the coefficient δ is set to 0. If maxPRT is set to less than 60 seconds, the third term on the right-hand side of Expression 1 is always zero.

RSR (Relative System Response) Currently, this measure is used in the objective function for building owners to revert to conventional RSR vehicle allocation methods.

Since there are many variants of RSR, RS
The value of the R term is selected according to which form is preferred.
The basic component of the RSR amount is an estimated amount of time until the car, which has been assigned, arrives at the hall where the hall is called. However, the value selected as the RSR value is P
US Pat. No. 5,146,05 to owell et al.
Issue 3 "Elevator Dispatching Based on Remaining resp
onse Time (elevator dispatch method based on remaining response time) "and U.S. Pat.
63, 381 "Relative System Response Elevator
Call Assignment ", U.S. Pat. No. 4,18 issued to Bittar.
No. 5,568 "Weighted Relative System Elevator Ca
r AssignmentSystem with Variable Bonuses and Penal
ties (weighted relative system elevator car allocation system with variable bonus and penalty), MacDon
Ald et al., U.S. Pat. No. 4,782,921, "Coincident Call Optimization in Elevator Dispatc."
hing System (coincidence type call optimization method in elevator vehicle allocation system) ", US Patent No. 5, issued to Auer
No. 202,540 "Two-way Ring Communication Syste
m for Elevator Group Control ", US Patent No. 5,168,136" Learning Methodo "issued to Thangavelu et al.
logy for Improving Traffic Prediction Accuracy of
Elevator System Using Artificial Intelligence ", US Patent No. 5,035,302" Artificial Intelligenc "issued to Thangavelu
ebased Learning System Predicting Peak-Period Time
s for Elevator Dispatching ", an artificial intelligence-based learning system that predicts peak hours for elevator dispatching," Th
U.S. Pat. No. 5,024,424 to Angavelu
No. 295 “Relative System Response Elevator Dispat
cher System Using Artificial Intelligence to Vary
Bonuses and Penalties ", a relative system response elevator transportation system that uses artificial intelligence to change bonuses and penalties," US Patent No. 5,022,497 to Thangavelu "Artificial Intellige
nceBased Crowd Sensing System for Elevator Car Ass
ignment (artificial intelligence-based congestion detection system for elevator car assignment) ", U.S. Pat. No. 4,838,384 issued to Thangavelu," Queue Based Elevat "
or Dispatching System Using Peak Period Traffic Pr
ediction (a queuing-based elevator dispatch system using traffic forecast at peak hours) ”or the like. Further, the bonus and penalty constituting the RSR term may be a variable value or a fixed value.

FIG. 5 shows a master flow chart for carrying out the vehicle allocation method according to the present invention. After the program starts, in step 1, a call in a certain direction occurs in the hall on the Nth floor. Then, in step 2, the vehicle allocation management device determines whether or not the hall call is already assigned to the car, and records the assigned car. Next, in step 3, the remaining response time and the shortest remaining response time for each car are calculated to determine which car is associated with it.

A series of determinations are performed to determine if the hall call assignment algorithm (FIG. 6) for reassigning hall calls should be performed. Figure 5,
The routines shown in FIGS. 6 and 7 incorporate the basic concept of “instantaneous car allocation” in that the cars are not reallocated unless absolutely necessary. Even if the car is reassigned, it is not reassigned more than once. In step 4 where the first judgment is made, the question is "Call a new hall?" If it is a new hall call, the routine of FIG. 5 is terminated and the execution of the hall call allocation algorithm shown in FIG. 6 is awaited. If it is not a new hall call, the process proceeds to the next three determination steps 5 to 7 to determine whether or not the previously assigned call needs to be reassigned. In step 5 of making the second determination, if the remaining response time of the assigned car is longer than the shortest remaining response time plus 40 seconds, the hall call for reassigning the hall call to another car Wait until the call assignment algorithm (FIG. 6) is executed without executing the routine of FIG. This step 5 shows that re-allocation should be avoided as much as possible, but if the shortest remaining response time is taken into account and the remaining response time of the current car is not sufficient, the You have to think about quotas. Such an extremely insufficient state is caused by a variable predicted registration time difference (here, 4
0 seconds). In the third and fourth decision steps 6 and 7, if the assigned car is moving away from the assigned hall call, the routine of FIG. 5 is executed until the hall call assignment algorithm is executed. Stop execution of. If YES is not determined in any of these determination steps 5 to 7, reallocation is not performed as shown in step 8.

FIG. 6 shows a hall call assignment algorithm. First, in step 11, the remaining response time already calculated for the current hall call allocation setting is read, and the waiting time so far for each hall call is added to the remaining response time associated therewith. , Used to calculate the predicted registration time (PRT) for all hall calls. Next, in step 12, the car index icar is set to zero. Then, as shown in steps 13 to 15, this car index is incremented by 1 for each car in the car group until the entire car is considered, and the multi-item function shown in Formula 1 is calculated for each car. It In addition, step 1
In 6, the car with the lowest objective function is determined and K is assigned to this car.
Label with AR.

Next, a series of judgment steps 17, 19, 21
To determine whether or not reallocation should be done. These three judgment steps 17, 19 and 21 are only four points shown in FIG. 5 only in that the hall call may be reassigned due to the difference with respect to the instantaneous car assignment as a result of executing these steps. This is similar to the judgment step. In the first decision step 17, if a hall call is newly generated, then in step 18 this hall call is assigned to the car labeled with KAR. On the other hand, if it is determined in step 19 that this hall call has not been newly generated and the call has already been switched from the first assigned car, the hall call is assigned as shown in step 20. I will not do it. In step 21, the predicted registration time (PRT) of the assigned car is the predicted registration time of the car labeled with "KAR", that is, the car with the lowest objective function, when the hall call is not newly generated. (P
RT). Predicted registration time (PR) of the assigned car than the predicted registration time of the car with the lowest objective function
If T) is much longer, the hall call is reassigned to the car with the lowest objective function (KAR car), as shown in step 22. In other cases, reallocation is not performed (step 23).

FIG. 7 shows a method of calculating a multi-item function. First, in step 31, for each hall call, the waiting time so far is stored and mapped to the direction of the hall call. Next, in step 32, it is assumed that the car for which the objective function is calculated is assigned to the hall call considering the reallocation in the master flowchart routine. Further, in steps 33 to 37, the remaining response time (RRT), predicted registration time (PRT), longest predicted registration time (maxPRT), and PSR value are calculated. These four terms of the multi-item function (the terms X, Y, Z shown in FIG.
Since we calculated each value of W), sum these,
Find the multi-item function used in the hall call assignment algorithm. As described above, the “multi-item function” referred to in the present specification, as shown in Equation 1, eliminates a long waiting time in consideration of a plurality of terms in units of time such as predicted registration time. It is a function that is obtained for the purpose of.

FIG. 8 is a graph of the car objective function in the car group. The car (car B) with the smallest objective function value is assigned to the hall call.

Thus, according to the present embodiment, by using the parameters such as the remaining response time and the predicted registration time, the objective function is created so that the extremely long waiting time is eliminated, and the optimum car numerical value is obtained. According to the result of comparison of the digitized functions, the cars can be appropriately dispatched. Therefore, it is possible to prevent an extremely long waiting time from occurring, and it is possible to reduce frustration of passengers. Also, passengers can wait in front of the arriving car, as the initial allocation is optimized for instantaneous allocation and in principle no reallocation.

Various modifications can be made without departing from the spirit and scope of the present invention.

[0040]

As described above, according to the present invention,
By selecting a parameter that reflects the waiting time, a function for reducing the waiting time is generated, and the car is dispatched according to the result of comparison of numerical values by this function, so the waiting time for long waiting hall calls is shortened. can do. In addition, as a result of the optimization of the first allocation, in principle, the reallocation is not performed, so that it is possible to secure the time for the passenger to go and wait in front of the car.

[Brief description of drawings]

FIG. 1 is a diagram of a conventional example showing a plurality of floors mapped to the position of a car in an elevator group and generated hall calls.

FIG. 2 is a diagram in which a plurality of floors are mapped to a position of a car B and a car call or hall call assigned to the car B.

FIG. 3 is a diagram mapping multiple floors to the locations of cars B and C, elevator calls associated with these elevators and hall calls associated with car B.

FIG. 4 is a diagram in which a plurality of floors are mapped to registered hall calls and positions of cars B and C.

FIG. 5 is a master flow chart for explaining the method of the present invention.

FIG. 6 is a flowchart of a hall call allocation algorithm.

FIG. 7 is a flowchart for determining an objective function.

FIG. 8 is a graph showing an objective function having one independent variable showing the existence of a minimum value for the objective function.

Continuation of front page (56) Reference JP-A-4-317966 (JP, A) JP-A-57-81069 (JP, A) JP-A-1-192682 (JP, A) JP-A-1-231780 (JP , A) (58) Fields surveyed (Int.Cl. ⁷ , DB name) B66B 1/18

Claims (2)

(57) [Claims] 1. In an elevator system having a plurality of elevator cars, a vehicle allocation management device for allocating these elevator cars to hall calls, and a plurality of hall calls, the elevator cars are assigned so as to respond to a new hall call. A vehicle allocation method, wherein a new hall call is registered, a value (RRT) of remaining response time when responding to the new hall call is estimated for each elevator car, and Estimate the predicted registration time value (PRT) when responding to a new hall call, estimate the longest predicted registration time value (maxPRT) when responding to all the already assigned hall calls, and Relative system response coefficient value (RSR)
And the value (OBJ) of the objective function is estimated based on the following equation (where A, B, C, and D are coefficients whose values can be changed, T ₁ is the first time threshold value, and T ₂ is Second time threshold, δ is maxPR
A coefficient that becomes 1 when T is larger than T ₂ and becomes 0 when T is ₂ or less), OBJ = A · RRT + B · | PRT−T ₁ | + δ · C ·
(MaxPRT−T ₂ ) ² + D · RSR In order to identify the elevator car having the smallest objective function value (OBJ), the objective function values (OBJ) of the respective elevator cars are compared, and the identified elevator car is obtained. A method of allocating an elevator, comprising: allocating a car to respond to the new hall call, and moving the allocated elevator car in response to the new hall call. 2. In an elevator system having a plurality of elevator cars, a vehicle allocation management device for allocating these elevator cars to hall calls, and a plurality of hall calls, the elevator cars are re-operated to respond to an existing hall call. A vehicle allocation method for allocating, wherein the vehicle allocation method estimates the remaining response time value (RRT) when responding to the existing hall call for each of the elevator cars, and responds to the existing hall call. The estimated registration time value (PRT) at that time is estimated, and the longest predicted registration time value (maxPRT) when responding to all the hall calls already assigned is estimated, and the value of the relative system response coefficient of the elevator system ( RSR)
And the value (OBJ) of the objective function is estimated based on the following equation (where A, B, C, and D are coefficients whose values can be changed, T ₁ is the first time threshold value, and T ₂ is Second time threshold, δ is maxPR
A coefficient that becomes 1 when T is larger than T ₂ and becomes 0 when T is ₂ or less), OBJ = A · RRT + B · | PRT−T ₁ | + δ · C ·
(MaxPRT−T ₂ ) ² + D · RSR In order to identify the elevator car having the smallest objective function value (OBJ), the objective function values (OBJ) of the respective elevator cars are compared, and the identified elevator car is obtained. A method of dispatching an elevator, comprising: allocating a car so as to respond to the existing hall call, and moving the allocated elevator car in response to the existing hall call.