JP4663755B2 - Elevator group management system - Google Patents

Description

  The present invention relates to a group management system that manages and manages the operation of a plurality of elevators, and is particularly suitable for group management in which a destination floor call is registered at a landing.

  Conventionally, in the destination floor registration type group management where the destination floor is registered at the entrance, hall entrance, hallway, etc., and the destination floor is called, the destination of the user goes from the lobby floor to a number of destination floors as at work. If the number of floors is large, the destination floors are sorted (assigned), and in order to increase the operating efficiency of each car, the call limit value assigned to each car is set, and the number of unanswered calls is less than the call number limit value Is known, and a new call is assigned from among them, which is described in Patent Document 1, for example.

  In addition, in order to grasp the exact number of waiting passengers and improve serviceability according to the passenger car's usage situation, the number of destination calls registered on the destination call registration button at the landing is counted, and this When the number exceeds a predetermined value, it is known to change the allocation of a car and perform additional allocation of another car, which is described in Patent Document 2, for example.

  Furthermore, in order to respond to changes in traffic flow more accurately in consideration of the hall call information specified for each destination floor, the traffic flow of the elevator is estimated, and each car is generated for each hall call for each car. It is known to calculate the probability of occurrence of a car call, obtain an expected value of arrival time at each floor, and assign a car to a newly generated hall call according to the obtained value, which is described in Patent Document 3.

Japanese Patent Laid-Open No. 2001-58764 JP-A-7-232867 JP-A-11-209010

  In the above prior art, setting the call number limit value assigned to each car, or changing the car assignment when the registered number of destination calls exceeds a predetermined value, will respond to changes in traffic volume. Because it is difficult to set the call limit value or the specified number of registered numbers to an appropriate value, changing the value changes the car to be allocated, so service performance can be greatly changed by changing one value. become.

  When going to work, etc., traffic changes drastically every few minutes, so an appropriate value must be set in a short time, but to that end, an appropriate value must be set in a shorter time. However, in practice, it takes time to search for the value, and it is difficult to respond more finely and maintain stable service performance (waiting time performance).

  In addition, calculating the probability of arrival of a car call to each floor from the landing call information specified for each destination floor and obtaining the expected value of arrival time only changes the expected value of arrival time of each car. When the number of destination floors of the user is large, the destination floors cannot be routed, but it corresponds to a drastic change in traffic volume, for example, a large fluctuation in a short time of several minutes such as work hours It is not possible.

  An object of the present invention is to solve the above-mentioned problems of the prior art and to increase the operation efficiency of each car in response to changes in traffic volume. Another object is to maintain stable service performance (waiting time performance) even when the traffic volume changes drastically, such as during work hours.

