A Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm

This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.


Introduction
Generally, the station is composed of bottleneck and arrivaldeparture lines which is vital for trains arriving, departing, running, shunting operations, and so on.The efficiency of railway transport faces challenges due to increasing passengers and freight transportation demands.In order to enhance the capacity of the railway station, operators can be dedicated to adding the number of track lines, which requires plenty of manpower, materials, and financial resources obviously.By contrast, making proper arrangements of trains' routes at bottleneck and arrival-departure lines based on existing track lines can save lots of resources and achieve the same effect.Hence, attention is paid to arrange the trains' routes reasonably in the station to improve the operational efficiency and reduce the operation costs [1,2] (D' Ariano et al., 2008).
In general, the railway planning process is divided into strategic level, tactic level, and operational level.In this paper, we focus on the tactic level, especially on the timetable optimization and railway track allocation/train routing in a complex high-speed railway station.At present, the optimization of the train routing problem (TRP) in the railway station is mainly based on the mathematical optimization model.Some studies aimed at the complicated bottleneck of the railway station, as D' Ariano et al. [3] considered that reducing trains' collisions at the bottleneck can improve punctuality without decreasing the capacity usage of the lines and a detailed model for conflict resolution and different algorithms was illustrated.Based on the robustness of routing assignment, Jia et al. [4] proposed the optimization of routing utilization at bottleneck.Kang et al. [2] presented a bottleneck optimization model thereafter to enhance the capacity by reasonably arranging routes and turnouts.Other parts of the researches concentrated on the problems of arrival-departure lines occupancy.For example, Billionnet [5] considered assigning trains to the available tracks at a railway station instead of taking into account the collision at the bottleneck.Caprara et al. [1] proposed a 0-1 integer programming model to describe the routing problem of trains at the station platform; moreover, the quadratic objective function was linearized and solved by integer linear programming.Besides, an optimization model is presented by Qiao et al. [6] based on the train schedules to arrange suitable arrival-departure lines for passenger trains.Furthermore, the research of the TRP 2 Mathematical Problems in Engineering with joint optimization of bottleneck and arrival-departure lines is also found in the literature.For instance, Zwaneveld et al. [7] considered both bottleneck and arrival-departure lines and proposed a 0-1 programming model to arrange trains passing the railway station.But the problem only at smallscale railway stations can be solved by branch-cut method.Based on the graph theory, Corman et al. [8] rearranged train routing in real-time unpredictable events and found the best solution using truncated branch-and-bound and tabu search algorithms.
In the past few decades, there have been limited researches on TRP in high-speed railway stations.Most studies were associated with the train timetable problems [9][10][11].TRP is tantamount to selecting a sequence of tracks for a train from its origin to destination, with the objective of minimizing the sum of travel time, the total operating cost, and/or increasing the capacity of railway network.Xu et al. [11] defined the objective function to minimize deviations between trains' arrival time at the destination and original timetable.The optimization model proposed by Li et al. [12] aimed to minimize the total delay of all trains in the railway network.Liu et al. [13] developed a mathematical model whose aim is minimizing the total occupation time of station bottleneck sections to avoid train delays.In addition, some research focused on the optimization by keeping the most balanced utilization arrival-departure lines like Qiao et al. [6].One of the objective functions considered by Zhou et al. [14] and Zhou et al. [10] was to minimize the total travel time on the track.Apart from this, the most important constraint should be taken into account was the spatiotemporal interactions between each train operation route in the TRP (D' Ariano et al., 2008) [2,4,12].Furthermore, it should be considered that trains which occupy the same arrival-departure lines should satisfy a headway time constraint [1,6].Zhou et al. [14] and Corman et al. [8] proposed that trains should stop for enough time to ensure the transfer time of passengers and crews.What is more, Fang et al. [15] analyzed a comprehensive survey on different models by a clear classification based on the different scale, infrastructures, objectives, and constraints.
It is well known that the TRP is the NP-hard problem [16] and unlikely to get an exact optimal solution in a short computational time under the large-scale and complex situation.In order to get an approximate optimal solution rapidly, many studies proposed different heuristic algorithms based on different strategies.Corman and Meng [17] introduced the online dynamic models and algorithms for the rail traffic management in order to provide punctual and reliable services.Specifically, Ahuja et al. [18] considered the issue of railway scheduling and presented a heuristic algorithm to get the approximate optimal solution in short time.Carey et al. [19] studied the large-scale problem that involved lots of train schedules and routes and proposed heuristic algorithms to solve it.Liu et al. [13] designed a hybrid algorithm between genetic algorithm and the simulated annealing algorithm.In recent years, for the sake of further improving the computational speed and quality of solution, some studies have proposed improving heuristic algorithms.He et al. [20] proposed an improve branch-and-price algorithm to deal with the large scale integer programming.Zhou et al. [10] used an efficient train-based lagrangian relaxation decomposition to the simultaneous passenger train routing and timetabling problem.Additionally, some studies used commercial software like Qi et al. [21] who obtained for an approximate optimal solution within 30s by a local search heuristic algorithm using CPLEX solver and Xu et al. [11] who solved train routing and timetabling problem with switchable rules by CPLEX solver with OPL language.
Besides that, some studies dealt with the integer programming problem using tabu search algorithm, as Isaai and Singh combined the heuristic with tabu search and simulated annealing search control strategies to deal with the train timetabling problem.Similar, Corman et al. [8] rearranged trains' routes based on the graph theory and got the approximate optimal solution of the combination of truncated branch-and-bound and tabu search algorithms.Li et al. [12] proposed a tabu search algorithm, and they pointed out that the algorithm relies on a better initial solution; otherwise the result obtained is not stable.In addition to this, Goh et al. proposed a tabu search with sampling and perturbation to generate feasible solutions.The tabu search algorithms and variable neighborhood are applied by Samà et al. [22] to improve the solution for the real-time management problem of scheduling and routing trains in complex and busy railway networks.
As can be found in numerous studies, there were few elaborate mathematical models to describe TRP and further study on TRP in the network of the high-speed railway station.In this research, with the motivation of greatly improving the solving efficiency of TRP in the network of the high-speed railway station, we intend to provide the following contributions: (i) Describe a railway network by defining the turnout node and the arrival-departure line node on account of the traditional layout of the railway station, which is regarded as a directed graph.The nodes are regarded as vertices, and the actual connection of the lines is regarded as arcs.The railway station is divided into three parts and the connection sets are built to satisfy the connection relationship of them.
(ii) According to the given nominal timetable, the calculation methods of trains occupying each track are elaborated.Then formulate the TRP in the network of the high-speed railway station as a multiobjective mixed integer nonlinear programming model, in which both are considered the potential collisions of trains and the convenience for passengers' transfer in the high-speed railway station.In the proposed model, it is not only minimizing train departure time deviations with the most balanced utilization of arrival-departure lines but also minimizing the total occupation times of all tracks.
(iii) The TRP is NP-hard problem.Therefore, it is very unlikely to devise a polynomial-time (exact) algorithm for it.In order to get an approximate optimal solution rapidly, a heuristic algorithm is proposed based on the tabu search to solve the large-scale TRP in the network of the high-speed railway station.
(iv) Numerical examples are implemented to demonstrate the effectiveness and efficiency of proposed method.By taking advantage of an efficient tabu search algorithm, we can solve the model rapidly for a small case.The results we obtained from the algorithm are the same as obtained directly from CPLEX solver.
In the large-scale case involving 17 arrival-departure lines and 46 trains between 16:00∼19:00, the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer.
The remainder of this paper is organized as follows.Section 2 presents a detailed description of TRP problem.Section 3 provides the mathematical formulation for the TRP in the network of the high-speed railway station.Section 4 deals with the development of a heuristic algorithm based on the tabu search.Section 5 describes the instances used and provides computational results.Finally, some conclusions and further research directions are presented in Section 6.

