Design and Implementation of a New Algorithm for Optimal Route Traversal Searching in Interlocking Stations

The optimal and efficient route search algorithm can improve the overall capacity of the station, and ensure the efficiency, safety, stability of the train. Aiming at reducing the complexity problem of interlocking route search algorithm, a new traversal search algorithm based on the optimal path criterion is proposed. The signal and turnout in the layout of station are transformed into vertices in the network transportation graph, the track section is transformed into the sides with length and direction, the vertices are connected, and the network graph of station is obtained. According to the actual situation of station, the optimal route search criterion is designed based on the depth first principle and the shortest path algorithm. When the starting point of the route is set, the next vertex is searched in turn according to the optimal route search criterion until the end point of the route is found. The corresponding software of the algorithm has been compiled. After verifying the practicability of the algorithm, the algorithm can be applied to the actual railway station, and can find the optimal route accurately, quickly, and steadily to meet the needs of interlocking station route searching.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 353-361
  • Monograph Title: Resilience and Sustainable Transportation Systems

Subject/Index Terms

Filing Info

  • Accession Number: 01745282
  • Record Type: Publication
  • ISBN: 9780784482902
  • Files: TRIS, ASCE
  • Created Date: Jun 29 2020 3:02PM