Multicommodity network flows: The impact of formulation on decomposition
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper investigates the impact of problem formulation on Dantzig—Wolfe decomposition for the multicommodity network flow problem. These problems are formulated in three ways: origin-destination specific, destination specific, and product specific. The path-based origin-destination specific formulation is equivalent to the tree-based destination specific formulation by a simple transformation. Supersupply and superdemand nodes are appended to the tree-based product specific formulation to create an equivalent path-based product specific formulation. We show that solving the path-based problem formulations by decomposition results in substantially fewer master problem iterations and lower CPU times than by using decomposition on the equivalent tree-based formulations. Computational results on a series of multicommodity network flow problems are presented.
- Ali, A., Helgason, R., Kennington, J., Lall, H. (1980) Computational comparison among three multicommodity network flow algorithms. Operations Research 28: pp. 995-1000
- Assad, A.A. (1978) Multicommodity network flows-a survey. Networks 8: pp. 37-91
- Carolan, W.J., Hill, J.E., Kennington, J.L., Niemi, S., Wichmann, S.J. (1990) An empirical evaluation of the KORBX algorithms for military airlift applications. Operations Research 38: pp. 240-248
- Chen, C.E. (1990) A two-level decomposition algorithm for the stochastic multicommodity dynamic vehicle allocation model. Department of Civil Engineering and Operations Research, Program in Statistics and Operations Research, Princeton University, Princeton, NJ
- Choi, I.C., Goldfarb, D. (1990) Solving multicommodity network flow problems by an interior point method. SIAM Proceedings in Applied Mathematics 46: pp. 58-69
- CPLEX Optimization, Inc.,Using the CPLEX Linear Optimizer, 1.2 edition (Incline Village, NV).
- Dantzig, G.B., Wolfe, P. (1961) The decomposition algorithm for linear programs. Econometrica 29: pp. 767-778
- Farvolden, J.M. (1989) A primal partitioning solution for multicommodity network flow problems. Department of Civil Engineering and Operations Research, Program in Statistics and Operations Research, Princeton University, Princeton, NJ
- J.M. Farvolden, W.B. Powell and I.J. Lustig, “A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem,” to appear in:Operations Research.
- ALK Inc., private communication (1991).
- Kennington, J.L., Helgason, R.V. (1980) Algorithms for Network Programming. Wiley, New York
- Lustig, I.J. (1990) The influence of computer language on computational comparisons: An example from network optimization. ORSA Journal on Computing 2: pp. 152-161
- Pinar, M.C., Zenios, S.A. (1992) Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm. ORSA Journal on Computing 4: pp. 235-249
- Powell, W.B. (1989) A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transportation Science 23: pp. 231-243
- Rockafellar, R.T. (1984) Network Flows and Monotropic Optimization. Wiley, New York
- G.L. Schultz and R.R. Meyer, “An interior point method for block angular optimization,”SIAM Journal on Optimization 1(4) (1991).
- Tomlin, J.A. (1971) A mathematical programming model for the combined distribution-assignment of traffic. Transportation Science 5: pp. 122-140
- Multicommodity network flows: The impact of formulation on decomposition
Volume 62, Issue 1-3 , pp 95-117
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Department of Civil Engineering and Operations Research, Program in Statistics and Operations Research, Princeton University, Princeton, NJ, USA
- 3. Department of Industrial Engineering, University of Toronto, Ont., Canada