检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国铁道科学研究院电子计算技术研究所,北京100081
出 处:《中国铁道科学》2013年第1期121-125,共5页China Railway Science
基 金:铁道部科技研究开发计划项目(2011J002)
摘 要:以给定动车组列车占用存车线时间为前提、以同一列位在同一时间最多只能被一列列车占用的相容性条件为约束、以提高存车线利用率和减少调车作业走行距离为优化目标,建立动车运用所存车线运用的0-1规划优化模型;考虑到如果同一时间到达的动车组列车数量超过存车线的容纳能力而无法为全部动车组列车安排存车线的情况,为尽可能多的动车组列车安排存车线,对动车运用所存车线运用优化模型进行扩展,设计基于极大动车存车线运用方案k剔除邻域的模拟退火算法。以某动车运用所为例验证了该模型和算法的合理性。A 0--1 planning optimization model for stabling track management at EMU running shed was established, with the fixed EMU holding time on the stabling track as precondition, with the compatible condition that one train position could be occupied by only one train at most at the same time as the constraint, with improving the operating factor of stabling track and reducing running distance of shunting operation as optimization objectives. In case the number of the arrival EMUs at the same time exceeded the holding capacity of stabling tracks and it was impossible to arrange the stabling tracks for all arrived EMUs, the optimization model for stabling track management at EMU running shed was extended so as to arrange the stabling tracks for as many EMUs as possible. Therefore, simulated annealing algorithm based on k rejecting neighborhood of maximum EMU stabling track operation plan was designed. Taking certain EMU running shed for example, the rationality of the presented optimization model and algorithm was val- idated.
关 键 词:动车运用所 存车线运用 优化模型 k剔除邻域 模拟退火算法
分 类 号:U269.2[机械工程—车辆工程] U292.13[交通运输工程—载运工具运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.74.90