基于Dijkstra算法铁路运输径路的研究

基金项目:

中国铁路总公司科技研究开发计划项目(2017X009-C,2017X009-B)

详细信息

Railway transportation route based on Dijkstra algorithm

1. Institute of Information Technology, China Railway Lanzhou Group Co. Ltd., Lanzhou 730000, China;
2. Institute of Computing Technologies, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China

摘要: Dijkstra算法是铁路运输径路实现计算机判定的重要基础算法。以Dijkstra为最短径路算法,结合我国铁路运输现状,设计特定径路参数描述语言,实现了计算机对铁路运输径路的智能化判定。径路计算速度达到5万条/s以上,正确率达到100%,满足了不同业务对径路的需求。是计算机理论知识转化为铁路运输生产力的成果。
- 铁路网 /
- 邻接表 /
- Dijkstra算法 /
- 最短径路 /
- 特定径路
Abstract: Dijkstra algorithm is an important fundamental methodologies to implement the computerized decisionmaking of railway transportation route. Taking Dijkstra as the shortest route algorithm and considering the current situation of railway transportation in China, this paper designed a description language for specific route parameters, and implemented the intelligent judgment of railway transportation route by computer. The calculating speed of transportation route can reach more than 50 000/s, and the accuracy rate can reach 100%. It meets the needs of different services for routing, and is the result of transforming computer theory knowledge into railway transportation productivity.
- railway network /
- adjacency list /
- Dijkstra algorithm /
- shortest route /
- specific route

[1]	吴毅. 可视化铁路网货流、车流公共信息平台的研究[J]. 铁道运输与经济, 2006(7):76-77.
[2]	严蔚敏,吴伟民. 数据结构[M]. 北京:清华大学出版社, 1995.
[3]	林柏梁,朱松年. 路网上车流径路优化的0-1规划模型及其合理径路集生成算法[J]. 铁道学报, 1997, 19(1):7-12.
[4]	Kris Jamsa, Lars Klander.C/C++程序员实用大全[M]. 北京:中国水利水电出版社, 2009.
[5]	中国铁路总公司.全路特定车流径路:铁总运[2014]161号[Z]. 北京:中国铁路总公司, 2014.
[6]	Andrei Alexandrescu. Moderon C++ Design[M]. New Jersey, USA:Addsion Wesley, 2001.
[7]	赵娟. 考虑车流组织模式的铁路车流径路优化模型研究[J]. 铁道学报, 2017(7):19-24.
[8]	中华人民共和国铁道部. 货物运价里程表[M]. 北京:中国铁道出版社, 2010.
[9]	吴毅. 铁路运输径路计算机处理系统方案设计与研究[J]. 铁路计算机应用, 2006, 15(5):1-3.
[10]	申永生,何世伟,黎洁东,等. 自适应粒子群算法求解编组站车流推算问题的研究[J]. 铁道货运, 2012(12):5-10.
[11]	武威,董宝田,陈光伟,等. 基于Vague集的铁路车流径路优化[J]. 铁道运输与经济, 2016(10):42-47.