检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2015年第13期235-238,250,共5页Computer Engineering and Applications
基 金:内蒙古自治区高等学校科学研究项目(No.NJZC13030);内蒙古自然科学基金(No.2014BS0501)
摘 要:针对全路车辆修理量逐渐减少,各修理点修理能力严重过剩的现状,提出铁路车辆修理布局集中化方法。分析铁路车辆修理布局集中化的内涵,提出铁路车辆修理布局集中化双层规划模型的构建思路;以修理点改扩建费用、运营费用、运输费用之和最小为目标构建上层规划模型,以车辆运输费用最小为目标构建下层规划模型,并利用迭代思想,设计基于改进后的蚁群算法的双层迭代优化算法求解该双层规划模型。借助MATLAB软件进行算例分析,验证了模型的有效性。Focusing on the phenomenon that the maintenance workload in railway system is decreasing and that each maintenance center has surplus capacity,this paper proposes a method of the layout centralization for railway vehicle maintenance.First of all,it analyzes connotation of layout centralization for railway vehicle maintenance,proposes building thinking of the bi-level programming optimization model for the layout centralization for vehicle maintenance.Secondly,an upper model is established with the target of minimizing the total cost of reconstruction cost,operation cost and transport cost of maintenance center,the lower model is established with the target of minimizing the transport cost,and according to iterative thinking,designs double iterative optimization algorithm based on the improved ant colony algorithm to solve the bi-level programming model.Finally,the paper designs a case about it with solving the effectiveness of the model and the optimization algorithm.
分 类 号:U491.14[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15