Elevator group control service allocation method and system based on predicted long waiting call

Abstract

The present invention discloses a method and system for allocating elevator group control services based on predicted long-wait calls. When a new hall call is generated, the predicted long-wait hall call is determined based on the current operating status of each elevator in the group, rather than relying on historical data. The comprehensive waiting time is obtained by calculating the waiting time of each elevator in response to the new call and the predicted long-wait call, and the elevator with the shortest comprehensive waiting time is selected to serve the new call. The present invention does not rely on historical data, but only makes predictions based on the real-time operating status of the elevator, avoiding prediction errors caused by inaccurate or incomplete historical data, and has greater flexibility and adaptability. It comprehensively considers the impact of new calls and potential long-wait calls, effectively reducing the overall waiting time of passengers and improving the operating efficiency of the elevator group control system.

Description

Technical Field

[0001] The present invention belongs to the technical field of elevator control, and in particular relates to an elevator group control service allocation method and system based on predicted long-wait call. Background Art

[0002] Elevator group control systems are an integral part of modern high-rise buildings. Their core goal is to reduce passenger waiting times and elevator energy consumption through rational scheduling strategies. Existing elevator group control systems often rely on historical data or fixed rules for scheduling.

[0003] For example, Chinese patent publication number CN110980456A proposes an elevator group control scheduling method based on traffic flow and adaptive neural fuzzy reasoning. This method identifies elevator traffic flow patterns and determines local indicators and weights for elevator group control based on the total elevator passenger flow and the maximum load passenger flow within a specified time period. However, this method relies heavily on the accuracy and completeness of historical data. For newly commissioned elevator systems or scenarios with significant changes in usage patterns, its prediction accuracy is significantly reduced, and the data processing costs are high.

[0004] In addition, Chinese patent publication number CN1207716A proposes using fuzzy logic to partition car loads and intervals into fuzzy sets, and uses fuzzy logic to estimate lobby passenger flow and passenger flow rate to control elevator scheduling for single-source passenger flow. However, this method makes decisions based solely on the current real-time status and lacks the ability to predict future long wait times. During peak elevator usage periods or complex traffic patterns, this can easily lead to excessive wait times for some passengers, preventing optimal allocation of elevator resources.

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

[0006] Therefore, an elevator group control service allocation method and system based on predicted long waiting calls that does not rely on historical data is urgently needed. Summary of the Invention

[0007] In order to address the defects of the existing technology, the present invention provides an elevator group control service allocation method and system based on predicted long-wait calls. When a new hall call is generated, the method and system can be combined with the predicted long-wait hall call to select the elevator with the shortest comprehensive waiting time to serve the new call, thereby improving the operating efficiency of the elevator group control system and reducing the average waiting time of passengers.

[0008] In order to solve the above technical problems, the present invention provides the following technical solutions:

[0009] The present invention provides an elevator group control service allocation method based on predicted long waiting calls, comprising the following steps:

[0010] Step 1: When a new hall call is generated, a predicted long-wait hall call associated with the new hall call is dynamically generated based on the real-time operating status of each elevator in the group. The predicted long-wait hall call meets the following conditions:

[0011] The direction is the same as the subsequent direction of movement of an elevator assuming that it responds to a new call;

[0012] The floor is an adjacent floor behind the subsequent running direction and is not covered by the current task of the elevator;

[0013] Step 2: Calculate the comprehensive waiting time of each elevator in the group. The value is obtained by the following formula:

[0014] T 综合 = α∙T 新召唤 + β∙min(T 预测召唤 )

[0015] Among them, α 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 the predicted long-wait call;

[0016] Step 3: Select the new elevator service call with the shortest overall waiting time.

[0017] Preferably, the generation of the predicted long-wait hall call in step 1 includes:

[0018] Traverse each elevator in the group, simulate its running path after responding to the new call, and generate an alternative call. Its floor is the adjacent floor behind the running path, and the direction is the subsequent running direction after responding to the new call;

[0019] Calculate the associated waiting time for each alternative call, which is defined as the minimum waiting time for all elevators in the group to respond to the alternative call;

[0020] The candidate call with the largest associated waiting time is selected as the final predicted long-waiting call.

[0021] Preferably, the values of the weight coefficients α and β in step 2 are dynamically adjusted according to the real-time passenger flow density:

[0022] When the passenger flow density is higher than the preset threshold, let α>β and give priority to responding to new calls;

[0023] When the passenger flow density is lower than the preset threshold, let α<β and give priority to reducing the long waiting risk.

[0024] The present invention also provides an elevator group control system based on predicted long waiting call, comprising a group control device, an elevator control device, and an elevator door calling device, wherein the group control device comprises:

[0025] Call monitoring module, used to monitor new hall calls;

