The Research on Route Search Based on Heuristic Strategy

被引：0

作者：

Wang, Cheng ^{[1
]}

Li, Shaobin ^{[1
]}

Li, Yan ^{[1
]}

Liu, Ziwei ^{[1
]}

Liu, Huiyong ^{[1
]}

机构：

[1] Beijing Jiaotong Univ, Sch Elect & Informat Engn, Beijing, Peoples R China

来源：

PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES FOR RAIL TRANSPORTATION (EITRT) 2017: ELECTRICAL TRACTION | 2018年 / 482卷

关键词：

Route search; Depth-first traversal; Heuristic search; The directed graph;

D O I：

10.1007/978-981-10-7986-3_88

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：871 / 878

页数：8