Vol 5 No 1 (2010)

Minimum Cost Flow Problem on Dynamic Multi Generative Network flows

Seyed Ahmad Hosseini
Hassan Salehi Fathabadi
School of Mathematics and Computer Science, College of Science, University of Tehran, Iran
Published April 14, 2010
  • Network flows,
  • LP problems,
  • Dynamic flows,
  • Time-commodity expanded network,
  • Decomposition methods
How to Cite
Hosseini, S. A., & Fathabadi, H. S. (2010). Minimum Cost Flow Problem on Dynamic Multi Generative Network flows. Algorithmic Operations Research, 5(1), Pages 39 - 48. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/12411


This paper consists of studies of constructing and modeling Dynamic Multi Generative Network Flows in which the flow commodities is dynamically generated at source nodes and dynamically consumed at sink nodes. It is assumed that the source nodes produce the flow commodities according to k time generative functions and the sink nodes absorb the flow commodities according to k time consumption functions. The minimum cost dynamic flow problem in such networks, that extend the classical optimal flow problems on static networks, for a pre-specified time horizon T is defined and mathematically formulated and it's showed that the dynamic problem on these networks can be formulated as a linear program whose special structure permits efficient computations of its solution and can be solved by one minimum cost static flow computation on an auxiliary time-commodity expanded network. Moreover, using flow decomposition theorem, we elaborate a different model of the problem in order to reduce its complexity. We consider the problem in the general case when cost and capacity functions depend on time and commodity.