Optimization for route selection under the integration of dispatching and control at the railway station: A 0‐1 programming model and a two‐stage solution algorithm

Abstract

AbstractAt present, the mainstream studies on route selection optimization at the railway station rarely considered the overall punctuality of the operation plans and the seizing route resource between shunting operation and train running, which can endanger the running safety and reduce the efficiency at the station. Therefore, this paper proposes an optimization method for the route selection under the integration of dispatching and control at the railway station. Firstly, the station‐type data structure, the route occupation conflict, and the operation task order were defined. Then, a 0‐1 programming model was constructed to minimize the total delay time and shorten the total travel time of all operations. Finally, a two‐stage solution algorithm based on depth‐first search algorithm and genetic algorithm was designed, and two actual cases of a technical station in China were designed. The instance verification results show that the algorithm can find the satisfactory route scheme in 250 iterations; different delay factors and travel coefficients will get different route schemes, which can provide decision support for dispatchers and operators to select routes. Through comparative analysis of algorithms, it is found that the two‐stage algorithm has higher solving efficiency than the individual depth‐first search algorithm and individual genetic algorithm.