检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭小乐[1] 宋瑞[1] 黎浩东[1] 陈胜波[1] 刘星材[1]
出 处:《中国铁道科学》2016年第1期117-123,共7页China Railway Science
基 金:国家自然科学基金重点资助项目(U1434207);国家自然科学基金资助项目(61374202)
摘 要:以动车组在动车运用所内的总延误时间最小为目标,以作业线数目、动车组数目以及动车组执行各项作业的顺序和占用作业线的时间为约束条件,建立动车运用所调车作业计划优化模型。设计微进化算法,求解每列动车组执行每项作业的起、止时刻,从而确定其作业顺序和完成最后一项作业的时刻,再根据动车运用所运用计划,得到每列动车组的延误时间,所有动车组延误时间的总和即为总延误时间;设计启发式规则,安排每列动车组完成各项作业所占用的作业线。以某动车运用所一级修的调车作业计划编制优化为例,验证了模型和算法的有效性和正确性。The optimization model for the shunting operation plan of EMU running shed was established with the aim of minimizing the total delay time of EMU in running shed, with the numbers of operation tracks and EMUs, operation sequence and the occupation time of operation tracks as constraints. Microevolution algorithm was designed to work out both the start and end time of each operation executed by each EMU, thus the operation sequence and the end time of the last operation was determined. According to the operation plan of EMU running shed, the delay time of each EMU was obtained, thus the total delay time was the delay summation of all EMUs. A heuristic rule was designed to assign the opera- tion track for each EUM to execute each operation. The effectiveness and correctness of the model and algorithm has been verified through optimizing the shunting operation plan for the first-level maintenance of certain EMU running shed.
关 键 词:调车作业计划 作业时间 延误时间 作业线 作业顺序 动车运用所
分 类 号:U268.1[机械工程—车辆工程] U292.2[交通运输工程—载运工具运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145