# Distance Based Entropy Measure of Interval-Valued Intuitionistic Fuzzy Sets and Its Application in Multicriteria Decision Making.

1. IntroductionIn fuzzy set theory, the measurement of the degree of fuzziness in fuzzy sets and other extended higher order fuzzy sets is an important concept in dealing with real world problems. Zadeh [1] proposed the fuzzy entropy theory in 1965 which has been realized as a great achievement in various fields of MCDM. To measure of the amount of information in decision processes, De Luca and Termini [2] introduced their axiomatic construction of entropy of fuzzy sets by using the idea of Shannon's probability entropy. Kaufmann [3] pointed out that the entropy of a fuzzy set can be found by calculating the distance between the fuzzy set and its nearest nonfuzzy set. However, Yager [4] constructed the entropy of a fuzzy set by using the distance of a fuzzy set to its complement. Based on the concept of entropy measure of a fuzzy set proposed by De Luca and Termini [2] and Zadeh [5], Loo [6] further extended the definition of entropy and developed new entropy measure of a fuzzy set. Liu [7] proposed the axiomatic definition of similarity, distance, and entropy measure of fuzzy set whereas Mi et al. [8] introduced a generalized axiomatic definition of entropy based on a distance in comparison with the axiomatic definition of Liu [7]. A great number of scholars have introduced various techniques of entropy measures for fuzzy set [9-11]. Szmidt [12] and Vlachos [13] introduced some entropy measures for intuitionistic fuzzy sets (IFSs) and discussed their applications in pattern recognition. Furthermore, Burillo and Bustince [14] proposed some entropy measures for interval-valued fuzzy sets (IVFSs) and IFSs while Zeng [15] and Zhang [16] proposed different entropy measures in the context of IVFSs. Liu [7], Zeng [17, 18], and Li [19] investigated some valuable relationships between similarity, distance, and entropy measures for fuzzy sets, IVFSs and IFSs. Farhadinia [20] came up with some entropy measures in the context of hesitant fuzzy sets and interval-valued fuzzy soft sets.

The IVIFS introduced by Atanassov [21] is a very useful generalization of IFS [22]. The IVIFS greatly helps in working under vagueness and uncertainty with a membership and nonmembership interval values of an element belonging to an IVIFS instead of real values in [0,1]. In the uncertain environments, IVIFS has played a powerful role and received great consideration from the researchers. Most of the researchers got useful results in solving the MCDM [23-26] and MCGDM [27,28] problems in the context of IVIFSs. In the past few years, the distance, similarity, inclusion, and information entropy measures for IVIFSs were very important topics. Therefore, there are a large number of researchers who have investigated their studies considering all the measures as mentioned above. Huang et al. [29] proposed an idea of information entropy for IVIFS and used it in uncertain system control and decision making. Furthermore, more work on entropy measures for IVIFSs has been proposed by many researchers in different viewpoints; for example, Liu [30], Zhang [31-33], Wei [34], and Ye [35] have investigated and contributed a lot of work on this topic and discussed their applications to solve different MCDM problems in real life. However, many entropy measures for IVIFS are very complicated and unacceptable in the intuitive sense. In order to overcome this weakness in the existing entropy measures, Zhang et al. [36] proposed the distance based information entropy measure for IFS and IVIFSs and then established some relationships between the entropy, similarity, and inclusion measures of IVIFSs.

Recently, the studies on the similarity and entropy measures of different extensions of fuzzy sets are growing; for example, Pramanik et al. [37] discussed NS-cross entropy and designed a MAGDM strategy which is symmetric, free from undefined phenomena, and very useful for MCGDM problems. Dalapati et al. [38] further introduced IN-cross entropy and weighted IN-cross entropy and used them to design a MCGDM strategy. Pramanik et al. [39] discussed vector similarity measures of single-valued and interval neutrosophic sets by hybridizing the ideas of dice and cosine similarity measures and presented its applications in MCDM problems. Uluay et al. [40] proposed dice similarity, weighted dice similarity, hybrid vector similarity, and weighted hybrid vector similarity measures for bipolar neutrosophic sets and presented a MCDM strategy. Pramanik et al. [41] discussed cross entropy measures of bipolar neutrosophic sets and interval bipolar neutrosophic sets and designed MCDM strategies based on the cross entropy measures.

The distance between fuzzy sets and the entropy measure are very important to calculate the degree of fuzziness of a fuzzy set, and a lot of work as mentioned above has been contributed to the literature by various researchers. Therefore, motivated by the advantages of the entropy measures of different extensions of fuzzy sets, in this paper we proposes an entropy measure based on new distance measure for IVIFSs. In this approach, we first put forward a useful distance measure for IVIFSs which is completely different from the existing ones and then propose an entropy measure formula based on this distance measure. Furthermore, a useful comparison of the proposed entropy measure with the existing entropy measures formulae is performed to avoid any inconsistency in the proposed approach. In order to ensure the practicality and effectiveness of the proposed approach, we finally apply this approach to solve various MCDM and MCGDM problems using IVIFSs.

The remaining part of the paper can be summarized briefly as follows. Some basic concepts related to the work are presented in Section 2. A comparison of the performance of proposed entropy measure to those of all known entropy measures is established in Section 3. Different approaches are developed in Section 4 to handle MCDM and MCGDM problems using IVIFSs. Several numerical examples are provided to make out the practicality and effectiveness of the proposed approach in Section 5. We wind up the paper with some useful remarks in Section 6.

2. Preliminary

In this section, basic definitions of IVIFS, the weighted arithmetic and geometric average operators, and some distance measures for IVIFSs are presented. The entropy measure for IVIFS based on different distance measures along with some basic properties is also discussed in this section. Furthermore, throughout the paper, the set of all closed subintervals of [0,1] is denoted by [I], the domain or universe of discourse is denoted by a set X = {[x.sub.1], [x.sub.2], ..., [x.sub.n]], the collection of all the crisp sets is denoted by P(X), and the set of all IVIFSs in X are denoted by IVIF(X).

Definition 1 (see [14]). Let [a,b], [c,d] [member of] [I]. For the comparison of two elements of [7], one defines

[mathematical expression not reproducible]. (1)

