Applications of Maximal Network Flow Problems in Transportation and Assignment Problems

This paper presents some modifications of Ford-Fulkerson’s labeling method for solving the maximal network flow problemwith application in solving the transportation and assignment problems. The modifications involve the tree representationof the nodes labeled and the edges used them. It is shown that after each flow adjustment some of the labels canbe retained for the next labeling process. Through certain computational aspects it has been suggested that to indicatethat with theses the primal-dual approach for solving the transportation and assignment problems is improved to certainextent.

[1]  Heiner Mueller-Merbach,et al.  An Improved Starting Algorithm for the Ford-Fulkerson Approach to the Transportation Problem , 1966 .

[2]  Darwin Klingman,et al.  The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .

[3]  Robert Garfinkel,et al.  The bottleneck transportation problem , 1971 .

[4]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[5]  Ellis L. Johnson,et al.  Networks and Basic Solutions , 1966, Oper. Res..

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[8]  Michael Florian,et al.  AN EXPERIMENTAL EVALUATION OF SOME METHODS OF SOLVING THE ASSIGNMENT PROBLEM , 1969 .

[9]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[10]  G. Bennington.  An Efficient Minimal Cost Flow Algorithm , 1973 .

[11]  Darwin Klingman,et al.  Locating stepping-stone paths in distribution problems via the predecessor index method , 1970 .

[12]  Fred W. Glover,et al.  An improved version of the out-of-kilter method and a comparative study of computer codes , 1974, Math. Program..

[13]  Robert S. Garfinkel,et al.  Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem , 1971, Oper. Res..