Elevator group control service distribution method and system based on predictive long-waiting call

Abstract

The invention discloses an elevator group control service distribution method and system based on predictive long-waiting calling. When a new call outside the hall is generated, the predicted long-waiting call outside the hall is determined according to the current running state of each elevator in the group without depending on historical data. And comprehensive waiting time is obtained by calculating the waiting time of each elevator responding to the new call and the predicted long waiting call, and the elevator service new call with the shortest comprehensive waiting time is selected. The method does not depend on historical data, prediction is carried out only according to the real-time running state of the elevator, prediction errors caused by inaccurate or incomplete historical data are avoided, and higher flexibility and adaptability are achieved; the influence of new calling and potential long-waiting calling is comprehensively considered, the overall waiting time of passengers is effectively shortened, and the operation efficiency of the elevator group control system is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of elevator control, and particularly relates to an elevator group control service allocation method and system based on predicting long waiting calls. Background Art

[0002] The elevator group control system is an indispensable part of modern high-rise buildings, and its core goal is to reduce the passenger waiting time and elevator operation energy consumption through reasonable scheduling strategies. The existing elevator group control systems mostly perform scheduling based on historical data or fixed rules.

[0003] For example, the Chinese patent with the publication number CN110980456A proposes an elevator group control scheduling method based on traffic flow and adaptive neuro-fuzzy inference, which identifies the traffic flow pattern of the elevator and determines the local index and different weights of the elevator group control according to the total passenger flow of the elevator within a specified time period and the maximum load passenger flow of the elevator within the specified time period. However, this method highly depends on the accuracy and integrity of historical data. For newly put into use elevator systems or scenarios with significant changes in usage patterns, the prediction accuracy will be greatly reduced, and the data processing cost is relatively high.

[0004] In addition, the Chinese patent with the publication number CN1207716A proposes using fuzzy logic to divide the car load and interval into fuzzy sets, and estimating the passenger flow and passenger flow rate in the hall with fuzzy logic to control the elevator scheduling for a single source of passenger flow. However, it only makes decisions based on the current real-time state and lacks the ability to predict long waiting calls that may occur in the future. In the peak period of elevator use or complex traffic patterns, it is easy to cause some passengers to wait too long and cannot achieve the optimal allocation of elevator resources.

[0005] The Chinese patent with the publication number CN118458529A avoids the initial allocation being exceeded by additional allocating elevators, but it depends on fixed thresholds (ΔT1, ΔT2) and only solves local scheduling conflicts.

[0006] Therefore, there is an urgent need to propose an elevator group control service allocation method and system based on predicting long waiting calls that does not rely on historical data. Summary of the Invention

[0007] To solve the defects existing in the prior art, the present invention provides an elevator group control service allocation method and system based on predicting long waiting calls. When a new out-of-car call is generated, it can combine the predicted long waiting out-of-car calls and select the elevator with the shortest comprehensive waiting time to serve this new call, improving the operation efficiency of the elevator group control system and reducing the average waiting time of passengers.

[0008] To solve the above technical problems, the present invention provides the following technical solutions: The present invention provides an elevator group control service allocation method based on predicting long waiting calls, comprising the following steps: Step 1: When a new hall call is generated, based on the real-time operating states of the elevators in the group, a predicted long waiting hall call associated with the new hall call is dynamically generated, and the predicted long waiting hall call satisfies the following conditions: The direction is the same as the subsequent running direction of a certain elevator after assuming it responds to the new call; The floor is the adjacent floor behind the subsequent running direction and is not covered by the current tasks of the elevator; Step 2: Calculate the comprehensive waiting time of each elevator in the group, and its value is obtained through the following formula: T 综合 = α∙T 新召唤 + β∙min(T 预测召唤 ) where α and β are weight coefficients (α + β = 1), T 新召唤 is the waiting time for the elevator to respond to the new call, and min(T 预测召唤 ) is the minimum waiting time for other elevators in the group to respond to the predicted long waiting call; Step 3: Select the elevator with the shortest comprehensive waiting time to serve the new call.