Layout of Railway Station.
We consider a railway station as illustrated in Figure 1.This railway station consists of bottlenecks and some arrival-departure lines whose length is  푠 .The left side of the station in Figure 1 is defined as left bottleneck whose length is  푙 .The route set of it is  = { 1 ,  2 , ⋅ ⋅ ⋅ ,  푘 1 }.Similarly, the right side is defined as right bottleneck whose length is  푟 .The route set of it is  = { 1 ,  2 , ⋅ ⋅ ⋅ ,  푘 2 }.The bottleneck involves tracks where trains arrive and depart.For instance, an outbound train arrives from node  1 and stops at arrival-departure line.In Figure 2(a), there are 4 possible routes for the outbound train that arrives from node  1 , whose set is  1 = { 1 ,  2 ,  3 ,  4 } in the left bottleneck.Similar, an inbound train departs from arrival-departure line to the node  2 .There are also 4 possible routes for the inbound train departs from node  2 as shown in Figure 2(b) whose set is  2 = { 5 ,  6 ,  7 ,  8 }.So the route set of the left bottleneck is  =  1 ∪ 2 = { 1 ,  2 , . . .,  8 }.In particular, at large stations, the number of routes in the bottleneck may be larger than the number of arrival-departure lines due to the existence of multiple crossovers and turnouts.The route set of arrival-departure lines is  = { 1 ,  2 , . . .,  푚 }, which contains I, II, 3, and 4 as shown in Figure 1.
Normally, track lines are divided by insulation joints.In this paper, the turnout node and the arrival-departure line node are defined as follows to describe the railway station.
1. Turnout node: the intersection of the lines in the station.It includes turnouts (as shown in Figure 1,  5 and  6 , etc.), crossovers (as shown in Figure 1,  7 , etc.), and the position of signal which located in the entrance of the bottleneck (i.e., the boundary point of the station).
2. Arrival-departure line node: the connection points of bottleneck and arrival-departure lines in the railway station, namely, the signal position of the entrance of the arrival-departure lines (i.e.. the nodes  8 ∼ 10 in Figure 1).
During the operation, the outbound trains can only arrive from turnout node  1 and depart from turnout node  3 as shown in Figure 1.Similar, the inbound trains can only arrive from turnout node  4 and depart from turnout node  2 .However, no matter in which direction trains are, any of arrival-departure lines can be occupied.Hence the physical network of the railway is regarded as a directed graph.The nodes are regarded as vertices, and the actual connection of the lines is regarded as arcs.Let  denote the set of all vertices and  denote the set of all arcs in the network.

Trains.
We consider a set of trains in both directions.The set of trains is denoted by  = { 1 ,  2 , ⋅ ⋅ ⋅ ,  푛 }, in which  1 = { 1 ,  3 ,  5 , ⋅ ⋅ ⋅ } is the set of outbound trains and  2 = { 2 ,  4 ,  6 , ⋅ ⋅ ⋅ } is the set of inbound trains.The heterogeneous trains are taken into account.We assume that these trains are categorized into two types: slow trains and fast trains.In addition, there are shunting operation beside train reception and departure operations.The speeds of shunting trains are slower than the ordinary trains.
In addition, some of the fast trains pass the station without stopping while some trains stop at platform for passengers to alight or transfer.Different trains' stop time may be different, whether they are fast or slow trains.As we all know, the speed of trains is not a constant, while it changes with the driver's braking when the train would stop at the platform.Similarly, the speed of trains does not increase suddenly when departing from the platform.Therefore, the additional time that provides trains' acceleration and deceleration is considered.At the same time, the length of trains is also taken into account to meet the actual situation.

Conflicts and Potential
Conflicts.The conflicts of tracks which trains occupy are the most imperative problem to be solved in TRP.In other words, trains cannot occupy the same track at the same time.A conflict occurs whenever trains traverse the same track and do not respect the minimum time interval at the bottleneck and arrival-departure lines.What is more, it would result in potential conflicts.These situations are discussed separately as follows.

Train Routing Conflicts at
Bottleneck.The bottleneck consists of channels with some turnouts, crossovers, and other facilities, which may cause spatial intersections of trains' alternative sets of routes, especially when some unpredictable events or interruptions occurred.So it is an important task for train dispatchers to avoid the train collision and to assure the trains passing the tracks orderly.The conflicts between two trains in the bottleneck mainly occurred at the intersection of the track segments (the segment  1 ∼ 2 as shown in Figure 3) and the intersection of crossovers (the point  3 as shown in Figure 3).
In Figures 3(a) and 3(b), trains  1 / 2 travel in the same/reverse direction, and the collision occurs at the track segment between nodes  1 and  2 .Similarly, the collision  occurs at the track segment at the node  3 when the trains  2 and  3 travel in the same and reverse direction, respectively.The methods to dissipate conflicts will be depicted in detail in Section 3.

Train Routing Conflicts at Arrival-Departure Lines.
When two consecutive trains plan to occupy the same arrivaldeparture line in the railway station, they should follow a headway time to suit the limited infrastructure capacity.That is, one train occupies this arrival-departure line a specific headway time later than the other one.As shown in Figure 4, there are two trains  1 and  2 .The origin and destination of train  1 are A and C, respectively, and the origin and destination of train  2 are B and C. Obviously, if the route  1 is assigned to  1 and  2 occupies route  2 in a short interval, this would cause a conflict at platform 1.In this case, the latter train should stop and wait until the previous train leaves from the platform 1 for a reasonable headway time.It may cause the latter train to be behind the schedule time and even to have second delay in severe cases.But if the train  2 occupies route  3 , the conflicts would be avoided and the train operational efficiency would be ensured in the railway station.
Therefore, if the two trains' departure interval is smaller than the headway time  1 푚 , it is better to arrange them at different lines.Just as illustrated in Figure 4, if the difference of two trains' departure time is bigger than the headway time  1 푚 , the same arrival-departure line can be arranged.

