检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:岳鑫 尹传忠[2] 武中凯 YUE Xin;YIN Chuanzhong;WU Zhongkai(School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 611756, Sichuan, China;Collegeof Transport and Communications, Shanghai Maritime University, Shanghai 201306, China;Operation andDevelopment Department, China Railway Harbin Group Co., Ltd, Harbin 150006, Heilongjiang, China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都611756 [2]上海海事大学交通运输学院,上海201306 [3]中国铁路哈尔滨局集团有限公司经营开发部,黑龙江哈尔滨150006
出 处:《铁道运输与经济》2019年第2期111-116,共6页Railway Transport and Economy
基 金:中国铁路总公司科技研究开发计划课题(2017X009-J)
摘 要:随着洋山港集装箱吞吐量的逐年增加,畅通的集疏运网络已经成为提高港口效率和效益的关键。在阐述洋山港集装箱集疏运网络基本情况的基础上,针对洋山港当前存在的过度依赖公路集疏运、铁路集疏运发展缓慢等问题,通过构建基于东海二桥的集疏运网络,建立集疏运网络成本最优模型,计算出各集疏运线网的集装箱运量及各种运输方式的比重,以及整个集疏运网络的总成本。研究表明,东海二桥建设能够极大地提升洋山港海铁联运水平,降低集疏运网络的总成本,促进洋山港集疏运可持续发展。With the increase of container throughput of Yangshan Port year by year,smooth collection and distribution network has become the key to improve port efficiency.On the basis of current situation of Yangshan Port container transportation network,in view of the existing problems,such as excessive dependence on highway collection and distribution,and slow development of railway collection and distribution,the optimal model of distribution network cost was established by constructing the collection and distribution network based on the Second Donghai Bridge.Based on the calculation of the container traffic volume and the proportion of various transportation modes of each distribution line and the total transportation cost,the conclusion is drawn that the construction of Second Donghai Bridge can greatly improve the searail transportation of Yangshan Port,reduce the total cost of the collection and distribution network and promote the sustainable development of distribution of Yangshan Port.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.36.122