JP3452738B2 - Elevator operation management device - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to elevator operation control, and more particularly to an operation management device that predicts the occurrence of hall calls and operates an elevator efficiently.

[0002]

2. Description of the Related Art As a conventional technique of this kind, Japanese Patent Laid-Open No.
In Japanese Patent Publication No. 2434, there is an elevator for a private house in which the waiting time at the landing is shortened by running the elevator in advance in response to landing calls that occur regularly.

Further, in Japanese Patent Laid-Open No. 4-139831,
There is a method of predicting future changes in traffic flow using data that captures the characteristics of changes in traffic demand over time, and controlling dispatch to the predicted congestion floor.

[0004]

According to the above prior art, it becomes possible to learn a hall call, a car call, or a traffic flow and to make a prediction based on the learning result, and to move an elevator to a floor where a hall call is predicted to occur. Move it in advance,
By waiting, the convenience can be improved by shortening the waiting time.

However, in Japanese Patent Laid-Open No. 7-2434, since the waiting floor is decided and waiting only by the time data, the waiting floor is fixed to a certain floor within a certain time zone. For this reason, after the hall call actually occurs on the meeting floor and the service is completed, the meeting has succeeded, so even though the meeting floor may be changed to another floor, the predicted hall call Even after the service is completed, it moves to the same waiting floor as the previous time and waits again, so that unnecessary waiting for waiting occurs and the optimum waiting floor cannot be determined.

[0006] In Japanese Patent Laid-Open No. Hei 4-133981, it is possible to preliminarily allocate an elevator to a floor where congestion is expected by comparing the past learning results with the current traffic demand. In low off hours, the frequency of hall calls and the floors on which they occur are mixed, and the probability that hall calls will actually occur on the congested floors is not so high even if the crowded floors are statistically calculated. Not valid.

The object of the present invention is to improve these points, consider the frequency of occurrence of hall calls, the distribution rate of occurrence, etc., and exclude the hall call occurrence predicted floor for which waiting has been successful from the target of waiting floor selection. By calculating different waiting floors and efficiently waiting for elevators to wait,
The aim is to reduce waiting time and improve service to users.

[0008]

The present invention adopts the following means in order to solve the above problems.

Learning means for learning the hall call generation time and hall call floor, a waiting instruction means for determining the waiting time and the waiting floor based on the learning result from the learning means, and outputting a waiting instruction, and the waiting instruction. In the elevator operation management device having an operation means for operating an elevator according to, the meeting instruction means determines a meeting time and meeting floor based on the learning result from the learning means, and a plurality of meeting requests. A queuing request creating means for creating a queuing request order, a queuing state recording means for detecting and recording the presence or absence of a hall call at the queuing request floor and waiting at the queuing floor, the queuing request creating means and the queuing state Created by recording means When a hall call is generated on the meeting floor, it is excluded from the meeting on the meeting floor and a new meeting floor is determined when the meeting command creating means for creating a meeting command is created based on the meeting request data Then, the waiting command is output.

Further, the queuing command creating means excludes, based on the queuing request data, the queuing floor in which the hall call has been generated at the queuing request floor, and each queuing time for the plurality of queuing requests and the present time. The waiting floor is determined according to a priority value calculated by a difference from the time, a priority set based on the waiting request rank, and a priority set when waiting at the waiting floor. .

Further, the priority set during the waiting at the waiting floor is set to a value higher than the priority set based on the waiting request order.

[0012]

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION An embodiment of the present invention will be described below with reference to FIGS. FIG. 1 is an overall configuration diagram showing an elevator operation management device.

In the figure, 101 to 10n are hall call buttons, 3 is a motor, 4 is a hoist, 5 is a car, and 51 is a car.
A car call button, 2 is an elevator control device, 21 is an operation control unit, 22 is a clock, 23 is a learning unit, 231 is a learning recording unit that learns hall calls and car calls and records them in a learning table, and 232 is a learning table. Reference numeral 233 is an operation mode detection unit that learns hall calls and car calls to detect and record operation modes, 234 is an operation mode table, 24 is a waiting instruction means, and 241 is based on the data of the learning table and the operation mode table. A waiting request creating unit for creating a waiting request table, 24
2 is a waiting request table, 243 is an operation control unit 21
The waiting state recording unit 244 that detects the presence or absence of a hall call on the waiting request floor or the waiting request floor and records it in the waiting request table determines the optimum waiting floor based on the waiting request data in the waiting request table 242. A queuing command creating unit 245 for outputting the queuing command to the queuing floor table is a queuing floor table.