To achieve the above object, the present invention manages a plurality of elevators that service a plurality of floors, is provided at a landing, registers a destination floor call of a car, and the registered destinations In a group management system for elevators having a group management control device for assigning the elevators serviced from the plurality of elevators to the floor call ,
The group management control device includes a waiting time evaluation value calculating unit that calculates a waiting time evaluation value indicating a predicted waiting time when the elevator is assigned to the destination floor call, and an assigned evaluation value based on the waiting time evaluation value. An allocation evaluation value calculation unit for calculating the stop floor number calculation unit for determining the number of stop floors of the elevator, and the total sum of travel time between floors and the total stop time due to the destination floor call A threshold set as the number of floors to stop,
When the number of stop floors exceeds the threshold, the allocation evaluation value after adjustment is obtained by multiplying the allocation evaluation value or the waiting time evaluation value by an adjustment gain that is 1 or more and increases in accordance with the number of stop floors. An allocation evaluation value adjustment unit to be obtained; and an allocation car selection unit that allocates the destination floor call to an elevator having the minimum allocation evaluation value after the adjustment .

  According to the present invention, since the assignment of the elevator is suppressed according to the increase in the number of assigned destination floor calls, it is difficult to assign a call to an elevator having a large traffic volume and a large number of assigned destination floor calls. Allocation with priority given to waiting time is performed for elevators with small traffic volume. Therefore, it is possible to increase the operation efficiency of each car in response to changes in traffic volume.

  The elevator group management system provides a more efficient operation service to the user by handling a plurality of elevators as one group. Specifically, multiple cars are managed as a group, and an optimal car is selected for a newly registered landing call on a certain floor, and the previous landing call is assigned to that car. Perform the process.

  In general group management, calling up or down is registered at the platform, and the destination floor is registered after boarding the arrival car, whereas the destination floor registration type group management (Destination Control System) In the group management in which the destination floor is registered in FIG. 5, since the user's destination floor is known at the time of call registration, a suitable car can be assigned to each destination floor.

  When there are a large number of destination floors for users at the platform (for example, for the eighth floor), the number of stops per car can be reduced by allocating them to a plurality of cars. The lap time can be shortened, and the operation efficiency of each car can be increased. This is particularly effective in the case of traffic demand such as going to work from the lobby floor to many destination floors. The traffic volume represents the number of users arriving at the platform per predetermined time (for example, 5 minutes).

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 shows an example of the configuration of an elevator group management system, which is a destination floor registration type group management in which a destination floor is registered at a landing or the like, and a car is assigned according to the destination floor. Here, in order to simplify the description, an example of group management for two elevators is shown.

  The main components are two elevators 3A (No. A), 3B (No. B), each elevator control device 2A (No. A control device), 2B (No. B control device), two elevators It becomes the group management control device 1 that performs overall management. FIG. 1 shows the situation of the elevator landing on the first floor (other floors are omitted). On the first floor, there are destination floor registration devices 5A and 5B in which the user registers the destination floor with a numeric keypad and creates an elevator call. The elevator usage using the destination floor registration device is as follows.

  (1) A user on the first floor registers a destination floor with the destination floor registration device 5A or 5B. (2) The elevator system that services the destination floor is assigned to the registered destination floor by the group management control device 1. (3) As a result, the selected assigned number is displayed on the destination floor registration device. (4) The user sees it and waits for the elevator in front of the displayed unit.

  FIG. 2 shows details of the destination floor registration device. The user operates the numeric keypad E01 to input a destination floor and create a call. As a result, the assigned machine (E02) is immediately displayed on the display unit E03. In this case, Unit B is the assigned unit, and the user can go to the platform of Unit B and wait for the elevator to arrive. When Unit B arrives at the registered floor, the destination floor already entered is registered, and the user can go to the registered destination floor without operating any buttons in the car.

  In destination floor registration type group management, since an appropriate elevator is assigned to each registered destination floor, a plurality of elevators can be assigned according to the destination floor. For example, in the example of FIG. 1, the users are assigned in two groups: a user group 4A assigned to Unit A and a user group 4B assigned to Unit B. In the example of FIG. 1, only the destination floor registration device on the first floor is illustrated, but the form in which the destination floor registration device is installed on each floor including the first floor, the first floor is the destination floor registration device, the first floor Other than the above, there are two types of forms, that is, a form of a registration button in the vertical direction.

  Details of the group management control device 1 will be described below.

  In the data input / output unit 101, information on the control device of each elevator, information on the car of each elevator, and landing information on each elevator on each floor are input. On the other hand, control commands and output information from the group management control device are output to each elevator control device and each device at the landing.

  Based on information in the data input / output unit 101, the waiting time calculation unit 102 at the registration floor for each destination floor call of each car registers each call for the destination floor call assigned to each car. Then, the estimated waiting time until the assigned car arrives at the registered floor is calculated. The estimated waiting time is the estimated arrival time at the call registration floor of the assigned car (in this case, provisional assignment) if the call is newly registered, and if the call is already assigned, it is registered. It is expressed as the sum of the elapsed time from now to the estimated arrival time at the call registration floor of the assigned car.

  The destination floor call represents a call created by the destination floor registration device, and call data is represented by a set of the call registration floor io and the destination floor id. For example, a destination floor call in which the registered floor is the first floor and the destination floor is the fifth floor is (io, id) = (first floor, fifth floor).

The waiting time evaluation value calculation unit 103 calculates the waiting time evaluation value of each car from the waiting time for each destination floor call of each car. For example, in the method in which the maximum waiting time of the destination floor call of each car is used as the waiting time evaluation value, the waiting time evaluation value Φ _w (k) of the k-th car is expressed by the following equation.

Φ _w (k) = Max {w _{k, 1} , w _{k, 2} , W _{k, 3} ,...} (1)
Here, w _{k, 1} , w _{k, 2} , W _{k, 3} ,... Are the predicted waiting times of the destination floor calls assigned to the k-th car.

In addition, the sum, square sum, or square root of each destination floor call may be calculated as the waiting time evaluation value. In the case of the sum of squares, the waiting time evaluation value Φ _w (k) of the k-th unit is expressed by the following equation.

