Patent Publication Number: US-2023159071-A1

Title: Operation Adjustment Method and System for Metro Train in Unidirectional Jam

Description:
CROSS REFERENCE TO RELATED APPLICATION 
     The present application is a national stage of International Application No. PCT/CN2021/099677, filed on Jun. 11, 2021, which claims priority to the Chinese Patent Application No. 202110018437.8, filed with the China National Intellectual Property Administration (CNIPA) on Jan. 7, 2021, and entitled “OPERATION ADJUSTMENT METHOD AND SYSTEM FOR METRO TRAIN IN UNIDIRECTIONAL JAM”. Both of the aforementioned applications are incorporated herein by reference in their entireties. 
    
    
     TECHNICAL FIELD 
     The present disclosure relates to the field of train operation control and organization, and in particular, to an operation adjustment method and system for a metro train in a unidirectional jam. 
     BACKGROUND ART 
     Metro in China is booming, and there have been developed metro networks in large cities such as Beijing, Shanghai and Guangzhou. The metro is of importance to improve the urban transportation capacity and relieve the traffic pressure. However, in case of faults or emergencies during operation, trains cannot normally run as scheduled, the carrying capacities of lines are reduced, and perhaps the carrying capacities in partial areas are greatly reduced or even the operation is interrupted, all of which seriously affect the normal operation order and the quality of service (QoS) for passengers. 
     As a core for operation organization of metro trains, metro dispatchers are required to make a quick response for the faults or emergencies to reduce influences on the train operation, and ensure that the trains can return to normal running quickly and orderly upon fault recovery. One typical and important fault is the unidirectional jam mainly arising from track breakage and foreign matter intrusion at a position on the lines, and any segment with the unidirectional jam is unallowable for the trains to pass through. In this scenario, the dispatchers will manually adjust the train operation according to jam information, and send commands to affected trains one by one through telephones, to implement a series of complex adjustments such as train detaining, train reducing, rerouting and midway turnaround. With large labor intensity, the dispatchers are likely to make operational errors in emergencies and hard to ensure the effectiveness and efficiency of adjustments. Hence, there is an urgent need to adjust the train operation automatically and intelligently. With the rapid development of the metro, reducing the influences of the faults and emergencies on the train operation, improving the QoS of the metro and relieving working pressures of the dispatchers are of great concern in transportation services of the metro. 
     Therefore, it is desirable to provide an intelligent operation adjustment scheme for a metro train in a unidirectional jam. 
     SUMMARY 
     An objective of the present disclosure is to provide an operation adjustment method and system for a metro train in a unidirectional jam, to automatically generate an intelligent operation adjustment scheme for the metro train in the jam. 
     To implement the above objectives, the present disclosure provides the following solutions: 
     An operation adjustment method for a metro train in a unidirectional jam includes: 
     acquiring a jam position and a jam time; 
     generating a train operation routing scheme in the jam according to the jam position; 
     setting priorities for turnaround stations on a routing according to the train operation routing scheme, wherein the turnaround stations each are a turnaround supporting station, a turnaround station away from an origin station has a high priority, and a turnaround station close to the origin station has a low priority; 
     generating an affected train set upon occurrence of the jam according to the jam position and the jam time; 
     predicting, according to the affected train set, arrival times of each affected train at the turnaround stations of the different priorities; 
     determining, according to the arrival times of each affected train at the turnaround stations, planned train service to be executed by the affected train after turning around; and 
     acquiring a quantity of planned train service canceled during the jam, and allocating, according to the quantity of planned train service canceled during the jam, a train resource for train addition or storage. 
     Optionally, the generating a train operation routing scheme in the jam according to the jam position may specifically include: 
     searching an available train running routing on two sides of the jam position according to the jam position and line topology information, the line topology information being information on a station position and a corresponding layout; and 
     determining the train operation routing scheme according to the available train running routing, the train operation routing scheme comprising two cases, which are a case where two sides of the jam position each are provided with a running routing, and a case where only one side of the jam position is provided with the running routing, and an other side does not form the running routing. 
     Optionally, the turnaround supporting station refers to a station enabling a train to switch terminals of the train and change a running direction; 
     a turnaround type comprises a midway turnaround and a terminal turnaround; the midway turnaround refers to a turnaround at an intermediate station; and the terminal turnaround refers to a turnaround at the destination station; and 
     a turnaround mode may include a platform-front turnaround and a platform-behind turnaround. 
     Optionally, the predicting, according to the affected train set, arrival times of each affected train at the turnaround stations of the different priorities may specifically include: 
     predicting the arrival times of each affected train at the turnaround stations, according to basic information of each affected train including a present position, a velocity, a tractive force and a braking force, by using a section minimum running time model. 
     Optionally, the determining, according to the arrival times of each affected train at the turnaround stations, planned train service to be executed by the affected train after turning around may specifically include: 
     determining, planned train service that are executed by the affected train in a present departure condition, by comparing a first time after the affected train arriving at a turnaround station on a preset routing and performing a normal turnaround with a time of a planned train service after the first time. 
     Optionally, after the determining, according to the arrival times of each affected train at the turnaround stations, planned train service to be executed by the affected train after turning around, the method may further includes: 
     scheduling the affected train to perform an midway turnaround at a station of a lower priority to execute another planned train service, when the affected train does not execute a planned train service in an affected train number set after turning around at a turnaround station of a highest priority. 
     Optionally, after the generating a train operation routing scheme in the jam according to the jam position, the method further includes a step of processing a train on a non-routing line without the train operation routing scheme: 
     determining a detaining position of the train on the non-routing line; 
     calculating a departure interval of an extra passenger train according to the jam position and the line topology information; and 
     running the extra passenger train to arrive at a station on the line, where a routing is not formed, for passenger carrying. 
     An operation adjustment system for a metro train in a unidirectional jam includes: 
     an information acquiring unit, configured to acquire a jam position and a jam time; 
     a routing operation scheme generating unit, configured to generate a train operation routing scheme in the jam according to the jam position; 
     a priority determining unit, configured to set priorities for turnaround stations on a routing according to the train operation routing scheme, wherein the turnaround stations each are a turnaround supporting station, a turnaround station away from an origin station has a high priority, and a turnaround station close to the origin station has a low priority; 
     an affected train set generating unit, configured to generate an affected train set upon occurrence of the jam according to the jam position and the jam time; 
     a time predicting unit, configured to predict, according to the affected train set, arrival times of each affected train at the turnaround stations of the different priorities; 
     a planned train service determining unit, configured to determine, according to the arrival times of each affected train at the turnaround stations, planned train service to be executed by the affected train after turning around; and 
     a train resource allocating unit, configured to acquire a quantity of planned train service canceled during the jam, and allocate, according to the quantity of planned train service canceled during the jam, a train resource for train addition or storage. 
     Optionally, the operation adjustment system may further include: a train midway turnaround control unit, configured to: 
     schedule the affected train to perform an midway turnaround at a station of a lower priority to execute another planned train service, when the affected train does not execute a planned train service in an affected train number set after turning around at a turnaround station of a highest priority. 
     Optionally, the operation adjustment system may further include: 
     a detaining position determining unit, configured to determine a detaining position of a train on a non-routing line; 
     an extra passenger train departure interval control unit, configured to calculate a departure interval of an extra passenger train according to the jam position and a line topology information; and 
     an extra passenger train running control unit, configured to run the extra passenger train to arrive at a station on the line, where a routing is not formed, for passenger carrying. 
     Based on specific embodiments provided in the present disclosure, the present disclosure has the following technical effects: 
     1. At the beginning of the jam, the present disclosure uses the intelligent method to replace the method that the dispatcher manually determines the train operation routing scheme in the unidirectional jam, and avoid the conventional complicated operation of manually determining the affected train one by one. 
     2. In the process of the jam, the present disclosure intelligently determines the train detaining position on the metro line without the running routing, and makes the train clear the passengers at the station as much as possible, thereby preventing the adverse effect of unloading passenger in sections. Meanwhile, the present disclosure calculates the departure interval with information such as the line topology and the station type, and reasonably adds the extra passenger train to arrive at the station on the line for passenger carrying, thereby preventing a phenomenon that a great number of passengers are stranded due to no trains to serve for a long time, and improving the QoS for the passengers as much as possible. 
     3. Upon the recovery of the jam, the present disclosure automatically allocates the train resource with the depot or the storage line of the station, which greatly reduces the complicated and frequent operation on the trains in dispatch and command process of trains. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The present disclosure will be further described below with reference to the accompanying drawings. 
         FIG.  1    is a control flow chart of an operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  2    is a schematic view of a train operation routing scheme generated in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  3    is a schematic view of a track node and a turnout node generated in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  4    is a control flow chart for determining affected train set generated in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  5    is a control flow chart for determining a train detaining position and launching an extra passenger train in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  6    is a schematic view for determining whether a rear station is idle and controlling backward driving of a train in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  7    is a schematic view for launching the extra passenger train for carrying passenger in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  8    is a control flow chart for determining a train number not running as planned and accordingly adding or storing a train in the operation adjustment method for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
         FIG.  9    is a structural block diagram of an operation adjustment system for a metro train in a unidirectional jam according to Embodiment 1 of the present disclosure. 
     
    
    
     REFERENCE NUMERALS 
     M 1 . information acquiring unit, M 2 . routing operation scheme generating unit, M 3 . priority determining unit, M 4 . affected train set generating unit, M 5 . time predicting unit, M 6 . planned train service determining unit, and M 7 . train resource allocating unit. 
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
     The technical solutions in the embodiments of the present disclosure are clearly and completely described below with reference to the accompanying drawings. Apparently, the described embodiments are merely a part rather than all of the embodiments of the present disclosure. All other embodiments obtained by a person of ordinary skill in the art on the basis of the embodiments of the present disclosure without creative efforts shall fall within the protection scope of the present disclosure. 
     An objective of the present disclosure is to provide an operation adjustment method and system for a metro train in a unidirectional jam, to automatically generate an intelligent operation adjustment scheme for the metro train in the jam. 
     In the operation of the metro, trains cannot pass through a position where the unidirectional jam such as the track breakage and foreign matter intrusion occurs. In order to prevent further propagation of fault impact, the dispatchers will determine a train operation routing scheme in the jam according to the position of the jam segment and in combination with information such as the line topology and the station type, such that trains running to the turnaround station on each routing turns around, thereby reducing influences of the jam segment on the operation. Presently, the dispatchers determine the train operation scheme in the jam mainly by manually analyzing information such as the jam position and the line topology to make decisions, and this process is not automatic and intelligent. Once the dispatchers cannot handle the fault timely and reasonably, the fault is likely to be aggravated. 
     Furthermore, according to running states (including the positions and the velocities) of up and down trains, the dispatchers will frequently predict the arrival time of the trains at the turnaround stations on each routing, and then determine planned train service to be launched after the trains return. With the rising travel demands of the passengers, both the traffic density of the metro system and the labor intensity of the dispatchers are increased. 
     In addition, if a line on one side of the jam position cannot form the train running routing, the dispatchers will manually determine the train detaining positions according to running states (including the positions and the velocities) of the trains on the line upon occurrence of the jam and in combination with the information such as the line topology, such that the trains clear the passengers at station platforms as much as possible, thereby reducing the influences of the jam on the passengers. Meanwhile, in order to prevent the phenomenon that there are no trains passing through the stations on the line for a long time, the dispatchers will add extra passenger trains according to the line topology and the train running positions, and run the trains to arrive at the stations for passenger carrying. The above process requires the dispatchers to have the emergency handling experience and emergency response capabilities. 
     At last, in order to ensure that the trains can recover normal running upon the end of the jam, the dispatchers will add or store the train manually with the depot or the storage line of the station, and this often cannot implement the reasonable allocation of the train resources. 
     To sum up, existing operation adjustment methods for the metro train in the unidirectional jam have the following defects: 
     1. Upon the occurrence of the jam, the dispatchers will manually determine the train operation routing scheme in the jam according to the jam position and in combination with information such as the line topology and the station type, such that the fault handling efficiency is low. 
     2. The dispatchers will frequently predict the arrival time of the trains at the turnaround stations according to real-time positions and velocities of the trains, and determine planned train service to be launched after the trains return, so the labor intensity of the dispatchers is large. 
     3. In case of a line where the train running routing cannot be formed during the jam, the dispatchers will manually adjust the positions of the trains in the line. Meanwhile, in order to prevent the phenomenon that there are no trains passing through the stations on the line for a long time and a large number of passengers are stranded, the dispatchers will run trains to the stations according to the line topology and the station types as much as possible for passenger carrying. This imposes higher requirements on the emergency response capabilities and emergency handling experience of the dispatchers. 
     4. Upon the recovery of the jam, the dispatchers will manually allocate the train resources, namely sending dispatching commands to add or store the train with the depot or the train storage line of the station, and this often cannot implement efficient utilization of the train resources. 
     To make the above objectives, features, and advantages of the present disclosure clearer and more comprehensible, the present disclosure will be further described in detail below with reference to the accompanying drawings and the specific examples. 
     Embodiment 1 
     As shown in  FIG.  1   , an operation adjustment method for a metro train in a unidirectional jam provided by Embodiment 1 of the present disclosure specifically includes the following steps. 
     In step S 1 , a jam position and a jam time are acquired. 
     Information such as line topology and station types are stored, and in case of the unidirectional jam, the jam position is acquired timely and the jam time is determined. The unidirectional jam refers to that an emergency occurs on a position of the metro line in a certain direction, such that trains cannot normally run to the planned destination through the position. Generally, the unidirectional jam is arising from track breakage, foreign matter intrusion, etc. 
     In step S 2 , a train operation routing scheme in the jam is generated according to the jam position, specifically: 
     An available train running routing on two sides of the jam position is searched according to the jam position and line topology information, the line topology information is information on a station position and types of corresponding layout lines. 
     The train operation routing scheme is determined according to the available train running routing, the train operation routing scheme including two cases, namely a case where two sides of the jam position each are provided with an running routing, and a case where only one side of the jam position is provided with the running routing, and the other side can not form the running routing. 
     The line topology information of metro mainly includes station positions and types of corresponding layout lines. The station type mainly refers to whether turnaround lines are provided and how many train storage lines are provided at the stations. For example, there are station-front single turnaround lines, station-front double turnaround lines, station-behind single turnaround lines, station-behind double turnaround lines, etc. Generating the train operation routing scheme in the jam is mainly to determine whether the available train running routing is provided on two sides of the jam position according to the jam position and the line topology information. As shown in  FIG.  2   , the generated train operation routing scheme includes two cases: (1) two sides of the jam position each are provided with the running routing; and (2) only one side of the jam position is provided with the running routing, and the other side can not form the running routing. 
     The specific implementation steps are as follows. 
     In step S 21 , it is assumed that a metro line includes N stations, with a set of stations S={1, 2, . . . , k, . . . N} k being a k th  station. Based on the jam position on the line, track sections (including station tracks) and turnouts on two side lines of the jam position are abstracted as nodes according to information on line topology, station positions and turnout positions, with a set of nodes V={v 1 , v 2 , . . . v n , . . . v |V| }, where v n  represents an n th  node in the V, and |V| represents a quantity of nodes in the set V; and further, each node is provided with an attribute tag, including a station node tag F v     n     ,k   station  and a turnout node tag F v     n     ,k   turnaround  for platform-front turnaround. A function k=ƒ(v n ), k∈S, v n ∈V is defined, representing a mapping relation between the node v n  and the station k, where 
     
       
         
           
             
               F 
               
                 
                   v 
                   n 
                 
                 , 
                 k 
               
               station 
             
             = 
             
               { 
               
                 
                   
                     
                       1 
                       , 
                          
                       
                         node 
                         ⁢ 
                             
                         
                           v 
                           n 
                         
                         ⁢ 
                            
                         is 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                             
                         track 
                         ⁢ 
                             
                         node 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                         
                              
                               
                         
                         ⁢ 
                         k 
                       
                     
                   
                 
                 
                   
                     
                       0 
                       , 
                         
                       
                         node 
                         ⁢ 
                             
                         
                           v 
                           n 
                         
                         ⁢ 
                            
                         is 
                         ⁢ 
                             
                         not 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                             
                         track 
                         ⁢ 
                             
                         node 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                         
                              
                               
                         
                         ⁢ 
                         k 
                       
                     
                   
                 
               
             
           
         
       
       
         
           
                              
             
               
                 F 
                 
                   
                     v 
                     n 
                   
                   , 
                   k 
                 
                 
                   turn 
                   ⁢ 
                   around 
                 
               
               = 
               
                 { 
                 
                   
                     
                       
                         1 
                         , 
                            
                         
                           
                             node 
                             ⁢ 
                                 
                             
                               v 
                               n 
                             
                             ⁢ 
                                 
                             is 
                             ⁢ 
                                 
                             the 
                             ⁢ 
                                 
                             turnout 
                             ⁢ 
                                 
                             node 
                             ⁢ 
                                 
                             for 
                             ⁢ 
                                 
                             station 
                           
                           - 
                         
                       
                     
                   
                   
                     
                       
                         front 
                         ⁢ 
                             
                         turn 
                         ⁢ 
                           
                         around 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                             
                         k 
                       
                     
                   
                   
                     
                       
                         0 
                         , 
                         
                           
                             node 
                             ⁢ 
                                 
                             
                               v 
                               n 
                             
                             ⁢ 
                                 
                             is 
                             ⁢ 
                                 
                             not 
                             ⁢ 
                                 
                             the 
                             ⁢ 
                                 
                             turnout 
                             ⁢ 
                                 
                             node 
                             ⁢ 
                                 
                             for 
                             ⁢ 
                                 
                             station 
                           
                           - 
                         
                       
                     
                   
                   
                     
                       
                         front 
                         ⁢ 
                             
                         turn 
                         ⁢ 
                         around 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         station 
                         ⁢ 
                             
                         k 
                       
                     
                   
                 
               
             
           
         
       
       
         
           
                              
             
               
                 
                   
                     F 
                     
                       
                         v 
                         n 
                       
                       , 
                       k 
                     
                     station 
                   
                   + 
                   
                     F 
                     
                       
                         v 
                         n 
                       
                       , 
                       k 
                     
                     
                       turn 
                       ⁢ 
                       around 
                     
                   
                 
                 ≤ 
                 1 
               
               , 
               
                 ∀ 
                 
                   
                     
                       v 
                       n 
                     
                       
                   
                   ∈ 
                   V 
                 
               
               , 
               
                 k 
                 ∈ 
                 
                   S 
                   . 
                 
               
             
           
         
       
     
     As shown in  FIG.  3   , the nodes v 1  v 2  on the routing  1  are track nodes of the station  1 , then ƒ(v)=1, ƒ(v 2 )=1 and F v     1     ,1   station =1, F v     2     ,1   station =1; and the node v 3  on the routing  2  is a turnout node for platform-front turnaround of the station  4 , then ƒ(v 3 )=4 and F v     3     ,4   turnaround =1. 
     In step S 22 , a connection relation between the nodes is set according to a running direction of the train and a direction of the turnout on the line, such that two directed graphs G 1 =(V 1 , E 1 ), G 2 =(V 2 , E 2 ) can be respectively generated, where V 1 ,V 2  are sets V 1 ,V 2 ⊆V composed of nodes in the graphs, and E 1 , E 2  are sets composed of directed edges, E 1 , E 2 ⊆E. Each directed graph can generate an adjacency matrix. With the G 1  as an example, the adjacency matrix A 1 =(a i,j ) |V     1     |×|V     1     |  is used to represent a connection relation between nodes in the G 1 , where J are row and column indexes of the matrix, the adjacency matrix A 1  represents a relation between nodes in the graph G 1 , for example, if the first node and the second node are connected in the graph, then a 1,2 =1, and |V 1 | is a quantity of nodes in the graph: 
     
       
         
           
             
               a 
               
                 i 
                 , 
                 j 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         1 
                         , 
                           
                         
                           
                             v 
                             
                               i 
                               , 
                               j 
                             
                           
                           ∈ 
                           
                             E 
                             1 
                           
                         
                       
                     
                   
                   
                     
                       
                         0 
                         , 
                         
                           
                             v 
                             
                               i 
                               , 
                               j 
                             
                           
                           ∉ 
                           
                             E 
                             1 
                           
                         
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
     In the above expression, v i,j  represents a directed edge with nodes v i ,v j  as endpoints, v j , v j ∈V 1 . 
     A bidirectional connection relation is provided between the turnout for the platform-front turnaround on the line and the platform track, and other nodes are connected according to the running direction of the train. For simplicity of the model, at origin stations, such as the station  1  and the station  5  in  FIG.  3   , track nodes in up and down directions may be directly connected according to the running direction of the train, regardless of the double turnaround line. 
     Moreover, for ease of description, the following definitions are provided: 
     1. The routing including the origin station in the up direction is an up routing, as shown by the routing  1  in  FIG.  2   . On the contrary, the routing including the origin station in the down direction is a down routing, as shown by the routing  2  in  FIG.  3   . 
     2. The train running in a direction same as that of the routing is a forward train on the routing; and as shown in  FIG.  2   , the up train running on the routing  1  is defined as the forward train on the routing. On the contrary, the train running in a direction reverse to that of the routing is a reverse train on the routing; and as shown in  FIG.  2   , the down train running on the routing  1  is defined as the reverse train on the routing. 
     3. The forward trains on the routing are formed into a forward train set on the routing; and likewise, the reverse trains on the routing are formed into a reverse train set on the routing. 
     In step S 23 , a circle is searched in each of the two directed graphs G 1  and G 2 . With the graph G 1  as an example, there is a circle set R={r 1 , r 2 , . . . , r u , . . . r |R| }, where r u =(V u   R ,E u   R ), V u   R ⊆V 1 , E u   R ⊆E 1 , V1 being a set composed of nodes in the circle and E 1  being a set composed of directed edges in the circle, and 
     
       
         
           
             
               
                 V 
                 u 
                 R 
               
               = 
               
                 { 
                 
                   
                     v 
                     
                       u 
                       1 
                     
                     R 
                   
                   , 
                   
                     v 
                     
                       u 
                       2 
                     
                     R 
                   
                   , 
                   
                     … 
                     ⁢ 
                        
                     
                       v 
                       
                         u 
                         a 
                       
                       R 
                     
                   
                   , 
                   
                     … 
                     ⁢ 
                        
                     
                       v 
                       
                         u 
                         
                           
                             ❘ 
                             &#34;\[LeftBracketingBar]&#34; 
                           
                           
                             V 
                             u 
                             R 
                           
                           
                             ❘ 
                             &#34;\[RightBracketingBar]&#34; 
                           
                         
                       
                       R 
                     
                   
                 
                 } 
               
             
             , 
           
         
       
     
     V u     a     R  being a node index in the set V u   R , V 1  being a node set of the G 1 , and E 1  being a directed edge set of the G 1 . If the circle set R=Ø, Step S 2  is ended; or otherwise, for a circle r u ∈R, nodes in the circle are traversed to find a station having a maximum subscript or a turnout node for the platform-front turnaround, namely: 
     
       
         
           
             
               k 
               = 
               
                 max 
                 ⁢ 
                    
                 
                   f 
                   ⁡ 
                   ( 
                   
                     v 
                     
                       u 
                       a 
                     
                     R 
                   
                   ) 
                 
               
             
             , 
             
               
                 
                   F 
                   
                     
                       v 
                       
                         u 
                         a 
                       
                       R 
                     
                     , 
                     
                       f 
                       ⁡ 
                       ( 
                       
                         v 
                         
                           u 
                           a 
                         
                         R 
                       
                       ) 
                     
                   
                   
                     s 
                     ⁢ 
                     t 
                     ⁢ 
                     a 
                     ⁢ 
                     t 
                     ⁢ 
                     i 
                     ⁢ 
                     o 
                     ⁢ 
                     n 
                   
                 
                 + 
                 
                   F 
                   
                     
                       v 
                       
                         u 
                         a 
                       
                       R 
                     
                     , 
                     
                       f 
                       ⁡ 
                       ( 
                       
                         v 
                         
                           u 
                           a 
                         
                         R 
                       
                       ) 
                     
                   
                   turnaround 
                 
               
               = 
               1 
             
             , 
             
               
                 v 
                 
                   u 
                   a 
                 
                 R 
               
               ∈ 
               
                 V 
                 u 
                 R 
               
             
           
         
       
     
     Therefore, the turnaround station k in the circle and the turnaround mode of the train at this station are determined. In other words, if the node having the maximum subscript is the station track node, the turnaround mode of the train at the station is the platform-behind turnaround, T k   forward =1, or otherwise, is the platform-front turnaround, T k   forward =0, namely: 
     
       
         
           
             
               T 
               k 
               forward 
             
             = 
             
               { 
               
                 
                   
                     
                       
                         1 
                         , 
                       
                     
                     
                       
                         
                           F 
                           
                             n 
                             , 
                             k 
                           
                           
                             s 
                             ⁢ 
                             t 
                             ⁢ 
                             a 
                             ⁢ 
                             t 
                             ⁢ 
                             i 
                             ⁢ 
                             o 
                             ⁢ 
                             n 
                           
                         
                         = 
                         1 
                       
                     
                   
                   
                     
                       
                         0 
                         , 
                       
                     
                     
                       
                         
                           F 
                           
                             n 
                             , 
                             k 
                           
                           
                             t 
                             ⁢ 
                             u 
                             ⁢ 
                             r 
                             ⁢ 
                             n 
                             ⁢ 
                             a 
                             ⁢ 
                             r 
                             ⁢ 
                             o 
                             ⁢ 
                             u 
                             ⁢ 
                             n 
                             ⁢ 
                             d 
                           
                         
                         = 
                         1 
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
     Finally, the turnaround station set T circle   turnaround  of the directed graph G=(V,E) is output, where the circle means a loop. The set is traversed to find a maximum subscript value of the turnaround station in all circles, namely: 
         K =max{ k|,k∈T   circle   turnaround   },K∈S    
     Therefore, the routing C K  with the station K as the terminal turnaround station is output, K being the turnaround station having the maximum subscript. 
     In step S 24 , the train operation routing scheme generated in Step S 22  can be divided into two cases: (1) two sides of the jam position each are provided with the train running routing; and (2) only one side of the jam position is provided with the train running routing, and the other side can not form the running routing. 
     In step S 3 , priorities are set for turnaround stations on a routing according to the train operation routing scheme, where the turnaround stations each are a turnaround supporting station, a turnaround station away from an origin station has a high priority, and a turnaround station close to the origin station has a low priority. 
     The turnaround supporting station refers to a station enabling a train to switch its terminals and change a running direction, and a train turnaround type includes an midway turnaround and a terminal turnaround. The midway turnaround is a turnaround at an intermediate station; and the terminal turnaround is a turnaround at the destination station. A turnaround mode includes a platform-front turnaround and a platform-behind turnaround. According to the train operation routing scheme, the turnaround station of the high priority is the turnaround station away from the origin station, while the turnaround station of the low priority is the turnaround station close to the origin station. 
     The stations in the set T Circle   turnaround  are prioritized according to distances from the origin station, where the station of the high priority is the station away from the origin station, while the station of the low priority is the station close to the origin station. 
     In step S 4 , an affected train set upon occurrence of the jam is generated according to the jam position and the jam time. 
     The affected train set on the line includes affected trains on a line having the running routing and affected trains on a non-routing line where the running routing cannot be formed. 
     The trains on the non-routing line will be detained and its detaining positions will be determined. The detaining positions are determined according to states of stations as well as positions and velocities of the trains on the line where the running routing cannot be formed upon the occurrence of the jam, and are reasonably allocated to the trains when the jam occurs. In order to prevent the phenomenon that a great number of passengers are stranded at some stations because there are no trains for a long time upon the occurrence of the jam, extra passenger trains will be run to arrive at the stations for passenger carrying. Departure intervals of the extra passenger trains are calculated according to the jam position and the topological line information to keep arrival time of the extra passenger trains at the stations uniform as much as possible. The extra passenger trains are then run to arrive at the stations on the line, where the routing cannot be formed, for passenger carrying. Now, the specific implementation step E is described. 
     The following steps are continuously performed on the trains following the train operation routing scheme. 
     With a routing C K  in the train operation routing scheme generated in step S 2  as an example, as shown in  FIG.  4   , step S 4  specifically includes the following steps. 
     In step S 41 , all planned train service in a planned operation diagram are sorted according to departure time to generate an up planned train service set T up   plan  and a down planned train service set T down   plan . According to start and end time of the jam, all planned train service running lines intersected with a turnaround station K of the routing C K  during the jam are searched, and added to the affected up train number set T up   circle  of the routing C K . Specifically, supposing that arrival time of the train i up   plan , i up   plan ∈T up   plan  at the turnaround station of the routing is 
     
       
         
           
             
               t 
               
                 i 
                 up 
                 plan 
               
               K 
             
             , 
           
         
       
     
     if the 
     
       
         
           
             t 
             
               i 
               up 
               plan 
             
             K 
           
         
       
     
     meets a condition: 
     
       
         
           
             
               
                 t 
                 0 
               
               ≤ 
               
                 t 
                 
                   i 
                   
                     u 
                     ⁢ 
                     p 
                   
                   
                     p 
                     ⁢ 
                     l 
                     ⁢ 
                     a 
                     ⁢ 
                     n 
                   
                 
                 K 
               
               ≤ 
               
                 
                   t 
                   0 
                 
                 + 
                 
                   t 
                   d 
                 
               
             
             , 
           
         
       
     
     then, it can be determined that the train is affected by the fault, t 0 , t d  are start time and time of duration of the jam respectively. 
     Meanwhile, whether the train departs before the start time of the jam is determined according to departure time of the planned train service; and the train is tagged as a departed train number if yes; or otherwise, as a waiting train number if no. Elements in the set T up   circle  are sorted according to departure time. 
     Likewise, train numbers in the set T down   plan  are traversed. If the running line of a down planned train service is intersected with a turnaround station on a short routing during the jam, the train number is added to the affected down train number set T down   circle  of the corresponding routing; and meanwhile, the train is tagged to indicate whether it have departed and elements in the T down   circle  are sorted. 
     In addition, letting departure times of first up and down train numbers passing through the jam segment be t up   jam , t down   jam  upon the occurrence of the jam, and departure time of first up and down train numbers passing through the jam segment be t up   recovery , t down   recovery  upon recovery of the jam, and supposing that departure time of train numbers i down   plan ∈T down   plan , i up   plan ∈T up   plan  is 
     
       
         
           
             
               t 
               
                 i 
                 down 
                 plan 
               
               depart 
             
             , 
             
               t 
               
                 i 
                 up 
                 plan 
               
               depart 
             
             , 
           
         
       
     
     last up and down train indexes passing through the jam segment before the jam are I up   last , I down   last , and first up and down train indexes passing through the jam segment upon the recovery of the jam are I up   first , I down   first , where: 
     
       
         
           
             
               
                 I 
                 up 
                 last 
               
               = 
               
                 
                   
                     arg 
                     ⁢ 
                        
                     max 
                   
                   
                     i 
                     up 
                     plan 
                   
                 
                 ⁢ 
                    
                 
                   ( 
                   
                     t 
                     
                       i 
                       up 
                       plan 
                     
                     depart 
                   
                   ) 
                 
               
             
             , 
             
               
                 t 
                 
                   i 
                   up 
                   plan 
                 
                 depart 
               
               ≤ 
               
                 t 
                 up 
                 jam 
               
             
             , 
             
               
                 i 
                 up 
                 plan 
               
               ∈ 
               
                 T 
                 up 
                 plan 
               
             
           
         
       
       
         
           
             
               
                 I 
                 down 
                 last 
               
               = 
               
                 
                   
                     arg 
                     ⁢ 
                        
                     max 
                   
                   
                     i 
                     down 
                     plan 
                   
                 
                 ⁢ 
                     
                 
                   ( 
                   
                     t 
                     
                       i 
                       down 
                       plan 
                     
                     depart 
                   
                   ) 
                 
               
             
             , 
             
               
                 t 
                 
                   i 
                   down 
                   plan 
                 
                 depart 
               
               ≤ 
               
                 t 
                 down 
                 jam 
               
             
             , 
             
               
                 i 
                 down 
                 plan 
               
               ∈ 
               
                 T 
                 down 
                 plan 
               
             
           
         
       
       
         
           
             
               
                 I 
                 up 
                 first 
               
               = 
               
                 
                   
                     arg 
                     ⁢ 
                        
                     min 
                        
                   
                   
                     i 
                     up 
                     plan 
                   
                 
                 ⁢ 
                    
                 
                   ( 
                   
                     t 
                     
                       i 
                       up 
                       plan 
                     
                     depart 
                   
                   ) 
                 
               
             
             , 
             
               
                 t 
                 
                   i 
                   up 
                   plan 
                 
                 depart 
               
               ≥ 
               
                 t 
                 up 
                 recovery 
               
             
             , 
             
               
                 i 
                 up 
                 plan 
               
               ∈ 
               
                 T 
                 up 
                 plan 
               
             
           
         
       
       
         
           
             
               
                 I 
                 down 
                 first 
               
               = 
               
                 
                   
                     arg 
                     ⁢ 
                        
                     min 
                        
                   
                   
                     i 
                     down 
                     plan 
                   
                 
                 ⁢ 
                    
                 
                   ( 
                   
                     t 
                     
                       i 
                       down 
                       plan 
                     
                     depart 
                   
                   ) 
                 
               
             
             , 
             
               
                 t 
                 
                   i 
                   down 
                   plan 
                 
                 depart 
               
               ≥ 
               
                 t 
                 down 
                 recovery 
               
             
             , 
             
               
                 i 
                 down 
                 plan 
               
               ∈ 
               
                 T 
                 down 
                 plan 
               
             
           
         
       
     
     In step S 42 , all planned train service in up and down directions are traversed, and a train running line intersected with the station on the line where the train running routing cannot be formed upon the occurrence of the jam is searched, namely, train numbers on the running line are located on the line where the train running routing cannot be formed upon the occurrence of the jam, and are added to the train sets T up   line , T down   line  on the line where the train running routing cannot be formed. 
     In step S 5 , arrival time of each affected train at the turnaround stations of the different priorities is predicted according to the affected train set. 
     The arrival time of each affected train at the turnaround stations is predicted according to basic information of each affected train such as a present position, a velocity, a tractive force and a braking force by using a section minimum running time model. 
     The specific implementation steps are as follows. 
     In step S 51 , for each turnaround station k(k∈T Circle   turnaround ), affected train number sets T up   circle  and T down   circle  on the routing are respectively traversed; a position S i     c    and a running state (including information such as a running velocity v i     c    and a present moment t 0  of the train executing the train number) of the train number i c (i c ⊂T up   circle ∪T down   circle ) are determined through a communication message between a transponder and an onboard device; and arrival time t i     c     ,k  of the train i c  at the station k is predicted. 
     In step S 52 , it is assumed that a section p where a train presently executing the train number i c  is located includes U velocity limit segments 1, 2, . . . , . . . L, l being an index of each velocity limit segment. There are P sections 1, 2, . . . p, . . . P between the train and the front station, p being an index of each section; and the train is running in the velocity limit segment (s l   lim ,s l+1   lim ) namely s i     c   ∈(s l   lim ,s l+1   lim ) and the present velocity limit segment has a maximum velocity limit of v u   lim . With a destination s l+1   lim  of the velocity limit segment as an origin, a maximum braking force running curve v l   b (s) of the train is drawn to obtain a running trajectory of the train and an entry velocity v l   entry  of the velocity limit segment. If there is an intersection between the maximum braking force running curve and the velocity limit v l   lim , v l   entry  is equal to the velocity limit; and if there is no intersection, the v l   entry  is the equal to the entry velocity of the maximum braking force running curve, which is indicated as 
     
       
         
           
             
               v 
               l 
               entry 
             
             = 
             
               { 
               
                 
                   
                     
                       
                         v 
                         l 
                         limit 
                       
                       , 
                         
                       
                         
                           if 
                           ⁢ 
                               
                           
                             v 
                             l 
                             limit 
                           
                         
                         ≤ 
                         
                           
                             v 
                             l 
                             b 
                           
                           ( 
                           
                             s 
                             l 
                             lim 
                           
                           ) 
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           v 
                           l 
                           b 
                         
                         ( 
                         
                           s 
                           l 
                           lim 
                         
                         ) 
                       
                       , 
                          
                       others 
                     
                   
                 
               
             
           
         
       
     
     From the present velocity point of the train, for each velocity limit segment, a the smaller of the velocity limit v l   limit  and the entry velocity v l   entry  in the present segment is obtained, to draw running curve v l   h (s) corresponding to the maximum traction force of the train: 
     
       
         
           
             
               
                 v 
                 l 
                 h 
               
               ( 
               
                 s 
                 l 
                 lim 
               
               ) 
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           v 
                           l 
                           limit 
                         
                         , 
                           
                         
                           
                             if 
                             ⁢ 
                                 
                             
                               v 
                               l 
                               limit 
                             
                           
                           ≤ 
                           
                             v 
                             l 
                             entry 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           v 
                           l 
                           entry 
                         
                         , 
                            
                         others 
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
     A minimum velocities obtained at various positions are compared, and the running curve of the train is connected, i.e.: 
         v   l ( s )=min{ v   l   h ( s ), v   l   b ( s ), v   l   limit }. 
     Therefore, a minimum running time t i     c     run  of the train in the section may be indicated as: 
     
       
         
           
             
               t 
               
                 i 
                 c 
               
               run 
             
             = 
             
               
                 ∑ 
                 
                   l 
                   = 
                   1 
                 
                 L 
               
               
                 
                   ∫ 
                   
                     s 
                     l 
                     lim 
                   
                   
                     s 
                     
                       l 
                       + 
                       1 
                     
                     lim 
                   
                 
                 
                   
                     1 
                     
                       
                         v 
                         l 
                       
                       ( 
                       s 
                       ) 
                     
                   
                   ⁢ 
                   d 
                   ⁢ 
                   s 
                 
               
             
           
         
       
     
     Time t i     c     ,k  that the train executing the train number i c  arrives at the station k may be indicated as: 
     
       
         
           
             
               t 
               
                 
                   i 
                   c 
                 
                 , 
                 k 
               
             
             = 
             
               
                 t 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     p 
                     = 
                     1 
                   
                   P 
                 
                 
                   
                     t 
                     
                       
                         i 
                         c 
                       
                       , 
                       p 
                     
                     
                       r 
                       ⁢ 
                       u 
                       ⁢ 
                       n 
                     
                   
                   . 
                 
               
             
           
         
       
     
     In step S 6 , a planned train service to be executed by the affected train after turning around is determined according to the arrival time of each affected train at the turnaround stations. 
     A planned train service that can be executed by the affected train in a present departure condition is determined by comparing time immediately after the affected train arriving at a turnaround station on a preset routing and performing a normal turnaround, with time of a planned train service thereafter. 
     When the affected train cannot execute a planned train service in an affected train number set after turning around at a turnaround station of a highest priority, the affected train is scheduled to perform an midway turnaround at a station of a lower priority to execute other planned train service that may be canceled, thereby reducing the quantity of suspended train numbers. 
     Further, with a routing in the up direction as an example, Step S 6  includes the following specific implementation steps. 
     In step S 61 , for any affected train number i up   c , i up   c ∈T up   circle , namely the forward train and the turnaround station k∈T Circle   turnaround  on the routing, minimum time after the train turns around at the station k can be calculated according to the predicted time 
     
       
         
           
             t 
             
               
                 i 
                 up 
                 c 
               
               , 
               k 
             
           
         
       
     
     that the train executing the train number i up   c  arrives at the station k in Step S 5 , and shortest turnaround time r k   min  and passenger clearing time cl determined by a turnaround condition of the station k 
     
       
         
           
             
               t 
               
                 
                   i 
                   up 
                   c 
                 
                 , 
                 k 
               
               ′ 
             
             = 
             
               
                 t 
                 
                   
                     i 
                     up 
                     c 
                   
                   , 
                   k 
                 
               
               + 
               cl 
               + 
               
                 
                   r 
                   k 
                   min 
                 
                 . 
               
             
           
         
       
     
     In step S 62 , the down affected train number set is traversed circularly, and according to the predicted arrival time t i     down       c     ,k  of the down affected train number i down   c , i down   c ∈T down   circle  at the station k in Step S 5 , it is determined whether the train running the train number i up   c  can execute the planned train service i down   c  after turning around at the station k. If 
     
       
         
           
             
               
                 t 
                 
                   
                     i 
                     down 
                     c 
                   
                   , 
                   k 
                 
               
               ≥ 
               
                 t 
                 
                   
                     i 
                     up 
                     c 
                   
                   , 
                   k 
                 
                 ′ 
               
             
             , 
           
         
       
     
     the train i up   c  executes the planned train service i down   c  after turning around, the planned train service i down   c , i up   c  are removed from the affected train number set, and the planned train service i up   c  is added to the set T up   decide . If 
     
       
         
           
             
               
                 t 
                 
                   
                     i 
                     down 
                     c 
                   
                   , 
                   k 
                 
               
               &lt; 
               
                 t 
                 
                   
                     i 
                     up 
                     c 
                   
                   , 
                   k 
                 
                 ′ 
               
             
             , 
           
         
       
     
     a next round of circulation is performed continuously. If a train number meeting the condition cannot be searched in the down affected train number set and the train i up   c  does not depart when the jam occurs, the planned train service i up   c  is canceled and added to an up canceling set T up   cancel . Upon the completion of the circulation, remaining elements in the T down   circle  will not be replaced by rolling stocks for running. 
     Each train number will be provided with one rolling stock for running. When the jam occurs, since the down train cannot pass through the jam position, train numbers in the down direction cannot be run by the rolling stocks. In this case, rolling stocks in the up direction must turn around at an intermediate station to run the train numbers in the down direction. Therefore in Step S 62 , the rolling stocks in the up direction turn around to run the train numbers in the down direction. However, there still remains some train numbers in the down direction that cannot be run by the rolling stocks in the up direction, so remaining elements in the set are all suspended train numbers. 
     In step S 63 , according to a detaining principle, a detaining command is sent to a follow-up train of the train executing the train number i up   c , detaining time is set according to a turnaround mode at the turnaround station. In other words, if the turnaround mode of the train at the turnaround station on the routing is the platform-front turnaround, the follow-up train is detained at a rear station, until the train runs away from a turnout segment where the turnout for the platform-front turnaround is located. If the turnaround mode of the train at the turnaround station is the platform-behind turnaround, the follow-up train is detained at a rear station, until that the train runs away from the platform track of the turnaround station. In addition, if there is a train detained at the front station when the train executing the train number i up   c  departs, the planned train service is canceled; and the train number i up   c  is added to the canceling train number set T up   cancel , or otherwise, the planned train service departs lately at the origin station. 
     In step S 64 , if the other side of the jam segment is also provided with the train running routing, steps S 61 -S 63  are repeated, or otherwise, step E is performed. 
     As shown in  FIG.  5   , step E includes the following specific implementation steps. 
     In step E. 1 , the affected train number sets T up   line , T down   line  generated in Step S 42  are traversed to acquire a present position of each train in the sets. If the jam line does not exist between the present position of the train and the front nearest station, whether a front station is idle is further determined, or otherwise, a detaining command is sent to the train such that the train is detained at the present position. Supposing that i line  is the index of the set T up   line ∪T down   line , the state of the train is defined as: 
         S   i     I   =( F   i     line     ,T   i     line     ,D   i   line ) i   line   ∈T   up   line   ∪T   down   line    
     Where 
     
       
         
           
             	 
             
               
                 F 
                 
                   i 
                   line 
                 
               
               = 
               
                 { 
                 
                   
                     
                       
                         0 
                         , 
                            
                         
                           the 
                           ⁢ 
                               
                           front 
                           ⁢ 
                                
                           station 
                           ⁢ 
                               
                           of 
                           ⁢ 
                               
                           the 
                           ⁢ 
                               
                           train 
                           ⁢ 
                               
                           
                             i 
                             line 
                           
                           ⁢ 
                               
                           is 
                           ⁢ 
                               
                           not 
                           ⁢ 
                               
                           occupied 
                         
                       
                     
                   
                   
                     
                       
                         1 
                         , 
                           
                         
                           the 
                           ⁢ 
                               
                           front 
                           ⁢ 
                                
                           station 
                           ⁢ 
                               
                           of 
                           ⁢ 
                               
                           the 
                           ⁢ 
                               
                           train 
                           ⁢ 
                               
                           
                             i 
                             line 
                           
                           ⁢ 
                               
                           is 
                           ⁢ 
                               
                           occupied 
                             
                         
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
               T 
               
                 i 
                 line 
               
             
             = 
             
               { 
               
                 
                   
                     
                       0 
                       , 
                          
                       
                         the 
                         ⁢ 
                             
                         front 
                         ⁢ 
                              
                         station 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         train 
                         ⁢ 
                             
                         
                           i 
                           line 
                         
                         ⁢ 
                             
                         is 
                         ⁢ 
                             
                         not 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         turnaround 
                         ⁢ 
                             
                         station 
                       
                     
                   
                 
                 
                   
                     
                       1 
                       , 
                         
                       
                         the 
                         ⁢ 
                             
                         front 
                         ⁢ 
                              
                         station 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         train 
                         ⁢ 
                             
                         
                           i 
                           line 
                         
                         ⁢ 
                             
                         is 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         turnaround 
                         ⁢ 
                             
                         station 
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
               D 
               
                 i 
                 line 
               
             
             = 
             
               { 
               
                 
                   
                     
                       0 
                       , 
                          
                       
                         the 
                         ⁢ 
                             
                         front 
                         ⁢ 
                              
                         station 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         train 
                         ⁢ 
                             
                         
                           i 
                           line 
                         
                         ⁢ 
                             
                         is 
                         ⁢ 
                             
                         not 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         destination 
                         ⁢ 
                            
                         station 
                       
                     
                   
                 
                 
                   
                     
                       1 
                       , 
                         
                       
                         the 
                         ⁢ 
                             
                         front 
                         ⁢ 
                              
                         station 
                         ⁢ 
                             
                         of 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         train 
                         ⁢ 
                             
                         
                           i 
                           line 
                         
                         ⁢ 
                             
                         is 
                         ⁢ 
                             
                         the 
                         ⁢ 
                             
                         destination 
                         ⁢ 
                             
                         station 
                       
                     
                   
                 
               
             
           
         
       
     
     In step E 2 , as shown by the left part in  FIG.  5   , whether the front station of the train is occupied by other train is determined; and if the front station is occupied and is not the destination station, a detaining command is sent to the train such that the train is detained at the present position. If the front station is occupied and is the destination station, whether a storage line of the destination station is idle is further determined, the train at the destination station being often stored at platforms in up and down directions, a storage place of a turnaround line, etc.; and if the storage line is idle, the train is driven to the storage line of the station. If the storage line is full, whether the station has a line toward the depot is determined continuously; and if the train can be driven to the depot, the train is driven to the depot; or otherwise, the train is detained at the present position. If the front station is idle, the present train is continuously driven forward. 
     In step E 3 , T up   line , T down   line  are traversed to reacquire positions of trains executing the train numbers in the sets. If a train is being detained in a section now, the train number is added to a train position adjustment set T adjust . As shown by the right part in  FIG.  5   , for the train number i adjust ∈T adjust , whether a rear station is idle is determined. If the rear station is idle, the train executing the train number is driven backward to the rear station and clears passengers on the platform of the rear station. If the rear station is occupied by a train, the train at the rear station clears passengers and then is driven backward to the storage place such as storage line at the station or in the section, and then the present train is driven backward to the rear station platform to clear the passengers, as shown in  FIG.  6   . 
     In step E 4 , train numbers in the sets T up   line , T down   line  are traversed. If the present position of the train executing the train number is located at the destination station, the train number is added to the set T turning   line , or otherwise, is added to the sets T station   up , T station   down  according to the running direction of the train and sorted according to the departure time. 
     In step E 5 , first planned train service α up   1 ,α down   1  passing through the jam segment in the up and down directions upon the recovery of the jam are respectively searched according to indexes I up   first , I down   first  output in Step S 4 . Last train numbers β up   last ,β down   last  passing through the jam segment in the up and down directions before the jam are searched according to indexes I up   last ,I down   last . Supposing that the jam occurs at a position on the up line, trains can still normally pass through the down line. Supposing that an extra passenger train set is T temp , and an extra passenger train index is i temp , departure interval t interval  of the extra passenger train can be calculated according to the following equation: 
         t   interval =α down   1 −β down   last .
 
     Further, the quantity N store  of stored trains at the destination station in the down direction, including platforms and storage lines in the up and down directions, is calculated. The departure interval t depart  of the extra passenger train is calculated: 
         t   depart   =t   interval /( N   store +1) 
     The arrival time t i     temp     temp  of the extra passenger train i temp  at the destination station is: 
     
       
         
           
             
               
                 t 
                 
                   i 
                   temp 
                 
                 temp 
               
               = 
               
                 
                   t 
                   
                     α 
                     down 
                     1 
                   
                   arrive 
                 
                 + 
                 
                   
                     t 
                     depart 
                   
                   * 
                   
                     i 
                     temp 
                   
                 
               
             
             , 
             
               
                 i 
                 temp 
               
               = 
               1 
             
             , 
             2 
             , 
             … 
                
             , 
             
               N 
               store 
             
           
         
       
     
     E 6 : For the train number i down   decide ∈T down   decide , supposing that the arrival time at the turnaround station on the routing is 
     
       
         
           
             
               t 
               
                 i 
                 down 
                 decide 
               
               predict 
             
             , 
           
         
       
     
     and the running time from the turnaround station on the routing to the destination station is t run , the train number i* of the extra passenger train to be run can be calculated as: 
     
       
         
           
             
               
                 i 
                 * 
               
               = 
               
                 
                   arg 
                   
                     i 
                     down 
                     decide 
                   
                 
                 ⁢ 
                    
                 
                   min 
                   ⁡ 
                   ( 
                   
                     
                       ❘ 
                       &#34;\[LeftBracketingBar]&#34; 
                     
                     
                       
                         t 
                         
                           i 
                           down 
                           decide 
                         
                         predict 
                       
                       + 
                       
                         t 
                         run 
                       
                       - 
                       
                         t 
                         
                           i 
                           temp 
                         
                         temp 
                       
                     
                     
                       ❘ 
                       &#34;\[RightBracketingBar]&#34; 
                     
                   
                   ) 
                 
               
             
             , 
             
               
                 t 
                 temp 
               
               = 
               1 
             
             , 
             2 
             , 
             … 
                
             , 
             
               
                 N 
                 store 
               
               . 
             
           
         
       
     
     The train number i* is removed from the set T down   decide , the planned train service to be executed after the train number i* turning around at the turnaround station on the routing is added to the suspended set, and the train running the train number i* runs to the destination station in the down direction for passenger carrying. 
     In step E 7 , for a station in the up direction without trains passing through for a long time, the extra passenger train can be run to the station according to the line topology and the platform arrangement, including island platforms and side platforms, for passenger carrying. As shown in  FIG.  7   , since the jam occurs on the up line between the station  1  and the station  2 , a great number of passengers going to the up direction are stranded at the platform of the station  1 . According to the station type, there are the following two cases: If the station  1  cannot store the train, the down train performs passenger clearing and terminal switching on the down platform of the station  1 . The worker at the station  1  is then notified to organize the passengers going to the up direction to take the train on the down platform. The train carries the passengers on the down platform of the station  1 , and carries the passengers to the up line through the turnout on the crossover. If the station  1  can store the train or is connected to the depot, and there is the backup train on the storage line or in the depot, the backup train can be directly run from the depot or the storage line to arrive at the down platform, and the backup train carries the passengers going to the up direction, on the down platform. 
     In step S 7 , a quantity of planned train service canceled during the jam is acquired, and upon the recovery of the jam, a train resource is allocated according to the quantity of planned train service canceled during the jam, for train addition or storage. The planned train service which has been canceled refers to a planned train service that cannot be run according to the planned operation diagram, including a planned train service that must be canceled according to the detaining principle, a planned train service that cannot be run by the rolling stock during the jam, and a planned train service for which a corresponding train meeting the condition cannot be found after turning around at a station on the short routing. Train addition refers to increasing the number of trains in service. Train addition is to add the train through the depot or the storage line of the station to execute the planned train service without the rolling stock, thereby recovering normal operation of the train system by the end of the jam. 
     The specific implementation steps are as follows. 
     In step S 71 , in order to recover normal operation quickly by the end of the jam, a train addition set and a train storage set are respectively defined in the up and down directions. With the up direction as an example, the train addition set T add  and the train storage set T store  are defined. It is assumed that planned turnaround times of the train at destination stations in the up and down directions are t up   ori ,t up   des  respectively. The sets 
     
       
         
           
             
               T 
               up 
               recovery 
             
             = 
             
               
                 { 
                 
                   
                     a 
                     up 
                     1 
                   
                   , 
                   
                     a 
                     up 
                     2 
                   
                   , 
                   
                     … 
                     ⁢ 
                        
                     
                       a 
                       up 
                       
                         i 
                         up 
                         recovery 
                       
                     
                   
                   , 
                   
                     … 
                     ⁢ 
                        
                     
                       a 
                       up 
                       
                         
                           ❘ 
                           &#34;\[LeftBracketingBar]&#34; 
                         
                         
                           T 
                           up 
                           recovery 
                         
                         
                           ❘ 
                           &#34;\[RightBracketingBar]&#34; 
                         
                       
                     
                   
                 
                 } 
               
               ⁢ 
                   
               and 
             
           
         
       
       
         
           
             
               T 
               down 
               recovery 
             
             = 
             
               { 
               
                 
                   a 
                   down 
                   1 
                 
                 , 
                 
                   a 
                   down 
                   2 
                 
                 , 
                 
                   … 
                   ⁢ 
                      
                   
                     a 
                     down 
                     
                       i 
                       down 
                       recovery 
                     
                   
                 
                 , 
                 
                   … 
                   ⁢ 
                      
                   
                     a 
                     down 
                     
                       
                         ❘ 
                         &#34;\[LeftBracketingBar]&#34; 
                       
                       
                         T 
                         down 
                         recovery 
                       
                       
                         ❘ 
                         &#34;\[RightBracketingBar]&#34; 
                       
                     
                   
                 
               
               } 
             
                
           
         
       
     
     are defined, where T up   recovery , T down   recovery  are respectively up and down planned train service sets not affected upon the recovery of the jam. Since the rolling stocks cannot pass through the jam segment during the jam, train numbers during the jam are inevitably affected, while train numbers upon the recovery of the jam are not affected. 
     
       
         
           
             
               a 
               up 
               
                 i 
                 up 
                 recovery 
               
             
             ⁢ 
                
             and 
             ⁢ 
                  
             
               a 
               down 
               
                 i 
                 down 
                 recovery 
               
             
           
         
       
     
     each are a set index. Where, 
     
       
         
           
             
               
                 t 
                 
                   α 
                   up 
                   1 
                 
                 depart 
               
               ≤ 
               
                 t 
                 
                   a 
                   up 
                   
                     i 
                     up 
                     recovery 
                   
                 
                 depart 
               
               ≤ 
               
                 
                   t 
                   
                     α 
                     down 
                     1 
                   
                   arrive 
                 
                 + 
                 
                   t 
                   up 
                   ori 
                 
               
             
             , 
             
               ∀ 
               
                 
                   a 
                   up 
                   
                     i 
                     up 
                     recovery 
                   
                 
                 ∈ 
                 
                   T 
                   up 
                   recovery 
                 
               
             
           
         
       
       
         
           
             
               
                 t 
                 
                   α 
                   down 
                   1 
                 
                 depart 
               
               ≤ 
               
                 t 
                 
                   a 
                   down 
                   
                     i 
                     down 
                     recovery 
                   
                 
                 depart 
               
               ≤ 
               
                 
                   t 
                   
                     α 
                     up 
                     1 
                   
                   arrive 
                 
                 + 
                 
                   t 
                   up 
                   des 
                 
               
             
             , 
             
               ∀ 
               
                 
                   a 
                   down 
                   
                     i 
                     down 
                     recovery 
                   
                 
                 ∈ 
                 
                   T 
                   down 
                   recovery 
                 
               
             
           
         
       
     
     where, α up   1 ,α down   1  are first train indexes passing through the jam segment in the up and down directions by the end of the jam respectively, 
     
       
         
           
             t 
             
               a 
               up 
               
                 i 
                 up 
                 recovery 
               
             
             depart 
           
         
       
     
     is departure time of a train number having an index of 
     
       
         
           
             
               a 
               up 
               
                 i 
                 up 
                 recovery 
               
             
             , 
           
         
       
     
     t up   ori  is turnaround time of an up origin station, and t up   des  is turnaround time of an up destination station. 
     With the routing in the up direction as an example, according to Step S 6 , remaining elements in the reverse (down) affected train number set on the routing are not executed by the rolling stocks. For the train number i down   c ∈T down   circle , T down   circle  is the down affected train number set on the routing defined in Step S 5 , time 
     
       
         
           
             t 
             
               i 
               down 
               c 
             
             arrive 
           
         
       
     
     that the train executing the train number arrives at the destination is predicted. If 
     
       
         
           
             t 
             
               i 
               down 
               c 
             
             arrive 
           
         
       
     
     meets: 
     
       
         
           
             
               
                 t 
                 
                   a 
                   up 
                   1 
                 
                 depart 
               
               ≤ 
               
                 
                   t 
                   
                     i 
                     down 
                     c 
                   
                   arrive 
                 
                 + 
                 
                   t 
                   
                     i 
                     down 
                     c 
                   
                   des 
                 
               
               ≤ 
               
                 t 
                 
                   a 
                   up 
                   
                     
                       ❘ 
                       &#34;\[LeftBracketingBar]&#34; 
                     
                     
                       T 
                       up 
                       recovery 
                     
                     
                       ❘ 
                       &#34;\[RightBracketingBar]&#34; 
                     
                   
                 
                 depart 
               
             
             , 
           
         
       
     
     the train number i down   c  is added to the set T add , such that the normal operation can be recovered by the end of the jam, and further, elements in the T add  are sorted according to departure time. The canceled train number set T up   cancel  generated in Step S 6  is then traversed circularly to find the planned train service corresponding to each train number element in the set before the turnaround, and the planned train service are added to the train storage set T store . 
     In step S 72 , as shown in  FIG.  8   , the train addition set is traversed. For the planned train service i add ,i add ∈T add , if the train operation scheme generated in Step S 1  does not include the line which cannot form the running routing or T station   up =Ø, step S 73  is directly executed; or otherwise, the T station   up  is traversed according to Step E, and for the train number i station   up ∈T station   up , the train executing the train number runs the planned train service, corresponding to the train number i add , at the detaining position, and the trains i add ,i station   up  are removed from the set T add ,T station   up . 
     In step S 73 , for the train number i add ,i add ∈T add , whether the set T store  is empty is determined. If the set T store  is not empty, the set T store  is traversed, the train element i store ,i store ∈T store  runs the planned train service corresponding to the planned train i add , and the trains i add ,i store  are removed from the set T add ,T store . Or otherwise, whether a train can be added through the depot is further determined. If the depot includes a backup train, a dispatching command is sent to move the backup train from the storage to execute the planned train service corresponding to the train i add . If the set T add  still includes remaining elements, planed train numbers to be executed by the remaining elements after turning around at the destination station are added to the opposition T add  set. 
     In step S 74 , if the set T store  is an empty set, Step S 7  is ended; or otherwise, for the train number i store ,i store ∈T store , if the quantity of stored trains at the destination station does not reach the train storage limit when the train number i store  arrives at the destination station, the train executing the train number i store  is directly stored to the storage line; or otherwise, whether the line in the running direction of the train includes a line toward the depot is determined, and the train is driven to the depot if yes, and if no, the train and the follow-up train thereof are sequentially detained at a station behind the destination station, until the turnaround line of the destination station meets the turnaround condition. 
     The operation adjustment method for a metro train in a unidirectional jam according to the embodiment of the present disclosure automatically generates the train operation routing scheme in the jam, thereby improving the emergency handling efficiency and relieving the working pressure of the dispatcher. In addition, the present disclosure determines the priorities of the turnaround supporting stations, automatically generates up and down affected train sets in the line according to start and end time of the jam, predicts arrival time of each train in the sets at the turnaround stations of the different priorities, and determines the planned train service to be executed by the train after turning around. Further, in case of a line where the train running routing cannot be formed, the present disclosure acquires positions and other information of the trains on the line, intelligently decides detaining positions of the trains, calculates the departure interval of the extra train, and adds the extra train to arrive at the stations for passenger carrying. Furthermore, upon the recovery of the jam, the present disclosure automatically counts the quantity of up and down added or suspended trains, and schedules the train resources through the depot or the storage line of the station. Referring to  FIG.  9   , an embodiment of the present disclosure further provides an operation adjustment system for a metro train in a unidirectional jam, including: 
     an information acquiring unit M 1 , configured to acquire a jam position and a jam time; 
     a routing operation scheme generating unit M 2 , configured to generate a train operation routing scheme in the jam according to the jam position; 
     a priority determining unit M 3 , configured to set priorities for turnaround stations on a routing according to the train operation routing scheme, where the turnaround stations each are a turnaround supporting station, a turnaround station away from an origin station has a high priority, and a turnaround station close to the origin station has a low priority; 
     an affected train set generating unit M 4 , configured to generate an affected train set upon occurrence of the jam according to the jam position and the jam time; 
     a time predicting unit M 5 , configured to predict, according to the affected train set, arrival times of each affected train at the turnaround stations of the different priorities; 
     a planned train service determining unit M 6 , configured to determine, according to the arrival time of each affected train at a turnaround station, a planned train service to be executed by the affected train after turning around; and 
     a train resource allocating unit M 7 , configured to acquire a quantity of planned train service canceled during the jam, and allocate, according to the quantity of planned train service canceled during the jam, a train resource for train addition or storage. 
     As an optional implementation, the operation adjustment system for a metro train in a unidirectional jam according to the embodiment of the present disclosure further includes: 
     a train intermediate turnaround control unit, configured to schedule, the affected train to perform an midway turnaround at a station of a lower priority to execute another planned train service, when the affected train cannot execute a planned train service in an affected train number set after turning around at a turnaround station of a highest priority; 
     a detaining position determining unit, configured to determine a detaining position of a train on a non-routing line; 
     an extra passenger train departure interval control unit, configured to calculate a departure interval of an extra passenger train according to the jam position and the line topology information; and 
     an extra passenger train running control unit, configured to run the extra passenger train to arrive at a station on the line, where a running routing cannot be formed, to carry passengers. 
     According to the operation adjustment method and system for a metro train in a unidirectional jam provided by the embodiments of the present disclosure, at the beginning of the jam, the present disclosure uses the intelligent method to replace the method that the dispatcher manually determines the train operation routing scheme in the jam, and omits the conventional complicated operation of manually determining the affected train one by one. In the process of the jam, the present disclosure intelligently determines the train detaining position on the metro line without the running routing, and makes the train clear the passengers at the station as much as possible, thereby preventing the adverse effect of section passenger clearing on the passengers. Meanwhile, the present disclosure calculates the departure interval with information such as the line topology and the station type, and reasonably adds the extra passenger train to arrive at the station on the line for passenger carrying, thereby preventing a phenomenon that a great number of passengers are stranded due to no trains for a long time, and improving the QoS for the passengers as much as possible. Upon the recovery of the jam, the present disclosure automatically allocates the train resource with the depot or the storage line of the station, which greatly reduces the complicated and frequent operation on the trains in dispatch and command process of the trains. 
     Since the system disclosed in the embodiments corresponds to the method disclosed in the embodiments, the description of the system is relatively simple, and reference can be made to the method for details. 
     In this specification, several specific embodiments are used for illustration of the principles and implementations of the present disclosure. The description of the foregoing embodiments is used to help illustrate the method of the present disclosure and the core ideas thereof. In addition, persons of ordinary skill in the art can make various modifications in terms of specific implementations and the scope of application in accordance with the ideas of the present disclosure. In conclusion, the content of this specification shall not be construed as a limitation to the present disclosure. 
     The above embodiments are provided merely for an objective of describing the present disclosure and are not intended to limit the scope of the present disclosure. The scope of the present disclosure is defined by the appended claims. Various equivalent replacements and modifications made without departing from the spirit and scope of the present disclosure should all fall within the scope of the present disclosure.