检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输学院,四川成都610031 [2]铁道科学研究院运输及经济研究所,北京100081
出 处:《西南交通大学学报》2006年第5期608-613,共6页Journal of Southwest Jiaotong University
基 金:铁道部科技研究开发计划项目(2002X019-B)
摘 要:分析了集装箱结点站的中转作业方式.提出了结点站所在枢纽范围内集装箱运输的3种输送方案.方案I用普通集装箱列车送入结点站;方案II用摘挂列车送入结点站改编,普通货车再用小运转列车向编组站输送;方案III用摘挂列车送入编组站改编后,再由小运转列车挂运到结点站.为比较上述3个方案,根据运输组织等相关理论建立了运输消耗的数学模型.方案I作业消耗量最少,集装箱使用效率最高,但实施困难.因此,方案I作为集装箱运输的发展方向,方案II或III作为结点站建设时期的过渡方案.The transit operation of containers in junction railway stations was analyzed. Three schemes for container transport within a railway terminal were proposed. In scheme Ⅰ, containers are fed into a junction railway stations in ordinary container trains. In scheme Ⅱ, container trains are remade-up after hauled into a junction station in pickup and drop trains, and the remade-up trains are delivered to a marshalling station in transfer trains. In scheme Ⅲ, container trains are remade-up after hauled into a marshalling station in pickup and drop trains, and then the remade-up trains are delivered in transfer trains to a junction station. A model was proposed to compare the transportation costs of the three schemes. The result shows that scheme Ⅰ costs the least, and is the most efficient. But it is difficult for it to be implemented practically in the near future in China. Alternatively, scheme Ⅱ and Ⅲ are suggested as transitional schemes at initial stages of development of container junction stations, and scheme Ⅰ as a candidate for future application.
分 类 号:U292.5[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.157