[0009] Preferably, the generation of the predicted long waiting hall call in Step 1 includes: Traverse each elevator in the group, simulate its running path after responding to the new call, generate alternative calls, the floors of which are the adjacent floors behind the running path, and the directions are the subsequent running directions after responding to the new call; Calculate the associated waiting time of each alternative call, which is defined as the minimum waiting time for all elevators in the group to respond to this alternative call; Select the alternative call with the maximum associated waiting time as the final predicted long waiting call.

[0010] Preferably, the values of the weight coefficients α and β in Step 2 are dynamically adjusted according to the real-time passenger flow density: When the passenger flow density is higher than the preset threshold, let α > β, and give priority to responding to the new call; When the passenger flow density is lower than the preset threshold, let α < β, and give priority to reducing the long waiting risk.

[0011] The present invention also provides an elevator group control system based on predicting long waiting calls, comprising a group control device, an elevator control device, and an elevator external call device, and the group control device includes: A call monitoring module for monitoring new hall calls; A predicted long waiting call determination module for generating predicted long waiting hall calls in real time according to the subsequent running direction of the elevator and the logic of the adjacent floors in the reverse direction; The comprehensive waiting time calculation module dynamically calculates the comprehensive waiting time and supports adaptive adjustment of the weight coefficient; The elevator selection module is used to select the elevator with the shortest comprehensive waiting time to serve the new outside-hall call.

[0012] Compared with the prior art, the present invention has the following beneficial effects: The present invention does not rely on historical data and only makes predictions based on the real-time operating status of the elevator. It can quickly adapt to various different elevator usage scenarios, avoiding prediction errors caused by inaccurate or incomplete historical data, and has stronger flexibility and adaptability. By predicting long-waiting outside-hall calls and incorporating them into the elevator allocation decision-making, the impacts of new calls and potential long-waiting calls are comprehensively considered, realizing more optimized allocation of elevator resources, effectively reducing the overall waiting time of passengers, and improving the operating efficiency of the elevator group control system. Brief Description of the Drawings

[0013] Figure 1 is a schematic flowchart of a method for allocating elevator group control services based on predicting long-waiting calls of the present invention; Figure 2 is a system structure diagram of an elevator group control system based on predicting long-waiting calls of the present invention; Figure 3 is a schematic diagram of an example in a method for allocating elevator group control services based on predicting long-waiting calls of the present invention. Detailed Embodiments

[0014] The following describes the preferred embodiments of the present invention with reference to the accompanying drawings. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present invention and are not used to limit the present invention.

[0015] Embodiment 1 Please refer to Figure 3 As shown, assume that a building has 16 floors with a height of 3 meters per floor. There are 3 elevators in the elevator group, namely A, B, and C, with a rated speed of 2 m / s. The elevator stops at each floor for 7 seconds (including 4 seconds for door opening and closing and 3 seconds for passengers to get on and off). The current status of each elevator is as follows: Elevator A is located on the 2nd floor and is running upward, with instructions for the 3rd and 4th floors registered in the car.

[0016] Elevator B is located on the 5th floor and is running upward, with instructions for the 9th floor registered in the car.

[0017] Elevator C is located on the 10th floor and is in a standby state, without a running direction.

[0018] At this time, a passenger presses the upward button on the 8th floor, generating a new outside-hall call (8th floor, upward).

[0019] Please refer toFigure 1 As shown in Figure 1 , this embodiment provides an elevator group control service allocation method based on predicting long waiting calls, including the following steps: S1: Determine the predicted long waiting outside-hall calls. Specifically, it includes the following sub-steps: Sub-step 1: Suppose elevator A responds to a new call. Since the current running direction is upward and the 8th floor is higher than the 2nd floor, elevator A will go upward after responding. The alternative long waiting outside-hall call direction is upward, and the floor is 2 - 1 = 1st floor, that is, the alternative long waiting outside-hall call is (1st floor, upward); Suppose elevator B responds to a new call. Since the current running direction is upward and the 8th floor is higher than the 5th floor, elevator B will go upward after responding. The alternative long waiting outside-hall call direction is upward, and the floor is 5 - 1 = 4th floor, that is, the alternative long waiting outside-hall call is (4th floor, upward).

