A method for synchronizing an urban rail transit interconnection operation diagram

Abstract

The present invention discloses a method for synchronizing an urban rail transit interconnection operation diagram. The method is based on the rail transit line network operation mode and is applied to the synchronization of the rail transit line network operation diagram and the line operation diagram; the line network plan operation diagram is decomposed into several executable line plan operation diagrams through a decomposition algorithm; different line real-time operation diagrams are merged through a merging algorithm to form a line network real-time operation diagram; the line network daily shift plan operation diagram is decomposed into several line daily shift plan operation diagrams through a decomposition algorithm, and different line daily shift plan operation diagrams are merged through a merging algorithm to form a line network daily shift plan operation diagram. Efficient and convenient synchronization between the line operation diagram and the line network operation diagram is achieved, solving the coordination problem between the global operation diagram of the line network and the single line operation diagram; moreover, it can be applied to the cross-line operation of multiple lines without the need for additional parameter configuration.

Description

Technical Field

[0001] The present invention relates to the technical field of urban rail transit interconnection, and in particular to a method for synchronizing an urban rail transit interconnection operation diagram. Background Art

[0002] With the realization of urban rail transit line interconnection technology and the emergence of line network operation mode, it is necessary to ensure that the data logic of the line network operation diagram and the single line operation diagram are consistent, so that the line network center and each line can quickly coordinate and dispatch. At present, there are mainly two types of solutions:

[0003] Solution 1: The patent "A method for generating a cross-line operation diagram in an interconnection system" focuses on describing the compilation method of the interconnection operation diagram. The embodiment describes the operating parameters of each line in the interconnection system, and further generates a cross-line operation diagram by determining the cross-line operation line and cross-line operation parameters including cross-line intersections, cross-line stations, cross-line time and the number of cross-line trains. According to the cross-line stations and cross-line times of each cross-line operation line in the cross-line operation diagram, a single-line operation diagram of each cross-line operation line is generated.

[0004] However, the defect of solution 1 is that it only has a method to generate a single-line operation diagram, but no synchronization solution. This solution supports cross-line operation of two lines. Based on the three operating parameters of the configured cross-line route, cross-line time and number of cross-line trains, the cross-line operation diagram is first generated, and then the single-line operation diagram of each cross-line operation line is generated. This solution does not support the generation of cross-line operation diagrams for more than two lines; the operating parameters of the cross-line time and number of trains need to be defined in advance, and the cross-line operation line cannot be drawn flexibly.

[0005] Solution 2: The patent "A Distributed Compilation Method for Interconnected Line Operation Diagram" describes that the total cross-line operation path is composed of cross-line sub-paths defined by each line, and the cross-line sub-paths are composed of the same connecting platform pairs. The specific idea is to define the fixed parameters of the interconnected lines (including connecting platform pairs, cross-line operation sub-paths and reference lines); each line defines the cross-line sub-path of the line, and the cross-line sub-path features the connecting platform as the starting point or the end point; generate the train number and time information of the connecting platform pair; match the train number of the cross-line sub-path corresponding to the line to form the total cross-line path.

[0006] However, the defect of Solution 2 is that this solution supports the configuration of fixed cross-line connecting platform pairs, cross-line running sub-paths, and after defining the cross-line train numbers and time information, the running lines are drawn on the running diagrams of each line. This solution cannot support the flexible drawing of all cross-line intersections on multiple lines, and the time of the cross-line needs to be defined in advance. After the time of the running line of the cross-line sub-path is adjusted, the running line of the connecting platform pair cannot be adjusted synchronously, which will affect the operation. Summary of the invention

[0007] The purpose of the present invention is to provide a method for synchronizing an urban rail transit interconnection operation diagram, which is applied to the synchronization of the rail transit network operation diagram and the line operation diagram based on the rail transit network operation mode, to ensure that the data logic of the network operation diagram and the single line operation diagram are consistent, so that the network center and each line can quickly perform scheduling and coordination.

[0008] The objective of the present invention is achieved through the following technical solutions:

