JP2011105452A - Elevator group management system and elevator group management method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To control the operation of a car so as to keep high transport capacity, even for floors in high demand. <P>SOLUTION: An elevator group management system includes a plurality of elevators 221-223 for giving services to a plurality of floors, and destination floor register elements 31-33 provided on an elevator landing for allowing a user to register a destination floor, and adequately allocates the elevator responding to the registered destination floor out of the plurality of elevators. The elevator group management system further includes a means 105 for calculating the arrival estimation time of each elevator, means 107, 108 for computing the estimated passenger number by the destination floor until each elevator arrives according to the estimated traffic demand within the time zone in which the destination floor call is generated, and a means 111 for determining an allocatable elevator taking into consideration not only the generated destination floor call, but also the estimated passenger number. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to an elevator group management system and a group management method, and in particular, in an elevator system in which a user registers a destination floor at a landing, an appropriate elevator is assigned to a newly generated destination floor call. The present invention relates to an elevator group management system and a group management method.

  In recent years, buildings owned by one company have decreased and tenant buildings have increased. Tenant buildings have different use times of the buildings depending on the tenant even within the same building. In an elevator system installed in such a building, a usage tendency peculiar to the building appears for each time zone and floor.

  The elevator group management system provides a more efficient operation service to users by treating a plurality of elevators (hereinafter sometimes referred to as cars) as one group. Is a process that manages multiple cars as a group, selects one optimal car for calls from a newly registered landing on a certain floor, and assigns the previous landing call to that car It provides an operation service to implement.

  The general group management system is to register a landing call in the direction of the upper or lower destination at the landing, place the passenger in the arriving car, and register the destination floor in the car on which the passenger got. On the other hand, the destination floor reservation type group management system is a system in which the destination floor is registered at the landing, and since the user's destination floor is known at the time of call registration, it is appropriate for the registered destination floor. A car can be assigned. In the following, the description will be continued on the assumption that a call by destination floor registration at a landing is called a destination floor call.

  The destination floor reservation type group management system can reduce the number of stop floors per car by allocating a car according to the destination floor when the number of destination floors of users at the landing is large. I can do it. As a result, the destination floor reservation type group management system can shorten the time for one round of the car, and can improve the operation efficiency of each car. Such an effect is particularly noticeable when the traffic demand is such that the passenger heads from the lobby floor to a number of destination floors, such as at work.

  In addition, because the destination floor reservation type group management system allows destination floor registration only at the landing, each user must register the destination floor, and the number of waiters can be detected from the number of registrations have.

  In the destination floor reservation type group management system as described above, for example, the techniques described in Patent Documents 1 to 3 and the like are known as conventional techniques related to a method of assigning more appropriate elevators using waiting number information of each elevator. It has been.

  The prior art described in Patent Literature 1 limits the number of registered floors of destination floor calls that can be assigned to each car to a predetermined value or less according to the traffic volume.

  In addition, the prior art described in Patent Document 2 predicts the number of passengers overloading by destination floor, and additionally allocates cars to destination floor calls that are predicted to overflow.

  The prior art described in Patent Document 3 is a conventional group management system in which the direction of the destination floor is input with the up and down buttons. From the example of past traffic demand and control results, Another traffic demand and a virtual call list corresponding to a desired control target for each floor are acquired, and control is performed by calculating an optimum operation pattern for the acquired list.

JP 59-190171 A JP 2009-84020 A JP 2007-269424 A

  Since the prior art described in Patent Document 1 limits the number of calls that can be assigned to each car, it is possible to reduce the number of stop floors of each car and shorten the round time of each car. However, this prior art assigns cars considering only the current destination floor call, and does not consider what kind of traffic demand will occur after the destination floor call is generated. For this reason, in this prior art, the control performance largely depends on the traffic demand and the arrival order of passengers. For example, for a car in which multiple destination floor calls to a low demand floor are already assigned. However, if the number of calls is within the limit, a destination floor call to a high-demand floor will occur, and as a result, passengers going to the high-demand floor will be distributed to multiple elevators. May be assigned. Therefore, the prior art described in Patent Document 1 has a problem that the number of stop floors of the elevator is increased and the transportation capacity of the entire elevator system is reduced.

  The prior art described in Patent Document 2 predicts the number of passengers that will overflow by destination floor before arrival of the elevator, estimates the destination floor calls of waiting passengers who cannot ride, and performs additional allocation in advance. It is possible to avoid the occurrence of waiting customers who can not ride. However, because this prior art is a method of adding a car allocation, both the original allocation car and the added allocation car both serve the overflow destination floor. There is a problem that the number of stop floors increases and the transportation capacity of the elevator system as a whole decreases.

  The prior art described in Patent Document 3 can estimate a call that will occur in the future from the current traffic demand, and determine an optimal allocation pattern including the future call. However, since this prior art uses the landing call by the up / down button, the passenger's destination floor cannot be determined from the landing call by the up / down button, so it is difficult to transfer the passenger to the elevator according to the destination floor. Has the problem.

  The object of the present invention is to solve the above-mentioned problems of the prior art and reduce the number of stopped floors of each car by allowing passengers to be separated by destination floor even in crowded times. It is an object of the present invention to provide an elevator group management system and a group management method capable of controlling the operation of a car so that a high transportation capacity can be maintained at a certain time.

  According to the present invention, the object is provided with a plurality of elevators that service a plurality of floors, and a destination floor registration device for a user provided at the elevator landing to register a destination floor. In an elevator group management system that appropriately allocates elevators that respond to registered destination floors, each elevator arrives according to the estimated arrival time of each elevator and the predicted traffic demand in the time zone when the destination floor call occurred This is achieved by calculating the predicted number of passengers for each destination floor and determining the assignable cars in consideration of the predicted number of passengers as well as the generated destination floor call.

  Specifically, according to the present invention, the object is to provide a plurality of elevators that service a plurality of floors, and a destination floor registration device that is installed at an elevator landing and allows a user to register a destination floor call. And an elevator group management system for allocating an elevator responding to the destination floor call from the plurality of elevators to a destination floor call registered by the destination floor registration device, from the destination floor registration device to the elevator For each elevator, a first predicted passenger number calculating means for calculating a predicted number of passengers for the registered unassigned destination floor call, for each elevator, Second predicted passenger number calculating means for calculating a predicted number of passengers for a destination floor call assigned to the elevator, and for each elevator, the first predicted passenger number Assignment that compares the predicted number of passengers calculated by the calculating means and the total predicted number of passengers calculated by the second predicted passenger number calculating means with the car capacity to determine whether or not the elevator can be assigned This is achieved by including a possible elevator determining means and an assigned elevator determining means for determining an elevator to be assigned to the unassigned destination floor call from the elevators determined to be assignable by the assignable elevator judging means.

  According to the present invention, passengers can be appropriately allocated to destination elevators and boarded, and in particular, when a specific floor is in high demand, an elevator dedicated to passengers going to that floor is allocated. This makes it possible to reduce the number of stopped floors of the elevator and improve the transportation capacity.

