JP5082215B2 - Elevator group management apparatus and group management method - Google Patents

Description

  The present invention relates to improvements in an elevator group management apparatus and method.

  In a relatively large building, a plurality of elevators are installed in order to improve the passenger transportation capacity by elevators, and a system for selecting and servicing the optimum car at the time of call registration at the landing is introduced. As the scale of the building increases, the number of elevators installed will increase, and these multiple elevators will be appropriately controlled by a group management device to improve services such as reducing waiting time for users.

  As the building size increases, the number of stop floors for each elevator also increases, and the one-round operation time of the elevator, that is, the time it takes for the elevator to depart from the standard floor and return to the standard floor increases. Latency increases.

Therefore, a destination floor registration button is installed at the hall, and by specifying the elevator car to be boarded for each destination floor, a plan has been implemented to reduce the number of stops of each elevator car as much as possible and to shorten the one lap operation time. However, it was particularly effective during up-peak hours when going to work and was able to greatly improve transportation capacity. Further, if the number of call assignments on the destination floor that each elevator car can have is limited, further effects can be obtained.
Japanese Patent No. 2573715

  However, in situations such as when there is a quiet period, even if it is more appropriate to assign a call to the first-arrival elevator, there is a case where a call is assigned to another elevator. There was a problem that the waiting time of the elevator was long.

The present invention is an elevator that includes a destination floor registration means at an arbitrary landing, and places a plurality of elevator cars in service with respect to a plurality of service floors.
1. A non-occurrence interval of a landing destination floor call for a time traced back a predetermined time from the present time, detection means for detecting the number of times the landing destination floor call is registered, and dividing the frequency by the non-occurrence interval. A calculation means for calculating a predicted waiting time occurrence rate, and a waiting number of people at the landing destination floor call is predicted from the predicted waiting time occurrence rate before the elevator car arrives at the floor provided with the destination floor registration means. Predicting means, and means for restricting destination floor hall call allocation based on the number of passengers.
2. Predicted waiting time is generated by dividing the number of occurrences of landing destination floor calls that have been traced back a predetermined time from the present time and the number of registrations of the landing destination floor calls by the non-occurrence intervals. The number of waiting passengers is predicted for the landing destination floor call before the elevator car arrives at the floor equipped with the destination floor registration means, and a newly generated landing call is calculated from the predicted number of passengers. The maximum number of people in the predicted car during the elevator operation in the case of temporary assignment is obtained, and the assignment candidate cars are narrowed down based on this .
It is also of the.

  In the present invention, the switching between the allocation method close to the group management for normal up / down buttons that can be sequentially boarded in the elevator that arrives, or the allocation method that distributes the boarding machines according to the destination floor specific destination floor call, It is done automatically and promptly according to the traffic situation. The car is also such that extremely smooth acceleration / deceleration is performed like an automobile having a continuously variable automatic transmission. The user is hardly aware of this switching operation.