[0009] A method for synchronizing an urban rail transit interconnection operation diagram, comprising: synchronizing a network operation diagram with a line operation diagram, wherein the operation diagram comprises a planned operation diagram, a daily planned operation diagram, and a real-time operation diagram; the planned operation diagram is a basic diagram, and the daily planned operation diagram is a planned operation diagram for the day generated on the basis of the basic diagram;

[0010] Among them, the line network planned operation diagram is decomposed into several executable line planned operation diagrams through a decomposition algorithm; different line real-time operation diagrams are merged through a merging algorithm to form a line network real-time operation diagram; the line network daily shift planned operation diagram is decomposed into several line daily shift planned operation diagrams through a decomposition algorithm, and different line daily shift planned operation diagrams are merged through a merging algorithm to form a line network daily shift planned operation diagram.

[0011] It can be seen from the technical solution provided by the present invention that, by uniformly drawing the line network operation diagram and synchronizing it into executable line operation diagram data, at the same time, the real-time line operation data needs to be synchronized to the line network center to form a line network operation diagram; efficient and convenient synchronization between the line operation diagram and the line network operation diagram is achieved, solving the coordination problem between the global operation diagram of the line network and the single line operation diagram; moreover, it can be applied to the cross-line operation of multiple lines, and there is no need for additional parameter configuration, and the synchronization of the line network operation diagram and the line operation diagram can be flexibly achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative work.

[0013] Figure 1 A flow chart of a method for synchronizing an urban rail transit interconnection operation diagram provided by an embodiment of the present invention;

[0014] Figure 2 A flow chart of a decomposition algorithm for synchronizing a line network operation diagram into a single line operation diagram provided by an embodiment of the present invention;

[0015] Figure 3 A flowchart of a merging algorithm for synchronizing a line operation diagram into a line network operation diagram provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0016] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the protection scope of the present invention.

[0017] First, the terms that may be used in this article are explained as follows:

[0018] The terms "include", "comprises", "contains", "has" or other descriptions with similar semantics should be interpreted as non-exclusive inclusion. For example, including certain technical feature elements (such as raw materials, components, ingredients, carriers, dosage forms, materials, dimensions, parts, components, mechanisms, devices, steps, procedures, methods, reaction conditions, processing conditions, parameters, algorithms, signals, data, products or products, etc.) should be interpreted as including not only certain technical feature elements explicitly listed, but also other technical feature elements known in the art that are not explicitly listed.

[0019] The following is a detailed description of a method for synchronizing an urban rail transit interconnection operation diagram provided by the present invention. The contents not described in detail in the embodiments of the present invention belong to the prior art known to professional and technical personnel in the field. If no specific conditions are specified in the embodiments of the present invention, the conventional conditions in the field or the conditions recommended by the manufacturer shall be followed.

[0020] An urban rail transit interconnection operation diagram synchronization method provided in an embodiment of the present invention is applied to the synchronization of a rail transit network operation diagram and a line operation diagram based on a rail transit network operation mode, and can achieve:

[0021] 1) Unified drawing of line network plan operation diagram, and synchronization into executable line plan operation diagram data through decomposition algorithm.

[0022] 2) The real-time operation data of the line needs to be synchronized to the line network center, and the real-time operation diagram of the line needs to be formed into a real-time operation diagram of the line network through a merging algorithm.

[0023] 3) Bidirectional synchronization of the line network daily shift plan operation diagram and the route daily shift plan operation diagram. The route daily shift plan operation diagram is uploaded and formed into the line network daily shift plan operation diagram through the merging algorithm; the line network daily shift plan operation diagram or the adjusted line network daily shift plan operation diagram is decomposed into the route daily shift plan operation diagram through the decomposition algorithm and issued to each route.

[0024] like Figure 1 As shown, a method for synchronizing an urban rail transit interconnection operation diagram mainly includes: synchronizing a network operation diagram with a line operation diagram, wherein the operation diagram includes a planned operation diagram, a real-time operation diagram, and a daily planned operation diagram;

[0025] Among them, the line network planned operation diagram is decomposed into several executable line planned operation diagrams through a decomposition algorithm; different line real-time operation diagrams are merged through a merging algorithm to form a line network real-time operation diagram; the line network daily shift planned operation diagram is decomposed into several line daily shift planned operation diagrams through a decomposition algorithm, and different line daily shift planned operation diagrams are merged through a merging algorithm to form a line network daily shift planned operation diagram; the synchronization of the line network operation diagram and the line operation diagram is achieved.

