检索规则说明: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期108-116,共9页China Railway Science
基 金:铁道部科技研究开发计划项目(T14D00121);中央高校基本科研业务专项资金资助项目(2014JBZ2008;T15JB00050)
摘 要:针对网络化运行条件下动车组运用存在多线路、多运行线、多动车组、多动车段、多修制修程等复杂情况,设计1种更直观表现网络化运行条件下的"网络化动车组运用计划图"。以检修作业包的里程和时间、动车段(动车运用所)检修能力、最小接续时间等为约束条件,构建以动车组使用数目最少为最优目标、检修次数最少为次优目标的动车组运用双目标规划优化模型;将编制动车组运用计划的经验加入专家系统,并通过设计基于专家系统指导的最大最小蚁群算法求解模型。以京沪、沪杭、宁杭、京津、沪宁、胶济线上共计432条列车运行线为例,求解动车组运用计划。结果表明:与仅用蚁群算法相比,该算法在一定程度上减少了动车组的使用数量。According to the complex situations of EMU operation on network, such as more lines, more operation lines, more EMUs, more EMU depots as well as more repair systems and cycles, we propose a network EMU scheduling diagram, which is clearer to display the information of EMU scheduling in net- work circumstance. Then a hi-objective programming optimization model for EMU operation is established with the regular running mileage and time of maintenance operation package, the repair capacity of EMU depot (EMU running shed) and the minimum connecting time as its constraints, with the minimum num- ber of EMUs as its optimal target and with the least repair times as its suboptimal target. The experience {or making EMU scheduling is added to expert system. The Max-Min Ant System (MMAS) directed hy Expert System is proposed to solve the model. Based on 432 train operation lines, we solve an EMU scheduling of a network composed of Beijing-Shanghai, Shanghai-Hangzhou, Nanjing-Hangzhou, Beijing- Tianjin, Shanghai-Nanjing and Jinan-Qingdao lines. Results show that the solution has reduced the number of EMUs to a certain extent compared to the result by using ant colony optimization alone.
分 类 号:U268.1[机械工程—车辆工程] U292.6[交通运输工程—载运工具运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.83.143