The present invention first obtains a predicted waiting rate from the number of times a destination floor call is not generated and the number of destination floor calls registered for 5 minutes retroactively from the present, and an elevator car arrives assigned to the currently generated destination floor call. Predict how many waiters will occur until Then, when the newly generated hall call is temporarily allocated from the predicted number of persons, the maximum number of persons in the predicted car during the elevator operation is obtained, and the call is limited based on this.

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is an overall view showing an example of an internal functional configuration of an elevator group management apparatus according to the present invention, FIG. 2 is a flowchart showing an overall procedure processed by the group management apparatus in FIG. 1, and FIG. FIG. 4 is a flowchart showing the processing procedure upon arrival of the assigned elevator car, FIG. 5 is a flowchart showing the waiting rate calculation procedure, and FIG. 6 is a calculation procedure for the predicted number of passengers N _ijk . FIG.

  In the figure, reference numeral 10 denotes a group management apparatus according to the present invention, which includes an allocation determination unit 11, an allocation candidate machine selection unit 12, a data storage unit 20, and an input / output interface 13. Here, the data storage unit 20 stores various data necessary for elevator group management, such as past data, current data, and predicted data. This data is classified into raw data 21 and calculation processing data 22, and “raw data” is a special calculation such as “current position of elevator”, “currently registered car call”, “currently registered hall call”, etc. Data that does not require processing. On the other hand, “calculation processing data” is data that has been subjected to some calculation processing using “raw data”, and includes, for example, “elevator arrival prediction time”, “no landing call occurrence interval”, and the like. This “calculation processing data” is processed and accumulated by the constant interval loop data processing unit 23 and the event occurrence data processing unit 24.

  In this constant interval loop data processing unit 23, the calculation process is performed at regular intervals (for example, 1 minute, 5 minutes, etc.). After the calculation processing in this part, data is accumulated. Further, the event occurrence data processing unit 24, for example, when an event occurs such as “a new landing call is registered”, “an elevator car has arrived at the corresponding floor”, or “a car call is registered” ( In other words, it is a portion that is calculated when a signal is received. In the present invention, the processing in FIGS. 3, 4, and 5 is processed in this portion, and then data is accumulated.

  Next, the allocation candidate number selecting unit 12 is a part that, when receiving a “calling hall registration signal”, excludes numbers that are inappropriate for allocating this hall call and narrows down the number of candidate allocation numbers. Data necessary for this determination is received from the “data storage unit” 20 and processing is performed based on this data. The assignment determination unit 11 is a part that determines the final assignment number by applying an evaluation formula (for example, fuzzy rule or neural network) to the “assignment candidate number” sent from the assignment candidate number selection unit 12. 30 is a hall call button for designating a destination floor of an arbitrary hall, and 40 is an operation control device for each elevator. Finally, the input / output interface 13 performs appropriate signal transmission / reception with the hall call button 30, the operation control device 40 of each unit, and each part within the elevator group management device 10.

That is, as shown in FIG. 7, the values necessary for calculating the waiting rate are recorded for each floor where the destination floor hall call registration device is installed. When the destination floor hall call to the j-th floor is pushed at the floor i, 1 is added to the counter C _ij . Since the destination floor j is already registered at this time, the person who goes from the floor i to the jth floor does not press the already-registered destination floor registration hall call button 30, and the floors i to j Observation of waiting customers going to the floor becomes impossible. This waiting time occurrence unobservable start time t _ij is stored as the current time. As soon as the assigned elevator arrives and the hall call registration from the i-th floor to the j-th floor is possible (the waiting time for observing waiting for customers is over), as shown in FIG. The occurrence of customers can be observed, and the waiting time occurrence observable time T _ij going from the i-th floor to the j-th floor is calculated as T _ij = current time-t _ij . Then, the waiting time occurrence observable time T _ij is added, and as shown in FIG. 4, the waiting time occurrence observable total time ST _ij for the past 5 minutes is updated. In another process, for example, at every destination floor hall call registration floor i every 5 minutes, the waiting rate A _ij (person / second) from the i-th floor to the j-th floor is updated for the past 5 minutes from the following formula. Go. This is illustrated in FIG.
A _ij = C _ij / (300−ST _ij )
Here, the denominator of the above equation means the non-occurrence interval of the destination floor calls i and j.

Next, a procedure for assigning a destination floor call on the i-th floor will be described with reference to FIG. First, when a new hall call is generated in Step 1, the predicted number of passengers N _ijk is calculated in the k-th unit as follows on all floors to which a destination floor call has already been assigned. As can be seen from FIG. 6, in step 2, this calculation is performed for all the cars.
N _ijk = A _ij * (at _ijk −rt _ij )
Here, i is the floor where the hall call is registered, j is the destination floor, and k is the elevator car assigned to the destination floor call.
N _ijk the number of people boarded prediction in the waiting passengers of the assigned elevator k Unit upon arrival to go to j floor from i floor, a _ijk elevator k Unit to arrive to the destination floor j floor of the hall call has been assigned in the occurrence floor i floor The predicted time, rt _ij, is the time when the destination floor hall call from the i-th floor to the j-th floor is registered. At _ijk is calculated by a well-known method, extracted from “calculation processing data” 22, and rt _ij may be extracted from the data storage unit 20.

Next, referring to FIG. 8, temporary allocation is made to the elevator that focuses on the new hall call, and at the same time, “the car call you currently have”, “the floor with the destination floor hall call that has already been assigned (hereinafter, Record the change in the number of passengers in the elevator car with N _ijk while virtually moving the elevator while considering the “calling hall of the DFGS floor”) and operating passengers on the planned stoppage floor To do. And determining the maximum value MAXN _k of the number of passengers in the elevator car at the end of the operation. Here, for the sake of simplicity, it is assumed that the boarding is performed only on the DFGS floor and the getting off is performed on the destination floor of the customer.

In step 3, elevators that meet the following conditions are excluded from “assignment candidate cars”.
MAXN _k ≧ limit value This limit value is (elevator capacity) * (constant obtained empirically (for example, 0.6))
Do this for all cars.
In Step 4, when the “assignment candidate number” becomes 0, the limit value is relaxed (that is, 1 is added to the limit value), and the above condition is applied again. This operation is performed until an “assigned number” is found. Finally, a well-known “assignment evaluation formula” (for example, using a fuzzy rule or a neural network) is calculated only for “assignment candidate cars”, and the elevator with the highest evaluation is assigned.

  By the way, according to Japanese Patent Laid-Open Nos. 59-177266, 52-131343 and 57-16067, even if an elevator car assigned with a hall call arrives at the floor, There are proposals for avoiding the situation where all people are not able to get on, but it does not take into account the non-occurrence intervals of destination floor calls as in the present invention, There is nothing to deal with in all traffic situations, such as when the sky is off.

  In the above description, the prediction calculation is empirically performed based on the past data for 5 minutes, but it can be made longer or shorter depending on the situation and conditions at the site.

1 is an overall view showing an example of an internal functional configuration of an elevator group management device according to the present invention. It is a flowchart figure which shows the whole procedure which a group management apparatus processes in FIG. It is a flowchart figure which shows the process sequence at the time of arrival of an allocation elevator car. It is a flowchart figure which shows the process sequence at the time of arrival of an allocation elevator car. It is a flowchart figure which shows the calculation procedure of a waiting customer incidence rate. It is a flowchart showing a calculation procedure of the prediction boarding number N _ijk. It is a figure which shows the measurement condition of the value required for calculation of a waiting customer incidence. It is a figure which shows the calculation method of the maximum number of people in a prediction cage | basket | car.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Elevator group management apparatus 11 Assignment judgment part 12 Assignment candidate number machine selection part 20 Data storage part 23 Fixed interval loop calculation processing part 24 Event generation data processing part 30 Destination floor hall call button

Claims (3)

Arbitrary halls are equipped with destination floor registration means, and in the elevators where multiple elevator cars are put into service for multiple service floors, the landing destination floor call non-occurrence interval for a time that has been traced back in the past for a predetermined time from the present Detecting means for detecting the number of times the landing destination floor call has been registered; calculating means for calculating a predicted waiting time occurrence rate by dividing the number of times by the non-occurrence interval; and an elevator car as the destination floor registration means And predicting means for predicting the number of waiting passengers in the landing destination floor call from the predicted waiting-to-occurrence rate before arriving at the floor provided with a destination floor landing call allocation restriction based on the waiting passenger number An elevator group management device comprising means. The elevator group management device according to claim 1, wherein the predetermined time is about 5 minutes. Arbitrary halls are equipped with destination floor registration means, and in the elevators where multiple elevator cars are put into service for multiple service floors, the landing destination floor call non-occurrence interval for a time that has been traced back in the past for a predetermined time from the present And the number of times the landing destination floor call has been registered, to divide the number of times by the non-occurrence interval to obtain a predicted waiting time occurrence rate until the elevator car arrives at the floor equipped with the destination floor registration means The number of waiting passengers is predicted for the landing destination floor call during this period, and the predicted maximum number of passengers in the elevator operation when the newly generated landing call is provisionally assigned is calculated from this predicted number. A group management method for elevators characterized by narrowing down the allocation candidate cars.

Images