Potential Conflicts of Train Routing.
It is noteworthy that only considering trains' routing at bottleneck and headway time at arrival-departure lines cannot completely meet the requirement of safe operation.There are further potential conflicts.
For instance, the outbound train  1 would stop at arrivaldeparture line II from outbound main line while the inbound train  2 would depart from line 3 to the inbound main line (as shown in Figure 5(a), the yellow dotted line and the blue dotted line represent the route of trains  1 and  2 , respectively).There is no time provided to avoid the potential conflict area (the red circle area in Figure 5), since it is not in the context of the two conflicts described above.Therefore, a time separation should be adopted even though two trains do not occupy the same track; i.e.,  1 first arrives and then  2 departs later or  2 first leaves and then  1 arrives later, the same as shown in Figure 5(b).It is necessary to set constraints so that two consecutive trains arrive the potential conflict area in a time separation.In addition, when two trains are in the same direction, the conflicts between them are not potential conflicts.Just as shown in Figure 6,  1 and  2 are outbound trains.It is apparent that there exists a conflict in the red circle area.However, due to the conflicts at the bottleneck between the two trains, the constraints are set to avoid the collision; namely, conflicts in the rad circle area are also dissolved.Therefore, the potential constraints we discussed are only among the reverse trains.

The Calculation Methods of Track Occupation Time.
In this paper, not only is the train routing chosen as the decision variables but also optimized the schedule of trains to start entering the station according to the planned schedule when trains depart from the station.Thus the time for trains passing the conflict tracks needs be calculated.In addition, the convenience factors of passengers transferring at station are taken into account, and the associated trains' dwell-time intersection should be long enough.As a consequence, the trains' travel time in different track sections should be clearly calculated.
To our knowledge, as long as a track segment is occupied, the lines, the fouling posts, and the signals are also occupied at the same time.We elaborate the calculation of the occupied time and the end time of occupied of trains passing through the left bottleneck, the arrival-departure lines, and the right bottleneck in turn.The occupied trains at the bottleneck are divided into two situations: train reception and train departure, whose calculated method of train occupied time of tracks is same.So only take the outbound trains as an example to explain in detail.

The Calculation of Trains Travel Time and the End Time
of Occupied at the Bottleneck.For outbound trains  ∈  1 in the left bottleneck  ∈ , they start to enter the station at  푐 +  푠푒푡푢푝 푐 and pass each node with speed V 푐 .The track is unlocked after their tails pass the end node of the track section.So the trains' occupied time of each track segment is calculated as follows: where  푎 is occupancy time of a certain track segment  and  푎 is length of the track segment .Thus, the travel time of outbound trains  ∈  1 from the left bottleneck signals to the arrival-departure lines is calculated with the following: where  푙 is length of routes which is sum of each track segment in the left bottleneck and  푐 is the length of the train .In Figure 7 Take the railway station in Figure 1 as an example to calculate the occupancy time of one route of outbound train in the left bottleneck.As shown in Figure 7, it is assumed that the train arrives from the node  1 and stops at line I (i.e., the green dashed line in Figure 7).Then the travel time of train  from the left bottleneck signal to the line  is calculated as The occupied time of outbound trains departing from the station through the right bottleneck is calculated as Similarly, the travel time of trains departing from the line  and leaving to node  3 through the right bottleneck (i.e., the blue dashed line in Figure 7) is calculated as For the inbound trains  ∈  2 , the calculation of trains travel time and the end time of occupied at right bottleneck are as follows, respectively: The travel time in the left bottleneck when the train departs from the station is calculated by

The Calculation of Trains Travel Time and the End of
Occupied Time at Arrival-Departure Lines.The occupation of arrival-departure lines can be partitioned into two kinds.
One is that some fast trains pass the station directly without stopping at the platform, and the other one is that trains stop for a time interval before leaving the station.
In the first case, the train's travel time through arrivaldeparture lines can be obtained directly according to the length of the arrival-departure lines and the speed of the trains: In the second case, we consider the deceleration time  푑 푐푠 when the speed of train  decelerates to 0 to stop at the platform and the acceleration time  푎 푐푠 when the train's speed increases to V 푐 from 0 to leave the station.Then the travel time on the arrival-departure lines is  푐푠 =  푑 푐푠 +  푎 푐푠 +  푠 푐푠 .For better expression in both cases, we adopt a binary variable  푠 푐푠 to imply if train  would stop at arrival-departure line .Then the travel time on the arrival-departure lines can be calculated as follows: The departure time from the arrival-departure line  of the stopped trains is: for the inbound trains  ∈  2 : The end of occupied time at the arrival-departure lines is given at the same time: for the inbound trains  ∈  2 : In general, the relationship of train's occupied time on the track can be illustrated clearly in Figure 8. Figures 8(a   indicates train's position when passing through the station, and the abscissa shows the time correspondingly.The red line represents trains that do not stop at the station and the blue one represents trains that would stop at the station.

Problem Description and Assumption.
TRP is regarded as a pivotal component in providing high efficiency of operation, which can greatly affect the quality of train schedules and passengers service levels.In practice, TRP is often based on train planning problem, often predesigned by predicted demands and service capability.As mentioned above, the description of the physical railway station is restated in this paper.Moreover, the character of trains, the conflicts which may occur, and the calculation of trains' travel time are introduced.In general, the problems we studied are the train routing optimization problems which involve lots of heterogeneous trains and many safety constraints in a complex high-speed railway station.
Mathematically, we use binary decision variables to represent whether a train is allocated on a track segment or not.When a set of feasible decision variables are determined, the routing for each train can be specified concurrently.Then an integer decision variable is quoted to ensure punctuality of trains based on planned timetable.One of the objectives discussed in this paper is to minimize trains' total travel time on the tracks in the station to ensure trains passing the station in a short time.It reduces the energy consumption and ensures the punctuality rate.It is worth noting that the route is shortest if train is allotted on the sidings close to main lines.Otherwise, the distance would increase if the train is arranged to stop on others, especially the furthest arrival-departure line from the main line.Nevertheless, it would cause serious wear and tear on the tracks if one arrivaldeparture line is often occupied repeatedly.Therefore, it is of importance to maintain the occupancy balance of the arrivaldeparture lines, which is reflected in the number of trains on the arrival-departure lines and the duration time.Finally, the punctuality of trains is considered so that it would not create trains delay to reduce the operation efficiency.
Therefore, a mixed integer programming model is built based on the constraints of safety and station ability.The details and algorithm are discussed in Section 3. The assumptions throughout this paper are listed as follows.
Assumption 1.The trains pass the station at a constant speed V 푐 if they do not stop at the platform.For stopped trains, the additional acceleration and deceleration time of heterogeneous trains are same, respectively, for simplification.Assumption 2. Due to the safety requirements of the fouling post, trains must stay within the fouling post.So we assume that all trains satisfy the safety requirements of the fouling post to ensure that the tails of trains would not collide.Assumption 3.Each train has a planned departure time and cannot depart from the station earlier than the predetermined departure time.