It is a block diagram which shows the structure of the group management system of the elevator by one Embodiment of this invention. It is a block diagram which shows the structure of the predicted passenger number calculation means of the allocated destination floor call generation floor. It is a figure which shows the structural example of the predicted traffic demand table which is the result calculated by the predicted traffic demand calculating means. It is a figure which shows the structural example of the destination floor call information management table which manages the non-response destination floor call managed by the destination floor call information management means. It is a figure explaining the calculation method of the total value of the real allocation number of persons in a destination floor call information management table. 6 is a flowchart illustrating a process of calculating ΣPr (k), which is the total value of the actual allocated number in the destination floor call information management table described with reference to FIG. 5. It is a figure explaining the process of initialization of a destination floor call information management table. It is a flowchart explaining the processing operation of the allocation elevator determination with respect to the generated destination floor call. It is a figure explaining the precondition in explaining the example of the group management system of the elevator by the embodiment of the present invention. It is a figure explaining the specific example of the allocation process of the elevator in the group management system of the elevator by embodiment of this invention. It is a figure explaining the characteristic of operation of the group management system of an elevator by one embodiment of the present invention in contrast with the prior art. It is a figure explaining the example of the allocation process with respect to three elevators in the example of the allocation process of the elevator in the group management system of the elevator by embodiment of this invention.

  Embodiments of an elevator group management system and group management method according to the present invention will be described below in detail with reference to the drawings.

  FIG. 11 is a diagram for explaining the feature of the operation of the elevator group management system according to one embodiment of the present invention in comparison with the prior art. Before describing the embodiment of the present invention, FIG. The features of the elevator group management system according to the invention will be described.

  In the example described here, as shown in FIG. 11 (a), the elevator system is composed of two elevators No. A and No. B, and serves the fifth floor. Now, passengers going from the 1st floor to the 3rd floor and passengers going from the 1st floor to the 5th floor are already assigned to the Unit A, and passengers going from the 1st floor to the 4th floor are newly assigned to the 1st floor. The destination floor call to the fourth floor is registered by the destination floor registration device installed at the platform. In addition, it is assumed that the estimated time until arrival of the first car at the first floor at the time of registration of the destination floor call to the fourth floor is 10 seconds, and the predicted arrival time of the second car is 20 seconds.

  FIG. 11B shows an example of the predicted number of passenger arrivals per unit time (details will be described later with reference to FIG. 3) in the time zone when the destination floor call to the fourth floor described above occurs. Here, the predicted number of passenger arrivals per unit time is the number of passengers by destination floor generated per unit time, and in the example shown in FIG. 11B, the unit time is 1 minute. In the example shown in FIG. 11 (b), 24 passengers get on the 1st floor and get off on the 4th floor are generated per minute, which is higher than that between other floors. I understand that.

  FIG. 11 (c) shows a state of car assignment by control in the group management system according to the prior art. In this prior art, a limit value is set for the number of destination floor calls assigned to each car described above, and a new call is assigned to a car having a good allocation evaluation value from among cars whose destination floor call number is equal to or less than the limit value. It is a thing. Now, if the above limit value is 3, the number of destination floor calls when the destination floor calls from the first floor to the fourth floor are assigned to Unit A is 3, and the number of destination floor calls when the assignment is made to Unit B is 1. New calls from the 1st floor to the 4th floor can be assigned to both the A machine and the B machine. Here, if the assigned evaluation value is the elevator waiting time, the destination floor call to the 4th floor will be assigned to Unit A with a short waiting time as shown in the upper part of FIG. 11 (c). .

  At this time, in the case of the conventional technology described, the traffic demand as shown in FIG. 11B is not considered, that is, the time when the destination floor call from the first floor to the fourth floor is newly generated Since no consideration is given to what kind of traffic demand is generated in the belt, it is not considered how many passengers will arrive at the elevator landing after the destination floor call to the fourth floor. For this reason, the situation shown in the lower part of FIG. 11C can occur when the car A arrives 10 seconds after the destination floor call to the fourth floor is generated. That is, the traffic demand as shown in FIG. 11 (b) is not completely followed, but, for example, by 10 seconds after the destination floor call to the 4th floor is generated, 2 passengers newly going to the 3rd floor A situation can occur where eight people, four people going to the fourth floor and two passengers going to the fifth floor, register for the destination floor. As a result, there are 11 passengers who have registered before the arrival of Unit A after the destination floor call to the fourth floor and three passengers who have already registered when the destination floor call to the fourth floor has occurred. People will be waiting. In the case of the prior art, for example, as shown in FIG. 11 (c), 8 waiting customers who will be assigned to the A machine arrived will be allocated, and the remaining 3 waiting customers will be assigned to the B machine that arrives thereafter. Will be assigned.

  As mentioned above, in the case of the prior art, all passengers who went to the elevator platform before arrival of Unit A, 3rd floor, 4th floor, 5th floor could not be allotted to Unit A, and could not be allocated 3rd floor, 4th floor Passengers to the 5th floor will be assigned to Unit B. Therefore, both Unit A and Unit B serve the third floor, the fourth floor, and the fifth floor, and the number of stop floors as an entire elevator is six floors.

  FIG. 11 (d) shows a state of car assignment by control in the group management system according to the embodiment of the present invention. In this embodiment of the present invention, the predicted number of passengers until each elevator arrives is calculated from the estimated arrival time of the elevator and the predicted number of passengers per unit time shown in FIG. Determines whether it can be assigned to the first A machine that arrives. From the estimated arrival time of FIG. 11 (b) and each unit, the number of passengers predicted to be generated from the arrival of the destination floor call to the 4th floor until the arrival of Unit A is 3rd floor as described above. There are two and two passengers going to the fifth floor, respectively, whereas four passengers go to the fourth floor.

  Accordingly, in the embodiment of the present invention, it is predicted that a total of six passengers will go to the third floor and the fifth floor by the arrival of the A machine. It is determined that it is impossible to assign all five passengers to Unit A, and five passengers going to the fourth floor are assigned to Unit B. At this time, the number of stop floors of Unit A is the second floor of the third and fifth floors, and the number of stop floors of Unit B is the first floor of only the fourth floor. Become the floor. As a result, in the case of the embodiment of the present invention, it is possible to reduce the number of stop floors and to maintain a high transportation capacity as compared with the case of the prior art shown in FIG.

  FIG. 1 is a block diagram showing the configuration of an elevator group management system according to an embodiment of the present invention. Details of the elevator group management system according to an embodiment of the present invention will be described below with reference to FIG.

  As shown in FIG. 1, the elevator group management system according to the embodiment of the present invention includes a group management control unit 1, K elevators 221 to 223, and K elevators that control each of the elevators 211 to 223. 213 and destination floor registration devices 31 to 33 provided at the landings for each floor. In the elevator group management system according to the embodiment of the present invention, the operation of each of the K elevators 221 to 223 is controlled by the elevator control devices 211 to 213 of each elevator. The group management control unit 1 performs overall control. In addition, a destination floor signal input from destination floor registration devices 31 to 33 installed on one or more floors of the building is transmitted to the group management control unit 1. Here, the destination floor registration devices 31 to 33 are configured to include a number display unit for displaying the determined elevator number and a numeric keypad, and input the destination floor using the numeric keypad at the landing and call the elevator to the landing. is there. In addition, the machine control devices 221 to 223 transmit information on the operation state such as the position, direction, and speed of each elevator to the group management control unit 1.

  Next, the group management control unit 1 will be described. As a basic operation, the group management control unit 1 evaluates each of a plurality of elevators with an assigned evaluation function for the generated destination floor call under a lot of collected information, and selects the most appropriate car. The destination floor call is assigned to the car. Information to be collected includes information on calls that have been generated, information on each detected elevator, information estimated statistically from information on traffic demand of passengers in the past, and the like.

  The group management control unit 1 includes a destination floor call information management unit 101, an elevator information management unit 102, a date / time information detection unit 103, a traffic demand data storage unit 104, an estimated arrival time calculation unit 105, and a predicted traffic. Demand calculation means 106, predicted passenger number calculation means 107 for new destination floor call generation floor, predicted passenger number calculation means 108 for assigned destination floor call generation floor, assignable elevator determination means 109, and assignment to assignable elevators The evaluation value calculation means 110 and the assigned elevator determination means 111 are provided.

  In the above description, the destination floor call information management means 101 has determined the unanswered destination floor call, that is, the assigned elevator, but has not reached the floor where the destination floor registration device for registering the destination floor is provided. Information on the destination floor call (for example, the number of registrations) is managed. That is, the destination call information management means 101 collects destination floor input information from the destination floor registration devices 31 to 33 installed on each floor, and creates a destination floor call information management table as described later with reference to FIG. By using this, the total number of assigned persons (details will be described with reference to FIG. 5) and the initialization process (details will be described with reference to FIG. 7) are performed.

  The elevator information management means 102 collects and manages the positions of the elevators 221 to 223 and the number of people in the car from the machine control devices 211 to 213, and the date / time information detection means 103 stores the current date and time Detect time information.

  The traffic demand data accumulating means 104 performs processing for accumulating building traffic demand data collected from the destination floor registration devices 31 to 33 and the date / time information detecting means 103 in a storage device such as a memory. The traffic demand data of the building here is the date, time, boarding floor, destination floor, etc., where the destination floor call occurred. The traffic demand data of the building may include not only the date, time, boarding floor and destination floor described above, but also day type information such as day of the week and weather.

  The estimated arrival time calculation means 105 includes unanswered destination floor call information managed by the destination floor call information management means 101, position and speed information of each elevator collected by the elevator information management means 102, and traffic demand data storage. The estimated arrival time for each floor and each direction of each elevator is calculated from the history of past passengers accumulated and managed by means 104.

  The predicted traffic demand calculation means 106 calculates the current time from the past passenger occurrence history accumulated by the traffic demand data accumulation means 104 and information such as the current date / time detected by the date / time information detection means 103. The predicted number of passenger arrivals per unit time in the belt is calculated (details will be described with reference to FIG. 3).

  The predicted number-of-passengers calculation means 107 of the new destination floor call occurrence floor is the destination floor call information managed by the destination floor call information management means 101, the estimated arrival time and prediction of each elevator calculated by the arrival prediction time calculation means 105. From the predicted number of passenger arrivals per unit time in the current time zone calculated by the traffic demand calculation means 106, the predicted number of passengers in the new destination floor call generation floor, that is, each elevator arrives at the destination floor call generation floor. The number of passengers to the same destination floor that is predicted to be generated is calculated by the following equation (1).

