Autonomous routing research based on vehicle-centralized train control system

In vehicle-centralized train control design, the routing function is transferred from interlocking equipment to vehicle, which asks for the ability of train to schedule feasible route autonomously. This paper describes an autonomous routing schedule (ARS) model based on graph theory. Firstly, by converting key elements of rail network into directed graph nodes and marking the weights of arcs based on section transit time’s prediction, a topological graph model reflecting railway structure’s characteristic is set up. According to the graph model, a heuristic algorithm is used to search the feasible route with shortest transit time. Considering the limitation of rail state’s information gathered by trains in decentralized control design, arc’s weight (the prediction of transit time in rail section) is updated in real time based on the communication between trains so that the routing schedule can be dynamically adjusted based on section’s availability. The computational tests are performed on Beijing Daxing Airport Station. The result shows the feasibility of model in searching route with reasonable transit time. It’s potential for rerouting based on disturbances and resolve delays is also analyzed.

[1]  Dario Pacciarelli,et al.  Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time , 2008, Transp. Sci..

[2]  Paola Pellegrini,et al.  Optimal train routing and scheduling for managing traffic perturbations in complex junctions , 2014 .

[3]  Lixing Yang,et al.  Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations , 2017 .

[4]  Qingquan Li,et al.  Reliable Shortest Path Problems in Stochastic Time-Dependent Networks , 2014, J. Intell. Transp. Syst..

[5]  Dario Pacciarelli,et al.  Ant colony optimization for the real-time train routing selection problem , 2016 .

[6]  Ali Ghaffari,et al.  An Energy Efficient Routing Protocol for Wireless Sensor Networks using A-star Algorithm , 2014 .

[7]  Yin Ren-kun Algorithm of route searching based on adjacency list , 2006 .

[8]  Andrea D'Ariano,et al.  Conflict Resolution and Train Speed Coordination for Solving Real-Time Timetable Perturbations , 2007, IEEE Transactions on Intelligent Transportation Systems.

[9]  Tom Van Woensel,et al.  The dynamic shortest path problem with time-dependent stochastic disruptions , 2018, Transportation Research Part C: Emerging Technologies.

[10]  Dario Pacciarelli,et al.  A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations , 2017, Comput. Oper. Res..

[11]  Andrej Babinec,et al.  Modelling of Mechanical and Mechatronic Systems MMaMS 2014 Path planning with modified A star algorithm for a mobile robot , 2014 .

[12]  Yen-Liang Chen,et al.  Shortest paths in traffic-light networks , 2000 .

[13]  Piotr Kawalec,et al.  Modern methods in railway interlocking algorithms design , 2016, Microprocess. Microsystems.