期刊文献+

动车运用所调车作业计划优化编制模型与算法 被引量:19

Model and Algorithm for Optimized Formulation of Scheduled Shunting Operation Plans of Electric Multiple Units Depots
下载PDF
导出
摘要 在动车运用所股道布局和检修资源已定的前提下,合理编制动车组调车作业计划对于提高动车运用所的检修能力具有重要意义。以动车运用所的股道连通关系、时空占用相容性、动车组运用计划和检修计划为约束条件,以减少动车运用所关键检修线区无效占用时间和减少调车路径费用为目标,建立动车运用所调车作业计划编制优化模型。将原问题转化为具有附加时空约束的车间调度问题,构造调车任务拓扑图,采用改进的最大最小蚁群系统求解。以某动车运用所的实际调车作业为算例,结果证实了模型和算法的有效性。 On the premise of determinate marshalling yard and maintenance facilities of electric multiple units depots (EMUD), efficient and flexible shunting operation plans can greatly contribute to elevating the mainte- nance capacity of the depots. This paper established the integer programming models with the depots~ marshal- ling yard arrangements, occupation compatibility of resources, EMU operation and routine maintenance plans as the main constraints and with minimization of the unnecessary occupation time of the critical track area and costs of shunting paths as the objective functions. This paper transformed the original problem into a shop scheduling problem with additional space and time constraints, constructed a topological graph of shunting tasks, and designed a solving algorithm based on the MAX-MIN ant system for the model. Finally, it was vali- dated by a numerical example that the model and algorithm could obtain favorable results for the scheduled shunting operation process of EMUD.
出处 《铁道学报》 EI CAS CSCD 北大核心 2013年第8期1-9,共9页 Journal of the China Railway Society
基金 铁道部科技研究开发计划(2011J002)
关键词 动车运用所 调车作业计划 最大最小蚁群系统 electric multiple units depots shunting operation plan MAX-MIN ant system
  • 相关文献

参考文献9

二级参考文献28

  • 1史峰,谢楚农,于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报,2004,26(4):5-9. 被引量:42
  • 2谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5):130-133. 被引量:56
  • 3王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究[J].铁道学报,2005,27(6):1-9. 被引量:36
  • 4杨肇夏,李菊,孙晚华,韩雷,李智慧.铁路编组站技术作业模拟系统的研究[J].铁道学报,1996,18(A00):25-32. 被引量:19
  • 5KROON 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.
  • 6ZWANEVELD P J. Railway Planning-Routing of Trains and Allocation of Passenger Lines[D]. Rotterdam: Erasmus University Rotterdam, 1997.
  • 7ZWANEVELD 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.
  • 8ZWANEVELD P J, KROON L G, HOESEL C P M V. Routing Trains through a Railway Station Based on a Node Packing Model [J]. European Journal of Operational Research, 2001, 128:14-33.
  • 9玄光男 程润伟.遗传算法与工程优化[M].北京:清华大学出版社,2004..
  • 10Phillips, Don T. Fundamentals of network analysis[M].Prentice-Hall, Inc. ,1981.

共引文献128

同被引文献74

引证文献19

二级引证文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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