Train operation sequence conflict identification and resolution method, system, equipment and medium

Abstract

The invention discloses a train operation sequence conflict identification and resolution method, system and device and a medium, and the method comprises the steps: receiving an input whole-line train operation sequence which comprises the arrival sequence and departure sequence of trains in each station and at the two ends of an interval; identifying station track conflicts by checking whether the arrival sequence and the departure sequence of the trains in the same station meet the number or sequence constraint of the tracks or not; by checking the consistency of the departure order and the arrival order of the passing trains between the adjacent stations, the interval overtravel conflict is identified; and adopting a minimum change adjustment strategy, only carrying out local position interchange on the trains with the running conflicts and the trains at the corresponding target positions, and outputting an optimized train operation sequence. Compared with the prior art, the method has the advantages that conflict recognition based on logic sequence comparison and minimum change resolution of sequence exchange are achieved, efficient and automatic conversion from any input operation sequence to a global feasible optimization sequence is achieved, the adjustment range is reduced to the maximum extent, and the plan stability is guaranteed.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of automatic control technology of rail transit trains, and in particular to a train operation sequence conflict identification and resolution method, system, device and medium. BACKGROUND

[0002] With the continuous improvement of the scale and density of rail transportation, abnormal events occurring in the process of train operation may cause a series of train operation conflicts. In a high-density and high-complexity road network, once a train is delayed, its impact will quickly expand. Therefore, quickly and effectively adjusting the train operation plan and timely eliminating operation conflicts are of great significance to ensuring the safety and efficiency of rail transportation.

[0003] Currently, the adjustment of train working diagrams mainly relies on dispatchers to make manual adjustments based on experience. This approach is difficult to fully consider various constraint conditions in a complex road network environment, and it pays too much attention to the fine-tuning of specific times, making it difficult to obtain a globally optimal adjustment scheme. Existing operation conflict identification methods mainly focus on train running time optimization under fixed operation sequences, or adjust local train operation times to resolve operation conflicts caused by unreasonable operation sequences. The former simplifies the complexity of problem solving while limiting the solution space to some extent, ignoring the possibility of obtaining a better solution by adjusting the operation sequence. The latter mainly focuses on local conflict processing when considering operation sequence adjustment, and does not fully consider the chain reaction that may be triggered by conflict adjustment. There is room for improvement in achieving global minimization of the adjustment range.

[0004] From the nature of train working diagram adjustment, a reasonable train operation sequence is the key to efficiently solving the working diagram. The operation sequence determines the order of train occupation of track resources and directly affects the search direction and search efficiency of the working diagram. When the operation sequence is reasonable, the subsequent specific time arrangement will quickly converge in the correct solution space. Conversely, if there is a conflict in the operation sequence, the search process will be trapped in an invalid region, increasing the computational complexity and possibly resulting in an infeasible solution. Therefore, by quickly identifying conflicts in the operation sequence and making timely corrections, the search direction of the working diagram solution can be effectively guided, avoiding the waste of a large amount of computing resources in the wrong solution space.

[0005] After searching, Chinese patent publication number CN111645733A discloses a train track automatic adjustment method, which receives train stage plan information of a station, judges whether there is a space-time conflict according to the space-time sequence relationship of the train track operation plan, and performs station fine card control check in combination with the technical operation requirements of the train, and finally realizes conflict resolution by re-distributing the conflict train to other available tracks in the same station. However, the core of the conflict resolution strategy of this method is resource redistribution, that is, when a conflict occurs in a track, the train is adjusted to other idle tracks in the station that meet the technical operation requirements, and the adjustment strategy changes the original track arrangement of the train operation, which may cause a large adjustment range and cannot solve the operation conflict caused by unreasonable operation sequence.

[0006] Therefore, how to quickly identify conflicts in train operation sequences and resolve global conflicts through minimal changes to maintain the original operation plan structure while ensuring safe operation is a technical problem to be solved. SUMMARY

[0007] The purpose of the present application is to overcome the defects of the prior art and provide a train operation sequence conflict identification and resolution method, system, device and medium.

[0008] The purpose of the present application can be achieved by the following technical solutions: According to a first aspect of the present application, a train operation sequence conflict identification and resolution method is provided, which comprises: receiving an input full-line train operation sequence, including the arrival and departure sequence of trains in each station and at both ends of the section; identifying station track conflicts by checking whether the arrival and departure sequence of trains in the same station meets the number or sequence constraints of the track; identifying section overtaking conflicts by checking the consistency of the departure and arrival sequence of trains between adjacent stations; adopting a minimal change adjustment strategy to only exchange the local positions of trains with operation conflicts and corresponding target positions; generating and outputting an optimized train operation sequence after local position exchange.

