Automatic matching method and device for train working diagram

Abstract

The application provides a train operation diagram automatic matching method and device, wherein the method comprises the following steps: determining a target plan and a target station affected by an adjustment instruction; updating a starting point turning-back state and / or a terminal point turning-back state of the target plan based on an instruction type of the adjustment instruction; determining a first plan sequence with the target station as a terminal station and a second plan sequence with the target station as a starting station; traversing the sorted first plan sequence and the second plan sequence, matching plans with the terminal point turning-back state in the second state in the first plan sequence with plans with the starting point turning-back state in the second state in the second plan sequence in order, constructing a turning-back redemption relationship, and updating the operation diagram based on the turning-back redemption relationship. The automatic matching and updating process of the operation diagram is realized. The automatic processing flow replaces the manual operation mode depending on dispatchers, and significantly improves the efficiency and accuracy of the operation diagram adjustment.

Description

Technical Field

[0001] This invention relates to the field of rail transit technology, and in particular to an automatic matching method and apparatus for train timetables. Background Technology

[0002] A train timetable is a technical document used to show the time when trains run in a railway section and arrive, depart, or pass through stations. It specifies the procedure for each train to occupy a section, the arrival and departure (or passing) times of trains at each station, the running time of trains in the section, and the stopping time. It is the basis for organizing train operations throughout the railway system.

[0003] The train schedule connects multiple planned train services using turnaround caps, representing train services that are fulfilled by the same trainset (actual train) during their round trip. The set of train services connected by turnaround caps is defined as a turnaround relationship. In emergency situations (train malfunctions, ground equipment failures, etc.), train delays are common. In such cases, operations may consider sacrificing some train services to maintain a high overall on-time rate, thus requiring the disruption of the original turnaround relationships. Current methods for handling this scenario typically require operations personnel to manually rematch planned turnaround fulfillments. This manual rematching process is inefficient. Summary of the Invention

[0004] This invention provides an automatic train timetable matching method and apparatus to improve the efficiency of automatic train timetable matching.

[0005] This invention provides an automatic train timetable matching method, comprising the following steps: In response to a timetable adjustment instruction, determine the target schedule and target stations affected by the adjustment instruction; Based on the instruction type of the adjustment instruction, update the starting turnaround status and / or the ending turnaround status of the target plan; both the starting turnaround status and the ending turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; A first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order; Traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0006] According to the automatic matching method for train timetables provided by the present invention, the step of sorting the first plan sequence and the second plan sequence based on time order includes: Obtain the arrival time of each plan in the first plan sequence to the target station, and sort the first plan sequence based on the arrival time; Obtain the departure time of each train in the second plan sequence from the target station, and sort the second plan sequence based on the departure time.

[0007] According to the automatic matching method for train timetables provided by the present invention, the traversal process of the first planning sequence and the second planning sequence includes: Construct a first pointer to the first plan sequence and a second pointer to the second plan sequence; The first plan sequence and the second plan sequence are traversed until the first plan sequence or the second plan sequence has been traversed. The traversal of the first plan sequence and the second plan sequence includes: when the endpoint return state of the plan pointed to by the first pointer is in the first state, pointing the first pointer to the next plan in the sequence; when the starting point return state of the plan pointed to by the second pointer is in the first state, pointing the second pointer to the next plan in the sequence; when both the endpoint return state of the plan pointed to by the first pointer and the starting point return state of the plan pointed to by the second pointer are in the second state, establishing a return realization relationship, and pointing the first pointer and the second pointer to the next plan in the sequence.

[0008] According to the automatic matching method of train timetable provided by the present invention, the adjustment instruction is any one of the following: active abandonment of the fulfillment plan instruction, the instruction to put the standby train set into service, and the instruction to take the train set out of service.