Notations.
Regarding the trains, input data includes set/index, velocity, length, and other property parameters.In addition, it also covers relationship between trains, the time of trains' setup, travel, and dwelling.Based on this basic input data of trains, we can further determine the relationship between trains and routes and trains occupation time and occupation end time, also predetermined as inputs of our model.As for the railway network, its input data involves the set/index of nodes and arcs, the set of connection of track segments, the length of different areas, and safety time interval and headway time.The details are summarized in Table 1.
The outputs of TRP compose the traverse route sets of trains when they arrive at and depart form the station and the starting time of trains to pull into the station, as well as their precedence relation of two trains at the same track.The details are introduced in Table 2.
Binary parameters, if there are conflicts between routes  1 and  2 , Binary parameters, if arrival-departure lines  1 and  2 are close to the same platform, Binary parameters, if there is transfer relationship between trains  1 and

Mathematical Model of TRP in High-Speed Railway Station
In this section, we put forward a mathematical model for TRP in a high-speed rail station.To depict this problem more clearly, the following discussion will concentrate on specifying each part of the models, including the objective functions and systematic constraints.

Objective Function
and repaired, the utilization proportionality of the arrivaldeparture lines should be kept when arranging trains' routes.
The served trains provided by the arrival-departure lines include passing trains and stopping trains.As can be seen, the equilibrium is not only reflected in the number of trains, but also in the train's travel time that involves dwell time on the arrival-departure lines.It is converted into the mathematical expression and represented by the sum of variances of the number of trains and their dwell times: In the objective function (13), m is the number of arrivaldeparture lines and  is the number of trains (i.e., the number of arrival-departure lines that are occupied).∑ 푐∈퐶  푐푠  푐푠 denotes the sum of all trains' travel time on the arrivaldeparture lines.The first half of the function (13) shows the number of trains' occupancy balance and the second half means that the trains' travel time are relatively balanced on the arrival-departure lines.

Minimize the Trains' Total Travel Time.
Trains' travel time on the tracks is another important factor in the optimization of the train routing problem.So the second optimization objective function is minimizing the trains' total travel time in the station: In ( 14), the front part indicates the total travel time of outbound trains  ∈  1 ; the last half expresses inbound trains  ∈  2 total travel time in the railway station.In order to ensure the satisfaction of passengers, the train reception and departure operations are punctuality and cannot be adjusted drastically.Compared to this, the shunting operations can be adjusted to be relatively flexible.At the same time, the punctuality requirements are different for different types of trains (passenger trains and freight trains).Therefore, the weight coefficient  푐 is introduced to indicate the significance of each train.

Minimize the Trains' Total Departure Time Deviations.
For railway operators, the punctuality of trains is necessary for the order and efficient operation of the station.Meanwhile, it is also the most concern of passengers.Therefore, the third optimization objective considered in this paper is minimizing the trains' total deviations between the trains' starting time to enter the station and the planned timetables of trains pulling in In (15), the same  푐 weight coefficient is quoted. 푐 is the starting time of train  pulling into the station, and  * 푐 represents the planned entering time of trains which can calculate through pregiven timetable.
In summary, the linearly weighted compromise approach is adopted to handle the objective functions, and the objective function studied in this paper is In the objective function (16),  푖 ( = 1, 2, 3) are the weight coefficients with 0 ≤  푖 ≤ 1 ( = 1, 2, 3) and meet the equation requirement:  1 +  2 +  3 = 1.It is set to distinguish the importance of different objectives.The specific values are given in the cases study.