[0020] Suppose elevator C responds to a new call. Since there is no current running direction and the 8th floor is lower than the 10th floor, elevator C will go downward after responding. The alternative long waiting outside-hall call direction is downward, and the floor is 10 + 1 = 11th floor, that is, the alternative long waiting outside-hall call is (11th floor, downward).

[0021] Sub-step 2: For the alternative long waiting outside-hall call (1st floor, upward): If elevator A responds to this call, it needs to go to the 3rd and 4th floors first, and then to the 1st floor. The running distance is ((3 - 2) × 3 + (4 - 3) × 3 + (4 - 1) × 3 = 5) meters, the running time is (15 ÷ 2 = 7.5) seconds, it stops 2 times, the stop time is (2 × 7 = 14) seconds, and the total waiting time is (7.5 + 14 = 21.5) seconds.

[0022] If elevator B responds to this call, it needs to go to the 9th floor first, and then to the 1st floor. The running distance is ((9 - 5) × 3 + (9 - 1) × 3 = 36) meters, the running time is (36 ÷ 2 = 18) seconds, it stops 1 time, the stop time is 7 seconds, and the total waiting time is (18 + 7 = 25) seconds.

[0023] If elevator C responds to this call, it needs to go to the 1st floor. The running distance is ((10 - 1) × 3 = 27) meters, the running time is (27 ÷ 2 = 13.5) seconds, there is no stop, and the total waiting time is 13.5 seconds.

[0024] Take the minimum value. The associated waiting time for this alternative long waiting outside-hall call (1st floor, upward) is 13.5 seconds.

[0025] For the alternative long waiting outside-hall call (4th floor, upward): If elevator A responds to this call, it needs to go to the 3rd floor first and then to the 4th floor. The running distance is ((3 - 2)×3+(4 - 3)×3 = 6) meters, the running time is (6÷2 = 3) seconds, it stops once, and the stop time is (1×7 = 7) seconds. The total waiting time is (3 + 7 = 10) seconds.

[0026] If elevator B responds to this call, it needs to go to the 9th floor first and then to the 4th floor. The running distance is ((9 - 5)×3+(9 - 4)×3 = 27) meters, the running time is (27÷2 = 13.5) seconds, it stops once, and the stop time is 7 seconds. The total waiting time is (13.5 + 7 = 20.5) seconds.

[0027] If elevator C responds to this call, it needs to go to the 4th floor. The running distance is ((10 - 4)×3 = 18) meters, the running time is (18÷2 = 9) seconds, it doesn't stop, and the total waiting time is 9 seconds.

[0028] Taking the minimum value, the associated waiting time for this alternative long - waiting outside - hall call (4th floor, going up) is 9 seconds.

[0029] For the alternative long - waiting outside - hall call (11th floor, going down): If elevator A responds to this call, it needs to go to the 3rd floor, 4th floor first and then to the 11th floor. The running distance is ((3 - 2)×3+(4 - 3)×3+(11 - 4)×3 = 27) meters, the running time is (27÷2 = 13.5) seconds, it stops twice, and the stop time is (2×7 = 14) seconds. The total waiting time is (13.5 + 14 = 27.5) seconds.

[0030] If elevator B responds to this call, it needs to go to the 9th floor first and then to the 11th floor. The running distance is ((9 - 5)×3+(11 - 9)×3 = 18) meters, the running time is (18÷2 = 9) seconds, it stops once, and the stop time is 7 seconds. The total waiting time is (9 + 7 = 16) seconds.

[0031] If elevator C responds to this call, it needs to go to the 11th floor. The running distance is ((11 - 10)×3 = 3) meters, the running time is (3÷2 = 1.5) seconds, it doesn't stop, and the total waiting time is 1.5 seconds.

