Multicommodity network flows - A survey

This report aims at a comprehensive survey of the literature dealing with the multicommodity flow problem. This problem arises naturally in network modelling wherever commodities, vehicles, or messages are to be shipped or transmitted from certain nodes of an underlying network to some others. Recent applications of mathematical programming techniques to traffic equilibrium problems in transportation studies as well as computer networks analysis has renewed considerable interest in this problem. This report discusses solution techniques for both linear and nonlinear flow problems. The former includes decomposition, partitioning, compact inverse methods, and primal-dual algorithms. Described is a variety of feasible direction methods for the latter. The report concludes by giving applications and computational experience for both types of problems.

[1]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[2]  Jacques A. Ferland,et al.  Minimum Cost Multicommodity Circulation Problem with Convex Arc-Costs , 1974 .

[3]  S. Nguyen.  An Algorithm for the Traffic Assignment Problem , 1974 .

[4]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[5]  I. T. Frisch,et al.  Common Terminal Multicommodity Flow with a Concave Objective Function , 1970 .

[6]  E. R. Petersen.  A Primal-Dual Traffic Assignment Algorithm , 1975 .

[7]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[8]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[9]  J.-C. Arinal,et al.  Maximal biflow in an undirected network , 1969 .

[10]  I. T. Frisch,et al.  On the 3-Commodity Flow Problem , 1969 .

[11]  Cary Swoveland.  A Two-Stage Decomposition Algorithm For A Generalized Multi-Commodity Flow Problem , 1973 .

[12]  B. Rothschild,et al.  Feasibility of Two Commodity Network Flows , 1966, Oper. Res..

[13]  Sang Nguyen,et al.  A Unified Approach to Equilibrium Methods for Traffic Assignment , 1976 .

[14]  R. Chien,et al.  VII. Communication Networks , 1964 .

[15]  R. M. Oliver,et al.  Flows in transportation networks , 1972 .

[16]  M. R. Rao,et al.  Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems , 1968, Oper. Res..

[17]  Richard C. Grinold.  Letter to the Editor - A Multicommodity Max-Flow Algorithm , 1968, Oper. Res..

[18]  Klaus Darga.  On-Line Inquiry Under a Small-System Operating System , 1970, IBM Syst. J..

[19]  Richard C. Grinold.  Letter to the Editor - A Note on Multicommodity Max-Flow , 1969, Oper. Res..

[20]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[21]  P. Macdonald.  Optimization Methods for Resource Allocation , 1974 .

[22]  Arthur M. Geoffrion,et al.  Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems , 1970, Oper. Res..

[23]  Daniel J. Kleitman,et al.  An algorithm for certain multi-commodity flow problems , 1971, Networks.

[24]  D. Panagiotakopoulos.  Multi-Commodity Multi-Transformed Network Flows with an Application to Residuals Management , 1976 .

[25]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[26]  M. Sakarovitch,et al.  Two commodity network flows and linear programming , 1973, Math. Program..

[27]  Bruce L. Golden,et al.  A minimum-cost multicommodity network flow problem concerning imports and exports , 1975, Networks.

[28]  J. Surkis,et al.  An operations research approach to racial desegregation of school systems , 1968 .

[29]  L. Cooper,et al.  The Transportation-Production Problem , 1974 .

[30]  Earl R. Ruiter.  Network Equilibrium Capabilities for the UMTA Transportation Planning System , 1976 .

[31]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[32]  H. Chen,et al.  A generalized chain labelling algorithm for solving multicommodity flow problems , 1974, Comput. Oper. Res..

[33]  Sang Nguyen,et al.  On the Combined Distribution-Assignment of Traffic , 1975 .

[34]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[35]  R. W. Klessig,et al.  An algorithm for nonlinear multicommodity flow problems , 1974, Networks.

[36]  Michael D. Grigoriadis,et al.  A partitioning algorithm for the multicommodity network flow problem , 1972, Math. Program..

[37]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

[38]  T. L. Magnanti.  OPTIMIZATION FOR SPARSE SYSTEMS , 1976 .

[39]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[40]  D. Tang.  Bi-Path Networks and Multicommodity Flows , 1964 .

[41]  Richard D Wollmer,et al.  THE DANTZIG-WOLFE DECOMPOSITION PRINCIPLE AND MINIMUM COST MULTICOMMODITY NETWORK FLOWS , 1969 .

[42]  Darwin Klingman,et al.  Solving Constrained Transportation Problems , 1972, Oper. Res..

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

[44]  John J. Jarvis,et al.  Minimal disconnecting sets in directed multi‐commodity networks , 1972 .

[45]  Michael Florian,et al.  A Method for Computing Network Equilibrium with Elastic Demands , 1974 .

[46]  John E. Cremeans,et al.  THE MULTICOMMODITY NETWORK FLOW MODEL REVISED TO INCLUDE VEHICLE PER TIME PERIOD AND NODE CONSTRAINTS , 1972 .

[47]  Ivan T. Frisch,et al.  Letter to the Editor - Common Terminal Multicommodity Flow , 1968, Oper. Res..

[48]  Michael Florian,et al.  Traffic Equilibrium Methods , 1976 .

[49]  M. A. Hall,et al.  Traffic Equilibria Analysed Via Geometric Programming , 1976 .

[50]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[51]  James R. Evans.  A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem , 1976, Math. Program..

[52]  Mandell Bellmore,et al.  Multi-Commodity Disconnecting Sets , 1970 .

[53]  Charles J. McCallum.  A generalized upper bounding approach to a communications network planning problem , 1977, Networks.

[54]  John J. Jarvis.  On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem , 1969 .

[55]  M. Bellmore,et al.  A Multivehicle Tanker Scheduling Problem , 1971 .

[56]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[57]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[58]  Michael Florian,et al.  Recent Experience with Equilibrium Methods for the Study of a Congested Urban Area , 1976 .

[59]  J. A. Tomlin,et al.  A Mathematical Programming Model for the Combined Distribution-Assignment of Traffic , 1971 .

[60]  Leonard Kleinrock,et al.  The processor-sharing queueing model for time-shared systems with bulk arrivals , 1971, Networks.

[61]  John E. Cremeans,et al.  Optimal multicommodity network flows with resource allocation , 1970 .

[62]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[63]  Salah Eldin Elmaghraby.  Some Network Models in Management Science , 1974 .

[64]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[65]  R. Grinold.  Steepest Ascent for Large Scale Linear Programs , 1972 .

[66]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[67]  Larry J. LeBlanc,et al.  An Analysis and Comparison of Behavioral Assumptions in Traffic Assignment , 1976 .