JP4469897B2 - Elevator group management system and elevator group management control method - Google Patents

Description

  The present invention relates to an elevator group management system, and relates to assignment control for evaluating the most appropriate elevator for a newly generated hall call in consideration of serviceability to a future hall call that has not occurred at the present time. .

  The elevator group management system provides a more efficient operation service to the user by handling a plurality of elevator cars (hereinafter abbreviated as cars) as one group. Specifically, multiple elevator cars (usually 3 to 8) are managed as a group, and when a hall call occurs on a certain floor, select the optimal car from this group. And control to assign a hall call to the car.

  The current group management system is based on allocation control using an evaluation function based on the predicted waiting time. This is because when a new hall call is generated, the estimated waiting time of the hall call held by each car is calculated and the waiting time is minimized or the maximum waiting time is minimized, or Assign the hall call to the car with the lowest average waiting time. Here, the hall call that is being held refers to a newly assigned hall call and a hall call that has already been assigned. This allocation control based on the estimated waiting time is the basic method adopted in the group management control of each elevator manufacturer, but it is the optimal car allocation for the hall calls that have already occurred, and the influence of hall calls that will occur in the future. There is a problem that is not considered.

  Therefore, in order to solve the problem of the allocation system for the generated hall calls, various control systems have been proposed so far in which hall calls that are generated in the future are added to the evaluation target. The main ideas are: 1) control that tries to shorten the expected waiting time for a hall call floor that will occur in the future, and 2) try to arrange each elevator car at regular intervals in time. Can be arranged in control. The former is a method of virtually evaluating a floor where a call will occur in the future and directly evaluating it. The latter aims to be able to service a nearby car within the time interval at the maximum if a future call occurs within that interval if each car can be arranged at regular intervals in time. This indirectly controls the waiting time for future calls.

  Hereinafter, a conventional control method for the control in consideration of such a future call will be described.

1) Evaluation of waiting time for future calls based on estimated passenger incidence (Patent Document 1)
As a method of evaluating the waiting time due to a landing call that will occur in the future, control that estimates the optimal allocation car for a newly generated hall call by calculating the estimated incidence of passengers (waiting for landings) and the expected waiting time for that passenger Examples are disclosed. Here, it is described that the future call assignment is not known at the present time, but can be assumed to be the first car with probability p, and otherwise the next car.

2) A method for evaluating allocation based on the minimum estimated time distribution of arrival at each floor (Patent Document 2)
An example is disclosed in which the distribution status of service evaluation values that can be provided for each floor is obtained as a service distribution evaluation index, and the elevator is controlled based on the distribution status of service evaluation values. Here, it is described that the distribution status of each floor of the minimum predicted arrival time, which is the minimum value of the predicted arrival time of each car for a certain floor, is used as the service distribution evaluation index.

3) Assessment of risk floor allocation (Patent Document 3)
Assume that at least one risk floor with a high probability of long waiting is selected from the floors where no landing call has occurred, and a landing call has occurred on the risk floor. And the example which determines the elevator which should respond to a new hall call based on the allocation evaluation result at the time of allocating the elevator which should be serviced respectively to the newly generated hall call and the risk floor call is disclosed.

4) Time interval evaluation for predicted car position (Patent Document 4)
In selecting an elevator to which hall calls are allocated, a time interval between the elevators is predicted from a predicted arrangement of each elevator at a certain time, and a weighting coefficient of a call allocation evaluation function for each elevator is calculated based on the prediction calculation result. decide. Thereby, the example which calculates the evaluation function with respect to each elevator is disclosed.

5) Time interval evaluation for predicted car position (Patent Document 5)
Predict and calculate the car position and car direction after the elapse of a predetermined time from the current time, predict and calculate the time interval or spatial interval of each car after the predetermined time based on this, and evaluate the allocation limit based on the predicted car interval An example of calculating a value is disclosed.

