Skip to main content
Log in

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Time-varying network flows (also called dynamic network flows) generalize standard network flows by introducing an element of time. In this paper, we consider the dynamic version of the minimum cost multicommodity flow problem with storage at intermediate nodes. This problem is known to be NP-hard. By using of the flow decomposition theorem in network flows, we propose an efficient model based on dynamic path flows for this problem. For some special structures of the path-flow formulation, we provide an algorithm based on decomposition principle, for solving the proposed model. In the end, the efficiency of the proposed approach is evaluated through a number of experimental tests.

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

Access this article

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20(1), 1–66 (1989)

    Article  MathSciNet  Google Scholar 

  3. Bazaraa, Mokhtar S., Jarvis, John J., Sherali, Hanif D.: Linear Programming and Network Flows. Wiley, New York (2011)

    MATH  Google Scholar 

  4. Bollobás, B.: Random Graphs (No. 73). Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  5. Brooke, A., Kendric, D., Meeraus, A., Raman, R.: Release 2.50 GAMS A User Guide. GAMS Development Corp., Washington, DC (1998)

    Google Scholar 

  6. Calvete, H.I., del-Pozo, L., Iranzo, J.A.: The energy-constrained quickest path problem. Optim. Lett. 11(7), 1319–1339 (2017)

    Article  MathSciNet  Google Scholar 

  7. Fathabadi, H.S., Khodayifar, S., Raayatpanah, M.A.: Minimum flow problem on network flows with time-varying bounds. Appl. Math. Model. 36(9), 4414–4421 (2012)

    Article  MathSciNet  Google Scholar 

  8. Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36(6), 1600–1630 (2007)

    Article  MathSciNet  Google Scholar 

  9. Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 66–75). Society for Industrial and Applied Mathematics (2003)

  10. Fleischer, L., Skutella, M.: The quickest multicommodity flow problem. In: International Conference on Integer Programming and Combinatorial Optimization (pp. 36–53). Springer, Berlin, Heidelberg (2002)

  11. Floudas, C.A., Pardalos, P.M. (eds.): Encyclopedia of Optimization, vol. 1. Springer, Berlin (2001)

    MATH  Google Scholar 

  12. Ford Jr., L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419–433 (1958)

    Article  MathSciNet  Google Scholar 

  13. Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: efficient algorithms and complexity. Theor. Comput. Sci. 379(3), 387–404 (2007)

    Article  MathSciNet  Google Scholar 

  14. Hashemi, S.M., Mokarami, S., Nasrabadi, E.: Dynamic shortest path problems with time-varying costs. Optim. Lett. 4(1), 147–156 (2010)

    Article  MathSciNet  Google Scholar 

  15. Hoppe, B.: Efficient Dynamic Network Flow Algorithms. Cornell University, New York (1995)

    Google Scholar 

  16. Khodayifar, S., Raayatpanah, M.A., Pardalos, P.M.: A polynomial time algorithm for the minimum flow problem in time-varying networks. Ann. Oper. Res 272(1–2), 29–39 (2019)

  17. Klinz, B., Woeginger, G.J.: Minimum-cost dynamic flows: the series-parallel case. Netw. Int. J. 43(3), 153–162 (2004)

    MathSciNet  MATH  Google Scholar 

  18. Koch, R., Nasrabadi, E.: Flows over time in time-varying networks: optimality conditions and strong duality. Eur. J. Oper. Res. 237(2), 580–589 (2014)

    Article  MathSciNet  Google Scholar 

  19. Lozovanu, D., Fonoberova, M.: Optimal dynamic multicommodity flows in networks. Electron. Notes Discrete Math. 25, 93–100 (2006)

    Article  MathSciNet  Google Scholar 

  20. Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. Handb. Oper. Res. Manag. Sci. 8, 141–295 (1995)

    MathSciNet  MATH  Google Scholar 

  21. Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization (pp. 451–482). Springer, Berlin, Heidelberg (2009)

  22. Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250–256 (1986)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research is jointly supported by grants from the Institute for Advanced Studies in Basic Sciences (IASBS) and the Ministry of Science, Research and Technology of the Islamic Republic of Iran.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Salman Khodayifar.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khodayifar, S. Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. Optim Lett 15, 1009–1026 (2021). https://doi.org/10.1007/s11590-019-01519-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-019-01519-5

Keywords

Navigation