Abstract: Dynamic weapon target assignment (WTA) problem is an important theoretical problem for military operation research and a challenging practical concern in the process of combat command. A constraint satisfaction problem (CSP) model for the dynamic WTA problem is constructed, and a novel heuristic algorithm named as stochastic variable neighborhood tabu search (SVNTS) is proposed to solve the model. Compared with the static WTA models, the shoot time of weapons can be specified and the utilization efficiency of weapons can be enhanced by the time and pairing optimization in the proposed models. The SVNTS algorithm which has high calculation speed can solve the large scale dynamic WTA problems. Simulation results show that the proposed models and algorithms are effective.

Key words: dynamic weapon-target assignment, constraint programming, variable neighborhood, tabu search algorithm

摘要： 动态武器目标分配(Weapon Target Assignment，WTA)问题是军事运筹学研究的重要理论问题，也是作战指挥决策中迫切需要解决的现实问题。运用约束规划方法建立了动态WTA问题的约束满足问题（Constraint Satisfaction Problem，CSP）模型。提出了随机变邻域禁忌搜索（Stochastic Variable Neighborhood Tabu Search，SVNTS）算法对模型进行求解。与静态WTA模型相比，动态WTA模型通过时间优化以及匹配优化解决了武器射击时机问题，提高了武器利用效率。SVNTS算法运算速度快，解的质量基本令人满意，可用于解决较大规模的动态WTA问题。最后通过仿真实验，验证了模型和算法的有效性。

关键词: 动态武器目标分配问题, 约束规划, 变邻域, 禁忌搜索算法