JP 2006-298777 A Japanese Patent Laid-Open No. 10-245163 JP 2006-213445 A Japanese Patent Publication No. 7-12890 Japanese Patent Publication No. 7-72059

  For the prior art listed above, these future call evaluations assume that the elevator car with the shortest arrival time will service the expected future call. However, in actuality, a car to be serviced is determined by an allocation evaluation function for a generated hall call. There are evaluation items other than the waiting time evaluation for the hall call in the allocation evaluation function, and the elevator with the shortest arrival time is not always served. On the other hand, the number of hall calls that have already occurred is limited, but calls that may occur in the future can be considered infinitely, and calculating the evaluation function for each call is computationally intensive Is enormous and unrealistic. If the number of future calls assumed in order to reduce the amount of computation is reduced, there is a possibility that the evaluation of future calls will not be accurate due to the reduced number.

  In summary, since there are many calls to be evaluated in the future, the prior art simplifies that the elevator with the shortest arrival time is served. However, there is a contradiction with an actual allocation evaluation function, and this method may not be an accurate evaluation. In addition, when the number of future calls to be evaluated is narrowed and the evaluation is performed using the allocation evaluation function, it is basically necessary to predict the hall calls that are randomly generated, and there is a possibility that the evaluation will not be accurate.

  Hereinafter, the problems of the conventional techniques will be described in detail.

  In the method disclosed in Patent Document 1, the future call allocation car is assumed to be the first arrival car with probability p, and the next arrival carre, otherwise, it is actually determined by the allocation evaluation function, Since it is not determined probabilistically, it is difficult to determine the probability value. Therefore, as long as the probability value is not correct, the evaluation of future calls may not be accurate.

  In the method disclosed in Patent Document 2, the serviceability is evaluated by the minimum predicted arrival time of each car for the assumed floor of the future call, and the assigned car to the future call is assumed to be the minimum predicted arrival time. This is inconsistent with the actual allocation method by the allocation evaluation function, and the evaluation may not be accurate.

  In the method disclosed in Patent Document 3, the risk floor is selected, and the evaluation value of each unit is calculated for the risk floor. If there are many risk floors, the risk for each unit is calculated. An evaluation value must be obtained for each floor (including the direction of ascending or descending), and the amount of calculation becomes enormous. Here, since future calls may occur in each direction of each floor in a time range ahead of the current time, the number of objects that should be considered is enormous. Therefore, the number of risk calls needs to be considerably reduced, but in this case, an error becomes larger than a hall call that is actually generated later. In other words, it is difficult to select a risk call, and the evaluation may not be accurate.

  In the methods disclosed in Patent Document 4 and Patent Document 5, for a floor section that calculates a time interval between cars, a future call that occurs in that section is serviced by a car behind the section. Assumes. This is the same as assuming that the car with the smallest estimated arrival time is serviced, is not consistent with the actual allocation method, and the evaluation may not be accurate.

  In contrast to the problems of the prior art described above, the present invention reflects the situation at the future in the evaluation of hall calls that may occur in the future in the allocation evaluation function for newly registered hall calls. It aims at realizing more accurate evaluation by a simple method.

  In a preferred embodiment of the present invention, a plurality of elevators that service a plurality of floors and an elevator group management system that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index will be generated in the future. Potential hall calls are extracted as future call candidates, a plurality of elevators are sorted into assignable and unassignable elevators for future call candidates, and assignable elevators for future call candidates are selected as future call candidates. The assignment evaluation value for the future call is calculated, and the assignment evaluation index for the newly generated hall call is calculated by taking into account the assignment evaluation value for the future call. The elevator assigned to a newly generated hall call is determined.

  That is, it is characterized by selecting whether or not each elevator can be assigned at the time of future assignment, and selecting only the elevators that can be assigned, for the floor that may cause a future call.

  For each elevator, predict whether the hall call that has already been assigned is waiting for a long time or if the car is full, etc., and sort such elevators in advance to ensure that the elevator can be assigned. The serviceability to the future floor will be evaluated.

  Here, typical evaluation values assigned to future calls are an evaluation method based on a predicted waiting time and an evaluation method for determining whether or not intervals between a plurality of elevators are appropriate.

  According to a preferred embodiment of the present invention, it is possible to more accurately evaluate serviceability to future call floors.

  Further, according to a preferred embodiment of the present invention, the selection of allocatable elevators is simple, and the amount of computation can be suppressed even if many future calls are evaluated.

  Other objects and features of the present invention will be clarified in the embodiments described below.

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

  First, the features of the operation of the elevator group management system according to an embodiment of the present invention will be described with reference to FIG.

  FIG. 19A is a diagram showing the position state of the three cars in the ring expression in the three elevator group management systems. Ring expression is an expression that represents the movement of an elevator as a ring of one lap that reaches the top floor from the bottom floor by ascending operation (UP) and then returns to the bottom floor by descending operation (DN), and is managed as a group. It is possible to easily understand the positional relationship between the elevators.

  In FIG. 19A, the first car M01, the second car M02, and the third car M03 are respectively in the illustrated positions on the ring. Here, consider a case where a new hall call M04 in the downward direction is registered. The elevator that can service the new call M04 earliest is the No. 3 machine M03, but considering the serviceability to the hall call that may occur in the future, the assignment to the No. 3 machine is not always correct. Considering each car's mutual section as the section in charge of that car for future calls, the section in charge of Unit 3 is already long, and if Unit 3 is assigned to a new call, the call handled by Unit 3 will wait a long time there is a possibility. That is, if the section in charge M05 of the first unit, the section M06 in charge of the second unit M06, the section in charge M07 of the third unit, the section in charge of the third unit is already long. For this reason, when Unit 3 is assigned to a new call, the section in charge of Unit 3 becomes longer, unit 3 is delayed, and the section with Unit 1 is further extended. Accordingly, there is a possibility that a future call that occurs in this section, for example, the future call M08, will wait for a long time.

  Therefore, in the prior art, in consideration of the predicted waiting time for the new call and the degree of deviation of the time intervals of the three elevator cars, the second machine M02 is assigned to the new call in the example of FIG. Thereby, the serviceability to the future call M08 by the No. 3 machine M03 can be improved.

  However, this prior art is based on the premise that Unit 3 can service all floors of the section M07 in charge, and the actual situation is not necessarily so. One example is the situation shown in FIG. In FIG. 19B, there is a hall call M10 assigned to Unit 3 on the lowest floor, and since there are many passengers here, it is predicted that the car will be full in the hatched floor section M11. . The number of people boarding can be predicted from the number of registrations in the past learning of the usage status of the floor, waiting sensor at the landing (detection of the number of people with a camera, etc.), and group management that registers the destination floor at the landing. .

  As shown in FIG. 19B, when No. 3 is predicted to be crowded in the hatched section M11, No. 3 cannot be assigned to future calls that occur in this section. Accordingly, for future calls in this hatched section, for example, for the future call M08, No. 2 machine M02 becomes a candidate for assignment, and if No. 2 machine is assigned to the new call M04, serviceability to these future calls deteriorates.

  In the elevator group management system according to a preferred embodiment of the present invention, the section in charge of each unit is considered as shown in FIG. 19C for the situation shown in FIG. 19B. 19 (A) and 19 (C) differ from the fact that the No. 3 crowded section is taken into account, the section M31 in charge of the No. 2 newly increases, and the section in charge of the No. 3 has two sections M30. It is divided into M32. The serviceability for the future call is evaluated by the section in charge of each unit, and the car assigned to the new call M04 is determined together with the waiting time evaluation for the new call.

  In the case of FIG. 19 (C), if the car assigned to the new call M04 is No. 2, the future call of the section M31 in charge of No. 2 machine, for example, serviceability for M08 deteriorates. In particular, Unit 2 is far away from this section, so there is concern that these future calls will be waiting for a long time. On the other hand, if No. 3 is allocated, the serviceability to the future call M08 will not deteriorate. There is a possibility that serviceability will deteriorate for the future call of M3's assigned section M32, for example M40, but since Unit 3 does not service section M31, the arrival time to assigned section M32 is further reduced. Yes. Further, since the section M31 has a small number of floors, it does not deteriorate so much. In consideration of the above, in FIG. 19C, which is an example of the operation of the embodiment of the present invention, the assigned car for the new call is determined to be No. 3.

  In this way, in the evaluation of the assigned car to a new call that takes into account the future call, the future call is selected according to the car that can be assigned by selecting whether it can or cannot be assigned to the future call that each car assumes. It is a feature of one embodiment according to the present invention to evaluate the serviceability of the device. This makes it possible to evaluate serviceability for more appropriate future calls. For example, in FIG. 19B corresponding to the prior art, since the crowded congestion that occurs at the time point ahead of Unit 3 is not considered, Unit 2 is assigned to a new call, and the future that may occur in the hatched section M11 Serviceability for calling will deteriorate. In this case, Unit 2 will be in charge because Unit 3 is full. On the other hand, in FIG. 19 (C) corresponding to one embodiment according to the present invention, the assigned car for the future call is reset more appropriately in consideration of the forecast of the congestion of the No. 3 unit. Serviceability can be evaluated. As a result, in this example, the third car is determined as the assigned car.

  Hereinafter, an elevator group management system according to an embodiment of the present invention will be described in detail with reference to FIG.

  FIG. 1 is a control block diagram of the entire elevator group management system according to an embodiment of the present invention. The operation of the K elevator cars 22A to 22C is controlled by the elevator control devices 21A to 21C of each elevator, and the group management control unit 1 controls the control of each of the elevator control devices. In addition, hall call signals and destination floor signals input from hall call registration devices 3A and 3B and destination floor registration device 4 on each floor of the building are also transmitted to group management control unit 1. Here, the hall call registration devices 3A and 3B are devices used to call an elevator by using the up and down buttons that have been used conventionally, and the destination floor registration device 4 is a device that calls the elevator by inputting the destination floor using a numeric keypad at the landing. It is. After that, both calls will be unified with hall calls. The human flow sensors 5A to 5C are sensors for detecting the movement of a person installed on each floor. For example, entrance / exit information, information on leaving a desk, human detection information using infrared rays, human flow information by camera image recognition processing, etc. Is an example. Information on the movement of people in each floor and each area detected by these sensors is also transmitted to the group management control unit 1. Each elevator car 21A-21C has destination floor registration devices 23A-23C in the car and load sensors 24A-24C in the car. In addition, information on the destination floor, load status in the car (corresponding to the number of passengers) and load change information (corresponding to the number of passengers) are detected, and these information is also sent to the group management control unit via each unit control device. 1 is transmitted. In addition, the machine control device transmits information on the operation state such as the position, direction, and speed of each elevator to the group management control unit 1.

  Hereinafter, the group management control unit 1 will be described. The basic operation of the group management control unit 1 is to evaluate each of the K elevator cars using the assigned evaluation function for the newly generated hall call under the obtained lot of information, and determine the most appropriate car. The flow is to select and assign a hall call to the car. The information includes information on each detected elevator car, information on each floor hall, information on human movement between floors such as building traffic flow, and information statistically estimated from these past information.

  First, in the data storage unit 100, each data such as each elevator state, elevator hall state of each floor, building traffic flow / traffic state, movement state of people on each floor, etc. collected from the unit control device or hall call registration device is stored. Accumulate in a storage device such as a memory. The estimated arrival time table calculation unit 101 calculates the estimated arrival time for each floor and direction (for example, ascending direction of the third floor) of each elevator. Based on the data of the predicted arrival time table of each unit, the predicted waiting time calculation unit 102 for the already allocated call calculates the predicted waiting time for each hall call that has been allocated (but not yet responded) to each unit. The estimated waiting time can be calculated by the sum of the elapsed time from the time of call occurrence or passenger arrival and the estimated arrival time. The predicted intra-car congestion degree calculation unit 103 calculates the degree of congestion in the car when it arrives or departs from each position and direction from the current position and direction to each unit. Here, the degree of congestion of each car for each floor and direction is the prediction of the number of passengers getting on and off in the process of sequentially providing hall calls and car calls that each car already has to the current number of passengers in the car. Calculated considering the value. The call stop frequency calculation unit 104 of each unit calculates the number of stoppages due to a received call in each floor and direction in the process in which each unit sequentially services a received call from the current position and direction. Here, the number of stops due to incoming calls means the total number of stops due to assigned hall calls held at that time, the number of stops due to car calls, and in the case of a destination floor registration device, the number of stops due to destination floor calls. Yes.

  Based on the estimated waiting time for the already allocated calls calculated above, the predicted congestion in the car for each floor and direction of each unit, the number of calls stopped for each unit and the estimated arrival time table for each unit, the allocation invalid area for each unit is allocated invalid Calculated by the area calculation unit 105. Allocation invalid area refers to the time axis (representing the time before the present time) and the two-dimensional coordinates taken on the floor position axis, even if a hall call occurs on that floor for that time, the unit is assigned Represents an area where is impossible. For example, if it is predicted that Unit 3 cannot be allocated to the 2nd to 8th floor ascending hall calls since it has been waiting for 35 seconds after the current time, The area in the 2nd to 8th floor ascending direction becomes the allocation invalid area in the time until the second. Actually, the shape is like a region B07 indicated by a thick line in FIG. This allocation invalid area is created as a criterion for easily selecting the next allocation valid machine (assignable machine). A specific method for calculating the allocation invalid area will be described later.

  When the allocation invalid area is calculated for each unit, the group management control unit 1 selects a future call candidate floor selection unit 106 that may generate a future call (hereinafter, future call candidate floor). Then, the assigned effective number selecting unit 107 selects the number of units that can be allocated to the future call candidate floor. Here, the future call candidate floor is represented by time (current time and future time), floor and direction (described in detail later with reference to FIG. 2). For example, assuming a future call in the upward direction on the third floor that occurs 20 seconds later, the third floor (in the upward direction) 20 seconds later becomes the future call candidate floor. The selection of the assigned valid unit is determined based on whether the floor and time are included in the allocation invalid area of each unit for the future call candidate floor. In the previous example, if the allocation invalid area of the second unit includes the third floor and the upward direction in 20 seconds, it is determined that the second unit is excluded from the allocated effective unit for the future call candidate floor. The allocation effective number represents a number of units that can be determined to be surely allocated at the present time even if a hall call is generated on that floor for that future call candidate floor. More accurate evaluation becomes possible by screening only such units for each future call candidate floor and evaluating the serviceability. For example, in the conventional method, it was assumed that the unit with the shortest estimated arrival time served the call in the future, but if the unit was in charge of a long waiting call etc. On the contrary, there was a possibility of worsening the service to the call in the future. On the other hand, in the present embodiment, since such units are screened (selected) by the allocation invalid area calculation process and the allocation valid unit selection process, only the car that can be allocated accurately is selected and the appropriate evaluation value is selected. Can be calculated.

  In the future call waiting time evaluation value calculation unit 108, for each of the selected future call candidate floors, the predicted waiting time for the call is calculated from the assigned effective unit for the floor, and the future call waiting time evaluation value for each floor is calculated. calculate. Next, the evaluation values for the entire future candidate floors are calculated by combining the evaluation values of each floor. This value will be the future call waiting time evaluation value. For example, for a certain future call candidate floor, the minimum value of the predicted waiting time by each assigned effective unit may be used as the future call waiting time evaluation value of that floor, or the weighted average value up to the top two in order of decreasing waiting time It is also good. With such an evaluation value, it is possible to evaluate the waiting time service index performed by each assigned effective machine for the entire future call candidate floor.

  The allocation evaluation value calculation unit 109 for the already allocated call and the new allocated call calculates the estimated waiting time for each already allocated hall call and new hall call (hereinafter collectively referred to as the actual call). An allocation evaluation value for an actual call that is a combination of is calculated. This allocation evaluation value may be calculated from the maximum value, average value, square average value, etc. of the estimated waiting time of the actual call of each unit.

  The total evaluation value calculation unit 110 calculates a total evaluation value obtained by weighting and adding the future call evaluation value 108 and the actual call evaluation value 109, and the assigned car selection unit 111 uses the elevator car having the best total evaluation value. An assigned car is selected.