[0009] According to an automatic train timetable matching method provided by the present invention, updating the start-point turnaround status and / or the end-point turnaround status of the target plan based on the instruction type of the adjustment instruction includes: When the adjustment instruction is a proactive abandonment of the plan, both the starting point turnaround state and the ending point turnaround state of the target plan are marked as the first state; When the adjustment instruction is an instruction to put a standby train set into service, the starting turnaround state of the target plan is marked as the first state, and the ending turnaround state of the target plan is marked as the second state; When the adjustment instruction is a train set off from the production line instruction, the destination turnaround status of the target plan is marked as the first status.

[0010] According to the automatic matching method of train timetable provided by the present invention, the plan in the first plan sequence is the downbound arrival plan, and the plan in the second plan sequence is the upbound departure plan.

[0011] The present invention also provides an automatic train timetable matching device, comprising the following modules: The instruction processing module is used to determine the target plan and target station affected by the adjustment instruction in response to the operation diagram adjustment instruction; A marking module is used to update the starting turnaround status and / or the ending turnaround status of the target plan based on the instruction type of the adjustment instruction; the starting turnaround status and the turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; The sequence construction module is used to determine a first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station, and to sort the first planned sequence and the second planned sequence based on time order; The running graph adjustment module is used to traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct a turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0012] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the program to implement the automatic matching method for train timetables as described above.

[0013] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the automatic matching method for train timetables as described above.

[0014] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the automatic matching method for train timetables as described above.

[0015] The automatic train timetable matching method and apparatus provided by this invention transforms operational adjustment needs into a unified, automatically identifiable, and processable state by introducing and updating the origin and destination turnaround states of train plans. Based on this, by arranging the arrival and departure plan sequences of the target station by time and automatically traversing and matching plans in the pending matching state, a new turnaround fulfillment relationship is constructed, realizing the automatic matching and updating process of the timetable. This automated processing flow replaces the manual operation method relying on dispatchers, significantly improving the efficiency and accuracy of timetable adjustments. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0017] Figure 1 This is a flowchart illustrating the automatic matching method for train timetables provided by the present invention.

[0018] Figure 2 This is a schematic diagram of the automatic train timetable matching device provided by the present invention.

[0019] Figure 3 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0020] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this 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 this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0021] Figure 1 This is a flowchart illustrating the automatic train timetable matching method provided by the present invention, as shown below. Figure 1 As shown, the method includes the following: Step 110: In response to the timetable adjustment instruction, determine the target schedule and target station affected by the adjustment instruction; Step 120: Based on the instruction type of the adjustment instruction, update the starting point turnaround status and / or the ending point turnaround status of the target plan; both the starting point turnaround status and the ending point turnaround status include a first state where no turnaround matching is required and a second state where turnaround matching is required; Step 130: Determine a first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station, and sort the first planned sequence and the second planned sequence based on time order; Step 140: Traverse the sorted first plan sequence and second plan sequence, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0022] The automatic train timetable matching method provided by the present invention can be executed by computer equipment, servers or dedicated automation devices deployed in railway dispatching centers or station control centers.

[0023] It should be noted that in railway operations, the train timetable is the foundation for organizing train operations. It connects different train plans through turnaround relationships, representing the sequential operational tasks performed by the same physical trainset (i.e., the actual train). When encountering emergency scenarios such as train delays or equipment failures, the original turnaround relationships may need to be broken and rebuilt to ensure overall operational order and punctuality.

[0024] In step 110, in response to the adjustment instructions of the operation diagram, the target plan and target station affected by the adjustment instructions are determined.

[0025] An adjustment instruction is an event that triggers a rematch of the operation diagram. It can be an operation instruction entered by the operation dispatcher through the human-machine interface in an emergency scenario, or an instruction automatically generated by the automated monitoring system when it detects specific conditions.

[0026] A target plan refers to one or more train operation plans directly related to the adjustment instruction. A train operation plan can be understood as a specific train number. For example, when the instruction is to abandon a pair of turnaround relationships, the target plan consists of the two train plans that constitute that turnaround relationship.

