학술논문
二分图匹配模型下的武器目标分配问题 / Weapon target allocation problem based on matching model of bipartite graphs
Document Type
Academic Journal
Author
Source
系统工程与电子技术 / Systems Engineering and Electronics. 46(2):549-560
Subject
Language
Chinese
ISSN
1001-506X
Abstract
武器目标分配问题是研究双方交战时,按照一定分配原则将武器分配给多个能造成威胁的对方目标,从而达到最佳打击效果的问题,也是军事运筹学领域经典的组合优化问题.提出了二分图匹配模型下的武器目标分配问题,并建立了相关的数学模型,最后运用结合了贪心策略的Kuhn-Munkres算法对模型进行求解.通过使用随机生成的20个规模不同的实例来测试所提模型与算法的有效性.计算实验结果表明,提出的模型与算法求解精度高、求解速度快,可以满足武器目标分配问题快速做出最优决策的要求.
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.
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.