铁路站场信号联锁关系自动生成算法研究

Research on Automatic Generation Algorithm of Railway Station Yard Signal Interlocking Relational Table

当站场结构发生变化,站场联锁关系表也随之改变需重新编写,而站场联锁表多依靠深度搜索或广度搜索算法来生成,对于大型编组站其计算量大、效率较低。通过对铁路站场运输设备及其相互间关系的研究,分析站场拓扑结构,进行有向图建模,应用图论的最优化理论探讨铁路站场联锁表的自动生成方法。并且通过对图搜索算法的研究和对比,设计启发式的联锁表进路搜索方法,实现联锁表的准确、高效自动生成。

When a station yard changes in its strcture, its interlocking relational table wilt also be revised accord- ingly. However, the station yard interlocking table mostly depends on depth-first search algorithm or breadth first search methods to generate, for large-scale marshalling yards, the computational amount is great with a low efficien- cy. By studying the transport equipment for railway station yards and their interrelation, the Article analyses the station yard topology, model based on direeted graph and adopt the optimal graph-theory to discuss the automatic generation method of railway station yard interlocking table. By studying and comparing the graph-search algorithm, it designs a heuristic interlocking table route search method to realize the accurate and high-efficiency automatic generation of interlocking tables.