Train operation plan fast generation method and device based on bidirectional adjustment strategy, and medium

By establishing a correlation model between train events and adopting a two-way adjustment strategy of positive assignment and reverse correction, the problem of balancing computational efficiency with solution quality and security in existing technologies has been solved, enabling real-time emergency dispatching and safety assurance in large-scale rail transit networks.

CN123104738APending Publication Date: 2026-11-17CASCO SIGNAL LTD
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202611215169.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-12
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing emergency operation plan generation technologies struggle to balance computational efficiency and solution quality, global recalculation and local adjustments, and computational speed and operational safety. In particular, they are difficult to achieve real-time response and safety assurance in large-scale rail transit networks.

Method used

A train operation plan generation method based on a two-way adjustment strategy is adopted. By establishing a correlation model between train events and combining positive assignment and negative correction, the optimal emergency operation plan that meets various operational constraints can be generated quickly.

Benefits of technology

It enables the rapid generation of optimal emergency operation plans within polynomial time complexity, satisfying operational constraints and ensuring safety, and is suitable for real-time emergency dispatching of large-scale rail transit networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123104738A_ABST
    Figure CN123104738A_ABST
Patent Text Reader

Abstract

This invention relates to a method, device, and medium for rapidly generating train operation plans based on a two-way adjustment strategy. The method includes: Step S1, establishing a correlation model between train events: based on the known station operation sequence, establishing an adjustment correlation table and an adjustment transfer table for each train event; Step S2, transforming the impact of emergencies: uniformly transforming the actual impact of three typical emergencies—train slowdown, section interruption, and section speed limit—into assignment constraints on the corresponding train event times; Step S3, initializing the set of events to be adjusted; Step S4, forward assignment: sequentially extracting events from the set of events to be adjusted, and calculating the earliest feasible operation time for each train event along the positive time axis; Step S5, reverse correction. Compared with existing technologies, this invention has the advantages of rapidly generating optimal emergency operation plans that meet various operational constraints.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of rail transit, and in particular to a method, device and medium for rapidly generating train operation plans based on a two-way adjustment strategy. Background Technology

[0002] As a high-density, strongly coupled transportation network, urban rail transit systems exhibit significant cascading sensitivity during operation. Trains on the line share limited section and station track resources; any change in the operating status of one train can be transmitted to adjacent trains through coupling relationships such as interval constraints and resource occupancy, leading to widespread delays. In actual operation, unexpected events such as train slowdowns (delays due to malfunctions, etc.), section interruptions (temporary inaccessibility of a section of the line), and section speed restrictions (requiring speed reductions on a section of the line) occur frequently. Statistics show that large urban rail transit networks typically handle thousands or even tens of thousands of train events (arrivals and departures) daily. The time constraints between these events constitute a massive, interconnected constraint network. Under these conditions, how to quickly generate emergency train operation plans that meet all operational constraints after an unexpected event has long been a core technical challenge in the field of rail transit dispatching.

[0003] Currently, adjustments to emergency operation plans in engineering practice still primarily rely on dispatchers' experience-based manual intervention. Dispatchers typically perform localized operations such as extending stop times and adjusting train intervals for each affected train based on the type and location of the emergency. This approach is adequate when the line is small and the number of trains involved is limited. However, when the line is large and the number of affected trains is significant, manual adjustments struggle to fully consider the interplay of multiple constraints, including station interval constraints, section running time constraints, and track capacity constraints. This often results in a locally feasible rather than globally optimal solution.

[0004] In terms of automated solution methods, the academic and engineering communities have conducted extensive research, mainly resulting in the following two technical approaches: The first category is exact solution methods based on mathematical programming. These methods typically model the train operation adjustment problem as a mixed-integer linear programming (MILP) or linear programming (LP) model, with the optimization objective being the minimization of total delay, and solve it using commercial solvers (such as CPLEX and Gurobi). While this type of method theoretically guarantees the optimality of the solution, its computational bottleneck lies in the fact that as the number of trains and stations involved increases, the number of decision variables and constraints in the model grows exponentially, causing the solution time to rapidly increase from seconds to minutes or even hours, making it difficult to meet the real-time requirements of second-level response in emergency scenarios. Especially when it is necessary to evaluate multiple alternative operation sequences and select the optimal one, a complete optimization model must be constructed and solved separately for each sequence, further exacerbating the computational burden.

[0005] The second category is approximate solution methods based on heuristic search. These methods employ metaheuristic algorithms such as genetic algorithms, simulated annealing, and tabu search to perform a global search in the solution space, gradually approximating a better solution through iterative evolution. While these methods do not require a strict mathematical structure for the problem and have a wide range of applications, they suffer from slow convergence speed and long computation time (typically requiring hundreds to thousands of iterations), making real-time response difficult in emergency scenarios. Furthermore, the solution quality of heuristic methods is unstable, with significant differences in solution performance between different running instances.

[0006] The common limitation of both methods is that they treat the problem as a holistic optimization problem, "building it from scratch and solving it globally," failing to fully utilize the reasonable structure and redundant time information already included in the existing operation plan. In actual emergency scenarios, sudden events usually only directly affect a portion of trains in a local area, while the operation plans of a large number of trains remain feasible or only require minor adjustments. Indiscriminately recalculating all events results in unnecessary waste of computational resources.

