CN110667658B - Automatic generation method for passenger locomotive LKJ data reloading plan - Google Patents

Automatic generation method for passenger locomotive LKJ data reloading plan Download PDF

Info

Publication number
CN110667658B
CN110667658B CN201910903270.6A CN201910903270A CN110667658B CN 110667658 B CN110667658 B CN 110667658B CN 201910903270 A CN201910903270 A CN 201910903270A CN 110667658 B CN110667658 B CN 110667658B
Authority
CN
China
Prior art keywords
data
reloading
time
change point
train
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
Application number
CN201910903270.6A
Other languages
Chinese (zh)
Other versions
CN110667658A (en
Inventor
刘启龙
王磊
梁缘
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaoda Signal Technology Co Ltd
Original Assignee
Beijing Jiaoda Signal Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jiaoda Signal Technology Co Ltd filed Critical Beijing Jiaoda Signal Technology Co Ltd
Priority to CN201910903270.6A priority Critical patent/CN110667658B/en
Publication of CN110667658A publication Critical patent/CN110667658A/en
Application granted granted Critical
Publication of CN110667658B publication Critical patent/CN110667658B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B61RAILWAYS
    • B61LGUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/04Automatic systems, e.g. controlled by train; Change-over to manual control

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The method for automatically generating the LKJ data reloading plan of the passenger locomotive converts the manual arrangement of the reloading plan into the automatic arrangement of the reloading plan by the computer, and ensures that line data loaded by the LKJ is consistent with the effective condition of the current data when the LKJ passes through a data change point; the method mainly comprises the following steps: 1) determining a data change point and time; 2) arranging the train number time and the turn-back information; 3) and determining the time for reloading according to the delivery time and the data effective time. The scheme brings the following advantages: the making efficiency of the reloading plan at each time is reduced, and the reliability of the reloading plan is improved. When the road bureau determines to change the package, the method can automatically generate the package changing plan only by inputting the version of the new data, the change point in the new data and the effective time of the change point in the computer system.

Description

