动车组运用计划编制问题及其优化  

Operation Planning and Optimization of Motor Train-set

作　　者：罗荣辉[1] 王焕民[1] LUO Ronghui WANG Huanmin(Lanzhou Jiaotong University, Lanzhou 730070, Chin)

机构地区：[1]兰州交通大学,兰州730070

出　　处：《高速铁路技术》2017年第4期66-69,共4页High Speed Railway Technology

摘　　要：在不固定区段运行方式下,文章以动车组接续时间最短和动车组使用均衡为优化目标,将动车组运用计划问题归纳为特殊的旅行商问题,建立运用计划编制的数学模型,并利用蚁群算法进行求解。最后结合武广铁路进行实例验证,结果表明该算法可有效求解动车组运用计划。Under the operation mode of the unrestrained section, taking the shortest following time of EMU and the equilibrium of EMU as the optimization target, the problem of the operation of EMU is summed up as a special traveling salesman problem, it is solved by setting up the mathematical model of train-set operation planning and using ant colony algorithm. Finally, combined with the example verification of Wuhan Guangzhou railway line, the results show the algorithm can effectively solve＂ the operation plan of the motor train unit.

关 键 词：动车组运用计划 旅行商问题 蚁群算法 

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