When the hall call buttons 101 to 10n or the car call button 51 is pressed, the information is sent to the operation control section 21 in the elevator control device 2 to drive the hoisting machine 4 and call the car 5 to call. Move to the floor and service the users.

At the same time, hall call buttons 101 to 10n
The information from is also sent to the learning unit 23, and the learning recording unit 23
1 reads out the hall call occurrence time from the clock 22 and writes the learning result in the learning table 232. Further, the information of the hall call buttons 101 to 10n is also sent to the operation mode detection unit 233, and the hall call occurrence frequency, occurrence time,
The operation mode of the day is detected from the day of the week data and the like, and is written in the operation mode table 234. This operation mode is holiday mode, rainy weather mode, etc., and the learning table is changed (learning table for rainy days, learning table for holidays, etc.) and meeting request data depending on the situation of hall calls that change depending on the day of the week and the weather. Used as a signal to switch the learning table used to create the.

The queuing request creating unit 241 determines the time interval of hall call occurrence based on the data of the learning table 232 and the operation mode table 234, predicts the queuing time and the queuing floor, and the queuing request table 24.
Write to 2.

The queuing state recording section 243 stores the position information of the car from the clock 22 and the operation control section 21,
The queuing control state is detected based on the car call and hall call generation information, and is written in the queuing request table 242.

The queuing command creating section 244 uses the queuing request data in the queuing request table 242 and the clock 2
Based on 2, the floor with the highest possibility of a hall call at that time is determined as the meeting floor and is written in the meeting floor table 245.

The data written in the meeting floor table 245 has no information from the hall call buttons 101 to 10n and no information from the car call button 51, that is, when there is no service call, the operation control unit 2
The car 5 is moved to the floor read by 1 and written in the waiting floor table 245 to wait for the waiting.

Next, the contents of the waiting request table 242 created by the waiting request creating unit 241 and the waiting state recording unit 243 will be described with reference to FIG.

As shown in the figure, the waiting request table 242 has a waiting time 242-A, a waiting waiting movement direction 242-B, a waiting request floor 242-C, a waiting condition 242-D, a waiting request priority 242-E,
The waiting control state 242-F is configured.

As described above, the meeting floor table 24
2, the waiting time 242-A, the waiting direction 242-B, the waiting request floor 242-C, the waiting condition 242-D, and the waiting request priority 242-E are created by the waiting request creating unit 241 and the waiting control status is set. 242-F is created by the waiting state recording unit 243.

The waiting condition 242-D is a table for setting the state of the elevator during waiting for waiting.
If 1 is set in the 2-G bit, the door is kept open and the door is kept closed if it is not set.

The waiting request order 242-E is decided in four steps from the data in the learning table 232 based on the probability of hall call occurrence. In this embodiment, it is composed of 4 bits of 242-H, I, J, and K, and if the bit of 242-K is set to 1, the first waiting floor, 24
If the bit of 2-J is set to 1, the second waiting floor is set. If the bit of 242-I is set to 1, the third waiting floor is set. If the bit of 242-H is set to 1, it is distributed. Indicates the waiting floor. Here, the first queuing floor means queuing request data having a hall call occurrence probability value of 80% or more at the queuing requesting floor at the queuing time, or variation in hall call occurrence within one minute. The second queuing floor means queuing request data in which the probability of hall call occurrence is 60% or more at the queuing request floor at the queuing time, or the variation in hall call occurrence is within 2 minutes. What is the third meeting floor?
This means waiting request data in which the probability of hall call occurrence is 40% or more at the meeting request floor at the meeting time, or the variation in hall call occurrence is within 3 minutes.
The distributed waiting floor means a crowded waiting floor, and the floor where the most hall calls occur in the current time zone is set.