Automatic generation method for passenger locomotive LKJ data reloading plan
Technical Field
The invention relates to the field of LKJ data reloading management, in particular to a method for automatically generating a reloading plan when a passenger locomotive reloads LKJ data.
Background
The locomotive is a self-propelled vehicle which pulls or pushes a railway vehicle to run and does not load business load per se, and is commonly called a locomotive. A passenger locomotive is a locomotive in which a passenger mission is being undertaken. The running time of the passenger locomotive is complicated to calculate. And (3) calculating the specific reloading place and reloading time of each LKJ vehicle-mounted data according to the time of each passenger locomotive leaving the garage and the time of reaching the construction place by combining the turning back condition of the locomotive. The working efficiency is low, the problems of mistaken replacement and missed replacement are easy to occur, and the liability accidents of the passenger locomotive and the motor train unit are caused. The electric staff is difficult to change the equipment and control in the foreign warehouse. The passenger transport reloading is more, the passenger transport locomotive cannot be reloaded according to the unified time, the reloading progress is difficult to track, and the driving safety is seriously threatened.
When the LKJ data needs to be reloaded, the reloading management personnel need to search the train number passing through the changing point according to the changing point of the data, and if the train number is found to be turned back by other train numbers, the train number before turning back needs to be found, and the train number is calculated out of the warehouse in sequence; and then according to the effective time of the change point data, judging whether new data is needed when the change point is passed for the first time, namely whether reloading is needed before ex-warehouse so as to carry out reloading arrangement. The manual calculation needs to be performed for each train number, and the flow executed by each train number is shown in fig. 1.
In the above duplication calculation process, all the train numbers need to be searched, and nearly 200 passenger train numbers are owned by the railway bureau of the least call and the most extreme according to the survey; and the turning back condition of each vehicle is also required to be considered, so that the manual workload is large, errors are very easy to occur, the driving safety is influenced, and the life and property safety of passengers is caused.
Therefore, a method for automatically generating a reloading plan needs to be researched. The working efficiency of basic line data reloading personnel is improved, the labor cost is reduced, and accidents are reduced.
Disclosure of Invention
This scheme provides a new implementation scheme, aims at improving basic line data and changes outfit personnel's work efficiency, reduces the human cost, reduces the accident.
The invention provides a method for automatically generating an LKJ data reloading plan of a passenger locomotive, which converts a manually arranged reloading plan into an automatically arranged reloading plan by a computer, and ensures that line data loaded by the LKJ is consistent with the effective condition of the data at that time when the LKJ passes through a data change point;
the method mainly comprises the following steps:
1) determining a data change point and time; finding a data change point on a railway line according to the notification of the reloading task, and determining the effective time of the data;
2) arranging the train number time and the turn-back information; wherein, if the locomotive is replaced in the running process of one train number, the train number is changed into two train numbers; if two vehicle numbers exist, the vehicle number is not put in storage after the first vehicle number arrives, but is directly turned back into other vehicle numbers, the two vehicle numbers are connected in series and are treated as a vehicle;
3) determining the time for reloading according to the delivery time and the data effective time; for the train number passing through the data change point, the locomotive acting thereon needs to be divided into the passage before the data is effective and the passage after the data is effective again according to the data effective time passing through the data change point.
The scheme brings the following advantages: the making efficiency of the reloading plan at each time is reduced, and the reliability of the reloading plan is improved. When the road bureau determines to change the package, the method can automatically generate the package changing plan only by inputting the version of the new data, the change point in the new data and the effective time of the change point in the computer system.
Drawings
FIG. 1 is a prior art manual reckoning reloading planning flow
FIG. 2 is a flow chart of the method for automatically generating a reloading plan according to the invention
FIG. 3 is the core content of the station information Table of the present invention
FIG. 4 is an example of the "vehicle order table" of the present invention
FIG. 5 is an example of the "Return information Table" according to the present invention
Detailed Description
The present invention will be described in detail with reference to specific embodiments. The following examples will assist the person skilled in the art in further understanding the present implementation but are not intended to limit the invention in any way. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present solution, which falls within the scope of protection of the present solution.
The general terms and their definitions in the field of monitoring the operation of a plurality of trains referred to in the solution of the invention are given in the following glossary.
Glossary
Figure BDA0002212108560000031
The reloading plan provided by the invention mainly ensures that the line data description is changed when the railway line construction is carried out, and when LKJ is loaded with line data and passes through a construction site (namely, a data change point), the LKJ cannot be loaded with old data and pass through a construction site which is effective already, and cannot be loaded with new data and pass through a change point which is not effective yet. That is, it is ensured that the line data loaded on the LKJ matches the current (data valid) situation when the LKJ passes through the data change point.
The data change point referred to in the present invention means: the location where the description of the route data changes due to the route construction or the like. For example, the speed limit of the section after the station A is out of the station is 80Km/h, and the speed limit of the section after the station A is out of the station needs to be adjusted to 40Km/h for construction reasons. Then the "outbound zone of a" is the data change point.
The data effective time mentioned in the present invention refers to: the point in time at which the data at the data change point becomes effective. For example, if the section after the a station is out of the station starts construction at 30 am 6 am on 1 st in 2019, month 9, the data effective time is "30 am 6 am on 1 st in 2019. That is, the segment speed limit after the outbound A before the data validation time is 80Km/h, and the segment speed limit after the outbound A after the data validation time is 40 Km/h.
The ex-warehouse time mentioned in the invention refers to: the time the locomotive comes out of the garage. For example, when locomotive HXD3D-5002 is in the marshal yard and needs to be taken out of the marshal at 20 am on 1 st day on 9 months in 2019 to perform a trailer mission, then locomotive HXD3D-5002 is taken out of the marshal yard at 20 am on 1 st day on 9 months in 2019.
Fig. 2 is a flowchart of an automatic generation method of a reloading plan according to the present invention, and the following specifically describes main steps of the automatic generation method of an LKJ data reloading plan according to the present invention:
1) determining data change points and times
And finding a data change point on the railway line according to the notification of the reloading task, and determining the effective time of the good data. And arranging the station information of each route according to the route.
2) Arrangement of train number and turn-back
The form in the form of train number table is arranged according to the running condition of the passenger locomotive (namely, the route passed by each train number arranged by the transportation department, the station information of each line is arranged according to the line name) and the information such as whether the locomotive (namely, the locomotive) in charge needs to be replaced by each train number.
Finishing principle: if one train number is changed into a locomotive in the process of running, the train number is changed into two train numbers. For example, T56 times from Xian to Beijing via Zhengzhou require locomotive change at Zhengzhou station, the original T56 times are arranged into two train times, namely T56-1 and T56-2; secondly, if two vehicle numbers exist, the vehicle is not put in storage after the first vehicle number arrives, but is directly turned back into other vehicle numbers, and then the two vehicle numbers are connected in series. For example, K217 turns back to K218 directly without entering the header, and we treat K217 and K218 as one pass, i.e., K217-K218.
3) Calculation process of reloading plan (determining reloading opportunity according to warehouse-out time and data effective time)
For the locomotive which is delivered out of the warehouse after the data is valid, namely the valid time of the data is after the delivery time (for example, the valid time of the data is 30 minutes at 6 am on 1 st in 2019, month 1 and the delivery time is 30 minutes at 10 am on 1 st in 2019, month 1), when the locomotive passes through the change point, the data is necessarily valid, new data is adopted for controlling the locomotive, the data is reloaded in the delivery time, and the data is reloaded before the delivery is specified.
And secondly, for the locomotives with the data which are valid after the locomotives are delivered from the warehouse, dividing the locomotives into two types according to whether the train number in charge passes through the data change point or not, theoretically, the train number which does not pass through the change point is not influenced by the data change, but considering the convenience of management (the data versions on all the locomotives are consistent after one reloading task is finished, namely all the locomotives are reloaded), the locomotives can be reloaded before the locomotives are delivered from the warehouse.
And thirdly, for the train number passing through the data change point, the locomotive acting on the train number is divided into the passage before the data are effective and the passage after the data are effective again according to the data effective time passing through the data change point.
And fourthly, for the number of the passing trains after the data becomes effective, the locomotive in charge can be reloaded before the train is delivered out of the warehouse.
And fifthly, for the passing train number before the data becomes effective, the locomotive in charge (the reloading is not allowed when the train is delivered at this time) does not pass the reloading point again until the train is delivered again, and repeating the steps until the reloading is available.
And sixthly, for the number of trains passing by before the data becomes effective, the locomotive acting on the locomotive passes through the reloading point again (or for multiple times) before entering the garage again, if the time of passing through the reloading point for the second time (and for multiple times later) is the time of the data becoming effective, the locomotive does not have the condition of in-garage reloading (if the data is replaced before the current garage leaving, the data loaded when the locomotive passes through the data changing point for the first time does not accord with the line condition, and if the data is not replaced before the current garage leaving, the vehicle-mounted data when the locomotive passes through the data changing point for the second time does not accord with the line condition), and the on-line reloading or emergency treatment needs to be prompted.
When the road bureau determines to change the loading, the version of the new data, the change point in the new data and the effective time of the change point are only needed to be input into the computer system, and the loading change plan can be automatically generated according to the method.
Example one
Next, a method of generating an LKJ data reloading plan according to the present invention will be described by taking Z317 times from beijing to a header as an example.
1) Arranging station information
The station information of each line is arranged according to the line (line name), and the arranged format is 'station information table'. The core content of the station information table is shown in fig. 3.
2) Arranging time of train number and turn-back information
The 'train number table' and the 'return information table' are arranged according to information such as a train operation chart and whether a locomotive serving as the train number is changed.
Wherein, the 'train number table' collects all train numbers under the road bureau, a table is created for each train number, and the table content is a time point plate when the train number passes through all stations. The "train order table" is shown in FIG. 4.
The 'turning back information table' is arranged and sorted out according to the running chart of the road bureau to describe the continuing situation of each train number. The format of the "foldback information table" is shown in FIG. 5.
For example, Z317 times from beijing to the header of a packet, when the route is very expensive, the packet is sent to the header after entering the call and changing the head of the packet in the library, and then two items are described in the "reentry information table": firstly, going out of the Beijing to calling and warehousing; from calling and ex warehouse to head warehouse. For another example: when the locomotive does not enter the garage after Z183 times of calling and leaving the garage reaches the riverside station, 0Z6542 times of sending the locomotive to the head of the locomotive from the riverside is carried out again, and then two items of contents described in a turning-back information table are as follows: z183 times from calling and going out of the storeroom to the river station are folded into 0Z 542; and 0Z542 times of turning back from the river to send the head of the bag to be warehoused.
3) Reloading flow algorithm
Firstly, the train numbers are connected in series according to the warehouse entry and the warehouse exit, namely, the train numbers are arranged into one train from the warehouse exit to the warehouse entry, for example, Z183 times are directly turned back to 0Z6542 without warehousing in a river, and the system treats Z183 and 0Z6542 as one train, namely Z183-0Z 6542.
Meanwhile, the train number of multi-warehousing is divided into a plurality of train processes, for example, Z317 times sent to the packet header by Beijing, and when the train is called and warehoused (namely, the locomotive is replaced), the system divides Z317 into Z317(1) and Z17(2), wherein Z317(1) represents that the train is called and is honored from Beijing, and Z317(2) represents that the train is called and is honored from the packet header.
And secondly, dividing a plurality of sorted cars into two types of data passing before and after the data is effective according to the effective time of the changed point data for the passenger car of which the data is effective after the passenger car is taken out from the warehouse.
Calculating backwards whether the data passes through a data change point before entering a warehouse or not after the data passes through the point, and if the data passes through the point, prompting to need emergency reloading (online reloading) or special treatment; if not, no treatment is carried out.
If the data passes through the data change point before being taken out of the warehouse, emergency reloading (on-line reloading) or special treatment is required if the data passes through the data change point; if not, reloading is carried out before ex-warehouse.
And fifthly, for the passenger car with the data valid before the passenger car leaves, arranging to change the data of the passenger car before the passenger car leaves.
The scheme of the invention has the following technical advantages:
the invention converts manual arrangement of the reloading plan into automatic arrangement of the reloading plan by a computer, reduces the error probability in the complicated calculation process and improves the working efficiency.
Secondly, the method has the condition of computer operation, reduces the working intensity and liberates the manpower.
Through a large amount of verification, the probability of data mischange and data neglect change is effectively reduced, the safety of LKJ data is effectively guaranteed, and the efficiency of reloading plan arrangement is improved.
The above description is only a preferred embodiment of the present novel scheme, and is not intended to limit the scope of the present novel scheme. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the new scheme shall be included in the protection scope of the new scheme.

