动车运用所调车作业计划优化编制模型与算法  

Model and Algorithm for Optimized Formulation of Scheduled Shunting Operation Plans of Electric Multiple Units Depots

作　　者：王忠凯[1] 史天运[1] 张惟皎[1] 王辉[1] 

机构地区：[1]中国铁道科学研究院电子计算技术研究所,北京100081

出　　处：《铁道学报》2013年第8期1-9,共9页Journal of the China Railway Society

基　　金：铁道部科技研究开发计划(2011J002)

摘　　要：在动车运用所股道布局和检修资源已定的前提下,合理编制动车组调车作业计划对于提高动车运用所的检修能力具有重要意义。以动车运用所的股道连通关系、时空占用相容性、动车组运用计划和检修计划为约束条件,以减少动车运用所关键检修线区无效占用时间和减少调车路径费用为目标,建立动车运用所调车作业计划编制优化模型。将原问题转化为具有附加时空约束的车间调度问题,构造调车任务拓扑图,采用改进的最大最小蚁群系统求解。以某动车运用所的实际调车作业为算例,结果证实了模型和算法的有效性。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.

关 键 词：动车运用所 调车作业计划 最大最小蚁群系统 

分 类 号：U292.2[交通运输工程—交通运输规划与管理]