Integrated Train Rescheduling and Rerouting during Multidisturbances under a Quasi-Moving Block System

It is known that it is critical for train rescheduling problem to address some uncertain disturbances to keep the normal condition of railway traffic. .is paper is keen on a mathematical model to reschedule high-speed trains controlled by the quasi-moving blocking signalling system impacted by multidisturbances (i.e., primary delay, speed limitation, and siding line blockage). To be specific, a mixed-integer linear programming is formulated based on an improved alternative graph theory, by the means of rerouting, reordering, retiming, and train control. In order to adjust the train speed and find the best routes for trains, the set of alternative arcs and alternative arrival/departure paths are considered in the constraints, respectively. Due to this complex NP-hard problem, a two-step algorithm with three scheduling rules based on a commercial optimizer is applied to solve the problem efficiently in a real-word case, and the efficiency, validity, and feasibility of this method are demonstrated by a series of experimental tests. Finally, the graphical timetables rescheduled are analysed in terms of free conflicts of the solution. Consequently, the proposed mathematical model enriches the existing theory about train rescheduling, and it can also assist train dispatchers to figure out disturbances efficiently.


Introduction
High-speed railway faced a rapid development in the world and showed competitive advantages in the passenger market, due to its better performance in safety, fast speed, and effectiveness. However, some inevitable disruptions deviate actual train running lines from its original planned lines in time/space horizons. As delay time degenerates satisfaction of passengers to some degree, it is essential to explore and carry out some optimal solutions/measures to recovery normal conditions of railway traffic.
In recent years, train rescheduling problem is one of hot research topics in railway operation and management. According to the state-of-art research outcomes, retiming, rerouting, reordering, and cancelling trains are mainly four kinds of measures [1], which are used to mitigate the negative influences resulted from disturbances or disruptions for the railway system. Furthermore, certain articles focused on the self-learning decision technology [2] or decision support system [3] to enhance the robustness of timetables by the means of iteratively evaluation from subsequent time horizons or the so-called offline railway traffic dispatching. ose strategies usually aim at minimizing operation conflicts and train delays for a single/double-tracked railway line/network area on operational conditions and accident characteristics [4]. However, train rescheduling and rerouting are often applied to a multistep formulation or multi-iterations, due to the complexity of this problem [5]. In order to solve the negative influence of disruptions/ disturbances effectively, mathematical formulation is proved to be one of common methods by describing railway operation as a series of constraints, e.g., integer programming (IP) [6] model, mixed-integer programming (MIP) model [7], and alternative graph (AG) model [8]. From the aspect of different granularities of railway infrastructure or trains activities, current existed optimal mathematical programming can be divided into two groups, i.e., macroscopic model and microscopic model. It is common that the microscopic models are applied on a (part of ) independent railway line impacted by disturbances or minor disruptions. On the other hands, the macroscopic is able to solve a wider railway area, e.g., a regional network, multitracked area, and a comprehensive central junction impacted by disruptions [9]. e macroscopic model treats railway stations and segments (i.e., the track between two consecutive railway stations) as basic independent units. However, the microscopic model takes signals along the rail track, switches, and block sections fully into consideration [10]. e macroscopic model is good at addressing some serious disruptions [11,12], but it may ignore some conflicts among trains or infrastructure, whose solution cannot be used for practical dispatching work directly.
Concerning this defect and characteristics of the quasimoving block signalling system, herewith, we mainly focus on applications related to microscopic models.
Alternative graph, a kind of microscopic model, is widely used to deal with the influence caused by mirror/slight disruptions/disturbances in a railway system. In the model, occupation relations between trains and block sections are seen as a job-shop scheduling problem, which can be figured out by alternative graph [13]. When alternative graph theory adopts rerouting in railway traffic management, some heuristic algorithms, i.e., tube search [14] or neighborhood search [15], are usually designed to overcome the HP hard problems. Furthermore, a variety of objective functions have been studied and analysed, which include the minimization of secondary (consecutive) delay and final delay (tardiness), combined with sophisticated multiobjective optimization framework in [16]. Meanwhile, a practicality and validity of alternative graph for reducing the delays are tested. Besides, most of those applications of alternative graph focus on the fixed-blocking system. As most as we know, few papers studied the moving blocking system [17] and quasi-moving block system [18]. Xu et al. [18] applied a set of alternative arcs to illustrate the characteristics of the quasi-moving block system in the Chinese high-speed railway system, but the rerouting was not involved in the model. Furthermore, the smooth of train speed curves is optimized by train control and traffic management at one iteration [19]. From the aspect of high-speed train rescheduling problem, the detailed train speed trajectories are considered [20], where only 2 trains operating on a part of railway line with two stations effected by speed restriction are studied in the experimental test. On the other hand, an MIP model based on a stochastic optimization method is established to handle disturbance on a high-speed railway [21]. Nevertheless, the microscopic model is subject to some defects in dealing with some serious disruptions in the railway system. In order to improve the generalization and robustness of real-time Chinese high-speed train rescheduling methods, it is essential to consider rerouting, once some track section is blockage.
Concerning above analysis, a mixed-integer linear programming (MILP) model based on an improved alternative graph related to Chinese high-speed railway traffic is established to enrich real-time train rescheduling methods by involving rerouting, retiming, and reordering simultaneously in this paper. e model complements the optimization model proposed by Xu et al. [18] which focuses on train rescheduling under speed restriction and neglects train rerouting. is paper makes the following contributions: (i) A mixed-integer linear programming (MILP) model is established to solve the real-time rescheduling problem for the Chinese high-speed railway traffic, under the combined influence of primary delay, the disruptions related to speed limitation, and the blockage of siding lines. e combination of disturbances is common in realworld railway operation activates and is studied seldom for its complexity, as most as we know.
(ii) We improved the general job-shop model to achieve train retiming, rerouting, and reordering, and speed management simultaneously, where the constraints related to alternative paths in railway stations are erected according to the "Big-M″ principle. Furthermore, the train entrance path and departure path in railway stations area are computed from the view of rail track circuit. (iii) Due to the difficulty of model, a two-step procedure with three kinds of scheduling rules are applied, such as space headway, headway time interval, and free-conflict rule. In the real-world high-speed railway experiments, it is proved that this solving method can figure out the solution with good quality in an acceptable computation time.
e detail content of this paper is organized as follows. Section 2 explains the disruptions studied and the basic methodology, and the proposed mathematical model improved is built to minimize delay times and times of changing routes in Section 3. Furthermore, the experimental test, solving method, and the result analysis are given in Section 4. Finally, conclusions and directions for future research are reported in Section 5.