Claims (10)

1. An automatic generation method of an LKJ data reloading plan of a passenger locomotive is characterized in that the manual reloading plan is converted into the automatic reloading plan arranged by a computer system, and when the LKJ passes through a data change point, line data loaded by the LKJ is consistent with the effective condition of the data at that time;
the method mainly comprises the following steps:
1) determining a data change point and time; finding data change points on each railway line according to the notification of the reloading task, and determining the effective time of the data;
2) arranging the train number and the turn-back information; wherein, if the locomotive is replaced in the running process of one train number, the train number is changed into two train numbers; if two vehicle numbers exist, the vehicle number is not put in storage after the first vehicle number arrives, but is directly turned back into other vehicle numbers, the two vehicle numbers are connected in series and are treated as a vehicle;
3) determining the time for reloading according to the delivery time and the data effective time; for the train number passing through the data change point, the locomotive acting thereon needs to be divided into the passage before the data is effective and the passage after the data is effective again according to the data effective time passing through the data change point.
2. The method of claim 1, wherein step 2) is embodied as sorting out the train number table and the return information table according to the operation condition of the passenger locomotive and the information of whether each train number needs to be changed for the locomotive in charge.
3. The method according to claim 2, characterized in that the station information of each route is sorted out according to the route name; the train number table collects all train numbers under a certain road station, a table is created for each train number, and the table content is a time point board when the train number passes through all stations; the turn-back information table is arranged and sorted according to the running chart of the road bureau to describe the continuing condition of each train number.
4. The method according to claim 1 or 3, wherein the train numbers are connected in series according to the warehouse entry, namely, the train numbers are arranged into a train from the warehouse entry to the warehouse entry; meanwhile, the number of the multiple warehousing vehicle is divided into multiple vehicle processing.
5. The method according to claim 4, characterized in that for the passenger car with the data validated before the passenger car is delivered out, the data of the passenger car is arranged to be reloaded before the passenger car is delivered out.
6. The method of claim 4, wherein for the passenger car whose data is only valid after the passenger car is delivered from the warehouse, the sorted passenger cars are divided into two types of passing before the data is valid and passing after the data is valid according to the validation time of the change point data.
7. The method of claim 6, wherein for the data passed after validation, whether the data passes through a data change point before entering a warehouse is calculated backwards, and if the data passes through the data change point, an urgent reloading is prompted; if not, no treatment is carried out.
8. The method of claim 6, wherein for a pass before effect, it is calculated forward whether a data change point passes before warehouse-out, and if so, an urgent reloading is prompted; if not, then reloading is performed before ex-warehouse.
9. The method of claim 8, wherein for the number of passes before the data becomes valid, the locomotive in charge passes the reloading point again or more times before entering the garage again, and if the time of passing the reloading point for the second time and a few times later is the time after the data becomes valid, the locomotive does not have the conditions for reloading in the garage and needs to prompt on-line reloading or emergency treatment.
10. The method of claim 1, wherein when the road bureau determines to change the package, the method automatically generates a package change plan by inputting the version of the new data, the change point in the new data, and the time of the change point in effect into the computer system.
CN201910903270.6A 2019-09-24 2019-09-24 Automatic generation method for passenger locomotive LKJ data reloading plan Active CN110667658B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910903270.6A CN110667658B (en) 2019-09-24 2019-09-24 Automatic generation method for passenger locomotive LKJ data reloading plan

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910903270.6A CN110667658B (en) 2019-09-24 2019-09-24 Automatic generation method for passenger locomotive LKJ data reloading plan