The waiting control state 242-F is data for deciding whether or not to be considered as a candidate for the waiting floor in order to finally determine which floor the waiting floor is to be determined in the waiting command creating section 244. Is a table for recording. 242-L is a bit that records whether or not to be excluded from the meeting floor candidates. This bit is used when the meeting is successful, that is, when a hall call is generated on the floor while waiting for the meeting, or when the meeting request is made at the meeting time. When a hall call occurs on the floor, that is, when the hall call is not waiting for the meeting, but as expected, when the hall call occurs on the meeting request floor, 1
Is set. If this bit is set to 1, it is not processed as a waiting floor candidate. 242-M is a bit for setting whether or not the waiting floor has been waited. Setting 1 in this bit means that the waiting floor can be waited as requested. Also, 242-N is a bit for setting whether or not the user is moving to the waiting floor, and 1 is set when the user is moving to the waiting floor in response to the waiting request.

As an example, the waiting request table 24
Explaining the contents of 2, the waiting request data 242-1 stands by in the door open state at the fourth floor DOWN direction at 6:28, and since it is the first waiting floor, the probability that a hall call will occur at 6:28 Is 80% or more, or the distribution of occurrence of hall calls is within 1 minute.

Next, the processing procedure in the waiting state recording unit 243 will be described with reference to the flowchart of FIG.

First, in step S10, data is read from the waiting request table 242. Then step S
In 11, the waiting time 242-A of the data read in step S10 is compared with the current time to determine whether the difference is within 1 minute. If they are separated by 1 minute or more, the process proceeds to step S18 to move to the next waiting request data. If it is within one minute, it is determined in step S12 whether the car call or the hall call is currently being serviced. If the hall call or the car call is being serviced, the step S12 is performed.
Proceed to 13. In step S13, it is determined whether or not there is a hall call on the meeting request floor, and if there is a hall call on the meeting request floor, step S1
4, the waiting object exclusion flag 1 is set to the bit 242-L of the waiting control state 242-F of the waiting request table 242. This is set so that when a hall call occurs on the floor for which a meeting request has been made, there is no need to wait for a meeting at the meeting request floor, so it is excluded from the meeting targets. If it is determined in step S12 that both the car call and the hall call are not held, the process proceeds to step S15, and it is determined whether or not the relevant car is on the meeting request floor. If the passenger's car is on the meeting request floor, it is determined that the meeting waiting is on the meeting floor, and step S1 is performed.
6, the waiting queue waiting flag 1 is set in the bit 242-M of the waiting control state 242-F of the waiting request table 242. If there is no elevator on the waiting floor, the process proceeds to step S17, and the waiting floor moving flag 1 is set in the 242-N bit of the waiting control state 242-F of the waiting request table 242.
Set.

In step S18, steps S10 to S17 are repeated until the processing of all the data in the waiting request table is completed.

Next, the processing procedure in the waiting instruction creating section 244 will be described with reference to the flowchart of FIG.

First, in step S21, the loop counter i, the waiting request data number G, and the maximum waiting priority value memory FMAX are initialized. Step S
At 22, the loop counter i is incremented by 1.
Next, in step S23, the waiting request table 242
The i-th data is read. In step S24, the difference between the waiting time 242-A of the waiting request table 242 and the current time is calculated and recorded in Δt. In step S25, it is determined whether the difference Δt calculated in step S24 is within 3 minutes. If it is within 3 minutes, proceed to Step S26. If it is 3 minutes or more, Step S42.
Then, the process proceeds to the next waiting request data. In step S26, it is determined whether or not the queuing target exclusion flag 1 is set in 242-L of the queuing control state 242-F. If the flag 1 is set, it is not necessary to handle it as the target of the queuing request. Then, the process proceeds to the next waiting request data.

In step S27, the waiting control state 2
It is determined whether or not the waiting floor waiting flag 1 is set at 242-M of 42-F. If the waiting floor waiting flag 1 is set, the process proceeds to step S28 and the priority P is set.
Set to 0.8. The reason why the priority is set high here is that if you are waiting on the waiting floor, you can set the priority to be high so that the elevator that has been waiting for the waiting will not move easily from the waiting floor to other floors. It is intended to prevent the waiting floor from changing unnecessarily.

