论文部分内容阅读
分派问题是运筹学中一个具有实际应用价值的问题,文献〔1〕中已介绍了一个名叫“匈牙利解法”,这是目前最好的算法。但是这一算法还比较复杂,计算量较大,同时,在计算机上实现求解有一定困难。本文将提出一个新的算法——矩阵型算法,可克服上述不足之处。本算法既适用于笔算,也适用于计算机解算,从而可使用计算机求解较为复杂的分派问题。
The assignment problem is a practical problem in operational research. The literature [1] has introduced a method called “Hungarian solution”, which is the best algorithm at present. However, this algorithm is still relatively complex and computationally intensive, meanwhile, it is difficult to solve the problem on the computer. This article will propose a new algorithm - the matrix algorithm, to overcome the above deficiencies. This algorithm is suitable for both pen calculation and computer calculation, so that the computer can be used to solve the more complicated assignment problem.