Publications (2)

Publication Number Publication Date
CN110667658A CN110667658A (en) 2020-01-10
CN110667658B true CN110667658B (en) 2021-12-10

Family

ID=69077566

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910903270.6A Active CN110667658B (en) 2019-09-24 2019-09-24 Automatic generation method for passenger locomotive LKJ data reloading plan

Country Status (1)

Country Link
CN (1) CN110667658B (en)

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101739314B (en) * 2010-01-13 2013-07-10 浙江大学 Method and system for updating ground base data storage of train running monitor
KR20130102678A (en) * 2012-03-08 2013-09-23 한국전자통신연구원 Method of updating train control data using broadband wireless access system
CN104184606B (en) * 2013-12-21 2018-01-30 河南思维自动化设备股份有限公司 The data processing method that LKJ remote datas are loaded into
CN104216937B (en) * 2013-12-21 2017-09-19 河南思维自动化设备股份有限公司 The data display method that LKJ remote datas are loaded into
US10513280B2 (en) * 2015-10-20 2019-12-24 International Electronic Machines Corp. Operations monitoring for effect mitigation
CN105523063B (en) * 2015-12-18 2017-07-04 河南思维自动化设备股份有限公司 The method that one key matches controllable announcement and the LKJ basic datas of multi version
CN106428124B (en) * 2016-09-19 2018-09-25 重庆微标科技股份有限公司 A kind of monitoring method that changes the outfit of railway locomotive vehicle-mounted data, apparatus and system
CN110203259B (en) * 2019-05-16 2021-11-19 卡斯柯信号有限公司 CTC route control method for automatic turn-back operation of inter-city railway

