CN117719576A - Train rescue method for positive line parking application - Google Patents
Train rescue method for positive line parking application Download PDFInfo
- Publication number
- CN117719576A CN117719576A CN202311675966.0A CN202311675966A CN117719576A CN 117719576 A CN117719576 A CN 117719576A CN 202311675966 A CN202311675966 A CN 202311675966A CN 117719576 A CN117719576 A CN 117719576A
- Authority
- CN
- China
- Prior art keywords
- train
- fault
- line
- information
- participate
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000012423 maintenance Methods 0.000 claims abstract description 33
- 238000004364 calculation method Methods 0.000 claims description 53
- 239000003016 pheromone Substances 0.000 claims description 42
- 238000004458 analytical method Methods 0.000 claims description 3
- 238000010845 search algorithm Methods 0.000 claims description 2
- 238000012790 confirmation Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 6
- 230000003203 everyday effect Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000007257 malfunction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
Landscapes
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention relates to a train rescue method for positive line parking application, and belongs to the field of rail transit. The invention respectively communicates with the ATS system and the intelligent operation and maintenance system to obtain the data, calculates the optimal path in the train rescue scheme by adopting an ant colony algorithm to obtain the rescue scheme, pushes the rescue scheme to a driving dispatcher server terminal (driving dispatching), and sends the driving dispatching confirmation to the ATS to execute the rescue scheme. In the invention, an IDS system recommends an optimal rescue scheme by adopting an ant colony algorithm through the basic information of a line and data acquired from a signal ATS system and an intelligent operation and maintenance system; the multi-system linkage cooperation comprehensively considers multiparty factors, the rescue progress of the fault train is effectively propelled in real time, the line resources are fully utilized, and meanwhile, the optimal scheme is achieved, so that the normal operation of the line according to a plan is prevented from being influenced.
Description
Technical Field
The invention belongs to the field of rail transit, and particularly relates to a train rescue method for positive line parking application.
Background
With the research of the general technology of the front line parking in urban rail transit, in the front line parking scene, when the line starts to operate every day, the trains parked in the front line area may malfunction. According to the method, the rescue scheme after the train faults can be intelligently recommended by using the ant colony algorithm according to the line basic information and the comprehensive linkage cooperation with the signal system ATS and the intelligent operation and maintenance system, so that the requirement of fully utilizing line resources to quickly respond to train rescue is met.
In order to respond to the reduction of the special parking lot for the train in the ' intelligent urban rail transit development schema of the urban rail transit of China ' issued by the rail transit society, the occupation requirement of the land is reduced, the use efficiency of the train is improved, the energy consumption is reduced, and the ' general technical guidelines for the front line parking of the rail transit of Tianjin city ' issued by the Tianjin urban rail transit group '. In a positive parking scene in a positive parking general technical research, when a line starts to operate every day, a train parked in a positive area may malfunction, and quick response rescue is required. In the general technology of front line parking, the signal system realizes the development of an intelligent transportation decision system, namely IDS for short, which is a comprehensive integrated platform and is communicated with an ATS system and an intelligent operation and maintenance system, thereby realizing linkage cooperation. The IDS is in communication interaction with the ATS to acquire a line operation schedule and line length train route data information; the IDS is communicated with the intelligent operation and maintenance system to acquire train information and train fault information; in addition, the IDS system also comprises the information of the line positive stop position and the line station, and the information of the ATS destination address data in the line.
In the front line parking scene, the line starts to operate every day, and a train parked in a front line area needs to participate in operation or travel to an area (a parking line and a foldback line) which does not influence the front line operation, and the train may fail. Under the condition of faults, the train operation scheduling personnel collect the train information of the line, consult the train operation time schedule and analyze the train information manually to finally obtain the train rescue scheme.
In a front-line parking scene, a driving dispatcher analyzes a train rescue scheme according to faults and other data, line information obtained in a short time is relatively less, and if the rescue scheme is analyzed by collecting various data for a long time, the purposes of quick rescue and efficient operation of urban rail transit cannot be achieved.
In a positive line parking scene, the invention acquires relevant train information through linkage cooperation with the ATS of the subway signal system and the intelligent operation and maintenance system, and intelligently analyzes the fault recommended rescue scheme by combining with line basic data. The rescue progress of the fault train is efficiently advanced, the optimal rescue scheme is achieved by utilizing the line resources, and finally the line can be rapidly and normally operated according to the original time.
Disclosure of Invention
First, the technical problem to be solved
The invention aims to solve the technical problem of how to provide a train rescue method for the forward parking application so as to solve the train rescue problem under the condition that the forward parking scene fails.
(II) technical scheme
In order to solve the technical problems, the invention provides a method for acquiring a path by adopting an ant colony algorithm, which comprises the following steps:
s11, using destination address information between two stations and line ATS destination address data, and a grid path is an initial map of n; after the path is rasterized, each destination address can be represented by the coordinates of a point in a rasterized coordinate system, so that subsequent algorithm analysis in the coordinate system is facilitated, and each calculation factor in the algorithm is an independent calculation individual;
s12, placing all calculation factors at a starting point, retrieving and acquiring a destination address information list to which each calculation factor is to be sent according to the current position of the calculation factor, determining the probability P of selecting a destination address through a pheromone factor, a heuristic function factor and the number of connected destination addresses, determining the destination address to be sent through a roulette method, finally, enabling all calculation factors to reach a target destination point, and completing one algorithm iteration; iteration number +1;
wherein k represents each calculation factor individual number, i and j represent destination address number, P ij k Representing the probability of the calculation factor k going from i to j address, alpha representing the pheromone factor, beta representing the heuristic function factor, tau representing the relative importance of the heuristic function, eta representing the heuristic function, allowed k Indicating the allowed destination, t is time information;
s13, calculating paths of all calculation factors, and obtaining a shortest path and an average path thereof; calculating through an ant week model, wherein the model uses global information, namely, after one path circulation is completed, a calculation factor releases a pheromone factor; calculating to obtain the content of the newly increased pheromone of the path calculation factors among the destination addresses, and obtaining the content of the pheromone on each path among the destinations in the next iteration according to the original pheromone concentration (1-pheromone volatilization factor) +newly increased pheromone;
τ ij (t+n)＝(1-ρ)·τ ij (t)+Δτ ij
where τ represents the pheromone concentration, ρ represents the pheromone volatilization factor, m represents the total number of calculation factors, i and j represent the destination address number, Δτ represents the varying pheromone concentration, Q represents the pheromone constant, L k Calculating the length of the path which the factor k passes through in the calculation;
s14, judging whether the iteration times are equal to the maximum iteration times, if so, carrying out the next iteration, and if so, terminating the iteration;
s15, comparing all paths from the starting point to the end point according to the recorded data to obtain the path with the shortest corresponding length.
The invention also provides a train rescue method for the positive line parking application, which comprises the following steps:
s201, starting operation of a positive line parking scene line, wherein an IDS system receives train fault alarm information sent by an intelligent operation and maintenance system, and rescue scheme recommendation is required;
s202, the IDS system comprehensively judges through the collected information: judging whether the fault train can continue to participate in line operation or not according to the train fault grade and the fault description information in the train fault information; judging whether the train operation is influenced by train fault position information in the train fault information and whether the traction or braking capability is lost or not; when other train positive line operation is influenced, the fault train is indicated to be parked at the position of the positive line platform, and the fault train can participate in the operation on the same day in the original operation plan; based on the judgment information, selecting the following steps:
the operation of other trains is not influenced, the fault level of the fault train is low, the train can continue to participate in the operation of the line, and the step S203 is entered;
affecting other train positive line operation, wherein the fault train has low fault level, and the train can continue to participate in line operation, and enter step S206;
affecting the operation of other trains, wherein the failure level of the failed train is high, the failed train cannot continue to participate in the operation, the traction and braking capability is not lost, and the step S208 is entered;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is not lost, and the step S209 is entered;
affecting the operation of other trains, wherein the failure level of the failed train is high, the failed train cannot continue to participate in the operation, and the traction and braking capability is lost, and the step S213 is entered;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is lost, and the step S214 is entered;
s203, other train positive line operation is not influenced, the fault level of the train is low, and the train can continuously participate in line operation: judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if not, entering step S204; participate in the operation on the same day, go to step S205;
s204, if the fault train does not participate in the operation on the same day, the fault train is directly parked at the current position temporarily, and after the operation is finished, the fault train returns to the field section for maintenance operation; step S207 is entered;
s205, according to a line operation plan, the fault train continues to participate in line operation, and after operation is finished, the fault train returns to a field section for maintenance operation; the IDS system algorithm recommends the departure time and the route to the departure section of the fault train according to the operation schedule, the route station information, the route information of the long-route train and the route address of the reachable destination of the route ATS; step S218 is entered;
s206, affecting other train positive line operation, wherein the train fault level is low, and the train can continuously participate in line operation: according to the line operation plan, the fault train continues to participate in the line operation, and after the operation is finished, the fault train returns to the field section for maintenance operation; step S207 is entered;
s207, after operation is finished, the fault train goes to the field section for maintenance operation; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original plan on the same day, the planning table is not required to be corrected; step S218 is entered;
s208, other train positive line operation is affected, and the fault train has high fault grade and cannot continue to participate in operation, and the traction and braking capability is not lost: the fault train needs to go to a parking line which does not influence the operation of other train main lines to temporarily park; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally analyzes the optimal train storage line position and path through the algorithm; the fault train is temporarily parked at the train storage line position according to the optimal path; step S211 is entered;
s209, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train is high, so that the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is not lost: then directly and temporarily parking at the current position; step S210 is entered;
s210, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S211; not participating in the operation on the same day, and entering step S212;
s211, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S212 is entered;
s212, temporarily parking a fault train storage line; after the operation is finished, the IDS system sequentially performs path calculation through the ant colony algorithm by using the line operation schedule information and the line station information, adopting the ant colony algorithm, taking the position of the fault train as a starting point and taking the field section as an end point, and finally analyzing an optimal path by using the algorithm; returning the fault train to the field section for maintenance operation; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original plan on the same day, the planning table is not required to be corrected; step S218 is entered;
s213, affecting the operation of other train positive lines, wherein the fault level of the fault train is high, the fault train cannot continuously participate in the operation, the traction and braking capability is lost, and the fault train needs other rescue vehicles to be connected and go to the parking line which does not affect the operation of other train positive lines for temporary parking; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally compares and selects the optimal train storage line position; rescue trains are arranged to be connected with fault trains to go to a train storage line according to an optimal path, and the rescue trains are operated according to an operation plan; step S216 is entered;
s214, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is lost: then directly and temporarily parking at the current position; step S215 is entered;
s215, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S216; not participating in the operation on the same day, and entering step S217;
s216, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S217;
s217, temporarily parking a fault train storage line; after the operation is finished, the IDS system acquires the train of the operation finishing station returning section through the line operation schedule information and the line station information, finally screens the rescue train according to the operation finishing time and the operation mileage of the train, and after the operation is finished, the rescue train is parked at the corresponding position of the station section according to the schedule by going to the station returning section of the line-of-storage continuous-hanging fault train;
and S218, pushing the final rescue scheme to a driving dispatcher, and transmitting the rescue information to the ATS to execute the rescue scheme after checking and confirming.
(III) beneficial effects
The invention provides a train rescue method for positive line parking application, wherein an IDS system recommends an optimal rescue scheme by adopting an ant colony algorithm through basic information of a line and data acquired from a signal ATS system and an intelligent operation and maintenance system; the multi-system linkage cooperation comprehensively considers multiparty factors, the rescue progress of the fault train is effectively propelled in real time, the line resources are fully utilized, and meanwhile, the optimal scheme is achieved, so that the normal operation of the line according to a plan is prevented from being influenced.
Drawings
Fig. 1 is a flowchart of an ant colony algorithm of the present invention;
fig. 2 is an overall flow chart of the present invention.
Detailed Description
To make the objects, contents and advantages of the present invention more apparent, the following detailed description of the present invention will be given with reference to the accompanying drawings and examples.
In the general technology of front line parking, the signal system realizes the development of an intelligent transportation decision system, namely IDS for short, which is a comprehensive integrated platform and is communicated with an ATS system and an intelligent operation and maintenance system, thereby realizing linkage cooperation. The IDS is in communication interaction with the ATS to acquire a line operation schedule and line length train route data information; the IDS is communicated with the intelligent operation and maintenance system to acquire train information and train fault information; in addition, the IDS system also comprises the information of the line positive stop position, the line station information and the line ATS destination address data information. In the front line parking scene, the line starts to operate every day, and a train parked in a front line area needs to participate in operation or travel to an area (a parking line and a foldback line) which does not influence the front line operation, and the train may fail. The invention mainly obtains the data through respectively communicating with an ATS system and an intelligent operation and maintenance system, calculates the optimal path in the train rescue scheme by adopting an ant colony algorithm to obtain the rescue scheme, pushes the rescue scheme to a driving dispatcher server terminal (driving dispatching), and sends the driving dispatching confirmation to the ATS to execute the rescue scheme.
The line operation schedule information includes: operation date, train set number, operation schedule number, operation train number, and parking position after operation is finished;
the above-mentioned long train route information (combined route of train route, see below for details) includes: route name, route direction, route start point destination address name, route end point destination address name, route length;
the train information data includes: train number, train parking position, train operation mileage, train type (operation, preparation, maintenance);
the train fault information includes: train group number, train position, train fault classification and train fault description;
the line positive parking point information includes: parking spot coding, parking spot name, belonged station name, parking spot type (positive line, parking line, foldback line, field section);
the above-mentioned route station information includes: station name, up-driving station name, down-driving station name, up-driving station distance, down-driving station distance, whether near field section;
the line ATS destination address data includes: destination address name, destination address code, station, belonging uplink and downlink, adjacent uplink destination address name 1, adjacent uplink destination address name 2, adjacent downlink destination address name 1, adjacent downlink destination address name 2;
the long train route information of the line is long train route data information which is obtained by superposing a search priority strategy on the basis of a DFS (depth first traversal search) search algorithm according to the characteristics of the line station, taking the ATS destination of an operation mark as a long train route and searching. Wherein the search priority policy comprises: when the parallel paths can reach the same path point, the branch paths closer to the turning direction of the searching terminal take precedence; when the route of the long train passes through the inflection point, the route comprises the advancing direction which is the same as the trend of the target destination and is preferentially searched when the type of the crossover turnout is preferential and the crossover turnout passes through the inflection point; and judging whether the inflection point is searched in the straight direction or the lateral direction by searching the priority mark Searchpriority.
The method for acquiring the path by adopting the ant colony algorithm is described as follows:
the algorithm is characterized in that: the destination address names of the starting point and the destination address names of the ending point are passed, stations where the corresponding two destination addresses are located are searched, all destination address information between the two stations is searched, and the stations are briefly ordered according to the corresponding sequence;
s11, the grid path is an initial map of n by using destination address information between two stations and line ATS destination address data. After the path is rasterized, each destination address can be represented by coordinates of points in a rasterized coordinate system, so that subsequent algorithm analysis in the coordinate system is facilitated, each calculation factor in the algorithm is an independent calculation individual, and the number of calculation factors is set according to the number of destination addresses between two stations.
S12, placing all calculation factors at a starting point, retrieving and acquiring a destination address information list to be forwarded by each calculation factor according to the current position of the calculation factor, determining the probability P (formula is as follows) of selecting a destination address by using a pheromone factor, a heuristic function factor and the number of connected destination addresses, determining the forwarding destination address by using a roulette method (a proportion selection method), and finally, enabling all calculation factors to reach a target destination point to finish one algorithm iteration; iteration number +1;
wherein k represents each calculation factor individual number, i and j represent destination address number, P ij k Representing the probability of the calculation factor k going from i to j address, alpha representing the pheromone factor, beta representing the heuristic function factor, tau representing the relative importance of the heuristic function, eta representing the heuristic function, allowed k The permitted destination, t, is time information.
S13, calculating paths of all calculation factors, and obtaining the shortest path and the average path. The ant week model is calculated by using global information, namely, the calculated factors release the pheromone factors after one path circulation is completed. And calculating to obtain the content of the newly increased pheromone of the path calculation factors among the destination addresses, and obtaining the content of the pheromone on each path among the destinations in the next iteration according to the original pheromone concentration (1-pheromone volatilization factor) +newly increased pheromone (formula is shown as follows).
τ ij (t+n)＝(1-ρ)·τ ij (t)+Δτ ij
Where τ represents the pheromone concentration, ρ represents the pheromone volatilization factor, m represents the total number of calculation factors, i and j represent the destination address number, Δτ represents the varying pheromone concentration, Q represents the pheromone constant, L k Is the length of the path travelled by the calculation factor k in this calculation.
S14, judging whether the iteration times are equal to the maximum iteration times, if so, carrying out the next iteration, and if so, terminating the iteration;
s15, comparing all paths from the starting point to the end point according to the recorded data to obtain the path with the shortest corresponding length.
Through a large number of algorithm calculation experiments, some basic parameters in the algorithm are set as follows, and the optimal result is obtained to meet the requirements more quickly. The pheromone constant Q is set to 10 times the number of destination addresses, the maximum number of iterations is set to 5 times the number of destination addresses (calculated as 100 when less than 100 and 200 when more than 200), the pheromone factor α is set to 2, the heuristic function factor β is set to 3, and the pheromone volatilization factor ρ is set to 0.2.
The train rescue method for the positive line parking application comprises the following steps:
s201, starting operation of a positive line parking scene line, wherein an IDS system receives train fault alarm information sent by an intelligent operation and maintenance system, and rescue scheme recommendation is required;
s202, the IDS system comprehensively judges through the collected information: judging whether the fault train can continue to participate in line operation or not according to the train fault grade and the fault description information in the train fault information; judging whether the train operation is influenced by train fault position information in the train fault information and whether the traction or braking capability is lost or not; when other train positive line operation is influenced, the fault train is indicated to be parked at the position of the positive line platform, and the fault train can participate in the operation on the same day in the original operation plan; based on the judgment information, selecting the following steps:
the operation of other trains is not influenced, the fault level of the fault train is low, the train can continue to participate in the operation of the line, and the step S203 is entered;
affecting other train positive line operation (the fault train is originally planned to participate in operation), wherein the fault level of the fault train is low, and the train can continue to participate in line operation, and the step S206 is entered;
affecting the operation of other trains (the faulty train is originally planned to participate in the operation), and entering step S208, wherein the faulty train has high fault grade and cannot continue to participate in the operation without losing the traction and braking capability;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is not lost, and the step S209 is entered;
affecting the operation of other trains (the faulty train is originally planned to participate in the operation), and the faulty train cannot continue to participate in the operation with high fault level and loses the traction and braking capability, and the step S213 is entered;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is lost, and the step S214 is entered;
s203, other train positive line operation is not influenced, the fault level of the train is low, and the train can continuously participate in line operation: judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if not, entering step S204; participate in the operation on the same day, go to step S205;
s204, if the fault train does not participate in the operation on the same day, the fault train is directly parked at the current position temporarily, and after the operation is finished, the fault train returns to the field section to carry out maintenance operation. Step S207 is entered;
s205, according to the line operation plan, the fault train continues to participate in the line operation, and after the operation is finished, the fault train returns to the field section for maintenance operation. The IDS system algorithm recommends the departure time and the route to the field section of the fault train according to the operation schedule, the route station information, the route information of the long-route train and the reachable destination address of the route ATS. Step S218 is entered;
s206, affecting other train positive line operation (the fault train is originally planned to participate in operation), wherein the fault level of the train is low, and the train can continue to participate in line operation: according to the line operation plan, the fault train continues to participate in the line operation, and after the operation is finished, the fault train returns to the field section for maintenance operation. Step S207 is entered;
and S207, after the operation is finished, the fault train goes to the field section for maintenance operation. The IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original planning on the same day, the planning table does not need to be corrected. Step S218 is entered;
s208, other train positive line operation is affected (the fault train is originally planned to participate in operation), the fault grade of the fault train is high, the fault grade cannot continue to participate in operation, and the traction and braking capability is not lost: the fault train needs to go to a position (a parking line and the like) which does not influence the operation of other train main lines for temporary parking; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally analyzes the optimal train storage line position and path through the algorithm; the fault train is temporarily parked at the train storage line position according to the optimal path; step S211 is entered;
s209, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train is high, so that the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is not lost: then it is parked in the current location temporarily (without affecting other trainline operations); step S210 is entered;
s210, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S211; not participating in the operation on the same day, and entering step S212;
s211, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S212 is entered;
s212, temporarily parking the fault train storage line. After the operation is finished, the IDS system sequentially performs path calculation through the ant colony algorithm by using the line operation schedule information and the line station information, adopting the ant colony algorithm, taking the position of the fault train as a starting point and taking the field section as an end point, and finally analyzing an optimal path by using the algorithm; returning the fault train to the field section for maintenance operation; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original planning on the same day, the planning table does not need to be corrected. Step S218 is entered;
s213, affecting the operation of other train positive lines (the fault train is originally planned to participate in the operation), wherein the fault level of the fault train is high, the fault train cannot continue to participate in the operation, the traction and braking capability is lost, and the fault train needs other rescue vehicles to be connected and go to a position (a train storage line and the like) which does not affect the operation of other train positive lines for temporary parking; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally compares and selects the optimal train storage line position; rescue trains are arranged to be connected with fault trains to go to a train storage line according to an optimal path, and the rescue trains are operated according to an operation plan; step S216 is entered;
s214, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is lost: then it is parked in the current location temporarily (without affecting other trainline operations); step S215 is entered;
s215, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S216; not participating in the operation on the same day, and entering step S217;
s216, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S217;
s217, temporarily parking the fault train storage line. After the operation is finished, the IDS system acquires the train of the operation finishing return section through the line operation schedule information and the line station information, finally screens the rescue train according to the operation finishing time and the operation mileage (the finishing time is later and the mileage is smaller) of the train, and after the operation is finished, the rescue train is parked at the corresponding position of the return section according to the schedule by going to the storage line and connecting the fault train to the return section for maintenance operation. The method comprises the steps that an ant colony algorithm is adopted for a path from a fault train position to a field section, the fault train position is taken as a starting point, the field section is taken as an end point, path calculation is sequentially carried out through the ant colony algorithm, and an optimal path is finally analyzed through the algorithm; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original planning on the same day, the planning table does not need to be corrected. Step S218 is entered;
and S218, pushing the final rescue scheme to a driving dispatcher, and transmitting the rescue information to the ATS to execute the rescue scheme after checking and confirming.
The key of the invention is as follows:
1. a fault rescue method for a positive line parking train in a positive line parking general technology;
2. the IDS, the ATS and the intelligent operation and maintenance comprehensive cooperation, the IDS system intelligent recommendation and the ATS execute an automatic rescue scheme;
3. a method for comprehensively judging a rescue mode of a fault car through a fault grade, a fault position and a line parking train in a positive line parking technology;
4. the signal ATS system performs long train route searching based on a DFS searching algorithm and optimization and a superposition searching priority strategy;
5. calculating and analyzing a rescue path of a fault train in the front line parking technology based on an ant colony algorithm;
6. and establishing basic parameters of an ant colony algorithm through the route data of the long-route train, the route ATS destination address information and the route station information.
In the invention, an IDS system recommends an optimal rescue scheme by adopting an ant colony algorithm through the basic information of a line and data acquired from a signal ATS system and an intelligent operation and maintenance system; the multi-system linkage cooperation comprehensively considers multiparty factors, the rescue progress of the fault train is effectively propelled in real time, the line resources are fully utilized, and meanwhile, the optimal scheme is achieved, so that the normal operation of the line according to a plan is prevented from being influenced.
The foregoing is merely a preferred embodiment of the present invention, and it should be noted that modifications and variations could be made by those skilled in the art without departing from the technical principles of the present invention, and such modifications and variations should also be regarded as being within the scope of the invention.
Claims (10)
1. A method for acquiring a path by adopting an ant colony algorithm, the method comprising the following steps:
s11, using destination address information between two stations and line ATS destination address data, and a grid path is an initial map of n; after the path is rasterized, each destination address can be represented by the coordinates of a point in a rasterized coordinate system, so that subsequent algorithm analysis in the coordinate system is facilitated, and each calculation factor in the algorithm is an independent calculation individual;
s12, placing all calculation factors at a starting point, retrieving and acquiring a destination address information list to which each calculation factor is to be sent according to the current position of the calculation factor, determining the probability P of selecting a destination address through a pheromone factor, a heuristic function factor and the number of connected destination addresses, determining the destination address to be sent through a roulette method, finally, enabling all calculation factors to reach a target destination point, and completing one algorithm iteration; iteration number +1;
wherein k represents each calculation factor individual number, i and j represent destination address number, P ij k Representing the probability of the calculation factor k going from i to j address, alpha representing the pheromone factor, beta representing the heuristic function factor, tau representing the relative importance of the heuristic function, eta representing the heuristic function, allowed k Indicating the allowed destination, t is time information;
s13, calculating paths of all calculation factors, and obtaining a shortest path and an average path thereof; calculating through an ant week model, wherein the model uses global information, namely, after one path circulation is completed, a calculation factor releases a pheromone factor; calculating to obtain the content of the newly increased pheromone of the path calculation factors among the destination addresses, and obtaining the content of the pheromone on each path among the destinations in the next iteration according to the original pheromone concentration (1-pheromone volatilization factor) +newly increased pheromone;
τ ij (t+n)＝(1-ρ)·τ ij (t)+Δτ ij
where τ represents the pheromone concentration, ρ represents the pheromone volatilization factor, m represents the total number of calculation factors, i and j represent the destination address number, Δτ represents the varying pheromone concentration, Q represents the pheromone constant, L k Calculating the length of the path which the factor k passes through in the calculation;
s14, judging whether the iteration times are equal to the maximum iteration times, if so, carrying out the next iteration, and if so, terminating the iteration;
s15, comparing all paths from the starting point to the end point according to the recorded data to obtain the path with the shortest corresponding length.
2. The method for acquiring a path using an ant colony algorithm according to claim 1, wherein in S11, the calculation factor number is set according to the number of destination addresses between two stations.
3. The train rescue method for positive stop application according to claim 1, wherein before S11, the destination address names of the start point and the destination address names of the end point are acquired, stations where the corresponding two destination addresses are located are retrieved, all destination address information between the two stations is retrieved, and the train rescue method is briefly ordered according to the corresponding order.
4. The method for acquiring a path using an ant colony algorithm according to claim 1, wherein the pheromone constant Q is set to 10, the maximum number of iterations is set to 5, the pheromone factor α is set to 2, the heuristic function factor β is set to 3, and the pheromone volatilization factor ρ is set to 0.2.
5. The method for acquiring a path using an ant colony algorithm according to claim 4, wherein the maximum number of iterations is calculated as 100 when less than 100 and as 200 when more than 200.
6. Train rescue method for positive stop applications based on the method according to any of the claims 1-5, characterized in that it comprises the following steps:
s201, starting operation of a positive line parking scene line, wherein an IDS system receives train fault alarm information sent by an intelligent operation and maintenance system, and rescue scheme recommendation is required;
s202, the IDS system comprehensively judges through the collected information: judging whether the fault train can continue to participate in line operation or not according to the train fault grade and the fault description information in the train fault information; judging whether the train operation is influenced by train fault position information in the train fault information and whether the traction or braking capability is lost or not; when other train positive line operation is influenced, the fault train is indicated to be parked at the position of the positive line platform, and the fault train can participate in the operation on the same day in the original operation plan; based on the judgment information, selecting the following steps:
the operation of other trains is not influenced, the fault level of the fault train is low, the train can continue to participate in the operation of the line, and the step S203 is entered;
affecting other train positive line operation, wherein the fault train has low fault level, and the train can continue to participate in line operation, and enter step S206;
affecting the operation of other trains, wherein the failure level of the failed train is high, the failed train cannot continue to participate in the operation, the traction and braking capability is not lost, and the step S208 is entered;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is not lost, and the step S209 is entered;
affecting the operation of other trains, wherein the failure level of the failed train is high, the failed train cannot continue to participate in the operation, and the traction and braking capability is lost, and the step S213 is entered;
the operation of other trains is not influenced, the fault grade of the fault train is high, the fault grade cannot continue to participate in the operation, the traction and braking capability is lost, and the step S214 is entered;
s203, other train positive line operation is not influenced, the fault level of the train is low, and the train can continuously participate in line operation: judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if not, entering step S204; participate in the operation on the same day, go to step S205;
s204, if the fault train does not participate in the operation on the same day, the fault train is directly parked at the current position temporarily, and after the operation is finished, the fault train returns to the field section for maintenance operation; step S207 is entered;
s205, according to a line operation plan, the fault train continues to participate in line operation, and after operation is finished, the fault train returns to a field section for maintenance operation; the IDS system algorithm recommends the departure time and the route to the departure section of the fault train according to the operation schedule, the route station information, the route information of the long-route train and the route address of the reachable destination of the route ATS; step S218 is entered;
s206, affecting other train positive line operation, wherein the train fault level is low, and the train can continuously participate in line operation: according to the line operation plan, the fault train continues to participate in the line operation, and after the operation is finished, the fault train returns to the field section for maintenance operation; step S207 is entered;
s207, after operation is finished, the fault train goes to the field section for maintenance operation; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original plan on the same day, the planning table is not required to be corrected; step S218 is entered;
s208, other train positive line operation is affected, and the fault train has high fault grade and cannot continue to participate in operation, and the traction and braking capability is not lost: the fault train needs to go to a parking line which does not influence the operation of other train main lines to temporarily park; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally analyzes the optimal train storage line position and path through the algorithm; the fault train is temporarily parked at the train storage line position according to the optimal path; step S211 is entered;
s209, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train is high, so that the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is not lost: then directly and temporarily parking at the current position; step S210 is entered;
s210, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S211; not participating in the operation on the same day, and entering step S212;
s211, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S212 is entered;
s212, temporarily parking a fault train storage line; after the operation is finished, the IDS system sequentially performs path calculation through the ant colony algorithm by using the line operation schedule information and the line station information, adopting the ant colony algorithm, taking the position of the fault train as a starting point and taking the field section as an end point, and finally analyzing an optimal path by using the algorithm; returning the fault train to the field section for maintenance operation; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original plan on the same day, the planning table is not required to be corrected; step S218 is entered;
s213, affecting the operation of other train positive lines, wherein the fault level of the fault train is high, the fault train cannot continuously participate in the operation, the traction and braking capability is lost, and the fault train needs other rescue vehicles to be connected and go to the parking line which does not affect the operation of other train positive lines for temporary parking; the IDS system uses the data of train information, line station information, line long train route information and line ATS reachable destination address, adopts the ant colony algorithm, uses the fault train position as a starting point and uses the train storage lines of the left and right adjacent three stations as end points, sequentially carries out line calculation through the ant colony algorithm, and finally compares and selects the optimal train storage line position; rescue trains are arranged to be connected with fault trains to go to a train storage line according to an optimal path, and the rescue trains are operated according to an operation plan; step S216 is entered;
s214, the current position of the fault train does not influence the operation of other train positive lines, and the fault grade of the fault train cannot continue to participate in the operation, and under the condition that the traction and braking capacity is lost: then directly and temporarily parking at the current position; step S215 is entered;
s215, temporarily parking the fault train on a train storage line, judging whether the fault train participates in the operation on the same day or not through a line operation plan, and if so, entering step S216; not participating in the operation on the same day, and entering step S217;
s216, the fault train is originally planned to participate in the operation on the same day, the IDS system screens out a standby train according to the mileage and position information of the train and the line operation plan information, and the standby train is replaced for continuous operation of the fault train; step S217;
s217, temporarily parking a fault train storage line; after the operation is finished, the IDS system acquires the train of the operation finishing station returning section through the line operation schedule information and the line station information, finally screens the rescue train according to the operation finishing time and the operation mileage of the train, and after the operation is finished, the rescue train is parked at the corresponding position of the station section according to the schedule by going to the station returning section of the line-of-storage continuous-hanging fault train;
and S218, pushing the final rescue scheme to a driving dispatcher, and transmitting the rescue information to the ATS to execute the rescue scheme after checking and confirming.
7. The train rescue method for positive line parking application as claimed in claim 6, wherein the IDS and the ATS communicate with each other to obtain the line operation schedule and the long line train route data information; the IDS is communicated with the intelligent operation and maintenance system to acquire train information and train fault information; in addition, the IDS system also comprises the information of the line positive stop position, the line station information and the line ATS destination address data information.
8. The train rescue method for positive line parking application as claimed in claim 6, wherein the long train route information is long train route data information which is searched for by superimposing a search priority strategy on the basis of a depth-first traversal search DFS search algorithm for the characteristics of the line yard so as to operate the marked ATS destination as a long train route.
9. The train rescue method for positive line parking applications of claim 7, wherein searching for a priority policy comprises: when the parallel paths can reach the same path point, the branch paths closer to the turning direction of the searching terminal take precedence; when the route of the long train passes through the inflection point, the route comprises the advancing direction which is the same as the trend of the target destination and is preferentially searched when the type of the crossover turnout is preferential and the crossover turnout passes through the inflection point; and judging whether the inflection point is searched in the straight direction or the lateral direction by searching the priority mark Searchpriority.
10. The train rescue method for positive line parking application according to claim 6, wherein in S217, an ant colony algorithm is adopted for a path from the position of the failed train to the field section, the position of the failed train is taken as a starting point, the field section is taken as an end point, path calculation is sequentially carried out through the ant colony algorithm, and an optimal path is analyzed by the final algorithm; the IDS system searches the line operation plan, if the fault vehicle is parked in the positive line after finishing the original plan on the same day, the system corrects the operation plan table, and the vehicle is changed into a parking field section after finishing; if the fault vehicle returns to the field section after finishing the original plan on the same day, the planning table is not required to be corrected; step S218 is entered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311675966.0A CN117719576A (en) | 2023-12-07 | 2023-12-07 | Train rescue method for positive line parking application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311675966.0A CN117719576A (en) | 2023-12-07 | 2023-12-07 | Train rescue method for positive line parking application |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117719576A true CN117719576A (en) | 2024-03-19 |
Family
ID=90202759
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311675966.0A Pending CN117719576A (en) | 2023-12-07 | 2023-12-07 | Train rescue method for positive line parking application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117719576A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001278052A (en) * | 2000-03-31 | 2001-10-10 | Kawasaki Heavy Ind Ltd | Train planned schedule preparation method and preparation support device |
| CN112706803A (en) * | 2021-01-07 | 2021-04-27 | 北京交通大学 | Automatic subway train rescue adjusting method and system |
| CN113415324A (en) * | 2021-08-03 | 2021-09-21 | 东北大学 | Dynamic scheduling and operation control collaborative optimization method and system for high-speed train |
| CN116424393A (en) * | 2022-01-04 | 2023-07-14 | 北京全路通信信号研究设计院集团有限公司 | Rescue method and device for fault train and storage medium |
| CN116432843A (en) * | 2023-04-12 | 2023-07-14 | 北京交通大学 | Subway train fault rescue emergency plan optimization method and system |
| CN116767316A (en) * | 2023-07-19 | 2023-09-19 | 卡斯柯信号有限公司 | Scheduling adjustment method for urban railway fault rescue scene |
-
2023
- 2023-12-07 CN CN202311675966.0A patent/CN117719576A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001278052A (en) * | 2000-03-31 | 2001-10-10 | Kawasaki Heavy Ind Ltd | Train planned schedule preparation method and preparation support device |
| CN112706803A (en) * | 2021-01-07 | 2021-04-27 | 北京交通大学 | Automatic subway train rescue adjusting method and system |
| CN113415324A (en) * | 2021-08-03 | 2021-09-21 | 东北大学 | Dynamic scheduling and operation control collaborative optimization method and system for high-speed train |
| CN116424393A (en) * | 2022-01-04 | 2023-07-14 | 北京全路通信信号研究设计院集团有限公司 | Rescue method and device for fault train and storage medium |
| CN116432843A (en) * | 2023-04-12 | 2023-07-14 | 北京交通大学 | Subway train fault rescue emergency plan optimization method and system |
| CN116767316A (en) * | 2023-07-19 | 2023-09-19 | 卡斯柯信号有限公司 | Scheduling adjustment method for urban railway fault rescue scene |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109657843B (en) | Integrated planning decision support system of urban plug-in bus system | |
| CN107036617B (en) | Travel route planning method and system combining taxi and subway | |
| CN107545320B (en) | Urban rail transit passenger path planning method and system based on graph theory | |
| CN103177575B (en) | System and method for dynamically optimizing online dispatching of urban taxies | |
| CN110901693A (en) | Train operation control system based on 5G and cloud computing technology | |
| CN103985247A (en) | Taxi transport capacity scheduling system based on city taxi calling demand distribution density | |
| CN105788260A (en) | Public transportation passenger OD calculation method based on intelligent public transportation system data | |
| CN111353645A (en) | Automatic handling method and system for driving plan of urban rail transit vehicle base | |
| CN103177561A (en) | Method and system for generating bus real-time traffic status | |
| CN108592928B (en) | Construction method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN109543934A (en) | The evaluation method of the overall target of urban public traffic network | |
| CN110909434B (en) | Urban public transport trunk line network design method under low-carbon guidance | |
| CN107170271B (en) | Regional management scheduling method and system for Internet of vehicles | |
| CN110309936A (en) | A kind of sub-interchange recognition methods combined based on mobile phone location data and path estimating | |
| Sierpiński et al. | Research and shaping transport systems with multimodal travels–methodological remarks under the green travelling project | |
| CN115455681A (en) | Multi-vehicle-oriented commuting traffic carbon emission spatial distribution estimation method | |
| CN112381472A (en) | Subway connection bus route optimization method and device and storage medium | |
| CN113762598B (en) | Comprehensive transportation hub emergency evacuation vehicle path planning method | |
| CN110633424A (en) | Stroke matching method and system | |
| CN117719576A (en) | Train rescue method for positive line parking application | |
| Maparu et al. | A methodology for selection of bus rapid transit corridors: A case study of Kolkata | |
| CN113298390B (en) | Method and device for constructing multi-mode collaborative evacuation scheme set for sudden heterogeneous passenger flow | |
| KR101254708B1 (en) | Method for finding optimal intermodal route and computer readable record medium thereof | |
| CN103208031A (en) | Running shortest path selection method for industrial railway logistics intelligent scheduling system | |
| CN113393026B (en) | Unmanned taxi transfer and path matching method |
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 |