[0026] In the embodiment of the present invention, the planned operation diagram refers to the basic diagram; at the beginning of the operation of each scheduling day, the daily shift plan diagram will be generated based on the basic diagram and issued for execution; the actual train operation trajectory every day will generate an actual diagram, that is, a real-time operation diagram.

[0027] For ease of understanding, the implementation methods of the decomposition algorithm and the merging algorithm involved in the above method are introduced below.

[0028] 1. The decomposition algorithm of the line network plan operation diagram is synchronized into the single line plan operation diagram.

[0029] like Figure 2 As shown, it mainly includes the following steps:

[0030] Step S101, traverse the running line linked list of the line network running diagram.

[0031] Step S102: determine whether the line to which the first station node and the last station node of the running line in the currently acquired running line linked list belong is a cross-line running line; if the lines to which they belong are the same, it is a single-line running line; if the lines to which they belong are different, it is a cross-line running line.

[0032] Step S103: For a single-line operation line, according to the line number of the first station node, the station node of the line is directly stored in the related line operation diagram linked list, and then the next operation line is traversed, that is, the process goes to step S101.

[0033] Step S104, for the cross-line running line, obtain the line number of the first station node of the cross-line running line (the same first station node as step S102), and then generate a new running line LineU in combination with the cross-line train number, set the node attribute of the first station node to cross-line starting, and add the new running line LineU.

[0034] Step S105, traverse the station nodes of the cross-line running line.

[0035] Step S106: If the next station node is successfully obtained, go to step S107; if the acquisition fails, then put the new running line LineU into the corresponding line running diagram linked list according to the line number of the first station node of the new running line LineU, and set the attribute of the last station node of LineU to the cross-line terminal.

[0036] In this step, if the next station node cannot be obtained when traversing the station nodes of the cross-line running line, it means that the station node traversal of the cross-line running line is completed, and all station nodes have been added to the new running line LineU. These station nodes all belong to the same line. Therefore, they are directly put into the corresponding line operation diagram linked list according to the line number of the first station node.

[0037] Step S107, obtain the line number of the station node and compare it with the line number of the previous station node; if they are the same, it is considered that they belong to the same line station, and go to step S108; if they are different, it is considered that they belong to different lines, that is, the corresponding station nodes cross the line, and go to step S109.

[0038] Step S108, adding the obtained station node to the new running line LineU, and continuing to traverse the next node, that is, turning to step S105.

[0039] Step S109, according to the line number of the first station node of the new running line LineU, put the new running line LineU into the corresponding line running diagram linked list, set the attribute of the last station node of LineU to cross-line handover, and then go to step S110.

[0040] Step S110, use the relevant station node of cross-line operation as the first station node to generate a new operating line LineV, continue to traverse the next station node, and after all station nodes are traversed, set the first station node attribute of the new operating line LineV to cross-line access, and put the new operating line LineV into the corresponding line operation diagram linked list according to the line number of the first station node, and set the last station node attribute of LineV at the same time.

[0041] Those skilled in the art can understand that the node attributes mainly specify the access and handover information, name, track platform, etc. of the node; the terminal station node attributes mainly include the terminal or handover. If it is handover, it also includes the handover train number information, handover line information, and handover terminal station information. Therefore, the LineV terminal station node attributes are set according to the actual situation.

[0042] Step S111, continue to traverse the next running line, that is, go to step S101; until all running lines are traversed.

[0043] Through the above steps, a line network operation diagram is decomposed into multiple executable line operation diagram data.

[0044] 2. The real-time operation diagram of the line is synchronized with the merging algorithm of the real-time operation diagram of the line network.

[0045] like Figure 3 As shown, it mainly includes the following steps:

[0046] Step S201, traverse the line list of the line network.

[0047] Those skilled in the art can understand that a line network is composed of multiple lines, therefore, the line network contains a line linked list, which is called the line linked list of the line network; there are multiple running lines on the line, therefore, the line contains a running line linked list, collectively referred to as the running line linked list of the line.