Constraints of Conflicts and Dispersion.
There are two types of routing conflicts: on the overlap track segments of trains' routes and the potential conflicts at turnout nodes beside arrival-departure line.More detailed formulation of each set of constraints is provided as follows.
(1) Conflicts and Dispersion of Trains' Routes on Track Segments.The conflicts on the overlap track segments of trains' routes are discussed into the conflicts at left bottleneck, arrival-departure lines, and right bottleneck when trains go through the railway station.Here we build mathematical formulas to illustrate how to mitigate the conflicts.
If there is a conflict owing to the delay or interruption, that is, there would be hostile routes of trains, railway operators should take certain measures to ensure trains pass the hostile track segments orderly and efficiently.Figure 9 is a schematic diagram of routing conflicts of the same/reverse direction.The conflict occurs at track segment  1 ∼ 2 of trains  1 and  2 , and track insulation joints  1 ,  2 and  3 .When the same direction conflicts take place (i.e., as shown in Figure 9(a)), if  1 is arranged first, train  2 can enter after the tail of train  1 passing the insulation joint  2 to suit the safety requirement.Similar, when the reverse direction conflict occurs as shown in Figure 9(b), train  2 can enter after the tail of train  1 passes the insulation joint  2 if train  1 is arranged first; train  1 can enter after the tail of train  2 passes the insulation joint  2 if train  2 is arranged first.
In accordance with the progress of the trains, each possible conflict is considered and stated as follows.
(i) Routes Conflicts at the Left Bottleneck.As described previously, we first discuss two outbound trains' routes which have overlapped tracks when arriving at the station from the left bottleneck.It should be formulated as where  푐표푛 푐 1 푐 2 is the time from train  1 starting pulling into the station to the tail of it passing through the insulation joint  2 , i.e., the time interval of trains to enter the railway station.The value can be obtained by (1).Similarly,  푐표푛 푐 2 푐 1 is the time from train  2 starting entering to the tail of it passing through the insulation joint  1 .
Considering the order and relationship between trains and routes which are chosen, the constraints can be expressed as In the constraints ( 17) and ( 18),  푐 1 ,푐 2 is a binary variable that indicates the trains' precedence relationship passing through the overlapping tracks.If train  1 precedes train  2 ,  푐 1 ,푐 2 = 1.Otherwise,  푐 1 ,푐 2 = 0. M is a sufficiently large number.Not only the safety time interval but also the routes' selection relationship are taken into account.So in constraints (17) and (18), if a route  1 is chosen in the left bottleneck by outbound train  1 ( 푖 푐 1 푙 1 = 1, else,  푖 푐 1 푙 1 = 0) and a route  2 is occupied by outbound train  2 to enter the station ( 푖 푐 2 푙 2 = 1, else,  푖 푐 2 푙 2 = 0) and, in the meantime, there are spatial conflicts between routes  1 and  2 (if there are spatial conflicts between routes,  푙 1 푙 2 = 1.Otherwise,  푙 1 푙 2 = 0.), then the safe time interval  푐표푛 푐 1 푐 2 should be held between entrance time of trains  1 and  2 .
Secondly, the situation for two inbound trains that depart from the station through the left bottleneck is similar.That is, after the front train leaving the station, the latter train can depart from the arrival-departure lines through the left bottleneck after the safe time interval 0 must hold which are equivalent to the following constraints: The occupation ending time on the arrival-departure lines can be calculated by ( 6) and (12), which is  푓푒푛푑 푐 =  푐 +  푠푒푡푢푝 푐 +  푟 푐푠 +  푐푠 .Thirdly, for two opposite direction trains, an outbound train  1 would arrive at the station through the left bottleneck while an inbound train  2 would depart from the arrivaldeparture lines; then they may cause route conflicts which can be avoided by the following constraints: (ii) Routes Conflicts at the Right Bottleneck.Similar to the conflicts in the left bottleneck, the trains routing conflicts for two inbound trains, two outbound trains, and two opposite direction trains should satisfy the following constraints in the right bottleneck.When two inbound trains arrive at the station through the right bottleneck, the route conflicts may occur.Therefore, we set following constraints to avoid collision: For two outbound trains which would depart from the station through the right bottleneck For two opposite direction trains, considering the order and relationship between trains and routes which are chosen, the constraint can be Among these six constraints, the safe time interval  푐표푛 푐 1 푐 2 should be kept.The same with the discussion above, the occupation end time on the arrival-departure lines can be calculated by ( 6) and ( 12).
(iii) Routes Conflicts on the Arrival-Departure Lines.The train routing conflicts which may occur on the arrival-departure lines has been described in Section 2.Here we propose the algebraic formulas to resolve the conflicts.If the difference of two trains' departure time is smaller than the headway time  1 푚 , in other words, if train  1 occupies the arrival-departure line first, train  2 can enter from bottleneck after the end of occupied time at arrival-departure lines of train  1 and after a headway time: 푐푠 for the outbound trains and for the inbound trains  푓 푐 =  푒푛푑 푐푟 +  푑 푐푠 +  푠 푐푠 which can be calculated according to ( 9) and ( 10) described in Section 2. According to Assumption 1, the additional acceleration and deceleration time of trains that run in different speed are same, and the formula is converted to Thus the constraints should be satisfied as follows: The value of  푓 푐 can be calculated from (3), ( 6), (9), and (10).
(2) Potential Conflicts and Avoidance.In small scale stations, there are a small number of arrival-departure lines and platforms that any of them can be occupied by trains.As shown in Figure 5, the outbound train  1 may occupy the arrival-departure line 3 to stop when the operation is busy.In this case, it may cause potential conflicts between opposite direction trains if they choose the arrival-departure lines on the same side.Thus measures should be adopted to avoid the two trains arriving the potential conflicting area simultaneously.The trains' order should be determined by the decision variable  푐 1 ,푐 2 .In Figure 5(a), if train  1 arrives at the station through the left bottleneck, train  2 can depart from the arrival-departure line 3 after the tail of train  1 passes the potential conflicting area after a safety time interval  2 푚 (i.e., the inequality  푓 푐 2 −  푒푛푑 푐 1 푙 −  2 푚 ≥ 0 should be satisfied).Similar, if train  2 leaves the station first, after a safety time interval, train  1 can enter the station through the left bottleneck after the tail of train  2 passes the potential conflicting area (i.e., satisfying To sum up, we use the following formula to avoid potential conflicts: It is suitable for solving the potential conflicts as shown in Figure 5(a).Constraints (33) and (34) are used to solve the problems of the situation in Figure 5(b): (34)

The Limited Capacity
Restrictions.This constraint set considers the limited infrastructure capacity.Obviously, a train can only utilize one route at bottleneck and arrivaldeparture lines.To guarantee the safe operation of trains traveling in the railway station, the constraints are listed as follows: Constraint (35) ensures that only one arrival-departure line can be occupied by one train.Constraints (36) and (37) guarantee that each train must utilize one and only one route to traverse the left and right bottleneck for each outbound train, respectively.Similarly, only one route in the right and left bottleneck can be chosen by each inbound train through constraints (38) and (39), respectively.

Connectivity of Train Routing Constraints.
Trains' routing connectivity should be ensured.That is, for an outbound train, the route occupied at the left bottleneck should connect to the arrival-departure line which must connect to the route in the right bottleneck.Otherwise, it is conceivable that the train cannot pass the discontinuous route through the station.Therefore, these restrictions can guarantee the feasibility of trains' routes.
where  푙 푠 and  푟 푠 are sets of left and right bottleneck routes connected to the arrival-departure line  respectively.

Restrictions of Passengers' Transfer at Station.
It represents one of the concerns of railway operators to facilitate passengers transfer to improve the service level.Nowadays, various large scale high-speed rail stations have set up shortcut channels in the railway station to offer convenience for passengers' transfer in station.This enables passengers to achieve their traveling purpose in a shorter time and cost.There are transfer elevators at each platform in some large and well-equipped facilities stations.And passengers can quickly find the corresponding ticket gate directly through the information from the ticket or the electronic screen.
Two trains that may have transfer relationship are discussed in this paper.A constraint is set to keep the two trains stopped at two near platforms to ensure that passengers or crews transfer in a comfortable time: At the same time, the target train should stop at the platform for a time interval  3  푚 to ensure that all passengers complete transfer comfortably, which is required to allow passengers alight from one train, move to the corresponding platform track, and board the other train.So we obtain the following constraints: Constraint ( 47) indicates that all trains cannot depart from the station before the planned timetable, where integer decision variable  푐 indicates the start time measured in minutes to enter the station of train .Constraints ( 49) and (50) ensure that those decision variables are 0-1 variables.
Herein, the train routing problem for heterogeneous trains can be formulated as the following model, which is essentially a mixed integer nonlinear programming model: 17)-( 50). (51)

