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.