期刊文献+

动车运用所存车线运用方案优化模型与算法 被引量:11

Optimization Model and Algorithm for the Operation Plan of the Stabling Track at EMU Running Shed
下载PDF
导出
摘要 以给定动车组列车占用存车线时间为前提、以同一列位在同一时间最多只能被一列列车占用的相容性条件为约束、以提高存车线利用率和减少调车作业走行距离为优化目标,建立动车运用所存车线运用的0-1规划优化模型;考虑到如果同一时间到达的动车组列车数量超过存车线的容纳能力而无法为全部动车组列车安排存车线的情况,为尽可能多的动车组列车安排存车线,对动车运用所存车线运用优化模型进行扩展,设计基于极大动车存车线运用方案k剔除邻域的模拟退火算法。以某动车运用所为例验证了该模型和算法的合理性。 A 0--1 planning optimization model for stabling track management at EMU running shed was established, with the fixed EMU holding time on the stabling track as precondition, with the compatible condition that one train position could be occupied by only one train at most at the same time as the constraint, with improving the operating factor of stabling track and reducing running distance of shunting operation as optimization objectives. In case the number of the arrival EMUs at the same time exceeded the holding capacity of stabling tracks and it was impossible to arrange the stabling tracks for all arrived EMUs, the optimization model for stabling track management at EMU running shed was extended so as to arrange the stabling tracks for as many EMUs as possible. Therefore, simulated annealing algorithm based on k rejecting neighborhood of maximum EMU stabling track operation plan was designed. Taking certain EMU running shed for example, the rationality of the presented optimization model and algorithm was val- idated.
出处 《中国铁道科学》 EI CAS CSCD 北大核心 2013年第1期121-125,共5页 China Railway Science
基金 铁道部科技研究开发计划项目(2011J002)
关键词 动车运用所 存车线运用 优化模型 k剔除邻域 模拟退火算法 EMU running shed Stabling track management Optimization model k rejecting neighbor-hood Simulated annealing algorithm
  • 相关文献

参考文献10

二级参考文献31

  • 1史峰,谢楚农,于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报,2004,26(4):5-9. 被引量:42
  • 2谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5):130-133. 被引量:55
  • 3曹家明,范征,毛节铭.编组站作业优化决策支持系统——解体子系统[J].铁道学报,1993,15(4):66-73. 被引量:16
  • 4刘军.一类复杂规划问题的分层规划方法[J].北方交通大学学报,1995,19(3):401-406. 被引量:3
  • 5玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..
  • 6刘勇 康立山 陈毓屏.非数值并行算法(第一册)模拟退火算法[M].北京:科学出版社,1994..
  • 7刘勇 康立山 陈毓屏.非数值并行算法(第1册)模拟退火算法[M].北京:科学出版社,1994.157—163.
  • 8KROON L G, ROMEIJN H E, ZWANEVELD P J. Routing Trains through Railway Stations: Complexity Issues[J]. European Journal of Operational Research, 1997, 98 (3) : 485-498.
  • 9ZWANEVELD P J. Railway Planning-Routing of Trains and Allocation of Passenger Lines[D]. Rotterdam: Erasmus University Rotterdam, 1997.
  • 10ZWANEVELD P J, DAUZERE-PERES S, HOESEL C P M V, et al. Routing Trains through Railway Stations: Model Formulation and Algorithms [J]. Transportation Science, 1996, 30 (3): 181-194.

共引文献146

同被引文献74

引证文献11

二级引证文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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