Φ _w (k) = Σ (w _{k, i} ) ² (2)
Here, w _{k, i} (i = 1, 2, 3...) Represents a predicted waiting time of each destination floor call assigned to the k-th car.

  The other evaluation value calculation unit 104 calculates an evaluation value other than the waiting time evaluation value, for example, an evaluation value related to the number of passengers in the car, an evaluation value related to the positional relationship of each car for avoiding car driving, and the like.

The allocation evaluation value calculation unit 105 calculates the allocation evaluation value Φ _T (k) by weighted addition of the waiting time evaluation value and other waiting time evaluation values. The allocation evaluation value Φ _T (k) is calculated by the following equation.

Φ _T (k) = Φ _w (k) + Σ {αj · Φ _j (k)} (3)
Here, Φ _w (k) represents the waiting time evaluation value after being adjusted by the waiting time evaluation value adjusting unit 103, α j is a weighting factor, and Φ _j (k) is another evaluation value other than the waiting time evaluation value. Represents.

  The call stop floor number calculation unit 106 assigned to each car calculates the total value of the stop floor numbers due to the destination floor call assigned to each car. There are two types of stop floors: the call registration floor is the stop floor, and the destination floor is the stop floor. However, since stoppages at the destination floor occupy most of the time when going to work, the stoppage at the destination floor may be a stop floor by calling the destination floor.

  For example, consider the case where Unit A is descending on the 4th floor and the following destination floor call is assigned: (io, id) = (1st floor, 5th floor), (1st floor, 8th floor) ), (1st floor, 12th floor), (5th floor, 12th floor), (6th floor, 8th floor). In this case, the stoppage at the registered floor and the destination floor will be the 1st floor, 5th floor, 6th floor, 8th floor, and 12th floor if the overlapping floors are not counted multiple times, and the total number of stopped floors will be 5th floor Become the floor.

  The allocation evaluation value adjustment unit 107 adjusts the size of the allocation evaluation value according to the number of call stop floors based on the number of call stop floors and the allocation evaluation value. That is, the allocation evaluation value is increased as the number of call stop floors increases. As a result, the larger the number of call stop floors due to the incoming call, the higher the apparent evaluation value, and thus it becomes difficult to assign a new call. As a result, if the traffic volume at work is large, the number of stop floors at each unit will increase and the waiting time will increase as one lap time increases, but the number of stop floors at each car will be suppressed. Thus, the allocation is executed, and it is possible to suppress an increase in the waiting time and suppress an increase in waiting time.

  The assigned car selection unit 108 finds the minimum value from the assigned evaluation values after the adjustment of each car, and sets the car corresponding to the evaluation value as the assigned car.

  Next, the flow of processing from new call registration to assignment number determination for the elevator group management system of FIG. 1 will be described with reference to the flowchart of FIG.

It is determined whether a new destination floor call (ion, idn) has been registered (ST01). If not, the process is repeated until it is determined to be registered. If it is determined to be registered, a loop process for calculating a comprehensive evaluation value Φ _T (k) for each elevator is executed (ST02). This loop process is executed for all the cars from the first car to the kmax car by changing the value of k.

  A destination floor call newly registered in the k-th car is temporarily allocated (ST03).

  The predicted arrival time of the k-th unit at the registration floor ion of the new destination floor call (ion, idn) is calculated (ST04).

  For each destination floor call already assigned to the k-th car, an estimated waiting time at the registration floor of each call is calculated (ST05).

The waiting time evaluation value Φ _w (k) is calculated from the predicted waiting time calculated above for the temporarily assigned destination floor call and the already assigned destination floor call of the k-th car (ST06). The waiting time evaluation value can be calculated by equation (1) or equation (2).

Other evaluation values Φj (k) (j = 1, 2, 3,...) other than the waiting time evaluation value for the k-th unit are calculated (ST07), and the waiting time evaluation value Φ _w (k) is weighted and added. The assigned evaluation value Φ _t (k) is calculated (ST08).

  The total number n (k) of call stop floors at the registration floor and the destination floor is calculated for the destination floor call temporarily assigned to the k-th car and the already assigned destination floor call (ST09). The floors where the registered floor and the destination floor overlap are calculated with only one stop.

  If the call stop floor total value n (k) of the k-th unit is calculated, the evaluation value adjustment gain ga (k) is calculated from this value using the evaluation value adjustment gain function F as shown in the following equation (ST10). ).

ga (k) = F {n (k)} (4)
The evaluation value adjustment gain function F is a function having a characteristic that when the number of stop floors exceeds a certain value as shown in FIG. 4, the gain value increases from a value of 1 together with the number of stop floors.

