平衡和不平衡运输问题与分配问题的通用迭代算法  

A Common Iteration Algorithm of Balanced and Unbalanced Transportation Problems and Assignment Problems

作　　者：郭强[1] 陈新庄[1] 

机构地区：[1]西北工业大学理学院应用数学系,陕西西安710072

出　　处：《运筹与管理》2007年第6期57-62,共6页Operations Research and Management Science

摘　　要：将不平衡运输问题转化成网络最短路问题,利用Floyd算法规则,给出了一种既可以解平衡和不平衡运输问题,又可以解平衡和不平衡分配问题的通用迭代算法。与专门用于解运输问题的闭合回路法和专门用于解分配问题的匈牙利法相比,这种算法不但具有通用的优点,而且更便于在计算机上运行。The unbalanced transportation problem is changed to the shortest path problem on network in this paper. A common iteration algorithm that can not only solve the balanced and unbalanced transportation problems, but also solve the balanced and unbalanced assignment is proposed by using the rule of Floyd algorithm. The algorithm is more convenient than closed circuit method of solving transportation problem and Hungary method of solving assignment problems for computers.

关 键 词：分配问题 运输问题 最短路问题 FLOYD算法 

分 类 号：O221[理学—运筹学与控制论]