[0027] The target station refers to the geographical location involved in executing the adjustment order, which is usually the train's terminal station, originating station, or important turnaround station. For example, if an arriving train needs to be taken off the line for maintenance at a certain station, then that station is the target station.

[0028] In step 120, based on the instruction type of the adjustment instruction, the starting point turnaround status and / or the ending point turnaround status of the target plan are updated.

[0029] Each train schedule has a turnaround status at the start and end of its route, indicating whether it needs to, is waiting for, or has already completed a match with another schedule.

[0030] In this invention, two core foldback states are specifically defined: First state: Indicates that no return matching is required. This state can include various specific situations, such as: the starting point of a plan has already been redeemed by a vehicle leaving the garage (the starting point has been redeemed), or its destination is a return plan (the destination does not need to be redeemed), or the plan has already been successfully matched (e.g., the destination has been redeemed). In these cases, the corresponding end of the plan (starting point or destination) does not participate in the subsequent matching process.

[0031] Second state: Indicates pending turnaround matching. This state means that the endpoint (after arriving at a station) or origin (before departing from a station) of a plan is in a free state, waiting for the system to find a new matching object for it. For example, an arrival plan that has been decoupled from its original subsequent plan due to a delay can have its endpoint turnaround state updated to the second state.

[0032] Status updates specifically refer to modifying the turnaround status attribute of the target plan based on the specific content of the adjustment instruction. For example, an instruction to actively cancel a turnaround will change the turnaround status of its two associated target plans from "matched" to the "pending match" second state, allowing them to participate in new matching. The modification of the target plan's turnaround status attribute varies depending on the instruction type.

[0033] In step 130, a first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order.

[0034] The first planned sequence is the set of train plans that ultimately arrive at the target station in the timetable. The second planned sequence is the set of all train plans that originate from the target station. Determining these two sequences can be accomplished by querying the timetable database or traversing the timetable data structure in memory, filtering out all plans that have the target station as their endpoint or origin.

[0035] Sort these two sequences based on time order to ensure that the matching process conforms to physical and operational logic. For example, they can be sorted by planned time information, such as sorting the first planned sequence by the planned arrival time of each plan from earliest to latest, and sorting the second planned sequence by the planned departure time of each plan from earliest to latest.

[0036] In step 140, the sorted first plan sequence and second plan sequence are traversed, and the plans in the first plan sequence whose endpoint turnaround state is in the second state are matched with the plans in the second plan sequence whose starting point turnaround state is in the second state in order to construct a turnaround fulfillment relationship, and the running graph is updated based on the turnaround fulfillment relationship.

[0037] Step 140 is the core of achieving automatic matching. After both the first and second plan sequences are sorted by time, the traversal process is executed.

[0038] The purpose of the traversal is to find matching pairs: an arrival plan in a pending matching state and a departure plan in a pending matching state. Matching in order reflects the first-come, first-served principle, meaning that, under constraints such as minimum turnaround time, the train that arrives earliest is matched with the task that departs earliest. Once such a pair of plans is found, a turnaround fulfillment relationship is established between them. At the data level, this can be represented by creating a new connection record, associating the two plans, and updating their respective turnaround states to the first state (e.g., destination fulfilled and origin fulfilled).

[0039] Updating the train schedule refers to applying the newly constructed turnaround fulfillment relationship to the global train schedule, so that dispatchers and downstream systems can see the latest train route arrangements.

[0040] The automatic train timetable matching method provided by this invention automatically determines and sorts the affected train plans in response to adjustment commands, and performs orderly traversal and matching based on defined states. This realizes the automatic reconstruction process of timetable turnaround relationships in emergency scenarios, replacing the traditional manual matching process, greatly improving scheduling efficiency and accuracy, and enhancing the robustness of the timetable in dealing with emergencies.

