检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯妍君 沈建文 申樟虹 郭然 HOU Yanjun;SHEN Jianwen;SHEN Zhanghong;GUO Ran(Beijing General Municipal Engineering Design&Research Institute Co.,Ltd,Beijing 100082,China)
机构地区:[1]北京市市政工程设计研究总院有限公司,北京100082
出 处:《交通科技与经济》2021年第5期63-68,共6页Technology & Economy in Areas of Communications
基 金:北京市科技计划项目(Z191100002419006)。
摘 要:城市轨道交通线路车辆由运用车、检修车和备用车组成,通过研究城市轨道交通车辆检修与运用的关系问题,合理排布列车的维修运用计划,给出每列车适宜的日运行计划,优化检修车和备用车的配置数量。以列车每日运行需求、检修计划为约束条件,建立车辆运用计划模型,并以某城市轨道交通线路为案例,运用mathmatica计算,对比月修、架修、大修时列车的每日运行计划,优化每日列车开行次数,准确得到列车的到达检修时间及周期,从而避免大量列车同时到达检修周期。研究结果有助于解决列车的欠(过)修问题,使列车运用更加合理,为未来智慧化轨道交通的列车排布打下基础。The vehicle of urban rail transit lines are composed of service vehicles,maintenance vehicles and spare vehicles.By studying the relationship between the maintenance and operation of urban rail transit vehicles,and rationally arranging the maintenance and operation plans of trains,a suitable daily operation plan for each train is given,and the number of maintenance vehicles and spare vehicles are optimized.For the purpose of preventing a large number of trains from reaching the maintenance cycle at the same time,the daily operation demand of the train and the maintenance plan of the train are the constraints,and the vehicle operation plan model is established.Taking a city rail transit line as a case,this paper uses mathmatica to calculate,compare the daily train operation plan during monthly repair,erection and overhaul,and optimize the number of daily train trips,and accurately obtain the time and cycle of train arrival and maintenance,in order to avoid a large number of trains at the same time.The result will help solve the problem of under(over)repair of trains,make the use of trains more reasonable,and lay the foundation for future intelligent rail transit train arrangements.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229