Design of Route Search Algorithm Based on Station Map Information and Depth-First-Search

Route search is an important part in the interlocking system. The result can affect the work in the station. Through the study of information such as turnouts, track number and the coordinates of equipment, this article shows a new method to search the route. By adding a variety of conditions, the Depth-First-Search algorithm is modified and applied for the route searching process. The existing route search methods usually select multiple paths and compare them to select the best one. The result usually is uncertain, and searching progress has low efficiency. The improved algorithm in this article imitates how the people search routes. Thus, only one path will be selected, which is the best one. Also, this algorithm can improve the efficiency in the searching process, and the storage of data is reduced. By simulating the interlocking system, the correctness of the algorithm is verified. And the performance comparison between different methods is showed in this article.

Language

  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 79-86
  • Monograph Title: Proceedings of the 4th International Conference on Electrical and Information Technologies for Rail Transportation (EITRT) 2019: Rail Transportation Information Processing and Operational Management Technologies
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01928528
  • Record Type: Publication
  • ISBN: 9789811529146
  • Files: TRIS
  • Created Date: Aug 23 2024 4:53PM