Abstract:

The problem of weapon target allocation is a study of how to allocate weapons to multiple targets that can pose a threat when two sides engage in combat according to certain distribution rules, with the aim of achieving the best strike effect. It is also a classic combinatorial optimization problem in the field of military operations research. This article proposes the problem of weapon target allocation under the bipartite graph matching model and establishes a relevant mathematical model. Finally, the Kuhn-Munkres algorithm combined with greedy strategy is used to solve the model. The effectiveness of the proposed model and algorithm is tested by using 20 randomly generated instances of different sizes. The computational experiments result show that the proposed model and algorithm have high solving accuracy and fast solving speed, and can meet the requirements for fast solution of optimal decisions for weapon target allocation problems.

Key words: weapon target allocation problem, weighted bipartite graph, greedy strategy, Kuhn-Munkres algorithm