[0009] As a preferred technical solution, identifying the station track conflict specifically comprises: For the case where the station operation track of each train is not specified, check whether the number of trains staying in the station when each train departs is less than or equal to the number of available tracks in the station: If not, it is determined that there is a station track conflict, wherein, the arrival sequence of the train in the station is determined. For the train at the station The order of departure For the station The number of available lanes; For situations where the operating tracks of each train station are clearly defined, compare the set of operating trains on the same track g. The arrival order and departure order are determined; if the arrival order and departure order are inconsistent, it is determined that there is a track conflict at the station.

[0010] As a preferred technical solution, resolving track conflicts at stations where the operating tracks for each train station are not clearly defined specifically includes: One of the arrival order and departure order of a fixed station is used as the baseline sequence, and the other is used as the sequence to be adjusted; Iterate through the sequence to be adjusted. For the current train, if it does not meet the constraints... Then calculate the earliest feasible starting order. , ; The train is located in the sequence to be adjusted. Trains in different positions are swapped.

[0011] As a preferred technical solution, resolving the station track conflicts of clearly defined train operation tracks specifically includes: Obtain the set of trains operating on track g where the conflict occurred. ; The work sequence of one of the fixed departure or arrival stations is the baseline sequence; Another station's operation sequence belongs to Trains are replaced in the order they appear in the baseline sequence, while keeping the original order of trains that do not belong to track g unchanged.

[0012] As a preferred technical solution, identifying the crossover conflict in the interval specifically includes: Obtain the departure order of the station at the entrance of the section and the arrival order of the station at the exit of the section; Taking the intersection of the departure order and the arrival order yields the set of trains passing through the section. ; The trains in the train set passing through the section are sorted according to the departure order and the arrival order, respectively, to obtain a first sorting result and a second sorting result; If the first sorting result is inconsistent with the second sorting result, it is determined that there is a range crossover conflict.

[0013] As a preferred technical solution, resolving the crossover conflict in the interval specifically includes: The operation sequence of the station at one end of the fixed section is the reference sequence, the operation sequence of the station at the other end is the sequence to be adjusted, and the adjusted operation sequence is the optimized sequence; obtaining a set of trains passing through the section , and sorting the trains according to the order of the trains in the reference sequence; initializing the optimized sequence as empty and initializing an index n as 0; traversing each train in the sequence to be adjusted, if the train belongs to , adding the train to the optimized sequence and incrementing n by 1, otherwise adding the train directly to the optimized sequence.

[0014] As a preferred technical solution, the local position interchanging involves the exchange of only two train operation positions each time.

[0015] As a preferred technical solution, the method further comprises: re-executing the identification of the station track conflict and the section overtaking conflict on the optimized train operation sequence; outputting the optimized train operation sequence only when no running conflict is identified.

[0016] According to a second aspect of the present application, a system for implementing the train operation sequence conflict identification and resolution method is provided, the system comprising: an operation sequence input module receiving an inputted train operation sequence of the whole line; a conflict detection module communicatively connected with the operation sequence input module, identifying running conflicts in the train operation sequence based on a comparison of logical relationships between train operation sequences, the running conflicts including station track conflicts and section overtaking conflicts; a minimum change optimization module communicatively connected with the conflict detection module, adopting a minimum change adjustment strategy to resolve the running conflicts by adjusting the positions of the conflict trains in the sequence; a sequence output module communicatively connected with the minimum change optimization module, outputting an optimized train operation sequence with globally minimum changes relative to the inputted operation sequence, and generating an adjustment report and change analysis data.

[0017] As a preferred technical solution, the conflict detection module comprises a station track conflict detection submodule and a section overtaking conflict detection submodule, and performs fast conflict identification based on constraint conditions, and outputs conflict types and position information; The minimum change optimization module integrates sequence adjustment algorithms, including a fixed arrival order adjustment algorithm, a fixed departure order adjustment algorithm, and a section overtaking adjustment algorithm, to realize conflict resolution with the minimum change strategy.

[0018] ​​As a preferred technical solution, the system further comprises: The constraint verification module is in communication connection with the minimum change optimization module, performs constraint condition checking on the optimized train working sequence, and ensures that all operation conflicts are resolved.