[0032] Taking the minimum value, the associated waiting time for this alternative long - waiting outside - hall call (11th floor, going down) is 1.5 seconds.

[0033] Sub - step 3: After the traversal, 3 alternative long - waiting outside - hall calls and their associated waiting times are obtained, which are: (1st floor, going up) with an associated waiting time of 13.5 seconds; (4th floor, going up) with an associated waiting time of 9 seconds; (11th floor, going down) with an associated waiting time of 1.5 seconds.

[0034] Sub-step 4: Select the alternative out-of-hall call with the maximum associated waiting time (1st floor, going up) as the predicted out-of-hall call corresponding to the new out-of-hall call (8th floor, going up), and go to Step 2.

[0035] S2: Calculate the comprehensive waiting time of each elevator respectively. It specifically includes the following sub-steps: Sub-step 5: If elevator A responds to the new call (8th floor, going up), it needs to go to the 3rd and 4th floors first, and then to the 8th floor. The running distance is ((3 - 2)×3+(4 - 3)×3+(8 - 4)×3 = 18) meters, the running time is (18÷2 = 9) seconds, it stops 2 times, and the stop time is (2×7 = 14) seconds. The total waiting time is (9 + 14 = 23) seconds.

[0036] If elevator B responds to the new call (8th floor, going up), it needs to go to the 9th floor first, and then to the 8th floor. The running distance is ((9 - 5)×3+(9 - 8)×3 = 15) meters, the running time is (15÷2 = 7.5) seconds, it stops 1 time, and the stop time is 7 seconds. The total waiting time is (7.5 + 7 = 14.5) seconds.

[0037] If elevator C responds to the new call (8th floor, going up), it needs to go to the 8th floor. The running distance is ((10 - 8)×3 = 6) meters, the running time is (6÷2 = 3) seconds, without stopping, and the total waiting time is 3 seconds.

[0038] Sub-step 6: If elevator A responds to the predicted out-of-hall call (1st floor, going up), it needs to go to the 3rd and 4th floors first, and then to the 1st floor. The running distance is ((3 - 2)×3+(4 - 3)×3+(4 - 1)×3 = 15) meters, the running time is (15÷2 = 7.5) seconds, it stops 2 times, and the stop time is (2×7 = 14) seconds. The total waiting time is (7.5 + 14 = 21.5) seconds.

[0039] If elevator B responds to the predicted out-of-hall call (1st floor, going up), it needs to go to the 9th floor first, and then to the 1st floor. The running distance is ((9 - 5)×3+(9 - 1)×3 = 36) meters, the running time is (36÷2 = 18) seconds, it stops 1 time, and the stop time is 7 seconds. The total waiting time is (18 + 7 = 25) seconds.

[0040] If elevator C responds to the predicted out-of-hall call (1st floor, going up), the running distance is ((10 - 1)×3 = 27) meters, the running time is (27÷2 = 13.5) seconds, without stopping, and the total waiting time is 13.5 seconds.

[0041] Sub-step 7: In this embodiment, when the passenger flow density is greater than the preset threshold, let α = 0.6 and β = 0.4, and give priority to responding to new calls. Otherwise, let α = 0.4 and β = 0.6, and give priority to reducing the risk of long waiting. In this embodiment, the preset threshold is set to 10. Assuming the passenger flow density is 5, then α = 0.4 and β = 0.6.

[0042] For elevator A: The waiting times for the other elevators (B and C) in the group to respond to the predicted long-waiting hall calls are 25 seconds and 13.5 seconds respectively, and the minimum value is 13.5 seconds. Its comprehensive waiting time \(T_A\) is (0.4×23 + 0.6×13.5 = 17.3) seconds.

[0043] For elevator B: The waiting times for the other elevators (A and C) in the group to respond to the predicted long-waiting hall calls are 21.5 seconds and 13.5 seconds respectively, and the minimum value is 13.5 seconds. Its comprehensive waiting time \(T_B\) is (0.4×14.5 + 0.6×13.5 = 13.9) seconds.