[0041] In one embodiment, sorting the first planning sequence and the second planning sequence based on time order includes: Obtain the arrival time of each plan in the first plan sequence to the target station, and sort the first plan sequence based on the arrival time; Obtain the departure time of each train in the second plan sequence from the target station, and sort the second plan sequence based on the departure time.

[0042] Specifically, each train schedule in the first schedule sequence is traversed, and the timestamps of arrival at the target station recorded in its timetable are read. Then, these arrival times are sorted to arrange the first schedule sequence in ascending order, that is, in order from morning to evening.

[0043] Simultaneously, each train schedule in the second schedule sequence is traversed, and the departure timestamps from the target station recorded in its timetable are read. Then, the second schedule sequence is sorted in ascending order based on these departure times.

[0044] In one embodiment, the traversal process of the first and second plan sequences includes: Construct a first pointer to the first plan sequence and a second pointer to the second plan sequence; The first plan sequence and the second plan sequence are traversed until the first plan sequence or the second plan sequence has been traversed. The traversal of the first plan sequence and the second plan sequence includes: when the endpoint return state of the plan pointed to by the first pointer is in the first state, pointing the first pointer to the next plan in the sequence; when the starting point return state of the plan pointed to by the second pointer is in the first state, pointing the second pointer to the next plan in the sequence; when both the endpoint return state of the plan pointed to by the first pointer and the starting point return state of the plan pointed to by the second pointer are in the second state, establishing a return realization relationship, and pointing the first pointer and the second pointer to the next plan in the sequence.

[0045] First, construct a first pointer to the first plan sequence and a second pointer to the second plan sequence. These two pointers can be index variables or iterators in the program implementation, and initially both point to the first plan of their respective sequences.

[0046] The first and second plan sequences are traversed until either the first or second plan sequence has been traversed completely. This traversal process is implemented by moving pointers, and the specific logic is as follows: If the destination turnaround state of the plan pointed to by the first pointer is in the first state (no matching required), the first pointer is moved to the next plan in the sequence. This means that the arrival plan currently pointed to by the first pointer has already been paired, or does not need to be paired, so it is skipped and the next arrival plan is examined.

[0047] If the starting point of the plan pointed to by the second pointer is in the first state (no matching required), the second pointer is moved to the next plan in the sequence. This means that the departure plan currently pointed to by the second pointer has been paired or does not need to be paired, so it is skipped, and the next departure plan is examined.

[0048] If both the destination turnaround state of the plan pointed to by the first pointer and the starting turnaround state of the plan pointed to by the second pointer are in the second state (pending matching), a turnaround fulfillment relationship is established, and the first and second pointers are moved to the next plan in the sequence. This indicates that a feasible matching pair (an arrival plan to be matched and a departure plan to be matched) has been found. They are then paired, a relationship is established, and both pointers move forward simultaneously to continue searching for matching pairs for subsequent plans.

[0049] This process is repeated until one of the pointers moves out of the end of its sequence, indicating that all plans that need to be matched in that sequence have been processed.

[0050] The automatic train timetable matching method provided by this invention employs a dual-pointer synchronous traversal approach, enabling all matching operations to be completed in a single scan. This results in low algorithm complexity and high execution efficiency. This efficient processing method ensures that timetables can be rapidly adjusted even in complex emergency scenarios.

[0051] In one embodiment, the adjustment instruction is any one of the following: an instruction to actively abandon the fulfillment plan, an instruction to put a standby train into service, and an instruction to take a train out of service.

[0052] Actively abandon fulfillment plan instruction: When a planned turnaround relationship cannot be executed or is not suitable to continue due to serious delays or other reasons, the dispatcher will issue this instruction to actively disconnect the connection.

[0053] Instructions for deploying a standby trainset: When a trainset malfunctions, or to meet temporary increased capacity demands, a standby trainset needs to be dispatched from the depot or a backup line to execute a specific departure plan.

[0054] Offline train crew instruction: This instruction is issued when a train crew needs to return to the depot after completing its last task of the day, or when it needs to temporarily withdraw from service due to reasons such as malfunction or congestion.

