| 基于总成本最小的多式联运运输方式选择 |
| |
| 引用本文： | 张俊,等.基于总成本最小的多式联运运输方式选择[J].价值工程,2014(8):43-45. |
| |
| 作者姓名： | 张俊 |
| |
| 作者单位： | 北京建筑大学经济与管理工程学院,北京100044 |
| |
| 摘 要： | 运输总成本是多式联运企业选择运输方式最优先考虑的因素,而总成本最小是目前大多数多式联运企业追求的目标。通过运筹学中的网络图理论构建多式联运运输网络图,基于总成本最小建立模型,将求解最短路径的Dijkstra算法用来求解模型,在求解实例问题过程中印证了整个模型的可行性。
|
| 关 键 词： | 多式联运 总成本 运输方式选择 Dijkstra算法 |
Transport Modes Selection of Multimodal Transport Based on the Minimum Total Cost |
| |
| ZHANG Jun,HAN Zheng-bao.Transport Modes Selection of Multimodal Transport Based on the Minimum Total Cost[J].Value Engineering,2014(8):43-45. |
| |
| Authors: | ZHANG Jun HAN Zheng-bao |
| |
| Institution: | (Economics and Management College of Engineering, Beijing University of Civil Engineering and Architecture, Beijing 100044, China) |
| |
| Abstract: | The total cost of transportation is the important element that the multimodal transport enterprise consider first when they select transport modes. The minimum total cost is the target of most transportation enterprise. The network of multimodal transportation is built through operations research. And the algorithm model is built on the base of the minimum total cost. The model is solved by Dijkstra Algorithms which is used for the shortest path .The feasibility of this transport modes selection method is confirmed in the process of solving the problem. |
| |
| Keywords: | multimodal transport total cost transport modes selection Dijkstra Algorithms |
| 本文献已被 CNKI 维普 等数据库收录！ |
