基于可适应匈牙利算法的武器-目标分配问题

当前各类智能优化算法求解武器-目标分配问题时，存在耗时长、优化结果不唯一等缺陷，而匈牙利算法具有耗时短、求解结果稳定的优势，但其适应性较差，目前尚未见二者的对比分析文献。针对此现象，对比分析传统匈牙利算法与智能优化算法的耗时性与稳定性，展现了匈牙利算法的优势；提出统一效率矩阵，创建可适用于所有类型目标分配问题的可适应匈牙利算法；通过实例应用验证了可适应匈牙利算法的正确性。

Weapon-target Assignment Based on Adaptable Hungarian Algorithm

When various intelligent optimization algorithms are used to solve the weapon-target assignment problem, they have the disadvantages of long time-consuming and non-unique optimization results. Hungary algorithm has the advantages of short time-consuming and stable optimization results, but its adaptability is poor. Currently, the comparison and analysis of intelligent optimization algorithms and Hungarian algorithm has not been reported. For this phenomenon, the time-consuming and stability of traditional Hungarian algorithm and intelligent optimization algorithms are compared, which shows the advantages of Hungarian algorithm. An adaptable Hungarian algorithm that can be applied to all types of weapon-target assignment problems is established by proposing a unified efficiency matrix. And then some examples are used to verify the correctness of the adaptable Hungarian algorithm.