首页 | 本学科首页   官方微博 | 高级检索  
     

基于Dijkstra算法铁路运输径路的研究
引用本文:张锐,邓桂星,李世春,金福才. 基于Dijkstra算法铁路运输径路的研究[J]. 铁路计算机应用, 2019, 28(10): 12-15
作者姓名:张锐  邓桂星  李世春  金福才
作者单位:1. 中国铁路兰州局集团有限公司 信息技术所, 兰州 730000;
基金项目:中国铁路总公司科技研究开发计划项目(2017X009-C,2017X009-B)
摘    要:Dijkstra算法是铁路运输径路实现计算机判定的重要基础算法。以Dijkstra为最短径路算法,结合我国铁路运输现状,设计特定径路参数描述语言,实现了计算机对铁路运输径路的智能化判定。径路计算速度达到5万条/s以上,正确率达到100%,满足了不同业务对径路的需求。是计算机理论知识转化为铁路运输生产力的成果。

关 键 词:铁路网   邻接表   Dijkstra算法   最短径路   特定径路
收稿时间:2018-08-29

Railway transportation route based on Dijkstra algorithm
Affiliation: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
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.
Keywords:
点击此处可从《铁路计算机应用》浏览原始摘要信息
点击此处可从《铁路计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号