Train routing model and algorithm combined with train scheduling

This paper constructs a train routing model combined with a train scheduling problem, which is a 0–1 mixed-integer nonlinear programming problem. Except for train route choice, the model considers a system of complicated constraints on headway, trip time, meeting-crossing and overtaking between trains, capacity of siding, and so on. Based on the delay information of each train, a route adjustment algorithm is designed to obtain satisfactory route schemes of trains. Moreover, a tabu search procedure is designed to further improve the route schemes. The simulation results show that, relative to the optimal solution, the solutions obtained by the current method exhibit small relative error. The tabu search algorithm exhibits unstable performance because of dependence on the initial solution. Combined with the route adjust algorithm, the tabu search technique can improve the quality and stability of solutions. In addition, the departure order of heterogeneous trains exerts important influences on train route choice