期刊文献+

铁路车流改编方案与技术站布局的综合优化 被引量:6

Integrated Optimization of Railway Wagon Flow Reorganization and Layout of Technical Service Stations
下载PDF
导出
摘要 车流改编方案和技术站布局是铁路运输组织工作中重要而又紧密关联的两个基础问题。通过技术站改编能力约束和编组去向数约束,将车流改编方案和技术站布局两个问题组合并进行综合协调优化,以最小化车流走行、改编费用和技术站布局调整投资费用为目标,构建综合优化0-1整数规划模型。鉴于问题的复杂性,提出基于备选集和区域划分的思想对模型进行深化分析和拓展,以降低问题的规模。以具有10个节点的网络为例进行验证,结果表明车流改编方案和技术站布局的综合优化,有利于路网上车流组织和车站作业能力的协调,促进系统的整体优化。 Wagon flow reorganization and layout of technical service stations are two basic important issues closely related in railway transportation organization.Under constraint of the train reorganization capacity and number of formation direction of technical stations,the two issues are integraled and optimized.The 0-1 integral optimization model is built with the objective to minimize the costs of wagon flow running,wagon flow reorganization and layout adjustment of technical stations.So as to reduce the scale of solution finding,the model is introduced in to further develop on the basis of the candidate set and division of technical stations by districts.An example of a network with 10 nodes is designed to test the model.The result shows that the model can help to coordinate the relationship of wagon flow organization and layout of technical stations,and to promote the overall optimization of the system.
出处 《铁道学报》 EI CAS CSCD 北大核心 2011年第2期8-12,共5页 Journal of the China Railway Society
基金 国家自然科学基金资助项目(60776825) 北京交通大学优秀博士生创新基金资助项目(141076522) 北京交通大学研究生创新项目(2009YJS042)
关键词 车流改编方案 技术站布局 综合优化 wagon flow reorganization layout of technical service stations comprehensive optimization
  • 相关文献

参考文献13

二级参考文献25

  • 1梁栋,林柏梁.技术站分组列车编组计划的优化理论及模型研究[J].铁道学报,2006,28(3):1-5. 被引量:19
  • 2林柏梁.具有非线性改编费用的列车编组计划优化[J].铁道学报,1996,18(A00):37-42. 被引量:2
  • 3郑时德 吴汉琳.铁路行车组织[M].北京:中国铁路出版社,1991.198-231.
  • 4冯焕 何勋隆.铁路站场及枢纽[M].北京:中国铁道出版社,1987..
  • 5索特尼科夫E A 王鹤鸣(译).编组站工作强化[M].北京:中国铁道出版社,1987..
  • 6CHARNES A,COOPER W W.Chance-Constrained Programming[J].Management Science,1959,6 (1),73-79.
  • 7SAYARSHAD H R,GHOSEIRI K,A Simulated Annealing Approach for the Multi-Periodic Rail-Car.Fleet Sizing Problem[J].Computer & Operation Research,1983,220:671-80.
  • 8AHUJA R K,JHA K C,LIU J.Solving Real-Life Railroad Blocking Problem[J].Interfaces,2007,37 (5):404-419.
  • 9RINK K A,Rodin E Y,SUNDARA P V.A Simplification of the Double-Sweep Algorithm to Solve the K-Shortest Path Problem[J].Applied Mathematics Letters,2000,13 (8):77-83.
  • 10曹家时,1992年

共引文献58

同被引文献33

  • 1严冬梅,李敏强,寇纪淞.需求随时间变化的物流中心动态选址[J].系统工程,2005,23(6):30-33. 被引量:11
  • 2梁栋,林柏梁.铁路运输动态车流组织的策略优化模型研究[J].系统工程理论与实践,2007,27(1):77-84. 被引量:9
  • 3范振平.重载铁路通道车流吸引区域及始发直达重载化研究[D].北京:北京交通大学,2009.
  • 4Sible Alumur, Bahar Y Kara. Network Hub Location Problems: The state of the art[J]. European Journal of Operational Research, 2008,190( 1): 1-21.
  • 5Assad A A. Models for Rail Transportation [J].Transportation Research Part A, 1980,14(1):205-220.
  • 6R K Ahuja, C B Cunha, G Sahin. Network Models in Railroad Planning mid Scheduling[A]. INFORMS, Tutorials in Operations Research[C].2005.
  • 7Edwin Mansfield, Harold Wein. A Model for the Location Df a Railroad Classification Yard [J]. Management Science, 1958, (4) .. 292-313.
  • 8ASSAD A. Models for Rail Transportation [J]. Transporta tion Research Part A,1980,14(3): 205-220.
  • 9NEWTON H N, BARNHART C,VANCE P H. Constru- cting Railroad Blocking Plan to Minimize Handling Cost [J]. Transportation Science, 1998,32(4): 330-345.
  • 10AHUJA R K, et al. Network Models in Railroad Planning and Scheduling [J]. Operation Research Informs,2005: 54- 101.

引证文献6

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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