Here, a hall call (hereinafter referred to as a future call) that may occur in the future will be specifically described with reference to FIG. In FIG. 2, the horizontal axis A <b> 2 is a time axis representing the time after the present time with the current time (t <b> 0) as the origin, and the vertical axis A <b> 1 is an axis representing the floor position. Future calls will be distributed within a two-dimensional area represented by the time and floor position after this point. Thus, due to the freedom of time, floor and direction, there are a huge number of future calls to consider. For example, in FIG. 2, since there are nine time intervals from t1 to t9 (one time interval is about 10 seconds wide) on the 6th floor, (6-1) × 2 × 9 = 90 futures You need to think about the call. Most of the buildings where elevator group management is introduced are buildings with 10 floors or more, and there are cases where it is better to consider the time range of 2 minutes or more, and the number of future calls to be considered is very large. Become.
In the following cases, the generation floor and time of future calls can be narrowed down to the corresponding future call areas. The traffic flow is concentrated on a certain floor (future call area A5 in FIG. 2), and the future call that occurs after a predetermined time is considered as a representative (future call area A4 in FIG. 2). It can be detected whether a user is generated (future call area A6 in FIG. 2) or the like. In addition, the symbol shown with the triangle of each future call area | region of FIG. 2 represents the future call including a direction.

  Even if the possible area for future calls can be narrowed down, it is still necessary to consider a plurality of future calls, and the amount of calculation in the allocation evaluation increases. In the allocation evaluation, it is necessary to calculate a future call evaluation value when each elevator car is temporarily allocated to a new call, and it is necessary to further repeat the number of elevators.

  Although it is important to evaluate the serviceability of future calls when assigning new hall calls, the number of future calls that should be considered is large as shown in Fig. 2, and it is necessary to evaluate the impact of each unit. The calculation amount increases. For this reason, in the conventional future call evaluation, in order to simplify the calculation, it is assumed that the machine with the shortest estimated arrival time (the machine that arrives earliest in time) will serve the call. I was evaluating.

  However, when these future calls actually occur, the number of machines that serve the call is determined by the allocation evaluation function. For this reason, the serviceability evaluation value obtained by the above-described future call evaluation may not be consistent, and conversely, since the evaluation error is large, the serviceability to the future call may be deteriorated. On the other hand, determining the assigned machine for the future call with an evaluation function also requires a huge amount of computation, making it difficult to process in real time. For example, if the number of elevators is 8 and the number of future calls to be considered is 10, the number of temporary assignments of new calls (8) × the number of future calls to be considered (10) × the number of temporary assignments to one future call ( 8) It is necessary to calculate an allocation evaluation value of 640, and the amount of calculation becomes very large.

  The present invention seeks to solve such a problem for future call evaluation. That is, it is a solution to the trade-off relationship between an increase in the amount of computation based on the number of calls in the future and a more accurate and accurate evaluation method, and the allocation invalid area calculation unit 105 of each unit of the embodiment shown in FIG. The allocation effective number machine selection unit 107 for the future call candidate floor is the point of solution. Through these processes, the number of units that can be reliably assigned to each future call is screened, and the serviceability such as the waiting time for the call is evaluated by the remaining units. Here, in the selection of assignable units, using the data such as the long waiting call among the already assigned calls, the degree of congestion in the car of each unit, the number of calls stopped for each unit, etc. To determine whether it can be assigned to a future call that may occur on that floor. Thus, at that time, it is important to first select the units that are predicted to be assignable to the call and the units that are predicted to be impossible. Conventionally, serviceability to the future call was evaluated by the unit with the shortest estimated arrival time among all units including those that could not be allocated due to long wait or full, etc. It was not serviced by the Unit No., but it had resulted in long waits. In the present embodiment, this can be avoided by sieving the allocatable machine.

  Note that the concept of sieving processing of assignable units for future calls described in FIG. 1 can be applied to any future call. For example, a future call set (future call area A4) that may occur on each floor after a predetermined time shown in FIG. 2, a case where a future call is likely to occur on a certain floor (future call area A5), and a human flow sensor after a predetermined time This is a case (future call area A6) where it can be detected that a call is likely to occur on a certain floor. These future call candidate floors are set by the future call candidate floor selection unit 106 shown in FIG.

  FIG. 3 is a flowchart for calculating a future call waiting time evaluation value in the elevator group management system according to the embodiment of the present invention. Hereinafter, the flow of processing will be described.

  First, a future call candidate floor (represented by three elements of time, floor, and direction) to be evaluated is set (ST501). Next, the variable K representing the machine name is set to an initial value K = 1 (ST502). Next, it is determined whether or not the future call candidate floor to be evaluated belongs to the K-unit allocation invalid area (ST503). If not (when the floor does not belong to the K-unit allocation invalid area), It adds to the allocatable elevator of the future call candidate floor which targets the K machine (ST504). The above processing is repeated until all units are implemented (ST505, ST506). In this way, assignable numbers can be selected by screening (selecting) numbers that do not belong to the allocation invalid area. When all the assignable elevators have been screened, the future call evaluation value for that floor is calculated based on the estimated arrival time of each assignable elevator for the next candidate future call candidate floor. As described above, the minimum value of the predicted waiting time by each assigned effective unit may be used as the future call waiting time evaluation value of the floor, or as the weighted average value of the top two in the order of short waiting time. good. The processing is repeated for each floor until the above processing is completed for all future call candidate floors to be evaluated (ST508, ST509). A comprehensive future call evaluation value is calculated based on the respective future call evaluation values for all future call candidate floors that are targeted (ST510). This may be calculated by, for example, an average value or a weighted average value of evaluation values of each future call candidate floor.

  A feature of the embodiment of the present invention shown in FIG. 1 and FIG. 3 is that an elevator that can be assigned to a future call candidate floor is selected by a screening process, and this assignable elevator can be easily selected. In addition, the allocation invalid area is calculated in advance. Hereinafter, a specific method for calculating the allocation invalid area will be described with reference to FIGS.

  First, referring to FIGS. 4 and 5, a method of calculating an allocation invalid area for a hall call that has already been allocated and is waiting for a long time will be described. FIG. 4 shows the flowchart, which will be described below in order. First, the target machine is set (ST001). Next, the predicted waiting time for the already assigned hall call of the target car (however, the call that has not been answered) is calculated (ST002). Then, it is checked whether or not long waiting is predicted from the predicted waiting time of each call (ST003). For example, when the predicted waiting time exceeds 60 seconds, it is determined that the waiting time is long. If there is a long wait, the predicted arrival time for each floor and direction from the current position of the target unit to the arrival at the long wait call floor is calculated (ST004). The long waiting call as an area (area expressed by the two-dimensional coordinates of the floor position and time) surrounded by each floor from the current position of the target unit to the long waiting call floor and the estimated arrival time for each floor The allocation invalid area is determined by (ST005).

  FIG. 5 shows a calculation example of the allocation invalid area by the long waiting call. FIG. 5A shows the car position of the target car K and the generation floor of the assigned hall call (unanswered). The assigned hall call is a call in the fifth floor / upward direction (B01), and is waiting for a long time (predictive waiting time is 60 seconds or more, for example). Unit K is currently on the second floor in the down direction. At this time, the predicted arrival time table for each floor and direction of the K-unit is as shown in FIG. For example, it is t5 hours after the present time that the K machine arrives on the second floor / upward direction. The reason why the estimated arrival time from the first floor / upward direction to the second floor / upward direction is longer from t1 to tt5 is because the stop probability in the first floor / upward direction is large and the expected stop time value is large. As a supplement, the estimated arrival time is calculated by adding the movement time between the floors and the expected stop time value at each floor.

  FIG. 5C illustrates an example of the allocation invalid area obtained according to the flowchart of FIG. 4 based on these situations. The thick line area B07 on the two-dimensional coordinate plane (B06) of the time axis B04 and the floor position axis B05 in FIG. 5C is an allocation invalid area for the example of FIG. As described above, the allocation invalid area is characterized by being expressed by time (a time before the present time) and a floor position. If Unit K services a hall call that occurs in this area, it will further increase the long waiting time of the already allocated call in the 5th floor / upward direction, so even if the call actually occurs, the allocation evaluation function The value is bad, and it is highly possible that Unit K will not be assigned. Therefore, by calculating such an invalid area and removing the elevator car with invalid allocation based on this (by screening only the cars with valid allocation), it is possible to evaluate serviceability more accurately for the future call. Become. In addition, by calculating the allocation invalid area for each unit in advance, it is possible to easily determine whether each floor belongs to the allocation invalid area for each unit for each future call candidate floor to be evaluated. Units can be calculated. The calculation of the allocation invalid area itself can also be obtained by a simple process as shown in the flowchart of FIG.

  6 and 7 show calculation examples of the allocation invalid area due to the excess of the predicted congestion level (full prediction). FIG. 6 shows a flowchart for calculating an allocation invalid area due to an excess of the predicted congestion level. The procedure will be described below. First, the target car is set (ST101), and the predicted in-car congestion level for each floor and direction for one turn is calculated for the target car (ST102). In this calculation process, the number of passengers and the number of passengers getting off are predicted in the course of servicing the hall call and car call that the target unit already has, and the degree of congestion in the car is calculated. The number of passengers can be estimated based on the waiting number in the hall, the learning data of the number of passengers on that floor in the past, and the destination floor registration number in the case of destination floor registration in the hall. The number of passengers can also be estimated from the number of passengers in the car, the car calling floor registered at that time, learning data on the number of passengers getting off in the past, and the number of registrations for each destination floor in the case of destination floor registration in the hall. The degree of congestion in the car is defined as a value obtained by dividing the load in the car by the rated load capacity or the value obtained by dividing the number of passengers in the car by the capacity in the car. Further, instead of the degree of congestion in the car, a car load or the number of passengers in the car may be used. Once the predicted in-car congestion level for each floor / direction is calculated for one lap, it is next checked whether there is a full situation (for example, predicted in-car congestion level ≧ 80%) for each floor / direction. (ST103). When full prediction occurs, the arrival prediction time of each floor / direction from the current position to the floor where the above full state is eliminated is calculated for the target unit (ST104). Then, for each target unit, the degree of congestion as an area (area represented by two-dimensional coordinates of the floor position and time) surrounded by each floor from the current position to the floor where the fullness is released and the estimated arrival time for each floor An allocation invalid area due to excess is determined (ST105).

  FIG. 7 shows a calculation example of the allocation invalid area due to the predicted congestion degree excess (full prediction). FIG. 7A shows the car position, the assigned hall call floor and the car call floor of the target car K. The assigned hall call is a call on the 5th floor / downward direction (C02), and it is predicted that the car will become full after serving this call. The car call is on the second floor and descending direction (C03), and there is an exit on this floor, so it is predicted that the crowded situation will be resolved. Unit K is currently located on the 6th floor in the downward direction. At this time, the predicted degree of congestion in the car for each floor and direction of Unit K is as shown in FIG. 7B (the unit of numerical values in the figure is%). The congestion level in the 6th floor and down direction, which is the current position, is 50%. After serving the hall call on the 5th floor and down direction, more passengers board, so the congestion level will be 80% (C04). . The situation continues until it arrives in the second floor / downward direction, and passengers get off by calling the car on the second floor / downward direction, so the congestion level is reduced to 30%. Furthermore, on the first floor, everyone is expected to get down to 0%.

