基于有向图的进路搜索算法研究与设计  

Algorithm of Route Searching Based on Direct Graph

作　　者：肖蒙[1] 宁海安 赵志荣[3] 

机构地区：[1]兰州交通大学自动化与电气工程学院,兰州730070 [2]北京国交信通科技发展公司,北京100011 [3]兰州铁路局银川电务段,银川750011

出　　处：《自动化与仪器仪表》2012年第6期69-70,73,共3页Automation & Instrumentation

基　　金：铁道部科技研究开发计划重点课题(2012X003-B);甘肃省自然科学基金资助项目(1112RJZA040)

摘　　要：进路搜索是铁路车站计算机联锁系统的基本功能,其运行效率及所得目标进路的安全性对于保证行车安全意义重大。本文通过对铁路车站站场图与有向图的相似性进行研究,建立其网络拓扑结构与节点模型,结合深度优先遍历算法和搜索约束条件,提出一种适用于铁路车站实际情况的进路搜索算法,并给出了完整的描述。Route searching is the basic functions of computer interlocking system of railway stations, and its operating efficiency and the security of objectives route ensure the traffic safety significantly. In this paper, the network topology and node model of the railway station yard are established, based on the similarity between station yard and direct graph. Then, considering the Depth First Search Algorithm and the searching constraints, a algorithm of route searching was proposed and also actual suitable for the railway station, with complete description.

关 键 词：进路搜索 有向图 深度优先遍历 搜索约束条件 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]