[0007] Furthermore, from an operational safety perspective, existing fast solution methods (such as simple greedy step-by-step assignment methods) generally lack effective control mechanisms for the upper bound of the interval travel time while pursuing computational speed. In rail transit operations, the interval travel time between two stations not only has a minimum requirement (limited by the train's power performance) but also faces a significant safety upper limit constraint—if the travel time is too long, it means that the train will run at low speed for an extended period within the interval or even be forced to stop in areas such as tunnels and bridges where passenger evacuation and emergency rescue conditions are not available, posing a serious safety hazard. Existing fast assignment methods typically only focus on the feasibility of the lower bound of the event time (i.e., not earlier than the earliest time required by each constraint), lacking systematic detection and correction methods for the aforementioned safety upper limit problem.

[0008] A search of Chinese patent CN115034065A reveals a modeling and evaluation method and apparatus for high-speed train operation adjustments oriented towards delay propagation. Addressing potential abnormal event disturbances during daily high-speed railway transportation, this invention comprehensively considers the dynamic interaction between train operation adjustments and delay propagation, constructing a two-stage optimization decision-making model and proposing a delay propagation evaluation method. The first stage of the model is Pareto optimization considering cumulative weighted delays and the average number of train adjustments; the second stage is global equilibrium optimization based on game theory. Its main advantages include further considering the heterogeneity of transportation scenarios and plans, constructing dynamic train operation level coefficients, and introducing an objective function. Furthermore, it innovatively considers the maximum number of train avoidances and the number of affected trains in the constraints and implements a mathematical description. The existing patent treats all train events as a whole coupled system. Each adjustment requires building a complete MILP model and calling the solver for global traversal and Pareto game, which causes the computation time to increase exponentially with the event size. At the same time, all constraints in the existing patent only stipulate that the train should not be earlier than a certain time (lower bound), and there is no detection and constraint mechanism for excessively long interval running time (upper bound). This implies a major technical blind spot: if the train crawls at low speed for a long time or even stops in the tunnel or bridge due to excessively long assignment time, it will cause serious safety accidents.

[0009] Therefore, existing emergency operation plan generation technologies face multiple challenges, including the difficulty in balancing computational efficiency and solution quality, the difficulty in balancing global recalculation and local adjustments, and the difficulty in unifying computational speed and operational safety. These challenges have become technical problems that need to be addressed. Summary of the Invention

[0010] The purpose of this invention is to overcome the shortcomings of the existing technology by providing a method, device and medium for rapid generation of train operation plans based on a two-way adjustment strategy. Under the condition of known station operation sequence, by establishing a correlation model between train events, a two-way adjustment strategy combining positive assignment and reverse correction is adopted to quickly generate an optimal emergency operation plan that meets various operational constraints.

[0011] The objective of this invention can be achieved through the following technical solutions: According to a first aspect of the present invention, a method for rapidly generating train operation plans based on a two-way adjustment strategy is provided, the method comprising: Step S1, establish a correlation model between train events: based on the known station operation sequence, establish an adjustment correlation table and an adjustment transmission table for each train event. The adjustment correlation table is used to record which upstream events directly constrain the current event, and the adjustment transmission table is used to record which downstream events the time adjustment of the current event will be directly transmitted to. Step S2, Transformation of the impact of emergencies: The actual impact of three typical emergencies, namely train slowdown, section interruption, and speed limit in section, is uniformly transformed into the assignment constraints of the corresponding train event time. Step S3, Initialization of the set of events to be adjusted: Based on the type of emergencies and changes in the order of operations, determine the initial range of train events that need to be adjusted and construct the set of events to be adjusted; Step S4, positive assignment: Take out events sequentially from the set of events to be adjusted, and calculate the earliest feasible operation time for each train event along the positive direction of the time axis; Step S5, Reverse Correction: Based on the positive assignment result, check whether the running time of each train in the section exceeds the safe range. If the running time exceeds the limit or the running time is insufficient due to the change of the stop type, backtrack from the downstream event to adjust the time of the upstream event.

[0012] As a preferred technical solution, the station operation sequence in step S1 is the arrival order and departure order of trains at each station. For each station, the station operation sequence clarifies the order in which trains arrive at the station and the order in which trains depart from the station.

[0013] As a preferred technical solution, the adjustment of the association table in step S1 specifically involves: 101) Regarding the departure event Its operation time is constrained by the following two events: The first is the departure of the train that precedes it in the departure order at this station. The minimum departure interval must be met between the two. ; The second is the arrival of this train at this station. The minimum stopping time between the two must be met. ; The adjustment association table for the departure event is as follows: ; 102) For arrival events Its operation time is constrained by the following three events: The first is the arrival event of the train that precedes it in the arrival order at this station. The minimum arrival interval must be satisfied between the two. ; The second is the train's departure from the previous station. The minimum interval running time must be satisfied between the two. ; Thirdly, there are incidents of trains departing ahead due to track capacity limitations at stations. ; The adjustment association table for the arrival event is as follows: .