P (k, i, j) = Pe (i, j) × T (k, i) (1)
In the above equation (1), P (k, i, j) is predicted to occur before arrival of k-th unit for the new destination floor call from the i-th floor to the j-th floor, from the i-th floor to the j-th floor. The predicted number of passengers to arrive, Pe (i, j) is predicted to occur in the current time zone, and the estimated number of passenger arrivals from floor i to floor j per unit time, This is the estimated time of arrival of the k-th unit at the i-th floor. However, when the unit time is indicated in minutes and the estimated arrival time is indicated in seconds, processing such as converting the estimated arrival time into minutes is required. Also, from equation (1), the predicted number of arrivals that will occur before arrival of k-th unit is calculated as the product of the predicted number of arrivals of passengers and the estimated arrival time of k-th unit, so that time elapses, that is, The value becomes smaller as the destination floor is called.

  FIG. 2 is a block diagram showing the configuration of the predicted passenger number calculation means 108 for the assigned destination floor call generation floor. Here, the configuration of the predicted passenger number calculation means for the assigned destination floor call generation floor will be described.

  The predicted number-of-passengers calculation means 108 of the assigned destination floor call generation floor has a structure as shown in FIG. 2, and calculates the predicted number of passengers of the assigned destination floor call generation floor. Specifically, the predicted number-of-passengers calculation means 108 of the assigned destination floor call generation floor is obtained by the actual allocation number calculation means 1081, the virtual allocation number calculation means 1082, and the predicted number-of-passengers calculation means 1083 of the assigned destination floor call generation floor. Composed.

  The actual allocated number calculation means 1081 calculates the actual allocated number for the destination floor call based on the information on the unanswered destination floor call managed by the destination floor call information management means 101. The actual allocated number can be calculated from the total number of call registrations for the destination floor.

  The virtual allocation number calculation means 1082 is information on unanswered destination floor calls managed by the destination floor call information management means 101, estimated arrival times and predicted traffic demand calculations for each elevator calculated by the estimated arrival time calculation means 105. From the predicted number of passengers calculated by the means 106, a virtual assigned number of passengers, that is, passengers predicted to be further generated by the arrival of the elevator for the destination floor call assigned to the elevator for each elevator. The number is calculated by the following equation (2).