When the value of the adjustment gain is determined, the value is adjusted by multiplying the assigned evaluation value by the gain as shown in the following equation (ST11). Here, the allocated evaluation value after adjustment is Φ ′ _t (k).

Φ ′ _t (k) = ga (k) · Φ _t (k) (5)
Since the adjustment gain is determined by the number of stop floors, the result is the characteristics of the stop floor number and the assigned evaluation value as shown in FIG. This is expressed as the following equation from equations (4) and (5).
Φ ′ _t (k) = Φ _t (k) · F {n (k)} (6)
The evaluation value can be continuously adjusted according to the value of the number of call stop floors, and the influence of the stop floor number is “smooth (with continuity)” and “multiple effect” as an increase in apparent waiting time Can be reflected.

When the assigned evaluation value is adjusted for all units and the unit loop is completed (ST12), the unit having the smallest assigned evaluation value Φ ′ _t (k) after adjustment is selected, and this unit is The assigned number for the new destination floor call is determined (ST13).

  FIG. 4 shows the details of the adjustment gain function used in the adjustment of the assigned evaluation value, where the horizontal axis (A01) is the total number n of stop floors by the assigned call, and the vertical axis (A02) is the adjustment gain value ga. Represents.

  The gain is 1 until the stop floor number reaches a predetermined value nth (A03 part of the graph), and the value of the input assigned evaluation value is used as it is. When the predetermined value nth is exceeded (A04 portion of the graph), the adjustment gain increases in proportion to the number of stop floors (A05 portion of the graph). The above characteristics are expressed as follows.

ga = 1 (1 ≦ n <nth) (7)
ga = β (n−nth) +1 (nth ≦ n) (8)
Here, β represents a predetermined value (corresponding to the slope of the function).

  In an area where the stop floor number n is larger than the predetermined value nth, the adjustment gain increases as the stop floor number increases, and this gain is multiplied by the assigned evaluation value (equation (5)). The value (its subject is waiting time) increases. In fact, when the number of stopped floors increases as at the peak of work hours, the time for one round of each car increases, so it is difficult to return to the lobby floor, and the waiting time increases rapidly. The gain function shown in FIG. 4 reflects the effect of the increase in the number of stop floors on the waiting time. In a situation where the traffic volume is small and the number of stop floors is small, the influence of the stop floor number on the one-round time is small, so the influence of the stop floor number on the waiting time is small, and the gain is 1. When the number of stop floors exceeds a certain threshold, the influence on the one-round time is rapidly increased. Therefore, the influence of the number of stop floors on the actual waiting time is also strong, and this action is a gain characteristic that increases linearly.

  Here, it supplements about the relationship between 1 round time and a stop floor number. The one-round time RTT is expressed as the following equation.

RTT = Σ (moving time between floors) + Σ (stop time by calling) (9)
Therefore, if the number of stop floors is small, the influence of the second term is small, so the first term is determined mainly by the first term, and if the number of stop floors increases, the first term <the second term and one round Time is mainly determined by the number of stops.

  The threshold value nth of the adjustment gain function shown in FIG. 4 can be obtained from the relationship between the first term and the second term in equation (9), and the number of stop floors where the first term and the second term are equal. It is suitable as a candidate for the threshold nth. When the first term and the second term are approximated as shown in equations (10) and (11), nth becomes as shown in equation (12).

Σ (travel time between floors)
= (Total number of service floors x Floor pitch x 2) / Elevator rated speed (10)
Σ (stop time by call) = stop floor number × average stop time (11)
nth
= {(Number of all service floors x Floor pitch x 2) / Rated elevator speed} / Average stoppage time (12)
From the equation (12), the threshold value nth of the adjustment gain function is calculated from the number of service floors of the elevator, the floor pitch, the rated speed, and the average stop time. Since the estimated values of the floor pitch and the average stop time are 4 to 6 m and 5 to 10 seconds, respectively, if the service floor number and the rated speed are known, nth is determined to be an approximately appropriate value. The values of the service floor number, floor pitch, rated speed, and average stop time are determined if the building and elevator specifications are known. Therefore, the threshold value nth may be determined when the elevator is installed.

  nth does not need to be an integer, and may be a value with a fractional part obtained from Equation (12) (for example, nth = 4.6). Furthermore, the calculation formula of nth in equation (12) does not include the effect of the number of elevators. However, if there are many elevators, it is better to decrease nth and increase the distribution of the destination floor. If the number is too small, it is better to increase nth and collect calls in one car. Therefore, it is desirable to obtain nth by adding correction based on the number of elevators in addition to the formula for calculating nth in equation (12).

  As described above, the characteristic that the evaluation value adjustment gain increases as the number of call stop floors increases, more specifically, the gain remains constant until the number of call stop floors exceeds a predetermined threshold. By giving the value (= 1) a characteristic that increases with respect to the number of call stop floors when a threshold value is exceeded, priority is given to waiting time reduction according to the number of call stop floors.

  Call stop floor number has a strong correlation with traffic volume, so when traffic volume is low, priority is given to priority to shorten waiting time, and when traffic volume is high, priority is given to stop floor number control priority (= priority to suppress one lap time). It is automatically adjusted so that The function shown in FIG. 4 may be uniquely determined if the specifications of the elevator and the building are determined.