[0014] As a preferred technical solution, the preceding train departure event limited by station track capacity... Specifically: When the station The number of stock lanes is At that time, under the most unfavorable conditions, assuming the train If all trains that have arrived at this station before the arrival of the train are stopped and each occupying one track, then the train... The prerequisite for arriving at the station is that, among the trains that arrived at this station before it, the [train name] is the [train name] in order of arrival. The train has completed its departure and released the track it occupied; the train That is, the first Two arriving trains must meet the same arrival / departure interval on the same track. .

[0015] As a preferred technical solution, the adjustment transfer table in step S1 is a reverse mapping of the adjustment association table. Specifically, if event A appears in the adjustment association table of event B, then event B appears in the adjustment transfer table of event A.

[0016] As a preferred technical solution, the actual impact of three typical emergencies—train slowdown, section interruption, and section speed limit—in step S2 is specifically as follows: 201) For train delays, directly modify the original scheduled time of the event to the delayed time, so that the lower bound of the assignment in the subsequent positive assignment process is updated to the delayed time; 202) For section interruption, find all trains whose original planned departure time falls within the interruption period in the departure order of the section entrance station, and uniformly change the departure time of the above trains at that station to the interruption end time. 203) For speed limits in sections, the actual minimum pure running time is dynamically calculated based on the specific time each train enters the section.

[0017] As a preferred technical solution, in step 203), the actual minimum pure running time of each train is dynamically calculated based on the specific time each train enters the section, specifically as follows: If the train enters the section after the speed limit has expired, its travel time will not be affected. If the train travels entirely within the speed limit period, the travel time will be calculated based on the travel time under the speed limit conditions. If the train runs across the start and end times of the speed limit, the section will be divided into a normal operating section and a speed-limited operating section, calculated separately and then combined.

[0018] As a preferred technical solution, step S3 specifically includes: 301) When solving based on the original operation sequence, the station operation sequence is consistent with the original plan before the occurrence of the emergency. At this time, the set of events to be adjusted only includes train events directly affected by the emergency. 302) When solving based on the changed work order, after the station work order is manually adjusted by the dispatcher or re-determined by the operation plan optimization algorithm, the arrival or departure order of trains at some stations has changed relative to the original plan. At this time, in addition to adding the events directly affected by the sudden event to the set of events to be adjusted, it is also necessary to compare the differences between the old and new work orders and add the arrival and departure events of the relevant trains at the stations where the work order has changed to the set of events to be adjusted.

[0019] As a preferred technical solution, step S3 further includes: in the subsequent iterative adjustment process, whenever the time of an event changes after being calculated by step S4 or step S5, all potentially affected downstream events are found through the adjustment propagation table and added to the set of events to be adjusted; if the time of an event does not change after calculation, it is no longer propagated downstream.

[0020] As a preferred technical solution, the earliest feasible operation time in step S4 includes the arrival event. Earliest feasible operation time and departure event The earliest feasible operation time; The arrival event The earliest feasible operation time is calculated using the following formula: In the formula, The originally planned arrival time of the event; This refers to the arrival time of the trains preceding it in the arrival order at this station; Minimum arrival interval; This is the departure time of this train at the previous station; The minimum running time for this section, calculated according to the originally planned stop type; The departure time of the train ahead, which is subject to track capacity constraints; For the same track, the interval is between; The departure event The earliest feasible operation time is calculated using the following formula: In the formula, The original planned departure time for the event; This refers to the departure time of the trains preceding it in the departure order at this station. Minimum departure interval; This is the arrival time of this train at this station; This is the minimum stopping time.

[0021] As a preferred technical solution, the reverse correction in step S5 includes reverse correction for the departure event and reverse correction for the arrival event. The reverse correction for the starting event specifically refers to: When a train changes its planned passage to an actual stop at a station, the travel time of the previous section must include additional deceleration time. The arrival time at this station is then recalculated to meet the minimum pure travel time constraint calculated according to the actual stop type. If the adjusted arrival time is still earlier than the departure time, and the difference between the two meets the minimum stop time constraint, the arrival time is directly corrected, and the upstream section is checked again. Otherwise, the arrival time is set to equal the departure time, and the train continues to backtrack upstream. The reverse correction for the arrival event specifically refers to: When the total running time of a section exceeds the safety limit, the departure time of the preceding station must be postponed to the latest necessary time to meet the safety constraints. The adjusted departure time of the preceding station is calculated according to the following formula: In the formula, The current arrival time of the event. This is the maximum allowed running time for this interval. The maximum allowable extension ratio, This is the minimum pure running time corresponding to the actual stop type for this section.

[0022] As a preferred technical solution, steps S4 and S5 constitute an iterative loop: whenever the time of a certain event changes after calculation, the downstream events that may be affected are added to the set of events to be adjusted through the adjustment transfer table; when the set of events to be adjusted is empty and no new time changes occur, the iteration terminates and the optimal running plan is output.

[0023] According to a second aspect of the present invention, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the program to implement the method described thereon.

[0024] According to a third aspect of the present invention, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method described thereon.

