检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学信息系统与管理学院,湖南长沙410073
出 处:《国防科技大学学报》2017年第1期102-108,共7页Journal of National University of Defense Technology
基 金:国家自然科学基金资助项目(71501182;71571185)
摘 要:针对武器装备组合规划中存在的选择难、规划难问题,在给定能力需求的条件下,从分析装备的组合变更对整体体系的影响出发,考虑了总的经费预算、年度费用分配、装备规划周期等约束,以能力差距和发展风险最小为准则,构建了双目标优化模型,并设计了基于差分进化和非支配排序的遗传算法的求解算法,获得模型的Pareto解。通过逼近理想解排序法方法从所求Pareto解中求得令决策者满意的折中解。通过一个具体示例验证了模型和算法的有效性,能够为武器装备组合规划提供辅助决策。Aiming at solving the difficulties of choosing and planning in the weapon systems development problems, a bi-objective optimization model was proposed to minimize the capability gaps plus the total risk values, and to look for the best development scheme by comparing different combinations of weapons based on the given capability requirements. The total budget limitation, annual budget constraint and the planning period were taken into account in this model. A solving algorithm, based on non-dominated sorting genetic algorithm- II and differential evolution, was presented to obtain the Pareto set. The technique for order preference by similarity to ideal solution method was employed to reach a final compromise solution. A case was studied to demonstrate the effectiveness of the proposed model and hybrid algorithm, which can support the decision making on the weapons development and planning.
关 键 词:武器装备 组合规划 非支配排序的遗传算法 差分进化 逼近理想解排序法
分 类 号:O22[理学—运筹学与控制论] N94[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222