Abstract
Here we are dealing with minimum cost flow problem on dynamic network flows with zero transit times and a new arc capacity, horizon capacity, which denotes an upper bound on the total flow traversing through on an arc during a pre-specified time horizon T. We develop a simple approach based on mathematical modelling attributes to solve the min-cost dynamic network flow problem where arc capacities and costs are time varying, and horizon capacities are considered. The basis of the method is simple and relies on the appropriate defining of polyhedrons, and in contrast to the other usual algorithms that use the notion of time expanded network, this method runs directly on the original network.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahuja, R.K., Magnanti, M., Orlin, J.: Network flows. Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, New Jersey (1993)
Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1–66 (1989)
Bazaraa, M., Jarvis, J., Sherali, H.: Linear programming and network flows. Wiley (1990)
Dantzig, G., Wolfe P.: The decomposition algorithm for linear programs. Econometrical 29, 767–778 (1961)
Dantzig, G., Wolfe P., Decomposition principle for linear programs. Opns. Res. 8, 101–111 (1960)
Fonoberova, M.: Optimal Flows in Dynamic Networks and Algorithm for their Finding. PhD Thesis, Moldova University (2007)
Fonoberova, M., Lozovanu, D.: Optimal dynamic flows in networks and applications. The International Symposium “The Issues of Calculation Optimization”. Communications. pp. 92–293. Crimea, Ukraine (2007)
Ford, L.R., Fulkerson D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419–433 (1958)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)
Hoppe, B.: Efficient dynamic network flow algorithms. PhD Thesis, Cornell University (1995)
Fathabdi, H., Hosseini, S.A.: Maximum flow problem on dynamic generative network flows with time-varying bounds. Appl. Math. Model. 34, 2136–2147 (2010)
Hosseini, S.A., Fathabdi, H.: Minimum cost flow problem on dynamic multi generative networks. Alg. Oper. Res. 5, 39–48 (2010)
Hosseini, A.: An introduction to dynamic generative networks: minimum cost flow. Appl. Math. Model. 35, 5017–5025 (2011)
Hosseini, S.A.: The Minimum Cost Flow Problem in Dynamic Multi Generative Network Flows, DM10 Abstracts, The SIAM Conference on Discrete Mathematics, Hyatt Regency Austin, USA 44 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hosseini, S.A., Saridarq, F.D. Determining the Optimal Flows in Zero-Time Dynamic Networks. J Math Model Algor 11, 105–117 (2012). https://doi.org/10.1007/s10852-011-9169-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-011-9169-x