CN-122022655-A - Truck plan error-proofing method and system suitable for hub dispatching section

CN122022655ACN 122022655 ACN122022655 ACN 122022655ACN-122022655-A

Abstract

The invention discloses a truck planning error-proofing method suitable for a hub dispatching section, which comprises the steps of constructing an error-proofing basic configuration system based on fuzzy station configuration, truck planning operation path checking rule configuration and black-and-white list configuration of truck planning operation path checking rules, matching a corresponding operation path by a graph planning line, automatically loading a graph planning number list, automatically checking the validity of the black-and-white list, matching the corresponding operation path by the truck planning line, traversing checking rules based on a disordered hash set method, checking the matching relation between the truck planning line and the rules, checking the truck planning operation path error-proofing validity, sequentially checking whether the truck planning line number is in a complete number blacklist, a number first character blacklist, a graph planning number list, a complete number white list and a number first character white list based on a matching result, recording alarm information, and dynamically outputting an alarm according to priority. Systems, electronic devices, and computer-readable storage media are also disclosed.

Inventors

ZHOU XIAOZHAO
GAO PAN
ZHANG YIMENG
CHEN JUNLONG
YANG BO
YAO SHUJIN
ZHANG XIAO
WANG LIN
ZHANG TAO
MIAO YIFENG
QI WEI
JIAO XIAOYU
HE YIYONG
GAO LIN
FU ZHONGHUI
SUN GUOHUA

Assignees

中国铁道科学研究院集团有限公司
中国铁道科学研究院集团有限公司通信信号研究所
北京华铁信息技术有限公司
北京锐驰国铁智能运输系统工程技术有限公司

Dates

Publication Date: 20260512
Application Date: 20260128

Claims (10)