[0026] The module for predicting long waiting calls determines the module, which generates predicted long waiting hall calls in real time, based on the subsequent running direction of the elevator and the reverse adjacent floor logic;

[0027] Comprehensive waiting time calculation module, dynamically calculates comprehensive waiting time, and supports adaptive adjustment of weight coefficients;

[0028] The elevator selection module is used to select the elevator with the shortest comprehensive waiting time to serve the new hall call.

[0029] Compared with the prior art, the present invention has the following beneficial effects:

[0030] This invention makes predictions based solely on the real-time operating status of elevators, rather than relying on historical data. This allows for rapid adaptation to diverse elevator usage scenarios, avoiding prediction errors caused by inaccurate or incomplete historical data and offering greater flexibility and adaptability. By predicting long-wait hall calls and incorporating them into elevator allocation decisions, it comprehensively considers the impact of both new and potentially long-wait calls, achieving a more optimized allocation of elevator resources, effectively reducing overall passenger wait times and improving the efficiency of the elevator group control system. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 This is a flow chart of an elevator group control service allocation method based on predicted long waiting calls according to the present invention;

[0032] Figure 2 This is a system structure diagram of an elevator group control system based on predicting long waiting calls according to the present invention;

[0033] Figure 3 It is a schematic diagram of an example of an elevator group control service allocation method based on predicted long waiting calls of the present invention. DETAILED DESCRIPTION

[0034] The preferred embodiments of the present invention are described below 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.

[0035] Example 1

[0036] See also Figure 3As shown in the figure, assume a building has 16 floors, each 3 meters high. There are three elevators in the elevator group, A, B, and C, all with a rated speed of 2 meters per second. The elevators spend 7 seconds stopping at each floor (4 seconds for door opening and closing, and 3 seconds for passengers to enter and exit). The current status of each elevator is as follows:

[0037] Elevator A is located on the 2nd floor and is moving upward. The instructions for the 3rd and 4th floors are registered in the car.

[0038] Elevator B is located on the 5th floor and is moving upwards. The instruction for the 9th floor is registered in the elevator.

[0039] Elevator C is located on the 10th floor and is in a stopped standby state with no running direction.

[0040] At this time, a passenger on the 8th floor pressed the up button, generating a new hall call (8th floor, up).

[0041] See also Figure 1 As shown, this embodiment provides an elevator group control service allocation method based on predicted long waiting calls, comprising the following steps:

[0042] S1: Determine the predicted long waiting time for the hall call. This includes the following sub-steps:

[0043] Sub-step 1:

[0044] Assume that elevator A responds to a new call. Since the current direction is upward and the 8th floor is higher than the 2nd floor, elevator A will go up after responding. The direction of the standby long-waiting hall call is upward, and the floor is 2-1 = 1st floor. That is, the standby long-waiting hall call is (1st floor, up).

[0045] Assume that elevator B responds to a new call. Since the current running direction is upward and the 8th floor is greater than the 5th floor, elevator B will go up after responding. The direction of the alternative long-waiting hall call is upward, and the floor is 5-1 = 4th floor. That is, the alternative long-waiting hall call is (4th floor, up).

[0046] Assume that 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 down after responding. The alternative long-waiting hall call direction is down, and the floor is 10+1=11th floor. That is, the alternative long-waiting hall call is (11th floor, down).

[0047] Sub-step 2:

[0048] For alternative long-wait hall call (1st floor, up):

[0049] If elevator A responds to this call, it must first go to the 3rd and 4th floors, 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, and it stops twice, the stop time is (2×7=14) seconds, and the total waiting time is (7.5+14=21.5) seconds.

[0050] If elevator B responds to this call, it must first go to the 9th floor 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, and it stops once, the stop time is 7 seconds, and the total waiting time is (18+7=25) seconds.

[0051] 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.

[0052] Taking the minimum value, the associated waiting time for this alternative long-waiting hall call (1st floor, up) is 13.5 seconds.

[0053] For alternative long-wait hall call (4th floor, up):

[0054] If elevator A responds to this call, it must first go to the 3rd floor 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, and it stops once, the stopping time is (1×7=7) seconds, and the total waiting time is (3+7=10) seconds.

[0055] If elevator B responds to this call, it must first go to the 9th floor 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, and it stops once, the stop time is 7 seconds, and the total waiting time is (13.5+7 = 20.5) seconds.

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

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

[0058] For alternative long-wait hall call (11th floor, downstairs):

[0059] If elevator A responds to this call, it must first go to the 3rd floor, the 4th floor, and then 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, and it stops twice, the stop time is (2×7=14) seconds, and the total waiting time is (13.5+14=27.5) seconds.

[0060] If elevator B responds to this call, it must first go to the 9th floor 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, and it stops once, the stop time is 7 seconds, and the total waiting time is (9+7=16) seconds.

