Skip to main content
Springer Nature Link
Log in

Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of sending a set of multiple commodities from their origin to destination nodes via intermediate hubs. Each hub node is associated with a reliability function, which depends on the total flow that crosses that hub. The probability that each commodity is successfully relayed from its origin to its destination is given by the product of hub reliabilities on the commodity’s path. The problem we consider seeks to find minimum-cost commodity paths such that each commodity reaches its destination with a sufficiently large probability. We first formulate the problem as a nonlinear multicommodity network-flow problem and prove that it is strongly NP-hard. We then present two linearization techniques for this formulation, and propose a pair of lower- and upper-bounding formulations, which can then be used within an exact cutting-plane algorithm to solve the problem. Finally, we analyze the computational effectiveness of our proposed strategies on a set of randomly generated instances.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Barnhart, C., Hane, C.A., Vance, P.H.: Integer multicommodity flow problems. In: Cunningham, W., McCormick, S., Queyranne, M. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 1084, pp. 58–71. Springer, Berlin (1996)

    Chapter  Google Scholar 

  2. Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems. Oper. Res. 48(2), 318–326 (2000)

    Article  Google Scholar 

  3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)

    MATH  Google Scholar 

  4. Assad, A.A.: Multicommodity network flows—a survey. Networks 8(1), 37–91 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kennington, J.L.: A survey of linear cost multicommodity network flows. Oper. Res. 26(2), 209–236 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ouorou, A., Mahey, P., Vial, J.P.: A survey of algorithms for convex multicommodity flow problems. Manag. Sci. 46(1), 126–147 (2000)

    Article  MATH  Google Scholar 

  7. Brunetta, L., Conforti, M., Fischetti, M.: A polyhedral approach to an integer multicommodity flow problem. Discrete Appl. Math. 101(1–3), 13–36 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Holmberg, K., Yuan, D.: A multicommodity network-flow problem with side constraints on paths solved by column generation. INFORMS J. Comput. 15(1), 42–57 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)

    Google Scholar 

  10. Aven, T.: Reliability evaluation of multistate systems with multistate components. IEEE Trans. Reliab. 34(5), 473–479 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hudson, J.C., Kapur, K.C.: Reliability bounds for multistate systems with multistate components. Oper. Res. 33(1), 153–160 (1985)

    Article  MATH  Google Scholar 

  12. Lin, J.S., Jane, C.C., Yuan, J.: On reliability evaluation of a capacitated flow network in terms of minimal path sets. Networks 25(3), 131–138 (1995)

    Article  MATH  Google Scholar 

  13. Lin, Y.K.: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput. Oper. Res. 28(13), 1277–1285 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lin, Y.K., Yuan, J.: A new algorithm to generate d-minimal paths in a multistate flow network with non-integer arc capacities. Int. J. Reliab. Qual. Saf. Eng. 5(3), 269–285 (1998)

    Article  Google Scholar 

  15. Peixin, Z., Xin, Z.: A survey on reliability evaluation of stochastic-flow networks in terms of minimal paths. In: International Conference on Information Engineering and Computer Science (ICIECS2009), Wuhan, China, pp. 1–4 (2009)

    Google Scholar 

  16. Xue, J.: On multistate system analysis. IEEE Trans. Reliab. 34(4), 329–337 (1985)

    Google Scholar 

  17. Yeh, W.C.: A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Trans. Reliab. 47(4), 436–442 (1998)

    Article  Google Scholar 

  18. Yeh, W.C.: A simple algorithm to search for all d-MPs with unreliable nodes. Reliab. Eng. Syst. Saf. 73(1), 49–54 (2001)

    Article  Google Scholar 

  19. Lin, Y.K.: Two-commodity reliability evaluation for a stochastic flow network with node failure. Comput. Oper. Res. 29(13), 1927–1939 (2002)

    Article  MATH  Google Scholar 

  20. Lin, Y.K.: Reliability evaluation for an information network with node failure under cost constraint. IEEE Trans. Syst. Man Cybern., Part A, Syst. Hum. 37(2), 180–188 (2007)

    Article  Google Scholar 

  21. Jane, C.C., Lin, J.S., Yuan, J.: On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans. Reliab. 42(3), 354–361 (1993)

    Article  MATH  Google Scholar 

  22. Soh, S., Rai, S.: An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities. IEEE Trans. Reliab. 54(1), 133–144 (2005)

    Article  Google Scholar 

  23. Yeh, W.C.: A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes. Reliab. Eng. Syst. Saf. 83(1), 47–55 (2004)

    Article  Google Scholar 

  24. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  25. Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6(3), 823–837 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  26. Bley, A.: A Lagrangian approach for integrated network design and routing in IP networks. In: Proc. of the International Network Optimization Conference, Paris, pp. 107–113 (2003)

    Google Scholar 

  27. Crainic, T., Gendreau, M., Farvolden, J.: Simplex-based Tabu Search for the multicommodity capacitated fixed charge network design problem. INFORMS J. Comput. 12(3), 223–236 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Gavish, B., Altinkemer, K.: Backbone network design tools with economic tradeoffs. ORSA J. Comput. 2(3), 236–252 (1990)

    Article  MATH  Google Scholar 

  29. Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Sansó, B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 1–19. Kluwer Academics, Norwell (1998)

    Google Scholar 

  30. Gavish, B., Trudeau, P., Dror, M., Gendreau, M., Mason, L.: Fiberoptic circuit network design under reliability constraints. IEEE J. Sel. Areas Commun. 7(8), 1181–1187 (1989)

    Article  Google Scholar 

  31. Jahn, O., Möhring, R.H., Schulz, A.S., Stier-Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4), 600–616 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  32. Taylor, M.A.P., Woolley, J.E., Zito, R.: Integration of the global positioning system and geographical information systems for traffic congestion studies. Transp. Res., Part C, Emerg. Technol. 8(1–6), 257–285 (2000)

    Article  Google Scholar 

  33. Yang, H., Xu, W., He, B.S., Meng, Q.: Road pricing for congestion control with unknown demand and cost functions. Transp. Res., Part C, Emerg. Technol. 18(2), 157–175 (2010)

    Article  Google Scholar 

  34. Zhao, L., Lai, Y.C., Park, K., Ye, N.: Onset of traffic congestion in complex networks. Phys. Rev. E 71, 026125 (2005)

    Article  Google Scholar 

  35. Andreas, A.K., Smith, J.C.: Mathematical programming algorithms for two-path routing problems with reliability constraints. INFORMS J. Comput. 20(4), 553–564 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  36. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, Princeton (1979)

    MATH  Google Scholar 

  37. McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I—convex underestimating problems. Math. Program. 10(1), 147–175 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful for the comments of two anonymous referees, whose remarks led to an improved version of this paper. Furthermore, we sincerely appreciate the cooperation of the GAMS Development Corporation in providing an evaluation copy of GAMS 24.1.1 and GloMIQO 2 for the purposes of our computational investigation. The authors also gratefully acknowledge the support of the National Science Foundation under grant CMMI-1100765, the Defense Threat Reduction Agency under grant HDTRA-10-01-0050, the Air Force Office of Scientific Research under grant FA9550-12-1-0353, and the Office of Naval Research under grant N000141310036.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Bita Tadayon & J. Cole Smith

Authors
  1. Bita Tadayon
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. J. Cole Smith
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to J. Cole Smith.

Additional information

Communicated by Christodoulos Floudas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tadayon, B., Smith, J.C. Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations. J Optim Theory Appl 161, 506–532 (2014). https://doi.org/10.1007/s10957-013-0378-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-013-0378-5

Keywords