[0019] According to a third aspect of the present application, an electronic device is provided, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the method when executing the program.

[0020] According to a fourth aspect of the present application, a computer readable storage medium is provided, which stores a computer program, and the program is executed by a processor to implement the method.

[0021] Compared with the prior art, the present application has the following advantages: 1. The present application can receive any initial working sequence with conflicts, and generate a feasible sequence with the minimum change range from the original sequence through global resolution based on conflict identification and sequence exchange based on logical sequence comparison, effectively improving the efficiency and accuracy of conflict processing.

[0022] 2. The present application uses a conflict detection method based on working sequence comparison, which can comprehensively identify station track constraint and section overtaking constraint conflicts, avoiding complex time calculation, and improving calculation efficiency and accuracy of identification results.

[0023] 3. The present application strictly follows the minimum change principle in the conflict resolution process, realizes the minimum range adjustment through sequence exchange strategy, ensures that the output optimized working sequence has the minimum change from the input sequence, and maximizes the overall framework and diversity characteristics of the original working sequence, reducing the interference of dispatching adjustment on the established operation plan.

[0024] 4. The present application realizes a complete and automatic process from conflict identification to resolution, avoids the chain reaction caused by local adjustment, and provides a stable and reliable sequence basis for subsequent operation diagram solving.

[0025] 5. The present application effectively reduces the work intensity of dispatchers, reduces the excessive dependence on personal experience, improves the automation level of train operation scheduling, and is particularly suitable for operation diagram adjustment requirements in complex road network environment. BRIEF DESCRIPTION OF DRAWINGS

[0026] Figure 1 The method flowchart of the present application is shown in the figure; Figure 2 The station track conflict detection flowchart of the present application is shown in the figure; Figure 3 The section overtaking conflict detection flowchart of the present application is shown in the figure; Figure 4This is an example diagram comparing the job sequence before and after optimization in a specific operating scenario of the present invention; Figure 5 This is a system architecture diagram of the present invention; 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] Example 1: This invention provides a method for identifying and resolving train operation sequence conflicts, such as... Figure 1 As shown, the method mainly includes the following steps: Step S1: The system receives the input train operation sequence data for the entire line. This data includes the train arrival and departure sequences for all stations on the line, as well as the order relationships between adjacent stations. The system establishes station track conflict detection and section overtaking conflict detection mechanisms for the input train operation sequence, performs constraint checks, and parses the arrival and departure sequences for each station to establish station track capacity constraint detection models and section overtaking constraint detection models, preparing for subsequent conflict identification. Specifically, the station track conflict detection model checks whether the arrival and departure sequences of trains within each station meet the capacity constraints of the number of tracks within the station; the section overtaking conflict detection model checks whether the departure and arrival sequences of trains passing between adjacent stations are consistent, ensuring no illegal overtaking within the section.

[0029] Step S2: Based on the operation sequence comparison method, the system systematically identifies station track conflicts and section overtaking conflicts in the input operation sequence. The system starts a parallel detection mechanism. The station track conflict detection module checks the track capacity constraints of each train station by station according to the line sequence. The section overtaking conflict detection module compares the consistency of the entry and exit order of trains between adjacent stations section by section to comprehensively identify various types of operational conflicts. Step S21: As Figure 2 As shown, track conflict detection at stations includes two detection scenarios: (1) For situations where the operating tracks for each train station are not clearly defined: check whether each train meets the requirements. The constraints, among which This refers to the order in which trains arrive at this station. This refers to the departure order of trains at this station. For the station The number of available tracks, the physical meaning of this constraint is to ensure that every train entering the station can find an available track at any time, and to avoid the inability to receive new trains due to track saturation; (2) For the situation where the operating tracks of each train station are clearly defined: Before performing the basic capacity constraint check, it is necessary to first check whether the arrival and departure sequences of the same track are consistent, by setting up the operating train set of the designated track g. Sort the trains by arrival order and departure order respectively, and compare whether the train objects at each position in the sorting results are the same; Step S22: As Figure 3 The image shows the cross-traffic conflict detection for different intervals: Let the entrance station of the section be The exit station is Get station Departure order and the station Arrival order The set of trains passing through the section is obtained by taking the intersection of the trains in the operation sequence of the two stations. ,Will The trains in the trains are arranged according to the work sequence. and Obtain by sorting and If the train objects stored at each position in both sets are the same, then the interval overtravel restriction is satisfied; otherwise, there is a running conflict.