[0061] If elevator C responds to this call and 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, there is no stop, and the total waiting time is 1.5 seconds.

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

[0063] Sub-step 3: After the traversal is completed, three candidate long-waiting hall calls and their associated waiting times are obtained, namely: (1st floor, up) associated waiting time 13.5 seconds; (4th floor, up) associated waiting time 9 seconds; (11th floor, down) associated waiting time 1.5 seconds.

[0064] Sub-step 4: Select the candidate long-waiting hall call (1st floor, up) with the largest associated waiting time as the predicted long-waiting hall call corresponding to the new hall call (8th floor, up), and go to step 2.

[0065] S2: Calculate the comprehensive waiting time of each elevator. This includes the following sub-steps:

[0066] Sub-step 5:

[0067] If elevator A responds to a new call (8th floor, up), it must first go to the 3rd floor, the 4th floor, and then 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, and it stops twice, the stopping time is (2×7=14) seconds, and the total waiting time is (9+14=23) seconds.

[0068] If elevator B responds to a new call (8th floor, up), it must first go to the 9th floor 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, and it stops once, the stop time is 7 seconds, and the total waiting time is (7.5+7=14.5) seconds.

[0069] If elevator C responds to the new call (8th floor, 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.

[0070] Sub-step 6:

[0071] If elevator A responds to a hall call with a predicted long wait (1st floor, up), it must first go to the 3rd and 4th floors, and then to the 1st floor. The travel distance is ((3-2)×3+(4-3)×3+(4-1)×3=15) meters, the travel time is (15÷2=7.5) seconds, and it stops twice, with a stop time of (2×7=14) seconds, for a total waiting time of (7.5+14=21.5) seconds.

[0072] If elevator B responds to a hall call with a predicted long wait (1st floor, up), it must first go to the 9th floor and then to the 1st floor. The travel distance is ((9-5)×3+(9-1)×3=36) meters, the travel time is (36÷2=18) seconds, and it stops once for 7 seconds, for a total waiting time of (18+7=25) seconds.

[0073] If elevator C responds to the predicted long-wait hall call (1st floor, 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.

[0074] Sub-step 7:

[0075] In this embodiment, when the passenger flow density is greater than the preset threshold, α = 0.6 and β = 0.4 are set to prioritize responding to new calls. Otherwise, α = 0.4 and β = 0.6 are set to prioritize reducing the risk of long waits. In this embodiment, the preset threshold is set to 10. Assuming the passenger flow density is 5, α = 0.4 and β = 0.6 are used.

[0076] For elevator A, the waiting times for the other elevators (B and C) in the group to respond to the predicted long hall call are 25 seconds and 13.5 seconds, respectively, with the minimum being 13.5 seconds. The combined waiting time T_A is (0.4 × 23 + 0.6 × 13.5 = 17.3) seconds.

[0077] For elevator B, the waiting times for the other elevators (A and C) in the group to respond to the predicted long hall call are 21.5 seconds and 13.5 seconds, respectively, with the minimum being 13.5 seconds. The combined waiting time T_B is (0.4 × 14.5 + 0.6 × 13.5 = 13.9) seconds.

[0078] For elevator C, the waiting times for the other elevators (A and B) in the group to respond to the predicted long hall call are 21.5 seconds and 25 seconds respectively, with the minimum being 21.5 seconds. The combined waiting time T_C is (0.4×3+0.6×21.5=14.1) seconds.

[0079] Sub-step 8: After traversing all elevators in the group and executing sub-step 7, the comprehensive waiting time for elevator A is 17.3 seconds, the comprehensive waiting time for elevator B is 13.9 seconds, and the comprehensive waiting time for elevator C is 14.1 seconds. Go to step 3.

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

[0081] Comparing the combined waiting times of elevators A, B, and C (13.9 < 14.1 < 17.3), we see that elevator B has the shortest overall waiting time. Therefore, elevator B is selected to service the newly generated hall call (8th floor, up). The system then continuously monitors for new hall calls. If so, it returns to step 1 and re-predicts and allocates them, achieving dynamic optimization scheduling for the elevator group control system.

[0082] Example 2

[0083] See also Figure 2 As shown, this embodiment provides an elevator group control system based on predicted long waiting calls, including a group control device 1, an elevator control device 2, and an elevator external 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.

[0084] The call monitoring module 11 monitors in real time whether there are new hall calls. When an uplink call from the 8th floor is detected, the system enters the subsequent processing flow:

[0085] S1: Determine the predicted long waiting hall call. This step is performed by the predicted long waiting call determination module 12, which performs analysis and calculation based on the current elevator operation status data.

[0086] S2: Calculate the comprehensive waiting time of each elevator respectively. This step is performed by the comprehensive waiting time calculation module 13.

[0087] S3: Select the elevator with the shortest comprehensive waiting time to service the new hall call, and return to step 1. This step is performed by the elevator selection module 14. It receives the results from the comprehensive waiting time calculation module, selects elevator B to service the newly generated hall call (8th floor, up), and sends a dispatch instruction to the control system of elevator B. The call monitoring module then continues to monitor in real time whether there are new hall calls. If so, the system returns to step 1 and re-predicts and allocates them.

[0088] By accurately determining the predicted long-waiting hall calls and scientifically calculating the comprehensive waiting time, the present invention can select the most suitable elevator to serve the newly generated hall calls according to the real-time operating status of the elevators, effectively improving the operating efficiency of the elevator group control system and reducing the waiting time of passengers.

[0089] Finally, it should be noted that the above descriptions are merely preferred embodiments of the present invention and are not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art will be able to modify the technical solutions described in the aforementioned embodiments or substitute equivalents for some of the technical features. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention shall be included within the scope of protection of the present invention.

Claims

1. A method for allocating elevator group control services based on predicting long waiting calls, characterized in that: The following steps are involved: Step 1: When a new hall call is generated, a predicted long-wait hall call associated with the new hall call is dynamically generated based on the real-time operating status of each elevator in the group. The predicted long-wait hall call meets the following conditions: The direction is the same as the subsequent direction of movement of an elevator assuming that it responds to a new call; The floor is an adjacent floor behind the subsequent running direction and is not covered by the current task of the elevator; 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, and generate an alternative call. Its floor is the adjacent floor behind the running path, and the direction is the subsequent running direction after responding to the new call; Calculate the associated waiting time for each alternative call, which is defined as the minimum waiting time for all elevators in the group to respond to the alternative call; The candidate call with the largest associated waiting time is selected as the final predicted long-waiting call; It includes the following sub-steps: Sub-step 1: Assuming that an elevator in the group responds to a newly generated hall call, based on the characteristic that the elevator must complete the forward car command and the assigned forward registered hall call before it can run in the reverse direction, obtain an alternative long-wait hall call; the direction of the alternative long-wait hall call is the same as the direction in which the elevator is assumed to run after responding to the newly generated hall call, and the floor is an adjacent floor in the opposite direction of the alternative long-wait hall call, and then proceed to sub-step 2; Sub-step 2: Calculate the waiting time for each elevator in the group to respond to the candidate long-waiting hall call, and use the minimum value as the associated waiting time for the candidate long-waiting hall call, and then proceed to sub-step 3; Sub-step 3: Traverse all elevators in the group and execute sub-steps 1 and 2 in sequence. After the traversal is completed, multiple candidate long-waiting hall calls and their associated waiting times equal to the number of elevators in the group are obtained, and then proceed to sub-step 4; Sub-step 4: Select the candidate long-waiting hall call with the largest associated waiting time as the predicted long-waiting hall call corresponding to the new hall call, and then go to step 2; Step 2: Calculate the comprehensive waiting time of each elevator in the group. The value is obtained by the following formula: T 综合 = α∙T 新召唤 + β∙min(T 预测召唤 ) Among them, α 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 the predicted long-wait call; Step 3: Select the new elevator service call with the shortest overall waiting time.

2. The elevator group control service allocation method based on predicted long waiting calls according to claim 1, characterized in that: 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 new calls; When the passenger flow density is lower than the preset threshold, let α<β and give priority to reducing the long waiting risk.

3. The elevator group control service allocation method based on predicted long waiting calls according to claim 1, characterized in that: The second step specifically includes the following sub-steps: Sub-step 5: Calculate the waiting time for each elevator in the group to respond to the new hall call, and then proceed to sub-step 6; Sub-step 6: Calculate the waiting time for each elevator in the group to respond to the predicted long-waiting hall call, and then proceed to sub-step 7; Sub-step 7: Calculate the comprehensive waiting time of an elevator in the group as the weighted sum of the minimum of its waiting time to respond to a new hall call and the waiting time of other elevators in the group to respond to predicted long-waiting hall calls, and then proceed to sub-step 8; Sub-step 8: Traverse all elevators in the group and execute sub-step 7 respectively. After the traversal is completed, the comprehensive waiting time of each elevator in the group is obtained, and then go to step 3.

4. An elevator group control system based on predicting long waiting calls, implementing the elevator group control service allocation method according to any one of claims 1 to 3, characterized in that: It includes a group control device, an elevator control device, and an elevator call device. The group control device includes: Call monitoring module, used to monitor new hall calls; The module for predicting long waiting calls determines the module, which generates predicted long waiting hall calls in real time, based on the subsequent running direction of the elevator and the reverse adjacent floor logic; Comprehensive waiting time calculation module, dynamically calculates comprehensive waiting time, and supports adaptive adjustment of weight coefficients; The elevator selection module is used to select the elevator with the shortest comprehensive waiting time to serve the new hall call.

Images