Skip to main content
SpringerLink
Log in

An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The linear multicommodity network flow (MCNF) problem has many applications in the areas of transportation and telecommunications. It has therefore received much attention, and many algorithms that exploit the problem structure have been suggested and implemented. The practical difficulty of solving MCNF models increases fast with respect to the problem size, and especially with respect to the number of commodities. Applications in telecommunications typically lead to instances with huge numbers of commodities, and tackling such instances computationally is challenging.

In this paper, we describe and evaluate a fast and convergent lower-bounding procedure which is based on an augmented Lagrangian reformulation of MCNF, that is, a combined Lagrangian relaxation and penalty approach. The algorithm is specially designed for solving very large scale MCNF instances. Compared to a standard Lagrangian relaxation approach, it has more favorable convergence characteristics. To solve the nonlinear augmented Lagrangian subproblem, we apply a disaggregate simplicial decomposition scheme, which fully exploits the structure of the subproblem and has good reoptimization capabilities. Finally, the augmented Lagrangian algorithm can also be used to provide heuristic upper bounds.

The efficiency of the augmented Lagrangian method is demonstrated through computational experiments on large scale instances. In particular, it provides near-optimal solutions to instances with over 3,600 nodes, 14,000 arcs and 80,000 commodities within reasonable computing time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Ali, D. Barnett, K. Farhangian, J.Kennington, B. Patty, B. Shetty, B. McCarl, and P. Wong, “Multicommodity network problems: Applications and computations,” IIE Transactions, vol. 16, pp. 127–134, 1984.

    Google Scholar 

  2. A.A. Assad, “Multicommodity network flows—A survey,” Networks, vol. 8, pp. 37–91, 1978.

    Google Scholar 

  3. A.A. Assad, “Solving linear multicommodity flow problems,” in Proceedings of IEEE International Conference on Circuits and Computers, N.G. Rabbat (Ed.), 1980, vol. 1, pp. 157–161.

  4. C. Barnhart, “Dual-ascent methods for large-scale multicommodity flow problems,” Naval Research Logistics, vol. 40, pp. 305–324, 1993.

    Google Scholar 

  5. C. Barnhart, C.A. Hane, E.L. Johnson, and G. Sigismondi, “A column generation and partitioning approach for multi-commodity flow problems,” Telecommunication Systems, vol. 3, pp. 239–258, 1995.

    Google Scholar 

  6. C. Barnhart and Y. Sheffi, “A network-based primal-dual heuristic for the solution of multicommodity network flow problems,” Transportation Science, vol. 27, pp. 102–117, 1993.

    Google Scholar 

  7. C. Barnhart, C.A. Hane, and P.H. Vance, “Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems,” Operations Research, vol. 32, pp. 208–220, 1998.

    Google Scholar 

  8. D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. Academic Press: New York, 1982.

    Google Scholar 

  9. D.P. Bertsekas, Nonlinear Programming. Athena Scientific: Belmont, MA, 1995.

    Google Scholar 

  10. D. Bienstock, Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer Academic Publishers, Boston, MA, 2002.

    Google Scholar 

  11. J.F. Bonnans, M. Haddou, A. Lisser, and R. Rébaï, “Interior point methods with decomposition for multicommodity flow problems,” Technical report No. 3852, INRIA, Rocquencourt, France, 2000.

    Google Scholar 

  12. W.J. Carolan, J.E. Hill, J.L. Kennington, S. Niemi, and S.J. Wichmann, “An empirical evaluation of the KORBX algorithms for military aircraft applications,” Operations Research, vol. 38, pp. 240–248, 1990.

    Google Scholar 

  13. J. Castro, “PPRN 1.0 user's guide,” Technical report, Statistics and Operations Research Department, Universitat Politècnica de Catalunya, Barcelona, Spain, 1994.

    Google Scholar 

  14. J. Castro, “A specialized interior-point algorithm for multicommodity network flows,” SIAM Journal on Optimization, vol. 10, pp. 852–877, 2000.

    Google Scholar 

  15. J. Castro and N. Nabona, “Computational tests of a linear multicommodity network flow code with linear side constraints through primal partitioning,” Technical report, Statistics and Operations Research Department, Universitat Politècnica de Catalunya, Barcelona, Spain, 1994.

    Google Scholar 

  16. J. Castro and N. Nabona, “An implementation of linear and nonlinear multicommodity network flows,” European Journal of Operational Research, vol. 92, pp. 37–53, 1996.

    Google Scholar 

  17. P. Chardaire and A. Lisser, “Simplex and interior point specialized algorithms for solving non-oriented multicommodity flow problems,” Operations Research, vol. 50, pp. 260–276, 2002.

    Google Scholar 

  18. H. Chen and C.G. DeWald, “A generalized chain labelling algorithm for solving multicommodity flow problems,” Computers and Operations Research, vol. 1, pp. 437–465, 1974.

    Google Scholar 

  19. H. Crowder, “Computational improvements for subgradient optimization,” in Symposia Mathematica, Academic Press: London, 1976, vol. XIX, pp. 357–372.

    Google Scholar 

  20. 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,” Operations Research, vol. 41, pp. 669–693, 1993.

    Google Scholar 

  21. L.K. Fleischer, “Approximating fractional multicommodity flow independent of the number of commodities,” SIAM Journal on Discrete Mathematices, vol. 3, pp. 505–520, 2000.

    Google Scholar 

  22. M. Folie and J. Tiffin, “Solution of a multi-product manufacturing and distribution problem,” Management Science, vol. 23, pp. 286–296, 1976.

    Google Scholar 

  23. A. Frangioni, “Dual-ascent methods and multicommodity flow problems,” PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy, 1997.

    Google Scholar 

  24. A. Frangioni, private communications, 1999.

  25. A. Frangioni and G. Gallo, “A bundle type dual-ascent approach to linear multicommodity min-cost flow problems,” Informs Journal on Computing, vol. 11, pp. 370–393, 1999.

    Google Scholar 

  26. B. Gendron and T.G. Crainic, “Bounding procedures for multicommodity capacitated network design problems,” Technical report, Centre de recherche sur les transports, Université de Montréal, Canada, 1995.

    Google Scholar 

  27. B. Gendron, T.G. Crainic, and A. Frangioni, “Multicommodity capacitated network design,” in Telecommunications Network Planning, B. Sansó and P. Sariano (Eds.), Kluwer Academic Publishers, 1999, chap. 1, pp. 1–19.

  28. A.M. Geoffrion and G.W. Graves, “Multicommodity distribution system design by Benders decomposition,” Management Science, vol. 20, pp. 822–844, 1974.

    Google Scholar 

  29. A.V. Goldberg, J.D. Oldham, S. Plotkin, and C. Stein, “An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow,” in Integer Programming and Combinatorial Optimization, Proceedings of the 6th International IPCO Conference, R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado (Eds.), Houston, Springer, 1998, pp. 338–352.

    Google Scholar 

  30. M.D. Grigoriadis and L.G. Khachiyan, “En exponential-function reduction method for block-angular convex programs,” Networks, vol. 26, pp. 59–68, 1995.

    Google Scholar 

  31. M.D. Grigoriadis and W.W. White, “A partitioning algorithm for the multicommodity network flow problem,” Mathematical Programming, vol. 3, pp. 157–177, 1972.

    Google Scholar 

  32. M.D. Grigoriadis and W.W. White, “Computational experience with a multicommodity network flow algorithm,” in Optimization Methods for Resource Allocation, R. Cottle and J. Krarup (Eds.), The English Universities Press Ltd: London, 1974, pp. 205–227.

    Google Scholar 

  33. R.C. Grinold, “A multicommodity max-flow algorithm,” Operations Research, vol. 16, pp. 1234–1237, 1968.

    Google Scholar 

  34. J.K. Hartman and L.S. Lasdon, “A generalized upper bounding algorithm for multicommodity network flow problems,” Networks, vol. 1, pp. 333–354, 1972.

    Google Scholar 

  35. M. Held, P. Wolfe, and H.P. Crowder, “Validation of subgradient optimization”, Mathematical Programming, vol. 6, pp. 62–88, 1974.

    Google Scholar 

  36. M. Henningson, K. Holmberg, and M. Näsberg, “A capacitated bus grid network design problem,” in Proceedings of 8th International Conference on Telecommunication Systems: Modeling and Analysis, Nashville, USA, 2000, pp. 98–113.

  37. C.A. Holloway, “An extension of the Frank and Wolfe method of feasible directions,” Mathematical Programming, vol. 6, pp. 14–27, 1974.

    Google Scholar 

  38. K. Holmberg, “Lagrangean heuristics for linear cost multicommodity network flow problem,” Working paper LiTH-MAT/OPT-WP-1995-01, Division of Optimization, Department of Mathematics, Linköping Institute of Technology, Sweden, 1995.

    Google Scholar 

  39. K. Holmberg, M. Joborn, and J.T. Lundgren, “Improved empty freight car distribution,” Transportation Science, vol. 32, pp. 163–173, 1998.

    Google Scholar 

  40. K. Holmberg and D. Yuan, “A multicommodity network-flow problem with side constraints on paths solved by column generation,” Informs Journal on Computing, vol. 15, pp. 42–57, 2003.

    Google Scholar 

  41. K. Holmberg and D. Yuan, “A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem,” Operations Research, vol. 48, pp. 461–481, 2000.

    Google Scholar 

  42. K.L. Jones, I.J. Lustig, J.M. Farvolden, and W.B. Powell, “Multicommodity network flows: The impact of formulation on decomposition,” Mathematical Programming, vol. 62, pp. 95–117, 1993.

    Google Scholar 

  43. A. Kamath, O. Palmon, and S. Plotkin, “Fast approximation algorithm for minimum cost multicommodity flow,” in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 1995, pp. 493–501.

  44. J.L. Kennington, “Solving multicommodity transportation problems using a primal partitioning simplex technique,” Naval Research Logistics Quarterly, vol. 24, pp. 309–325, 1977.

    Google Scholar 

  45. J.L. Kennington, “A survey of linear cost multicommodity network flows,” Operations Research, vol. 26, pp. 209–236, 1978.

    Google Scholar 

  46. J.L. Kennington and M. Shalaby, “An effective subgradient procedure for minimal cost multicommodity flow problems,” Management Science, vol. 23, pp. 994–1004, 1977.

    Google Scholar 

  47. B.W. Kort and D.P. Bertsekas, “Combined primal-dual and penalty methods for convex programming,” SIAM Journal on Control and Optimization, vol. 14, pp. 268–294, 1976.

    Google Scholar 

  48. T. Larsson and M. Patriksson, “Simplicial decomposition with disaggregated representation for the traffic assignment problem,” Transportation Science, vol. 26, pp. 4–17, 1992.

    Google Scholar 

  49. T. Larsson and M. Patriksson, “An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems,” Transportation Research B, vol. 29, pp. 433–455, 1995.

    Google Scholar 

  50. T. Larsson, M. Patriksson, and A.-B. Strömberg “Ergodic, primal convergence in dual subgradient schemes for convex programming,” Mathematical Programming, vol. 86, pp. 283–312, 1999.

    Google Scholar 

  51. T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas, “Fast approximation algorithms for multicommodity flow problems,” Journal of Computer and System Sciences, vol. 50, pp. 228–243, 1995.

    Google Scholar 

  52. L.J. LeBlanc, E.K. Morlok, and W.P. Pierskalla, “An efficient approach to solving the road network equilibrium traffic assignment problem,” Transportation Science, vol. 19, pp. 445–462, 1975.

    Google Scholar 

  53. S.F. Maier, “A compact inverse scheme applied to a multicommodity network with resource constraints,” in Optimization Methods for Resource Allocation, R. Cottle and J. Krarup (Eds.), pp. 179–203, The English Universities Press Ltd., London, 1974.

    Google Scholar 

  54. R.D. McBride and J.W. Mamer, “Solving multicommodity flow problems with a primal embedded network simplex algorithm,” INFORMS Journal on Computing, vol. 9, pp. 154–163, 1997.

    Google Scholar 

  55. R.D. McBride and J.W. Mamer, “A decomposition-based pricing procedure for large-scale linear program: An application to the linear multicommodity flow problem,” Management Science, vol. 46, pp. 693–709, 2000.

    Google Scholar 

  56. C.J. McCallum, Jr., “Ageneralized upper bounding approach to a communications network planning problem,” Networks, vol. 7, pp. 1–23, 1977.

    Google Scholar 

  57. S. Nguyen, “Aunified approach to equilibrium methods for traffic assignment,” in Traffic Equilibrium Methods, Proceedings of the International Symposium in Montréal, 1976, M. A. Florian (Ed.), Springer, 1976, pp. 148–182.

  58. A. Ouorou, P. Mahey, and J.-Ph. Vial, “A survey of algorithms for convex multicommodity flow problems,” Management Science, vol. 46, pp. 126–147, 2000.

    Google Scholar 

  59. R.T. Rockafellar, “The multiplier method of Hestenes and Powell applied to convex programming,” Journal of Optimization Theory and Applications, vol. 12, pp. 555–562, 1973.

    Google Scholar 

  60. R.T. Rockafellar, “A dual approach to solving nonlinear programming problems by unconstrained optimization,” Mathematical Programming, vol. 5, pp. 354–373, 1973.

    Google Scholar 

  61. R.R. Schneur and J.B. Orlin, “A scaling algorithm for multicommodity flow problems,” Operations Research, vol. 46, pp. 231–246, 1998.

    Google Scholar 

  62. B. Shetty and R. Muthukrishnan, “A parallel projection for the multicommodity network model,” Journal of the Operational Research Society, vol. 41, pp. 837–842, 1990.

    Google Scholar 

  63. J.A. Tomlin, “Minimum-cost multicommodity network flows,” Operations Research, vol. 14, pp. 45–51, 1966.

    Google Scholar 

  64. B. Von Hohenbalken, “Simplicial decomposition in nonlinear programming algorithms,” Mathematical Programming, vol. 13, pp. 49–68, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Linköping Institute of Technology, SE-581 83, Linköping, Sweden

    Torbjörn Larsson

  2. Department of Science and Technology, Linköping Institute of Technology, Campus Norrköping, SE-601 74, Norrköping, Sweden

    Di Yuan

Authors
  1. Torbjörn Larsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Di Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Larsson, T., Yuan, D. An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing. Computational Optimization and Applications 27, 187–215 (2004). https://doi.org/10.1023/B:COAP.0000008652.29295.eb

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:COAP.0000008652.29295.eb

Search

Navigation