基于Dijkstra和深度优先搜索的进路搜索算法研究

Research on Route Searching Algorithms Using Dijkstra and Depth First Search

为了搜索铁路站场进路,把铁路站场平面图转化为运输网络,借鉴网络图中求最短路径的思想,对网络图中的顶点和边赋予一定的属性,建立了以最短路为目标函数的进路搜索数学模型。借鉴Dijkstra算法和深度优先搜索算法并进行改进,对进路的搜索算法进行研究,提出一种通用进路搜索算法,可以大量减少搜索的深度,提高搜索效率,得到最优的进路。

The paper proposes a Dijkstra and Depth First Search-based algorithm to route the trains within railway stations. In particular, the railway station ground plan is transformed into a transportation network, and the routing problem becomes a shortest path search problem on the railway network graph. Numerical results indicate that the proposed shortest path search algorithm leads to reduced depth of search and improved searching efficiency.