CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Shortest Path Problem under Intuitionistic Fuzzy Setting

by Debaroti Das, P.k.de
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Number 1
Year of Publication: 2014
Authors: Debaroti Das, P.k.de
10.5120/18338-9465

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 },
issue_date = { November 2014 },
volume = { 105 },
number = { 1 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume105/number1/18338-9465/ },
doi = { 10.5120/18338-9465 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:31.663034+05:30
%A Debaroti Das
%A P.k.de
%T Shortest Path Problem under Intuitionistic Fuzzy Setting
%J International Journal of Computer Applications
%@ 0975-8887
%V 105
%N 1
%P 1-4
%D 2014
%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
  1. 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.
  2. Dubois, D. and Prade, H. 1980. Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York.
  3. De, P. K. and Das, D. 2012 Ranking of trapezoidal intuitionistic fuzzy numbers, Intelligent Systems Design and Applications, 12th International IEEE Conference, 184-188.
  4. 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.
  5. De, P. K. , Bhincher, A. 2011. Dynamic programming and multi objective linear programming approaches. Applied mathematics Information Sciences, 5, 253-263.
  6. Jayagowri, P. , Geetha Ramani, G. 2014. Using Trapezoidal Intuitionistic Fuzzy Number to Find Optimized Path in a Network. Advances in Fuzzy Systems.
  7. Klein, C. M. 1991. Fuzzy shortest paths. Fuzzy Sets and Systems, 39(1), 27-41.
  8. 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.
  9. Okada, S. , Soper, T. 2000. A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets and System. 109(1), 129140.
  10. 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.
  11. 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

Keywords

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

Powered by PhDFocusTM