带时间窗军事物资配送问题的NSGA-Ⅱ算法  

NSGA-Ⅱ algorithm for military resources distribution with time windows

作　　者：赵文飞[1] 周刚[1] 杨树杰[1] 董超[1] 

机构地区：[1]海军航空工程学院基础部,山东烟台264001

出　　处：《系统工程与电子技术》2015年第11期2513-2519,共7页Systems Engineering and Electronics

基　　金：国家自然科学基金(61205206);山东省自然科学基金(ZR2014AM006)资助课题

摘　　要：针对战场军事物资配送中带时间窗的路径优化问题,以运输距离、运输费用和风险性为目标,建立了带有时间窗的多目标网络运输模型,提出了一种改进的多目标遗传算法NSGA-Ⅱ。算法中引入剩余网络的概念,采用数值编码方式,增加了精英保留策略和小生境密度。仿真实验结果表明,本文建立的模型合理,算法在一定程度上克服了求解多目标优化问题过程中易陷入局部最优的现象,提高了战场上求解军事物资配送路径优化问题的效率,并能够使决策者根据仿真实验中的各项参数值自行择优选择运输方案。Aiming at the transportation problem of military resources distribution with time windows, a dy- namic network model of the vehicle routing problem inel^ding travel distance, cost and risk for targets is built, and an improved multi-objective genetic algorithm NSGA- Ⅱ is proposed. The algorithm introduces residual net- work, puts forward numeric code, and adds the elitism strategy and niche density. The simulation results show that the algorithm can avoid the phenomenon of leading to local optimization in some degree and improve the effi- ciency of solving military resources distribution route, and an effective solution for the transportation problem a- bout the supply of wartime equipment is provided.

关 键 词：军事物资 时间窗 多目标 NSGA-Ⅱ 

分 类 号：O224[理学—运筹学与控制论]