摘要
对上海的内河网络做了比较全面深入的分析研究.首先,把上海内河航运网简化成网络结构图,把比较关键的航道交汇点抽象成结点并分配相应的集装箱数;其次,结合“一环十射”规划综合分析航道运输能力,力图与实际情况相符合;最后,采用Dijkstra算法计算出各节点到目的港区的最短途径,分析计算结果与各河段的运输能力,修正运输途径以得出航运系统比较满意的内河运输集疏运网络方案.
A research on Shanghai's Inland-River transportation network was comprehensively made and analyzed. Firstly, the Shanghai's Inland-River shipping system is simplified to be a structure network, in which the nodes represent the key intersections of Inland-Rivers and are assigned corresponding container volumes. Secondly, the network transportation capacity is analyzed according to the actual conditions and the Program of One Surround & Ten Rays. Finally,the Dijkstra algorithm is used to find out the shortest routes. With comparison of the above routes and the actual capacity, different suggestions were provided accordingly to conclude an ideal Inland-River transportation network plan.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2006年第6期1019-1023,共5页
Journal of Shanghai Jiaotong University
关键词
上海港
内河集疏运网络
网络优化
DIJKSTRA算法
Shanghai port
Inland-River transportation network
network optimization
Dijkstra algorithm