铁路高附加值货流改编链优化研究

孙敏; 林柏梁; 彭文高; 肖杰; 王家喜

铁路高附加值货流改编链优化研究

1.
北京交通大学交通运输学院,北京 100044;
2.
广州铁路(集团)公司运输处, 广州 510080

基金项目: 国家自然科学基金（51378056）,广州铁路（集团）公司科技研究开发计划项目（2016K89）

详细信息

作者简介:
孙敏,在读硕士研究生;林柏梁,教授。

中图分类号: U266.2:TP39
计量
- 文章访问数: 52
- HTML全文浏览量: 0
- PDF下载量: 16
出版历程
- 收稿日期: 2017-03-09
- 刊出日期: 2017-07-24

Railway freight flow adaptation chain optimization for high value-added

1.
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China;
2.
Transportation Department, Guangzhou Railway(Group) Corporation, Guangzhou 510080, China

摘要

摘要: 由于高附加值货流分布和班列产品结构并不完全匹配,在铁路网上仍然还有相当一部分高附加值货物无法挂运班列送达,因此,减少这部分货流的在途中转次数将提高其在运输市场中的竞争力。在分析铁路货物运输流程的基础上,提出以高附加值货流改编次数最少为目标的改编链优化模型,把车流在改编站上产生的改编费用通过列车服务网转换为列车弧的权值,这样,把模型的求解问题转化为列车服务网上的广义最短路径求解问题。采用C++计算机语言对模型进行求解,以江村至丰台西方向的车流为例进行验证,验证了模型的有效性。
- 铁路网 /
- 列车编组计划 /
- 改编链 /
- 服务网络 /
- 广义最短路
Abstract: Due to the high value-added freight flow distribution does not fully match the regular train product structure, a considerable portion of high value-added goods cannot be shipped by regular train in railway network. Therefore, to reduce the turnover times for this part of the freight flow could improve its competitiveness in the transportation market. On the basis of analyzing the railway freight transportation process, the article put forward the optimization model of the railway freight adaptation chain with the targets of minimizing the turnover times for the high value-added good. The adaptation cost of train flow on the adaptation station was converted into the weight of train arc by train service network. Thus, the solution of the model was transformed into the generalized shortest path problem of the train service network. The model was solved by C++ program language. Taken the train flow from Jiangcun to Fengtai West as an example, the validity of the model was verified.
- railway network /
- train marshalling plan /
- adaptation chain /
- service network /
- generalized shortest path

HTML全文

参考文献(12)

[1]	林柏梁,田亚明,王志美. 基于最远站法则的列车编组计划优化双层规划模型[J]. 中国铁道科学,2011(5):108-113.
[2]	Bo-Liang Lin, Zhi-Mei Wang, Li-Jun Ji, et al.Optimizing the Freight Train Connection Service Network of A Large-Scale Rail System[J]. Transportation Research Part B,2012(46) : 649-667.
[3]	王龙,马建军,林柏梁,等. 装车地直达和技术直达及区段列车编组计划综合优化[J]. 交通运输系统工程与信息,2013(5):127-133,144.
[4]	李映红,吴世贵,彭其渊. 货物列车编组计划网络模型的建立及算法[J]. 西南交通大学学报,2002(1):68-71.
[5]	陈崇双,王慈光,薛锋,等. 货物列车编组计划国内外研究综述[J]. 铁道学报,2012(2):8-20.
[6]	许红,马建军,龙昭,等. 技术站单组列车编组方案模型与计算方法的研究[J]. 铁道学报,2006(3):12-17.
[7]	Krishna C. Jha,Ravindra K. Ahuja, GüvençSahin. New approaches for solving the block-to-train assignment problem[J]. InterScience, 51 (1) (2008), pp. 48-62.
[8]	MasoudYaghini, Amir Foroughi, Behnam Nadjar. Solving railway blocking problem using ant colony optimization algorithm[J]. Appl. Math. Model., 35 (12) (2011), pp. 5579-5591.
[9]	MasoudYaghini, Mohsen Momeni, MohammadrezaSarmadi. Solving train formation problem using simulated annealing algorithm in a simplex framework[J]. J. Adv. Transp., 48 (5) (2014), pp. 402-416.
[10]	Michael Francis Gorman. An application of genetic and tabu searches to the freight railroad operating plan problem[J]. Ann. Op. Res., 78 (0) (1998), pp. 51-69.
[11]	Ravindra K. Ahuja, Krishna C. Jha, Jian Liu. Solving real-life railroad blocking problems[J]. Interfaces, 37 (5) (2007), pp. 404-419.
[12]	Cynthia Barnhart, Hong Jin, Pamela H. Vance. Railroad blocking: a network design application[J]. Op. Res., 48 (4) (2000), pp. 603-614.

施引文献

资源附件(0)

计量

文章访问数: 52
HTML全文浏览量: 0
PDF下载量: 16
被引次数: 0

铁路高附加值货流改编链优化研究

作者简介: 孙 敏,在读硕士研究生;林柏梁,教授。

计量

出版历程

Railway freight flow adaptation chain optimization for high value-added

计量

出版历程

目录

作者简介:
孙敏,在读硕士研究生;林柏梁,教授。