[0048] Step S202, obtaining the running line list of the current line; if the acquisition fails, the process ends; if the acquisition succeeds, the line number U is determined.

[0049] Step S203, traverse the running line list of the current line.

[0050] Step S204, determine whether the line operation line is a cross-line operation (cross-line access, cross-line departure, cross-line handover, cross-line termination, etc.) according to the attributes of the first station node and the last station node of the line operation line in the operation line chain table of the current line. If it is not a cross-line operation, it is a single-line operation line and proceeds to step S205; if it is a cross-line operation, proceed to step S206.

[0051] Step S205, store the single-line running line in the running line linked list of the line network running diagram sub-graph U; then go to step S203, and continue to traverse the line running line linked list.

[0052] Those skilled in the art can understand that a sub-graph of a line network operation diagram actually corresponds to a line. As mentioned above, the line network is composed of multiple lines, and therefore, the line network operation diagram is composed of multiple sub-graphs.

[0053] Step S206, determine whether it is the starting point according to the node attribute of the first station of the cross-line running line. If it is not the starting point, go to step S203 and continue to traverse the line running line list; if it is the starting point, copy and generate the cross-line running line LineK, and go to step S207. For example, the cross-line train starts from line A, passes through line B and then arrives at line C, which is decomposed into three sections, respectively recorded as LineA, LineB, and LineC. The first node of LineA is StartA, and the attribute is that it is the starting station. The end node is EndA, and the attributes include handover, handover information, and final arrival information (EndC), etc.; if it arrives at EndA, it will be handed over to LineB; the first station node of LineB is StartB, and the attributes of the first station are access, access information, and the first starting information (StartA), etc.; therefore, for the running line of the line, the first node can be called the starting point (cross-line starting point), and the last node can be called the end point (cross-line end point), but from the perspective of the line network, for the cross-line running line, it is access and handover.

[0054] In this step, if the first station node is judged as the starting point, it means that the first station node must be the front part of the cross-line running line. Therefore, directly copy a copy to generate the cross-line running line LineK, and then traverse the running lines of other lines and splice them behind LineK to form a complete cross-line running line.

[0055] Step S207, obtain the train number handed over by the cross-line running line LineK and the cross-line handover line number S.

[0056] Step S208, traverse the running line linked list of line number S, and obtain the current running line of line number S according to the handed-in train number.

[0057] Step S209, determine whether the last station node attribute of the current running line of line number S is the final destination; if it is the final destination, proceed to step S210; if it is not the final destination, add the current running line of line number S to the cross-line running line LineK, and proceed to step S207.

[0058] Step S210, store the cross-line running line LineK in the cross-line running line linked list in the line network running diagram, and turn to step S203 to continue traversing the running line linked list of the current line.

[0059] Step S211: After the running line linked list of the current line is traversed, the process goes to step S201 to continue traversing the running line linked list of the next line until all lines are traversed.

[0060] Through the above merging algorithm, a series of running line linked lists of the line network running diagram sub-graphs and cross-line running line linked lists are obtained. The above two types of running line linked lists constitute the line network running diagram data structure.

[0061] 3. Two-way synchronization of the daily planned operation diagram of the network and the daily planned operation diagram of the line.

[0062] The two-way synchronization of the network daily shift plan operation diagram and the line daily shift plan operation diagram also uses the decomposition algorithm and merging algorithm introduced above. The principles and algorithm logic are exactly the same. The specific text description only needs to be changed to the word "daily shift plan", so it will not be elaborated.

