Abstract
Network flow problem covers a wide range of engineering and management applications. The maximum flow problem is to find the maximum amount of flow from the source to the sink within a network. Different from the existing works, this paper investigates maximum flow problem in which all arc capacities of the network are uncertain variables. Some models of maximum flow problem with uncertain arc capacities are exhibited. And then, the algorithm for solving maximum flow problem is introduced. As an illustration, an example is provided to show the effectiveness of the algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grimmett, G.R., Welsh, D.J.A.: Flow in Networks with Random Capacities. Stochastics An International Journal of Probability and Stochastic Processes 7, 205–229 (1982)
Han, S., Peng, Z.: The maximum Flow Problem of Uncertain Network, http://orsc.edu.cn/online/101228.pdf
Ji, X., Yang, L., Shao, Z.: Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCS (LNAI), vol. 4114, pp. 11–19. Springer, Heidelberg (2006)
Kumar, A., Kaur, M.: Solution of Fuzzy Maximal Flow Problems Using Fuzzy Linear Programming. International Journal of Computational and Mathematical Sciences 5, 62–67 (2011)
Kumar, A., Kaur, M.: An Algorithm for Solving Fuzzy Maximal Flow Problems Using Generalized Trapezoidal Fuzzy Numbers. International Journal of Applied Science and Engineering 8, 109–118 (2010)
Liu, B.: Uncertainty Theory, 2nd edn. Springer, Berlin (2007)
Liu, B.: Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertain. Springer, Berlin (2010)
Liu, B.: Some Research Problems in Uncertainty Theory. Journal of Uncertain Systems 3, 3–10 (2009)
Liu, B.: Theory and Practice of Uncertain Programming. Springer, Berlin (2009)
Liu, S.T., Kao, C.: Network Flow Problems With Fuzzy Arc Lengths. IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics 34, 765–769 (2004)
Peng, J., Li, S.: Spanning Tree Problem of Uncertain Network. In: Proceedings of the 3rd International Conference on Computer Design and Applications (ICCDA 2011), Xi’an, Shaanxi, China, May 27-29 (2011)
Schrijver, A.: On the History of the Transportation And Maximum Flow Problems. Mathematical Programming 91, 437–445 (2002)
Somers, J.E.: Maximum Flow in Networks with A Small Number of Random Arc Capacities. Networks 12, 241–253 (1982)
Tolstǒi, A.N.: Metody Nakhozhdeniya Naimen’shego Summovogo Kilometrazha Pri Planirovanii Perevozok v Prostranstve. In: Planirovanie Perevozok, Sbornik pervyi, Transpechat’ NKPS, Moscow, pp. 23–55 (1930)
Winston, W.L.: Operations Research: Applications and Algorithms, 3rd edn. Wadsworth, Belmont (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, C., Peng, J. (2011). Models and Algorithm of Maximum Flow Problem in Uncertain Network. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-23881-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23880-2
Online ISBN: 978-3-642-23881-9
eBook Packages: Computer ScienceComputer Science (R0)