| 分配问题的一种新的迭代算法 |
| |
| 引用本文： | 郭强.分配问题的一种新的迭代算法[J].系统工程与电子技术,2004,26(12):1915-1916. |
| |
| 作者姓名： | 郭强 |
| |
| 作者单位： | 西北工业大学理学院应用数学系,陕西,西安,710072 |
| |
| 摘 要： | 针对解决分配问题的匈牙利法运算步骤复杂的问题,提出一种新的迭代算法。该算法通过引入有向检测矩阵,利用Floyd算法进行迭代,求解出可行解即为最优解。与经典的匈牙利法相比,该算法更加简便,易于编制成计算机程序,适合于大规模分配问题的计算。
|
| 关 键 词： | 分配问题 匈牙利法 有向检测矩阵 可行解 最优解。 |
| 文章编号： | 1001-506X(2004)12-1915-02 |
| 修稿时间： | 2003年10月25 |
New iterative algorithm for an assignment problem |
| |
| GUO Qiang.New iterative algorithm for an assignment problem[J].System Engineering and Electronics,2004,26(12):1915-1916. |
| |
| Authors: | GUO Qiang |
| |
| Abstract: | 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. |
| |
| Keywords: | assignment problem Hungary method directed test matrix feasible solution optimal solution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
