检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈春良[1] 昝翔 张仕新[1] 刘彦[1] 陈伟龙[1] CHEN Chunliang;ZAN Xiang;ZHANG Shixin;LIU Yan;CHEN Weilong(Deparimeni of Technical Support Engineering , Academy of Armored Force Engineering , Beijing 100072, China)
机构地区:[1]装甲兵工程学院技术保障工程系,北京100072
出 处:《系统工程与电子技术》2017年第12期2716-2720,共5页Systems Engineering and Electronics
基 金:军队科研计划项目(2015WG57)资助课题
摘 要:针对装备维修任务路径规划问题中约束条件多样的特点,构建装备维修任务路径规划模型,充分考虑时间约束和负载能力约束的影响。通过对比装备维修任务路径规划问题与传统车辆路径规划问题的异同点,提出一种基于改进最大-最小蚂蚁系统的维修任务路径规划方法,从维修任务选择规则、信息素更新规则和先验信息获得规则3个方面对最大-最小蚂蚁系统进行改进。最后,通过算例和对比验证该方法的合理性和有效性。Based on the analysis of the characteristic of various constraints in equipment maintenance task routing plan,a model of equipment maintenance task routing plan is established.In the model,the influence of time constraint and load capacity constraint is fully considered.Through comparing similarities and differences between the equipment maintenance task routing plan problem and the traditional vehicle routing problem,a maintenance task routing plan method based on improved max-min ant system(MMAS)is presented.Rules of selecting maintenance,pheromone updating and acquiring prior information of MMAS are improved.Finally,through an example and comparison,the verifiability and effectuality of the algorithm are verified.
分 类 号:E917[军事] O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200