交通运输工程与信息学报2017，Vol.15Issue(4)：38-43,6.DOI:10.3969/j.issn.1672-4747.2017.04.006
基于Dijkstra和深度优先搜索的进路搜索算法研究
Research on Route Searching Algorithms Using Dijkstra and Depth First Search
吴鹏 1寇玮华 1许木南 1吕大鹏1
作者信息
- 1. 西南交通大学,交通运输与物流学院,成都 610031
- 折叠
摘要
Abstract
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.关键词
网络图/Dijkstra算法/深度优先搜索算法/进路搜索Key words
network diagram/Dijkstra/depth first search/shortest path search分类
交通工程引用本文复制引用
吴鹏,寇玮华,许木南,吕大鹏..基于Dijkstra和深度优先搜索的进路搜索算法研究[J].交通运输工程与信息学报,2017,15(4):38-43,6.
