检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学信息系统工程重点实验室,长沙410073 [2]军事科学院军事运筹研究所,北京100091
出 处:《火力与指挥控制》2014年第1期9-12,共4页Fire Control & Command Control
基 金:国家自然科学基金资助项目(71001105;91024006)
摘 要:处理了如何从具有复杂关联和多种约束的目标集中选择目标的问题。首先,对目标集的组成结构和目标间的相互关联关系进行了描述,并分析了目标选择的两种约束类型,建立了多约束多关联条件下的目标选择模型。然后使用惩罚函数将多约束目标选择问题转化为无约束问题,给出了用遗传算法求解模型的方法步骤。最后通过案例表明,该方法结果稳定,优化效果好,能够在目标间具有复杂关联的条件下为军事人员进行目标选择决策提供有效的辅助。This article deals with target selecting from the target set having complex relation and multiple contraints. Firstly,the structure of the target set and the relation among the targets of the set are described,and the two kinds of target selecting constraints are analyzed,and the target selecting model under multi-constraint and multi-relation is constructed. Secondly,the punishment function is used to transform the multi-constraint target selecting problem into an unconstrained problem,and a method based on the genetic algorithm is presented to solve the model. Finally,an instance demonstrates that the method has steady and good effect,and can provide assurance for target selecting decision making under the conditions of complex relations among targets.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62