1. A truck planning error-proofing method suitable for a hub dispatching section is characterized by comprising the following steps: S1, constructing an error-proof basic configuration system, which comprises fuzzy station configuration, truck planning operation path inspection rule configuration and black-and-white list configuration of the truck planning operation path inspection rule, wherein the fuzzy station configuration is related to stations under the control of the station by adopting a mode of only configuring a master station, so that the configuration quantity is reduced; S2, traversing the check rule of the truck planning operation path one by one, storing node station codes of the graph planning scribing line through a disordered hash set, checking whether the multi-direction station association station codes and the key station codes are in the set, and determining a matching relation; s3, automatically loading a train number list of the drawing, wherein the train number list of the drawing is automatically loaded into a black-and-white list corresponding to the running path checking rule based on the matching result of the S2; S4, independently checking the validity of the black-and-white list, wherein the method comprises the steps of checking the black-and-white list from three dimensions of validity, repeatability and conflict, removing invalid configuration, processing repeated configuration and alarming conflict configuration; S5, matching the wagon metering lines with the corresponding operation paths, wherein the method comprises the steps of traversing the checking rules by adopting a disordered hash set method consistent with the step S2, and checking the matching relation between the wagon metering lines and the rules; s6, checking the error-proofing legitimacy of the wagon planning running path, wherein the checking comprises the steps of sequentially checking whether wagon planning line number is in a complete number blacklist, a number first character blacklist, a diagram setting number list, a complete number whitelist and a number first character whitelist based on a matching result of the S5, and recording alarm information; S7, dynamically outputting alarms according to priorities, wherein the step comprises the step of outputting final alarm information according to a preset alarm priority rule, wherein the alarm priorities are that the complete train number blacklist alarm > the train number first character blacklist alarm > the non-graphical and non-whitelist alarm are sequentially from high to low, and the checking time is when a down-stage plan is issued and when the validity checking of a train operation plan is actively initiated.
2. The truck planning error-proofing method suitable for a hub dispatching section according to claim 1 is characterized in that a fuzzy station configuration format in S1 is FuzzyStaCount =the number of fuzzy stations, serial numbers=dispatching desk shortcodes, fuzzy station names and associated station codes, wherein when a plurality of associated stations exist in each station yard governed by the associated stations, chinese pause numbers are used, the dispatching desk shortcodes are unique identifiers of dispatching desks, the fuzzy station names are station master station names, the truck planning operation route check rule configuration format in S1 is RuleCfgCount =the number of rule configuration serial numbers=the dispatching desk shortcodes, rule IDs, multi-direction names, operation route directions are operation route directions, operation route identification key names can be used, the rule IDs are unique identifiers of each check rule, the operation route directions are specific directions in which trains operate, the key station names are necessary to identify the operation route, the truck planning operation route is unique identifiers, the number of rule IDs in S1 are arranged, and the black-white station names are black-white station name identifiers, the number of rule IDs in the truck planning operation route check rule configuration format is the black-white table shortlist, and the number of rule IDs in S1 is arranged.
3. The method for preventing wrong handling of a truck plan suitable for a hub dispatching section according to claim 2 is characterized in that the black-and-white list type and list content take values comprising a type 1 of a complete train number black list, a type 2 of a train number first character black list, a type 3 of a complete train number white list, a type 4 of a train number first character allowing running on the running path, a plurality of values of a train number first character not needing to be used for the Chinese number, a type 5 of a train number, a number or a Chinese character corresponding to the running path, a type 3 of a complete train number white list, a type 3 of a complete train number, a type 4 of a train number first character white list allowing running on the running path, a type 4 of a train number first character allowing running on the running path, a plurality of values of a train number first character not needing to be used for the Chinese number, a letter or a Chinese character, a type 5 of a corresponding running path, and automatic plan setting by a system.
4. A method for preventing a truck from being misplaced for a hub dispatch section according to claim 3, wherein S2 comprises: s21, inputting a graph design rule and a truck design operation path inspection rule, wherein the graph design rule comprises core information of station codes, train numbers and operation directions of all nodes of the plan; s22, initializing an unordered hash set, and sequentially adding station codes of nodes of a graph and a meter line into the hash set, wherein the query time complexity of the unordered hash set is O (1), so that the high efficiency of station code verification is ensured; S23, acquiring a station code vector associated with a corresponding multi-direction station name by a truck planning operation path checking rule, traversing the vector to check whether the station code is in a hash set, if any station code is not in the set, judging that a graph planning rule is not matched with the rule, and continuing traversing the next rule; S24, acquiring a key station code vector identified by a corresponding operation path by using a truck planning operation path inspection rule, traversing the vector to inspect whether station codes in the vector are in a hash set, judging that the graph metering line is not matched with the rule if any station code is not in the set, and judging that the graph metering line is matched with the rule if all the station codes are in the set.
5. The method for preventing a truck from being misplaced in a hub dispatch section according to claim 4, wherein S3 comprises: S31, for each successfully matched graph counting line and operation path checking rule, automatically generating a black-and-white list configuration of type 5 of the graph counting line corresponding to the operation path, wherein the list content of the black-and-white list configuration is the complete number of the graph counting line, and if the same operation path corresponds to a plurality of graph counting lines, the list content is the number of all corresponding graphs counting lines and is separated by Chinese numbers, wherein the automatically loaded configuration items label a 'system automatic generation' mark and are distinguished from manual configuration items; s32, setting a regular updating mechanism, automatically scanning the image planning data in the early morning every day, and synchronously updating the corresponding black-and-white list configuration if the image planning is changed, so that the real-time performance of the data is ensured.
6. The method for preventing a truck from being misplaced in a hub dispatch section according to claim 5, wherein S4 comprises: S41, performing validity check, namely, the complete train number needs to be one combination of numbers, letters, numbers, chinese characters, letters and numbers, the first character of the train number needs to be one of numbers, letters and Chinese characters, and the first character is regarded as invalid configuration and is deleted if the first character does not meet the first character; S42, carrying out repeatability check, wherein the occurrence frequency of the same train number in a complete train number blacklist or a white list is more than 1, or the occurrence frequency of the same character in a first train number character blacklist or a white list is more than 1, redundant repeated items are required to be deleted, and only one effective configuration is reserved; s43, performing conflict checking, namely if the same train number is simultaneously displayed in a complete train number blacklist and a white list, the same character is simultaneously displayed in a train number first character blacklist and a white list, the figure-set train number is displayed in the complete train number blacklist, and the first character of the figure-set train number is displayed in the train number first character blacklist, generating conflict alarm information to prompt manual processing.
7. The method for preventing mistakes in truck planning for a hub dispatch section according to claim 6, wherein S5 comprises: S51, inputting wagon counting lines and wagon counting running path inspection rules, wherein the wagon counting lines comprise various to-be-inspected plans of a temporary plan, a changing plan and an addition plan, and the to-be-inspected plans comprise information of planned node station codes and vehicle number; s52, initializing an unordered hash set, and sequentially adding station codes of nodes of wagon marking lines into the hash set; S53, acquiring a station code vector associated with a corresponding multi-direction station name by a truck planning operation path checking rule, traversing the vector to check whether the station code is in a hash set, if any station code is not in the set, judging that a truck planning line is not matched with the rule, and continuing traversing the next rule; S54, acquiring a key station code vector identified by a corresponding operation path by using a truck planning operation path inspection rule, traversing the vector to inspect whether station codes in the vector are in a hash set, judging that truck counting lines are not matched with the rule if any station code is not in the set, and judging that the truck counting lines are matched with the rule if all the station codes are in the set.
8. The method for preventing mistakes in truck planning for a hub dispatch section according to claim 7 wherein S6 comprises: S61, inputting wagon counting lines, and extracting core information of the planned train number and the node station code; S62, matching the running path inspection rules of the truck one by one, and executing S51-S54 by the matching method to obtain all the running path inspection rules corresponding to the metering lines of the truck; s63, judging whether the number of the wagon marked out is in a complete number blacklist of a wagon running path checking rule corresponding to the number of the wagon marked out, if so, outputting alarm information of XXX-time wagon marking out running path error [ number of the wagon in the running path blacklist ], "and ending the mistake proofing check of the wagon; S64, judging whether the first character of the train number of the wagon marking line is in a first character blacklist of the train number of the wagon running path checking rule corresponding to the first character, if so, recording alarm information of XXX-time wagon marking running path error [ first character of the train number is in the running path blacklist ] to an alarm information record set, jumping to S62 to continuously match with the next rule, and if not, continuously executing S65; s65, judging whether the number of the wagon marked line is in a list of the number of the wagon marked line in the diagram of the wagon running path inspection rule corresponding to the number of the wagon marked line, if so, jumping to S62 to continuously match the next rule, and if not, continuously executing S66; S66, judging whether the train number of the wagon marking line is in a complete train number white list of the corresponding wagon running path checking rule, if so, jumping to S72 to continuously match the next rule, and if not, continuously executing S67; S67, judging whether the first character of the train number of the wagon marking is in a white list of the first character of the train number of the wagon running path checking rule corresponding to the first character, if yes, jumping to S62 to continuously match the next rule, if not, and if the alarm information record set is empty, recording alarm information of ' XXX-time wagon marking running path is not graphically defined and is not in the white list, please pay attention to ' to the alarm information record set ', and then jumping to S62 to continuously match the next rule; And S68, after traversing all the operation path checking rules, if the alarm information record set is empty, judging that the wagon planning operation path is correct, and not outputting an alarm, and if not, executing S7.
9. The method for preventing mistakes in truck planning for a hub dispatch section according to claim 8 wherein S7 comprises: s71, an alarm information record set is additionally arranged, the record set is emptied before a single truck is input into a plan, and only one piece of alarm information is reserved in the record set and is the alarm information with the highest current priority; S72, if the number of the wagon marked out is in the complete number blacklist, directly outputting the alarm and ending the inspection; s73, if the first character of the train number of the wagon is in the black list of the first character of the train number, recording the alarm if the record set is empty, and replacing the original alarm if the record set is not empty; S74, if the number of the wagon is not shown in the graph and is not in the white list, recording the alarm if the record set is empty; and S75, after traversing all the rules, if the record set is not empty, outputting alarm information in the record set.
10. A truck plan error proofing system suitable for a hub dispatch section for implementing the method of any of claims 1-9, characterized by a modular design comprising a base configuration module (101), a plan matching module (102), a validity check module (103), a truck plan matching module (104), an error proofing check module (105) and a hierarchical alarm module (106), wherein: the basic configuration module (101) is used for realizing fuzzy station configuration, wagon planning operation path inspection rule configuration, black-and-white list configuration and standardized configuration data output; The map-based plan matching module (102) is used for executing the S2-S3 method to realize matching of map-based plan marking lines and operation paths and automatic loading of map-based train number lists; the validity checking module (103) is used for executing the method of S4 to realize validity, repeatability and conflict checking of the black-and-white list; The truck plan matching module (104) is used for executing the method of S5 to realize matching of truck scribing and operation path checking rules; The error-proofing checking module (105) is used for executing the method of S6 to realize the validity check of the truck planning operation path; The hierarchical alarm module (106) is used for executing the method of the S7 and dynamically outputting alarm information according to the priority, and the check time of the system is when the stage is planned to be issued and when the validity check of the train operation plan is actively initiated.

