基于遗传算法的动车运用所一级检修作业计划优化.pdfVIP

文章编号: 1003-1421(2016)08-0059-07 中图分类号: U266.2; U269 文献标识码:A DOI: 10.16668/j.cnki. issn.1003-142 1. 2016.08.11 基于遗传算法的现革运用所 -级雄修作业计划优化 Optimization of First-Level Maintenance Plan in EMU Depot based on Genetic Algorithm 量佳楠，聂磊，贺振攻 TONG Jia-nan , NIE Lei , HE Zhen-huan (北京交通大学交通运输学院，北京 100044) (School of Traffic and Transportation , Beijing Jiaotong University , Beijing 100044 , China) 摘 要:在动车运用所的洗车线、检修线等固定设备已定的前提下，合理安排动车 组一级检修作业计划对提高动车运用所的检修能力具有重要意义。动车组由于长短 编组不同，在检修时对双列位检修线的占用情况也不同。以同一列位在同一时间最 多只能被1 列动车组占用的时空相容性及动车组运用计划为约束条件，以最后 1 列 动车组检修完成时间最小为目标，建立动车所一级检修作业计划优化模型，将问题 转化为带特殊工艺约束的混合flow-shop 调度问题，并采用自适应的遗传算法进行求 解。最后以某动车运用所为例，验证模型和算法的可行性及有效性。 关键词:动车运用所g 一级检修;混合flow-shop; 遗传算法 Abstract: Under the preconditions of fixed equipments like washing siding and maintenance tracks in EMU depot having been determined , reasonable arrangement of first-Ievel EMU maintenance plan has an impo同ant significance for increasing the depots maintenance capacity. As each maintenance track can be occupied by two short-formation EMUs, EMUs with different formation occupy the maintenance track in different ways. Taking the space compatibility and the EMU operation plan as the constraints , and taking minimization of the last EMUs completion time as the object, the optimization model of fjrst-Ievel maintenance plan in EMU depot is established , and then , the original problem is transformed into a hybrid flow-shop scheduling problem with special process constraints , and self-adaptive genetic afgorithm is used to sofve the modef. fn the end , taking an EMU depot as an exampfe , this p