铁路货运最短车流径路算法与实现  

Algorithm and Implementation of the Shortest Car Flow Routing for Railway Freight

作　　者：段嘉伟 陈秋文 孙佩[2] DUAN Jiawei;CHEN Qiuwen;SUN Pei(School of Management,Guangzhou Donghua Vocation College,Guangzhou Guangdong 510000,China;School of Traffic and Transportation,Xi’an Traffic Engineering Institute,Xi’an Shaanxi 710300,China)

机构地区：[1]广州东华职业学院管理学院,广东广州510000 [2]西安交通工程学院交通运输学院,陕西西安710300

出　　处：《中国铁路》2022年第2期164-170,共7页China Railway

基　　金：广东省科技创新战略专项资金项目(pdjh2022b1141)。

摘　　要：铁路货运最短车流径路是发到站的最短里程,选取该径路可降低运输成本、提高运输效率。最短车流径路算法虽然较为成熟,但将算法应用到复杂的铁路货运网络仍是研究热点。以现有"2020全国铁路货运营业站示意图"为基本路网结构,建立里程信息表,利用Dijkstra算法实现铁路货运节点站间最短车流径路、非节点站间最短车流径路、支线上尽头站间最短车流径路、多重站点最短车流径路计算,并可对程序中路网数据进行更新维护。研究成果对铁路货物运输选取最短车流径路具有实用价值和参考意义。The shortest car flow routing for rail freight is the shortest mileage from departure station to arrival station. Selection of such path can reduce the traffic cost and improve the traffic efficiency. Although the algorithm of the shortest car flow routing is mature, the application of the algorithm to the complex railway freight network is still a research focus. With the current“Schematic Diagram of National Railway Freight Stations 2020”as the basic railway network structure, the mileage information table is established, and Dijkstra algorithm is applied to realize the calculation of the shortest car flow routing between railway freight nodes, the shortest car flow routing between non-node stations, the shortest car flow routing between end stations on the branch line, and the shortest car flow routing among multiple stations, and moreover, the railway network data in the program can be updated and maintained. The research results are of practical value and reference significance for selecting the shortest car flow routing for railway freight transport.

关 键 词：数据结构 铁路网 DIJKSTRA算法 算法设计 最短径路 

分 类 号：F532.[经济管理—产业经济]