Pv (k, i, j) = Pe (i, j) × T (k, i ′) (2)
In the equation (2), Pv (k, i, j) is further determined until the k-th unit arrives at the i-th floor after the destination floor call is generated in response to the assigned destination-floor call from the i-th floor to the j-th floor. The number of passengers going to the j-th floor that is predicted to be generated, that is, the virtual assigned number of the k-th car from the i-th floor to the j-th floor, i ′ is the floor where the unassigned destination floor call is generated. As shown in equation (2), the virtual allocation number is calculated as the product of the predicted number of passenger arrivals and the estimated arrival time of the elevator in the same manner as in equation (1). Therefore, the value becomes smaller as time passes.

  The predicted number-of-passengers totaling means 1083 of the assigned destination floor call generation floor is the actual assigned number for each destination floor calculated by the actual assigned number calculating means 1081 and each elevator calculated by the virtual assigned number calculating means 1082. The estimated number of passengers on the assigned destination floor call generation floor until the arrival of each elevator is calculated and calculated by the following equation (3) from the virtual assigned number for each destination floor.

Pt (k) = ΣPr (k) + ΣPv (k) (3)
In Equation (3), Pt (k) is the estimated number of passengers at the assigned destination floor call generation floor until the arrival of the kth car, and ΣPr (k) is already calculated by the actual assigned number calculating means 1081. The assigned number of destination floor calls, that is, the total value of the actual allocated number of persons, ΣPv (k) is the total value of the virtual allocated number of persons virtually allocated to the k-th unit. The calculation method of ΣPr (k) and ΣPv (k) will be described later in detail with reference to FIG.

  Hereinafter, returning to the reference to FIG. 1 and continuing the description, the allocatable elevator determination means 109 calculates the predicted number of passengers in the new destination floor call generation floor calculated by the predicted destination number calculation means 107 in the new destination floor call generation floor and The predicted number of passengers at the assigned destination floor call generation floor calculated by the predicted destination number calculation means 108 of the assigned destination floor call generation floor, the number of passengers in the car and the capacity of the elevator when the new destination floor call generation floor arrives When the relationship with the number satisfies the following expression (4), it is determined that the assignment to the elevator is possible.

