Abstract There exist systems which can be usefully described by a network containingarcs through which a commodity of one type flows. This paper is concerned with finding a solution procedure for a particular multi-commodity flow network design problem. The problem is to identify a set of arcs in the network such that if travel is prohibited in them all flow travels by feasible paths and its total cost is minimal. The total flow in each arc may not exced its capacity, which is a known constant. Each arc and each node of the network has a non-negative constant unit traversal cost. Between each pair of distinct nodes there is a given non-negative rate of flow from the first vertex to the second which may be split up among a number of paths according to some constant traversal cost flow assignment process. The optimality criterion is the total traversal cost of all flow, which is to be minimized. Previous work on network design problems of this type is surveyed. The principal contribution of this paper is the presentation of a solution procedure for the above problem based on branch and bound enumeration. An illustrative numerical example is included. Computational experience gained in using the procedure with a FORTRAN IV program on an IBM 370 is favourable.
A multi-commodity flow network design problem
Transportation Research Part B: Methodological ; 15 , 4 ; 273-283
1980-05-24
11 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A kinematic wave theory of multi-commodity network traffic flow
Online Contents | 2012
|A kinematic wave theory of multi-commodity network traffic flow
Elsevier | 2012
|