Description

Truck plan error-proofing method and system suitable for hub dispatching section Technical Field The invention relates to the technical field of railway transportation scheduling, in particular to a truck planning error-proofing handling method and system suitable for a hub scheduling section, which are particularly suitable for multi-directional, high-density and high-mobility truck planning operation route error-proofing management of a common speed railway hub scheduling section and can cover all types of truck planning scenes such as train planning, temporary train changing, additional train opening and the like. Background The railway hub dispatching section is a core node of a railway transportation network, bears key operations such as receiving and dispatching, disassembling, grouping, transferring and the like of a goods train, and is a key link for guaranteeing the efficient and safe operation of railway transportation. Along with the continuous increase of railway freight traffic in China, the freight car planning of the common speed railway hub dispatching section has three remarkable characteristics that firstly, the planning density is high, the number of freight trains planned to be processed daily is hundreds, tens of plans are required to be processed in each hour in the peak period, secondly, the operation path diversity is realized, the hub stations are arranged in a multi-station layout, a plurality of receiving train ports are arranged, the train operation paths are required to cover the connection of different stations in different directions, the operation path types of part of the hubs can be tens, thirdly, the planning change mobility is strong, the situation of temporarily changing the operation paths and adding and opening temporary trains is frequently caused by factors such as freight transportation demand adjustment, line construction, equipment failure, weather disasters and the like, and the change and adding and opening plan proportion of part of the hubs can reach more than 20%. In the actual dispatching command process, a train dispatcher needs to complete the paving and adjustment of a large number of truck plans in a short time, and the problems of running path paving errors are very easy to occur due to the fact that the number of nodes involved in the plans is large, the association relationship is complex, and various dynamic change factors are considered. Once the truck is in an incorrect planning running direction, the train can drive into an incorrect route, so that serious accidents such as route congestion, equipment conflict and even train collision are caused. According to statistics, the proportion of transportation delay accidents caused by wrong planning operation paths of trucks in the railway hub dispatching sections in China is more than 15%, and single accidents averagely cause hundreds of thousands of yuan, so that the timeliness of railway transportation is seriously affected, and a great threat is formed to transportation safety. Therefore, research and development of the error-proofing method and system which can adapt to the characteristics of the hub dispatching section and accurately identify the errors of the planned running path of the truck becomes an urgent need in the field of railway transportation dispatching. At present, aiming at the legitimacy check of the running path of the truck planning, the most similar implementation scheme in the prior art is to carry out the legitimacy check according to the running path planned by the corresponding diagram when planning in the delivery stage. The specific technical flow of the scheme is that firstly, a corresponding map-based plan is matched according to the number of the train of the stage plan, the running path information (comprising the number of nodes, station codes corresponding to each node point sequence and the like) of the map-based plan is obtained, and then the comparison and the inspection are carried out one by one according to the number of nodes and the station codes corresponding to each node point sequence. If the number of nodes of the stage plan is consistent with that of the map plan and station codes corresponding to the node sequences are completely matched, judging that the operation path of the stage plan is legal, otherwise, judging that the operation path of the stage plan is inconsistent with that of the map plan, and outputting alarm information. Although the prior art can realize validity check of the phase plan corresponding to the regular graph planning, in the practical application of the hub scheduling section, the following prominent defects exist, and the practical scheduling requirement is difficult to meet: 1. The core logic of the prior art, which lacks flexibility and cannot adapt to changing and adding the driving scene, is that 'one-to-one comparison of phase plans and drawing plans', and only phase plans with corresponding drawing plans can be processed