FIG. 7C illustrates an example of the allocation invalid area obtained according to the flowchart of FIG. 6 for such a situation. The thick line area C07 on the two-dimensional coordinate plane (C06) of the time axis and the floor position axis in FIG. 7C is the allocation invalid area. For example, future hall calls that may occur in the upward direction from the third floor to the fifth floor during the time period from t0 to t1 cannot be assigned by the Unit K, and the upward direction from the third floor to the fourth floor from the time t1 to t5. This indicates that future hall calls that may be generated at No. K cannot be assigned at Unit K. In such an allocation invalid area, even if a hall call is actually generated in that area, there is a high possibility that Unit K will not become an allocated number because it is full. Therefore, by calculating such invalid areas by predicting the time transition with respect to the degree of car congestion of each elevator car, and removing the elevator cars with invalid allocation based on this (by screening only those cars with valid allocation) This makes it possible to evaluate serviceability more accurately for the future call.
8 and 9 show calculation examples of the allocation invalid area due to exceeding the number of call suspensions. This processing is particularly applied in destination floor registration type group management for registering a destination floor in a hall. In the destination floor registration formula group management, in order to register the destination floor in the hall, it stops for getting on at any floor (as can be seen from the registration floor of the destination floor call) at the time of allocation, and stops for getting off at which floor ( You can see from the destination floor of the destination floor call). The sum of both is the number of stops for the destination floor call. In the destination floor registration type group management, control is performed to distribute the elevators assigned by the destination floor even for calls that occur on the same floor. At this time, control is performed so that no more new calls are assigned to the car whose destination floor exceeds the predetermined value, and the number of stoppages of each elevator is reduced (resulting in reduction of one lap time). In the allocation invalid area in FIG. 5, an area that cannot be allocated is extracted because the number of times of stoppage is exceeded.

  FIG. 8 shows a flowchart for calculating the allocation invalid area due to the excessive number of stops, and the procedure will be described below. First, a target car is set (ST201), and the number of stops of incoming calls (destination floor call) on that floor for each floor and direction for one lap is calculated for the target car (ST202). It is checked whether or not the threshold is exceeded (for example, if the number of stoppages of the received call> 4 times) with respect to the number of stoppages of the received call in each floor / direction (ST203). If the threshold is exceeded, the predicted arrival time for each floor and direction from the current position to the floor where the above threshold is eliminated is calculated for the target unit (ST204). Assigned to the target unit as an area (area represented by the two-dimensional coordinates of the floor position and time) surrounded by each floor from the current position to the floor where the threshold excess is eliminated and the estimated arrival time for each floor An invalid area is determined (ST205).

  FIG. 9 shows an example of calculating the allocation invalid area due to the excessive number of stops. FIG. 9A shows the car position of the target car K, the registered floor of the assigned destination floor call, and the destination floor. The registered floor of the assigned destination floor call is the first floor / upward call, and the destination floors are the third floor, the fourth floor, and the sixth floor. Unit K is currently on the 4th floor and down. At this time, the allocation invalid area for each floor and direction of the No. K machine is as shown in FIG. 9B. In the fourth floor / downward direction, which is the current position, the total number of stops (predicted value) by the destination floor call in the first floor / upward direction is four times. When the call arrives on the 1st floor, the number of call stops is reduced by 1, so the remaining number of stops is 3. Furthermore, since the number of call stops decreases by one each at the time of arrival at the third and fourth floors, the remaining number of stops is two and one, respectively. And when it arrives at the 6th floor of the final destination floor known at the present time, the remaining number of stops on the subsequent floors is zero.

  FIG. 9C illustrates an example of the allocation invalid area obtained according to the flowchart of FIG. 8 for such a situation. The two thick line areas D03 and D04 on the two-dimensional coordinate plane (D02) of the time axis and floor position axis in FIG. 9C are assigned invalid areas. Even if a hall call actually occurs in this area, the number of stoppages due to the destination floor call that the K machine has over has exceeded the possibility that it will not be an assigned car. Therefore, by calculating such invalid areas by predicting the time transition with respect to the number of calls stopped on each elevator car, and removing the elevator car with invalid allocation based on this (by screening only the cars with valid allocation) It is possible to evaluate serviceability more accurately for the future call.

  As described above, the method for creating the allocation invalid area by the three types of waiting for the allocated hall call, exceeding the predicted congestion in the car, and exceeding the number of call stoppages has been described. However, there are cases where these factors cannot be assigned in combination, and there are cases where these factors occur in combination. An allocation invalid area is created for each of the above three types, and an area in which these are overlaid (OR operation area) is allocated as an allocation invalid area It is good. In this case, since a plurality of unassignable factors can be taken into account, it can be expected that the evaluation accuracy for future calls will be more accurate. Of course, each may be independent, or two types of superposition may be used.

  FIG. 10 shows an example of calculating the future call waiting time evaluation value using the allocation invalid area based on the embodiment described in FIGS. 1 and 3. Here, a description will be given taking the management of three elevator groups as an example. FIG. 10A shows the state of the three car positions at the current time (displayed in a ring expression (described later with reference to FIG. 18)). In this figure, the vertical direction represents the floor position, and the horizontal direction represents the position of each car divided into ascending and descending. The number in the square representing the car represents the elevator name.

  FIG. 10 (B) is a diagram showing the predicted waiting time for each future call candidate floor in the situation of FIG. 10 (A). Here, the set of future call candidate floors to be evaluated is a set of all floors and directions after a predetermined time (corresponding to the area A4 in FIG. 2). In FIG. 10B, the horizontal axis represents time, the vertical axis represents the floor position, and the origin of the time axis represents the current time (current time). The positions of Unit 1 (H01), Unit 2 (H02), and Unit 3 (H03) are as shown in the figure, and correspond to the position state of FIG. 10 (A). For this situation, the future call waiting time evaluation value is obtained with all floors and directions at time tf (line H06) as future call candidate floors. Here, an example will be described in which a predicted waiting time for a future call illustrated by a triangle symbol (for example, one of which is a triangle H07) on the time tf is obtained. First, a predicted arrival time table for each unit (a table of predicted arrival times for each floor and direction) is calculated. When the arrival time data in each floor and direction of this arrival prediction time table is represented on the coordinates of FIG. 10B, for example, in the case of Unit 1 (H01), a predicted locus represented by a broken line H04 can be drawn. . Similarly, in the case of Unit 2 (H02), the predicted trajectory is represented by a broken line H05. These predicted trajectories correspond to traces of the position (predicted position) where each car is located at each time.

  Next, an allocation invalid area is calculated for each unit.

  FIG. 11 shows the allocation invalid area of Unit 2 in this example. The allocation invalid area of Unit 2 is an area J01 surrounded by a thick line on the two-dimensional coordinates of the time-floor position. This is, for example, calculated from a hall call that has been assigned and held for a long time by Unit 2.

  As a result of reflecting the allocation invalid area of Unit 2 shown in FIG. 11, the predicted waiting time for the future call candidate floor shown by the triangle in FIG. 11B is as shown by the arrow line in the figure. For example, the predicted waiting time (predicted arrival time of the service car) for the future call candidate floor (H07) is represented by the length of the arrow line (H08). For each future call candidate floor, the prediction waiting time is determined based on the predicted arrival time of the earliest car that arrives earliest. However, since the allocation invalid area is reflected, there are some future call candidate floors that do not. In the four future call candidate floors denoted by reference numeral H10, the earliest car that arrives for this call is No. 2, but these calls are in the No. 2 allocation invalid area. For this reason (the allocation invalid area of No. 2 is the area surrounded by the dotted line H09 and the predicted trajectory line H05 from the current position (H02) of No. 2), the car that arrives earliest among allocatable cars is No. 1. Therefore, the predicted waiting time is determined by the first unit.

  FIGS. 12A and 12B are diagrams respectively comparing the predicted waiting time for the future call candidate floor according to the prior art and the embodiment of the present invention. The point of interest is the predicted waiting time of the future call candidate floor set to which the symbol H10 is attached. In the example of the prior art in FIG. 12A, the predicted waiting time is determined simply by the second machine that can arrive at the calling floor earliest. On the other hand, in the embodiment of the present invention shown in FIG. 12 (B), the assignable cars are screened and the waiting time is determined by the selected assignable cars. In the future call candidate floor, the expected waiting time is set by Unit 1.

  As a result, when the future call candidate floors to which the reference sign H10 is attached are compared, in the case of the prior art, the prediction waiting time for these future call candidate floors is estimated to be shorter as indicated by the arrow H12 in FIG. . On the other hand, in the case of the embodiment of the present invention, the predicted waiting time can be estimated more accurately by the first car that is an elevator that can actually be assigned as indicated by an arrow H11 in FIG. For example, in the evaluation of the prior art, it is evaluated that the prediction waiting time for the future call candidate floor is short, but when the future call is actually generated at the location to which the code H10 is attached, the second machine is not allocated. There is a risk that a long wait may occur for the call. On the other hand, in the embodiment of the present invention, since it is possible to correctly evaluate the long wait of this call floor, a new call assignment unit is selected to avoid such a situation, and the possibility of long wait occurrence is reduced. It becomes possible to do.

  FIG. 13 is a control block diagram of the entire elevator group management system according to another embodiment of the present invention. FIG. 13 shows a case where the evaluation for the future call is applied to a method for evaluating by a time interval between the cars. This is because, as is well known, it is desirable to bring a plurality of elevators close to an equally spaced state in order to suppress the occurrence of long waiting.

  The same components as those in FIG. 1 are denoted by the same reference numerals with respect to the components in FIG. 13 differs from FIG. 1 in a service-related elevator selection unit 120, a service floor section selection unit 121, and a time interval evaluation value calculation unit 122. These elements represent elements required by applying the concept of sieving (screening) of the allocated effective number machine of the present invention to the conventional time interval evaluation method.

  Here, the basic concept of time interval evaluation will be described with reference to FIG. FIG. 18A shows the position and running state of each car for the management of three elevator groups. Each of the No. 1 machine K01 to No. 3 machine K03 is in a state as shown in FIG. In addition, the arrow attached to each car represents the traveling direction of each car. For example, Unit 1 is going up. When these three situations are represented by ring expression, FIG. 12B is obtained. The ring expression is a diagram in which each elevator car is expressed on a ring of one turn from ascending to descending. On this ring, each of the first machine K01 to the third machine K03 is represented as shown in FIG. In the time interval evaluation, the time interval of the section sandwiched between two elevators in the context of each elevator expressed in the ring expression is evaluated. If this interval is large, when a hall call is generated in that section, a subsequent elevator that arrives at that call will take time to arrive, so it will be easy to wait long. Therefore, in order to suppress long waiting time, it is best to make the time interval of each section equal, and the time interval evaluation is an index for evaluating this, for example, the maximum value of the interval, the variance of the interval, Perform sum of squares of intervals. That is, a set of consecutive floors with the same elevator service is set as the hall call serviceable section of the elevator, and the interval evaluation is performed based on the time required to pass through the serviceable section. This is the interval evaluation based on the time length, but it is possible to use only the length of the physical interval for simplicity.

  The point of this interval evaluation is based on the assumption that future calls will be generated in each car section represented by the ring expression, and it is assumed that the elevator at the rear end of each section will serve these calls. is doing. This is the same idea that the elevator with the smallest estimated arrival time is served.

  Hereinafter, returning to FIG. 13, the description of the embodiment of the present invention will be continued. In service elevator selection section 120, for each floor in each elevator section expressed as a ring (this is a future call candidate floor), an elevator with the minimum arrival time is selected from the assigned effective units for each floor. . The service floor section selection unit 121 reselects the service floor section based on each selected service charge elevator. Here, the initial stage of the service floor section is the section of each elevator expressed in a ring. However, since the elevator in charge of each floor changes, it is necessary to reselect the service floor section by this processing. In the time interval evaluation value calculation 122, the time interval is calculated for the service floor section newly selected, and the time interval is calculated by the maximum value of the interval, the variance of the interval, the square sum of the intervals, or the like. An evaluation value is calculated.

  FIG. 14 shows a flowchart for calculating a time interval evaluation value that is a point in the configuration example of the elevator group management system described in FIG. Here, a method for predicting the position and direction of each elevator car after a predetermined time and evaluating the time interval for the positional relationship is considered. The processing flow will be described below. First, the predicted position / direction of each car is calculated from the estimated arrival time table (ST301). Next, the position order on the ring expression is calculated from the predicted position and direction after a predetermined time of each car (ST302). A section between two units in a longitudinal relationship is determined from the position order of each unit (ST303). For each unit, a section in front of the own unit (forward with respect to one turn in the ring expression) is provisionally set as a section in charge of that unit (ST304). Then, with respect to the section in charge of each unit, it is checked whether each floor / direction and time in the section in charge belongs to the allocation invalid area (ST305). If the floor / direction in the assigned section belongs to the allocation invalid area, the floor / direction is changed to be added to the assigned section of the subsequent number machine of the original assigned number machine (ST306). If the above processing is checked for the floor / direction of the section in charge of all the units (ST307), the time interval evaluation value is calculated from the time interval of the section in charge of each unit reviewed (ST308). . Here, in process ST306, for the floor / direction in which the assigned machine is changed, it is checked whether or not the newly assigned assigned machine also belongs to the allocation invalid area. Repeat the process until the active machine becomes the assigned machine.

  15, 16, and 17 represent examples of calculating time interval evaluation values using the allocation invalid area based on the embodiment described with reference to FIGS. Here, three elevator group management will be described as an example. FIG. 15A shows the state of three car positions at the current time (displayed in a ring expression).

  FIG. 15B shows a calculation example of the service floor section of the first machine E08 in the situation of FIG. Here, the time interval of each car after the predetermined time tf (time of line E07) is evaluated. In FIG. 15B, the horizontal axis represents time, the vertical axis represents the floor position, and the origin of the time axis represents the current time (current time). The positions of the first machine E01 to the third machine E03 are as shown in the figure, and correspond to the position state of FIG. For this situation, a time interval evaluation value for each predicted position of each car at time tf (line E07) is obtained.

  First, a predicted arrival time table for each unit (a table of predicted arrival times for each floor and direction) is calculated, and based on this, a predicted trajectory for each unit is created. For example, in the case of No. 1 machine E01, it is possible to draw a predicted trajectory represented by a broken line E04. Similarly, in the case of No. 2 machine E02, the predicted trajectory is represented by a broken line E05, and in the case of No. 2 machine E03, a broken line E06. These predicted trajectories correspond to traces of the position (predicted position) of each car at each time.

  From this predicted trajectory, the predicted position of each car at time tf is determined. The predicted position and direction of the first car at time tf are the position and direction of the code E08, and the predicted position and direction of the second car are the position and the direction of the code E09.

  Next, an allocation invalid area is calculated for each unit.

  FIG. 16 shows the allocation invalid area of Unit 1 in this example. The allocation invalid area of Unit 1 is an area F01 surrounded by a thick line on the two-dimensional coordinates of the time-floor position. The portion after the time tf in the allocation invalid area F01 is the section E11. Accordingly, after time tf, the first unit becomes invalid (unassignable) because the floor in the section E11 is waiting for a long time or is full.

  As a result of reflecting the allocation invalid area of Unit 1 shown in FIG. 16, the service floor section in which Unit 1 is the assigned unit is the section E10 that was initially set up to Unit 2 (at the time of provisional setting). Become. At this time, the section E11 belonging to the allocation invalid area is excluded. In this section, the next unit No. 3 will be the assigned unit. In this way, by calculating the time interval for the section that can be assigned by the assigned unit excluding floors with invalid allocation, and calculating the time interval evaluation value based on this, more accurate accuracy can be obtained. Highly accurate time interval evaluation can be performed.

  FIG. 17 shows the assigned section of each elevator car at the time of temporary setting for the example of FIG. 16, and FIG. 17B shows the assigned section after the allocation invalid area determination. Here, the assigned section of each elevator at the time of temporary setting shown in FIG. 17A also corresponds to the time interval evaluation of the prior art. In this example, it is assumed that the invalid allocation area exists only for the first car as shown in FIG.

  The section in charge of each elevator at the time of temporary setting shown in FIG. 17A is the section G04 for the first car G01, the section G05 for the second car G02, and the section G06 for the third car G03. On the other hand, in the assigned section after the allocation invalid area determination shown in FIG. 17B, the first machine G01 is the section G04A, the second machine G02 is the section G05, and the third machine G03 is the section G06A. In Unit 1, there is a section E11 in FIG. 15 in which the allocation becomes invalid in the section in charge at the time of provisional setting. As a result of reflecting this, the length of the section is shortened. On the other hand, since the section that is not in charge of Unit 1 is in charge of Unit 3, the section length in charge of Unit 3 increases. As a result, after the temporary setting, each unit has a relatively uniform interval as shown in FIG. 17 (A), whereas each unit can determine whether the floor in each section can actually be allocated. As can be seen from FIG. 17B, a large deviation occurs. The assigned section at the time of provisional setting is the same as the section considered in the prior art, and it can be seen that the conventional method cannot evaluate the correct time interval. On the other hand, in the method according to the embodiment of the present invention, the floor section in charge is set by the assignable machine, and the time interval is obtained for it. It is possible to evaluate the interval.

  Finally, as a supplementary explanation, an explanation about the concept of sieving (selecting) the above-mentioned assigned effective machine is added. The basic allocation evaluation formula for general group management is as follows.

