Shortest Path Problem under Intuitionistic Fuzzy Setting

Debaroti Das; P.K.De

Research Article

Shortest Path Problem under Intuitionistic Fuzzy Setting

by Debaroti Das, P.K.De

International Journal of Computer Applications

Foundation of Computer Science (FCS), NY, USA

Volume 105 - Issue 1

Published: November 2014

Authors: Debaroti Das, P.K.De

10.5120/18338-9465

PDF

Debaroti Das, P.K.De . Shortest Path Problem under Intuitionistic Fuzzy Setting. International Journal of Computer Applications. 105, 1 (November 2014), 1-4. DOI=10.5120/18338-9465

                        @article{ 10.5120/18338-9465,
                        author  = { Debaroti Das,P.K.De },
                        title   = { Shortest Path Problem under Intuitionistic Fuzzy Setting },
                        journal = { International Journal of Computer Applications },
                        year    = { 2014 },
                        volume  = { 105 },
                        number  = { 1 },
                        pages   = { 1-4 },
                        doi     = { 10.5120/18338-9465 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }

                        %0 Journal Article
                        %D 2014
                        %A Debaroti Das
                        %A P.K.De
                        %T Shortest Path Problem under Intuitionistic Fuzzy Setting%T 
                        %J International Journal of Computer Applications
                        %V 105
                        %N 1
                        %P 1-4
                        %R 10.5120/18338-9465
                        %I Foundation of Computer Science (FCS), NY, USA

Abstract

In this article a fuzzy network has been considered whose edge weights are characterized by trapezoidal intuitionistic fuzzy numbers (TRIFNs). The network is acyclic with topological ordering. The shortest path and the corresponding path distance have been computed with the help of Bellman dynamic programming formulation. The method is illustrated by a suitable numerical example.

References

Biswas, S. S. , Alam, B. , Doja, M. N. 2013. An algorithm for extracting intuitionistic fuzzy shortest path in a graph. Applied Computational Intelligence and Soft Computing, 17.
Dubois, D. and Prade, H. 1980. Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York.
De, P. K. and Das, D. 2012 Ranking of trapezoidal intuitionistic fuzzy numbers, Intelligent Systems Design and Applications, 12th International IEEE Conference, 184-188.
De, P. K. , Bhinchar, A. 2012. Computation of Shortest Path in a Fuzzy Network: Case Study with Rajasthan Roadways Network. International Journal of Computer Applications (09758887), 11, 12.
De, P. K. , Bhincher, A. 2011. Dynamic programming and multi objective linear programming approaches. Applied mathematics Information Sciences, 5, 253-263.
Jayagowri, P. , Geetha Ramani, G. 2014. Using Trapezoidal Intuitionistic Fuzzy Number to Find Optimized Path in a Network. Advances in Fuzzy Systems.
Klein, C. M. 1991. Fuzzy shortest paths. Fuzzy Sets and Systems, 39(1), 27-41.
Mukherjee, S. 2012. Dijkstras algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment. Journal of Mathematical Modelling and Algorithms, 11(4), 345-359.
Okada, S. , Soper, T. 2000. A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets and System. 109(1), 129140.
Wang, J. Q. and Zhang, Z. 2009. Multi-criteria decision making with incomplete certain information based on intuitionistic fuzzy number. Control Decision. 24, 226-230.
Zhang, X. , Wang, Q. , Adamatzky, A. , Chan, F. T. , Mahadevan, S. , Deng, Y. 2014. A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths. Journal of Optimization Theory and Applications, 1-8.

Index Terms

Computer Science

Information Sciences

No index terms available.

Keywords

Value ambiguity ranking trapezoidal intuitionistic fuzzy number( TRIFN) shortest path