Pt (k) + P (k, i, j) + Pc (k, i) ≦ CC (4)
In equation (4), Pc (k, i) is the estimated number of cars in the car of the k-th car upon arrival at the i-th floor, and CC is the number of cars. However, the car capacity CC may be a fixed value according to the capacity of the elevator or a value according to a change in traffic demand.

  The allocation evaluation value calculation means 110 for the allocatable elevator calculates an allocation evaluation value for the elevator that has been determined by the allocatable elevator determination means 109 to be able to allocate a new destination floor call. This assigned evaluation value is (A) waiting time, (B) maximum waiting time including assigned destination floor call, (C) service completion time including assigned destination floor call, etc. Calculate with Here, (A) has an effect of shortening the waiting time, (B) has a long waiting rate, and (C) has an effect of shortening the boarding time.

  The assigned elevator determining means 111 selects an elevator car having the best evaluation value from among the assignment evaluation values of the assignable elevators calculated by the assignment evaluation value calculating unit 110 for the assignable car, and calls the elevator car. Assign to

  The group management control unit 1 described above may be configured by hardware, or may be configured in an information processing apparatus including a memory, a nonvolatile storage device, a CPU, and the like. When the group management control unit 1 is configured in the information processing apparatus, each unit configuring the group management control unit 1 described above is configured as a program, and the program is stored in a memory or a nonvolatile storage device. It can be configured to be executed by a CPU.

  FIG. 3 is a diagram showing a configuration example of the predicted traffic demand table, which is a result calculated by the predicted traffic demand calculating means 106 shown in FIG. 1, and this will be described next.

  The example shown in FIG. 3 shows an example of the predicted number of passenger arrivals per unit time, and represents the predicted traffic demand by destination floor per unit time, that is, the predicted number of passenger arrivals in a matrix format. In FIG. 3, the column component represents the boarding floor and the row component represents the destination floor. For example, in FIG. 3, the elements surrounded by a broken line are predicted to go from the first floor to the fourth floor in the unit time (1 minute) in the current date and time zone detected by the date / time information detection means. Shows the number of passengers.

  FIG. 4 is a diagram showing an example of a destination floor call information management table for managing unanswered destination floor calls managed by the destination floor call information management means 101, which will be described next.

  The table shown in FIG. 4 is provided for each unit, and each destination floor call information management table of each unit is assigned with a column as a boarding floor and a row as a destination floor, as in the description of FIG. The number of unanswered destination floor calls, that is, the actual allocated number is shown. For example, in FIG. 4, the elements surrounded by a broken line indicate the number of passengers already assigned to Unit 1 and going from the first floor to the fourth floor.

  FIG. 5 is a diagram for explaining a method of calculating the total value of the actual allocated number in the destination floor call information management table, and explains the processing for calculating ΣPr (k) in equation (3).

  Assume that a new destination floor call from the 3rd floor to the 5th floor is generated under the destination floor call information management table of Unit 1 as shown in FIG. In this case, passengers getting off on the third floor and below do not get on the same elevator at the same time as the passenger who generated the destination floor call. Therefore, when determining whether the generated new destination floor call can be assigned to the first car, it is not necessary to consider passengers getting off at the third floor or lower. That is, the total value of the actual allocated number of people may be obtained by counting only the number of destination floor calls to floors serving after the boarding floor where the destination floor call has occurred among the already assigned destination floor calls, as shown in FIG. In the case of the example, the total value of the actual assigned number of Unit 1 when the destination floor is called from the third floor to the fifth floor is four persons, which is the total value of the elements surrounded by the broken line. Similarly, it is assumed that the total value of the virtual allocation number is also the total value of the virtual allocation number corresponding to the elements surrounded by the broken line in FIG.

  FIG. 6 is a flowchart for explaining the process of calculating ΣPr (k), which is the total value of the actual allocated number in the destination floor call information management table described with reference to FIG. 5. Next, this will be described.

(1) When the process is started, first, the generated destination floor call is acquired. Here, it is assumed that the destination floor call from the boarding floor i1 to the destination floor i2 is acquired as the destination floor call (step FC101).

(2) In order to determine whether the generated destination floor call is an upstream destination floor call or a downstream destination floor call, it is determined whether i2-i1 is greater than 0, and i2-i1 is greater than 0 If it is larger, it is determined that the call is an upstream destination floor call, and if i2-i1 is smaller than 0, it is determined that the call is a downstream destination floor call (step FC102).

(3) If it is determined in step FC102 that the generated destination floor call is an upstream destination floor call, the actual allocated number of persons is totaled for the upstream destination floor call. ΣPr (k) is the total value of the actual allocated number of people who get off the floor above i1 floor (step FC103).