Next, in step S29, it is determined from the waiting request rank 242-E of the waiting request table 242 whether it is the first waiting floor, and if it is the first waiting floor, the process proceeds to step S33 and the priority P is set. 0.6
Set. Similarly, steps S30, S31, S32
Then, it is judged from the waiting request order 242-E whether it is the second waiting floor, the third waiting floor, or the distributed waiting floor, and the priority P corresponding to each is determined in steps S34, S35,
Set in S36 and S37. By setting the priorities in this way, it is possible to give the priorities suited to the hall call occurrence probability and the occurrence distribution rate.

In this embodiment, the priority P is given as a numerical value, but it goes without saying that it may be given as a mathematical expression.

Next, in step S38, the waiting priority value is calculated using the priority P set in steps S28 and S33 to S37 and the difference Δt between the waiting time and the current time. From step S39 to step S41, the maximum value of the waiting priority value calculated for each data of the waiting request table and the waiting request data number at that time are recorded. In step S42, step S
The processing from 22 to step S41 is repeated until the processing of all the data in the waiting request table 242 is completed. Finally, in step S43, the waiting request table 242 in which the waiting priority value calculated in step S38 becomes maximum (FMAX) is reached. Meeting request floor 242-C, meeting waiting direction 242-B, and waiting condition 24
2-D is set on the meeting floor table 245. When data is set in the waiting floor table 245, when there are no calls to be serviced by the operation control unit 21, the car is moved to the floor set in the waiting floor table 245 to make it wait.

Next, an example of the transition state of the waiting floor data when the elevator operation management system of this embodiment is implemented will be described with reference to FIG.

In the figure, HR1 to HR6 indicate waiting request data set in the waiting request table 242. The height of the bar of each meeting request data represents the meeting request rank of the meeting floor, HR1 and HR4 are the first meeting floor, HR2 and HR5 are the second meeting floor,
HR3 and HR6 indicate the third meeting floor. RHC1,
RHC2 and RHC3 indicate hall calls actually generated.

At the present time P1, the waiting request data to be selected for the waiting floor is the waiting request data within 3 minutes before and after the time P1.
Three of HR1, HR2, and HR3 are candidates for the meeting floor. Waiting request data H on the 4th floor at the time of P1
The calculated waiting priority value of R1 is waiting request data HR2 on the seventh floor and waiting request data HR3 on the fifth floor.
Is larger than the calculated waiting priority value of, the fourth floor is set as the waiting floor.

Next, when the fourth floor hall call RHC1 occurs at the current time P2, the waiting request data H
R1 is determined to have been successfully waited, and the wait request data HR1 is excluded from the wait request targets.
When the waiting request data HR1 is excluded, the waiting request HR2 on the 7th floor having the next largest waiting priority value is selected as the waiting floor, and the waiting floor is set to the 7th floor.

Next, when the current time P3 is reached, the waiting request data to be selected for the waiting floor is P3.
It is waiting request data within 3 minutes before and after the time point,
There are HR1, HR2, HR3, HR4, HR5 and HR6. However, the waiting request data HR1 and HR2 are excluded from the targets for the waiting floor selection because the hall call occurs within 1 minute before and after the waiting time. Here, the hall call RHC3 is also generated on the fifth floor, but since it is not a call generated within one minute before and after the waiting time of the waiting request data HR3, the waiting request data HR3 is included in the waiting floor selection target. Therefore, the waiting request data to be selected for the waiting floor at the time of P3 is HR3, HR4, HR5, HR6.
Becomes As a result of calculating the waiting priority value for each of the four waiting request data, if the waiting priority value of the waiting request data HR4 becomes larger than the waiting priority value of the waiting request data HR3, the waiting floor is changed from the previous three floors. The car will be changed to the 7th floor and the car will move to the 7th floor to meet.