[0025] Compared with the prior art, the present invention has the following advantages: (1) This invention adopts a structured modeling of train event dependencies based on adjustment association tables and adjustment transfer tables. Existing mathematical programming methods encode all operational constraints into a system of linear inequalities, requiring a traversal of global constraints for feasibility assessment in each solution. This invention establishes an adjustment association table (recording the source of upstream constraints) and an adjustment transfer table (recording the scope of downstream influence) for each train event, explicitly representing various time constraints such as interval constraints, station constraints, section running time constraints, and track capacity constraints involved in train operation as a dependency structure between events. Based on this structure, when the algorithm adjusts the time of any event, it only needs to query its adjustment association table to directly locate all related constraint events without traversing the global constraint set. This reduces the computational complexity of a single event adjustment from being related to the total number of constraints to being related only to the number of related events of a single event (constant level), laying an efficient data index foundation for subsequent fast solutions. (2) The present invention adopts a two-way adjustment solution strategy that combines forward assignment and reverse correction, which takes into account both solution speed and operational safety. The forward assignment of the present invention calculates the earliest feasible time of each event one by one along the time direction. Under the premise of satisfying all operational constraints, it makes full use of the redundant time in the original plan to absorb delays and ensures the global optimality of the generated result. The reverse correction backtracks from downstream events to upstream events and makes targeted corrections for situations where the interval running time exceeds the safety limit or the running time is insufficient due to changes in the station type, eliminating the hidden danger of trains staying in unsafe sections such as tunnels and bridges for a long time. The above two processes are organically combined to ensure the optimality of the solution and the safety and feasibility of the operation plan within polynomial time complexity. (3) The present invention adopts dynamic management technology of the set of events to be adjusted based on delay propagation tracking, realizing localized on-demand adjustment; existing methods usually require recalculation of all train events after a sudden event, and the amount of computation is proportional to the scale of the global event; the present invention uses the adjustment transmission table to realize accurate tracking of the scope of delay impact, and the algorithm only triggers downstream propagation for events whose actual occurrence time changes. When the delay is absorbed by the original planned redundant time, the propagation process is automatically terminated, avoiding indiscriminate recalculation of all events; the on-demand adjustment mechanism makes the actual amount of computation of the algorithm proportional to the actual scope of the delay impact, rather than proportional to the total number of global events, and can still maintain millisecond-level response speed in large-scale lines and multi-train scenarios, meeting the strict real-time requirements of emergency dispatch; (4) This invention does not require any scene classification and parameter fitting. The impact of all sudden events is uniformly expressed by time assignment constraints. The algorithm itself is decoupled from specific event types, and the engineering deployment and maintenance costs are significantly reduced. Attached Figure Description

[0026] Figure 1This is an overall flowchart of the train operation plan rapid generation method of the present invention; Figure 2 This invention relates to the intent of adjusting the association of train events. Figure 3 This invention represents the intent of adjusting the transmission of train events. Figure 4 This is a schematic diagram of the forward assignment process of the present invention (in the form of a train timetable). Figure 5 This is a schematic diagram of the reverse correction process of the present invention (in the form of a train timetable). Detailed Implementation

[0027] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0028] like Figure 1 As shown, a method for rapidly generating train operation plans based on a two-way adjustment strategy is proposed. Under the condition of known station operation sequence, this method establishes a correlation model between train events and adopts a two-way adjustment strategy that combines forward assignment and reverse correction to quickly generate an optimal emergency operation plan that meets various operational constraints.

[0029] The station operation sequence refers to the order in which trains arrive and depart from each station. That is, for each station, the order in which trains arrive at the station and the order in which trains depart from the station are clearly defined.

[0030] The method of the present invention includes the following steps: Step S01, Train event correlation modeling: Based on the known station operation sequence, establish an adjustment correlation table and an adjustment transmission table for each train event. The adjustment correlation table is used to record which upstream events directly constrain the current event, and the adjustment transmission table is used to record which downstream events the time adjustment of the current event will be directly transmitted to. Step S02, Transformation of the impact of sudden events: The actual impact of three typical sudden events, namely train slowdown, section interruption, and speed limit in section, is uniformly transformed into the assignment constraints of the corresponding train event time, which serve as the input conditions for subsequent adjustment algorithms. Step S03, Initialization of the set of events to be adjusted: Based on the type of emergencies and changes in the order of operations, determine the initial range of train events that need to be adjusted and construct the set of events to be adjusted; Step S04, positive assignment: Take out events sequentially from the set of events to be adjusted, and calculate the earliest feasible operation time for each train event along the positive direction of the time axis; Step S05, Reverse Correction: Based on the positive assignment result, check whether the running time of each train in the section exceeds the safe range. If the running time exceeds the limit or the running time is insufficient due to the change of the stop type, backtrack from the downstream event to adjust the time of the upstream event. Steps S04 and S05 constitute an iterative loop: whenever the time of an event changes after calculation, the downstream events that may be affected are added to the set of events to be adjusted through the adjustment transfer table; when the set of events to be adjusted is empty and no new time changes occur, the iteration terminates and the optimal running plan is output.

[0031] Detailed explanation of step S01: Modeling train event correlations In rail transit operation, each train corresponds to two key events at each station: arrival and departure. The time between these events must meet a series of operational constraints, including: the minimum arrival interval between two adjacent trains at the same station, the minimum departure interval between two adjacent trains at the same station, the minimum stop time of the same train at the station, the minimum travel time of the same train between two adjacent stations, and the capacity constraint that the number of trains stopping at a station at the same time does not exceed the number of tracks.

