Advertisement

The Research on Route Search Based on Heuristic Strategy

  • Cheng Wang
  • Shaobin Li
  • Yan Li
  • Ziwei Liu
  • Huiyong Liu
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 482)

Abstract

Route search, actually in rail transit, is finding an accessible and safe route for train dispatching. Route search is the basic function of computer based interlocking system. The efficiency of route search and the correctness of the target route searched are of great significance to ensure the traffic safety. In view of the similarity between the railway yard and the directed graph, the railway yard will be modeled as a directed graph. In this paper, a new route search method, combining the depth-first traversal and heuristic strategy, has been proposed. Test results based on real yard show this method can quickly and accurately search target route. And it has high practical application value.

Keywords

Route search Depth-first traversal Heuristic search The directed graph 

References

  1. 1.
    Xie L, Yang Y (2015) Two-dimensional coordinate information based route searching algorithm. Railway Comput Appl 08:16–19 (in Chinese)Google Scholar
  2. 2.
    She X, Sha Y, Chen Q, Yang J (2007) The application of graphic theory on railway yard interlocking control system. In: IEEE intelligent vehicles symposium, 883–887. Istanbul, TurkeyGoogle Scholar
  3. 3.
    Song Y (2014) The Research on route searching based on a-star algorithm. Southwest Jiaotong University: 5 (in Chinese)Google Scholar
  4. 4.
    Xiao M, Ning H, Zhao Z (2012) Directed graph based route searching research and design. Autom Instrum 06:69–73 (in Chinese)Google Scholar
  5. 5.
    Wen W, Wang X (2008) Analysis of data structure and route search in computer interlocking system. J Chongqing Univ (Nature Science Edition), (06):51–53. (in Chinese)Google Scholar
  6. 6.
    Geng J, Cai B, Wang J, Shang G (2012) Traversing algorithm of railway yard based on DFS. J China Railway Soc 04:51–56 (in Chinese)Google Scholar
  7. 7.
    Xu X, Chen G (2011) Research and application of designing computerized interlocking software and route searching algorithm. Railway Comput Appl 01:49–52 (in Chinese)Google Scholar
  8. 8.
    Peng J, Yin R (2006) Algorithm of route searching based on adjacency list. Comput Eng Des 18:3400–3402 (in Chinese)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Cheng Wang
    • 1
  • Shaobin Li
    • 1
  • Yan Li
    • 1
  • Ziwei Liu
    • 1
  • Huiyong Liu
    • 1
  1. 1.School of Electronic and Information EngineeringBeijing Jiaotong UniversityBeijingChina

Personalised recommendations