Allocation evaluation value = waiting time for new calls + waiting time for calls already assigned + congestion level in the car ………………………………………………………………………… ... (1)
Every time a new hall call is generated, the evaluation value of each elevator is calculated by the above-mentioned allocation evaluation formula. Therefore, it is appropriate to apply this formula to the future call candidate floors, but as shown in FIG. 2, the future call candidate floors are distributed in the two-dimensional area of the time axis and the floor position axis. The number is large, and the amount of calculation becomes enormous if each unit is temporarily assigned and evaluated. Therefore, in the embodiment of the present invention, paying attention to the waiting time for a call that has already been assigned and the degree of congestion in the car, the case where the former waits long and the latter becomes full is predicted. Cannot be assigned and is excluded from service evaluation. That is, in other words, the assignable machine and the impossible machine are selected (selected). In other words, based on the concept of the allocation evaluation value in equation (1), by focusing on the case where allocation is impossible, the number of computations that will actually be allocated can be predicted more accurately while reducing the amount of computation required. Doing things. In the case of the conventional technology, in order to reduce the amount of calculation, the future call is evaluated with an evaluation formula such as the following formula, and there is actually a deviation from the evaluation value, so a correct evaluation cannot be performed. Will occur.

  Allocation evaluation value = waiting time for new calls ... (2)

