基于Dijkstra算法的列车进路选择

The Train Route Selection Algorithm Based on Dijkstra

在计算机联锁中,列车进路的算法设计是最关键的环节,它关系到列车的运行安全和车站通过能力的提高。Dijkstra算法能够计算出无向图中某个任意结点到其它所有结点之间的最短路径,给车站及咽喉区提高通过能力提供了可能性。如果把车站用无向图来表示,车站设备的占用状态信息融合到算法中,就可以很方便地实现利用计算机来选择列车的进路。

In computer interlocking, train route algorithm design is the most critical aspect, it relates to the safe operation of trains and stations through empowerment. Dijkstra algorithm can calculate an undirected graph any node to all other nodes shortest path between the station and the throat area to offer the possibility of improving capacity. If the station is represented by an undirected graph, occupancy status information station equipment integrated into the algorithm, we can easily achieve the use of computers to choose the train route.