广义运输问题的状态算法  

Out-of-kilter method for generalized transportation problem

作　　者：甘泉[1] 殷翔[2] 

机构地区：[1]南京工业大学理学院,江苏南京210009 [2]东南大学数学系,江苏南京210096

出　　处：《南京工业大学学报（自然科学版）》2005年第6期56-59,共4页Journal of Nanjing Tech University(Natural Science Edition)

摘　　要：经典运输问题在实际应用中有很大的局限性,推广后可以得到具有运输能力限制、供求量可以变化的广义运输问题。广义运输问题不能用运输问题的表上作业法进行求解。利用网络流算法对广义运输问题进行求解。我们首先将广义运输问题等价化为最小费用循环流模型,然后根据求最小费用循环流的状态算法,构造了求解用于广义运输问题的有效方法。The classic transportation problem is limited in practice. It can be extended to generalized transportation problem with variable limited transportation ability, supply and demand. Generalized transportation problem can＇t be solved by table working method. In this paper, generalized transportation problem was solved by using networks method. At first, a minimum cost circulation model which is equal to generalized transportation problem was built, then the out-of-kilter method to solve the generalized transportation problem was used efficiently.

关 键 词：广义运输问题 最小费用循环流 状态算法 

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