铁路车站联锁软件进路搜索算法优化  

Optimizes of route search algorithm for railway station interlocking software

作　　者：罗耀云 LUO Yaoyun(Lanzhou Railway Survey and Design Institute Co.,Ltd.,Lanzhou 730030,China)

机构地区：[1]兰州铁道设计院有限公司,甘肃兰州730030

出　　处：《电子设计工程》2021年第10期51-55,共5页Electronic Design Engineering

摘　　要：针对大型复杂铁路车站计算机联锁软件进路搜索算法存在回溯搜索的不足,通过对车站联锁软件数据结构和进路搜索算法的具体分析,采用站场型数据结构并对深度优先搜索(Depth First Search,DFS)算法增加约束条件,提出DFS高度无往返优化算法,达到进路搜索高度无往返的优化目标。结合实例仿真,并在包神铁路巴图塔车站进行了实地测试,结果显示该算法优化后克服了回溯搜索的不足,测试计算机联锁软件进路搜索未发生错误,对于大型复杂站场联锁软件进路搜索平均耗时提高5.55%。Aiming at the shortcomings of the computer interlocking route search algorithm in large and complex railway transportation,through the analysis of the data structure of the interlocking software and the route search algorithm,the station type data structures is adopted,and the Depth First Search(DFS)had to be retrained,DFS height no round trip optimization algorithm is proposed,to achieve the optimization goal of no round trip in route search height.Simulation and field test at Batuta station of Baoshen railway,the results show that the algorithm overcomes the shortcoming of backtracking search,computer interlocking software path search did not occur error,the average timeconsuming of route searching for interlocking software in large and complex stations is increased by 5.55%.

关 键 词：计算机联锁 数据结构 进路搜索 高度无往返 

分 类 号：TN02[电子电信—物理电子学]