[0055] Specifically, the instruction to proactively abandon fulfillment of a train schedule is used to address scenarios where one or more train schedules need to be proactively cancelled due to severe delays or other reasons. When this instruction is received, on the one hand, the operation of the abandoned target schedule itself is cancelled, so its origin and destination no longer participate in subsequent turnaround matching, and its origin turnaround status and destination turnaround status can both be marked as the first status (e.g., updated to origin not required to fulfill and destination not required to fulfill).

[0056] On the other hand, this instruction will affect other plans associated with the abandoned plan. For example, in a specific scenario, based on actual delays, operators issue an instruction from terminal station A to abandon n originally scheduled plans originating from station A. The set of original destination stations for these n plans is {B1, B2, ..., Bn}. This operation will have a chain reaction: At station A, the arrival trains originally scheduled to serve as the originating stations for these n trains will have their destination turnaround status changed from fulfilled to pending (i.e., the second state), thereby triggering the system to use station A as the target station and execute the subsequent sorting and reorganization matching process.

[0057] In the terminal station set {B1, B2, ..., Bn}, the subsequent departure plans that were originally scheduled to be followed by these n abandoned plans will have their origin turnaround status changed from "fulfilled" to "pending fulfillment" (i.e., the second state). This will also trigger the system to use these stations as target stations and execute the corresponding reorganization and matching process.

[0058] The instruction to deploy standby trainsets is used to deploy new trainsets from the depot or standby lines to perform tasks when additional capacity is needed.

[0059] Specifically, when an instruction to deploy a standby trainset is received, the origin turnaround status of the target plan undertaken by the standby trainset will be marked as the first status (e.g., updated to origin fulfilled), because its starting task is completed by the newly deployed trainset, without waiting for an arriving train to take over. At the same time, in order to ensure that the trainset can be included in the resource pool after completing this task and reaching its destination, its destination turnaround status will be marked as the second status (e.g., updated from destination not required to be fulfilled to destination pending fulfillment).

[0060] For example, in two typical scenarios, it may be necessary to deploy backup train sets: First, as mentioned above, after station A actively abandons n scheduled trains, in order to ensure the punctual operation of subsequent trains, it may be necessary to deploy backup train sets at the corresponding terminal stations {B1, B2, ..., Bn}; Second, when a train set malfunctions and needs to be taken offline for maintenance, a backup train set also needs to be deployed to replace its subsequent operating schedule. In this case, dispatchers can issue a command to deploy a backup train set at a designated target station (e.g., station A) through a human-machine interface, specifying a backup train set to execute plan P1. The system will automatically update the starting turnaround status of plan P1 to "starting point fulfilled" and its ending turnaround status to "ending point pending fulfillment," and then, with station A as the target station, sort the plan sequence at that station and reorganize the turnaround relationships.

[0061] The "retirement" instruction is used to remove trainsets that have completed their tasks or need to be decommissioned from the operating line. Upon receiving the instruction, the destination turnaround status of the target plan (usually a final destination plan) specified by the instruction is marked as the first status (e.g., updated to "destination not required"). This means that the trainset executing the plan will return directly to the depot or undergo maintenance upon reaching the destination station and will no longer participate in subsequent turnaround matching.

[0062] For example, in a specific scenario, to cope with emergencies, several backup train sets are deployed at stations {B1, B2, ..., Bn}. Once operations return to normal, these stations may experience redundant train set resources and low utilization rates. In this case, dispatchers can issue a train set disengagement instruction at the target station (e.g., station B), specifying that a train set corresponding to a certain destination plan P2 should be disengaged upon arrival. Upon receiving the instruction, the system will update the destination turnaround status of plan P2 to "destination not required," and then automatically reorder and re-match the trains, using station B as the target station.