[0032] The adjustment of the association table records which upstream events directly constrain the current event's job time. Specifically: (1) such as Figure 2 As shown, for the start event (i.e., train) At the station The departure event), its operation time is constrained by the following two events: one is the departure event of the train that is ahead of it in the departure order at this station. The minimum departure interval must be met between the two. Secondly, the arrival of this train at this station. The minimum stopping time between the two must be met. Therefore, the adjustment association table for the triggering event is as follows: .

[0033] (2) such as Figure 3 As shown, for the arrival event (i.e., train) At the station The arrival event), its operation time is constrained by the following three events: The first is the arrival event of the train that precedes it in the arrival order at this station. The minimum arrival interval must be satisfied between the two. ; The second is the train's departure from the previous station. The minimum interval running time must be satisfied between the two. ; Thirdly, there are incidents of trains departing ahead due to track capacity limitations at stations. Specifically, when the station The number of stock lanes is At that time, under the most unfavorable conditions, assuming the train If all trains that have arrived at this station before the arrival of the train are stopped and each occupying one track, then the train... The prerequisite for arriving at the station is that, among the trains that arrived at this station before it, the [train name] is the [train name] in order of arrival. The train has departed and released the track it occupied. That is, the first Two arriving trains must meet the same arrival / departure interval on the same track. .

[0034] Therefore, the adjusted association table for the arrival event is: .

[0035] The adjustment transit table is the reverse mapping of the adjustment association table: if event A appears in the adjustment association table of event B, then event B appears in the adjustment transit table of event A. Through this bidirectional recording mechanism, it is possible to trace the upstream dependency source from downstream events and predict the downstream impact range from upstream events.

[0036] Furthermore, as a preferred technical solution, for boundary cases such as the originating train not having a previous station departure record or the first arriving train not having a preceding arriving train, an empty identifier is filled into the corresponding position in the adjustment association table. This indicates that there are no valid constraint events at the associated location. During forward assignment calculations, when an associated event is encountered... If the position is not specified, skip the constraint term and do not participate in the maximum value operation to maintain the consistency of the list structure and the algorithm processing logic.

[0037] Detailed explanation of step S02: Impact transformation of unforeseen events This invention addresses three typical emergencies, transforming their impact on train operation into a unified constraint on the timing of the train event, as follows: (1) Train delay: An event of a certain train must be postponed to a specified time due to vehicle malfunction, signal abnormality, or other reasons. The solution is to directly modify the original scheduled time of the event to the postponed time, so that the lower bound of the event in the subsequent positive assignment process is updated to the delayed time.

[0038] (2) Interruption of a segment: A segment is interrupted during a specified time period. The area is completely impassable. The solution is to search the departure sequence at the entrance station of the specified section for all originally scheduled departure times that fall within the interrupted period (i.e., originally scheduled departure times no earlier than...). And earlier than For trains listed above, the departure time at this station will be uniformly changed to the interruption end time. This means that the train must wait for the line to be reopened before it can depart.

[0039] (3) Sectional speed limit: A certain section requires a speed reduction during a specified time period, which increases the minimum travel time required to pass through the section. The solution is to dynamically calculate the actual minimum pure travel time based on the specific time each train enters the section. Specifically, the following three scenarios are distinguished based on the relationship between the train's entry time and the start and end times of the speed limit event: If the train enters the section after the speed limit has ended, its travel time is unaffected; if the train runs throughout the speed limit period, the travel time is calculated according to the speed limit conditions; if the train's operation crosses the start and end times of the speed limit, the section is divided into a normal operating section and a speed-limited operating section, calculated separately, and then combined.

[0040] Detailed explanation of step S03: Initialization and dynamic management of the event set to be adjusted To avoid indiscriminate recalculation of all train events, this invention adopts a strategy of dynamically managing the set of events to be adjusted, processing only events that may change in time.

[0041] The initialization method for the set of events to be adjusted is divided into the following two types depending on the scenario: (1) When solving based on the original operation sequence, that is, the station operation sequence is consistent with the original plan before the occurrence of the emergency, the initial set only includes train events directly affected by the emergency. Specifically: in the section interruption scenario, each departure event whose departure time is postponed in the entrance station of the interrupted section is added to the set; in the section speed limit scenario, the departure events of the entrance station of the speed limit section and the arrival events of the terminal station of the speed limit section are added to the set, that is, the events whose section running time may change due to the speed limit are included in the adjustment range; in the train slowdown scenario, the specific events of the delayed train whose planned time has been modified are added to the set.

[0042] (2) When solving based on the changed work order, that is, after the station work order is manually adjusted by the dispatcher or re-determined by the operation plan optimization algorithm, the arrival or departure order of trains at some stations has changed relative to the original plan. In this case, in addition to adding the events directly affected by the sudden event to the set, it is also necessary to compare the differences between the old and new work orders and add the arrival and departure events of the relevant trains at the stations where the work order has changed to the initial set.