[0044] For elevator C: The waiting times for the other elevators (A and B) in the group to respond to the predicted long-waiting hall calls are 21.5 seconds and 25 seconds respectively, and the minimum value is 21.5 seconds. Its comprehensive waiting time \(T_C\) is (0.4×3 + 0.6×21.5 = 14.1) seconds.

[0045] Sub-step 8: After traversing all the elevators in the group and respectively executing sub-step 7, the comprehensive waiting time of elevator A is 17.3 seconds, the comprehensive waiting time of elevator B is 13.9 seconds, and the comprehensive waiting time of elevator C is 14.1 seconds. Then transfer to step three.

[0046] S3: Select the elevator with the shortest comprehensive waiting time to serve this new hall call, and return to step one.

[0047] Compare the comprehensive waiting times of elevators A, B, and C, (13.9 < 14.1 < 17.3). It can be seen that the comprehensive waiting time of elevator B is the shortest. So select elevator B to serve the newly generated hall call (8th floor, going up). After that, the system continuously monitors whether there is a new hall call. If so, return to step one and re-predict and allocate to achieve the dynamic optimal scheduling of the elevator group control system.

[0048] Embodiment 2 Please refer to Figure 2 As shown, this embodiment provides an elevator group control system based on predicting long-waiting calls, including a group control device 1, an elevator control device 2, and an elevator outside call device 3. The group control device includes a call monitoring module 11, a predicted long-waiting call determination module 12, a comprehensive waiting time calculation module 13, and an elevator selection module 14 working together.

[0049] The call monitoring module 11 monitors in real time whether a new out-of-hall call is generated. After detecting an up call on the 8th floor, the system enters the subsequent processing flow: S1: Determine the predicted long-waiting out-of-hall call. This step is executed by the predicted long-waiting call determination module 12, which analyzes and calculates based on the current operating state data of the elevator.

[0050] S2: Calculate the comprehensive waiting time of each elevator respectively. This step is responsible for being executed by the comprehensive waiting time calculation module 13.

[0051] S3: Select the elevator with the shortest comprehensive waiting time to serve this new out-of-hall call, and return to step one. This step is responsible for being executed by the elevator selection module 14. It receives the result transmitted by the comprehensive waiting time calculation module, selects elevator B to serve the newly generated out-of-hall call (8th floor, up), and sends the scheduling instruction to the control system of elevator B. Then the call monitoring module continues to monitor in real time whether a new out-of-hall call is generated. If so, the system returns to step one to re-predict and allocate.

[0052] Through the accurate determination of the predicted long-waiting out-of-hall call and the scientific calculation of the comprehensive waiting time, the present invention can select the most suitable elevator to serve the newly generated out-of-hall call according to the real-time operating state of the elevator, effectively improving the operating efficiency of the elevator group control system and reducing the waiting time of passengers.

[0053] Finally, it should be noted that the above are only the preferred embodiments of the present invention and are not used to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, for those skilled in the art, they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements for some of the technical features. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A method for elevator group control service allocation based on predicting long waiting calls, characterized in that It includes the following steps: Step 1: When a new out-of-car call is generated, based on the real-time operating status of each elevator in the group, a predicted long-wait out-of-car call associated with the new out-of-car call is dynamically generated. The predicted long-wait out-of-car call satisfies the following conditions: The direction is the same as the subsequent operating direction after assuming that a certain elevator responds to the new call; The floor is the adjacent floor behind the subsequent operating direction and is not covered by the current tasks of the elevator; Step 2: Calculate the comprehensive waiting time of each elevator in the group, and its value is obtained through the following formula: T_total = α ∙ T 新召唤 + β ∙ min(T 预测召唤 ) where α and β are weight coefficients (α + β = 1), T 新召唤 is the waiting time for the elevator to respond to a new call, min(T 预测召唤 ) is the minimum waiting time for other elevators in the group to respond to predicted long waiting calls; Step 3: Select the elevator with the shortest comprehensive waiting time to serve the new call.