FIG. 5 shows the relationship between the number of stopped floors due to the allocation call and the allocation evaluation value after adjustment. The allocation evaluation value Φ ′ _t (k) after adjustment and the adjustment gain ga (k) have the relationship of equation (5), and the adjustment gain and the number of stop floors have the relationship as shown in FIG. Therefore, the relationship between the number of stopped floors and the adjusted allocation evaluation value is as shown in FIG. The assigned evaluation value is the same as the original value until the number of call stop floors exceeds a predetermined threshold (B01 part of the graph), and when the number exceeds the threshold (B02 part of the graph), the call stop floor The allocation evaluation value increases as the number increases (B03 part of the graph). The characteristics of FIG. 5 are expressed by equations as follows from equations (13) and (14).

Φ ′ _t (k) = Φ _w (k) (1 ≦ n <nth) (13)
Φ ′ _t (k) = {β (n−nth) +1} · Φ _t (k) (nth ≦ n) (14)
Due to this characteristic, in a situation where the traffic volume is small (a situation where the number of stopped floors is small), the evaluation is based on the allocated evaluation value before adjustment (evaluation based on the waiting time), and the traffic volume increases and the predetermined condition After exceeding (the situation where the number of stopped floors is large), an assignment is made such that a car with a larger number of stopped floors becomes difficult to assign a new call.

FIG. 6 shows an example of allocation in the case where the traffic volume is large when going to work. The example of FIG. 6 (a) is the group management of two units, Unit A and Unit B, and the state where Unit A (C05) arrives on the first floor earlier than Unit B (C06). Many people have already been assigned to Unit A (C09), and there are many stopped floors (n _A ). On the other hand, Unit B has not been assigned so many people (C10), and the number of stopped floors (n _B ) is also small. A case where a new user (C07) newly registers a destination floor in such a situation will be described.

The allocation evaluation value of Unit A is Φ _tA and the allocation evaluation value of Unit B is Φ _tB . In the following, for the sake of simplicity, the allocation evaluation value is only the waiting time evaluation value. From the figure, Unit A arrives on the first floor earlier, so Φ _tA <Φ _tB is satisfied. Moreover, the stop floor numbers of Unit A and Unit B are n _A and n _B , respectively, and satisfy n _A > n _B. Thus, from the relationship between the number of assigned call stop floors and the adjusted allocation evaluation value in FIG. 6B, the adjusted allocation evaluation value of Unit A corresponds to the point of C03 and becomes _Φ′tA . Moreover, the allocation evaluation value after adjustment of Unit B corresponds to the point of C04 and becomes _Φ′tB . The original assigned evaluation value was in the relationship of Φ _tA <Φ _tB , but the evaluation value was adjusted by the action of the number of stop floors to become Φ ′ _tA > Φ ′ _tB , and the relationship was reversed. As a result, Unit B is assigned to the destination floor call of a new user. This is because the waiting time of Unit A is shorter, but since the number of destination floor stops due to calls already held is larger, the adverse effect of longer one round time is factored into the evaluation value. That is, the allocation evaluation value based on the number of stopped floors is adjusted by the adjustment function C01 of the A machine and the adjustment function C02 of the B machine in FIG. 6B.

  When the traffic volume is large, due to the effect of the characteristic part that the evaluation value adjustment amount increases along with the number of stop floors in the adjustment function, the allocation evaluation value is adjusted so as to increase as the number of stop floors increases. It becomes difficult. As a result, new calls are easily assigned by units having a small number of stop floors, and destination floor calls are assigned to each unit so as to be distributed. As a result, the one-round time of each unit is shortened, and as a result, the waiting time can be shortened.

