摘要
针对解决分配问题的匈牙利法运算步骤复杂的问题,提出一种新的迭代算法。该算法通过引入有向检测矩阵,利用Floyd算法进行迭代,求解出可行解即为最优解。与经典的匈牙利法相比,该算法更加简便,易于编制成计算机程序,适合于大规模分配问题的计算。
In solving an assignment problem with Hungary method, the iterative process is complex, and optimality judgment is monvenient. Therefore the concept of directed test matrix is proposed. On this basis, a new algorithm for solving an assignment problem is provided by using the principle of Folyd algorithm. Theoretical proof and application result demonstrate that the iterative process of the new algorighm is simple, and the optimality judgment is very convenient.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2004年第12期1915-1916,1949,共3页
Systems Engineering and Electronics
关键词
分配问题
匈牙利法
有向检测矩阵
可行解
最优解
assignment problem
Hungary method
directed test matrix
feasible solution
optimal solution
