运输问题新解法的探讨  

Study on new method of transportation problems

作　　者：贾春玉[1] 

机构地区：[1]长春大学管理学院,吉林长春130022

出　　处：《系统工程学报》2004年第2期207-211,217,共6页Journal of Systems Engineering

摘　　要：在求解运输问题中,传统的解法比较繁琐.为了克服这一缺陷,提出了快捷新解法.快捷法求解运输问题不仅比表上作业法计算步骤少、简单,而且比广义匈牙利法(常规法)的计算步骤还少、还简单.快捷法是根据约束条件的要求,基本上是一步到位造出每行及每列所需要的零元素.然后检验是否满足约束条件,满足可得最优解,否则需进一步造零.快捷法总是比表上作业法计算步骤少、简单且便于掌握.The traditional methods are complex when solving transportation problems. To overcome this defect, a new method is created. For solving transportation problems the quick algorithm is not only simpler and fewer computing steps than the simplex algorithm but also more easer and fewer computing steps than the generaliged Hungarian algorithm (normal algorithm). The quick algorithm almost directly creates enough zeros for each row and each column according to the restrain conditions. And then one should check if it meets the restrain conditions or not. If the answer is yes then get the optimal policy, otherwise continually create zeros. The quick algorithm is always better than the simplex algorithm and easer to study.

关 键 词：运输问题 闭回路法 目标函数 指派问题 运筹问题 

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