[0030] Step S3: Adopt the minimum change adjustment strategy, resolve all identified operational conflicts through sequence swapping and position adjustment, and generate an optimized job sequence that meets the constraints; Step S31: For track conflicts at the station, the system invokes the minimum change adjustment strategy to perform sequence swapping: (1) For situations where the operating tracks for each train station are not clearly defined: fixed station arrival order Keep it unchanged, check the departure order of each station one by one. The trains in the train are arranged with a station departure sequence length of 1. Initialize the departure order index ,when Get the current train Calculate their arrival order ,like but Increment by 1; otherwise, calculate the earliest feasible departure order. The train and Trains can be swapped at different locations; alternatively, the departure order from fixed stations can be kept unchanged while the arrival order is adjusted. (2) For cases where the operating tracks of each train station are clearly defined: the same track is obtained from the station. Work train assembly According to a fixed and unchanging station operation sequence Adjust the station operation sequence one by one as needed. Specifically, it is implemented by traversing Each train in the process, if the train belongs to Then replace the current position with Trains in the corresponding order will be selected; otherwise, the original train order will remain unchanged. During the process, the original operating order of trains on other tracks will remain unchanged; only the order between trains operating on that track will be changed. Step S32: For crossover conflicts within a section, the system invokes a strategy that fixes one end and adjusts the other end to rearrange the train passing order. By using a fixed station operation sequence and the station operation sequence that needs to be adjusted Find the intersection to obtain the interval through the train set ,according to The order in which the trains appeared Sort the jobs. Then initialize the job sequence table. null and index If the value is 0, iterate through the data. Each train ,like Then Add to And increment n by 1, otherwise... Add directly This process ensures that the order of trains entering and exiting is consistent while maintaining the original operational order of non-passing trains and passing trains.

[0031] The method of this invention can quickly and accurately identify logical conflicts by comparing the arrival and departure order of trains within a station and the passing order at both ends of a section, without the need for complex time calculations. It adopts a minimum change adjustment strategy with sequence swapping as the core to resolve conflicts globally, generating an optimized solution with the smallest change range from the original sequence. This effectively improves the efficiency and accuracy of conflict handling and can maintain the diversity and stability of the established operation plan to the greatest extent, providing a reliable foundation for the efficient and automatic adjustment of subsequent train timetables.

[0032] by Figure 4 Taking the specific operating scenario shown as an example, the method of the present invention will be explained in detail: The diagram includes stations A, B, and C, as well as sections AB and BC. The initial input sequence is as follows: Station A: Arrival Order =[tr1, tr2, tr3], departure order = [tr3, tr2, trl], Station A has only 1 track ( = 1); Station B: arrival order = [tr2, trl, tr3], departure order = [tr2, trl, tr3], Station B has 2 tracks ( = 2); Station C: arrival order = [tr2, trl, tr3], departure order = [tr2, trl, tr3], Station B has 1 track ( = 1); A-B section and B-C section pass the train set [trl, tr2, tr3].

[0033] Conflict identification and resolution process: Check whether the number of trains staying in Station A when each train departs is less than or equal to the number of available tracks in the station, check tr3: = 3, = 1, calculate 3-1 = 2 > (1-1) = 0, there is a track conflict; Calculate the earliest feasible departure order of tr3 , ; Exchange the sequence position of tr3 and trl, at this time the departure order of Station A is = [trl, tr2, tr3]; Arrival order = [tr2, trl, tr3], comparison found position 0 (trl ≠ tr2), position 1 (tr2 ≠ trl), position 2 (tr3 = tr3), there is a section overtaking conflict; Fix = [trl, tr2, tr3], adjust : Take intersection with and , get = [trl, tr2, tr3]; Traverse the original = [tr2, trl, tr3] to adjust: Meet tr2 (belongs to ), take [0] = trl to add to the new sequence ; Meet trl (belongs to ), take [1] = tr2 to add to the new sequence ; tr3 (belongs to ), take [2]=tr3 add new sequence ; get new arrival order =[tr1, tr2, tr3]; continue to detect that station C does not contain a track conflict, and the B-C section does not exist an interval overtaking conflict; finally output the optimized operation sequence: station A: arrival [tr1, tr2, tr3], departure [tr1, tr2, tr3]; station B: arrival [tr1, tr2, tr3], departure [tr2, tr1, tr3]; station C: arrival [tr2, tr1, tr3], departure [tr2, tr1, tr3]; all conflicts are resolved, and the optimized sequence compared with the original sequence only makes necessary and minimum range order adjustment.