[0043] In subsequent iterative adjustments, whenever the time of an event changes after calculation in step S04 or S05, all potentially affected downstream events are searched through the adjustment propagation table and added to the set of events to be adjusted. If the time of an event does not change after calculation, it is no longer propagated downstream. This mechanism simulates the propagation characteristics of delays gradually spreading from the source and naturally dissipating when the original planned redundancy time is sufficient, allowing the algorithm to adjust only within the necessary range and significantly improving computational efficiency.

[0044] Detailed explanation of step S04: Forward assignment process The basic principle of the positive assignment process is as follows: events are sequentially taken out from the set of events to be adjusted, and for events whose operation time has been determined for all their associated events, the earliest feasible operation time for the event is calculated.

[0045] Specifically, during the forward assignment process, when calculating the interval travel time, since the arrival event is assigned before the departure event, the actual stop type (through or stop) of the train at the station cannot be determined when calculating the earliest feasible time of the arrival event. Therefore, the forward assignment stage uniformly calculates the minimum interval travel time corresponding to the originally planned stop type. Any resulting travel time deviation is corrected during the reverse correction process in step S05.

[0046] The arrival event The earliest feasible operation time is calculated using the following formula: In the formula, The originally scheduled arrival time of the arrival event; This refers to the arrival time of the trains preceding it in the arrival order at this station; Minimum arrival interval; This is the departure time of this train at the previous station; The minimum running time for this section, calculated according to the originally planned stop type; The departure time of the train ahead, which is subject to track capacity constraints; The interval is for the same track. When a related event is an empty identifier... When the constraint term is not involved in the above maximum value operation, it is not considered.

[0047] The departure event The earliest feasible operation time is calculated using the following formula: In the formula, The original planned departure time for the aforementioned departure event; This refers to the departure time of the trains preceding it in the departure order at this station. Minimum departure interval; This is the arrival time of this train at this station; This is the minimum stopping time.

[0048] The above assignment strategy assigns the earliest feasible time to each event, thereby making full use of the redundant time and buffer time in the original operation plan to absorb delays. After all the events to be adjusted have been assigned values, the resulting operation plan with the minimum total delay under the current job sequence is obtained.

[0049] Detailed explanation of step S05: Reverse correction process While the positive assignment can quickly generate an execution plan, it may lead to the following two types of situations that require correction: First, the travel time within the section exceeds the safety limit. Since the positive assignment targets the earliest feasible time, if a train's arrival time at a station is delayed due to interval constraints or other reasons, while the departure time at the previous station remains unchanged, the travel time within that section (i.e., the difference between the arrival time and the departure time) may far exceed the normal value. If the train follows this plan, it will result in prolonged low-speed operation within the section, or even be forced to stop in tunnels, bridges, or other areas lacking safe stopping conditions.

[0050] Secondly, changes in stop types can lead to insufficient running time in the section. As described in step S04, the forward assignment stage calculates the running time in the section according to the original planned stop type; however, after the assignment is completed, if the actual operation type of the train at a certain station is different from the original plan (for example, the original plan was to pass through, but there is a difference between the arrival time and departure time in the assignment result, and it actually becomes a stop operation), then the running time of the previous section must include the additional time for deceleration upon entering the station, which may result in the actual pure running time not meeting the minimum requirement.

[0051] To address the aforementioned problems, this invention stipulates that the pure running time of all trains within the section must not exceed [a certain limit]. ,in This is the minimum pure running time corresponding to the actual stop type for this section. This represents the maximum allowed extension ratio. When the above anomaly is detected, the time is corrected by progressively tracing back upstream events along the timeline from the current event until an upstream node that does not require correction is reached. Specifically: (1) Reverse correction for departure events: When a train changes from a planned through stop to an actual stop at a station, the travel time of the previous section must include additional deceleration time, which may result in a pure travel time lower than the minimum. In this case, the arrival time at the station is recalculated to meet the minimum pure travel time constraint calculated according to the actual stop type. If the adjusted arrival time is still earlier than the departure time, and the difference between the two meets the minimum stop time constraint, the arrival time is directly corrected, and the upstream check of the previous section continues; otherwise, the arrival time is set to equal the departure time (i.e., the non-stop state is restored), and the upstream backtracking continues.

[0052] (2) Reverse correction for arrival events: When the pure running time of an interval exceeds the safety limit, the departure time of the preceding station must be postponed to the latest necessary time to meet the safety constraints. The adjusted departure time of the preceding station is calculated using the following formula: In the formula, The current arrival time of the event. This represents the maximum permissible running time for that interval. The above adjustments compress the interval running time to a safe range, and then the system continues to trace back upstream to check whether any new anomalies have been generated in previous intervals as a result.

[0053] Through the aforementioned reverse correction mechanism that gradually traces back upstream, it is ensured that the running time of all intervals in the final generated operation plan is within a safe range.

[0054] Specific Implementation Cases by Figure 4 and Figure 5 Let's take an example. Suppose a city rail transit line has 5 stations (station A to station E), where station A is the first station in the northbound direction and station E is the last station in the northbound direction. Each station has only one track for train operations, and there are 2 northbound trains operating according to a predetermined schedule. Suppose that an interruption event occurs between 11:30 and 12:00 in the section "station C → station B", during which trains are prohibited from passing through (operation time parameters for each section). The value is 0.5, and the start / stop additional time is 30 seconds.

[0055] First, step S01 is executed, which establishes an adjustment association table and an adjustment transmission table for all train events based on the station operation sequence.

