CN110509963B - Operation sequence selection method suitable for STP running test - Google Patents
Operation sequence selection method suitable for STP running test Download PDFInfo
- Publication number
- CN110509963B CN110509963B CN201910870864.1A CN201910870864A CN110509963B CN 110509963 B CN110509963 B CN 110509963B CN 201910870864 A CN201910870864 A CN 201910870864A CN 110509963 B CN110509963 B CN 110509963B
- Authority
- CN
- China
- Prior art keywords
- section
- tree
- taking
- node
- station yard
- 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
Images
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/04—Automatic systems, e.g. controlled by train; Change-over to manual control
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mechanical Engineering (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention discloses an operation sequence selection method suitable for an STP running test, which comprises the following steps: taking a railway station yard as a boundary, taking a station yard edge section as a root node, taking a station yard as a leaf node, taking equipment on a path as other nodes of a binary tree, and abstracting the whole railway station yard into the binary tree representation of different tree roots by branch throats; carrying out depth-first search on each tree, and carrying out centralized marking on sections passing by; and after all searches are finished, calculating the occupation error and the clearing error of each section by using the marked information. According to the method, coverage of the operation section is guaranteed through tree modeling, depth-first search and unmeasured section statistics, and the omission probability of the length of the rechecking section completely depending on manual car following is effectively reduced. Through counting the operation conditions and results of different sections, the statistical analysis of the section length errors is automatically output, the working strength of manual vehicle following staring control is effectively reduced, and the statistical accuracy is improved.
Description
Technical Field
The invention relates to the technical field of rail transit, in particular to an operation sequence selection method suitable for an STP running test.
Background
Along with the wide popularization and use of the wireless shunting locomotive signal and the monitoring System (STP) on the whole road, the safety protection of the special shunting operation process is effectively ensured. STP adopts "target-distance" mode control train to close signal preceding safety distance within range parking before the front, through the real-time tracking to train position, realizes the real-time calculation to the distance of train front end to the parking point, therefore, the distance plays decisive factor to system control, if the distance error is great then the safeguard function of system is not from talking at all. According to the requirements of maintenance management methods (number [ 2015 ] 148) for signal and monitoring System (STP) operation of wireless shunting locomotives, the test verification of STP data, monitoring function, system function and the like is organized before STP equipment for new construction, overhaul and updating and reconstruction is formally put into operation, and the accuracy of various types of data and parameter setting of STP is mainly verified, so that the actual requirement of shunting monitoring is met. In order to ensure the accuracy of test verification and the validity of a verification result and improve the test verification efficiency in the STP test running stage, it is urgently needed to design an operation sequence selection method suitable for the STP running test.
In the STP trial run stage, important work is distance error checking except that consistency of vehicle-mounted and ground signal display and speed limit condition setting needs to be checked. The method mainly adopts manual car following staring control to complete in combination with normal operation of shunting operation at present, has the characteristics of long time, strong subjectivity, high staring control strength and the like, and a track pressing plan (operation sequence) is mainly manually compiled by combining personal experience of shunting organizers with a station car receiving and dispatching situation, so that no effective technical means is available for automatically compiling the track pressing plan.
Disclosure of Invention
The invention aims to provide an operation sequence selection method suitable for an STP running test, which can effectively reduce the working intensity of manual car-following staring control.
The purpose of the invention is realized by the following technical scheme:
a method for selecting an operation sequence suitable for an STP running test comprises the following steps:
taking a railway station yard as a boundary, taking a station yard edge section as a root node, taking a station yard as a leaf node, taking equipment on a path as other nodes of a binary tree, and abstracting the whole railway station yard into the binary tree representation of different tree roots by branch throats;
and performing depth-first search on each tree, and after all the sections are traversed at least once, indicating that all the sections are completely traversed, thereby obtaining an integral operation sequence.
According to the technical scheme provided by the invention, the repeated running times of the same section in the shunting operation process can be reduced, and compared with the existing mode, the energy-saving and efficiency-increasing effects are obvious. Coverage of the operation section is guaranteed through tree modeling, depth-first searching and unmeasured section statistics, and omission probability of the length of the section which is completely checked by manual car following is effectively reduced. Through counting the operation conditions and results of different sections, the statistical analysis of the section length errors is automatically output, the working strength of manual vehicle following staring control is effectively reduced, and the statistical accuracy is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a flowchart of an operation sequence selection method suitable for an STP running test according to an embodiment of the present invention;
fig. 2 is a schematic plan view of a station yard uplink throat according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a binary tree established with D1G as a root according to an embodiment of the present invention;
fig. 4 is a block diagram of a module according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention provides an operation sequence selection method suitable for an STP running test, which mainly comprises the following steps as shown in figure 1:
1. the railway station yard takes the station tracks as boundaries, takes the station yard edge sections as root nodes, takes the station tracks as leaf nodes, and divides the throat to abstract the whole railway station yard into binary tree representations of different tree roots.
In the existing searching algorithm of the graph and the tree, in order to ensure the searching efficiency, the visit of the vertex is generally limited to one time. However, for railway shunting operation, the precondition that train running is dependent on opening of the access road is that part of track circuits of different access roads are the same, so that operation according to the access road will lead to repeated passing of some track circuits in the access road.
In order to ensure complete coverage of a track circuit in a station yard, repeated operation is reduced as much as possible, and track pressing efficiency is improved. In the embodiment of the invention, the operation sequence planning is carried out by adopting a depth-first search algorithm of a binary tree, the characteristics of shunting operation according to shunting route traveling are combined, edge sections (such as a dead line, a special line, a positive line entering port and the like) in a station yard graph are taken as root nodes of the binary tree, a station track is taken as a leaf node, and equipment (a turnout section, a shunting signal machine and a turnout) on a path is taken as other nodes of the binary tree, so that a station yard plane schematic diagram is modeled. In addition, the collocated annunciators at the same insulating node are represented by the same node, and the mark of whether the collocated annunciators exist in the node is added in the corresponding node information.
In the embodiment of the invention, the station yard is divided into the ascending throat and the descending throat by taking the station track as a boundary, and the binary tree structure is established for each throat according to the method so as to realize the full coverage of the sections in the station yard. Fig. 2 is a schematic plan view of an ascending throat of a station.
In addition, for a section with a car in the throat, it can be used as a leaf node in the model. The dedicated line D1G is used as the root node of the binary tree, and the binary tree is established along the station field downlink direction as shown in fig. 3. Fig. 3 is compiled based on fig. 2, and C begins with the switch names in fig. 2, such as C3 in fig. 3, which is 3 to the left of D5 in fig. 2. Unnecessary nodes which are not related to traversal, such as C1, C9, C13 and the like, are omitted from the binary tree, and the shunting signals are embodied in the binary tree as nodes for facilitating shunting route arrangement.
The station field edge section is used as a tree root of the binary tree, the dividing line of the ascending and descending throats in the station field is used as a leaf node of the binary tree, and the same-direction shunting signal machine or turnout starting from the root node is used as other nodes of the binary tree to establish the binary tree. Finally, the whole station yard is represented by a plurality of binary trees with different tree roots, and a plurality of same nodes exist among the different binary trees.
2. And performing depth-first search on each tree, and after all the sections are traversed at least once, indicating that all the sections are completely traversed, thereby obtaining an integral operation sequence.
1) And (6) path traversal.
In the embodiment of the invention, traversal is carried out from the root node of each binary tree according to a depth-first principle, each traversed section is marked, after leaf nodes are searched, backtracking is carried out towards the root node, backtracking is carried out to the same-direction shunting signal machine, stopping, and depth search is continuously carried out towards other leaf nodes according to a re-opened same-direction shunting route until all searches are finished.
When node backtracking is carried out, in order to prevent a switch-squeezing accident, attention needs to be paid to the opening of a shunting continuous route, namely the opened retracing route is long enough, and single-operation locking is carried out on switches without the condition of route opening, so that the switches cannot be squeezed during new track operation of a locomotive.
In the embodiment of the invention, after all the idle sections are finished, the traversal process is ended, so that the whole operation sequence is obtained.
For example, in fig. 2, the binary tree (non-critical switch nodes are omitted) looks for 1G from D1G, that is, it is a job sequence. And when all the sections finish walking (the binary tree does not need to be completely traversed at the moment), the whole operation sequence is selected.
2) And (4) running marks.
In the embodiment of the invention, when depth-first search is carried out, the passed sections are also marked in a centralized manner.
Establishing a unified index table for all sections in the station yard, and recording the occupation and clearing time of each section, the locomotive speed and the running direction at the corresponding time and LKJ running displacement information; and in the traversing process, recording the occupation of the path section, the clearing time and the locomotive speed, the running direction and the LKJ running displacement information at the corresponding time.
For a plurality of passes, the status value for each pass is recorded separately. And when all the sections are traveled at least once, ending the running test process.
The section where the vehicle is parked may be a turning section, but not a section that must be passed through in the running test.
In the process, a unified index table is established for all the sections, corresponding walking information is recorded for the walking sections, and the sections without walking information are the unmeasured sections, so that the statistics of the unmeasured sections can be realized.
3. And after all searches are finished, calculating the occupation error and the clearing error of each section by using the marked information.
In the embodiment of the invention, the occupied error and the clearing error of each section are calculated by using the information marked in the step 2 according to an error calculation method, and the report output can be formed by classification.
Those skilled in the art will appreciate that the error calculation method can be implemented using conventional methods, for example, the method disclosed in patent No. ZL 201510007586.9.
The sections with bad splits need to be marked in the data in advance. And combining and calculating the lengths of the poor-branching sections and the adjacent good-branching sections, and confirming by adopting a manual measurement and rechecking mode after the operation test is finished. The bad shunting section and the good shunting section refer to whether a certain section has bad shunting or not in terms of the situation of the track circuit on site, and are based on that the corresponding written statistical records are carried out by the electric service department at a station.
For the section with the stored car, the length error of the section is not taken as the statistical analysis item of the invention, the invention can output the section statistical table which is not tested because of the occupation of the stored car, and then the manual compensation test can be carried out according to the statistical table or the pressing test can be carried out again after the track circuit is cleared.
The scheme of the embodiment of the invention can be realized through modular design, as shown in fig. 4, the step 1 is realized through a tree-shaped modeling module, the step 2 is realized through a path traversing module and a walking marking module, and the step 3 is realized through a statistical analysis module.
The method provided by the invention can realize the full coverage of the operation test of the shunting locomotive on the traveling of the idle operation section in the station yard, can provide a decision basis for the planning of the shunting plan of the STP operation test, and can effectively improve the efficiency of the STP operation test according to the formulated shunting operation plan. According to the method, the tree-shaped modeling module, the path traversing module, the walking marking module and the statistical analysis module are organically combined, the repeated walking times of the same section in the shunting operation process can be reduced, and compared with the existing mode, the energy-saving and efficiency-increasing effects are remarkable. Coverage of the operation section is guaranteed through tree modeling, depth-first searching and unmeasured section statistics, and omission probability of the length of the section which is completely checked by manual car following is effectively reduced. Through counting the operation conditions and results of different sections, the statistical analysis of the section length errors is automatically output, and the working strength and the statistical accuracy of manual car following staring control are effectively reduced.
Through the above description of the embodiments, it is clear to those skilled in the art that the above embodiments can be implemented by software, and can also be implemented by software plus a necessary general hardware platform. With this understanding, the technical solutions of the embodiments can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.), and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods according to the embodiments of the present invention.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (3)
1. A method for selecting an operation sequence suitable for an STP running test is characterized by comprising the following steps:
taking a railway station yard as a boundary, taking a station yard edge section as a root node, taking a station yard as a leaf node, taking equipment on a path as other nodes of a binary tree, and abstracting the whole railway station yard into the binary tree representation of different tree roots by branch throats;
performing depth-first search on each tree, and after all sections are traversed at least once, indicating that all sections have finished traveling, thereby obtaining an integral operation sequence;
wherein performing a depth-first search on each tree comprises: traversing according to a depth-first principle from a root node of each binary tree, marking each traversed section, backtracking to the direction of the root node after searching leaf nodes, stopping backtracking to a same-direction shunting signal machine, and continuing to perform depth search to other leaf nodes according to a re-opened same-direction shunting route until all searches are finished;
establishing a unified index table for all sections in the station yard, and recording the occupation and clearing time of each section, the locomotive speed and the running direction at the corresponding time and LKJ running displacement information; and in the traversing process, recording the occupation of the path section, the clearing time and the locomotive speed, the running direction and the LKJ running displacement information at the corresponding time.
2. The method of claim 1, wherein the abstracting the entire rail yard into a binary tree representation of different tree roots by a branch throat by using the rail as a boundary, the edge zone of the rail yard as a root node, and the rail as a leaf node comprises:
separating the whole railway station according to an ascending throat and a descending throat, and modeling each throat according to a tree form;
taking a dead end line, a special line and a positive line station entrance in a station yard graph as root nodes, taking a station track as a leaf node of a binary tree, and taking a turnout section, a shunting signal machine and a turnout on a path as other nodes of the binary tree; and for the collocated annunciators at the same insulating node, the same node is adopted for representing, and the mark of whether the node has the collocated annunciators or is added in the corresponding node information.
3. The method of claim 1, wherein the depth-first search is performed on each tree, and the sections that pass through are collectively marked;
and after all searches are finished, calculating the occupation error and the clearing error of each section by using the marked information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910870864.1A CN110509963B (en) | 2019-09-16 | 2019-09-16 | Operation sequence selection method suitable for STP running test |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910870864.1A CN110509963B (en) | 2019-09-16 | 2019-09-16 | Operation sequence selection method suitable for STP running test |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110509963A CN110509963A (en) | 2019-11-29 |
| CN110509963B true CN110509963B (en) | 2021-10-26 |
Family
ID=68632386
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910870864.1A Active CN110509963B (en) | 2019-09-16 | 2019-09-16 | Operation sequence selection method suitable for STP running test |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110509963B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112541987A (en) * | 2020-12-17 | 2021-03-23 | 深圳我家云网络科技有限公司 | Electronic patrol route generation method and device and computer storage medium |
| CN112950906B (en) * | 2021-02-01 | 2022-06-07 | 中国铁路上海局集团有限公司杭州工务段 | Intelligent operation staring and controlling visual management system |
| CN113696942B (en) * | 2021-10-28 | 2022-04-08 | 北京全路通信信号研究设计院集团有限公司 | Depth-first-based train route acquisition method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101916402A (en) * | 2010-08-03 | 2010-12-15 | 中南大学 | Railway marshalling and shunting method |
| CN104765814A (en) * | 2015-04-03 | 2015-07-08 | 中铁第四勘察设计院集团有限公司 | Multi-time-scale coexisting type management method for railway yard plan station tracks |
| JP2015189392A (en) * | 2014-03-28 | 2015-11-02 | 株式会社日立製作所 | Station system creation support device and method |
| CN108153165A (en) * | 2017-12-04 | 2018-06-12 | 中国铁路总公司 | A kind of emulation test method and device of marshaling yard complex automatic system |
-
2019
- 2019-09-16 CN CN201910870864.1A patent/CN110509963B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101916402A (en) * | 2010-08-03 | 2010-12-15 | 中南大学 | Railway marshalling and shunting method |
| JP2015189392A (en) * | 2014-03-28 | 2015-11-02 | 株式会社日立製作所 | Station system creation support device and method |
| CN104765814A (en) * | 2015-04-03 | 2015-07-08 | 中铁第四勘察设计院集团有限公司 | Multi-time-scale coexisting type management method for railway yard plan station tracks |
| CN108153165A (en) * | 2017-12-04 | 2018-06-12 | 中国铁路总公司 | A kind of emulation test method and device of marshaling yard complex automatic system |
Non-Patent Citations (1)
| Title |
|---|
| CTCS-3级列控系统现场测试及辅助工具的研究;刘磊;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20120315;第3.3节，第3.4节，第4章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110509963A (en) | 2019-11-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110509963B (en) | Operation sequence selection method suitable for STP running test | |
| CN102887159B (en) | Method and device for railway vehicle tracking and planned reporting | |
| CN112590878B (en) | Line topology generation method based on column control engineering data table | |
| CN112660208B (en) | System key parameter generation method and device based on electronic map data | |
| CN104462133B (en) | A kind of interlocking tables of data automatic generation method and device | |
| CN111915221B (en) | Capability analysis method suitable for high-speed railway | |
| CN109410368B (en) | Method for calculating freight car running mileage based on railway car number information | |
| CN110008486B (en) | Data extraction method for track traffic blocking equipment | |
| Tuchschmid et al. | Carbon Footprint and environmental impact of Railway In-frastructure | |
| JP5941771B2 (en) | Delay loss evaluation apparatus, delay loss calculation and display method | |
| CN111003028B (en) | Train point reporting method and system based on robustness dynamic scene recognition | |
| Aly et al. | Computer applications in railway operation | |
| CN103738364B (en) | A kind of section searching method and system | |
| CN113415325B (en) | Rail transit station arrival interval calculation system and method | |
| RU2685368C1 (en) | Device for construction of forecast energy-saving train schedules | |
| CN110686700B (en) | Railway wagon running mileage statistical method and system | |
| CN115662124A (en) | GPS track data road section flow matching method based on network coding | |
| Madejski | Autonomous track geometry diagnostics system | |
| Rakesh et al. | Modeling and formal verification of SMT rail interlocking system using PyNuSMV | |
| Si et al. | A method of generating engineering test sequence for urban rail transit CBTC system based on formalization | |
| CN112949029A (en) | Method and system for cooperatively evaluating traffic flow and passenger flow | |
| Longo et al. | Estimating train motion using detailed sensor data | |
| CN113256188A (en) | Regional track cross-line operation transport capacity evaluation interaction system | |
| CN112429039A (en) | Track section dividing method | |
| de Fabris et al. | An algorithm for the calibration of running time calculation on the basis of GPS data |
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 |