[0034] Example 2: The application provides a system for implementing the method, as shown in Figure 5 the system comprises: an operation sequence input module: responsible for receiving and analyzing the whole line train operation sequence from external systems or manual input, supporting multi-format data analysis, and converting external data into a unified sequence data structure inside the system; a conflict detection module: containing a station track conflict detection submodule and an interval overtaking conflict detection submodule, based on constraint conditions for fast conflict identification, outputting conflict type and location information; a minimum change optimization module: integrating multiple sequence adjustment algorithms, including fixed arrival order adjustment algorithm, fixed departure order adjustment algorithm and interval overtaking adjustment algorithm, realizing conflict resolution of minimum change strategy; the fixed arrival order adjustment algorithm and the fixed departure order adjustment algorithm correspond to the conflict resolution method of step S31 of the station track conflict in example 1; the interval overtaking adjustment algorithm corresponds to the conflict resolution method of step S32 of the interval overtaking conflict in example 1; a constraint verification module: after conflict resolution, the optimized operation sequence is checked for integrity and constraint conditions, ensuring that it meets all station track and interval overtaking constraints, and ensuring the correctness and feasibility of the output result; a sequence output module: responsible for formatting the optimized operation sequence, outputting to downstream systems or user interfaces, and generating detailed adjustment reports, listing all discovered conflicts, taken adjustment actions and change analysis data.

[0035] The system integrates a dedicated processing module, can automatically execute the whole process from sequence input, conflict detection, accurate resolution to result verification and output, can realize global conflict resolution, avoid chain reaction caused by local adjustment, significantly improve the intelligent level and reliability of train operation scheduling, effectively reduce the work burden of the dispatcher, and reduce the dependence on personal experience.

[0036] Embodiment 3: The electronic device includes a central processing unit (CPU) that 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). In the RAM, various programs and data required for device operation can also be stored. The CPU, ROM, and RAM are connected to each other through a bus. An input / output (I / O) interface is also connected to the bus.

[0037] A plurality of components in the device are connected to the I / O interface, including: an input unit such as a keyboard, a mouse, and the like; an output unit such as various types of displays, a speaker, and the like; a storage unit such as a magnetic disk, an optical disk, and the like; and a communication unit such as a network card, a modem, a wireless communication transceiver, and the like. The communication unit allows the device to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0038] The processing unit performs the various methods and processes described above, such as methods S1-S3. For example, in some embodiments, methods S1-S3 can be implemented as a computer software program that is tangibly embodied in a machine-readable medium, such as the storage unit. In some embodiments, part or all of the computer program can be loaded and / or installed on the device via the ROM and / or the communication unit. When the computer program is loaded into the RAM and executed by the CPU, one or more steps of methods S1-S3 described above can be performed. Alternatively, in other embodiments, the CPU can be configured to perform methods S1-S3 by any other appropriate means (e.g., by means of firmware).

[0039] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, and without limitation, exemplary types of hardware logic components that can be used include: field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip systems (SOCs), complex programmable logic devices (CPLDs), and the like.

[0040] Program code for carrying out methods of the present application 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 apparatus to produce a machine, such that the program code, when executed by the processor or controller, produces a means for implementing the functions / operations specified in the flowchart diagrams and / or block diagrams. The program code can be executed entirely on a machine, partially on a machine, partially on a machine as a stand-alone software package, or entirely on a remote machine or server.

[0041] In the context of the present application, a machine-readable medium can be a tangible medium that can contain or store program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. Machine-readable storage medium can include, but are not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium will include one or more lines of electrical connections, portable computer disks, hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or Flash memory), optical fibers, portable compact disc read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.

[0042] The above descriptions are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present application, and these modifications or replacements should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A method for identifying and resolving train operation sequence conflicts, characterized in that, include: Receive the input train operation sequence for the entire line, including the arrival and departure sequences of trains within each station and at both ends of the section; Track conflicts at a station can be identified by checking whether the arrival and departure order of trains within the same station meets the constraints on the number or order of tracks. Crossing conflicts between adjacent stations can be identified by checking the consistency between the departure and arrival orders of trains passing through them. A minimal change adjustment strategy is adopted, and only partial position swaps are performed on trains with operational conflicts and trains at corresponding target locations; Generate and output the optimized train operation sequence after local position swapping.