[0056] Then, execute step S02 (conversion of impact of sudden events), find all train events in the departure sequence of station C whose original planned departure time falls between 11:30 and 12:00, and uniformly change their departure time at station C to 12:00.

[0057] Next, execute step S03 (initialization of the event set to be adjusted), and add the departure events of train 1 and train 2 at station C to the event set to be adjusted.

[0058] After entering the iterative loop, the algorithm sequentially retrieves the events to be adjusted and executes step S04 (forward assignment) to calculate the earliest feasible time for each event. Taking train 1 as an example, its original departure time from station B was 11:32. After adjustment in step S02, it is postponed to 12:00. This delay propagates through the adjustment propagation table to the arrival event of train 1 at station B and subsequent events at other stations, gradually extending downstream. Simultaneously, the postponement of train 1's departure time at station C may also affect the arrival event of train 2 at station C due to arrival / departure interval constraints.

[0059] Specifically, train 2 was originally scheduled to depart from station B at 11:44 and arrive at station C at 11:51. Due to a change in the departure time of train 1 at station C, the arrival time of train 2 at station C was postponed to 12:02, while its departure time from station B remained at 11:44. This resulted in an actual travel time of 12:02 - 11:44 = 18 minutes, far exceeding the safety limit of 10 minutes (i.e., 0.5 + 0.5 + (7 - 0.5 - 0.5) × (1 + 0.5)). The system triggered step S05 (reverse correction), and the adjusted departure time from station B was calculated according to the formula: The departure time of train 2 at station B will be postponed from 11:44 to 11:52 (correspondingly extending its dwell time at station B), reducing the travel time in this section to 10 minutes. The time change caused by this correction will again expand the set of events to be adjusted by adjusting the transfer table.

[0060] The iteration terminates when all events in the set of events to be adjusted have been processed and no new time changes occur, and the final optimal execution plan is output. The plan satisfies all execution constraints, and the time of each event is its earliest feasible value, ensuring global optimality under a given job order.

[0061] This invention also provides an electronic device including a central processing unit (CPU), which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) or loaded from a storage unit into a random access memory (RAM). The RAM may also store various programs and data required for device operation. The CPU, ROM, and RAM are interconnected via a bus. Input / output (I / O) interfaces are also connected to the bus.

[0062] Multiple components in the device are connected to the I / O interface, including: input units such as keyboards and mice; output units such as various types of displays and speakers; storage units such as disks and optical discs; and communication units such as network interface cards (NICs), modems, and wireless transceivers. The communication unit allows the device to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0063] The processing unit executes the various methods and processes described above, such as methods S01 to S05. For example, in some embodiments, methods S01 to S05 may be implemented as computer software programs tangibly contained in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program may be loaded and / or installed on the device via ROM and / or a communication unit. When the computer program is loaded into RAM and executed by the CPU, one or more steps of methods S01 to S05 described above may be performed. Alternatively, in other embodiments, the CPU may be configured to execute methods S01 to S05 by any other suitable means (e.g., by means of firmware).

[0064] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0065] The program code used to implement the methods of the present invention can be written in any combination of one or more programming languages. This program code can be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing device, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code can be executed entirely on the machine, partially on the machine, as a standalone software package partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0066] In the context of this invention, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media can include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0067] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for rapidly generating train operation plans based on a two-way adjustment strategy, characterized in that, The method includes: Step S1, establish a correlation model between train events: based on the known station operation sequence, establish an adjustment correlation table and an adjustment transmission table for each train event. The adjustment correlation table is used to record which upstream events directly constrain the current event, and the adjustment transmission table is used to record which downstream events the time adjustment of the current event will be directly transmitted to. Step S2, Transformation of the impact of emergencies: The actual impact of three typical emergencies, namely train slowdown, section interruption, and speed limit in section, is uniformly transformed into the assignment constraints of the corresponding train event time. Step S3, Initialization of the set of events to be adjusted: Based on the type of emergencies and changes in the order of operations, determine the initial range of train events that need to be adjusted and construct the set of events to be adjusted; Step S4, positive assignment: Take out events sequentially from the set of events to be adjusted, and calculate the earliest feasible operation time for each train event along the positive direction of the time axis; Step S5, Reverse Correction: Based on the positive assignment result, check whether the running time of each train in the section exceeds the safe range. If the running time exceeds the limit or the running time is insufficient due to the change of the stop type, backtrack from the downstream event to adjust the time of the upstream event.

2. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, The station operation sequence in step S1 is the order of arrival and departure of trains at each station. For each station, the station operation sequence specifies the order in which trains arrive at the station and the order in which they depart from the station.

3. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, The adjustment of the association table in step S1 specifically involves: 101) Regarding the departure event Its operation time is constrained by the following two events: The first is the departure of the train that precedes it in the departure order at this station. The minimum departure interval must be met between the two. ; The second is the arrival of this train at this station. The minimum stopping time between the two must be met. ; The adjustment association table for the departure event is as follows: ; 102) For arrival events Its operation time is constrained by the following three events: The first is the arrival event of the train that precedes it in the arrival order at this station. The minimum arrival interval must be satisfied between the two. ; The second is the train's departure from the previous station. The minimum interval running time must be satisfied between the two. ; Thirdly, there are incidents of trains departing ahead due to track capacity limitations at stations. ; The adjustment association table for the arrival event is as follows: .

4. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 3, characterized in that, The preceding train departure event due to station track capacity limitations Specifically: When the station The number of stock lanes is At that time, under the most unfavorable conditions, assuming the train If all trains that have arrived at this station before the arrival of the train are stopped and each occupying one track, then the train... The prerequisite for arriving at the station is that, among the trains that arrived at this station before it, the [train name] is the [train name] in order of arrival. The train has completed its departure and released the track it occupied; the train That is, the first Two arriving trains must meet the same arrival / departure interval on the same track. .

5. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, The adjustment transfer table in step S1 is the reverse mapping of the adjustment association table. Specifically, if event A appears in the adjustment association table of event B, then event B appears in the adjustment transfer table of event A.

6. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, In step S2, the actual impact of three typical emergencies—train slowdown, section interruption, and section speed limit—is specifically as follows: 201) For train delays, directly modify the original scheduled time of the event to the delayed time, so that the lower bound of the assignment in the subsequent positive assignment process is updated to the delayed time; 202) For section interruption, find all trains whose original planned departure time falls within the interruption period in the departure order of the section entrance station, and uniformly change the departure time of the above trains at that station to the interruption end time. 203) For speed limits in sections, the actual minimum pure running time is dynamically calculated based on the specific time each train enters the section.

7. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 6, characterized in that, In step 203), the actual minimum pure running time is dynamically calculated based on the specific time each train enters the section, specifically as follows: If the train enters the section after the speed limit has expired, its travel time will not be affected. If the train travels entirely within the speed limit period, the travel time will be calculated based on the travel time under the speed limit conditions. If the train runs across the start and end times of the speed limit, the section will be divided into a normal operating section and a speed-limited operating section, calculated separately and then combined.

8. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, Step S3 specifically includes: 301) When solving based on the original operation sequence, the station operation sequence is consistent with the original plan before the occurrence of the emergency. At this time, the set of events to be adjusted only includes train events directly affected by the emergency. 302) When solving based on the changed work order, after the station work order is manually adjusted by the dispatcher or re-determined by the operation plan optimization algorithm, the arrival or departure order of trains at some stations has changed relative to the original plan. At this time, in addition to adding the events directly affected by the sudden event to the set of events to be adjusted, it is also necessary to compare the differences between the old and new work orders and add the arrival and departure events of the relevant trains at the stations where the work order has changed to the set of events to be adjusted.

9. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, Step S3 further includes: in subsequent iterative adjustment processes, whenever the time of an event changes after calculation in step S4 or step S5, all potentially affected downstream events are searched through the adjustment propagation table and added to the set of events to be adjusted; if the time of an event does not change after calculation, it is no longer propagated downstream.

10. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, The earliest feasible operation time in step S4 includes the arrival event. Earliest feasible operation time and departure event The earliest feasible operation time; The arrival event The earliest feasible operation time is calculated using the following formula: In the formula, The originally planned arrival time of the event; This refers to the arrival time of the trains preceding it in the arrival order at this station; Minimum arrival interval; This is the departure time of this train at the previous station; The minimum running time for this section, calculated according to the originally planned stop type; The departure time of the train ahead, which is subject to track capacity constraints; For the same track, the interval is between; The departure event The earliest feasible operation time is calculated using the following formula: In the formula, The original planned departure time for the event; This refers to the departure time of the trains preceding it in the departure order at this station. Minimum departure interval; This is the arrival time of this train at this station; This is the minimum stopping time.

11. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, The reverse correction in step S5 includes reverse correction for the departure event and reverse correction for the arrival event. The reverse correction for the starting event specifically refers to: When a train changes its planned passage to an actual stop at a station, the travel time of the previous section must include additional deceleration time. The arrival time at this station is then recalculated to meet the minimum pure travel time constraint calculated according to the actual stop type. If the adjusted arrival time is still earlier than the departure time, and the difference between the two meets the minimum stop time constraint, the arrival time is directly corrected, and the upstream section is checked again. Otherwise, the arrival time is set to equal the departure time, and the train continues to backtrack upstream. The reverse correction for the arrival event specifically refers to: When the total running time of a section exceeds the safety limit, the departure time of the preceding station must be postponed to the latest necessary time to meet the safety constraints. The adjusted departure time of the preceding station is calculated according to the following formula: In the formula, The current arrival time of the event. This is the maximum allowed running time for this interval. The maximum allowable extension ratio, This is the minimum pure running time corresponding to the actual stop type for this section.

12. The method for rapid generation of train operation plans based on a two-way adjustment strategy according to claim 1, characterized in that, Steps S4 and S5 constitute an iterative loop: whenever the time of an event changes after calculation, the downstream events that may be affected are added to the set of events to be adjusted through the adjustment transfer table; when the set of events to be adjusted is empty and no new time changes occur, the iteration terminates and the optimal running plan is output.

13. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 12.

14. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method as described in any one of claims 1 to 12.

Citation Information

Patent Citations

  • High-speed train operation adjustment modeling and evaluation method and device for delay propagation

    CN115034065A