| 对最大化指派问题的一种新算法的探讨 |
| |
| 作者姓名： | 马晓娜 |
| |
| 作者单位： | 宿州学院,安徽宿州,234000 |
| |
| 基金项目： | 安徽省优秀青年人才基金项目 |
| |
| 摘 要： | 针对指派问题中最大化问题的匈牙利解法,提出了一种不同于传统解法的最大化问题的求解方法。该方法不必一开始就去用新的系数矩阵代替原系数矩阵,而是可直接在原系数矩阵上进行求解。其方法主要是求出系数矩阵中相邻两行的对应元素之差,然后,在这两行中选出产生最大差额的两个元素中的最大元素。此方法简洁、直观,并且优于匈牙利变形解决最大化指派问题。
|
| 关 键 词： | 指派问题 匈牙利法 差额 |
Assignment Question to the Maximization One New Algorithm Discussion |
| |
| Authors: | MA Xiao-na |
| |
| Abstract: | Based on Hungary solution for the maximum assignment problem,this paper puts forward a solution for the maximum problem which is different from the traditional solution.This solution can solve problem by original coefficient matrix directly.Instead of replacing the original coefficient matrix with new coefficient matrix from beginning.Its method mainly is extracts in the coefficient matrix difference of the neighboring two lines of corresponding elements,then selects in these two lines produces in the maximum differential the bigger of two elements.This method is succinct,direct-viewing,and surpasses Hungary to distort the solution maximization to the assignment problem. |
| |
| Keywords: | assignment problem hungary solution difference |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