FIG. 7 shows an example of assignment when the traffic volume is small when going to work. In FIG. 7A, it is assumed that the car positions of the A machine (D05) and the B machine (D06) are in the same situation as in FIG. The difference is the number of waiting passengers at the landing, and the traffic volume is small, so there is one waiting passenger assigned only to Unit A (D09). Therefore, the stop floor number n _A of Unit _A is 2, and the stop floor number n _B of Unit _B is 0. A case where a new user (D07) newly registers a destination floor in such a situation will be described.

The allocation evaluation value of Unit A is Φ _tA and the allocation evaluation value of Unit B is Φ _tB . Since Unit A arrives on the first floor early, the relationship of Φ _tA <Φ _tB is satisfied. In addition, the number of stop floors of Unit A and Unit B is n _A = 2 + 1 = 3 and n _B = 0 + 2 = 2, respectively, because the number of stop floors is increased by temporarily assigning new calls. Thus, from the relationship between the number of assigned call stop floors in FIG. 7B and the assigned evaluation value after adjustment, since the number of stopped floors is small, the evaluation value does not change before and after adjustment, and Φ ′ _tA <Φ ′ _tB It becomes. As a result, Unit A is assigned to the new user's destination floor call. This is because the traffic volume is small, and it is determined that the overall serviceability is improved by additionally assigning a call to one car with priority on shortening the waiting time.

  When the traffic volume is small, due to the action of the characteristic portion where the evaluation value adjustment amount of the adjustment function is constant, a unit having a small allocation evaluation value is preferentially assigned regardless of the number of stopped floors. As a result, each user is assigned to an elevator that arrives earlier, and as a result, the increase in one round time is small, so that the overall serviceability (waiting time) can be improved.

  FIG. 8 shows an example of the effect of the elevator group management system shown in FIG. In the graph of the figure, the horizontal axis represents the traffic volume at work, and the vertical axis represents the average waiting time. The graph shows the characteristic of the average waiting time with respect to the traffic volume. In each of the three curves, the curve G01 represents the waiting time characteristic by the normal group management control of the up / down button type, the curve G02 represents the waiting time characteristic by the general destination floor registration type group management, and the curve G03 represents the implementation of the present invention. The latency characteristic according to the example is shown.

  In normal group management control of the up / down button type, when the traffic volume is small, the user waits for the shortest waiting time because more users are put on the car that arrives earliest. However, as the traffic increases, the number of stopped floors of each car increases and the time for one lap increases, so that unloading occurs and the waiting time deteriorates rapidly.

  In general destination floor registration type group management, even if the traffic volume increases, it is possible to control the allocation of units according to the destination floor, so it is possible to suppress the increase of one lap time, compared to the group management of up and down button type Can suppress the sudden increase in waiting time. However, the control assigned to a plurality of cars according to the destination floor may be assigned to a car with a long waiting time in an area where the traffic volume is small. Compared to the group management of the up / down button type as in the characteristic of the curve G02. The waiting time becomes longer. In particular, if all the cars depart from the lobby floor by being assigned to a plurality of cars, and a new user arrives immediately after that, the users will wait for a long time.

  Therefore, it is desirable to assign a user to one car with priority on shortening the waiting time when the traffic volume is small, and it is desirable to distribute the assigned machines according to the destination floor in order to shorten the lap time when the traffic volume is large. As described with reference to FIGS. 6 and 7, such control can be realized in the control shown in FIG. 1, and as a result, a waiting time characteristic as shown by a curve G03 in FIG. 8 can be obtained.

  Since the adjustment gain does not work when the traffic volume is small, priority is given to shortening the waiting time, and the waiting time can be shortened in the same manner as the up / down button group management. Since the adjustment gain increases according to the number of call stop floors when the traffic volume is large, the allocation is performed so that the destination floors are distributed to a plurality of cars so as to suppress the stop floor number. As a result, as in general destination floor registration type group management, one round time is suppressed, and a rapid increase in waiting time can be suppressed.

  In FIG. 8, the waiting time of the curve G03 is shortened even when the traffic volume is larger than the curve G02 indicating the characteristics of general destination floor registration formula group management. This is because general destination floor registration type group management is called and control is performed based on the service completion time from arrival to arrival at the destination floor. When evaluating by the service completion time, since the service completion time is the sum of the waiting time and the boarding time, both are evaluated equally, and the waiting time strongly influences the evaluation when the traffic volume is large. As a result, there are cases where distribution of destination floors does not work well, resulting in poor latency characteristics.

  FIG. 9 shows an allocation method using a technique in which a call number limit value is set, and a car satisfying the call number limit value or less is selected as an allocation candidate, and a car having the best allocation evaluation value is selected from the candidates. When represented on a graph with the assigned number of calls on the horizontal axis and the assigned evaluation value on the vertical axis, it is most evaluated from the cars in the area on the left side (the side with the smaller number of calls) from the dotted line H01 representing the call number limit value. Choose a basket with good value.

  If the state of Unit B is point H03 and the state of Unit A is point H02, Unit B on the left side of the dotted line H01 is selected as the assigned unit. The call number limit value is a parameter having a very strong influence on performance. For example, in the case of FIG. 9, if the call number limit value is slightly large, the point H02 is also an allocation candidate. Selected. As described above, since the allocation result varies greatly depending on the setting of the call number limit value, this value must always be selected in accordance with the change in traffic volume.

  As shown in FIG. 10, the actual traffic volume at the time of attendance varies greatly in units of several minutes. Moreover, this pattern varies from day to day. Accordingly, it is necessary to follow the change in units of several minutes and select an optimal value at that time, and a huge amount of calculation is required for the search, which is very difficult. In the method of adjusting the control parameters according to the traffic volume each time, when the traffic volume changes drastically, it is not possible to set appropriate parameters, and stable high performance cannot be obtained.

  FIG. 11 shows the assignment method shown in FIG. 1, and the number of assigned calls and the waiting time evaluation value before adjustment of the No. A and No. B machines are the same as those in FIG. 9 (the state of the No. A machine is the point K01). The state of Unit B is represented by point K02). In FIG. 1, the value of the allocation evaluation value changes according to the number of calls handled. Since the number of calls (nA) of Unit A is large, the evaluation value increases, and the evaluation value moves to point K03. On the other hand, since the number of calls in Unit B is small, the evaluation value remains the original value. In the example of FIG. 11, since the evaluation value of the machine A is small even after adjustment, a new call assignment is finally determined for the machine A.

  Compared to FIG. 9, since no candidate for the assigned number is determined by the threshold value, all the numbers can be evaluated as assignment targets, and more appropriate evaluation is possible. Moreover, it is not necessary to dynamically change a parameter having a strong influence on the performance, such as the call number limit value, according to the traffic volume. For this reason, since there is no fluctuation in performance due to parameters, it is possible to always obtain stable performance (waiting time performance) against changes in traffic volume.

  FIG. 12 shows another embodiment of the evaluation value adjustment gain function. In the graph in which the horizontal axis (A01) is the number of stop floors due to allocation calls and the vertical axis (A02) is the evaluation value adjustment gain, the evaluation value adjustment gain function of FIG. It has a polygonal line characteristic that increases the rate of increase of the adjustment gain with respect to the number of floors (the slope in the graph). The adjustment gain is 1 until the number of stop floors exceeds the first threshold value nth1 (A11) (characteristic of A10), and then the predetermined slope until the second threshold value nth2 (A13) is exceeded. The gain increases (the characteristic of A12), and when the second threshold value nth2 is exceeded, the slope further increases and the gain increases at a higher rate (the characteristic of A14).

  That is, the characteristic is such that the increase rate (the rate of increase) of the adjustment gain increases as the number of stop floors increases. As a result, the rate of increase in the evaluation value after adjustment (the rate of increase) increases as the number of stopped floors increases. By giving the adjustment gain a characteristic that the rate of increase increases with the number of stopped floors, the larger the number of call stopped floors, the stronger the assignment to suppress the increase in the number of stopped floors. it can.

  By giving the adjustment gain a characteristic that the rate of increase increases with the number of stop floors, the more the number of call stop floors, the stronger the assignment to suppress the increase of stop floors. It is possible to suppress the increase in the time for one round of each car more strongly when the traffic volume is large. In other words, it is possible to further finely improve the waiting time characteristic when the traffic volume is large in the waiting time characteristic shown in FIG.

  FIG. 13 shows still another embodiment of the evaluation value adjustment gain function. The evaluation value adjustment gain function in FIG. 13 also has a characteristic that the rate of increase (inclination in the graph) of the adjustment gain with respect to the stop floor number increases as the number of stop floors increases as in FIG. The evaluation value adjustment gain function shown in FIG. 13 is not a polygonal piecewise linear characteristic as shown in FIG. 12, but has a non-linear curvilinear feature that gradually increases. For example, a characteristic such as a quadratic function (parabola) or a cubic function such as the following equation is good.

