| 基于Dijkstra算法的铁路应急物资调配方案研究 |
| |
| 引用本文： | 王华梅,王璞,刘兴奇.基于Dijkstra算法的铁路应急物资调配方案研究[J].铁路计算机应用,2019,28(10):1-4. |
| |
| 作者姓名： | 王华梅 王璞 刘兴奇 |
| |
| 作者单位： | 1. 中国铁路太原局集团有限公司, 太原 030013; |
| |
| 基金项目： | 中国铁路总公司科技研究开发计划项目(2017F016) |
| |
| 摘 要： | 针对应急物资调配问题,为提高铁路突发事件中应急物资需求的快速响应能力,将各类物资的需求量和储存量结合在一起进行分析,并探究调配最优路径的决策方案。以追求最短时间和最小损失为根本目标,依据应急点的不同紧急程度,建立铁路应急物资调配方案。
|
| 关 键 词： | 应急物资 调配 Dijkstra算法 |
| 收稿时间： | 2018-10-22 |
Railway emergency material allocation scheme based on Dijkstra algorithm |
| |
| Affiliation: | 1. China Railway Taiyuan Group Co. Ltd., Taiyuan 030013, China;2. China Academy of Railway Sciences Corporation Limited, Beijing 100081, China;3. China Railway Chengdu Group Co. Ltd., Chengdu 610081, China |
| |
| Abstract: | Aiming at the problem of emergency material dispatch and improving the rapid response ability of emergency material demand in railway emergency, this paper combined the demand and storage of various materials for analysis, explored the decision-making scheme of the optimal allocation path, took the pursuit of the shortest time and the minimum loss as the basic goal, and established the railway emergency material allocation plan according to the different emergency degree of the emergency point. |
| |
| Keywords: | |
|
| 点击此处可从《铁路计算机应用》浏览原始摘要信息 |
|
点击此处可从《铁路计算机应用》下载全文 |
|
