检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王宏刚[1,2] 白朋 邹庆茹 赵玲 WANG Honggang;BAI Peng;ZOU Qingru;ZHAO Ling(School of Information Science and Engineering,Chongqing Jiaotong University,Chongqing 400074,China;School of Traffic and Transportation,Chongqing Jiaotong University,Chongqing 400074,China)
机构地区:[1]重庆交通大学信息科学与工程学院,重庆400074 [2]重庆交通大学交通运输学院,重庆400074
出 处:《重庆交通大学学报(自然科学版)》2021年第5期13-18,共6页Journal of Chongqing Jiaotong University(Natural Science)
基 金:重庆市教委重点项目(KJZD-K20190070)。
摘 要:针对地铁列车返回车辆段时的股道安排问题,首先对股道运用不合理而引起的回段列车无法顺利作业的情况进行分析,将股道运用不合理引起的作业代价转换为额外的调车作业,并在列车运行计划和检修计划的基础上,以总的调车次数最小为优化目标,建立了接车时的股道运用优化模型,以提高车辆段的生产效率。最后,以某地铁车辆段为例,采用非支配排序遗传算法对模型进行求解及仿真分析,验证了模型的有效性和正确性。For the problem of track arranging when trains returned to a depot,all situations that returning trains could not be maintained smoothly according to the maintain plan due to the unreasonable track arranging were analyzed,and the operating cost caused by the unreasonable track arranging were transformed into additional shunting works.Based on the train operation plan and the maintenance plan,the optimization model of track arranging for metro depots which took the minimum times of total shunting works as the optimization objective was established,in order to improve the production efficiency of metro depots.Finally,taking a metro depot as an example,the non-dominated sorting genetic algorithm was used to solve the proposed model and carry out the simulation analysis,which verified the effectiveness and correctness of the proposed model.
关 键 词:交通运输工程 地铁车辆段 股道安排 调车 非支配排序遗传算法
分 类 号:U292.4[交通运输工程—交通运输规划与管理] TP39[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229