ga = γ · (n−1) ² (15)
Here, γ is a predetermined constant. The characteristic of FIG. 13 is a characteristic that the increase rate (the rate of increase) of the adjustment gain suddenly increases as the number of stop floors increases more than the characteristic of FIG. As a result, the increase rate (the rate of increase) of the evaluation value after adjustment suddenly increases as the number of stopped floors increases. By giving such characteristics, the more the number of call stop floors, the stronger the attempt to suppress the increase in the number of stop floors. It can be prevented from changing.

  FIG. 14 shows an elevator group management system according to another embodiment, and each element of FIG. 14 is the same as FIG. The configuration of FIG. 14 differs from FIG. 1 in that the waiting time evaluation value, which is the most important element of the assigned evaluation value, is adjusted according to the number of stop floors. The output of the waiting time evaluation value calculation unit 103 in FIG. 14 and the output of the call stop floor number calculation unit 104 assigned to each car are input to the wait time evaluation value adjustment unit 105, and according to the number of stop floors. The waiting time evaluation value is corrected. The method for adjusting the waiting time evaluation value is the same as the method for adjusting the allocation evaluation value described above. Therefore, the influence of the number of call stop floors is more directly reflected in the waiting time, and a more appropriate evaluation is possible. Also, the shape of the evaluation value adjustment gain can be set more accurately because it can be specified by the relationship between the number of stop floors and the waiting time.

