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

Railway transportation route based on Dijkstra algorithm

作　　者：张锐[1] 邓桂星[1] 李世春 金福才 ZHANG Rui;DENG Guixing;LI Shichun;JIN Fucai(Institute of Information Technology, China Railway Lanzhou Group Co. Ltd., Lanzhou 730000, China;Institute of Computing Technologies, China Academy of Railway Sciences Corporation Limited,Beijing 100081, China)

机构地区：[1]兰州铁路局集团有限公司信息处,兰州730000 [2]中国铁道科学研究院集团有限公司电子计算技术研究所,北京100081

出　　处：《铁路计算机应用》2019年第10期12-15,共4页Railway Computer Application

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

摘　　要：Dijkstra算法是铁路运输径路实现计算机判定的重要基础算法。以Dijkstra为最短径路算法,结合我国铁路运输现状,设计特定径路参数描述语言,实现了计算机对铁路运输径路的智能化判定。运算速度可达到5万条/s以上,正确率达到100%,满足了不同业务对径路的需求。是计算机理论知识转化为铁路运输生产力的标志性成果。Dijkstra algorithm is one of the most important fundamental methodologies to implement the computerized decision-making in path prediction of rail transportation. 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 operation speed 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.

关 键 词：铁路网 邻接表 DIJKSTRA算法 最短径路 特定径路 

分 类 号：U284.6[交通运输工程—交通信息工程及控制] TP39[交通运输工程—道路与铁道工程]