• Views 1,325
• Citations 5
• ePub 22
• PDF 654
`Advances in Fuzzy SystemsVolume 2014, Article ID 183607, 6 pageshttp://dx.doi.org/10.1155/2014/183607`
Research Article

## Using Trapezoidal Intuitionistic Fuzzy Number to Find Optimized Path in a Network

1Department of Mathematics, Sudharsan Engineering College, Pudukkottai, Tamil Nadu 622501, India

2Department of Mathematics, Anna University Chennai, BIT Campus, Tamil Nadu 620 024, India

Received 6 February 2013; Revised 18 October 2013; Accepted 2 April 2014; Published 11 May 2014

Copyright © 2014 P. Jayagowri and G. Geetha Ramani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

In real life, information available on situations/issues/problems is vague, inexact, or insufficient and so the parameters involved therein are grasped in an uncertain way by the decision maker. But in real life such uncertainty is unavoidable. One possible way out is to consider the knowledge of experts about the parameters involved as fuzzy data. In a network, the arc length may represent time or cost. In Relevant literature reports there are several methods to solve such problems in network-flow. This paper proposes an optimized path for use in networks, using trapezoidal intuitionistic fuzzy numbers, assigned to each arc length in a fuzzy environment. It proposes a new algorithm to find the optimized path and implied distance from source node to destination node.

#### 1. Introduction

Fuzzy network problems have appeared in literature for quite some time, of which the simplest and most often researched mode is the fuzzy shortest path problem. The main objective of the optimized path problem is to find a path with minimum distance. The classical fuzzy shortest path problem seems to have been first introduced by Dubois and Prade [1]. They employed the fuzzy minimum operator to find the shortest path length, but they did not develop any method to decide the shortest path. They have used a fuzzy number instead of a real number assigned to each of the edges. Okada and Soper [2] concentrated on an optimized path problem and introduced the concept of degree of possibility in which an arc is on the optimized path. Takahashi and Yamakami [3] discussed the optimized path from a specified node to every other node on a network. Another algorithm for this problem was presented by Okada and Gen [4, 5], where there is a generalization of Dijkstra’s algorithm. In this algorithm the weight of the arcs is considered to be interval numbers and is defined from a partial order between interval numbers.

Klein [6] proposed an improved algorithm that can get the shortest path length as well as the shortest path. However, the assumption made in the algorithm, that each arc with the length between “1” and a fixed integer “M” was not reasonable and practical. Szmidt and Kacprzyk [7] found distance between intuitionistic fuzzy sets using Hamming distance, the normalized Hamming distance, the Euclidean distance, and the normalized Euclidean distance. Kung and Chuang [8] pointed out that there are several methods to solve this kind of problem in the available literature. Przemysław Grzegorzewski [9] discussed two families of metrics in space of intuitionistic fuzzy numbers. Nagoor Gani and Mohammed Jabarulla [10] introduced a new algorithm to find an intuitionistic fuzzy optimized path in network problems. Lin and Chern [11] discussed the fuzzy optimized path problem and its most vital arcs. Hernandes et al. [12] have proposed a new algorithm to find the shortest path with fuzzy parameters on networks.

Kumar and Kaur [13] related an existing algorithm tracking the optimized path with fuzzy arc length. Jayagowri and Geetharamani [14] also did the same with a shortest path problem using intuitionistic triangular fuzzy numbers. Yu [15] proposed generalized intuitionistic trapezoidal fuzzy weighted average operator to aggregate the intuitionistic trapezoidal fuzzy numbers. Numerous articles have been published on fuzzy shortest path problems.

The present paper is organized as follows. In Section 2 some basic definitions are given and the required notations are explained. In Section 3 the optimized path obtained and its distance from intuitionistic trapezoidal fuzzy numbers are completed using the proposed algorithm with numerical examples. Section 4 discusses the results and advantages of the method proposed. In Section 5 the conclusions are presented.

#### 2. Preliminary and Definitions

In this section, some basic definitions relating to fuzzy sets and intuitionistic fuzzy sets are given.

##### 2.1. Acyclic Digraph

A directed graph is graph G, that is, a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another. A directed graph is sometimes called a digraph. Also G does not perform a cycle. Hence G is an acyclic digraph.

##### 2.2. Fuzzy Set Zadeh [16]

Let “” be the universal set. A fuzzy set in represented by , where the function is the membership degree of element in the fuzzy set .

##### 2.3. Intuitionistic Fuzzy Set (Atanassov [17]

Let be a universe of discourse, then an intuitionistic fuzzy set in is given by a set of ordered triples: , where are functions such that , for all . For each   the numbers and represent the degree of membership and non-membership of the element to , respectively.

##### 2.4. Fuzzy Number

A fuzzy number is a quantity whose value is imprecise, rather than exact as is the case with “ordinary” (single-valued) numbers. Any fuzzy number can be thought of as a function whose domain is a specified set. Each numerical value in the domain is assigned a specific “grade of membership.”

