International Journal of Applied Science and Engineering
Published by Chaoyang University of Technology

Amit Kumar and Manjot Kaur*

School of Mathematics and Computer Applications, Thapar University, Patiala, India

Download Citation: |
Download PDF


Kumar et al. (A new approach for solving fuzzy maximal flow problems; LectureKumar et al. (A new approach for solving fuzzy maximal flow problems; Lecture Notes in Computer Science, Springer-Verlag; Berlin Heidelberg, 5908, (2009) 278-286) pro-poseda new algorithm for solving the fuzzy maximal flow problems. In the numerical example solved by Kumar et al., by using the proposed algorithm, there exist negative part in the obtained triangular fuzzy numbers which represents that the flow between two nodes may be negative. Although it is mathematically correct according to properties of ranking function. But in real life problems the negative quantity of the flow has no physical meaning. To overcome this short-comingthe algorithm, proposed by Kumar et al., is improved.

Keywords: Fuzzy maximal flow problem; ranking function; triangular fuzzy number.

Share this article with your colleagues



  1. [1] Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. 1993. “Network flows, theory, algo-rithms and applications”. Prentice Hall; New Jersey.

  2. [2] Bazarra, M. S., Jarvis J. J., and Sherali, H. D. 1990. “Linear programming andnetwork flows, 2nd edition; Wiley”. New York.

  3. [3] Chanas, S., Delgado, M., Verdegay, J. L., and Vila, M. 1995. Fuzzy optimal flow on imprecise structures. European Journalof Operational Research, 83, 2:568-580.

  4. [4] Chanas, S., Kolodziejczyk, W. 1982. Maximum flow in a network with fuzzy arc capacities. Fuzzy Sets and Systems, 8, 2: 165-173.

  5. [5] Chanas, S., Kolodziejczyk, W. 1984. Real-valued flows in a network with fuzzy arc capacities. Fuzzy Sets and Systems, 13, 2: 139-151.

  6. [6] Chanas, S., Kolodziejczyk, W. 1986. In-teger flows in network with fuzzy capac-ity constraints. Networks, 16: 17-31.

  7. [7] Diamond A. 2001. A fuzzy max-flow min-cut theorem. Fuzzy Sets and Systems, 119, 1: 139-148.

  8. [8] Ford, L. R. and Fulkerson, D. R. 1956. Maximal flow through a network. Cana-dian Journal of Mathematics, 8:399-404.

  9. [9] Fulkerson, D. R. and Dantzig, G. B. 1955. Computation of maximum flow in network. Naval Research Logisics Quar-terly, 2: 277-283.

  10. [10] Hernandes, F., Lamata, M. T., Takahashi, M. T., Yamakami, A., and Verdegay, J. L. 2007. An algorithm for the fuzzy maxi-mum flow problem. IEEE International Fuzzy Systems Conference 1-6.

  11. [11] Ji, X., Yang L., and Shao, Zhen. 2006. Chance constrained maximum flow problem with arc capacities. “Lecture Notes in Computer Science”. Springer-Verlag; Berlin, Heidelberg, 4114: 11-19.

  12. [12] Kaufmann, A., Gupta, M. M. 1985. “In-troduction to fuzzy arithmetic theory and applications”. Van Nostrand Reinhold; New York.

  13. [13] Kim, K., Roush, F. 1982. Fuzzy flows on network. Fuzzy Sets and Systems, 8, 1:35-38.

  14. [14] Kumar, A., Bhatia, N., and Kaur, M. 2009. A new approach for solving fuzzy maximal flow problems. “Lecture Notes in Computer Science”. Springer-Verlag; Berlin, Heidelberg, 5908: 278-286.

  15. [15] Liou, T. S. and Wang, M. J. 1992. Rank-ing fuzzy numbers with integral value. Fuzzy Sets and Systems, 50, 3: 247-255.

  16. [16] Liu, S. T. and Kao, C. 2004. Network flow problems with fuzzy are lengths. IEEE Transactions on Systems, Man and Cybernetics, 34, 1: 765-769.

  17. [17] Soltani, A. and Haji, R. 2007. A project scheduling method based on fuzzy theory. Journal of Industrial and Systems Engi-neering, 1, 1: 70-80.

  18. [18] Taha, H. A. 2003. “Operational research: an introduction”. Prentice-Hall; NewJersey.

  19. [19] Zadeh, L. A. 1965. Fuzzy sets. Informa-tion and Control, 8, 3: 338-353.


Received: 2011-07-23
Revised: 2011-11-01
Accepted: 2011-11-30
Available Online: 2012-03-01

Cite this article:

Kumar, A., Kaur, M. 2012. An Improved Algorithm for Solving Fuzzy Maximal Flow Problems. International Journal of Applied Science and Engineering, 10, 19–27.

We use cookies on this website to improve your user experience. By using this site you agree to its use of cookies.