2. The method for identifying and resolving train operation sequence conflicts according to claim 1, characterized in that, Identifying the track conflicts at the station specifically includes: For cases where the operating tracks for each train station are not clearly defined, check one by one whether the number of trains stopped at the station at the time of departure is less than or equal to the number of available tracks at that station: If the conditions are not met, then a track conflict at the station is determined to exist. For the train at the station The order of arrival, For the train at the station The order of departure For the station The number of available lanes; For situations where the operating tracks of each train station are clearly defined, compare the set of operating trains on the same track g. The arrival order and departure order are determined; if the arrival order and departure order are inconsistent, it is determined that there is a track conflict at the station.

3. The method for identifying and resolving train operation sequence conflicts according to claim 2, characterized in that, Resolving track conflicts at stations where the operating tracks for each train station are not clearly defined specifically includes: One of the arrival order and departure order of a fixed station is used as the baseline sequence, and the other is used as the sequence to be adjusted; Iterate through the sequence to be adjusted. For the current train, if it does not meet the constraints... Then calculate the earliest feasible starting order. , ; The train is located in the sequence to be adjusted. Trains in different positions are swapped.

4. The method for identifying and resolving train operation sequence conflicts according to claim 2, characterized in that, The specific steps to resolve track conflicts at each train station include: Obtain the set of trains operating on track g where the conflict occurred. ; The work sequence of one of the fixed departure or arrival stations is the baseline sequence; Another station's operation sequence belongs to Trains are replaced in the order they appear in the baseline sequence, while keeping the original order of trains that do not belong to track g unchanged.

5. The method for identifying and resolving train operation sequence conflicts according to claim 1, characterized in that, Identifying the crossover conflict in the aforementioned interval specifically includes: Obtain the departure order of the station at the entrance of the section and the arrival order of the station at the exit of the section; Taking the intersection of the departure order and the arrival order yields the set of trains passing through the section. ; The trains in the train set passing through the section are sorted according to the departure order and the arrival order, respectively, to obtain a first sorting result and a second sorting result; If the first sorting result is inconsistent with the second sorting result, it is determined that there is a range crossover conflict.

6. The method for identifying and resolving train operation sequence conflicts according to claim 5, characterized in that, The process of resolving the crossover conflict in the aforementioned interval specifically includes: The operation sequence at one end of a fixed section is the baseline sequence, the operation sequence at the other end is the sequence to be adjusted, and the adjusted operation sequence is the optimized sequence. Obtain the set of trains passing through the section. And according to the train order in the baseline sequence Sort; The optimized sequence is initialized to empty, and the index n is initialized to 0. Iterate through each train in the sequence to be adjusted. If the train belongs to Then Add the train to the optimization sequence and increment n by 1; otherwise, add the train directly to the optimization sequence.

7. The method for identifying and resolving train operation sequence conflicts according to claim 1, characterized in that, Each local position swap involves only the exchange of two train operating positions.

8. The method for identifying and resolving train operation sequence conflicts according to claim 1, characterized in that, The method further includes: The identification of station track conflicts and section overtaking conflicts is re-executed for the optimized train operation sequence; The optimized train operation sequence is output only when no operational conflicts are identified.

9. A system for implementing the train operation sequence conflict identification and resolution method according to any one of claims 1-8, characterized in that, The system includes: The operation sequence input module receives the input operation sequence for all trains along the entire line. The conflict detection module is communicatively connected to the operation sequence input module. Based on the comparison of logical relationships between train operation sequences, it identifies operational conflicts in the train operation sequence, including station track conflicts and section overtaking conflicts. The minimum change optimization module is communicatively connected to the conflict detection module and adopts a minimum change adjustment strategy to resolve the operational conflict by adjusting the position of the conflicting trains in the sequence. The sequence output module is communicatively connected to the minimum change optimization module. It outputs the optimized train operation sequence with the smallest global change range relative to the input operation sequence and generates adjustment reports and change analysis data.

10. The system according to claim 9, characterized in that, The conflict detection module includes a station track conflict detection submodule and an inter-section overtaking conflict detection submodule, which performs rapid conflict identification based on constraints and outputs conflict type and location information. The minimum change optimization module integrates sequence adjustment algorithms, including a fixed arrival order adjustment algorithm, a fixed departure order adjustment algorithm, and an interval overtaking adjustment algorithm, to achieve conflict resolution of the minimum change strategy.

11. The system according to claim 9, characterized in that, The system also includes: The constraint verification module is communicatively connected to the minimum change optimization module to check the constraints of the optimized train operation sequence and ensure that all operational conflicts have been resolved.

12. 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 8.

13. 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 8.

Images