[0063] The automatic train timetable matching method provided by this invention abstracts complex operational adjustment scenarios into three standardized instruction types, offering a clear and concise operation interface. Dispatchers do not need to concern themselves with changes in the underlying data status; they only need to select the corresponding instruction based on the actual situation, simplifying operations and reducing the risk of misoperation.

[0064] In one embodiment, updating the start-point turnaround status and / or the end-point turnaround status of the target plan based on the instruction type of the adjustment instruction includes: When the adjustment instruction is a proactive abandonment of the plan, both the starting point turnaround state and the ending point turnaround state of the target plan are marked as the first state; When the adjustment instruction is an instruction to put a standby train set into service, the starting turnaround state of the target plan is marked as the first state, and the ending turnaround state of the target plan is marked as the second state; When the adjustment instruction is a train set off from the production line instruction, the destination turnaround status of the target plan is marked as the first status.

[0065] When the adjustment instruction is a proactive abandonment of the fulfillment plan instruction, both the starting point turnaround status and the ending point turnaround status of the target plan are marked as the first state. The target plan refers to the abandoned plan itself. For example, if train B was originally scheduled to be operated by train A turning around, and train B itself is abandoned (i.e., the operation of train B is cancelled), then both the starting point and ending point status of train B become "no matching required." Simultaneously, this action will cause the ending point status of train A to become "pending matching" (second state), thereby triggering a re-matching of train A.

[0066] When the adjustment instruction is an instruction to deploy a standby trainset, the starting turnaround status of the target plan is marked as the first state, and the ending turnaround status of the target plan is marked as the second state. The target plan refers to the departure plan undertaken by the newly deployed standby trainset. Since its starting point is directly from the depot, it is in a fulfilled state (first state) and does not require matching with arriving trains. Once it reaches the terminal station, unless otherwise instructed, it becomes a usable resource, and its ending status is pending matching (second state), allowing it to participate in subsequent turnaround matching.

[0067] When the adjustment instruction is a decommissioning instruction for a train set, the destination turnaround status of the target plan is marked as the first status. The target plan refers to the arrival plan that is instructed to be decommissioned. After arriving at the target station, the train will return directly to the depot or undergo maintenance and will not perform any further operational tasks; therefore, its destination status is marked as "no matching required" (belonging to the first status).

[0068] In one embodiment, the plan in the first plan sequence is a downlink termination plan, and the plan in the second plan sequence is an uplink origination plan.

[0069] In a railway system, lines are divided into up and down lines. In a specific application scenario, the plan in the first planning sequence is the down-line destination plan, that is, the train plan that runs along the down direction and terminates at the target station. Correspondingly, the plan in the second planning sequence is the up-line originating plan, that is, the train plan that originates from the target station and runs along the up direction.

[0070] This situation is common at terminal stations or important hub stations on a line, where trains arrive from one direction, undergo maintenance, and then depart from the opposite direction. This method can automatically establish new turnaround matches for these down-bound arriving trains and up-bound departing trains.

[0071] The automatic train timetable matching device provided by the present invention will be described below. The automatic train timetable matching device described below and the automatic train timetable matching method described above can be referred to in correspondence.

[0072] like Figure 2 As shown, the device includes: The instruction processing module 210 is used to determine the target plan and target station affected by the adjustment instruction in response to the operation diagram adjustment instruction; The marking module 220 is used to update the starting turnaround status and / or the ending turnaround status of the target plan based on the instruction type of the adjustment instruction; the starting turnaround status and the turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; The sequence construction module 230 is used to determine a first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station, and to sort the first planned sequence and the second planned sequence based on time order; The running graph adjustment module 240 is used to traverse the sorted first plan sequence and second plan sequence, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0073] The automatic train timetable matching device provided by this invention transforms operational adjustment needs into a unified, automatically identifiable, and processable state by introducing and updating the origin and destination turnaround states of train plans. Based on this, by arranging the arrival and departure plan sequences of the target station by time and automatically traversing and matching plans in the pending matching state, a new turnaround fulfillment relationship is constructed, realizing the automatic matching and updating process of the timetable. This automated processing flow replaces the manual operation method relying on dispatchers, significantly improving the efficiency and accuracy of timetable adjustments.

