摘要
为进一步提升铁路客运运营条件信息管理的智能化关联能力,在规范铁路客运运营条件信息的基础上,分析DFS,Dijkstra,A*等经典图论算法的径路搜索算法适应性,对比确定以DFS算法作为铁路客运运营条件径路搜索算法的基础,并从简化搜索节点、限定搜索区域、结合列车开行、控制递归深度等方面对DFS算法进行优化,该优化算法可以为不同站间径路的搜索需求提供全面、高效的站间合理径路查找工具,为票价计算提供支撑信息,对提升径路搜索效率,提高铁路客运运营条件信息的管理水平,促进路网基础信息管理与路网规模相适应有重要意义。
The applicability of Dijkstra, depth-first search(DFS), A*, and other classical graphtheoretical algorithms to the path search algorithm was comparatively analyzed with the standardized operation condition information about railway passenger transport, in order to further improve the intelligent association of the information management. The DFS was determined as the basic path search algorithm and optimized by simplifying search nodes, limiting search areas, taking train plans into account, controlling recursion depth, and so on. The optimization algorithm can provide a comprehensive and efficient search tool for reasonable paths between different stations and support information for fare calculation. It is of great significance to improving the efficiency of path search and the management of operation condition information about railway passenger transport and promoting the adaptation of basic information management of the railway network to its scale.
作者
刘文韬
牛青坡
李天翼
宋阳
LIU Wentao;NIU Qingpo;LI Tianyi;SONG Yang(Institute of Computing Technologies,China Academy of Railway Sciences Corporation Limited,Beijing 100081,China)
出处
《铁道运输与经济》
北大核心
2021年第5期103-108,116,共7页
Railway Transport and Economy
基金
中国国家铁路集团有限公司科技研究开发计划课题(J2019X003)。
关键词
铁路客运运营条件
径路搜索
算法
深度优先搜索DFS
递归
Operation Conditions of Railway Passenger Transport
Path Search
Algorithm
Depth-First-Search(DFS)
Recursion