Solution Methodology Based on Tabu Search
The number of decision variables of the model will increase greatly as the increasing number of optional routes of trains which is NP-hard problem mentioned in Ahuja et al. [18] and Carey et al. [19].In the proposed model, the situation scale of the values of variables  is huge as the number of them is great.For instance, when  = { 1 ,  2 } and  = { 1 ,  2 ,  3 }, there are 2 6 kinds of values of where each element of  may take 0 or 1.It would cost a significant amount of time to solve the problem under a larger case and may not even get the optimal solution in a reasonable computation time.Apart from this, the mathematic model is nonlinear and there is no algorithm which can solve such problems accurately at present.Therefore in this section, we design a tabu search algorithm stepwise to obtain the nearoptimal solution based on the nonlinear characteristic of the model for the TRP with a large scale railway station.
The tabu search algorithm is a deterministic metaheuristic on account of local search [24], which makes extensive use of memory for guiding the search.From the incumbent solution, non-tabu moves define a set of solutions which called the neighborhood of the incumbent solution.The best solution is selected as the new incumbent solution at each step and stored in the tabu list to avoid being trapped in local optima and re-visiting the same solutions.When the number of solutions achieves the length of the tabu list, the earliest one which entered the list is released.The algorithm stops until reaching the termination conditions.
In our model, we notice that constraints ( 17)-(34) and constraints (45) and (46) are nonlinear.It is obvious that if the variable  is determined, the model (51) would become an integer linear programming model that determines the departure time of each train.For such mathematical programming model, there are already mature algorithms, such as branch and bound and cutting plane, etc. Taking constraints ( 17) and ( 18) as an example, the decision variables  푖 푐 1 푙 1 and  푖 푐 2 푙 2 are binary variables, and  푙 1 푙 2 is known binary parameters according to wether there are conflicts between routes  1 and  2 .There are two cases due to the value of decision variables.The first is that the value of any variables or parameter is 0 among the decision variables and parameter  푙 1 푙 2 .Then the left side of the formula is 0, and the constraint is effective apparently.The second case is that the values of them are 1, then the constraints were satisfied if the formulas are satisfied inside the brackets.
Hence the inequality constraints are obviously satisfied in the first case.And in the second case, the constraints turn into an integer linear constraints, not only for constraints ( 17) and ( 18), but for other constraints in the model ( 51).
As a result, we set the decision variable  as the tabu object.Based on that, through generating neighborhood of incumbent solution and searching a good solution at each step, we can gradually approach the near-optimal solution.
To deal with the problems mentioned above in the model presented in this paper, we discuss the setting of the neighborhood of incumbent solution, the selection of initial solution, and the scheme of algorithm in detail below.

Neighborhood of Incumbent Solution.
The establishment of incumbent solution neighborhood is crucial for a better direction of the search, which affects the quality of solution at each step.In our model, we hope that trains would have the shortest travel time, which performances the shortest routes.As mentioned, the travel distance would increase if trains are arranged on the sidings far from the main line.In our problem, we need to determine a good quality initial solution and tabu move to reach the near-optimal solution.Therefore we generate two different neighborhoods of the incumbent solution, respectively:  푖푛푖푡푖푎푙 : based on the incumbent routing set, which contains routes in bottleneck and arrival-departure line, the two adjacent sidings and corresponding routes in bottleneck are accommodated into it.That is, the neighborhood contains not only the incumbent arrival-departure lines of trains and corresponding routes in left and right bottleneck, but also the two adjacent sidings and corresponding routes in the bottleneck.
푡푎푏푢 : the neighborhood of incumbent routing set for tabu move contains  푖푛푖푡푖푎푙 , which involves four adjacent siding and corresponding routes in bottleneck.Besides, remove the situation that trains with close departure times and occupy the same sidings.
In general,  푖푛푖푡푖푎푙 is used to determine a good quality initial solution, whose scale is smaller.And we need to search the solution roughly in a short time.In contrast to this,  푡푎푏푢 is a wide neighborhood in order to avoid empty Mathematical Problems in Engineering neighborhoods as far as possible while avoiding to search in all possible situations.It is thus worthwhile distinguishing the different neighborhood structures.

Determined of Initial Solution.
As describe above, the quality of initial solution is crucial for the performance of tabu search.A good initial feasible solution can greatly improve the speed of searching for the optimal solution.If we randomly assign a set of routes as the incumbent solution, it would take a lot of time to search, and the quality of the near-optimal solution cannot be guaranteed.The objective value is much smaller obviously than the previous strategy if starting from a good incumbent solution.So in this paper, we can get a feasible solution of train routing set through our prior knowledge of trains' character and construction of the railway station which is just a preliminary program.In view of this, the corresponding routing set solution is selected which satisfies constraints and at the same time reaches the minimum objective function in the solution neighborhoods at next step.Then regard this solution as a new incumbent solution.By cycling this step until the iterative termination condition is satisfied, a batter initial solution of the tabu search algorithm is determined.The procedure is summarized in Table 3.

The Algorithm Scheme.
In this paper, we first obtain the initial routes based on method describe in Table 3.Then we generate the neighborhood  푡푎푏푢 of the incumbent solution to reduce the range of the search.And we solve the corresponding MLP in the  푡푎푏푢 to choose the best solution.Finally, the best solution is chosen as the new incumbent solution and stored in the tabu list.The steps shown in Table 3 are repeated in sequence recursively.We summarize the procedure of this heuristic algorithm in Table 4.
In this case the tabu list contains the situation of all trains' routes.The aspiration criterion is set to reinforce the local search to avoid losing an admirable state.That is, if a solution in the tabu list is largely superior to others, then reconsider and search it as a new incumbent solution.The other solutions are forbidden in the tabu list to avoid being trapped in local optima or infinite loops.

Numerical Experiments
In this section, two sets of numerical experiments are implemented to show the performance of our proposed model.Specifically, for the models formulated, a small case is implemented to demonstrate the application and performance, in which CPLEX solver is used to obtain exact optimal solution which compares with the near-optimal solution obtained by the proposed heuristic algorithm based on the tabu search, while in large scale case experiment, we apply the proposed heuristic algorithm to the Jinan West high-speed railway station, in which a tabu search algorithm is designed in PYTHON 2.7.13 to obtain the near-optimal solutions of trains routing on a Windows 10 platform with Intel(R) Core(TM) i7-8550U CPU and 8G RAM.