[0074] In one embodiment, the sequence construction module 230 is specifically used for: The step of sorting the first plan sequence and the second plan sequence based on time order includes: Obtain the arrival time of each plan in the first plan sequence to the target station, and sort the first plan sequence based on the arrival time; Obtain the departure time of each train in the second plan sequence from the target station, and sort the second plan sequence based on the departure time.

[0075] In one embodiment, the running graph adjustment module 240 is specifically used for: The traversal process of the first and second plan sequences includes: Construct a first pointer to the first plan sequence and a second pointer to the second plan sequence; The first plan sequence and the second plan sequence are traversed until the first plan sequence or the second plan sequence has been traversed. The traversal of the first plan sequence and the second plan sequence includes: when the endpoint return state of the plan pointed to by the first pointer is in the first state, pointing the first pointer to the next plan in the sequence; when the starting point return state of the plan pointed to by the second pointer is in the first state, pointing the second pointer to the next plan in the sequence; when both the endpoint return state of the plan pointed to by the first pointer and the starting point return state of the plan pointed to by the second pointer are in the second state, establishing a return realization relationship, and pointing the first pointer and the second pointer to the next plan in the sequence.

[0076] In one embodiment, the running graph adjustment module 240 is specifically used for: The adjustment instruction can be any one of the following: an instruction to actively abandon the fulfillment plan, an instruction to put a standby train into service, or an instruction to take a train out of service.

[0077] In one embodiment, the instruction processing module 210 is specifically used for: The step of updating the start-point turnaround status and / or the end-point turnaround status of the target plan based on the instruction type of the adjustment instruction includes: When the adjustment instruction is a proactive abandonment of the plan, both the starting point turnaround state and the ending point turnaround state of the target plan are marked as the first state; When the adjustment instruction is an instruction to put a standby train set into service, the starting turnaround state of the target plan is marked as the first state, and the ending turnaround state of the target plan is marked as the second state; When the adjustment instruction is a train set off from the production line instruction, the destination turnaround status of the target plan is marked as the first status.

[0078] In one embodiment, the sequence construction module 230 is further configured to: The plan in the first plan sequence is the downlink termination plan, and the plan in the second plan sequence is the uplink origination plan.

[0079] Figure 3 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 3As shown, the electronic device may include a processor 310, a communications interface 320, a memory 330, and a communication bus 340, wherein the processor 310, communications interface 320, and memory 330 communicate with each other via the communication bus 340. The processor 310 can call logical instructions in the memory 330 to execute an automatic train timetable matching method, which includes: in response to a timetable adjustment instruction, determining the target plan and target station affected by the adjustment instruction; Based on the instruction type of the adjustment instruction, update the starting turnaround status and / or the ending turnaround status of the target plan; both the starting turnaround status and the ending turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; A first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order; Traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0080] Furthermore, the logical instructions in the aforementioned memory 330 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0081] On the other hand, the present invention also provides a computer program product, the computer program product including a computer program that can be stored on a non-transitory computer-readable storage medium, and when the computer program is executed by a processor, the computer is able to execute the automatic matching method for train timetables provided by the above methods, the method including: in response to a timetable adjustment instruction, determining the target plan and target station affected by the adjustment instruction; Based on the instruction type of the adjustment instruction, update the starting turnaround status and / or the ending turnaround status of the target plan; both the starting turnaround status and the ending turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; A first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order; Traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0082] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements an automatic matching method for train timetables provided by the methods described above, the method comprising: in response to a timetable adjustment instruction, determining a target schedule and a target station affected by the adjustment instruction; Based on the instruction type of the adjustment instruction, update the starting turnaround status and / or the ending turnaround status of the target plan; both the starting turnaround status and the ending turnaround status include a first status where no turnaround matching is required and a second status where turnaround matching is required; A first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order; Traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

