期刊文献+

铁路货运产品与车站资源协同分配优化模型及算法研究 被引量:5

Optimization Model and Algorithm for Collaborative Assignment Between Cargo Products and Station Resources
下载PDF
导出
摘要 货运产品与车站资源协同分配研究,对于提升铁路运输的经济效益、优化铁路基础设施布局具有重要意义。首先阐述货运产品与车站资源分配之间的内在联系,以车站分配中的多分配模式为例,综合考虑技术站扩能及费用等相关因素,以铁路运输收益最大化为优化目标,构建铁路货运产品与车站资源协同分配优化模型。根据模型多决策变量的特点,采用和声搜索算法与基于反馈的免疫克隆算法进行求解,最后以某一条繁忙干线为例验证模型及算法的性能,结果表明模型和算法具有较好的适用性。 Research on collaborative assignment between cargo products and station resources is beneficial to the optimization of the layout of railway infrastructure and to the improvement of the economic benefits of railway transportation. The internal relation between cargo products and station resources assignment was analyzed. Based on the analysis, with the multi-mode allocation as an example, using the maximization of transportation revenue as model objective, the collaborative assignment model between cargo products and station resources was built, considering the factors of capacity expansion and transformation cost of the technical station. Based on the characteristics of the multi-decision variables of the model, the harmony search algorithm and feedback- based immune clone algorithm were used to solve this model. At last one railway trunk line was used as a numerical example to verify the model and algorithms. The results showed good applicability of the model and algorithms.
出处 《铁道学报》 EI CAS CSCD 北大核心 2017年第5期15-21,共7页 Journal of the China Railway Society
基金 国家自然科学基金(61374202) 中国铁路总公司科技研究开发计划(2016X007-G 2013X005-A)
关键词 铁路运输 货运产品 车站资源 协同分配 railway transportation cargo product station resources collaborative assignment
  • 相关文献

参考文献6

二级参考文献31

  • 1董晓岩,刘军,季常煦.基于多种运输方式的行包快捷货物运输网络模型的设计与研究[J].物流技术,2006,25(10):36-39. 被引量:5
  • 2王莹,刘军.铁路行包快运专列开行方案优化编制方法的研究[J].交通运输系统工程与信息,2007,7(3):125-129. 被引量:13
  • 3D Kim. Large scale transportation service network design: models, algorithms and applications [D]. Cambridge:Massachusetts Institute of Techonology, 1997.
  • 4T G Crainic. Service network design in freight transportation [J]. European Journal of Operational Research, 2000, 122(2) : 272-288.
  • 5Lin 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.
  • 6Rink 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.
  • 7王保华.综合运输体系下快捷货物运输网络资源配置优化研究[D].北京:北京交通大学,2010.
  • 8Farvolden J M,Powell W B.Subgradient methods for the service network design problem[J].Transportation Science,1994,28(3):256-272.
  • 9Lin C C,Chen S H.An integral constrained generalized hub-and-spoke Network design problem[J].Transportation Research Part E:Logistics and Transportation Review,2008,44(6):986-1003.
  • 10Lin C C,Chen S H.The hierarchical network design problem for time-definite express oommon carriers[J].Tmnspormtion Research Part B:Mecal,2003,38(3):271-283.

共引文献42

同被引文献36

引证文献5

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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