(4) If it is determined in step FC102 that the generated destination floor call is a down destination floor call, the actual allocated number of persons is totaled for the down destination floor call. ΣPr (k) is the total value of the actual allocated number of people who get off the floor below i1 floor (step FC104).

  FIG. 7 is a diagram for explaining the initialization process of the destination floor call information management table. In FIG. 7, it is assumed that the elevator of Unit 1 is currently descending and the actual allocation table as shown in FIG. 7A is held immediately before arrival at the first floor. After the elevator arrives at the first floor, the three passengers assigned from the first floor to the third floor and the two passengers from the first floor to the fourth floor have already been in the car of Unit 1. Accordingly, since the car responds to the assignment at this point, all the boarding elements from the first floor are initialized to 0 as shown in FIG. 7B. That is, it becomes like a portion surrounded by a broken line in FIG. Further, only the riding elements in the traveling direction of the elevator need be initialized.

  FIG. 8 is a flowchart for explaining the processing operation for determining the assigned elevator for the destination floor call that has occurred, which will be described next.

(1) When the process is started, first, the generated destination floor call is acquired. Here, it is assumed that the boarding floor i1 and the destination floor i2 are acquired as the destination call, and it is determined whether or not the destination floor call from the boarding floor i1 to the destination floor i2 is a new destination floor call (step FC201, FC202).

(2) If it is determined in step FC202 that the destination floor call from the i1 floor to the i2 floor is a new destination floor call, in step FC203 to FC211, the calculation for each elevator is set to be performed. Is set to perform operations in order from No. K to No. K (step FC203).

(3) Next, for a certain elevator, the elevator unit, for example, No. k, arrives at the i1 floor based on the estimated arrival time and the estimated number of passenger arrivals per unit time from the i1 floor to the i2 floor. The predicted arrival number of passengers who go from the i1 floor to the i2 floor that are predicted to be generated by the time is calculated. Specifically, the calculation for obtaining P (k, i1, i2) represented by the equation (1) described above is performed (step FC204).

(4) After that, among the destination floor calls assigned to the k-th unit, the number of destination floor calls assigned to the floors that serve after the i1 floor, that is, the total value ΣPr (k) of the actual assigned number is calculated. Further, the total value ΣPv (k) of the virtual number of people assigned to the destination floor calls assigned to the floors serving after the i1 floor among the destination floor calls already assigned to the k-th unit is calculated (steps FC205 and FC206). ).

(5) Further, the predicted number of passengers Pt (k) at the generation floor of the destination floor call already assigned to the k-th car is calculated. Specifically, Pt (k) = ΣPr (k) + ΣPv (k) represented by the above-described equation (3) is calculated (step FC207).

(6) Next, when the k-th unit arrives at the i1 floor where the destination floor call is generated, the predicted number of cars Pc (k, i) in the car is calculated, and is expressed by the equation (4) described above. By calculating t (k) + P (k, i, j) + PPc (k, i) ≦ CC, it is determined whether or not the generated destination floor call can be assigned to the k-th car (steps FC208 and FC209). .

(7) If it is determined in step FC209 that the generated destination floor call can be assigned to the k-th car, an allocation evaluation value is calculated for the k-th car to which the generated destination floor call can be assigned (step FC210).

(8) After the process in step FC210 or in the determination in step FC209, if the generated destination floor call cannot be assigned to the k-th car, whether or not the calculation has been completed for all K elevator machines If the process has not been completed, the process returns to the process from step FC203 to continue the process for the next unit (step FC211).

(9) If the calculation is completed for all K elevator units in the determination in step FC211, the evaluation value is the best among the elevators for which the assigned evaluation value is calculated, that is, the calculated evaluation value is A destination floor call generated in the smallest car is assigned (step FC212).

(10) If the destination floor call from the boarding floor i1 to the destination floor i2 is not a new destination floor call in step FC202, the destination floor call that has occurred is already assigned to one of the elevators. When there is, the destination floor call generated in the elevator is additionally allocated (step FC214).