Definition 2 (see [21]). An IVIFS A in X is defined by a set A = {{[x.sub.i], a([x.sub.i]), a'([x.sub.i])) | [[x.bar].sub.i] [member of] X}, where a([x.sub.i]) = [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])], a'([x.sub.i]) = [[a.bar]'([x.sub.i]), [bar.a']([x.sub.i])] [member of] [I] are called the interval membership and nonmembership degrees of an element [x.sub.i] to A, respectively, provided that 0 [less than or equal to] [bar.a]([x.sub.i]) + [bar.a']([x.sub.i]) [less than or equal to] 1 for any [x.sub.i] [member of] X.

Definition 3. For A,B [member of] IVIF(X), where A = {([x.sub.i], a([x.sub.i]), A'([x.sub.i])> | [x.sub.i] [member of] X} and B = {([x.sub.i], b([x.sub.i]), b'([x.sub.i])> | [x.sub.i] [member of] X}, some basic operations and relations are defined as follows:

(1) A [union] B = {([x.sub.i], [[a.bar]([x.sub.i]) [disconjunction] [b.bar]([x.sub.i]), [bar.a]([x.sub.i]) [conjunction] [bar.b]([x.sub.i])], [[a'.bar]([x.sub.i]) [conjunction] [b'.bar][ [x.sub.i]), [bar.a']([x.sub.i]) [conjunction] [bar.b']([x.sub.i])]) | [x.sub.i] [member of] X};

(2) A [intersection] B = {([x.sub.i], [[a.bar]([x.sub.i]) [conjunction] [b.bar]([x.sub.i]), [bar.a]([x.sub.i]) [conjunction] [bar.b]([x.sub.i])], [[a'.bar]([x.sub.i]) [disconjunction] [b'.bar]([x.sub.i]), [bar.a']([x.sub.i]) [disconjunction] [bar.b']([x.sub.i])]) | [x.sub.i] [member of] X};

(3) [A.sup.c] = {([x.sub.i], [[a'.bar]([x.sub.i]), [bar.a']([x.sub.i])], [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])]) | [x.sub.i] [member of] X};

(4) A [subset or equal to] B [??] [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])] [less than or equal to] [[b.bar]([x.sub.i]), [bar.b]([x.sub.i])] and [[a'.bar]([x.sub.i]), [bar.a']([x.sub.i])] [greater than or equal to] [[b'.bar][([x.sub.i]), [bar.b']([x.sub.i])] [for all] [x.sub.i] [member of] X;

(5) A = B, [??] [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])] = [[b.bar]([x.sub.i]), [bar.b]([x.sub.i])] and [[bar.a']([x.sub.i]), [bar.a']([x.sub.i])] = [[b'.bar]([x.sub.i]), [bar.b']([x.sub.i])] [for all] [x.sub.i] [member of] X.

Definition 4 (see [27, 42]). Let A, B [member of] IVIF(X) and [lambda] [greater than or equal to] 0. Then