##### 2.5. Intuitionistic Fuzzy Number

An intuitionistic fuzzy set such that and , where for all , are fuzzy numbers called intuitionistic fuzzy numbers.

We denote by an intuitionistic fuzzy number and by IF () the set of all intuitionistic fuzzy numbers. It is obvious that any fuzzy number can be represented as an intuitionistic fuzzy number by .

We say () is an intuitionistic fuzzy number throughout this paper, where the function and . For convenience, we denote an intuitionistic fuzzy number by , where .

##### 2.6. Trapezoidal Fuzzy Number

A fuzzy number is called trapezoidal fuzzy number if its membership function is given by (see Figure 1)

Figure 1: Trapezoidal fuzzy number.
##### 2.7. Trapezoidal Intuitionistic Fuzzy Number

Let be an intuitionistic trapezoidal fuzzy number, and its membership function is Its nonmembership function is where and . Then is called a trapezoidal intuitionistic fuzzy number (see Figure 2).

Figure 2: Trapezoidal intuitionistic fuzzy number.
##### 2.8. Addition of Two Trapezoidal Intuitionistic Fuzzy Numbers Jianqiang and Zhong, 2009 [18]

Let and with be two intuitionistic trapezoidal fuzzy numbers; the following operations are valid:

##### 2.9. Ranking Function

A ranking function , where is set of all fuzzy numbers defined on set of real numbers and maps each fuzzy number into a real number. Let and be two triangular or trapezoidal fuzzy numbers; then (i), (ii), (iii).

##### 2.10. Notations

The notations that will be used throughout the paper are as follows.: the set of all nodes in a network.: the set of all predecessor nodes of node .: the intuitionistic fuzzy membership function distance between node and source node.: the intuitionistic fuzzy distance between node and .: the intuitionistic fuzzy nonmembership function distance between node and source node.: the intuitionistic fuzzy nonmembership function distance between node and .: the path in the th node.: total intuitionistic fuzzy distance between the source node and destination node.

Remark 1. A node is said to be the predecessor node of node if (i)node is directly connected to node , (ii)the direction of path connecting nodes and is from to .

#### 3. Proposed Algorithm

In this section a new algorithm is proposed for finding the intuitionistic fuzzy shortest path and shortest distance of each node from source node. The steps of the algorithm are summarized as follows.

Initially we have to label the source nodes as and which represent membership function and nonmembership function, respectively. We have to find the and using minimum of and for membership function and for nonmembership function, respectively, in order to find a path from to , where and are the minimum values which are in and . The above step is repeated until path is calculated for all the nodes starting from source node to destination node. We have to discard the path if there is no path between any nodes which do not have direct or indirect link. Thus fuzzy optimal path is obtained. The most optimal distance is measured by the summation of the value of the membership and nonmembership functions which are involved in fuzzy optimized path.

Step 1. Initialize the label of the source nodes () and .

Step 2. Consider the following:find ;.Then find , where and are the values of the minimum value which is in for membership function and for nonmembership function.

Step 3. Repeat Step 2 until is calculated for all the nodes starting from source node to destination node, but fuzzy distance along all paths is .

Step 4. Discard the path which does not have either direct or indirect link with the source node and destination node.

Step 5. Now the fuzzy optimized path can be obtained by combining the remaining paths starting from source node to destination node.

Step 6. The intuitionistic fuzzy shortest distance between source node and destination node is calculated by the sum of the value of the intuitionistic fuzzy number which is involved in the intuitionistic fuzzy optimized path in Step 5.

Illustrative Example. In order to illustrate the above procedure consider a small network shown in Figure 3, where each arc length is represented as a trapezoidal intuitionistic fuzzy number.

Figure 3

Initially we have to label the source nodes as and which represent membership function and nonmembership function, respectively. In Steps 2 and 3, first let us take and and then find and using the formula which is represented in the proposed algorithm. Next assume that and and find and . Similarly we extend this value up to and . (Since node 6 is the destination node, .) Steps 4, 5, and 6 are briefly explained in Table 1. From the table we can easily identify the required optimal path and shortest distance.

Table 1: Tabular representation of link between source and destination nodes.

Step 1. Assume and .

