论文信息 - On Searching Intuitionistic Fuzzy Shortest Path in a Network

On Searching Intuitionistic Fuzzy Shortest Path in a Network

This paper presents to find the shortest path in a directed graph which an intuitionistic fuzzy number, instead of a fuzzy number is assigned to each arc length. An existing algorithm is modified to find the optimal path. Inputs and outputs of the proposed algorithm are intuitionistic fuzzy numbers. Finally an illustrative numerical example is given to demonstrate the proposed approach.

A. Nagoor Gani | A. Gani | M. Mohammed Jabarulla | M. M. Jabarulla

[1] Ching-Hsue Cheng,et al. Using intuitionistic fuzzy sets for fault-tree analysis on printed circuit board assembly , 2006, Microelectron. Reliab..

[2] Krassimir T. Atanassov,et al. Intuitionistic fuzzy sets , 1986 .

[3] Jung-Yuan Kung,et al. A new algorithm for the discrete fuzzy shortest path problem in a network , 2006, Appl. Math. Comput..

[4] V. Lakshmana Gomathi Nayagam,et al. Ranking of intuitionistic fuzzy numbers , 2008, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence).

[5] Xinfan Wang. Fuzzy Number Intuitionistic Fuzzy Arithmetic Aggregation Operators , 2008 .

[6] First A. Kiran Yadav,et al. On Searching Fuzzy Shortest Path In a Network , 2009 .