[0083] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0084] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0085] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. An automatic matching method for train timetables, characterized in that, include: In response to a timetable adjustment instruction, determine the target schedule and target stations affected by the adjustment instruction; Based on the instruction type of the adjustment instruction, update the starting point turnaround status and / or the ending point turnaround status of the target plan; Both the starting point turnaround state and the ending point turnaround state include a first state where no turnaround matching is required and a second state where turnaround matching is required. A first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station are determined, and the first planned sequence and the second planned sequence are sorted according to time order; Traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct the turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

2. The automatic train timetable matching method according to claim 1, characterized in that, The step of sorting the first plan sequence and the second plan sequence based on time order includes: Obtain the arrival time of each plan in the first plan sequence to the target station, and sort the first plan sequence based on the arrival time; Obtain the departure time of each train in the second plan sequence from the target station, and sort the second plan sequence based on the departure time.

3. The automatic train timetable matching method according to claim 1, characterized in that, The traversal process of the first and second plan sequences includes: Construct a first pointer to the first plan sequence and a second pointer to the second plan sequence; The first plan sequence and the second plan sequence are traversed until the first plan sequence or the second plan sequence has been traversed. The traversal of the first plan sequence and the second plan sequence includes: when the endpoint return state of the plan pointed to by the first pointer is in the first state, pointing the first pointer to the next plan in the sequence; when the starting point return state of the plan pointed to by the second pointer is in the first state, pointing the second pointer to the next plan in the sequence; when both the endpoint return state of the plan pointed to by the first pointer and the starting point return state of the plan pointed to by the second pointer are in the second state, establishing a return realization relationship, and pointing the first pointer and the second pointer to the next plan in the sequence.

4. The automatic train timetable matching method according to claim 1, characterized in that, The adjustment instruction can be any one of the following: an instruction to actively abandon the fulfillment plan, an instruction to put a standby train into service, or an instruction to take a train out of service.

5. The automatic train timetable matching method according to claim 4, characterized in that, The step of updating the start-point turnaround status and / or the end-point turnaround status of the target plan based on the instruction type of the adjustment instruction includes: When the adjustment instruction is a proactive abandonment of the plan, both the starting point turnaround state and the ending point turnaround state of the target plan are marked as the first state; When the adjustment instruction is an instruction to put a standby train set into service, the starting turnaround state of the target plan is marked as the first state, and the ending turnaround state of the target plan is marked as the second state; When the adjustment instruction is a train set off from the production line instruction, the destination turnaround status of the target plan is marked as the first status.

6. The automatic train timetable matching method according to claim 1, characterized in that, The plan in the first plan sequence is the downlink termination plan, and the plan in the second plan sequence is the uplink origination plan.

7. An automatic train timetable matching device, characterized in that, include: The instruction processing module is used to determine the target plan and target station affected by the adjustment instruction in response to the operation diagram adjustment instruction; The marking module is used to update the start-point turnaround status and / or the end-point turnaround status of the target plan based on the instruction type of the adjustment instruction. The starting point turnaround state and the turnaround state include a first state where no turnaround matching is required and a second state where turnaround matching is required. The sequence construction module is used to determine a first planned sequence with the target station as the destination station and a second planned sequence with the target station as the origin station, and to sort the first planned sequence and the second planned sequence based on time order; The running graph adjustment module is used to traverse the sorted first and second plan sequences, match the plans in the first plan sequence whose endpoint turnaround state is in the second state with the plans in the second plan sequence whose starting point turnaround state is in the second state in order, construct a turnaround fulfillment relationship, and update the running graph based on the turnaround fulfillment relationship.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the automatic matching method for train timetables as described in any one of claims 1 to 6.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the automatic matching method for train timetables as described in any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the automatic matching method for train timetables as described in any one of claims 1 to 6.

Images