(1) A [direct sum] B = {([x.sub.i], [[a.bar]([x.sub.i]) + [b.bar]([x.sub.i]) - [a.bar]([x.sub.i]) [b.bar]([x.sub.i]), [bar.a]([x.sub.i]) + [bar.b]([x.sub.i]) - [bar.a]([x.sub.i])[bar.b]([x.sub.i])], [[a'.bar]([x.sub.i])[b'.bar][([x.sub.i]), [bar.a']([x.sub.i]) [bar.b']([x.sub.i])]> | [x.sub.i] [member of] X};

(2) A [cross product] B = {([x.sub.i], [[a.bar]([x.sub.i])[b.bar]([x.sub.i]), [bar.a]([x.sub.i]) [bar.b]([x.sub.i]), [a'.bar]([x.sub.i]) + [b'.bar]([x.sub.i]) + [b'.bar]([x.sub.i]) - [a'.bar]([x.sub.i])][b'.bar]([x.sub.i]), [bar.a'][([x.sub.i]) + [bar.b']([x.sub.i]) - [bar.a']([x.sub.i]) - [bar.a']([x.sub.i])[bar.b'][x.sub.i][bar.b']([x.sub.i])]> | [x.sub.i] [member of] X};

(3) [lambda]A = {<[x.sub.i], [1 - [(1 - [a.bar]([x.sub.i])).sup.[lambda]], 1 - [(1 - [bar.a]([x.sub.i])).sup.[lambda]]], [[([a'.bar]([x.sub.i])).sup.[lambda]], [([bar.a']([x.sub.i])).sup.[lambda]]> | [x.sub.i] [member of] X};

(4) [A.sup.[lambda]] = {<[x.sub.i], [[([a.bar]([x.sub.i])).sup.[lambda]] - [([bar.a]([x.sub.i])).sup.[lambda]], [1 - [(1 - [bar.a']([x.sub.i])).sup.[lambda]], 1 - [(1 - [bar.a']([x.sub.i])).sup.[lambda]]]> | [([a.bar]([x.sub.i])).sup.[lambda]] X}.

In the following, Xu [43] introduced two weighted aggregation operators related to IVIFSs as follows.

Definition 5 (see [43]). The weighted arithmetic average operator for [A.sub.j] = {<([x.sub.i]), [a.sub.j]([x.sub.i]), [a'.sub.j] ([x.sub.i])> | [x.sub.i] [member of] X} [member of] IVIF(X), j = 1, 2, ..., n is defined by

[mathematical expression not reproducible], (2)

where [w.sub.j] [member of] [0, 1] and [[summation].sup.n.sub.j=1] [w.sub.j] = 1. The element [w.sub.j] is denoted as the weight of [A.sub.j] (j = 1, 2, ..., n) [member of] IVIF(X). In particular, [F.sub.w] is called the arithmetic average operator for IVIFSs if [w.sub.j] = 1/n (j = 1, 2, ..., n).

Definition 6 (see [43]). The weighted geometric average operator for [A.sub.j] [member of] IVIF(X), j = 1, 2, ..., n, is defined by

[mathematical expression not reproducible], (3)

where [w.sub.j] [member of] [0, 1] and [[summation].sup.n.sub.j=1] [w.sub.j] = 1. The element [w.sub.j] is denoted as the weight of [A.sub.j] (j = 1, 2, ..., n) [member of] IVIF(X). In particular, [G.sub.w] is called the geometric average operator for IVIFSs if [w.sub.j] = 1/n (j = 1, 2, ..., n).

Definition 7. The distance measure of IVIFSs on X is a real valued function d : IVIF(X) x IVIF(X) [right arrow] [0,1] which satisfies the following properties:

(1) If A is a crisp set, then d(A, [A.sup.c]) = 1;

(2) d(A, B) = 0 [??] if A = B;

(3) d(A, B) = d(B, A), [for all]A, B [member of] IVIF(X);

(4) If A [subset or equal to] B [subset or equal to] C, then d(A, C) [greater than or equal to] d(A, B) and d(A, C) [greater than or equal to] d(B,C).

Definition 8. For any two IVIFSs in X, the following six distance measures were discussed in [36].

Consider A, B [member of] IVIF(X), where X = {[x.sub.1], [x.sub.2], ..., [x.sub.n]}.

(1) Normalized Euclidean distance

[mathematical expression not reproducible]. (4)

(2) Normalized hamming distance

[d.sub.2] (A,B) = 1/4n [n.summation over (i=1)] [[absolute value of [a.bar]([x.sub.i]) - [b.bar]([x.sub.i])]] + [absolute value of [a'.bar]([x.sub.i]) - [b'.bar]([x.sub.i])]

+ [[absolute value of [bar.a]([x.sub.i]) - [bar.b]([x.sub.i])]] + [absolute value of [bar.a']([x.sub.i]) - [bar.b']([x.sub.i])]. (5)

(3) Normalized hamming distance measure induced by Hausdorff metric

[mathematical expression not reproducible]. (6)

(4) Normalized distance measure induced by Hausdorff metric

[mathematical expression not reproducible]. (7)

(5) Fifth distance measure

[mathematical expression not reproducible]. (8)

(6) Generalized distance measure, for any p [greater than or equal to] 2,

[mathematical expression not reproducible]. (9)

Definition 9 (see [31]). The entropy measure of IVIFSs is a function E : IVIF(X) [right arrow] [0,1] which satisfies the following four properties.

(1) E(A) = 0 if A is a crisp set;

(2) E(A) = 1 [??] a([x.sub.i]) = a'([x.sub.i]), [for all]x [member of] X;

(3) E(A) = E(B), if A is less fuzzy than B; i.e.,

[mathematical expression not reproducible]

(4) E(A) = E([A.sup.c]).

Definition 10 (see [36]). The entropy measure of IVIFS on X can be defined as a function E : IVIF(X) [right arrow] [0,1] which fulfills the properties as follows:

(1) E(A) = 0, [for all]A [member of] P(X), i.e., if A is a crisp set;

(2) E(A) = 1, [??] a([x.sub.i]) = a'([x.sub.i]) = [1/2, 1/2], [for all][x.sub.i] [member of] X, i.e., A = [([1/2, 1/2], [1/2, 1/2]).sub.X];

(3) If d(A, [<[1/2, 1/2], [1/2, 1/2]>.sub.X]) [greater than or equal to] d(B, [<[1/2, 1/2], [1/2, 1/2]).sub.X]), then E(A) [less than or equal to] E(B), [for all]A, B [member of] IVIF(X);

(4) E(A) = E([A.sup.c]).

Remark 11. The properties as discussed above reveal the following important points:

(1) a crisp set is always nonfuzzy; i.e., an IVIFS has no vagueness when it degenerates to a crisp set;

(2) the fuzziest IVIFS is [F.sub.X] = [<[1/2, 1/2], [1/2, 1/2]).sub.X];

(3) the IVIFS is more fuzzier when it is closer to [F.sub.X];

(4) the IVIFS and its complement have the same fuzziness.

Zhang [36] introduced the following useful method to obtain an entropy measure of IVIFSs, which possesses all the above-mentioned four properties.

Definition 12 (see [36]). Suppose the six distance measures between IVIFSs are denoted by [d.sub.i], i = 1, 2, ..., 6 as mentioned before. Then, for any A member of] IVIF(X), [E.sub.i](A) = 1 - 2[d.sub.i](A, [F.sub.X]), I = 1,2, ..., 6, are known as the entropy measures of IVIFSs where [d.sub.i](1 [less than or equal to] i [less than or equal to] 6) are the distance measures as discussed in Definition 8.

3. Comparison of Entropy Measures for IVIFSs

Liu [7] developed few distance measures of fuzzy sets and discussed some of their desired properties. Zeng [17] and Grzegorzewski [44] developed a number of normalized distance measures for IVFSs. Park [45] investigated various distances over IVIFSs in X. Motivated by the above work, we can set our investigation over another useful distance measure of IVIFSs as follows.

Definition 13. For A, B [member of] IVIF(X), where A = {<[x.sub.i], a([x.sub.i]), a'([x.sub.i])> [absolute value of [x.sub.i] [member of] X} and B = {<[x.sub.i], b[x.sub.i], b'[x.sub.i]>] [x.sub.i] [member of] X}, one defines

[mathematical expression not reproducible]. (10)

The proposed distance measure of IVIFSs A and B is defined by [d.sub.FZ](A, B) = (1/2)([d.bar] + [bar.d]).

Remark 14. It is easy to show that the new proposed distance [d.sub.FZ] satisfies all the four properties discussed in Definition 7.

Some important entropy measures of IVIFSs have been introduced in the literature by various researchers to handle MCDM problems of real-life applications [33-35]. Zhang [31] extended the intuitionistic fuzzy entropy axioms presented in [12] and introduced a new definition of entropy for IVIFSs. Zhang [36] further extended the entropy concept for fuzzy set [2, 7] to introduce another useful distance based entropy measure for IVIFS. Now, we introduce another entropy measure of IVIFSs based on a proposed distance measure [d.sub.FZ] as follows.

Definition 15. Let [d.sub.FZ] be the proposed distance measure (Definition 13) of IVIFSs. Then, [E.sub.FZ] (A) = 1 - 2d(A, [F.sub.X]) is defined as an entropy measure of IVIFSs for any A [member of] IVIF(X) based on the distance measure [d.sub.FZ].

Theorem 16. Let [d.sub.FZ] be the proposed distance measure (Definition 13) between two IVIFSs. Then, [E.sub.FZ] (A) = 1 2[d.sub.FZ](A, [F.sub.X]) is the entropy measure of IVIFS A for any A [member of] IVIF(X).

Proof. We will try to prove that [E.sub.FZ] fulfills all the properties discussed in Definition 10.

(1) For A(x) = <[1,1], [0,0]> or A(x) = <[0, 0], [1,1]> [for all]x [member of] X, i.e., if A is a crisp set, then, from Definition 13 we have [d.sub.FZ](A, [F.sub.X]) = 1/2.

Hence, [E.sub.FZ] (A) = 1 - 2[d.sub.FZ](A, [F.sub.X]) = 0.

(2) [E.sub.FZ](A) = 1 [??] 1 - 2[d.sub.FZ](A, [F.sub.X]) = 1 [??] [d.sub.FZ](A, [F.sub.X]) = 0 [??] A = [F.sub.X] (by Definition 13).

(3) [d.sub.FZ](A, [F.sub.X]) [greater than or equal to] [d.sub.FZ](B, [F.sub.X]); then it immediately follows that [E.sub.FZ](A) [less than or equal to] [E.sub.FZ](B).

(4) [A.sup.c] = {{[x.sub.i], [[a'.bar]([x.sub.i]), [bar.a']([x.sub.i])], [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])]> | [x.sub.i] [member of] X}. Therefore, it can be easily observed that [d.sub.FZ]([A.sup.c], [F.sub.X]) = [d.sub.FZ](A, [F.sub.X]). Hence [E.sub.FZ]([A.sup.c]) = [E.sub.FZ](A).

Zhang [36] compared the performances of the proposed entropies [E.sub.1], [E.sub.2], [E.sub.3], [E.sub.4], [E.sub.5], and [E.sub.6] to those of [E.sub.L] [30], [E.sub.ZJ] [31], [E.sub.W[lambda]] [34], [E.sub.ZM] [33], and [E.sub.Y] [35]. Now we shall also compare the performance of proposed entropy measure to those of all entropy measures as mentioned above with the help of the following example.

Example 17. We will consider here an example, as adapted by Hung and Yang in [46]. Suppose that A = {<[x.sub.i], [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])], [[a'.bar]([x.sub.i]), [bar.a']([x.sub.i])]> | [x.sub.i] [member of] X} [member of] IVIF(X). For any n [member of] [R.sup.+], define the IVIFS An as follows:

[A.sup.n] = {<[x.sub.i], [[a.bar][([x.sub.i]).sup.n], [bar.a][([x.sub.i]).sup.n]],

[1 - [(1 - [a'.bar]([x.sub.i])).sup.n], 1 - [(1 - [bar.a']([x.sub.i])).sup.n]]> | [x.sub.i] [member of] X}. (11)

The IVIFS A was defined on the universal set X = {6,7, 8, 9, 10} in [46] as follows:

A = {(6, [0.1, 0.2], [0.6, 0.7]}, (7, [0.3, 0.5], [0.4, 0.5]},

(8, [0.6, 0.7], [0.1, 0.2]}, (9, [0.8, 0.9], [0, 0.1]},

(10, [1.0,1.0], [0,0]}}, (12)

and, similarly, we can determine the following IVIFSs:

[A.sup.1/2] = {<6, [0.3162, 0.4472], [0.3675,0.4523]>,

<7, [0.5477,0.7071], [0.2254,0.2929]>,

<8, [0.7746, 0.8367], [0.0513,0.1056]>,

<9, [0.8944, 0.9487], [0,0.0513]>,

<10, [1.0,1.0], [0,0]>},

[A.sup.2] = {<6, [0.01,0.04], [0.84,0.91]>,

<7, [0.09, 0.25], [0.64,0.75]>,

<8, [0.36, 0.49], [0.19,0.36]>,

<9, [0.64, 0.81], [0,0.19]>, <10, [1.0,1.0], [0,0]>},

[A.sup.3] = {<6, [0.0010, 0.0080], [0.9360, 0.9730]>,

<7, [0.0270, 0.1250], [0.7840, 0.8750]>,

<8, [0.2160, 0.3430], [0.2710,0.4880]>,

<9, [0.5120,0.7290], [0, 0.2710]>,

<10, [1.0,1.0], [0,0]>},

[A.sup.4] = {<6, [0.0001,0.0016], [0.9744, 0.9919]>,

<7, [0.0081,0.0625], [0.8704,0.9375]>,

<8, [0.1296,0.2401], [0.3439,0.5904]>,

<9, [0.4096,0.6561], [0, 0.3439]>,

<10, [1.0,1.0], [0,0]}>. (13)

In order to express the characterization of these sets in linguistic variables, De [47] considered A as "LARGE" in X. By using the above-mentioned operations,

[A.sup.1/2] can be considered as "more or less LARGE";

[A.sup.2] can be considered as "very LARGE";

[A.sup.3] can be considered as "quite very LARGE";

[A.sup.4] can be considered as "very very LARGE".

Based on the mathematical operations, the entropy measures of IVIFSs as discussed above should fulfill the condition as mentioned in [46]; i.e., E([A.sup.1/2]) > E(A) > E([A.sup.2]) > E([A.sup.3]) > E([A.sup.4]). Now we try to compare the performance of proposed entropy measures [E.sub.FZ] by using the IVIFSs as mentioned above to those of [E.sub.1], [E.sub.2], [E.sub.3], [E.sub.4], [E.sub.5], [E.sub.6], El, EZj, Ewx, Ezm, and EY. The entropy values by using all the corresponding distance measures can be seen in Table 1.

It can be easily seen that the purposed entropy measure also looks quite reasonable as compared with existing entropy measures of IVIFSs.

4. Optimal Decision Making Approaches Using IVIFSs

In this section, we develop some procedures to solve various MCDM and MCGDM problems based on a proposed entropy measure formula in the context of interval-valued intuitionistic fuzzy environment.

4.1. For Single DM. Let A = {[A.sub.1], [A.sub.2], [A.sub.m]} be a set of m alternatives and C = {[C.sub.1], [C.sub.2], ..., [C.sub.n]} be a set of n criteria. Suppose each alternative [A.sub.i] (i = 1, 2, ..., m) is assessed by the DM D with respect to each criterion [C.sub.j] (j = 1, 2, ..., n) using the IVIFS

[A.sub.i] = {<[C.sub.j], [[a.bar]([x.sub.i]), [bar.a]([x.sub.i])], [[a'.bar]([x.sub.i]), [bar.a']([x.sub.i]>]) | [x.sub.i]

[member of] X}, (14)

where 0 [less than or equal to] [bar.a]([x.sub.i]) + [bar.a']([x.sub.i]) [less than or equal to] 1. Suppose that R = [([r.sub.ij]).sub.mxn] = [([[a.sub.ij], [b.sub.ij]], [[c.sub.ij], [d.sub.ij]]).sub.mxn] is an interval-valued intuitionistic fuzzy decision matrix provided by the DM D during the assessment process. The intervals [[a.sub.ij], [b.sub.ij]] and [[c.sub.ij], [d.sub.ij]] represent the degrees that the alternative [A.sub.i] (i = 1, 2, ..., m) satisfies and does not satisfy, respectively, the attribute [C.sub.j] (j = 1, 2, ..., n) during the assessment process.

By using the proposed entropy formula of IVIFSs (see Definition 15), the entropy value of each alternative corresponding to each criterion can be easily computed. Suppose [E.sub.1], [E.sub.2], ..., [E.sub.m] are the corresponding entropy measures of each alternative [A.sub.i] (i = 1,2,...,m), respectively. As it is generally known, the DM can get more useful information from an alternative if its entropy value corresponding to each criterion is smaller. Therefore, the less the entropy value of an alternative, the more it will be considered as a better option among all the given alternatives. Thus, with respect to the descending order of the entropy values as calculated above, we can find the ranking order of all the alternatives.

4.2. For Single DM with Given Weights of Criteria. Let A, C, and R = [([r.sub.ij]).sub.mxn] be as previously mentioned in Section 4.1. Suppose the DM D entered the weight value [w.sub.j], [w.sub.j] [member of] [0, 1], [[summation].sup.n.sub.j=1] [w.sub.j] = 1 for each [C.sub.j] (j = 1, 2, ..., n). Now, we try to develop a procedure to solve this MCDM problem, according to the defined measures in the following two steps.

Step 1. According to each row in the decision matrix R = [([r.sub.ij]).sub.mxn], calculate the aggregated interval-valued intuitionistic fuzzy number [[alpha].sub.i] (i = 1, 2, ..., m) where [[alpha].sub.i] = [F.sub.iw]([r.sub.i1], [r.sub.i2], ..., [r.sub.in]) or [[alpha].sub.i] = [G.sub.iw]([r.sub.i1], [r.sub.i2], ..., [r.sub.in]) by using Definitions 5 and 6.

Step 2. Calculate [d.sub.i]([[alpha].sub.i], [F.sub.X]) by using the proposed distance measure (see Definition 13) for each i = 1, 2, ..., m, and then find their corresponding entropy measures [E.sub.1], [E.sub.2], ..., [E.sub.m] of each alternative by using Definition 15. The ranking order of all the alternatives can be obtained by using again the concept of entropy theory.

4.3. Procedure to Solve MCGDM Problems with IVIFSs. Let A and C be again considered as previously mentioned in Section 4.1. Suppose D = {[d.sub.1], [d.sub.2], ..., [d.sub.t]} is a set of DMs. Let [[a.sup.k.sub.ij], [b.sup.k.sub.ij]] be an interval which represents the degree to which the alternative [A.sub.i] (i = 1, 2, ..., m) meets the criteria [C.sub.j] (j = 1, 2, ..., n) and [[c.sup.k.sub.ij], [d.sup.k.sub.ij]] represents the degree to which the alternative [A.sub.i](i = 1, 2, ..., m) does not meet the criteria [C.sub.j] (j = 1, 2, ..., n) assessed by the DM [d.sub.k] (k = 1,2, ..., t). Let [R.sup.k] = [([r.sup.k.sub.ij]).sub.mxn] = [([[a.sup.k.sub.ij], [b.sup.k.sub.ij]], [[c.sup.k.sub.ij], [d.sup.k.sub.ij]]).sub.mxn] be an intuitionistic fuzzy decision matrix provided by a DM [d.sub.k] (k = 1,2, ..., t) for an alternative [A.sub.i] (i = 1, 2, ..., m) under the criteria [C.sub.j] (j = 1, 2, ..., n). The concrete steps of MCGDM procedure in the IVIF setting can be organized as follows.

Step 1. Determine the aggregated decision matrix S of the decision matrices [R.sub.1], [R.sub.2], ..., [R.sub.t] where S = [R.sub.1] [cross product] [R.sub.2] [cross product] ... [cross product] [R.sub.t] by using Definition 4.

Step 2. By using the proposed entropy formula of IVIFSs (see Definition 15), it is easy to compute the entropy value of each possible alternative in the aggregated decision matrix S and then deduce the ranking order of all the alternatives [A.sub.i] (i = 1,2, ..., m) using again the concept of entropy theory.

5. Numerical Examples

In this section, various practical MCDM and MCGDM problems are offered to show the concrete applications of the proposed method. First, we study the same MCDM problem as presented by Nayagam in [22].

Example 1 (see [22]). Assume there exists a panel with four possible alternatives for investment: (1) [A.sub.1]: a car company; (2) [A.sub.2]: a food company; (3) [A.sub.3]: a computer company; (4) [A.sub.4]: an arms company. The investment entity must make a decision according to the following three criteria: [C.sub.1] (risk), [C.sub.2] (growth), and [C.sub.3] (environmental impact). The interval-valued intuitionistic fuzzy assessment values of four alternatives provided by the DMs under the above-mentioned three criteria can be seen as in the following matrix:

[mathematical expression not reproducible]. (15)

Corresponding to an alternative [A.sub.i] (i = 1, 2, 3,4) with respect to each criterion [C.sub.j] (j = 1,2,3), each element of the matrix R is an IVIFS. As we know, the less the uncertainty information about an alternative with respect to given criteria, the better the alternative is. Therefore, the optimal ranking of the alternatives can be obtained according to the measure of the entropy values of corresponding IVIFSs.

By employing the proposed entropy formula (see Definition 15) of IVIFSs, the corresponding entropy measures of the four alternatives [A.sub.i] (i = 1, 2, 3, 4) are, respectively, [E.sub.1] = 0.6667, [E.sub.2] = 0.5667, [E.sub.3] = 0.7000, and [E.sub.4] = 0.4667. Thus, with respect to descending order of the entropy values, the ranking order of all the four alternatives is [A.sub.4] > [A.sub.2] > [A.sub.1] > [A.sub.3]. Hence, the best alternative is [A.sub.4], which agrees with the ranking results as obtained in [22].

Next, we study the same problem as discussed by Xu in [42].

Example 2 (see [42]). Suppose we are given five alternatives [A.sub.i] (i = 1, 2, 3, 4, 5) and six appropriate criteria [C.sub.j] (j = 1, 2, 3, 4, 5, 6). Assume that the criterion weight vector provided by the DM is W = (0.20,0.10,0.25,0.10,0.15,0.20). The decision matrix R containing the assessment values of all the alternatives with respect to six criteria provided by the DM using IVIFSs is then constructed and given as follows:

[mathematical expression not reproducible]. (16)

The proposed method is now applied to solve the given problem, according to the computational practice as follows.

Step 1. If we focus on the groups' influence, the following weighted arithmetic average values [[alpha].sub.i] of all the alternatives [A.sub.i] (i = 1, 2, 3, 4, 5) are obtained by using a definition of weighted arithmetic average operator (see Definition 5) as presented in Section 2:

[[alpha].sub.1] = ([0.4165, 0.5597], [0.2459,0.3804]),

[[alpha].sub.2] = ([0.5176, 0.6574], [0.1739,0.2947]),

[[alpha].sub.3] = ([0.4703,0.5900], [0.1933,0.3424]),

[[alpha].sub.4] = ([0.6070, 0.7203], [0.1149,0.2400]),

[[alpha].sub.5] = ([0.5375,0.6536], [0.1772,0.3557]). (17)

Step 2. Let [E.sub.i]'s denote the entropy of [[alpha].sub.i]'s (i = 1, 2, 3, 4, 5), respectively. Then by using our proposed distance measures of IVIFSs (see Definition 13), the corresponding entropy measures of [[alpha].sub.i]'s are obtained, respectively, as [E.sub.1] = 0.6863, [E.sub.2] = 0.6563, [E.sub.3] = 0.6636, [E.sub.4] = 0.5078, and [E.sub.5] = 0.6397. Based on these entropy measures, the optimal ranking order of the five alternatives is [A.sub.4] > [A.sub.5] > [A.sub.2] > [A.sub.3] > [A.sub.1] and the most suitable alternative is [A.sub.4]. The ranking results coincide with the ones obtained by Xu in [42].

If we focus on the individual influence, the weighted geometric average values [[alpha].sub.i] of all the alternatives are calculated by applying Definition 6. The IVIF values [[alpha].sub.i] for [A.sub.i] (i = 1, 2, 3, 4, 5) are computed as follows:

[[alpha].sub.1] = ([0.3257, 0.4848], [0.2878,0.4132]),

[[alpha].sub.2] = ([0.4896, 0.6338], [0.2185,0.3301]),

[[alpha].sub.3] = ([0.4398, 0.5673], [0.2260,0.3533]),

[[alpha].sub.4] = ([0.5733, 0.6868], [0.1210,0.2467]),

[[alpha].sub.5] = ([0.5204, 0.6307], [0.1991,0.3782]). (18)

The corresponding entropy measures of [[alpha].sub.i]'s can be calculated again as, respectively, [E.sub.1] = 0.7726, [E.sub.2] = 0.7081, [E.sub.3] = 0.6657, [E.sub.4] = 0.5477, and [E.sub.5] = 0.6786, and therefore the ranking order of the given alternatives is [A.sub.4] > [A.sub.3] > [A.sub.5] > [A.sub.2] > [A.sub.1] and, obviously, [A.sub.4] is again the best alternative as we have seen earlier.

Now, we discuss a MCGDM problem adapted from Park et al. [27] concerning a manufacturing company, searching the finest international dealer for one of its main key parts used in assembling procedure.

Example 3 (see [27]). Suppose there are four potential international dealers (attributes) A = ([A.sub.3], [A.sub.2], [A.sub.3], [A.sub.4]) and these are evaluated with respect to five criteria: (1) [C.sub.1]. overall cost of the product; (2) [C.sub.2]: quality of the product; (3) [C.sub.3]: service performance of dealer; (4) [C.sub.4]: dealer's profile; (5) [C.sub.5]: risk factor. Let us assume that a group of four experts [d.sub.k] (k = 1,2, 3,4) is formed from each strategic decision area and they provide the following four decision matrices based on their judgements:

[mathematical expression not reproducible]. (19)

We follow the same methodology as discussed in Section 4.3 for solving the MCGDM problems by following the two steps as discussed.

Step 1. By using Definition 4, compute the aggregated matrix S of the decision matrices [R.sub.1], [R.sub.2], [R.sub.3], [R.sub.4] where S = [R.sub.1] [direct sum] [R.sub.2] [direct sum] [R.sub.3] [direct sum] [R.sub.4]. The aggregated matrix S is given as follows:

[mathematical expression not reproducible]. (20)

Step 2. By using the proposed entropy formula of IVIFSs (see Definition 15), the corresponding entropy values of all alternatives [A.sub.1], [A.sub.2], [A.sub.3], and [A.sub.4] can be obtained, respectively as [E.sub.1] = 0.1834, [E.sub.2] = 0.2810, [E.sub.3] = 0.0799, and [E.sub.4] = 0.4154.

Again with respect to the descending order of these entropy measures, the ranking order of the alternatives is [A.sub.3] > [A.sub.1] > [A.sub.2] > [A.sub.4]. We can see that the most desirable global supplier is [A.sub.3] and the results are in agreement with Park et al. [27].

Remark 4. If we find the aggregated matrix T of the decision matrices [R.sub.1], [R.sub.2], [R.sub.3], [R.sub.4], i.e., T = [R.sub.1] [cross product] [R.sub.2] [cross product] [R.sub.3] [cross product] [R.sub.4] By using Definition 4 and by using again the proposed entropy formula of IVIFSs (see Definition 15), the entropy values of each possible alternative [A.sub.1], [A.sub.2], [A.sub.3], and [A.sub.4] are calculated, respectively, as [E.sub.1] = 0.3630, [E.sub.2] = 0.2396, [E.sub.3] = 0.4154, and [E.sub.4] = 0.0799.

Again, by the descending order of the entropy values, the ranking of the four alternatives is [A.sub.4] > [A.sub.2] > [A.sub.1] > [A.sub.3]. We observe that the ranking order of the alternatives is reversed.

6. Conclusion

In this paper, we propose a new formula to compute the distance measure between IVIFSs. Based on the proposed distance measure, we further introduce a definition of entropy measure for IVIFS. The methodology proposed in this paper helps the DMs in providing their assessment about an alternative by considering the interval-valued intuitionistic fuzzy information in real-life applications. The effectiveness and applicability of the proposed approach is demonstrated by conducting a comparison analysis between the proposed entropy measure and different other entropy measures of IVIFSs. Finally, various practical MCDM and MCGDM problems are given to further validate the usefulness of the proposed method which can efficiently help the DMs at large. Future studies will now extend the methodology of investigating different entropy measures for linguistic decision environments, such as hesitant 2-tuple linguistic information model and intuitionistic 2-tuple linguistic information model.

Data Availability

All data generated or analyzed during this study are included in this manuscript.

https://doi.org/10.1155/2018/3637897

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

[1] L. A. Zadeh, "Fuzzy sets and systems," in Proc. Sympos. on SYStem Theory (New York, 1965), pp. 29-37, Polytechnic Press, Polytechnic Inst. Brooklyn, Brooklyn, N.Y., 1965.

[2] A. de Luca and S. Termini, "A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory," Information and Computation, vol. 20, pp. 301-312,1972.

[3] A. Kaufmann, Introduction to the Theory of Fuzzy Subsets, Academic Press, New York, NY, USA, 1975.

[4] M. Higashi and G. J. Klir, "On measures of fuzziness and fuzzy complements," International Journal of General Systems: Methodology, Applications, Education, vol. 8, no. 3, pp. 169-180, 1982.

[5] L. A. Zadeh, "Theory of approximate reasoning," in Machine intelligence, J. E. Hayes, D. Michie, and L. I. Mikulich, Eds., pp. 149-194, Ellis Horwood, Chichester, 1970.

[6] S. G. Loo, "Measures of fuzziness," Cybernetica, vol. 20, no. 3, pp. 201-210,1977

[7] X. C. Liu, "Entropy, distance measure and similarity measure of fuzzy sets and their relations," Fuzzy Sets and Systems, vol. 52, no. 3, pp. 305-318,1992.

[8] J.-S. Mi, Y. Leung, and W.-Z. Wu, "An uncertainty measure in partition-based fuzzy rough sets," International Journal of General Systems, vol. 34, no. 1, pp. 77-90, 2005.

[9] D. Bhandari and N. R. Pal, "Some new information measures for fuzzy sets," Information Sciences, vol. 67, no. 3, pp. 209-228, 1993.

[10] J.-L. Fan and Y.-L. Ma, "Some new fuzzy entropy formulas," Fuzzy Sets and Systems, vol. 128, no. 2, pp. 277-284, 2002.

[11] J. E. Shore and R. M. Gray, "Minimum Cross-Entropy Pattern Classification and Cluster Analysis," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, no. 1, pp. 11-17,1982.

[12] E. Szmidt and J. Kacprzyk, "Entropy for intuitionistic fuzzy sets," Fuzzy Sets and Systems, vol. 118, no. 3, pp. 467-477, 2001.

[13] I. K. Vlachos and G. D. Sergiadis, "Intuitionistic fuzzy information--applications to pattern recognition," Pattern Recognition Letters, vol. 28, no. 2, pp. 197-206, 2007.

[14] P Burillo and H. Bustince, "Entropy on intuitionistic fuzzy sets and on interval-valued fuzzy sets," Fuzzy Sets and Systems, vol. 78, no. 3, pp. 305-316,1996.

[15] W. Y. Zeng and H. X. Li, "Relationship between similarity measure and entropy of interval valued fuzzy sets," Fuzzy Sets and Systems, vol. 157, no. 11, pp. 1477-1484, 2006.

[16] H. Y. Zhang, W. X. Zhang, and C. L. Mei, "Entropy of interval-valued fuzzy sets based on distance and its relationship with similarity measure," Knowledge-Based Systems, vol. 22, no. 6, pp. 449-454, 2009.

[17] W. Zeng and P Guo, "Normalized distance, similarity measure, inclusion measure and entropy of interval-valued fuzzy sets and their relationship," Information Sciences, vol. 178, no. 5, pp. 1334-1342, 2008.

[18] W. Zeng and H. Li, "Inclusion measures, similarity measures, and the fuzziness of fuzzy sets and their relations," International Journal of Intelligent Systems, vol. 21, no. 6, pp. 639-653, 2006.

[19] J. Li, G. Deng, H. Li, and W. Zeng, "The relationship between similarity measure and entropy of intuitionistic fuzzy sets," Information Sciences, vol. 188, pp. 314-321, 2012.

[20] B. Farhadinia, "Information measures for hesitant fuzzy sets and interval-valued hesitant fuzzy sets," Information Sciences, vol. 240, no. 10, pp. 129-144, 2013.

[21] K. T. Atanassov, "Operators over interval valued intuitionistic fuzzy sets," Fuzzy Sets and Systems, vol. 64, no. 2, pp. 159-174, 1994.

[22] V. L. G. Nayagam, S. Muralikrishnan, and G. Sivaraman, "Multicriteria decision-making method based on interval-valued intuitionistic fuzzy sets," Expert Systems with Applications, vol. 38, no. 3, pp. 1464-1467, 2011.

[23] D. F. Li, "TOPSIS-based nonlinear-programming methodology for multiattribute decision making with interval-valued intuitionistic fuzzy sets," IEEE Transactions on Fuzzy Systems, vol. 18, no. 2, pp. 299-311, 2010.

[24] G. Wei and G. Lan, "Grey relational analysis method for interval-valued intuitionistic fuzzy multiple attribute decision making," in Proceedings of the 5th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD '08), pp. 291-295, Shandong, China, October 2008.

[25] Z. Wang, K. W. Li, and W. Wang, "An approach to multi-attribute decision making with interval-valued intuitionistic fuzzy assessments and incomplete weights," Information Sciences, vol. 179, no. 17, pp. 3026-3040, 2009.

[26] C.-Y. Wang and S.-M. Chen, "Multiple attribute decision making based on interval-valued intuitionistic fuzzy sets, linear programming methodology, and the extended TOPSIS method," Information Sciences, vol. 397-398, pp. 155-167, 2017.

[27] D. G. Park, Y. C. Kwun, and J. H. Park, "Correlation coefficient of interval-valued intuitionistic fuzzy sets and its application to multiple attribute group decision making problems," Mathematical and Computer Modelling, vol. 50, no. 9-10, pp. 12791293, 2009.

[28] Z. S. Xu, "A method based on distance measure for interval-valued intuitionistic fuzzy group decision making," Information Sciences, vol. 180, no. 1, pp. 181-190, 2010.

[29] B. Huang, D.-K. Wei, H.-X. Li, and Y.-L. Zhuang, "Using a rough set model to extract rules in dominance-based interval-valued intuitionistic fuzzy information systems," Information Sciences, vol. 221, pp. 215-229, 2013.

[30] X.-D. Liu, S.-H. Zheng, and F.-L. Xiong, "Entropy and subsethood for general interval-valued intuitionistic fuzzy sets," in Proceedings of the Second International Confernce on Fuzzy Systems and Knowledge Discovery, FSKD 2005, pp. 42-52, China, August 2005.

[31] Q. Zhang, S. Jiang, B. Jia, and S. Luo, "Some information measures for interval-valued intuitionistic fuzzy sets," Information Sciences, vol. 180, no. 24, pp. 5130-5145, 2010.

[32] Q. Zhang and S. Jiang, "Relationships between entropy and similarity measure of interval-valued intuitionistic fuzzy sets," International Journal of Intelligent Systems, vol. 25, pp. 1121-1140, 2010.

[33] Y. J. Zhang, P. J. Ma, X. H. Su, and C. P. Zhang, "Entropy on interval-valued intuitionistic fuzzy sets and its application in multi-attribute decision making," in Proceedings of the 14th International Conference on Information Fusion, Fusion 2011, USA, July 2011.

[34] C. Wei, P. Wang, and Y. Zhang, "Entropy, similarity measure of interval-valued intuitionistic fuzzy sets and their applications," Information Sciences, vol. 181, no. 19, pp. 4273-4286, 2011.

[35] J. Ye, "Multicriteria fuzzy decision-making method using entropy weights-based correlation coefficients of interval-valued intuitionistic fuzzy sets," Applied Mathematical Modelling, vol. 34, no. 12, pp. 3864-3870, 2010.

[36] Q. Zhang, H. Xing, F. Liu, J. Ye, and P. Tang, "Some new entropy measures for interval-valued intuitionistic fuzzy sets based on distances and their relationships with similarity and inclusion measures," Information Sciences, vol. 283, pp. 55-69, 2014.

[37] S. Pramanik, S. Dalapati, S. Alam, F. Smarandache, and T. Roy, "NS-Cross Entropy-Based MAGDM under Single-Valued Neutrosophic Set Environment," Information, vol. 9, no. 2, p. 37, 2018.

[38] S. Dalapati, S. Pramanik, S. Alam, F. Smarandache, and T. K. Roy, "IN-cross entropy based MAGDM strategy under interval neutrosophic set environment," Neutrosophic Sets and Systems, vol. 18, p. 4357, 2017.

[39] S. Pramanik, P. Biswas, and B. C. Giri, "Hybrid vector similarity measures and their applications to multi-attribute decision making under neutrosophic environment," Neural Computing and Applications, vol. 28, no. 5, pp. 1163-1176, 2017

[40] V Ulucay, I. Deli, and M. Sahin, "Similarity measures of bipolar neutrosophic sets and their application to multiple criteria decision making," Neural Computing and Applications, vol. 29, no. 3, pp. 739-748, 2018.

[41] S. Pramanik, P. Dey, F. Smarandache, and J. Ye, "Cross Entropy Measures of Bipolar and Interval Bipolar Neutrosophic Sets and Their Application for Multi-Attribute Decision-Making," Axioms, vol. 7, no. 2, p. 21, 2018.

[42] Z. Xu, "Intuitionistic preference relations and their application in group decision making," Information Sciences, vol. 177, no. 11, pp. 2363-2379, 2007.

[43] Z.-S. Xu, "Methods for aggregating interval-valued intuitionistic fuzzy information and their application to decision making," Control and Decision, vol. 22, no. 2, pp. 215-219,2007 (Chinese).

[44] P. Grzegorzewski, "Distances between intuitionistic fuzzy sets and/or interval-valued fuzzy sets based on the Hausdorff metric," Fuzzy Sets and Systems, vol. 148, no. 2, pp. 319-328, 2004.

[45] J. H. Park, K. M. Lim, J. S. Park, and Y. C. Kwun, "Distances between interval-valued intuitionistic fuzzy sets," Journal of Physics: Conference Series, vol. 96, no. 1, Article ID 012089,2008.

[46] W. L. Hung and M. S. Yang, "Fuzzy entropy on intuitionistic fuzzy sets," International Journal of Intelligent Systems, vol. 21, no. 4, pp. 443-451, 2006.

[47] S. K. De, R. Biswas, and A. R. Roy, "Some operations on intuitionistic fuzzy sets," Fuzzy Sets and Systems, vol. 114, no. 3, pp. 477-484, 2000.

Tabasam Rashid (iD), Shahzad Faizi, and Sohail Zafar

Department of Mathematics, University of Management and Technology, Lahore 54770, Pakistan

Correspondence should be addressed to Tabasam Rashid; tabasam.rashid@gmail.com

Received 9 May 2018; Accepted 1 July 2018; Published 17 July 2018

Academic Editor: Katsuhiro Honda

Table 1: Comparison of the proposed entropy measure with existing entropy measures of IVIFSs. IVIFS [E.sub.FZ] [E.sub.1] [E.sub.2] [E.sub.3] A 0.3657 0.2825 0.3601 0.2936 [A.sup.1/2] 0.4000 0.3203 0.4100 0.3200 [A.sup.2] 0.3320 0.2726 0.3390 0.2360 [A.sup.3] 0.3000 0.2250 0.2941 0.1876 [A.sup.4] 0.2224 0.1911 0.2519 0.1792 IVIFS [E.sub.4] [E.sub.5] [E.sub.6] [E.sub.L] A 0.2980 0.3290 0.2422 0.2904 [A.sup.1/2] 0.3000 0.3550 0.2624 0.3294 [A.sup.2] 0.2260 0.2825 0.1999 0.2886 [A.sup.3] 0.1982 0.2461 0.1579 0.27 [A.sup.4] 0.1572 0.2045 0.1372 0.2416 IVIFS [E.sub.ZJ] [E.sub.W,[lambda]=0.5] [E.sub.ZM] A 0.2939 0.3239 0.1139 [A.sup.1/2] 0.2819 0.3365 0.1547 [A.sup.2] 0.2103 0.2717 0.1771 [A.sup.3] 0.2102 0.2662 0.0592 [A.sup.4] 0.1517 0.2217 0.194 IVIFS [E.sub.Y] A 0.5009 [A.sup.1/2] 0.5651 [A.sup.2] 0.5095 [A.sup.3] 0.4514 [A.sup.4] 0.4099

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Rashid, Tabasam; Faizi, Shahzad; Zafar, Sohail |

Publication: | Advances in Fuzzy Systems |

Date: | Jan 1, 2018 |

Words: | 7958 |

Previous Article: | Search of Fuzzy Periods in the Works of Poetry of Different Authors. |

Next Article: | A Hybrid Approach to Call Admission Control in 5G Networks. |

Topics: |