In the present embodiment, the time limits (1 minute and 3 minutes, respectively) used in the queuing state recording section and the queuing command creating section are fixed values. It is also possible to change it based on the probability of occurrence of calls and the distribution of occurrence. Further, the operation mode data, learning data, queuing request data, queuing floor data, etc. in the present embodiment are set by being automatically judged from the occurrence status of hall calls, etc., but from a personal computer or a monitoring device provided externally. It goes without saying that it can be set by receiving data.

As described above, in the present embodiment, the waiting instruction creating unit 244 uses the waiting request table 2
From 42, at each time, a waiting floor candidate that is the target of waiting floor selection within a predetermined time width is selected, and waiting floor candidates that have detected a hall call on the waiting floor or the waiting floor are excluded from them. Among the remaining waiting floor candidates, the waiting floor with the highest priority value is determined as a result of the calculation of the priority value. Therefore, the waiting floor where the hall call is detected on the waiting floor or the waiting floor is not selected again as the waiting floor, so that wasteful operation can be prevented and the optimum waiting floor can be set.

[0044]

As described above, according to the present invention, the waiting floor is adjusted according to the actual situation of the hall call, so that the elevator is moved to the floor where the waiting has been successful and the waiting is finished. Can be prevented
As a result, since the elevator can be operated efficiently, the waiting time can be shortened and the service to users can be improved.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram of an elevator operation management device according to an embodiment of the present invention.

FIG. 2 is a waiting request table created by a waiting request creating unit and a waiting state recording unit according to the present embodiment.

FIG. 3 is a flowchart showing a processing procedure of a waiting state recording unit according to the present embodiment.

FIG. 4 is a flowchart showing a processing procedure of a waiting instruction creating unit according to the present embodiment.

FIG. 5 is a diagram for explaining transition of waiting floor data when the present embodiment is implemented.

[Explanation of symbols]

101-10n Hall call button 2 Elevator control device 3 motor 4 hoisting machine 5 car 51 basket call button 21 Operation control unit 22 clock 23 Learning Department 231 Learning Record Unit 232 learning table 233 Operation mode detector 234 Operation mode table 24 Waiting command section 241 Meeting request creation unit 242 Waiting request table 242-A Meeting time 242-B Car moving direction 242-C Meeting request floor 242-D Standby condition 242-E Waiting request order 242-F Waiting control status 243 Waiting state recording unit 244 Waiting instruction preparation section 245 meeting table

─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Toshimitsu Tobita 1070 Ichige, Hitachinaka City, Ibaraki Prefecture Hitachi Ltd. Mito Plant (56) Reference JP-A-7-2434 (JP, A) JP-A-57- 199768 (JP, A) (58) Fields surveyed (Int.Cl. ⁷ , DB name) B66B 1/00-3/02

Claims (3)

(57) [Claims] 1. A learning means for learning a hall call occurrence time and a hall call floor, and a wait command means for determining a wait time and a wait floor based on a learning result from the learning means and outputting a wait command. In an elevator operation management device comprising an operating means for operating an elevator according to a waiting instruction, the waiting instruction means determines a waiting time and a waiting floor based on the learning result from the learning means, and a plurality of waiting times. A waiting request creating means for creating a waiting request order for a request, a waiting state recording means for detecting and recording the presence or absence of a hall call on the waiting request floor and waiting on the waiting floor, the waiting request creating means and the By the waiting state recording means It is equipped with queuing command creation means that creates queuing commands based on the queuing request data that is created, and when a hall call is detected on the queuing floor, the queuing at the queuing floor is excluded and a new queuing floor is created. The elevator operation management device characterized by determining the above and outputting a waiting command. 2. The waiting command generating means according to claim 1, excluding a waiting floor at which the hall call is detected at the waiting request floor, based on the waiting request data, for the plurality of waiting requests. The waiting floor is determined according to the priority value calculated by the difference between each waiting time and the current time, the priority set based on the waiting request order, and the priority set when waiting at the waiting floor. An elevator operation management device characterized in that 3. The elevator according to claim 2, wherein the priority set during standby on the waiting floor is set to a value higher than the priority set based on the waiting request order. Operation management device.