Problem Description and Alternative
Graph Theory 2.1. Problem Description. Some inevitable perturbations, which are caused by some infrastructure failures, bad weather condition, or human errors, cause conflicts between trains or infrastructure. e abnormal condition is unable to meet the requirement of trains in full-speed, thus lower running speed in the area impacted is executed, or rerouting/ detour is applied to avoid the broken track area. In this paper, disturbances studied refer to the combination of primary delay, blockage of siding line (s), and speed limitation (s) in segment (s), illustrated in Figure 1: (1) Primary delay: before trains enter the given railway line, some delay times of trains were generated in their previous routes. In Figure 1, the actual running line of train no.2 (train numbers are listed at the bottom of Figure 1) switches from the red dash line to the red solid line, due to the input of primary delay. (2) Disturbances related to speed limitation: in high-speed railway system, once bad weather condition (i.e., heavy rain/snow, strong wind, and fog), switch/signalling failures, and any other infrastructure failures occur, one of common efficient response actions is to force high-speed trains to reduce their speeds in the impacted area. erefore, extra running time is generated by the speed limitation. e speed limitations studied can vary from different time spans, geographical spans, and different speed levels in this paper. ere are two speed limitation cases shown by the shaded rectangles in Figure 1, where trains nos. 5,6,7,8,10,13,14,15,16,17, and 18 are impacted. (3) Blockage of siding line in railway station: sometimes siding line in a railway station is blocked by infrastructure failures, maintenance activities, or passenger activities, so all trains cannot dwell on the impacted line for passenger alighting or boarding activities. us, the original plan for the usage of the impacted siding line should be adjusted to avoid potential conflicts or accidents, as well as their entrance path and departure path. As shown in Figure 1, when the siding lines blocked in station B (siding line 2) and station C (siding line 3), respectively, and trains nos. 5, 6, and 7 or train nos. 14, 15, and 18, which are planned to dwell in blockage of siding lines, have to change their siding lines in advance. Undoubtedly, making new arrival path and departure path are essential to adjust the siding line.
As mentioned above, the disturbances studied in this paper are a complicated combination of primary delay, speed limitation, and blockage of siding line. ey deteriorate the solving process of the problem and increase the probability of occurrence of conflicts between trains.

