CN115544128A - Generation method of locomotive turnover chart, electronic equipment and storage medium - Google Patents
Generation method of locomotive turnover chart, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115544128A CN115544128A CN202211124179.2A CN202211124179A CN115544128A CN 115544128 A CN115544128 A CN 115544128A CN 202211124179 A CN202211124179 A CN 202211124179A CN 115544128 A CN115544128 A CN 115544128A
- Authority
- CN
- China
- Prior art keywords
- locomotive
- list
- turnaround
- data
- intersection
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/258—Data format conversion from or to a database
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Quality & Reliability (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention provides a method for generating a locomotive turnaround graph, electronic equipment and a storage medium, wherein the method comprises the steps of receiving relevant information of a train operation line of a TDCS system, respectively matching and warehousing with the information of the operation line on the existing locomotive turnaround graph, respectively traversing locomotive traffic information in different types of operation line lists, and matching and checking the rationality with the existing locomotive traffic data, thereby realizing the automatic generation of the locomotive turnaround graph. The invention can improve the accuracy and real-time performance of the operation line, does not need manual drawing, avoids the defect that the manually drawn turnover map is not flexible enough, and greatly improves the efficiency of drawing the turnover map.
Description
Technical Field
The invention relates to the technical field of rail transit, in particular to a generating method of a locomotive turnover chart, electronic equipment and a storage medium.
Background
With the rapid development of the railway industry, the intellectualization of the locomotive operation management trend is a great trend. The locomotive turnaround chart is a diagram display of locomotive traffic and locomotive number operation information of each section on a railway and is an important component of a locomotive work plan. At present, the generation of a locomotive turnover diagram is drawn manually, and a locomotive dispatcher manually draws the locomotive turnover diagram by checking the relevant information of a running diagram system and the locomotive application information fed back by contacting with relevant personnel of field engineering. However, the existing method is time-consuming and labor-consuming, can cause errors, is poor in real-time performance, and is not beneficial to the intelligent development of the railway industry. Therefore, the method which can realize more accurate and intelligent locomotive turnover graphs by using intelligent technology and advanced method is great trend and has great significance for improving the working efficiency of railway transportation.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a method, electronic equipment and storage medium for automatically generating a locomotive turnaround map, which are widely applicable.
In order to achieve the above purpose, the invention is realized by the following technical scheme:
a method for generating a locomotive turnover diagram comprises the following steps: acquiring operation line information sent by a TDCS system at fixed time; performing data structure conversion on the operation line information to obtain operation line data of a locomotive turnover diagram, and storing the operation line data into a cache dictionary; and processing the operation line data in the cache dictionary to obtain a locomotive turnaround graph.
Optionally, the operation line information includes: train number, locomotive information, running time, origin station, destination station, and run line type.
Optionally, the step of processing the run-line data in the cache dictionary to obtain a locomotive turnaround map includes:
according to the operation line type of the operation line data, respectively storing the operation line data in the cache dictionary in a deletion cache list and an update list, copying and storing the deletion cache list and the update list in a database; and respectively processing the operation line data in the deletion cache list and the operation line data in the update list to obtain the locomotive turnaround graph.
Optionally, the step of processing the operation line data in the delete cache list to obtain the locomotive turnaround map includes:
deleting the deletion cache list in the database; traversing the locomotive information in the deletion cache list, acquiring the existing related locomotive intersection of the corresponding operation line in the database, deleting the locomotive intersection corresponding to the operation line in the database, and outputting the locomotive turnaround chart.
Optionally, the step of processing the operation line data in the updated list to obtain the locomotive turnaround map comprises:
judging whether the operation line data in the updating list and the existing operation line data have repeated operation line data or not;
if the running line data does not exist, storing all the running line data in the updating list into a newly added cache list; copying and storing the newly added cache list into the database;
if all the operation line data in the update list are repeated with the existing operation line data, storing the operation line data in the update list into an update cache list; copying and storing the newly added cache list into the database;
if there is a partially repeated run-line data in the update list,
storing the repeated operation line data in the update list into the update cache list, copying the update cache list and storing the copy in the database;
and storing the running line data which is not repeated into the newly added cache list, copying the newly added cache list and storing the newly added cache list into the database.
Optionally, the step of processing the newly added cache list to obtain the locomotive turnaround graph includes:
traversing the locomotive information in the newly-added cache list, and matching and judging the locomotive information with the existing locomotive traffic data, wherein when the locomotive information meets the locomotive traffic connection condition,
performing intersection sketching on the existing locomotive intersection data to generate new locomotive intersection data, and outputting the locomotive turnaround chart;
storing the new locomotive traffic data in the database.
Optionally, when the locomotive information does not meet the locomotive intersection connection condition, directly generating new locomotive intersection data, and outputting the locomotive turnover diagram; and storing the new locomotive traffic data into the database.
Optionally, the step of processing the updated cache list to obtain the locomotive turnaround map comprises:
traversing the locomotive information in the updated cache list, and matching the locomotive information with the existing locomotive traffic data;
extracting locomotive information in the updated cache list to generate a first locomotive list, extracting locomotive information in the existing locomotive traffic route data to generate a second locomotive list, matching the first locomotive list with the second locomotive list, acquiring locomotives which do not exist in the first locomotive list from the second locomotive list to generate a third locomotive list, deleting all locomotive traffic routes associated in the third locomotive list from the existing locomotive traffic route data, and outputting the locomotive turnaround chart; deleting all locomotive trips associated with the existing locomotive trip data in the third locomotive list in the database.
Optionally, for the locomotive alternative routes corresponding to the same locomotive in the first locomotive list acquired in the second locomotive list, when it is checked that the alternative route connection in the locomotive alternative routes is reasonable, the locomotive alternative routes are directly stored in a database; and outputting the locomotive turnaround graph.
Optionally, for the locomotive intersection corresponding to the same locomotive in the first locomotive list acquired in the second locomotive list, when it is checked that the intersection connection in the locomotive intersection is not reasonable, intersection delineation is performed on the locomotive intersection to obtain new locomotive intersection data, and the locomotive turnaround map is output; and storing the new locomotive traffic data into the database.
Optionally, the locomotive turnaround map is edited and/or labeled.
Optionally, the step of performing intersection delineation and generating the new locomotive intersection data includes:
the method comprises the steps of obtaining a locomotive traffic route of the locomotive,
finding a locomotive passing road with the same locomotive number as the locomotive in the locomotive passing road,
the station accessing the traffic road is consistent with the station pulling out the traffic road,
the time for pulling out the traffic is shorter than the time for accessing the traffic,
and when the locomotive is not the warehousing locomotive, outputting the drawn locomotive to cross the road, and obtaining the new locomotive traffic data.
Optionally, the method further comprises: and when the locomotive with the same locomotive number as the locomotive is not found in the locomotive intersection, the locomotive intersection is not drawn.
Optionally, the method further comprises: and when the station accessing the traffic road is inconsistent with the station pulling the traffic road, the locomotive traffic road is not drawn.
Optionally, the method further comprises: and when the time for pulling out the intersection is not less than the time for accessing the intersection, the locomotive intersection is not drawn.
Optionally, the method further comprises: when the locomotive is a warehousing locomotive, the locomotive is not drawn.
Optionally, the step of performing intersection delineation and generating the new locomotive intersection data further includes: adding access intersection:
and acquiring the latest available routes drawn from the existing locomotive route data according to the locomotive information in the operation line data in the updated list.
And if the pulled-out latest available cross road is empty, generating a new access cross road.
Optionally, the method further comprises: and when the dragged latest available traffic route is not empty and no existing access traffic route exists in the dragged latest available traffic route, directly taking the available access traffic route of the dragged latest available traffic route as a new access traffic route and storing the new access traffic route in the database.
Optionally, the method further comprises: when the drawn latest available traffic routes are not empty and existing access traffic routes exist in the drawn latest available traffic routes, updating the existing access traffic routes to generate new access traffic routes; and storing the new access intersection data into the database.
Optionally, the step of performing intersection delineation and generating the new locomotive intersection data further includes: adding a step of pulling out the intersection:
acquiring the latest available cross road accessed from the existing locomotive cross road data according to the locomotive information in the operation line data in the updated list;
and if the latest available cross road is empty, generating a new pull-out cross road.
Optionally, the method further comprises: and when the accessed latest available traffic route is not empty and the accessed latest available traffic route does not have the existing pulled traffic route, directly taking the available pulled traffic route of the accessed latest available traffic route as a new pulled traffic route and storing the new pulled traffic route in the database.
Optionally, the method further comprises: and when the latest accessed available traffic routes have the existing tractive traffic routes, generating a new tractive traffic route from the existing tractive traffic routes in the latest accessed available traffic routes, and storing the new tractive traffic route in the database.
In another aspect, the present invention also provides an electronic device comprising a processor and a memory, the memory having stored thereon a computer program which, when executed by the processor, implements the method as described above.
In yet another aspect, the present invention also provides a readable storage medium, in which a computer program is stored, which, when executed by a processor, implements a method as described above.
The invention has one of the following advantages:
the invention generates the turnover graph according to the real-time operation graph information of the TDCS system, can improve the accuracy and the real-time performance of the operation line, does not need manual drawing, avoids the defect that the manually drawn turnover graph is not flexible enough, and greatly improves the efficiency of drawing the turnover graph.
The invention can match the received locomotive information in the operation line with the existing locomotive intersection information, check the intersection reasonability, finally generate a reasonable locomotive turnaround chart and reduce the error rate of manually drawing the intersection.
After the automatically generated locomotive turnaround graph is completed, the locomotive dispatcher can also edit and modify the locomotive turnaround graph.
Drawings
FIG. 1 is a general flow chart of a method for generating a locomotive turnaround chart according to an embodiment of the invention;
fig. 2 is a specific cross-road delineation conditional logic diagram in the method for generating a locomotive turnaround diagram according to an embodiment of the present invention;
fig. 3 is a specific add-on traffic sub-flowchart in the method for generating a locomotive turnaround chart according to an embodiment of the present invention;
fig. 4 is a specific add-pull traffic sub-flowchart in the method for generating a locomotive turnaround diagram according to an embodiment of the present invention.
Detailed Description
The method for generating a locomotive turnaround chart, the electronic device, and the storage medium according to the present invention will be described in detail below with reference to the accompanying drawings and the detailed description. The advantages and features of the present invention will become more apparent from the following description. It is to be noted that the drawings are in a very simplified form and are all used in a non-precise scale for the purpose of facilitating and distinctly aiding in the description of the embodiments of the present invention. To make the objects, features and advantages of the present invention more comprehensible, reference is made to the accompanying drawings. It should be understood that the structures, ratios, sizes, etc. shown in the drawings and attached to the description are only for understanding and reading the disclosure of the present disclosure, and are not for limiting the scope of the present disclosure, so they do not have the essential meaning in the art, and any modifications of the structures, changes of the ratio relationships, or adjustments of the sizes, should fall within the scope of the present disclosure without affecting the efficacy and the achievable purpose of the present disclosure.
The invention provides a method for generating a locomotive turnaround graph, which is characterized in that the method comprises the steps of receiving Train Operation graph Operation line related information (Operation line information) of a TDCS (Train Operation Dispatching Command management System, which is a Dispatching Command management System covering the whole road and can timely and accurately provide modern Dispatching Command management means and platforms for Dispatching Command managers at all levels of the whole road, respectively matching and warehousing the Operation line information with the Operation line information on the existing locomotive turnaround graph (storing the Operation line information into a database), respectively traversing locomotive intersection information in different types of Operation line lists, and matching and checking the reasonability of the existing locomotive intersection information, thereby realizing the automatic generation of the locomotive turnaround graph.
Specifically, as shown in fig. 1, the method for generating a locomotive turnaround chart provided in this embodiment includes:
s1, a locomotive turnover diagram system acquires running line information sent by a TDCS system at fixed time; in this embodiment, the operation line information includes: train number, locomotive information (locomotive number), time of day, origin station, destination station, type of line of travel, and locomotive information.
And S2, performing data structure conversion on the operation line information to obtain operation line data of a locomotive turnaround chart (converting into a turnaround chart data structure according to the received operation line information).
And S3, storing the running line data into a cache dictionary.
Specifically, the performing of data structure conversion on the operation line information refers to that the operation line type is already classified in the received operation line information. The cache dictionary comprises an added cache list, an updated cache list and a deleted cache list. If the operation line type is the operation line data which is newly added, the operation line data which is newly added and stored in a system database is directly executed (namely, the operation line data which is stored in the newly added cache list and copied and stored in the database is stored), if the operation line type is the operation line data which is changed and needs to be updated, the operation line data which needs to be updated is directly updated and stored in the database (the operation line data which needs to be updated is stored in the updated cache list, the updated cache list is copied and stored in the database), and if the operation line type is the operation line data which needs to be deleted, the database deleting operation is directly executed (the operation line data which is stored in the deleted cache list, the deleted cache list is copied and stored in the database, and then the deleted cache list is directly deleted in the database). Thus, the running line information in the TDCS system is kept consistent in real time.
Dividing the running line data in the cache dictionary into a deletion cache list (step S19) and an update list (step S4);
step S5, judging whether the operation line data in the updated list (step S4) and the existing operation line data have repeated operation line data; the update list is the same as the update cache list, which is obtained by copying the update list, for the convenience of distinguishing.
If the running line data exists and all the running line data in the updating list are repeated with the existing running line data, the step S6 is executed;
step S6, storing the operation line data in the update list into an update cache list, and executing operation line database update operation (copying and storing the newly added cache list into the database);
if the running line data exists and the running line data partially repeated exists in the update list, storing the repeated running line data in the update list into the update cache list, and executing a running line database update operation (copying and storing the update cache list into the database);
and storing the running line data which is not repeated into the newly added cache list, and executing the newly added operation of the running line database (copying and storing the newly added cache list into the database).
If not, the step S7 is executed;
and S7, storing all the operation line data in the update list into a newly added cache list, and executing newly added operation of the operation line database (copying and storing the newly added cache list into the database).
S15, traversing the locomotive information in the newly added cache list;
step S16, matching and judging the locomotive information and the existing locomotive traffic data, judging whether the locomotive information meets locomotive traffic connection conditions, and if so, entering step S18; if not, the process proceeds to step S17.
S17, directly generating new locomotive traffic data, and storing the new locomotive traffic data into the database; the process advances to step S14.
S18, carrying out intersection delineation on the existing locomotive intersection data, generating new locomotive intersection data (namely a locomotive turnaround graph), and storing the new locomotive intersection data in the database; the process advances to step S14.
S8, traversing the locomotive information in the updated cache list;
step S9, matching the locomotive information with the existing locomotive route crossing data, extracting the locomotive information in the updated cache list to generate a first locomotive list 1, extracting the locomotive information in the existing locomotive route crossing data to generate a second locomotive list 2, matching the first locomotive list 1 with the second locomotive list 2, judging whether the second locomotive list 2 contains other locomotives except the first locomotive list (whether other locomotives except the locomotive in the first locomotive list and not in the first locomotive list exist in the second locomotive list), and if so, entering step S10; if not, the step S11 is entered.
Step S10, obtaining a locomotive that does not exist in the first locomotive list 1 in the second locomotive list 2 to generate a third locomotive list 3, deleting all associated locomotive trips in the third locomotive list 3 in the existing locomotive trip data, that is, performing a database deletion operation (deleting all locomotive trips associated with the existing locomotive trip data in the third locomotive list 3 in the database), and entering step S14.
Step S11, checking whether the intersection connection in the existing intersection data is reasonable (for the locomotive intersection corresponding to the same locomotive in the first locomotive list 1 acquired in the second locomotive list 2, then checking whether the intersection connection in the locomotive intersection is reasonable), and if so, entering step S12; if not, the step S13 is entered.
And S12, directly updating the existing intersection data into a warehouse (and directly storing the locomotive intersection in a database), and entering S14.
And S13, performing intersection delineation on the locomotive intersection again (resetting the locomotive intersection), then performing database updating operation (obtaining new locomotive intersection data, outputting the locomotive turnaround chart, storing the new locomotive intersection data into the database), and entering the step S14.
Step S20, a database deletion operation of the run-line data is performed (the deletion cache list in the database is deleted).
Step S21, traversing the locomotive information in the deletion cache list, acquiring the existing related locomotive intersection of the corresponding operation line in the database, deleting the locomotive intersection corresponding to the operation line in the database, and entering step S14.
And S14, outputting the locomotive turnover map.
As shown in fig. 2 to 4, a specific implementation process of the above-mentioned intersection-drawing-needed and generating the new locomotive intersection data is given:
continuing with fig. 2, a locomotive cross-over is obtained (which may be, for example, the existing locomotive cross-over data obtained in step S18 above, or the locomotive cross-over obtained in step S13 for the same locomotive in the second locomotive list 2 as in the first locomotive list 1).
And finding the locomotive passing routes with the same locomotive number as the locomotive in the locomotive passing routes.
The stations accessed to the traffic routes are consistent with the stations pulling out the traffic routes.
The time for pulling out the traffic routes is less than the time for accessing the traffic routes.
And when the locomotive is not a warehousing locomotive, outputting the drawn locomotive to cross the road to obtain the new locomotive cross road data, wherein the new locomotive cross road data is the locomotive turnover map to be obtained.
The step of intersection delineation still includes: and when the locomotive with the same locomotive number as the locomotive is not found in the locomotive crossroads, not drawing the locomotive crossroads.
The step of intersection delineation still includes: and when the station accessing the traffic road is inconsistent with the station pulling the traffic road, the locomotive traffic road is not drawn.
The step of intersection delineation still includes: when the locomotive is a warehousing locomotive, the locomotive is not drawn.
The step of performing the intersection delineation and generating the new locomotive intersection data further comprises: the step of adding access crossroads as shown in fig. 3:
s101, obtaining locomotive information in the operation line data in the updating list;
and S102, acquiring the latest available traffic routes drawn from the existing locomotive traffic route data according to the locomotive information.
Step S103, judging whether the dragged latest available intersection is empty, if so, entering step S104; if not, the process proceeds to step S105.
And step S104, generating a new access intersection (locomotive access intersection).
Step S105, judging whether the latest available cross road has an access cross road or not; if yes, go to step S107; if not, the step S106 is executed;
and step S106, updating the access traffic routes of the original traffic routes (directly taking the available access traffic routes of the latest available traffic routes as new access traffic routes and storing the new access traffic routes in the database).
Step S107, the old access traffic is updated to generate a new traffic and the access information of the original traffic is updated (the existing access traffic is updated to generate a new access traffic; and the new access traffic data is stored in the database).
The step of performing the intersection delineation and generating the new locomotive intersection data further comprises: the add-pull traffic flow shown in fig. 4:
step S201, locomotive information in the operation line data in the updating list is obtained.
And S202, acquiring the accessed latest available delivery from the existing locomotive delivery data according to the locomotive information.
Step S203, judging whether the accessed latest available intersection is empty, if so, entering step S204; if not, go to step S205;
step S204, generating a new haul-out traffic road (locomotive haul-out traffic road).
Step S205, judging whether the accessed latest available traffic routes have a traffic route; if yes, go to step S207; if not, go to step S206;
step S206, updating the pull-out intersection of the original intersection (directly using the available pull-out intersection of the latest available intersection as the new pull-out intersection, and storing the new pull-out intersection in the database).
Step S207, updating the old drawn traffic routes to generate new traffic routes, and updating the drawn information of the original traffic routes (updating the existing drawn traffic routes in the latest available traffic routes to generate new drawn traffic routes, and storing the new drawn traffic routes in the database).
This embodiment still includes: the locomotive turnaround graph which is automatically outlined by the system can be modified manually, and the operation of editing, labeling and the like on the locomotive turnaround graph refers to the operation of editing and/or labeling the information which needs to be displayed and the like on the locomotive turnaround graph which is automatically outlined by the locomotive dispatcher after the locomotive turnaround graph is automatically generated.
The steps form a closed loop, the time of manual drawing by manpower can be saved by receiving the operation diagram data of the TDCS system, matching and rationality inspection are carried out on the operation diagram data and the existing locomotive traffic information each time, the accuracy and the real-time performance of drawing the turnover diagram are improved, and the locomotive dispatcher can conveniently use and manage the locomotive.
To further understand the present embodiment, the generation of the locomotive turnaround diagram of the present invention is described in a more specific embodiment below:
receiving operation line information sent by a TDCS system at fixed time, hanging a 0111 locomotive at a station A and starting to a station B, hanging a 0111 locomotive at the station B and starting to other stations at another 12355 train number, converting the received operation line information into a data structure of a turnover graph system, and respectively placing the operation line information in a newly added cache list, an updated cache list and a deleted cache list (equivalent to a cache dictionary) according to the type of the operation line.
If the running line 12345 is used for deleting the cache list, that is, the running graph of the previous TDCS system has the cache list, and the running graph of the subsequent TDCS system has the cache list deleted, the cache list is placed, and the deletion is directly executed.
And traversing the locomotive traffic information in the deleted cache list. If the 12345 train number belongs to the operation line in the deletion cache list, then the existing related traffic routes of the operation line are obtained, and the traffic routes corresponding to the motor train 0111 are deleted in the database.
If the train number of the operation line 12345 is in the newly added cache list or the cache list is updated, the newly added warehousing and the updating warehousing are directly executed.
And traversing the locomotive traffic information in the newly added cache list. And judging whether the locomotive intersection information meets intersection connection conditions, if the drawn intersection 0111 locomotive of 12345 train number and the accessed intersection 0111 locomotive of 12355 train number meet the connection conditions, generating a new locomotive intersection, and if the drawn intersection 0111 locomotive does not meet the intersection connection conditions, destroying the original intersection and generating a new intersection.
The said connection condition of the traffic route means that the number of the vehicles accessing the traffic route and pulling out the traffic route are the same, the stations accessing the traffic route and pulling out the traffic route are the same, and the time of accessing the traffic route is later than the time of pulling out the traffic route, and the vehicle is not the warehousing vehicle, and the connection condition of the traffic route is satisfied when these conditions are satisfied.
And traversing the locomotive traffic information in the updated cache list. If the locomotive traffic information comprises the existing locomotive traffic information, namely the existing locomotive traffic data comprises information of 0111 locomotive traffic of 12345 train numbers, then checking whether the existing traffic connection is reasonable, if the traffic connection is reasonable, updating the locomotive traffic for warehousing, and if the connection is unreasonable, re-matching to find the locomotive traffic of the reasonable 0001 locomotive, and then sketching for warehousing; and if the update cache list does not contain information of the 0111 locomotive with 12345 train number for crossing, deleting the locomotive for crossing.
After the locomotive cross road connection is finished, a final locomotive turnover diagram is generated, and a locomotive dispatcher can also perform editing and other operations on the turnover diagram to achieve the desired display effect.
With continued reference to fig. 2, the specific process of drawing locomotive crossroads is as follows:
1) If a pull-out bus of 0111 locomotive is generated, the above steps are repeated.
2) And searching for a traffic route with the same locomotive number according to the locomotive number 0111, if the traffic route cannot be found, not drawing the traffic route, and if the traffic route with the same locomotive number is found, turning to the step 3).
3) And (4) judging whether the station where the locomotive 0111 accesses the traffic road is consistent with the station where the locomotive 0111 pulls the traffic road, if not, not drawing the traffic road, and if so, turning to the step 4).
4) It is checked whether the pull-out time of the locomotive No. 0111 is less than the access time of the locomotive No. 0111. If the condition is not met, the road is not drawn and handed over, and if the condition is met, the step 5) is carried out.
5) And judging whether the locomotive 0111 is an warehousing locomotive or not according to the received locomotive information, if so, not performing intersection, and otherwise, performing intersection.
6) And outputting a final locomotive turnover diagram after the intersection is finished, wherein a locomotive dispatcher can edit and modify the locomotive turnover diagram and output the locomotive turnover diagram after the completion of confirmation.
The present embodiment also provides an electronic device, comprising a processor and a memory, wherein the memory stores a computer program, and when the computer program is executed by the processor, the method as described above is implemented.
The present embodiment also provides a readable storage medium having stored therein a computer program which, when executed by a processor, implements a method as described above.
In summary, the present embodiment relates to a method for generating a locomotive turnaround graph by using a TDCS, comprising the following steps: receiving operation line data sent by a TDCS system at fixed time, converting the operation line data into a locomotive turnaround graph operation line data structure, and placing the locomotive turnaround graph operation line data structure in a cache dictionary; pre-processing operation line data: dividing a locomotive turnaround chart operation line in a cache dictionary into a deletion list and an update list according to the type of the received operation line data, directly executing database deletion operation on the operation line data in the deletion list, firstly judging whether the operation line data in the update list is repeated with the existing operation line data, if not, putting the data which are not repeated into a newly added cache list, and executing operation line database newly added operation; if the data are duplicated, the duplicated operation line data are placed in an updating cache list, and the operation line database updating operation is executed; for the operation line deletion list, directly traversing locomotive information data in the list, acquiring the existing related intersection of the operation line, and deleting the intersection in a database; traversing locomotive information data in the newly-added running line cache list, judging whether the locomotive intersection connection condition is met, if not, directly generating a new locomotive intersection, and if so, destroying the original intersection to generate a new intersection; and for the operation line updating list, traversing the locomotive information data in the list, matching the locomotive information data with the existing intersection, deleting the existing intersection information (the existing locomotive intersection data) if the existing intersection comprises the locomotives except the locomotives in the locomotive list, otherwise generating the intersection or updating the existing intersection, simultaneously checking whether the intersection connection is reasonable, directly updating the intersection data into a warehouse if the intersection connection is reasonable, and otherwise resetting the locomotive intersection. (6) The locomotive turnaround graph which is automatically drawn by the system can be modified manually. Compared with the prior art, the method has wide practicability, avoids the error probability of manual drawing by utilizing the method for automatically generating the locomotive turnaround chart by utilizing the train operation chart of the TDCS system, lightens the labor intensity of a locomotive dispatcher and improves the working efficiency.
It should be noted that, in this document, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of additional like elements in a process, method, article, or apparatus that comprises the element.
It should be noted that the apparatuses and methods disclosed in the embodiments herein can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments herein. In this regard, each block in the flowchart or block diagrams may represent a module, a program, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments herein may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
While the present invention has been described in detail with reference to the preferred embodiments, it should be understood that the above description should not be taken as limiting the invention. Various modifications and alterations to this invention will become apparent to those skilled in the art upon reading the foregoing description. Accordingly, the scope of the invention should be limited only by the attached claims.
Claims (24)
1. A method for generating a locomotive turnover picture is characterized by comprising the following steps:
acquiring operation line information sent by a TDCS system at fixed time;
performing data structure conversion on the operation line information to obtain operation line data of a locomotive turnover diagram, and storing the operation line data into a cache dictionary;
and processing the operation line data in the cache dictionary to obtain a locomotive turnaround graph.
2. The method of generating a locomotive turnaround map of claim 1, wherein the run-line information comprises: train number, locomotive information, operating time, origin station, terminal station, and type of operating line.
3. The method of generating a locomotive turnaround map of claim 2, wherein the step of processing the run line data in the cache dictionary to obtain a locomotive turnaround map comprises:
respectively storing the running line data in the cache dictionary in a deletion cache list and an update list according to the running line type of the running line data, and copying and storing the deletion cache list and the update list in a database; and respectively processing the operation line data in the deletion cache list and the operation line data in the update list to obtain the locomotive turnaround chart.
4. The method for generating a locomotive turnaround map of claim 3, wherein the step of processing the run line data in the delete cache list to obtain the locomotive turnaround map comprises:
deleting the deletion cache list in the database; traversing the locomotive information in the deletion cache list, acquiring the existing related locomotive intersection of the corresponding operation line in the database, deleting the locomotive intersection corresponding to the operation line in the database, and outputting the locomotive turnaround graph.
5. The method of generating a locomotive turnaround map of claim 4,
the step of processing the operation line data in the updated list to obtain the locomotive turnaround map comprises:
judging whether the operation line data in the updating list and the existing operation line data have repeated operation line data or not;
if the running line data does not exist, storing all the running line data in the updating list into a newly added cache list; copying and storing the newly added cache list into the database;
if all the operation line data in the update list are repeated with the existing operation line data, storing the operation line data in the update list into an update cache list; copying and storing the newly added cache list into the database;
if there is a partially repeated run-line data in the update list,
storing the repeated operation line data in the update list into the update cache list, copying the update cache list and storing the copy in the database;
and storing the running line data which is not repeated into the newly added cache list, copying the newly added cache list and storing the newly added cache list into the database.
6. The method for generating a locomotive turnaround map of claim 5, wherein the step of processing the newly added buffer list to obtain the locomotive turnaround map comprises:
traversing the locomotive information in the newly-added cache list, and matching and judging the locomotive information with the existing locomotive traffic data, wherein when the locomotive information meets the locomotive traffic connection condition,
performing intersection sketching on the existing locomotive intersection data to generate new locomotive intersection data, and outputting the locomotive turnaround chart;
storing the new locomotive trip data in the database.
7. The method of generating a locomotive turnaround map of claim 6,
when the locomotive information does not accord with the locomotive intersection connection condition, directly generating new locomotive intersection data and outputting the locomotive turnover diagram; and storing the new locomotive traffic data into the database.
8. The method of generating a locomotive turnaround map of claim 5, wherein processing the updated buffer list to obtain the locomotive turnaround map comprises:
traversing the locomotive information in the updated cache list, and matching the locomotive information with the existing locomotive traffic data;
extracting locomotive information in the updated cache list to generate a first locomotive list, extracting locomotive information in existing locomotive route-crossing data to generate a second locomotive list, matching the first locomotive list with the second locomotive list, obtaining locomotives which do not exist in the first locomotive list from the second locomotive list to generate a third locomotive list, deleting all locomotive routes which are related in the third locomotive list from the existing locomotive route-crossing data, and outputting the locomotive turnover diagram; deleting all locomotive trips associated with the existing locomotive trip data in the third locomotive list in the database.
9. The method of generating a locomotive turnaround chart of claim 8, wherein for the locomotive commutations obtained in the second locomotive list corresponding to the same locomotives in the first locomotive list, if it is then verified that the commutations in the locomotive commutations are reasonably connected, then directly storing the locomotive commutations in a database; and outputting the locomotive turnover map.
10. The method of generating a locomotive turnaround map of claim 9,
for the locomotive intersection corresponding to the same locomotive in the first locomotive list acquired in the second locomotive list, when the unreasonable intersection connection in the locomotive intersection is checked, intersection delineation is performed on the locomotive intersection to obtain new locomotive intersection data, and the locomotive turnaround graph is output; storing the new locomotive traffic data in the database.
11. The method of generating a locomotive turnaround map as claimed in any one of claims 1 to 10, further comprising: and editing and/or labeling the locomotive turnaround graph.
12. The method for generating a locomotive turnaround map of claim 6 or 10, wherein the performing a trip delineation, generating the new locomotive trip data comprises:
the method comprises the steps of obtaining a locomotive traffic route of the locomotive,
finding a locomotive passing road with the same locomotive number as the locomotive in the locomotive passing road,
the station accessing the traffic road is consistent with the station pulling out the traffic road,
the time for pulling out the intersection is shorter than the time for accessing the intersection,
and when the locomotive is not the warehousing locomotive, outputting the drawn locomotive to cross the road, and obtaining the new locomotive traffic data.
13. The method of generating a locomotive turnaround map of claim 12, further comprising: and when the locomotive with the same locomotive number as the locomotive is not found in the locomotive crossroads, not drawing the locomotive crossroads.
14. The method of generating a locomotive turnaround map of claim 13, further comprising: and when the station accessing the traffic road is inconsistent with the station pulling the traffic road, the locomotive traffic road is not drawn.
15. The method of generating a locomotive turnaround map of claim 14, further comprising: when the time of pulling out the intersection is not less than the time of accessing the intersection, the locomotive intersection is not drawn.
16. The method of generating a locomotive turnaround map of claim 14, further comprising: when the locomotive is a warehousing locomotive, the locomotive is not drawn.
17. The method of generating a locomotive turnaround map of claim 11, wherein the performing a trip delineation and generating the new locomotive trip data further comprises: adding an access intersection:
obtaining the latest available crossing pulled out from the existing locomotive crossing data according to the locomotive information in the operation line data in the updated list;
and if the pulled-out latest available cross road is empty, generating a new access cross road.
18. The method of generating a locomotive turnaround map of claim 17, further comprising: and when the dragged latest available traffic route is not empty and no existing access traffic route exists in the dragged latest available traffic route, directly taking the available access traffic route of the latest available traffic route as a new access traffic route and storing the new access traffic route in the database.
19. The method of generating a locomotive turnaround map of claim 18, further comprising:
when the drawn latest available traffic routes are not empty and existing access traffic routes exist in the drawn latest available traffic routes, updating the existing access traffic routes to generate new access traffic routes; and storing the new access intersection data into the database.
20. The method for generating a locomotive turnaround map of claim 11, wherein the performing a trip delineation, generating the new locomotive trip data further comprises: adding a pulling-out intersection:
obtaining the accessed latest available route in the existing locomotive route data according to the locomotive information in the operation line data in the updated list;
and if the latest available cross road is empty, a new pulled cross road is generated.
21. The method of generating a locomotive turnaround map of claim 20, further comprising:
and when the accessed latest available traffic routes are not empty and the accessed latest available traffic routes do not have existing pulled traffic routes, directly taking the available pulled traffic routes of the latest available traffic routes as new pulled traffic routes and storing the new pulled traffic routes in the database.
22. The method of generating a locomotive turnaround map of claim 21, further comprising:
and when the accessed latest available traffic routes have the existing pulled traffic routes, generating a new pulled traffic route from the existing pulled traffic routes in the accessed latest available traffic routes, and storing the new pulled traffic route in the database.
23. An electronic device, comprising a processor and a memory, the memory having stored thereon a computer program which, when executed by the processor, carries out the method of any one of claims 1 to 22.
24. A readable storage medium, in which a computer program is stored which, when executed by a processor, carries out the method of any one of claims 1 to 22.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211124179.2A CN115544128A (en) | 2022-09-15 | 2022-09-15 | Generation method of locomotive turnover chart, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211124179.2A CN115544128A (en) | 2022-09-15 | 2022-09-15 | Generation method of locomotive turnover chart, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115544128A true CN115544128A (en) | 2022-12-30 |
Family
ID=84727248
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211124179.2A Pending CN115544128A (en) | 2022-09-15 | 2022-09-15 | Generation method of locomotive turnover chart, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115544128A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116674613A (en) * | 2023-08-03 | 2023-09-01 | 北京全路通信信号研究设计院集团有限公司 | Locomotive turnover control method, device, equipment and medium for railway small-running locomotive |
-
2022
- 2022-09-15 CN CN202211124179.2A patent/CN115544128A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116674613A (en) * | 2023-08-03 | 2023-09-01 | 北京全路通信信号研究设计院集团有限公司 | Locomotive turnover control method, device, equipment and medium for railway small-running locomotive |
| CN116674613B (en) * | 2023-08-03 | 2023-10-24 | 北京全路通信信号研究设计院集团有限公司 | Locomotive turnover control method, device, equipment and medium for railway small-running locomotive |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110222445B (en) | BIM and design information based integration, collaborative design and delivery method and system | |
| WO2019095825A1 (en) | Parameter-based 2d-drawing/3d-model smart conversion method and system for platform door | |
| CN108279017B (en) | Method for calculating and adding via points in real time in navigation process | |
| CN110472797B (en) | Web-based urban public transportation complex network automatic generation method | |
| CN103150398A (en) | National fundamental geographic information data-based incremental map updating method | |
| CN109859505B (en) | Early warning processing method, device, server and medium for high-speed station | |
| CN115544128A (en) | Generation method of locomotive turnover chart, electronic equipment and storage medium | |
| CN104820733A (en) | A high-speed train requirement meta model establishing method and device | |
| CN111190891A (en) | Multi-semantic track data segmented storage method | |
| CN111539658A (en) | Automatic design system of railway engineering construction organization | |
| CN112381906A (en) | Automatic drawing method for bus model basic line network | |
| CN104748757A (en) | Data updating method and device for navigation electronic map | |
| CN117454476A (en) | Method and system for generating construction organization plane layout schematic diagram based on satellite map | |
| CN113177046A (en) | Road network topological graph generation method, device, equipment and storage medium | |
| CN113392987B (en) | Multi-source data fusion-based bus station position repairing method | |
| CN113902531A (en) | Automatic generation system, method, electronic device and storage medium for bid document | |
| CN115574828B (en) | Garbage recovery point location determination method and device, electronic equipment and storage medium | |
| Lemmen et al. | Efficient and automatic production of periodic updates of cadastral maps | |
| CN117874306B (en) | Engineering data source processing method and device, electronic equipment and storage medium | |
| CN109781130A (en) | The method and apparatus that bus route is planned automatically | |
| JPH11213051A (en) | Time-series schematic management system | |
| CN113821736B (en) | Method, device, equipment and medium for predicting vehicle destination based on prefix tree | |
| CN117268368A (en) | Map data conversion system, method, apparatus, and readable medium | |
| Kaş | A BIM-based collaboration system in design phase of metro projects in turkish aec industry | |
| CN117520439A (en) | Urban space structure visualization method based on provincial domain traffic big 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 |