1 is a block diagram showing a system configuration according to an embodiment of the present invention. The top view which shows the destination floor registration apparatus of one Embodiment. The operation | movement flowchart of one Embodiment. The graph which shows the characteristic of the evaluation value adjustment gain by one Embodiment. The graph which shows the characteristic of allocation evaluation value adjustment by one Embodiment. Explanatory drawing of the evaluation value in case a traffic volume is large. Explanatory drawing of the evaluation value in case the traffic volume of one embodiment is small. The graph which shows the waiting time reduction effect by one Embodiment. Explanatory drawing which shows how to allocate by a prior art. The graph which shows the traffic volume transition at the time of work. Explanatory drawing which shows the allocation method by one Embodiment. The graph which shows the characteristic of waiting time adjustment gain by other embodiment. Furthermore, the graph which shows the characteristic of waiting time adjustment gain by other embodiment. The block diagram which shows the system configuration | structure by other embodiment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Group management control apparatus 2A Elevator control apparatus 3A Elevator 4A User group 5A Destination floor registration apparatus 101 Data input / output part 102 Wait time calculation part 103 Wait time evaluation value calculation part 104 Other evaluation value calculation part 105 Allocation evaluation value Calculation unit 106 Stop floor number calculation unit 107 Allocation evaluation value adjustment unit 108 Allocation car selection unit

Claims (5)

And controlling multiple elevator cars serving a plurality of floors, is provided at a landing, the destination floor registration device for registering a destination call floor of the car, the relative destination floor call is registered, the plurality of elevators A group management control device for allocating the elevator serviced from the elevator group management system,
The group management control device includes:
A waiting time evaluation value calculating unit for calculating a waiting time evaluation value indicating a predicted waiting time when the elevator is assigned to the destination floor call;
An allocation evaluation value calculation unit for calculating an allocation evaluation value based on the waiting time evaluation value;
A stop floor number calculating unit for determining the number of stop floors of the elevator;
A threshold value set as the number of stop floors that is equal to the sum of travel times between floors and the sum of stop times due to the destination floor call;
When the number of stop floors exceeds the threshold, the allocation evaluation value after adjustment is obtained by multiplying the allocation evaluation value or the waiting time evaluation value by an adjustment gain that is 1 or more and increases in accordance with the number of stop floors. An assigned evaluation value adjustment unit to be obtained;
An assigned car selection unit for assigning the destination floor call to an elevator having the smallest assigned evaluation value after adjustment;
Elevator group control system characterized by comprising a. The elevator group management system according to claim 1, wherein the threshold value is determined based on a service floor number and a rated speed . The elevator group management system according to claim 1, wherein the threshold value is not an integer but a value with a decimal point . 2. The elevator group management system according to claim 1, wherein the threshold value is decreased when the number of elevators is large, and is increased when the number of elevators is small . 2. The elevator group management according to claim 1, wherein the adjustment gain is 1 up to the threshold value, and increases in proportion to the number of stop floors when the threshold value is exceeded. system.

Images