Abstract:

Dynamic weapon target assignment (DWTA) problem is an important theoretical problem for military operations research and a challenging practical concern in the process of combat command. The DWTA problem can not be solved by using a dynamic programming method which is useful to static weapon target assignment (SWTA). In considering attritions in both offensive and defensive weapon systems, a DWTA model is established and analyzed. The result indicates that the DWTA problem may try to solve with game theory. The strategy space is constructed, and the variable neighborhood search (VNS) algorithm is improved. The correctness and complexity of the VNS algorithm is analyzed, and the result indicates that the VNS is quick and effective.