Research on Dynamic Weapon Target Assignment Problem Based on SVNTS Algorithm

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 algorithm are effective.