Steps 2 and 3. Consider the following.(i)Put ,   ;;;;;. (ii)Put ;   ;  (since there exists no path between any two vertices (edge connectivity), then we infer that ;    and ;  ;  (iii)Put ,  ;; ; and  ;;(iv) Put; ; ,;; and ;,;, ;(v)Put , ;;; ,; and ;;;.

Steps 4, 5, and 6. Table 1 shows the results of membership and nonmembership functions, direct/indirect link with source node, and direct/indirect link with destination node from Steps 2 and 3. Direct/indirect link between source node and destination node and distance result through direct/indirect link with source node and direct/indirect link with destination node.

#### 4. Results and Discussion

In this section the results obtained by using the proposed algorithm are discussed. The obtained fuzzy optimized path and fuzzy optimized distance between node 1 and node 6 are 1→3→4→6 and , respectively. The paper justifies that, each and every step derived from the direct or indirect link, the reader can decide whether to select the shortest path or to discard the path. The procedure for finding shortest path and distance is simple. If a decision maker wants to find the Intuitionistic fuzzy optimized path and Intuitionistic fuzzy optimized distance between source-node and sink-node, by using the suggested algorithm, the whole procedure need not be repeated again and again. For using the proposed algorithm the decision maker should have knowledge of ranking function and the additive arithmetic operations of Intuitionistic fuzzy numbers. A deep knowledge of intuitionistic fuzzy linear programming, crisp linear programming, and use of any operation research technique are not needed for finding the shortest path. It is very easy to learn and implement in any programming language. Thus the proposed algorithm is liable.

#### 5. Conclusion

In real life networks, the number of nodes is larger. Intuitionistic fuzzy optimized path length and optimized distance are information vital for decision makers in the field of logistics. Here the objective is to transport various quantities of a single homogeneous commodity initially stored at various origins to different destinations in such a way that the transportation cost is minimum. In this paper we have developed an algorithm to find the intuitionistic fuzzy optimized paths and optimized distance of a network with its arc length as trapezoidal intuitionistic fuzzy numbers. An illustrative example has been included to demonstrate the proposed method.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### References

1. D. Dubois and H. Prade, Fuzzy Sets and Systems, Academic Press, New York, NY, USA, 1980.
2. S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc lengths,” Fuzzy Sets and Systems, vol. 109, no. 1, pp. 129–140, 2000.
3. M. T. Takahashi and A. Yamakami, “On fuzzy shortest path problems with fuzzy parameters: an algorithmic approach,” in Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS '05), pp. 654–657, June 2005.
4. S. Okada and M. Gen, “Order relation between intervals and its application to shortest path problem,” Computers and Industrial Engineering, vol. 25, no. 1–4, pp. 147–150, 1993.
5. S. Okada and M. Gen, “Fuzzy shortest path problem,” Computers and Industrial Engineering, vol. 27, no. 1–4, pp. 465–468, 1994.
6. C. M. Klein, “Fuzzy shortest paths,” Fuzzy Sets and Systems, vol. 39, no. 1, pp. 27–41, 1991.
7. E. Szmidt and J. Kacprzyk, “Distances between intuitionistic fuzzy sets,” Fuzzy Sets and Systems, vol. 114, no. 3, pp. 505–518, 2000.
8. J.-Y. Kung and T.-N. Chuang, “The shortest path problem with discrete fuzzy arc lengths,” Computers and Mathematics with Applications, vol. 49, no. 2-3, pp. 263–270, 2005.
9. Przemysław Grzegorzewski Systems Research Institute and Polish Academy of Sciences, “Distances and orderings in a family of intuitionistic fuzzy numbers,” Newelska 6, 01-447 Warsaw, Poland.
10. A. Nagoor Gani and M. Mohammed Jabarulla, “On searching intuitionistic fuzzy shortest path in a network,” Applied Mathematical Sciences, vol. 4, no. 69-72, pp. 3447–3454, 2010.
11. K.-C. Lin and M.-S. Chern, “The fuzzy shortest path problem and its most vital arcs,” Fuzzy Sets and Systems, vol. 58, no. 3, pp. 343–353, 1993.
12. F. Hernandes, M. T. Lamata, J. L. Verdegay, and A. Yamakami, “The shortest path problem on networks with fuzzy parameters,” Fuzzy Sets and Systems, vol. 158, no. 14, pp. 1561–1570, 2007.
13. A. kumar and M. kaur, “A new algorithm for solving network flow problems with fuzzy arc lengths,” Turkish Journal of Fuzzy Systems, vol. 2, no. 1, 2011.
14. P. Jayagowri and G. Dr. Geetharamani, “On solving network problems using new algorithm with Intuitionistic fuzzy arc length,” in Proceedings of the International Conference on Mathematics in Engineering & Business Management, 2012.
15. D. Yu, “Intuitionistic trapezoidal fuzzy information aggregation methods and their applications to teaching quality evaluation,” Journal of Information and Computational Science, vol. 10, no. 6, pp. 861–869, 2013.
16. L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338–353, 1965.
17. K. Atanassov, “Intuitionistic fuzzy sets and systems,” Fuzzy sets and Systems, vol. 20, no. 1, pp. 87–96, 1986.
18. W. Jianqiang and Z. Zhong, “Aggregation operators on intuitionistic trapezoidal fuzzy number and its application to multi-criteria decision making problems,” Journal of Systems Engineering and Electronics, vol. 20, no. 2, pp. 321–326, 2009.