Alternative Graph eory and Job-Shop Scheduling
Problem. In general, train operation can be seen as a jobshop scheduling problem, and the occupation relationship between the train and the block section is similar with the inprocess of a good in a machine. In this way, high-speed rail line can be divided into many sections according to the signals or track circuits, and each section can only be utilized at most one train at the same time. When two more trains apply for one section simultaneously, there is a sequence decision process to decide which train has the priority to use the section. e latter train can only use the section after it is released by the former train. As shown in the top of Figure 2, there are three trains of the same direction going to pass a railway station and the scheduled paths of trains t 1 , t 2 , and t 3 are 1-2-3-6-7-8-9, 1-2-3-5-7-8-9, and 1-2-4-8-9, respectively. us, train t 1 and train t 2 are designed to stop and dwell at siding in Sections 6 and 5, respectively. Train t 3 is a passing-through train by main line (Section 4). Furthermore, the relationship between trains and railway infrastructure is represented in the bottom of Figure 2, which manages to transfer the railway operation activities into an alternative graph to optimize occupation sequence of trains. To be specific, the node presents railway block section, and the outgoing arc defines the movement of one train between two neighboring block sections, and the operation time of each movement (/arc) refers to the running time/entrance time/departure time/headway time of the outgoing section, which is the weight of each arc. In terms of arcs, the solid arc is called fixed arc, which can determine train routes according original plan, and the red dash arcs are the entrance deifications for trains, whose weights refer entrance times of trains scheduled by the timetable while the planned departure times are depicted by green dash arcs which require that trains cannot leave the station until the departure time. Last but not least, the pair of dark dash lines with a red Journal of Advanced Transportation circle at their crossing defines a pair of alternative arcs, which is used to determine the train order for the usage priority to the same rail section. In detail, for the potential conflicts caused by the same section occupation between different trains (such as Section 2 and Section 3 for those three trains in Figure 2), there are three pairs of alternative arcs which are designed to avoid potential collision between different trains. Considering the requirements of switches, sections, or signals, the headway time between two consecutive trains is treated as the weight of each pair of alternative arcs. Consequently, the headway time of alternative arcs ((2, 3), (2, 4)) and ((8, 9), (8,9)) values to required headway time. In terms of the best solution, the minimum of maximum time from entry node to exit node is the critical route (the blue dash line) to get the better solution with more capacity conservation. In respect of the requirement of the quasi-moving block system, a new space interval restrict is as well taken into account to keep safety distance for two continue trains in open track area. In particular, when a train wants to enter a given section with a certain speed, there must be enough empty sections corresponding to speed level in front of this train to keep safety in case of emergency braking. A series pairs of alternative arcs of each train were generated to demonstrate different speed levels for the train on a section [18]. For instance in Figure 3, the red, purple, origin, blue, and green dash lines represent speed level 1, 2, 3, 4, and 5, respectively, and the bigger the speed level is, the more the free section in front required. Obviously, this kind of alternative arcs exists in the segment between two consecutive trains.
Based on the alternative graph theory, all of constraints related to train operations are transformed into a network graph, and all the arcs in the network graph can be represented as mathematical constraints. e detailed formulation is shown as follows: Constraints (4) can be transferred into the following two constraints: where ∀i, j ∈ T, ξ ∈ B p, q ∈∈S: i≠j, q � p + ξ. e ambition of this model is to reduce traffic tardiness, shown by equation (1), where ω n and ω 0 denote the arrival time of the last train at the end node and the start time of the first train at the original, respectively. In the final solution, each train finds a path, which consists of nodes and arcs, and the minimum of the longest path is the critical path, which  determines the quality of rescheduled timetable directly. Constraints (2) relate to fixed arcs, which is used to control the running time/arrival time/departure time for each train on each section (the fixed arc), where, f p, q denotes the minimal running time to pass through one section, and ω i,q is the start time when train i utilizes block section q. F is the set of fixed arcs, and (p, q) represents a fixed arc. In this way, the requirements of trains' entrances of the original, primary delays, and departure times can be formulated by those constraints. On the other hand, alternative arcs are described by constraints (3), where δ pq and δ hk represent minimal headway time interval to keep trains use the sections of potential conflicts separately. It should be noted that A is the set of alternative arcs and ((p, q) and (h, k)) is a pair of alternative arcs. Furthermore, there is a disjunctive relationship in constraints (3); in other words, only one subconstraint is tight constraint during solving process. Considering the features of train speed and their safety braking distance, constraints (4) are used to deal with those alternative arcs (i.e., arc (10,11), (10,12), (10,13), (10,14), and (10,15) in Figure 3), with speed levels in the open track area. To be specific, the distance headway to be kept free between two consecutive trains depends dynamically on the speed level of the following train. We thus require that at least ξ block sections should be kept free between two consecutive trains, when the second train runs at the speed level ξ (β ξ,LaterTrain,q �1). β ξ,LaterTrain,q denotes that the later/ second train runs on section q with speed level ξ. With the involvement of the big-M structure, constraints (5) and (6) are implemented in the actual mathematically model, where μ i,j represents the order of train i and j in the open track area, and if μ i,j � 1, train i is in front of train j; otherwise, μ i,j � 0. In this way, the basic model can be applied to reschedule trains in a quasi-moving block signalling system.

