具有条件风险值的动态火力分配方法

针对火力分配（weapon-target assignment,WTA）中的不确定性因素，研究了一类目标数量和类型不确定的动态火力分配问题。首先，构建了最小总任务费用的确定型WTA模型；其次，引入时间变量、想定模式和风险值约束，把确定型WTA问题转化为具有条件风险值约束的两阶段动态WTA问题，并用线性不等式集代替条件风险值约束，从而把动态WTA问题转化为混合整数规划问题；最后，设计一种循环多次交换禁忌搜索算法。仿真结果表明,新算法能够在较短时间内求解较大规模动态WTA的优化问题。

Dynamic weapon-target assignment with conditional value-at-risk

Aiming at the uncertainties in weapon-target assignment(WTA), the dynamic weapon-target assignment(DWTA) problem with the uncertain number and types of targets is studied. Firstly, the deterministic WTA model is built on the minimum total cost of the mission. Secondly, with time variable and scenario mode and conditional value-at-risk(CVaR) constraint, a deterministic WTA problem is transformed into two-stage DWTA problem with CVaR constraint. The DWTA problem can be formulated as a mixed-integer programming(MIP) problem when the CVaR constraint is represented by a set of linear inequalities. Finally, a kind of cyclic multiexchange tabu search(CME-TS) algorithm is designed to solve a more large-scale DWTA problem, and the simulation result shows that new algorithm can solve it in a short time.