基于匈牙利算法的协同作战排序问题最优解

Algorithm to Minimize Total Spending Time on Muti-targets Combat

介绍了匈牙利算法,讨论了多目标空战中,将多个目标机分派给多攻击机进行攻击的排序问题,并利用匈牙利算法得到问题最优解。利用数值例子说明了求解过程。

The Hungarian algorithm is introduced,and the problem of scheduling of a set of targets on several attackers is discussed.An algorithm to minimize the total spending time(attacking time plus waiting time)is described,in which attacking time of a job can be different on different attackers.The mathematical model of this problem is set up.The scheduling problem can be transformed to assignment problem,and the optimization solution can be obtained by Hungarian algorithm.A numerical example is given to explain the solution process.