High-Speed Train Rescheduling Model
Integrating Rerouting e basic alternative graph can be applied to train rescheduling with a quasi-moving block signaling system. e influence of multidisturbances makes it harder to reorder, reroute, and retime trains efficiently, due to the complex combinatorial problems. According to the stateof-art outcomes related to train rescheduling, there are few models which can solve multidisturbances and train speed control simultaneously. Concerning actual demanding of high-speed railway operation, an MILP model based on the alternative graph is proposed in this paper.

Assumption and Decision Variables.
First of all, some notions in this model are illustrated in Figure 4. And it should be noted that the meaning of rerouting in this paper refers to choose alternative siding lines and arrival/departure paths in one/one more railway station area for the impacted trains. Before formulation, we made assumptions as follows: e parameters of trains operation, railways lines, and technical activities are described as follows: t, i, j (t, i, j ∈ T) denote indexes of trains, and T is the set of trains. s, p, q (s, p, q ∈ S) denote indexes of block sections, and S is the set of block sections. A and F denote sets of alternative arcs and fixed arcs, respectively. ξ denotes the speed levels of the train, i.e., 1, 2, 3, 4, and 5, and the bigger the value is, the faster the train runs. y is the index of speed limitation case, and M is a big enough integer. e decision variables in the model are shown as follows: ω t, s : the start time when train t utilizes block section s. z t, s : binary decision variable, i.e., if z t, s � 1, train t uses section s; otherwise, section s is not used. Section s is among sections in railway station area, i.e., (t, s) ∈R t, station , where R t, station is the set of block sections in station area which can be used by train t. λ i, j, p, q : binary variable which describes the sequence between a pair of trains (i, j) for occupations of alternative arc (p, q). If λ i, j, p, q � 1, the time when train i uses section p is earlier than that of train j or vice versa. β ξ, t, s : binary variable which represents whether train t runs on section s with the ξth speed level. If β ξ, t, s � 1, train t runs on section s with ξth speed level, or vice versa.
x t, s, y : binary variable which demonstrates whether the start time ω t, s is later than the start time of the yth speed limitation in impacted section s (s ∈ S y ). If x t, s, y � 1, ω t, s ≤ T 1y , or vice versa.
x t,s,y : binary variable which demonstrates whether the start time ω t, s is earlier than the end time of the yth speed limitation in impacted section s (s ∈ S y ). If x t, s, y � 1, ω t, s ≥ T 1y , or vice versa. dev t, s : binary variable which represents absolute deviation between z t, s and original planned z 0 t,q (which is the original usage plan of section q in normal condition). If dev t, s � 1 ((t, s) ∈R t, station ), train t changes its usage plan for section s, or vice versa.
de t : summation of dev t, s for train t.