The control block diagram of the whole elevator group management system by one Example of this invention. Explanatory drawing of hall call (future call) that may occur in the future. The calculation process flowchart of the future call waiting time evaluation value in the elevator group management system by one Example of this invention. The flowchart of the calculation process of the allocation invalid area | region with respect to the hall call which has already been allocated and is waiting for a long time by one Example of this invention. FIG. 5 is a diagram for explaining an allocation invalid area calculation process according to the embodiment of FIG. 4. The flowchart of a calculation process of the allocation invalid area | region by the prediction congestion degree excess (full prediction) by one Example of this invention. FIG. 7 is a diagram for explaining an allocation invalid area calculation process according to the embodiment of FIG. 6. The flowchart of a calculation process of the allocation invalid area | region by the excessive call stop frequency by one Example of this invention. FIG. 9 is a diagram for explaining an allocation invalid area calculation process according to the embodiment of FIG. 8. FIG. 4 is an explanatory diagram for calculating a future call waiting time evaluation value using an allocation invalid area based on the embodiment of FIGS. 1 and 3. FIG. 11 is an explanatory diagram illustrating an example of a calculation result of an allocation invalid area according to FIG. 10. The figure explaining comparison with the prediction waiting time with respect to the future call candidate floor by the prior art and the Example of this invention. The control block diagram of the whole elevator group management system by the other Example of this invention. The flowchart which calculates the time interval evaluation value in the elevator group management system of FIG. FIG. 15 is an explanatory diagram for calculating a time interval evaluation value using an allocation invalid area based on the embodiment of FIGS. 13 and 14. FIG. 16 is an explanatory diagram illustrating an example of a calculation result of an allocation invalid area according to FIG. 15. FIG. 17 is an explanatory diagram illustrating changes in the assigned section of each elevator car and the assigned section after the allocation invalid area determination at the time of temporary setting according to FIG. 16. Explanatory drawing of the basic concept of time interval evaluation by ring expression. Control example explanatory drawing of the elevator group management system by one Example of this invention.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 ... Group management control part, 21A-21C ... Unit control apparatus, 22A-22C ... Elevator car, 23A-23C ... Destination floor registration apparatus in car, 24A-24C ... Load sensor, 3A, 3B ... Hall call registration apparatus, DESCRIPTION OF SYMBOLS 4 ... Hall destination floor registration apparatus, 5A-5C ... Human flow sensor, 100 ... Data storage part, 101 ... Predicted arrival time table calculation part, 102 ... Predicted waiting time calculation part, 103 ... Predicted congestion degree calculation part in car 104 ... call stop count calculation unit, 105 ... assignment invalid area calculation unit, 106 ... future call candidate floor selection unit, 107 ... assignment valid number machine selection unit, 108 ... future call waiting time evaluation value calculation unit, 109 ... allocated call and new Allocation evaluation value calculation unit for allocation call, 110... Overall evaluation value calculation unit, 111.