A Small-Scale Case Study.
In this case, we consider a two main  and II lines railway station as shown in Figure 10 which is outbound and inbound direction, respectively.In the left bottleneck, there are a reception line  1 of outbound trains, a departure line  2 of inbound trains, and a locomotive waiting track  1 .At the same time, there are 6 arrival-departure lines, of which arrival-departure lines II, 3 and 4 next to a platform.In the right bottleneck, there are 4 lines including a departure line  1 of outbound trains, a reception line  2 of inbound trains.and two locomotive waiting tracks  2 and  3 .The distances between connection points in this railway station are shown in Table 5.
In order to test the effectiveness of the proposed models and solution algorithms, we derive a set of instances in this small-scale rail station with different numbers of trains (the type of trains is exhaustive to demonstrate the versatility and correctness of the model).Table 6 shows the origin and destination of each train, as well as the characteristic parameters of them.Trains  1 and  4 are outbound trains, while  3 is inbound train.At the same time, there is a transfer relationship between  1 and  3 .Trains  2 and  5 are shunting operations, wherein  2 travels from the locomotive waiting tracks  2 to  1 and  5 travels from  1 to be an originating train (i.e., train  5 would choose an arrival-departure line to stop and then depart from the station through the departure node  1 ).In order to distinguish the importance of operations, the higher punctuality required for train reception, and Table 3: The scheme of determining initial solution.
Step 2. Choose a feasible routes set as incumbent solution   =   through prior knowledge of trains and parameters of the railway station, get objective value   .
Step 4. Search the best solution  * in S  (  ) and corresponding routing set  * Step 5.If the objective value of  * is better than that of   ,   =  * ,   =  * ; otherwise, let   as current solution continuously.
Step 6.If the value of   does not change, + = 1; otherwise, go to step 7.
Step 7. If  == 1, output   and the corresponding routing set   , stop.Else, go to step 3. departure operations compared to the shunting operations, we set the weights to 0.9 and 0.1, respectively.As for the multiobjective of our model, we attach the most importance to the punctuality, then the total travel time and utilization balanced of the arrival-departure lines are considered evenly.Thus set the parameters  1 =  2 = 0.3 and  3 = 0.4.In addition to this, the preparation time of each train is 1 min, and the additional time that provides trains' acceleration and deceleration is 2 min and 1 min, respectively.
We assume the headway time  1 푚 = 2 min, the minimum time interval of potential area of two trains  2 푚 = 1 min, and the minimum transfer time offered to passengers in the arrival-departure lines  3 푚 = 10 min.It is easy to neglect in this small example that if two opposite direction trains pass through node  9 or  27 one after the other, there may be potential conflicts.
The algorithm designed in Section 4 is used to solve the model of this small case.First, an incumbent solution of trains' routing is chosen based on the scheme described in Table 3, whose quality has a great influence on the efficiency of searching the near-optimal solution.The prior knowledge we considered here includes our analysis of the station structure, the nature of each train, and the route by which the train is most likely to occupy, etc.For instance, there is a transfer relationship between  1 and  3 , while the arrival-departure lines II and 4 are located on either side of the platform.Therefore, we can arrange arrival-departure lines II and 4, respectively, as initial routes of trains  1 and  3 .In terms of At the same time, there are 5 trains stopping and passing through the railway station.In the case that origin and destination are prespecified, the number of each train's route at left bottleneck, arrival-departure line, and right bottleneck is 6, respectively.Therefore, there are 6 5 possibilities for the routing arrangement of 5 trains.Of course, it may increase exponentially sharply with the number of trains and arrivaldeparture lines.Therefore, in order to reduce computation time, we take the trains' routes arrangement as tabu decision variable based on the scheme described in Table 4. Then we get the near-optimal routing arrangement of each train (as shown in Figure 11) and the start time when trains enter the station (as shown in Table 7) based on the designed algorithm in a short time.
The routing arrangements can be seen clearly in Figure 11.From our intuitive, the objective that utilization balanced of the arrival-departure lines is not only satisfied but also meets the transfer relationship between  1 and  3 .What is more, all trains are of punctuality.It is noteworthy that the results we obtained from the algorithm are the same as obtained directly from CPLEX solver, and the result suits the requirements of train operations absolutely.Therefore, it can be demonstrated that the proposed model can optimize the routes of trains and the algorithm can get a reasonable solution to ensure the punctuality of train and the rationality of routing.

Large-Scale Case Experiment.
To test the effectiveness and efficiency of our proposed train routing problem model and approach, this section applies the proposed model to a real-world case study on the Jinan West high-speed railway station in China, which involves 17 arrival-departure lines including 4 main lines and 8 platforms to the operations of reception and departure.The network of railway is described by the method mentioned in Section 2.1 as shown in Figure 12.
In Figure 12, arrival-departure lines  and III are outbound main lines and II and IV are inbound main lines, respective.Arrival-departure lines  and II are used to receive and depart trains between Beijing and Shanghai, and the direction from Shanghai toward Beijing is defined as the inbound direction, while it is outbound direction.Similarly, arrival-departure lines III and IV are used to receiving and departing trains between Beijing and Qingdao, while the direction from Qingdao toward Beijing is defined as the inbound direction, whereas it is outbound direction.The arrival-departure lines 5∼10 are located on the side of the outbound, while arrival-departure lines 11∼17 are located on the side of the inbound.The distribution of the platform is shown in Figure 12.In addition, there are four locomotive waiting tracks  1 ∼ 4 .
Owing to the scale of the station, the number of turnouts and crossovers is large, so it is difficult to collect the actual length between all track segments.Thus, the distances between various connection points are not listed here.It is described that if a train stops on the arrival-departure line which is far away from the main line, this would cost more travel time.In the real-world operation, trains need to align with the platform signs when they arrive at the station which need a little more time, and this need not be considered when trains depart from the station.In addition, in terms of our common sense, the trains' speed will decrease when arrive at the station due to the limit of lateral speed at turnouts.So there is insignificant difference in traveling time in the station between trains running at 300 km/h and 250 km/h.Combined with the calculation methods of track occupied time described in Section 2.4 and the large number of observation results in the control center, the occupancy time of each route is shown in Table 8.The parameters  푐 = 1 since the shunting operation is not regarded.
In the real-world station trains reception and departure operations, the nonstopped trains directly pass through the station on main lines, while the stopped trains can stop on any arrival-departure lines except main lines.However, if inbound trains enter the station from  2 and stop on the arrival-departure line 5 in the station as shown in Figure 12, this not only causes route conflicts with the outbound trains but also brings inconvenience to the outbound trains, which occupies more equipment and increases the difficulty of operations.Therefore, the inbound train should occupy the arrival-departure line on the side of inbound main line correspondingly (i.e., inbound trains enter the station from  2 or  2 and stop at arrival-departure lines 11∼17   The parameters are shown in Table 9.Since only a period of time is selected, we assume that the railway stations are all vacant.The data of every track segment cannot be obtained accurately; thus the value of  푐표푛 푐 1 푐 2 is 1 min.If the large instance is solved accurately, only the situation of a train occupying the arrival-departure lines needs to calculate 17 46 times.Such a large scale problem belongs to the NP-hard as mentioned above.We adopt the heuristic algorithm designed, starting from a set of routes of 46 trains which is the best solution chosen through the iterations of method described in Table 3 to obtain the superior initial solution.Based on that, the tabu search algorithm is implied.We choose the routes with the lowest objective value as the target of the next search.Consequently the efficiency of searching a better solution is ensured.After that, the near-optimal solution with train routing is obtained within 254 seconds, and the results of different direction trains are shown in Tables 10 and 11, respectively (only a part of nodes clearly expresses the routes occupied by train duo to the large number of nodes).
As shown in Tables 10 and 11, it can be seen that the frequency of arrival-departure lines occupied are almost equal, which satisfies the objective of utilization balanced of them.The nonconflict parallels are occupied in the bottleneck as far as possible for two trains whose arrival time are close to each other.As for the inbound trains G134 and G4218, the arrival time of them are close and may cause a conflict in the right bottleneck.Therefore, routes are arranged on the parallel respectively as shown in Figure 13 (the red and green dotted lines represent the routes of the two trains, instead of the red and the yellow dotted line) to prevent the possibility of collision.
In addition, the planned start timetable to enter the station is obtained by the arrival time minus the travel time of the reception in the bottleneck according to Table 9, which is same with the actual start time calculated by the algorithm.That is, the model we propose and designed algorithm can get the trains routing arrangement in a high quality and short time based on the punctuality of trains.From the analysis results of the examples, the proposed model and the designed algorithm can solve the TRP efficiently.
It is worth mentioning that the problem we discussed is a NP-hard problem.Owing to the nonlinearity and numerous decision variables of the proposed mathematical model, there is neither proper commercial software available nor an algorithm which can solve such problems accurately at present.At the same time, the heuristic algorithm we designed can solve the problem accurately and efficiently as mentioned above.So we did not compare the designed algorithm with other methods in the large-scale case.

Conclusions
This paper focuses on modeling and solving the TRP based on considering heterogeneous trains and detailed structure of the rail station.The main research work and conclusions are summarized as follows: (1) A detailed mathematical formulation for TRP describes the routing arrangement in a large and complex high-speed railway station.The turnout node and the arrival-departure line node are defined to describe the layout of the railway station instead of the traditional railway network.The heterogeneous trains are taken into account; and the potential collisions of trains and convenience for passengers transferring at station are considered as constraints.
Then we propose a method to calculate the occupied time of each track and describe the TRP problem more completely and realistically.
(2) A high-efficient algorithm based on tabu search is proposed based on the proposed model.We set two different neighborhoods for searching incumbent solution and tabu move to search the near-optimal solution.The scale of first neighborhood is smaller to search in a short time, and the second neighborhood is wilder in order to avoid empty neighborhoods as far as possible.Then we set two strategies of them, respectively.
(3) The correctness of the proposed model is verified with a small example that includes all types of trains and operations.The results obtained by the proposed tabu search algorithm are the same as those obtained directly from CPLEX solver.The result is fully in line with the requirements of train operations.In the large scale case, we chose the actual trains within 3 hours passing through the Jinan West railway station which involves 17 arrival-departure lines.The excellent solutions are obtained within 254 seconds by the designed algorithm.
It is realistic and easy to understand our proposed model.However, it has the characteristics of non-linearity and has difficulties to solve the mathematical formulas.Therefore, one possible future direction is to improve the model.Second, the tabu search algorithm needs to set effective rules to generate the incumbent solution's neighborhood and rules for tabu move.In this respect, further improvements are needed to obtain a better near-optimal solution more efficiently.More importantly, future research does not restrict to a railway stations.With the rapid development of high-speed railway, there are more train routing and scheduling problems, train rerouting and rescheduling optimization problems, etc., which need to be further studied.

Figure 1 :Figure 2 :
Figure 1: An illustration of a railway station.

Figure 3 :
Figure 3: The same/reverse direction conflicts of trains routing.

3 Figure 6 :Figure 7 :
Figure 6: The illustrative of the same direction trains occupied different lines.
) and 8(b) indicate the process of outbound trains and inbound trains passing through the station, respectively.The trends of curves in two graphs are similar since the principle of outbound trains and inbound trains is similar.The ordinate