(11) After the process of step FC212 or step FC214 is completed, the destination floor call information management table of the elevator to which the generated destination floor call is assigned is updated, and the process here is terminated (step FC213).

  The car number of the car determined in the process of step FC212 described above is displayed on the car display section of the destination floor registration device. The time from when the destination floor is input from the destination floor registration device to when the assigned machine number is displayed on the machine display portion of the destination floor registration device after the processing shown in FIG. 8 is performed is in milliseconds. Therefore, the passenger who has entered the destination floor can know which elevator car he / she should get on.

  As described above, the details of the configuration and operation of the elevator group management system according to the embodiment of the present invention have been described. Next, in order to deepen the understanding, the operation of assigning elevators will be further described using simple specific examples. To do.

  FIG. 9 is a diagram for explaining preconditions for explaining a specific example of the elevator group management system according to the embodiment of the present invention, and FIG. 10 is an elevator assignment in the elevator group management system according to the embodiment of the present invention. It is a figure explaining the example of a process.

  As a specific example to be described, as shown in FIG. 9A, a case where there are two elevators with a car capacity of eight people in a five-floor building. Now, as shown in FIG. 9 (b), the estimated arrival time of the elevator on the first floor is 15 seconds for Unit A and 20 seconds for Unit B, and also shown in FIG. 9 (d). As shown in the table, the destination floor call information management table immediately before the destination floor call is generated has all elements 0, that is, no elevator is assigned to any destination floor. Shall. Further, it is assumed that the predicted number of passenger arrivals per unit time in the current time zone has a value as shown in FIG. 9C as the predicted number of passenger arrivals per minute.

  Under the conditions described above, assuming that a destination floor call from the first floor to the third floor has occurred, the flow of allocation processing at this time is briefly shown in FIG. 10 (a). Processing will be described.

  From the predicted number of passenger arrivals shown in Fig. 9 (c), there are 12 passengers going from the first floor to the third floor in the time zone when the destination floor call occurred, so if it occurs before arrival of Unit A The predicted number of passengers going from the first floor to the third floor can be calculated as three persons from the equation (1). In addition, the number of passengers going from the first floor to the third floor, which is predicted to be generated before arrival of Unit B, can be calculated in the same manner as 4 people.

  From the destination floor call information management table of each elevator shown in FIG. 9 (d), immediately before the destination floor call from the first floor to the third floor occurs, no allocation occurs between all the floors. Therefore, the total value of the actual allocated number is 0. In addition, since the actual allocation has not occurred, the number of virtual allocation is 0. Furthermore, since it is considered that all passengers descending from the floor above the first floor upon arrival at the first floor, the predicted number of passengers in the car is also zero.

  At this time, the assignable elevator judging means 109 judges that the destination floor call from the first floor to the third floor can be assigned to both the A-unit and the B-unit by using the equation (3).

  Next, the allocation evaluation value calculation unit 109 for the allocatable elevator calculates the allocation evaluation value for both the A-unit and the B-unit, to which the generated destination floor call can be allocated. Here, for simplicity, the waiting time is used as an evaluation value. Here, as already described, the waiting time of the A-unit is 15 seconds and the waiting time of the B-unit is 20 seconds from the estimated arrival time.

  The allocation evaluation value calculation means 110 for the allocatable elevator calculates the allocation evaluation values of the A-unit and the B-unit, and the allocation elevator determination means 111 converts the A-unit having a short waiting time to the passengers from the first floor to the third floor. Determine as the assigned elevator.

  Next, it is assumed that a destination floor call from the first floor to the fourth floor is generated immediately after the assigned elevator is determined for a destination floor call from the first floor to the third floor. The flow of the allocation process at this time is briefly shown in FIG. 10B, and this will be described next.

  From the predicted number of passenger arrivals shown in FIG. 9 (c), there are 24 passengers going from the first floor to the fourth floor in the current time zone, and it is predicted that they will occur before arrival of Unit A. The number of passengers going from the floor to the fourth floor can be calculated as 6 persons by the equation (1). Further, the number of passengers going from the first floor to the fourth floor, which is predicted to be generated before the arrival of Unit B, can be calculated as eight by the equation (1).

  When a destination floor call from the 1st floor to the 4th floor occurs, as explained with reference to FIG. 10 (a), one destination floor call from the 1st floor to the 3rd floor is assigned to Unit A. Unit B has not been assigned yet. Accordingly, the total value of the actual number of people assigned to Unit A is 1, and the total number of people assigned to Unit B is 0.

  When a destination floor call from the first floor to the fourth floor occurs, passengers from the first floor to the third floor are assigned to the No. A machine. Then, from Equation (2), the number of virtual allocations to Unit A is three. Only the destination floor call from the 1st floor to the 3rd floor is assigned to Unit A, so the total value of the virtually allocated number of people is also 3. In Unit B, no actual allocation occurs, so the virtual allocation number is zero. Also, the predicted number of people in the car is 0 as in the case of the destination floor call from the first floor to the third floor.

  At this time, the assignable elevator judging means 109 uses the equation (4) to assign the destination floor call from the first floor to the third floor, which cannot be assigned to the A machine and can be assigned to the B machine. judge.

  In the example described with reference to FIG. 9 and FIG. 10, an example using two elevators is handled, and therefore, the assigned car can be determined as the B car without calculating the assigned evaluation value.

  FIG. 12 is a diagram for explaining a specific example of the elevator assignment process in the elevator group management system according to the embodiment of the present invention as an example of the assignment process for three elevators.

  The example shown in FIG. 12 has three elevators of No. 1, No. 2, No. 3, and the estimated arrival time of each elevator is No. 1 for 18 seconds, No. 2 for 36 seconds and No. 3 for 15 seconds. It is supposed to be. For each elevator, one passenger from 1st floor to 7th floor is actually allocated to Unit 1, and the total value of the actual allocated number and the virtual allocated number is 3. No passengers are assigned, and 3 passengers from the 1st floor to the 5th floor are actually assigned to Unit 3, and the total value of the actual assigned number and the virtual assigned number is 8. . In addition, when a new destination floor call from the first floor to the sixth floor occurs, the predicted number of passengers at the destination floor call generation floor from the first floor to the sixth floor when assigned to each elevator is 6 for the first car, 2 Assume that Unit No. 12 and Unit No. 3 have five people.

  In the above situation, it is determined whether or not each elevator can be assigned to a new destination floor call from the first floor to the sixth floor. The total value of the predicted number of passengers at the new destination floor call generation floor when assigned to each elevator and the predicted number of passengers at the assigned destination floor call generation floor is 9 for Unit 1, 12 for 12, and 3 for Unit 3. Will be 13 people. Here, assuming that the car capacity is 12, the total value of Unit 3 is larger than the car capacity, so it is determined that assignment is impossible. In the embodiment of the present invention, a new destination floor call from the first floor to the sixth floor is assigned to the first machine with a short waiting time among the first and second machines that are determined to be assignable.

  As described above, the embodiment of the present invention can determine an assigned machine for a destination floor call that has occurred.

  According to the embodiment of the present invention described above, in order to estimate the number of passengers generated before the arrival of the elevator and perform the allocation evaluation, the passengers are appropriately selected in consideration of the predicted number of passengers in each destination floor. It is possible to divide and ride to elevators separately, especially when a specific floor is in high demand, it is possible to assign elevators dedicated to passengers going to that floor, and the number of elevator floors It can be reduced and the transportation capacity can be improved.