Claims (20)

In an elevator group management system comprising a plurality of elevators that service a plurality of floors and an allocation control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
A means to extract hall calls that may occur in the future as future call candidates,
Sorting means for sorting the plurality of elevators into assignable and unassignable elevators for the future call candidates;
Means for calculating an assignment evaluation value for a future call when the allocatable elevator for the future call candidate is assigned to the future call candidate;
An allocation evaluation index calculation means for calculating an allocation evaluation index for a newly generated hall call in consideration of an allocation evaluation value for this future call,
An elevator group management system comprising: an assigned elevator determining means for determining an elevator to be assigned to the newly generated hall call based on the assignment evaluation index. In an elevator group management system comprising a plurality of elevators that service a plurality of floors and an allocation control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
A means to extract hall calls that may occur in the future as future call candidates,
Sorting means for sorting the plurality of elevators into elevators that can be assigned to the future call candidates and elevators that cannot be assigned;
Means for calculating a serviceability evaluation value that is an index of serviceability for the future call candidate based on a predicted waiting time of an assignable elevator for the future call candidate;
In consideration of this serviceability evaluation value, an allocation evaluation index calculating means for calculating an allocation evaluation index for a newly generated hall call,
An elevator group management system comprising: an assigned elevator determining means for determining an elevator to be assigned to the newly generated hall call based on the assignment evaluation index.   3. The elevator according to claim 1, wherein the selecting means includes means for selecting an elevator having a predicted waiting time within a predetermined value as an assignable elevator when the future call candidate is serviced. Group management system.   4. The method according to claim 1, wherein when the future call candidate is serviced, the selecting means includes means for selecting an elevator having a predicted intra-car congestion level within a predetermined value as an assignable elevator. A featured elevator group management system.   5. The selecting means according to claim 1, wherein when the future call candidate is serviced, the selecting means selects an elevator whose number of stops for a call of the car within a predetermined value as an assignable elevator. An elevator group management system characterized by that. In an elevator group management system comprising a plurality of elevators that service a plurality of floors and a group management control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
A means to extract hall calls that may occur in the future as future call candidates,
Sorting means for sorting the plurality of elevators into assignable and unassignable elevators for the future call candidates;
Interval evaluation values of the plurality of elevators based on the corrected service planned floor zone for the future call candidate in which the service planned floor zone of each elevator based on the positional relationship between the elevators is corrected based on the result of the selection Means for calculating
In consideration of this interval evaluation value, an allocation evaluation index calculating means for calculating an allocation evaluation index for a newly generated hall call,
An elevator group management system comprising: an assigned elevator determining means for determining an elevator to be assigned to the newly generated hall call based on the assignment evaluation index. In claim 6, the means for calculating the interval evaluation value is a means for setting a set of consecutive floors where the elevators to be serviced are the same as the hall call serviceable section of the elevators;
The elevator group management system, wherein the plurality of elevators includes means for calculating the interval evaluation value based on a temporal or distance length of each hall call service available section.   8. The elevator according to claim 6, wherein the selecting means includes means for selecting an elevator having a predicted waiting time within a predetermined value as an assignable elevator when serving the future call candidate. Group management system.   9. The method according to claim 6, wherein when the future call candidate is serviced, the selecting means includes means for selecting an elevator having a predicted in-car congestion within a predetermined value as an assignable elevator. A featured elevator group management system.   10. The selecting means according to claim 6, wherein when the future call candidate is serviced, the selecting means selects an elevator whose number of stops for the car call within a predetermined value as an assignable elevator. An elevator group management system characterized by that. In an allocation control method of an elevator group management system comprising a plurality of elevators that service a plurality of floors and an allocation control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
Extracting hall calls that may occur in the future as future call candidates;
Screening the plurality of elevators into assignable and unassignable elevators for the future call candidates;
Calculating an allocation evaluation value for a future call when the allocatable elevator for the future call candidate is assigned to the future call candidate; and
In consideration of the allocation evaluation value for this future call, calculating the allocation evaluation index for the newly generated hall call;
An elevator group management system assignment control method comprising a step of determining an elevator assigned to the newly generated hall call based on the assignment evaluation index. In an allocation control method of an elevator group management system comprising a plurality of elevators that service a plurality of floors and an allocation control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
Extracting hall calls that may occur in the future as future call candidates;
Screening the plurality of elevators into assignable and unassignable elevators for the future call candidates;
Calculating a serviceability evaluation value that is an index of serviceability for the future call candidate based on a predicted waiting time of an assignable elevator for the future call candidate;
Taking into account this serviceability evaluation value, calculating an allocation evaluation index for a newly generated hall call;
An elevator group management system assignment control method comprising a step of determining an elevator assigned to the newly generated hall call based on the assignment evaluation index.   13. The elevator according to claim 11 or 12, wherein when the future call candidate is serviced, the selecting step includes a step of selecting an elevator whose predicted waiting time is within a predetermined value as an assignable elevator. Allocation control method for group management system.   14. The method according to any one of claims 11 to 13, wherein when the future call candidate is serviced, the selecting step includes a step of selecting an elevator having a predicted in-car congestion within a predetermined value as an assignable elevator. An elevator group management system assignment control method.   15. The method according to claim 11, wherein when the future call candidate is serviced, the selecting step includes selecting an elevator whose number of stops for a call of the car is within a predetermined value as an assignable elevator. An assignment control method for an elevator group management system. In an allocation control method for an elevator group management system comprising a plurality of elevators that service a plurality of floors, and a group management control device that allocates newly generated hall calls to appropriate elevators based on an allocation evaluation index,
Extracting hall calls that may occur in the future as future call candidates;
A sorting step of sorting the plurality of elevators into assignable and unassignable elevators for the future call candidates;
Based on the serviceable floor zone for the future call candidate obtained by correcting the scheduled service floor zone of each elevator based on the result of the selection based on the positional relationship between the elevators, the interval evaluation value of the plurality of elevators is calculated. Steps,
In consideration of this interval evaluation value, calculating an allocation evaluation index for a newly generated hall call;
An elevator group management system assignment control method comprising a step of determining an elevator assigned to the newly generated hall call based on the assignment evaluation index. The step of calculating the interval evaluation value according to claim 16, wherein a set of consecutive floors with the same elevator service is set as a hall call serviceable section of the elevator,
Allocation control of an elevator group management system, wherein the plurality of elevators includes means for calculating the interval evaluation value based on a time or distance length of each hall call serviceable section Method.   18. The elevator according to claim 16, wherein the selecting step includes a step of selecting an elevator having a predicted waiting time within a predetermined value as an assignable elevator when the future call candidate is serviced. Allocation control method for group management system.   19. The selection step according to claim 16, wherein, when the future call candidate is serviced, the selection step includes a step of selecting an elevator having a predicted in-car congestion within a predetermined value as an assignable elevator. An elevator group management system assignment control method.   20. The selection step according to claim 16, wherein when the future call candidate is serviced, the selection step includes selecting an elevator whose number of stops for a call of the car is within a predetermined value as an assignable elevator. An assignment control method for an elevator group management system.

Images