针对解决C指派问题的匈牙利法运算步骤复杂的问题,提出一种新的迭代算法。该算法通过行调整和列调整,转化为一个平衡指派问题,再利用Floyd算法进行迭代,求解出可行解即为最优解。与经典的匈牙利法相比,该算法更加简便,易于编制成计算机程序,适合于大规模分配问题的计算。 In order to solve the problem of the C assignment problem of the Hungarian algorithm complex steps, a new iterative algorithm is proposed. The algorithm transforms to a balance assignment problem through row adjustment and column adjustment, and iteratively uses the Floyd algorithm to solve the feasible solution as the optimal solution. Compared with the classical Hungarian method, this algorithm is more simple and easy to be compiled into a computer program, which is suitable for the calculation of large-scale distribution problems.