期刊文献+

考虑车辆周转的铁路动态货运服务网络设计优化模型及其分支-定价-切割算法 被引量:12

Optimization Model and Branch-price-cut Algorithm for Design of Railway Dynamic Freight Service Network Considering Rolling Stock Management
下载PDF
导出
摘要 研究考虑车辆周转的铁路动态货运服务网络设计问题,目标是在合理设计铁路运输服务网络的基础上提高车辆利用率。将传统的离散时空网络拓展为考虑车辆周转的超级网络,构建混合整数规划模型,同时考虑列车开行时段、编组内容、空车调配、车辆归属、运输服务水平等约束。基于模型的NP-Hard特性,给出一种分支-定价-切割算法,通过在模型中添加Benders割的方法调整可行域,通过列生成方法避免网络规模较大导致可选径路数量过多的问题,该算法可保证模型收敛至最优解。算例证明了模型和算法的有效性,通过灵敏度分析验证可用车辆数量对于空车调配方案的影响。 This paper investigated the problem of railway dynamic freight service network design considering rolling stock management,in order to reasonably design railway transportation service network and improve the utilization ratio of rolling stock.The discrete traditional time-space network was extended to a super network to accommodate rolling stock flow.A mixed integer programming model(MIP),which considers the constraints of train operating time period,make-up,empty car reposition,transportation service level,was constructed.Based on NP-Hard characteristics of the model,a branch-price-cut algorithm was developed to obtain the global optimal solution of the model.Benders' cut was generated to adjust the feasible region.A column generation method was used to handle the explosion of candidate path set of rolling stock flow and shipment flow.Finally,a numerical example was presented to prove the validity of the model and algorithm.The sensitivity analysis was also presented to show the influence of available rolling stock on empty car reposition.
出处 《铁道学报》 EI CAS CSCD 北大核心 2018年第2期8-14,共7页 Journal of the China Railway Society
基金 国家自然科学基金(61374202) 中国铁路总公司科技研究开发计划(2017X004-D,2017X004-E).
关键词 货运车辆周转 动态服务网络设计 分支-定价-切割算法 rolling stock management dynamic service network design branch-price-cut algorithm
  • 相关文献

参考文献3

二级参考文献12

  • 1董晓岩,刘军,季常煦.基于多种运输方式的行包快捷货物运输网络模型的设计与研究[J].物流技术,2006,25(10):36-39. 被引量:5
  • 2王莹,刘军.铁路行包快运专列开行方案优化编制方法的研究[J].交通运输系统工程与信息,2007,7(3):125-129. 被引量:13
  • 3Aashtiani H Z. The multi-modal traffic assignment problem[D]. Massachusetts Institute of Techonology, 1979.
  • 4Lansdowne Z F. Rail Freight Traffic Assignment[J]. Transportation Research, 1981, 15A: 183-190.
  • 5Clarke D B. An examination of railroad capacity and its im plications for rail-highway intermodal transportation [D]. University of Tennessee, 1995.
  • 6D Kim. Large scale transportation service network design: models, algorithms and applications [D]. Cambridge:Massachusetts Institute of Techonology, 1997.
  • 7T G Crainic. Service network design in freight transportation [J]. European Journal of Operational Research, 2000, 122(2) : 272-288.
  • 8Lin Cheng-Chang, Chen Sheu-Hua. An integral constrained generalized hub-and-spoke network design problem [J]. Transportation Research Part E: Logistics and Transportation Review. 2008,44(6): 986-1003.
  • 9Rink K A, Rodin E Y, Pandian V Sundara. A Simplification of the Double-sweep Algorithm to Solve the K-shortest Path Problem [J]. Applied Math. Lett. ,2000,13(8): 77- 83.
  • 10王保华,何世伟,宋瑞,申永生.综合运输体系下快捷货运网络流量分配优化模型及算法[J].铁道学报,2009,31(2):12-16. 被引量:23

共引文献49

同被引文献65

引证文献12

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部