Model Formulation concerning Siding Line Resetting.
In normal condition, the arrival and departure paths in railway stations are almost fixed once the original timetable given. In this way, passengers and railway staff can wait for the train or arrange routes for the trains in advance. However, due to the influence of disturbances, some unavailable routes have to be changed to reduce tardiness in the traffic. In order to avoid inconvenience caused by changing train routes frequently, to minimize total times of changing siding lines is considered in the objective of this model, as Journal of Advanced Transportation 5 well as tardiness of trains. e proposed objective is listed as follows: objective: min : where ω t, end denotes actual arrival time of train t in the end of given railway track, and e t , c t , and dt t are entrance time, planned travelling time, and primary time of train t, respectively, which are known in advance. e first summation in equation (7) denotes the tardiness of traffic, and the second summation represents the times of changing routes. Furthermore, in order to balance the delay time and times of changing routes, the weight α is considered in the following research.

Constraints Related to Rerouting.
Once the siding line is blocked, setting alternative routes for impacted trains is essential to keep their routes available. Illustrated by Figure 5, there are 3 alternative paths (i.e., paths 1, 2, and 3, denoted by blue dash lines) for trains to stop, and the corresponding alternative graph is in the bottom half of Figure 5. As the uncertainty of paths leads the uncertainty of potential conflicts, we set constraints as the following two groups: where δ p, q denotes the minimal headway time between trains i and j. ose two constraints are used to determine the first section among alternative paths. In the other words, the start of arc is certain and the end of arc is uncertain. Constraints (8) and (9)      Journal of Advanced Transportation switches, joints, or siding lines. Specially, section q is alternative in the arc (p, q), e.g., section 5 in the arc (4, 5) or section 7 in the arc (4, 7) in Figure 5. Furthermore, for those arcs with two uncertain nodes, the relative constraints are built as follows: Due to uncertainty of former section (which is mentioned in constraints (8) and (9)) of one arc, two route-selection variables, z j, p and z i, p , are added in constraints (10) and (11). ose conflicts researched are possible to appear, only when two trains choose the same route in station area. For example, if the following train wants to utilize section 8 in Figure 5, only trains which apply for section 8 indeed are involved by above constraints, and only those trains can cause potential conflicts in section 8. To sum up, those two constraints mainly exist in arcs related to siding lines or departure paths.
In this way, constraints (3)∼(4) and (8)∼(11) are able to cover all possible conflicts resulting from the utilization application for the same section or its conflicting section (s).

Constraints about Train Technical
Activates. Due to the uncertainty of train route, the running times for the impacted trains have to be changed according to the selected sections among their final routes. As those sections are mainly in the railway station area, the constraints related to the running times refer to the requirement of departure time and dwell time: where f p is the minimal running time of section p; d t, p is the dwell time of train t on section p. In detail, constraints (12) represent requirements of dwell times for the potential changeable siding lines. Constraints (13) and (14) deal with running times for uncertain sections selected in arrival/ departure paths, respectively.