Also Published As

Publication number Publication date
CN110667658A (en) 2020-01-10

Similar Documents

Publication Publication Date Title
JP4812821B2 (en) Train speed control device
CN109754326A (en) A kind of fender-bender assists the method and system of quick setting loss
EP2532563A2 (en) Method for calculating a driving recommendation
CN111291303A (en) Electric bus scheduling optimization method considering heterogeneity of shift
CN113928342B (en) Train operation method based on virtual marshalling, electronic device and storage medium
Shramenko Evaluation of the effectiveness of piggyback traffic in the context of creating transport and logistics clusters.
CN110667658B (en) Automatic generation method for passenger locomotive LKJ data reloading plan
CN111152818B (en) Operation diagram stage plan logic checking method
Pagenkopf et al. Potentials of alternative propulsion systems for railway vehicles—A techno-economic evaluation
CN112487254B (en) Train control code sequence generation method based on train route characteristic presetting
CN115649241A (en) Railway wagon running mileage calculation method and system based on train running line
JP3443792B2 (en) Digital automatic train control device
De-Los-Santos et al. Simultaneous frequency and capacity setting in uncapacitated metro lines in presence of a competing mode
CN115593471A (en) Method and device for optimizing operation scheme of rail transit virtual marshalling train
Zushi Driverless vehicles: Opportunity for further greenhouse gas emission reductions
Bonnafous et al. Transport energy and emissions: rail
Mwila et al. Framework for attracting traffic back to the railways in Zambia
Tercan Second-hand renovated trams as a novel decision strategy for public transport investment
US20210095983A1 (en) Method and system for reducing the environmental pollution due to a transport route
ZARĘBSKA et al. ECO-INNOVATIVE SOLUTIONS IN THE OPERATION OF MUNICIPAL TRANSPORT COMPANY SP. Z OO IN ZIELONA GÓRA
Roper Economy Drive
CN113562024A (en) Train jump stop control system and method
Roth Low-Carbon Transport Policies for Ukraine
Böhnen et al. Effects of Central or Decentralized Charging Stations for Electric Buses on Route Planning and Travel Time in Public Transport–A Case Study of Aachen, Germany
Beychok et al. Share a Ride to the Train Station Using a Demand-Responsive Feeder Service

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