[0063] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above embodiments can be implemented by software, or by means of software plus necessary general hardware platforms. Based on such understanding, the technical solutions of the above embodiments can be embodied in the form of software products, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0064] The above is only a preferred specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A method for synchronizing an urban rail transit interconnection operation diagram, characterized in that: include: Synchronization of the network operation diagram and the line operation diagram, including the planned operation diagram, the daily planned operation diagram, and the real-time operation diagram; The planned operation diagram is a basic diagram, and the daily shift planned operation diagram is a planned operation diagram for the day generated based on the basic diagram; Among them, the line network planned operation diagram is decomposed into several executable line planned operation diagrams through the decomposition algorithm; different line real-time operation diagrams are merged through the merging algorithm to form the line network real-time operation diagram; the line network daily shift planned operation diagram is decomposed into several line daily shift planned operation diagrams through the decomposition algorithm, and different line daily shift planned operation diagrams are merged through the merging algorithm to form the line network daily shift planned operation diagram; The step of decomposing the line network plan operation diagram into a plurality of executable line plan operation diagrams by using a decomposition algorithm comprises: Step S101, traverse the running line list of the line network running diagram; Step S102: judging whether the line to which the first station node and the last station node of the running line in the currently acquired running line linked list belong is a cross-line running line; if the lines to which the first station node and the last station node belong are the same, it is a single-line running line; if the lines to which the first station node and the last station node belong are different, it is a cross-line running line; Step S103: For a single-line operation line, according to the line number of the first station node, the station node of the line is directly stored in the relevant line operation diagram linked list, and then the next operation line is traversed, that is, the process goes to step S101; Step S104: for a cross-line running line, obtain the line number of the first station node of the cross-line running line, generate a new running line LineU in combination with the cross-line train number, set the node attribute of the first station node to cross-line departure, and add the new running line LineU; Step S105, traverse the station nodes of the cross-line running line; Step S106: If the next station node is successfully obtained, go to step S107; if the acquisition fails, put the new running line LineU into the corresponding line running diagram linked list according to the line number of the first station node of the new running line LineU, and set the node attribute of the last station node of LineU to cross-line terminal; Step S107, obtain the line number of the station node, and compare it with the line number of the previous station node; if they are the same, it is considered that they belong to the same line station, and the process goes to step S108; if they are different, it is considered that they belong to different lines, that is, the corresponding station node crosses the line, and the process goes to step S109; Step S108, adding the acquired station node to the new running line LineU, and continuing to traverse the next node, that is, turning to step S105; Step S109, according to the line number of the first station node of the new running line LineU, the new running line LineU is put into the corresponding line running diagram linked list, and at the same time, the attribute of the last station node of LineU is set to cross-line handover, and then the process goes to step S110; Step S110, taking the relevant station node of the cross-line operation as the first station node to generate a new operation line LineV, and at the same time setting the first station node attribute of LineV to cross-line access, and continuing to traverse the next station node. After all station nodes are traversed, the new operation line LineV is put into the corresponding line operation diagram linked list according to the line number of the first station node of the new operation line LineV, and at the same time setting the last station node attribute of LineV; Step S111, continue to traverse the next running line, that is, go to step S101; until all running lines are traversed; The step of merging different line real-time operation diagrams by a merging algorithm comprises: Step S201, traverse the line list of the line network; Step S202, obtaining the running line list of the current line; if the acquisition fails, the process ends; if the acquisition succeeds, the line number U is determined; Step S203, traverse the running line list of the route; Step S204: determine whether the running line is a cross-line running line according to the attributes of the first station node and the last station node of the running line in the running line chain table of the current line. If it is not a cross-line running line, it is a single-line running line, and the process goes to step S205; if it is a cross-line running line, the process goes to step S206; Step S205, storing the single-line running line in the running line linked list of the line network running diagram subgraph U; then turning to step S203, continuing to traverse the line running line linked list; Step S206: determine whether it is the starting point according to the node attribute of the first station of the cross-line running line. If it is not the starting point, proceed to step S203 and continue to traverse the line running line list; if it is the starting point, copy and generate the cross-line running line LineK, and proceed to step S207; Step S207, obtaining the train number handed over by the cross-line running line LineK and the cross-line handover line number S; Step S208, traverse the running line linked list of the cross-line handover route number S, and obtain the current running line of the cross-line handover route number S according to the handed-over train number; Step S209, determine whether the terminal node attribute of the current running line of the cross-line handover line number S is the final destination; if it is the final destination, proceed to step S210; if it is not the final destination, add the current running line of the cross-line handover line number S to the cross-line running line LineK, and proceed to step S207; Step S210, storing the cross-line running line LineK in the cross-line running line linked list in the line network running diagram, and turning to step S203, continuing to traverse the running line linked list of the current line; Step S211: After the running line linked list of the current line is traversed, the process goes to step S201 to continue traversing the running line linked list of the next line until all lines are traversed.

Images