Constraints about Disturbances.
Regarding to multidisturbances, the following constraints take them into consideration. In detail, the primary delay is considered by constraints (15), where dt t is the primary delay time of train t. Constraints (16)- (18) relate to disturbances about speed limitations, where T 1y and T 2y denote the start time and end time of the yth speed limitation, respectively, and S y is the set of sections impacted by yth speed limitation, and B m,y refers to the maximum speed impacted by the yth speed limitation. ere are two speed limitation cases in Figure 6, where the relative parameters and variables are displayed. To the best of our knowledge, almost no research concerns several speed limitations in one train rescheduling case. In this paper, different combinations of speed limitations can be formulated by this model. e variables x t,s,y and x t,s,y are used to identify the impacted trains precisely with respect to geospatial direction and time direction. As shown in Figure 6, once the train running line passes through the rectangle, the trains are impacted and the overlapped part (the red dotted line) indicates the scope of influence. At the same time, those two variables both value to 1 at the same time. In this way, B m,y in constraints (18) is a contributing factor: x t,s,y M ≥ T 2y − ω t,s , ∀t ∈ T, s ∈ S y ∩ R t , y ∈ [1, nu],  Furthermore, constraints about siding line blockage are illustrated by the following constraints: z t,p � 0, ∀t ∈ T, p ∈ R t,station , (19) ω t,q ≤ z t,q M, ∀t ∈ T, q ∈ S r , (t, q) ∈ R t,station , (20) s∈S r z t,s � 1, ∀t ∈ T, s ∈ S r , r � 1, 2, 3...., Constraints (19) require that all trains cannot stop on blocked section p in the set of blockage sections (R t,station ). Constraints (20) set the start times of those alternative sections unselected by train t to 0. Only one route in one railway station area is chosen for each train, so constraints (21) require that the sum of z t, p related to all siding lines and main lines is equal to 1. Constraints (22) and (23) combine to measure times of changing sections, compared to the original planned route. In this way, the value of dev t, q is always a nonpositive number, which is described by constraints (24).
In addition to above constraints, train control related to speed adjustment is still taken into consideration. ose relative constraints refer to constraints (5)∼(6) in the introduction part for the alternative graph.