Figure 8 :
Figure 8: A space-time network of outbound and inbound trains passing through the rail station.
Planned starting time of train c to pull into the station  푓 푐 Actual departure time of train c from the station V 푐 Speed of train c  푠푒푡푢푝 푐 Setup time of train c  푒푛푑 푐푙 Occupation end time at the left bottleneck of outbound trains  푒푛푑 푐푟 Occupation end time at the right bottleneck of inbound trains  푓푒푛푑 푐 Occupation end time at the arrival-departure lines  푐푠 Travel time at the arrival-departure line s of train c  푠 푐푠 Dwell time at the arrival-departure line s of train c  푑 푐푠 ,  푎 푐푠 Additional times corresponding to acceleration and deceleration of trains, respectively  푙 푐푠 ,  푟푒 푐푠 Travel time at left bottleneck to arrive and at right bottleneck to depart of outbound train c  푟 푐푠 ,  푙푒 푐푠 Travel time at right bottleneck to arrive and at left bottleneck to depart of inbound train c  푐표푛 푐 1 푐 2 Time interval between trains  1 and  2 entering the conflict track segments  푠 푐푠 Binary parameters, if train c would stop at arrival-departure line s,

0 𝑇 1 푚 2 푚 3 푚
Headway time of trains which occupy the same arrival-departure lines Minimum time interval of two trains at the potential conflict area Minimum transfer time of passengers on the platform

Figure 9 :
Figure 9: Conflict resolution when (a) two same direction trains' routing conflict, where (b) is a conflict of two reverse direction trains' routes.

Figure 10 :
Figure 10: The structure of a small-scale station.

Figure 11 :Figure 12 :
Figure 11: The route arrangements of the small case.

Figure 13 :
Figure 13: The parallel routes of two trains at bottleneck.
, the length of  푑 1 ∼푑 10 is the sum of lengths of  1 ∼ 6 and  6 ∼ 10 ; the length of  푑 1 ∼푑 11 is the sum of lengths of  1 ∼ 6 and  6 ∼ 11 .That is, the length of the different routes in the left bottleneck is different.The end of the left bottleneck occupied time of outbound trains is

Table 1 :
The indices, parameters, and sets.Length of the track segment between  1 and  2 * 푐

Table 2 :
Decision variables.Binary variables, if the arrival-departure line s is occupied by the train c,  푐푠 = 1.Otherwise,  푐푠 = 0  푖 푐푙 Binary variables, if the route l in the left bottleneck is occupied by the outbound train c when pulls in,  푖 푐푙 = 1.Binary variables, if the route r in the right bottleneck is occupied by the inbound train c when pulls in,  푖 푐푟 = 1.Binary variables, if the route r in the right bottleneck is occupied by the outbound train c when departs from the station,  표 푐푟 = 1.Otherwise,  표 푐푟 = 1  푐 Integer variables, indicates the starting time of train c to pull into the station  푐 1 ,푐 2 Binary variables, indicates the trains  1 and  2 precedence relation at the same track.If the train  1 precedes  2

Table 5 :
Distances between points in the railway network in Figure10.

Table 6 :
The parameters of trains in the small case.

Table 7 :
The start time of trains to enter the station.destination of train  2 , there is only one route.And for the remaining two trains, they can be organized to stop at the arrival-departure lines close to the entrance line, as  4 occupies arrival-departure line  and  5 would stop at arrival-departure line 4.

75 d 65 d 77 d 78 d 68 d 79 d 80 d 62 d 63 d 64 d 66 d 67 d 69 d 70
).Like the outbound trains, namely, outbound trains enter the station

Table 8 :
Travel time of trains on the left bottleneck, the arrival-departure lines, and the right bottleneck.

Table 9 :
Parameters of trains passing through the Jinan West railway station.
The "-" in the table indicates that the corresponding train is originating train.The entry time and stop time depend on the actual situation.It is assumed here that D6077 train enters from 푗 1 and departs after 30 min.