1 Group Management Control Unit 211-213 Unit Control Unit 221-223 Elevator 31-33 Destination Floor Registration Device 101 Destination Floor Call Information Management Means 102 Elevator Information Management Means 103 Date / Time Information Detection Means 104 Traffic Demand Data Accumulation Means 105 Arrival Prediction Time calculation means 106 Predicted traffic demand calculation means 107 Predicted passenger number calculation means for new destination floor call generation floor 108 Predicted passenger number calculation means for assigned destination floor call generation floor 109 Assignable elevator judgment means 110 Assignment evaluation value for assignable elevator Calculation means 111 Assigned elevator determining means 1081 Actual assigned number calculating means 1082 Virtual assigned number calculating means 1083 Predicted passenger count totaling means for assigned destination floor call generation floor

Claims (6)

A plurality of elevators that service a plurality of floors, and a destination floor registration device that is installed in the elevator hall and for a user to register a destination floor call, and is registered by the destination floor registration device. In the elevator group management system for assigning an elevator responding to the destination floor call from the plurality of elevators to the call,
When a destination floor call to which an elevator is not assigned is registered from the destination floor registration device,
First predicted passenger number calculating means for calculating a predicted number of passengers for the registered unassigned destination floor call for each elevator;
Second predicted passenger number calculating means for calculating the predicted number of passengers for the destination floor call assigned to the elevator for each elevator;
For each elevator, the total number of predicted passengers calculated by the first predicted passenger number calculating means and the predicted passenger number calculated by the second predicted passenger number calculating means is compared with the car capacity. Assignable elevator judging means for judging whether or not the elevator can be assigned;
An elevator group management system comprising: an assigned elevator determining means for determining an elevator to be assigned to the unassigned destination floor call from elevators determined to be assignable by the assignable elevator judging means. Predicted traffic demand calculating means for calculating the predicted number of passenger arrivals for the destination floor of the unassigned destination floor call, and arrival prediction for calculating the estimated arrival time of each elevator to the floor where the unassigned destination floor call is generated A time calculation means,
The first predicted passenger number calculating means is
The predicted number of passenger arrivals calculated by the predicted traffic demand calculating means for calculating the predicted number of passenger arrivals for the destination floor of the unassigned destination floor call, and the arrival of each elevator to the floor that generated the unassigned destination floor call 2. The elevator group management system according to claim 1, wherein a predicted number of passengers for the unassigned destination floor call is calculated based on the predicted arrival time calculated by the predicted arrival time calculating means for calculating the predicted time. It further comprises a traffic demand data storage means for storing past passenger occurrence history,
The predicted traffic demand calculation means includes:
The predicted number of passenger arrivals in a time zone in which the unassigned destination floor call occurs is calculated from the passenger occurrence history accumulated in the traffic demand data accumulation means for accumulating the past passenger occurrence history. Item 3. The elevator group management system according to Item 2. The second predicted passenger number calculating means is:
For each elevator, for the destination floor call assigned to that elevator, the actual assigned number calculating means for calculating the registered number of destination floor calls as the actual assigned number,
For each elevator, for a destination floor call assigned to the elevator, a virtual assigned number calculating means for calculating the number of passengers generated until the elevator arrives as a virtual assigned number,
Assigned destination floor for calculating the actual assigned number calculated by the actual assigned number calculating means and the total value of the virtual assigned number calculated by the virtual assigned number calculating means as the predicted number of passengers for the assigned destination floor call The elevator group management system according to claim 1, further comprising a predicted passenger count totaling unit on a call generation floor. Predicted traffic demand calculating means for calculating the predicted number of passenger arrivals for the destination floor of the unassigned destination floor call, and arrival prediction for calculating the estimated arrival time of each elevator to the floor where the unassigned destination floor call is generated A time calculation means,
The second predicted passenger number calculating means is:
The predicted number of passenger arrivals calculated by the predicted traffic demand calculating means for calculating the predicted number of passenger arrivals for the destination floor of the unassigned destination floor call, and the arrival of each elevator to the floor that generated the unassigned destination floor call The elevator group management system according to claim 1, wherein the predicted number of passengers for the assigned destination floor call is calculated based on the estimated arrival time calculated by the estimated arrival time calculating means for calculating the estimated time. A plurality of elevators that service a plurality of floors, and a destination floor registration device that is installed in the elevator hall and for a user to register a destination floor call, and is registered by the destination floor registration device. In the elevator group management method for allocating an elevator responding to the destination floor call to the call from the plurality of elevators,
When a destination floor call to which an elevator is not assigned is registered from the destination floor registration device,
For each elevator, calculate the predicted number of passengers for the registered unassigned destination floor call,
For each elevator, for each destination floor call assigned to that elevator, calculate the estimated number of passengers to each destination floor,
For each elevator, the estimated number of passengers for the unassigned destination floor call and the total number of predicted passengers for the assigned destination floor call are compared with the car capacity to determine whether the elevator can be assigned. And
An elevator group management method, comprising: determining an elevator to be assigned to the unassigned destination floor call from elevators that are determined to be assignable in the assignment determination.

Images