2. The elevator group control service allocation method based on predicting long waiting calls according to claim 1, wherein, The generation of the predicted long-wait out-of-car call in Step 1 includes: Traverse each elevator in the group, simulate its operating path after responding to the new call, and generate alternative calls. The floor of the alternative call is the adjacent floor behind the operating path, and the direction is the subsequent operating direction after responding to the new call; Calculate the associated waiting time of each alternative call, which is defined as the minimum waiting time for all elevators in the group to respond to the alternative call; Select the alternative call with the maximum associated waiting time as the final predicted long-wait call.

3. The elevator group control service allocation method based on predicting long waiting calls according to claim 1, wherein The values of the weight coefficients α and β in Step 2 are dynamically adjusted according to the real-time passenger flow density: When the passenger flow density is higher than the preset threshold, let α>β, and give priority to responding to the new call; When the passenger flow density is lower than the preset threshold, let α<β, and give priority to reducing the long-wait risk.

4. A method for elevator group control service allocation based on predicting long waiting calls according to claim 1, characterized in that Step 1 specifically includes the following sub-steps: Sub-step 1: Assume that a certain elevator in the group responds to the newly generated out-of-car call. Based on the characteristic that the elevator must complete the in-car commands in the same direction and the assigned out-of-car calls in the same direction before it can run in the reverse direction, obtain an alternative long-wait out-of-car call. The direction of the alternative long-wait out-of-car call is the same as the operating direction after assuming that the elevator responds to the newly generated out-of-car call, and its floor is the adjacent floor opposite to the direction of the alternative long-wait out-of-car call. Then transfer to Sub-step 2; Sub-step 2: Calculate the waiting time for each elevator in the group to respond to the alternative long-wait out-of-car call respectively, and take the minimum value as the associated waiting time of the alternative long-wait out-of-car call. Then transfer to Sub-step 3; Sub-step 3: Traverse all the elevators in the group and execute Sub-step 1 and Sub-step 2 in sequence. After the traversal is completed, obtain multiple alternative long-wait out-of-car calls and their associated waiting times with the number equal to the number of elevators in the group. Then transfer to Sub-step 4; Sub-step 4: Select the alternative long-wait out-of-car call with the maximum associated waiting time as the predicted long-wait out-of-car call corresponding to the new out-of-car call. Then transfer to Step 2.

5. A method for elevator group control service allocation based on predicting long waiting calls, as claimed in claim 1, wherein Step 2 specifically includes the following sub-steps: Sub-step 5: Calculate the waiting time for each elevator in the group to respond to the new out-of-car call. After completion, transfer to Sub-step 6; Sub-step 6: Calculate the waiting time for each elevator in the group to respond to the predicted long-wait out-of-car call. After completion, transfer to Sub-step 7; Sub-step 7: Calculate the comprehensive waiting time of a certain elevator in the group, which is the weighted sum of the waiting time for it to respond to the new out-of-car call and the minimum value of the waiting times for other elevators in the group to respond to the predicted long-wait out-of-car call. Then transfer to Sub-step 8; Sub-step 8: Traverse all elevators in the group and execute sub-step 7 respectively. After the traversal is completed, obtain the comprehensive waiting time of each elevator in the group, and then go to step three.

6. An elevator group control system based on predicting long waiting calls, which implements the elevator group control service allocation method described in any one of claims 1-5, is characterized in that, It includes a group control device, an elevator control device, and an elevator hall call device. The group control device includes: A call monitoring module for monitoring new hall calls. A predicted long-wait call determination module that generates predicted long-wait hall calls in real time based on the subsequent running direction of the elevator and the reverse adjacent floor logic. A comprehensive waiting time calculation module that dynamically calculates the comprehensive waiting time and supports adaptive adjustment of the weight coefficient. An elevator selection module for selecting the elevator with the shortest comprehensive waiting time to serve new hall calls.

Images