Two-Step Solution Approach with Different Solving
Strategies. Train rescheduling problem is demonstrated to be one of hardest combinatorial optimization problems (D' Ariano et al. 2007), and computational times mainly depend on the granularities of formulations. As the proposed model is a microscope model, the amount of constraints and variables reaches easily very large numbers: the number of variables related to speed grows with a function 5 nm being n the amount of trains and m the amount of sections. Secondly, the constraints related to distance headway (speed selection) of each pair of trains play an even larger role, increasing with 5n 2 m-5m. Furthermore, the alternative routes of trains make the model more complicated, so the raw amount of constraints related to route selection increasing with np (np-1), where p is the number of alternative routes. In conclusion, the solving progress for this complex problem is obviously challenging.
As the proposed model is a linear programming, we apply the IBM ILOG CPLEX 12.8.0 as a computation platform, by adjusting constraints with different scheduling rules in a two-step solving process. Our experiments are all executed on a machine with an Intel (R) Core (TM) i7-7700 processor CPU 3.60 GHz and 8.00 GB memory. Considering the difficulty in solving process, a two-step solving program with three kinds of scheduling rules are applied, such as space headway, headway time interval, and free-conflict rule. By comparison with the corresponding solution qualities and computational times, headway time interval and free conflicts are adopted in the first step and the further optimization is executed in the second step with scheduling rule related to dynamic space headway (i.e., the core idea comes from the quasi-moving blocking system): (1) Space headway (SH): this strategy is used to control the spatial distance between two consecutive trains according to the real-time speed of the following train, with the ambition to make full use of given capacity. In the other words, the dynamic safety braking distance is considered in the model and constraints (5)∼(6) are available. is strategy is finally applied in the second step in the solving process. (2) Headway time interval (HTI): this strategy makes consecutive trains keep the same time interval, without considering the real space interval. In other words, it requires that there are at least δ time units between occupation times for the same section between two consecutive trains. Consequently, constraints (25)∼(26) are involved in the model. ey are considered in the first step in the solving process: (3) Free-conflict rule (FCR): this strategy refers to ignore the conflicts in the open track area to release the amount of constraints related to train control. To be specific, constraints (5)∼(6) are not involved in the model. and it is supposed that trains run with full-speed regardless of the minimum safety space headway. In the case of computational time, this strategy is applied in the first step in the solving process.

Case Description.
In this section, we test the proposed model on a timetable considering homogeneous high-speed traffic, where 20 trains with the same maximum speed (300 km/h) have different stop patterns in a time span from one hour and a half, shown by Figure 7. In this figure, the lines with green wave belts are trains' running lines with speed levels, and the green wave belt indicates the full-speed of train on the open track area. e infrastructure is a part of China high-speed rail line with 6 stations and a total of 370 block sections, whose length is about 1360 meters per section operated by a quasi-moving block signalling system. e detail parameters related to train speed level are listed in Table 1, where the running time is running time threshold 8 Journal of Advanced Transportation that the train passed through one block section with the given speed level. And the other parameters of rail line and infrastructure are listed in Figure 8. All the trains are planned to stop at station C and station D. Primary delays affect all trains' running and follow a 3-parameter Weibull distribution (i.e., β h � 1.48, η h � 560, and c h � 205). e total primary delay mentioned in this paper is 1019 seconds shown in Figure 8. Furthermore, there are four disturbance cases, which contain two speed limitations and two siding line blockages, occurring simultaneously, and their parameters, i.e., sections impacted, start time, and end time, are demonstrated in Figure 8.

Computation Time Analysis
. e proposed MILP model has a huge number of constraints, growing quadratically with the amount of trains and the amount of sections. And due to the involvement of siding lines adjustment, there are several alternative arrival paths and departure paths for each train at each station.
us, the involvement of train rerouting makes the NP-hard problem (i.e., train rescheduling) more complicate, and obtaining a fine solution in a limited computational time is hard. Furthermore, high-speed train speed control puts an increasing combinatorial load on the solution process.
Considering the three difficulties in solution computation, we devised an efficient and effective two-step solution process to determine quickly an initial solution by ignoring conflicts in segments in the first step. In other words, the HTI and FCR scheduling rules are applied in the first step, and only conflict detection and resolution in station area are addressed. In order to keep the lower bound feasible, the train order of departure at the previous station (λ i, j, p, q ) should consist with the order of arrival at the next station. In the second step, certain values of decision variables, i.e., z t, s , λ i, j, p, q , dev t, s , and μ i, j, η obtained from the first step are known before computation, while start times of sections in station area (ω t, s ) obtained in first step are put into the second step. In this way, train arrival/departure paths, train orders, and start times in railway station are fixed before computation in the second step, and then the SP scheduling rule is used in this process. Based on a lot of experimental tests, it is proved that most of cases can be solved within 600 seconds, e.g., 500 s for first step and 100 s for the second step.
In order to verify solutions, quality of the solution approach, a benchmark solving approach referred by [18], is considered, where train speed is fixed in the first step and then dynamic space headway is executed secondly. e performances of those two methods are compared through an experimental test, whose parameters are described in Figure 9, but all trains run on time without primary delays. e detailed performance of solutions with computational time is shown in Figure 9, where the solid line denotes the objective value calculated by the proposed approach, while the dash line represents that of the benchmark approach, and red line is about the first step and dark line relates the second step. As a result, the solid curve shows that the objective value is around 8500 when computation time is about 500 seconds, but when computation time is 1700 seconds, the value of dash line responds to 115000, which is much higher than the value computed by proposed approach, although the computation time taken by benchmark approach is 2 times longer. In a word, the proposed method can get a much better solution within an acceptable time, compared with the benchmark solution approach. e application of HI scheduling rule can accelerate the solving process efficiently. In addition to that, 32 cases with different speed limitations and with/without siding line blockage are tested to study the performance of the solving method   proposed. If the computation time is 600 seconds, all of them can be solved to get the best or optimal solutions within 5% optimality gap or less, and it is proved that the setting of disturbances listed in Figure 8 is the most difficult to be solved to get the best solution with 3% optimality gap under the given computation time.

Results Analysis
Based on the data listed in Figure 8, solutions solved by the model are analysed in this part. First of all, we analysed the speed level of the given trains, which are plotted in Figure 10.
In detail, 20 broken lines represent speed levels (vertical axis) of 20 trains along their routes (horizontal axis). It is noted that the value of vertical axis is cycle number with 5 units divided by each horizontal line. In detail, the start value is speed level 1 and the end is speed level 5 along the upward direction in each cycle period. In terms of undulations of lines in railway station area, trains have to decelerate and accelerate their speed to aboard and alight passengers. In this way, it is not only that trains speed are reduced according to the equipment of disturbance of speed limitation, but also the capacity of high-speed railway is maximized by the proposed method.
Regarding to the graphical description for the rescheduled timetable, solutions of the first-step and second-step computation are given in Figure 11 and Figure 12, respectively, where 20 trains' running lines with five kinds of colors denote different speed levels. More precisely, red, purple, yellow, blue, and green colors in running lines correspond to 1, 2, 3, 4, and 5 levels of train speed levels, respectively (i.e., the detail refers Table 1) trains are both executed to avoid some potential conflicts, resulting from primary delay or infrastructure capacity.
Comparison with Figures 11 and 12, the arrival or departure times of trains at railway stations are almost the same, but train orders and running times on sections are different, as well as conflicts between trains. To be specific, there are some crosses or overlaps between trains' running lines in the dash circles in Figure 11 and an obvious overlap between trains in the bottom picture in Figure 11, considering the crosses in open track area or overlaps reflect conflicts caused by overpassing of trains in segment. is phenomenon must be forbidden in realistic railway operation, as it means at least two trains occupy the same section at the same time. Nevertheless, those two consecutive trains run on the segment with the maximum speed and minimum headway distance in the bottom picture in Figure 12. As a result, the solution computed by the first-step computation under the control of headway time interval and free-conflict principle is not feasible and reliable sometimes. Given the unreliability of the solution, the further measure should be carried out by the train scheduler or diver, if needed.
With application of the strict headway space rescheduling rule in second-step solution, the running time of each train in each block section and its real-time speed level are coordinate and the final solution is feasible enough. All in all, the proposed mathematical model and the solving method with the two-step algorithm are able to address train rescheduling problem under the influence of the multidisturbances effectively.
Concerning blockages of siding line in station C and station D, a case without siding line blockage is used as the benchmark. Figure 13 shows negative influence of siding line blockage, especially in arrival path areas in station C. It should be noted that two dash lines in Figure 13 represent the siding lines in the geographical axis. Compared the timetable adjusted with siding line blockage (shown by Figure 13) with that without siding line blockage (shown by Figure 14), it is noticeable that some trains (in Figure 13) have to wait outside station until the former train departure, due to the limited capacity of available siding lines.
Considering the shortage of capacity caused by siding line blockage in railway station, the waiting times of trains in front of station C related to those two cases are analysed in Figure 15, where each column denotes waiting time of each train, i.e., the blue one relates to Figure 13 and the red one relate to Figure 14. Compared with values of blue columns and yellow columns, some of blue columns are much higher than yellow columns. To be specific, the waiting times of train 8 th , 9 th , 10 th , and 14 th in front of railway station are longer than that without blockage, and around 700 seconds are generated due to blockage of siding line in station C.

Conclusions and Outlook
Based on above content, the proposed MILP model is able to deal with the problem caused by primary delays, speed limitations, and blockages of siding lines at the same time, and the characteristics of the quasi-moving block signalling system are considered in the model, which make train control possible along with train rescheduling. It succeeds in extending the alternative graph method mentioned by [18] and making rerouting possible along with retiming and   reordering, although the signalling system of high-speed railway is more flexible and dynamic. Concerning above experimental tests, we draw conclusions as follows: (1) e proposed MILP model can deal with multidisturbances (i.e., multispeed limitations, primary delay, and siding blockage) in one iteration efficiently, by means of controlling train speed, changing orders of trains, adjusting running times of trains, and resetting arrival/departure paths in railway station area, so it is a comprehensive mathematical optimal method. (2) e given two-step solution approach can accelerate the solving process by ignoring the conflicts between trains (i.e., overtaking) in segments, in the other words, those constraints related to headway time interval are considered in the railway station area firstly. e comparison with a benchmark algorithm is executed, and the priority of the proposed method is verified. Furthermore, all the trains are distributed with reasonable routes and given accurate speed levels from the original to its destination.
ere are some shortages remained to improve for future research. First of all, the comparisons with current other methods related to train rescheduling will be under investigation to study the effectiveness and generality of the proposed method. Secondly, there are still a high-speed railway network controlled by a quasi-moving block system is still needed to explore by the proposed method, in terms of dimension of research objective, N-track railway line, and so on. At last, concerning the disadvantage of commercial solving software, a more powerful and efficient heuristic algorithm should be designed and applied to solve the NP-hard problem, in order to meet the requirement of real-world railway operation.

Data Availability
Some or all data, models, or code that support the findings of this study are available from the corresponding author upon reasonable request.

Conflicts of Interest
e authors declare that there are no conflicts of interest regarding the publication of this paper.