静态武器目标分配问题的攻击界整数规划求解方法

静态武器目标分配(weapon-target assignment, WTA)问题的直接表现形态是非线性.在不丧失模型最优解的前提下,本文把WTA问题建模为整数线性规划(ILP)模型,并提出在最优武器分配方案中攻击特定目标的武器数量存在上界(攻击界).在采用启发式方法限定攻击界后,WTA问题的ILP模型的维数被大规模降低,使得求解能够在短时间内完成.与近年来发表于国内外期刊上的算例进行试算比较,结果显示本文提出的方法在求解速度和求解优化程度方面具有明显的优势.

An attack-number bounded integer programming method for the static WTA problem

The weapon-target assignment (WTA) problem is intuitively non-linear. In this paper the WTA problem is modelled as an integer linear program (ILP) without lose the problem's exact optimality, and it is proposed that there exists an upper bound of the number of attacking weapons for a specific target (the attack-number bound) providing the solution is optimal. By limiting the attack-number bound, the dimension of the ILP model of the WTA problem can be drastically decreased, and this enables the ILP of the WTA problem can be solved in short time. Computational experiments have been done on data provided by literature published in recent years, and the results show that the method proposed by this paper has clear advances over the traditional methods in both better optimality and faster computational speed.