CN115320678B - Train coupling-decoupling-editing operation chart compiling method and device - Google Patents
Train coupling-decoupling-editing operation chart compiling method and device Download PDFInfo
- Publication number
- CN115320678B CN115320678B CN202211049951.9A CN202211049951A CN115320678B CN 115320678 B CN115320678 B CN 115320678B CN 202211049951 A CN202211049951 A CN 202211049951A CN 115320678 B CN115320678 B CN 115320678B
- Authority
- CN
- China
- Prior art keywords
- train
- node
- linkage
- running
- relation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000010168 coupling process Methods 0.000 claims abstract description 18
- 238000005859 coupling reaction Methods 0.000 claims abstract description 18
- 230000008878 coupling Effects 0.000 claims abstract description 17
- 238000010586 diagram Methods 0.000 claims description 30
- 238000004590 computer program Methods 0.000 claims description 13
- 238000009954 braiding Methods 0.000 claims description 11
- 238000013507 mapping Methods 0.000 claims description 6
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 230000006837 decompression Effects 0.000 abstract description 10
- 238000004891 communication Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/10—Operations, e.g. scheduling or time tables
Abstract
The invention provides a train coupling and decoupling operation chart compiling method and device, wherein the method comprises the following steps: respectively compiling running lines before and after train coupling or uncoupling; adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line; and representing the linkage relation or the de-coding relation among the operation lines. The invention realizes the programming of the running chart of train linkage or decompression, and provides a basis for the running of train linkage or decompression plans.
Description
Technical Field
The invention relates to the technical field of rail transit, in particular to a train coupling-decoupling-editing running chart compiling method and device.
Background
The train running chart is a technical file used for representing the running of the train in a railway section and the arrival or passing time of the train at a station. The method defines the program of each train number and the train occupation interval, and the running time and stop time of the train in the interval at the arrival and departure (or passing) time of each station are the basis of the running of the whole train organization. The running diagram is a diagram of the relation between the running time and the space of the train and is a two-dimensional line drawing.
At present, each signal system manufacturer has an own operation diagram compiling system, and the operation diagram compiling is relatively mature, but the function of compiling the operation diagram of the linking and unbinding vehicle is lacking at present.
Disclosure of Invention
The invention provides a method and a device for compiling a train linkage and unlocking operation diagram, which are used for solving the defect that a train linkage and unlocking operation diagram can not be compiled by an operation diagram compiling system in the prior art and realizing train linkage and unlocking operation diagram compiling.
The invention provides a train coupling and decoupling operation chart compiling method, which comprises the following steps:
respectively compiling running lines before and after train coupling or uncoupling;
adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line;
and representing the linkage relation or the de-coding relation among the operation lines.
According to the train linkage and unlocking operation chart compiling method provided by the invention, the step of representing the linkage relation or the unlocking relation between the operation lines comprises the following steps:
packaging the operation lines in corresponding nodes respectively; wherein the operation lines and the nodes are in one-to-one correspondence;
and representing the linkage relation or the de-organization relation among the operation lines as a graph structure among the nodes.
According to the train linkage and unlocking operation chart compiling method provided by the invention, the step of representing the linkage relation or the unlocking relation between the operation lines as the chart structure between the nodes comprises the following steps:
determining whether each node is a head node and a tail node;
determining a front node set and a rear node set of each node;
and constructing a graph structure among the nodes by using whether each node is a head node and a tail node, a front node set and a rear node set of each node and an operation line corresponding to each node.
According to the train linkage and unlocking operation diagram programming method provided by the invention, after the step of representing the linkage relation or the unlocking relation between the operation lines as the diagram structure between the nodes, the method further comprises the following steps:
establishing a first index structure between each operation line and a node corresponding to each operation line;
and constructing an array by using nodes corresponding to the operation lines before or after train coupling, and establishing a second index structure between each node and the array to which each node belongs.
According to the method for compiling the train linkage and unbinding running diagram provided by the invention, after the step of constructing the array by using the nodes corresponding to the running lines before or after train linkage and establishing the index structure between each node and the array to which each node belongs, the method further comprises the following steps:
searching a front node and a rear node of each node by using the graph structure according to each node;
searching a node corresponding to each operation line by using the first index structure according to each operation line;
and searching an array corresponding to each node by using the second index structure according to each node.
According to the train linkage unbinding operation diagram compiling method provided by the invention, the first index structure and the second index structure are established by using Map structures.
The invention also provides a train coupling and decoupling operation chart compiling device, which comprises:
the programming module is used for programming the operation lines before and after the train is hung or unwound respectively;
the adding module is used for adding the time and the place of the train linkage input by a user or the time and the place of the de-braiding in the running line;
and the storage module is used for representing the linkage relation or the de-organization relation among the operation lines.
The invention also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the train linkage unlocking running chart programming method according to any one of the above when executing the program.
The invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which when executed by a processor implements a train hitch release operating map compilation method as described in any one of the above.
The invention also provides a computer program product comprising a computer program which when executed by a processor implements a train hitch and unbinding operation diagram programming method as described in any one of the above.
The method and the device for compiling the running diagram of the train linkage or the decompression provided by the invention are used for compiling the running diagram of the train linkage or the decompression before and after the train linkage or the decompression, then increasing the time and the place of the train linkage or the decompression in the running line, and representing the linkage relation or the decompression relation between the running lines, thereby realizing the establishment of the running diagram of the train linkage or the decompression and providing a basis for the planning operation of the train linkage or the decompression.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of a train linkage de-compiling operation diagram compiling method provided by the invention;
FIG. 2 is a schematic diagram of running lines before and after train de-braiding in the train linkage de-braiding running diagram braiding method;
FIG. 3 is a schematic diagram of the train coupling and decoupling operation chart programming device;
fig. 4 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The following describes a train linkage de-compiling operation diagram compiling method according to the invention with reference to fig. 1, comprising:
step 101, respectively compiling operation lines before and after train coupling or uncoupling;
the train coupling means that a plurality of trains are grouped to form an operation process of a reconnection train. For example, two 3 trains are grouped to form one 6 trains.
The train de-compiling refers to the operation process of splitting one train to form two trains. For example, a 6-section grouped reconnection train is split to form two 3-section grouped trains.
The running line of a train refers to the line at which the train runs in each section of the railway and stops and passes at each station.
And under the train linkage scene, compiling the running lines of a plurality of trains before train linkage and the running line of one train after train linkage.
And under the train unlocking scene, the running line of one train before train unlocking and the running lines of a plurality of trains after train unlocking are compiled.
The train operation line can be programmed by the existing method, and the embodiment is not particularly limited.
Step 102, adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the operation line;
the linking and unbinding sites may be tracks.
Optionally, the user selects the run line before and after train linkage or linkage selection by selecting the run line before and after train linkage or linkage selection on the interface, and then right-clicking to select the linkage selection. The time and place of train linkage or the time and place of decompression are set in the pop-up dialog box.
Time and place fields are added in the train running line for storing the time and place of train linkage or the time and place of uncoupling.
And 103, representing the linkage relation or the de-coding relation among the operation lines.
Optionally, the linkage relation between the running lines before and after the train linkage is determined according to the time and the place of the train linkage. And determining the unlocking relation between the running lines before and after the train is unwound according to the time and the place of the train.
For example, in a train linkage scene, the distance between the start point (start time and place), end point (end time and place) and the unlocking point (unlocking time and place) of each operation line is determined, an operation line with a smaller distance between the end point and the unlocking point is used as an operation line before unlocking, and an operation line with a smaller distance between the start point and the unlocking point is used as an operation line after unlocking.
The linkage relation or the uncoupling relation between the running lines is represented, and the embodiment is not limited to a specific representation mode, so that the train running diagram is compiled.
The embodiment is characterized in that the running lines before and after the train is hung or unwound are compiled, then the time and place for hanging or unwinding the train are increased in the running lines, and the hanging relation or the unwinding relation between the running lines is expressed, so that the running diagram of the train hanging or unwinding is compiled, and a foundation is provided for the planned running of the train hanging or unwinding.
On the basis of the above embodiment, the step of representing the linkage relationship or the unbinding relationship between the operation lines in this embodiment includes:
packaging the operation lines in corresponding nodes respectively; wherein the operation lines and the nodes are in one-to-one correspondence;
and representing the linkage relation or the de-organization relation among the operation lines as a graph structure among the nodes.
The diagram structure is a data structure. In this embodiment, each operation line is represented as a Node in the graph structure, and the linkage relationship or the unwrapping relationship between the operation lines is represented as an edge between the Node nodes in the graph structure, so that the relationship between the operation lines before linkage or unwrapping and after linkage or unwrapping is expressed by using the graph structure.
On the basis of the above embodiment, the step of representing the linkage relationship or the unbinding relationship between the operation lines as the graph structure between the nodes in this embodiment includes:
determining whether each node is a head node and a tail node;
determining a front node set and a rear node set of each node;
and constructing a graph structure among the nodes by using whether each node is a head node and a tail node, a front node set and a rear node set of each node and an operation line corresponding to each node.
In this embodiment, each Node is stored through the following fields, so as to implement a graph structure of train coupling or uncoupling:
1. whether the current node is a head node;
2. whether the current node is a tail node or not;
3. a front node set of current nodes;
4. a set of back nodes of the current node;
5. an operation line corresponding to the current node.
On the basis of the above embodiment, in this embodiment, after the step of representing the linkage relationship or the unbinding relationship between the operation lines as the graph structure between the nodes, the method further includes:
establishing a first index structure between each operation line and a node corresponding to each operation line;
in order to quickly find out the corresponding Node through the operation line, a first index structure of operation line Node is established.
And constructing an array by using nodes corresponding to the operation lines before or after train coupling, and establishing a second index structure between each node and the array to which each node belongs.
In order to find out the operation line of joint linkage or unbinding through the Node quickly, a second index structure of Node-joint linkage or unbinding Node is established.
On the basis of the above embodiment, in this embodiment, after the step of constructing an array using nodes corresponding to the running lines before or after train linking and establishing an index structure between each node and the array to which each node belongs, the method further includes:
searching a front node and a rear node of each node by using the graph structure according to each node;
after the data structure of the linkage relation or the de-organization relation is established, the front node and the rear node of each node, namely the adjacent nodes of each node, can be quickly searched according to the nodes.
Searching a node corresponding to each operation line by using the first index structure according to each operation line;
and using the first index structure to quickly search nodes corresponding to the operation line through the operation line.
And searching an array corresponding to each node by using the second index structure according to each node.
And using a second index structure to quickly find out the nodes corresponding to the running lines which are jointly hung or unwound through the nodes.
On the basis of the above embodiment, the first index structure and the second index structure in this embodiment are established using Map structures.
The Map structure is a set of mappings of key objects and value objects, each element containing a pair of key objects and value objects.
Optionally, the bottom layer of the Map structure is built by using a red black tree, a linked list and a hash table.
As shown in fig. 2, for example, the train 071001 is decompressed into 131007 and 141007, mainly by the following steps:
1. 071001, 131007 and 141007 run lines were compiled.
2. Selecting 071001 operation line, 131007 operation line and 141007 operation line, right key selecting and de-encoding;
3. setting a de-braiding track (de-braiding place) and de-braiding time, and clicking to confirm;
4. when clicking to confirm, the program automatically performs the following operations:
A. constructs 071001Node, 131007Node and 141007Node;
B. 071001Node is the head Node, the front Node set is empty, the back Node set is {131007Node;141007Node }, the corresponding run line is 071001 run line;
C. 131007Node is tail Node, front Node set is {071001Node }, rear Node set is null, and corresponding operation line is 131007 operation line;
D. 141007Node is tail Node, front Node set is {071001Node }, rear Node set is null, and corresponding operation line is 141007 operation line;
E. operation line- & gt Node index structure is {071001 operation line- & gt 071001Node;131007 running line→ 131007Node;141007 running line → 141007Node };
F. node- & gt, the co-coupling/de-indexing structure is {131007 Node- & gt 131007Node;141007Node ];141007 Node-131007 Node;141007Node ] }.
The train linkage unlocking operation chart compiling device provided by the invention is described below, and the train linkage unlocking operation chart compiling device described below and the train linkage unlocking operation chart compiling method described above can be correspondingly referred to each other.
As shown in fig. 3, the apparatus includes a compiling module 301, an adding module 302, and a representing module 303, wherein:
the compiling module 301 is used for respectively compiling operation lines before and after train linkage or uncoupling;
the adding module 302 is configured to add the time and place of the train hitch or the time and place of the decomplexation input by the user to the running line;
the representation module 303 is configured to represent a linkage relationship or an unwrapped relationship between the operation lines.
The embodiment is characterized in that the running lines before and after the train is hung or unwound are compiled, then the time and place for hanging or unwinding the train are increased in the running lines, and the hanging relation or the unwinding relation between the running lines is expressed, so that the running diagram of the train hanging or unwinding is compiled, and a foundation is provided for the planned running of the train hanging or unwinding.
Fig. 4 illustrates a physical schematic diagram of an electronic device, as shown in fig. 4, which may include: processor 410, communication interface (Communications Interface) 420, memory 430 and communication bus 440, wherein processor 410, communication interface 420 and memory 430 communicate with each other via communication bus 440. The processor 410 may invoke logic instructions in the memory 430 to perform a train hitch unbind running map compilation method comprising: respectively compiling running lines before and after train coupling or uncoupling; adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line; and representing the linkage relation or the de-coding relation among the operation lines.
Further, the logic instructions in the memory 430 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product, where the computer program product includes a computer program, where the computer program can be stored on a non-transitory computer readable storage medium, and when the computer program is executed by a processor, the computer can execute a method for compiling a train linkage disentangled running map provided by the above methods, and the method includes: respectively compiling running lines before and after train coupling or uncoupling; adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line; and representing the linkage relation or the de-coding relation among the operation lines.
In still another aspect, the present invention further provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the train linkage de-compiling operation map compiling method provided by the above methods, the method comprising: respectively compiling running lines before and after train coupling or uncoupling; adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line; and representing the linkage relation or the de-coding relation among the operation lines.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (9)
1. A train coupling and decoupling operation chart compiling method is characterized by comprising the following steps:
respectively compiling running lines before and after train coupling or uncoupling;
adding the time and the place of train linkage input by a user or the time and the place of uncoupling in the running line;
determining a linkage relation between running lines before and after the train linkage according to the time and the place of the train linkage;
determining a de-braiding relation between running lines before and after the train de-braiding according to the time and the place of the train de-braiding;
determining the unlocking relation between the running lines before and after the train is unwound according to the time and the place of the train, comprising the following steps:
taking the time and place of the train for uncoding as a uncoding point, taking the time and place of starting each running line as a starting point, and taking the time and place of ending each running line as an ending point;
determining the distance between a starting point and an ending point of each operation line and the de-encoding point, taking the operation line with smaller distance between the ending point and the de-encoding point as the operation line before de-encoding, and taking the operation line with smaller distance between the starting point and the de-encoding point as the operation line after de-encoding;
and representing the linkage relation or the de-coding relation among the operation lines.
2. The method for compiling a train linkage disentangled running map according to claim 1, wherein the step of representing the linkage relation or the disentangled relation between the running lines comprises:
packaging the operation lines in corresponding nodes respectively; wherein the operation lines and the nodes are in one-to-one correspondence;
and representing the linkage relation or the de-organization relation among the operation lines as a graph structure among the nodes.
3. The train linkage de-compiling operation graph compiling method according to claim 2, wherein the step of expressing the linkage relation or the de-compiling relation between the operation lines as the graph structure between the nodes includes:
determining whether each node is a head node and a tail node;
determining a front node set and a rear node set of each node;
and constructing a graph structure among the nodes by using whether each node is a head node and a tail node, a front node set and a rear node set of each node and an operation line corresponding to each node.
4. A train linkage de-compiling operation map compiling method according to claim 3, further comprising, after the step of representing a linkage relation or a de-compiling relation between the operation lines as a map structure between the nodes:
establishing a first index structure between each operation line and a node corresponding to each operation line;
and constructing an array by using nodes corresponding to the operation lines before or after train coupling, and establishing a second index structure between each node and the array to which each node belongs.
5. The method for constructing a train linkage de-compiling operation map according to claim 4, wherein after the step of constructing an array using nodes corresponding to operation lines before or after train linkage, and establishing an index structure between each node and the array to which each node belongs, the method further comprises:
searching a front node and a rear node of each node by using the graph structure according to each node;
searching a node corresponding to each operation line by using the first index structure according to each operation line;
and searching an array corresponding to each node by using the second index structure according to each node.
6. The train linkage de-mapping operation diagram mapping method according to claim 4, wherein the first index structure and the second index structure are established using Map structures.
7. A train linkage disentangled running chart compiling device, which is characterized in that the train linkage disentangled running chart compiling device is applied to the train linkage disentangled running chart compiling method according to any one of claims 1 to 6, and comprises the following steps:
the programming module is used for programming the operation lines before and after the train is hung or unwound respectively;
the adding module is used for adding the time and the place of the train linkage input by a user or the time and the place of the de-braiding in the running line;
and the representation module is used for representing the linkage relation or the de-organization relation among the operation lines.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the train linkage de-mapping method of any one of claims 1 to 6 when the program is executed.
9. A non-transitory computer readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the train linkage de-mapping operation diagram mapping method according to any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211049951.9A CN115320678B (en) | 2022-08-30 | 2022-08-30 | Train coupling-decoupling-editing operation chart compiling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211049951.9A CN115320678B (en) | 2022-08-30 | 2022-08-30 | Train coupling-decoupling-editing operation chart compiling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115320678A CN115320678A (en) | 2022-11-11 |
| CN115320678B true CN115320678B (en) | 2024-03-29 |
Family
ID=83928181
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211049951.9A Active CN115320678B (en) | 2022-08-30 | 2022-08-30 | Train coupling-decoupling-editing operation chart compiling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115320678B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2013170900A (en) * | 2012-02-20 | 2013-09-02 | Buaru Kenkyusho:Kk | Route guidance method, route guidance device and computer program |
| CN111806525A (en) * | 2020-06-30 | 2020-10-23 | 通号城市轨道交通技术有限公司 | Train operation diagram and train operation control method |
| CN112061140A (en) * | 2020-08-25 | 2020-12-11 | 通号城市轨道交通技术有限公司 | Train on-line connection and disconnection method |
| CN112116679A (en) * | 2020-08-25 | 2020-12-22 | 通号城市轨道交通技术有限公司 | Train operation diagram generation method and device and electronic equipment |
| JP2021054305A (en) * | 2019-09-30 | 2021-04-08 | 小田急電鉄株式会社 | Method, device, and program for vehicles utilization schedule generation |
| CN113320577A (en) * | 2021-06-21 | 2021-08-31 | 北京交通大学 | Automatic urban rail train running chart compiling method for single-running intersection |
| CN113377979A (en) * | 2021-06-09 | 2021-09-10 | 中国国家铁路集团有限公司 | Method for comparing, generating and optimizing train running scheme based on Mercker tree |
| CN113408914A (en) * | 2021-06-25 | 2021-09-17 | 交控科技股份有限公司 | Method and device for compiling train planned operation diagram, electronic equipment and storage medium |
| CN114516350A (en) * | 2022-02-23 | 2022-05-20 | 浙江众合科技股份有限公司 | Unified resource management method under virtual linkage de-editing scene |
| CN114611871A (en) * | 2022-01-29 | 2022-06-10 | 北京全路通信信号研究设计院集团有限公司 | Automatic compilation method and system for railway operation diagram |
| CN114655281A (en) * | 2022-03-08 | 2022-06-24 | 通号城市轨道交通技术有限公司 | Train operation diagram processing method and device, electronic equipment and storage medium |
-
2022
- 2022-08-30 CN CN202211049951.9A patent/CN115320678B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2013170900A (en) * | 2012-02-20 | 2013-09-02 | Buaru Kenkyusho:Kk | Route guidance method, route guidance device and computer program |
| JP2021054305A (en) * | 2019-09-30 | 2021-04-08 | 小田急電鉄株式会社 | Method, device, and program for vehicles utilization schedule generation |
| CN111806525A (en) * | 2020-06-30 | 2020-10-23 | 通号城市轨道交通技术有限公司 | Train operation diagram and train operation control method |
| CN112061140A (en) * | 2020-08-25 | 2020-12-11 | 通号城市轨道交通技术有限公司 | Train on-line connection and disconnection method |
| CN112116679A (en) * | 2020-08-25 | 2020-12-22 | 通号城市轨道交通技术有限公司 | Train operation diagram generation method and device and electronic equipment |
| CN113377979A (en) * | 2021-06-09 | 2021-09-10 | 中国国家铁路集团有限公司 | Method for comparing, generating and optimizing train running scheme based on Mercker tree |
| CN113320577A (en) * | 2021-06-21 | 2021-08-31 | 北京交通大学 | Automatic urban rail train running chart compiling method for single-running intersection |
| CN113408914A (en) * | 2021-06-25 | 2021-09-17 | 交控科技股份有限公司 | Method and device for compiling train planned operation diagram, electronic equipment and storage medium |
| CN114611871A (en) * | 2022-01-29 | 2022-06-10 | 北京全路通信信号研究设计院集团有限公司 | Automatic compilation method and system for railway operation diagram |
| CN114516350A (en) * | 2022-02-23 | 2022-05-20 | 浙江众合科技股份有限公司 | Unified resource management method under virtual linkage de-editing scene |
| CN114655281A (en) * | 2022-03-08 | 2022-06-24 | 通号城市轨道交通技术有限公司 | Train operation diagram processing method and device, electronic equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于节点服务的高速铁路列车停站方案优化模型;李得伟;韩宝明;李晓娟;张洪军;;铁道学报(06);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115320678A (en) | 2022-11-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109325762A (en) | Across the chain method of commerce of parallel chain, equipment and storage medium | |
| CN104346373B (en) | Subregion journal queue synchronization management method and equipment | |
| CN105468702A (en) | Large-scale RDF data association path discovery method | |
| CN109299404B (en) | LKJ line data-based train operation path searching method, device and system | |
| CN103259718A (en) | Flow table conversion method and device | |
| KR101304663B1 (en) | The system of cooperative editing of mind-map and the method thereof | |
| CN106095961B (en) | Table display processing method and device | |
| CN109213762A (en) | The automatic Pilot track data generation method and device of Locomotive Running Monitor System | |
| CN110962889B (en) | Automatic route selection and arrangement method and device for head yard vehicle | |
| CN113408914A (en) | Method and device for compiling train planned operation diagram, electronic equipment and storage medium | |
| CN108280463A (en) | Optimization method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN115320678B (en) | Train coupling-decoupling-editing operation chart compiling method and device | |
| CN113259242B (en) | Method and device for networking field area network | |
| CN107807844A (en) | Generation method, device and the computer-readable recording medium of traffic test scene | |
| CN102724301B (en) | Cloud database system and method and equipment for reading and writing cloud data | |
| CN101917282B (en) | Method, device and system for processing alarm shielding rules | |
| CN111028312B (en) | Method and device for generating foldback line in subway operation chart | |
| CN105074703A (en) | Method for processing a set of data to be used subsequently with a view to graphically generating an electrical diagram of an electrical system | |
| CN106250356A (en) | The fast resolving method of protective relaying device abstract object based on Hash table | |
| CN111144578A (en) | Artificial intelligence model management system and management method under distributed environment | |
| CN107659643A (en) | Cloud platform construction method and device | |
| CN103457812A (en) | Silent automatic networking method based on communication network of master node and slave nodes | |
| CN110647668A (en) | Power supply loop searching method based on virtual power supply branch | |
| CN102262687B (en) | Methods for searching path and calculating wire length in wire harness network | |
| CN110083603A (en) | A kind of querying method and system for realizing node path based on adjacency list |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |