Skip to main content

A Novel Generalized Simplified Neutrosophic Number Einstein Aggregation Operator

Page 1

IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________

A Novel Generalized Simplified Neutrosophic Number Einstein Aggregation Operator Baolin Li, Juanru Wang*, Lihua Yang, and Xuetao Li  Abstract—In order to handle the indeterminate information and inconsistent information in some complex decision-making environment, some novel aggregation operators are firstly proposed based on Einstein operational laws and generalized aggregation operators under simplified neutrosophic environment, where the truth-membership degree, indeterminacy-membership degree and falsity-membership degree of each element are singleton subsets in [0,1] . Firstly, to avoid some impractical operations in certain cases, some new operational laws of simplified neutrosophic numbers (S NNs) based on Einstein operations are defined. Then, Einstein operations and generalized weighted average operator are combined in order to make use the advantages of them, and a novel generalized simplified neutrosophic number Einstein weighted aggregation (GS NNEWA) operator is proposed, and some desirable properties of the new operator are also analyzed. Furthermore, some special cases of the proposed operator are also discussed. Finally, to solve multi-criteria decision-making (MCDM) problems, an illustrative example on the basis of the GS NNEWA operator proposed and similarity measures based on Hamming distance is shown to verify the effectiveness and practicality of the proposed method. Index Terms—multi-criteria decision-making, Einstein, generalized aggregation operator, simplified neutrosophic sets

I. INTRODUCTION Although the theories of fuzzy set have been generalized, it cannot handle all kinds of uncertainties in real life. Therefore, as a generalization of the fuzzy set [1], intuitionistic fuzzy set [2], and hesitant fuzzy set [7], neutrosophic set (NS) [9] has Manuscript received August 18, 2017; revised November 21, 2017. T his work is supported by the National Natural Science Foundation of China under Grant No. 71371154, the Humanities and Social Sciences Research Project of Ministry of Education of China under Grant No. 16YJCZH049, the T hinking Bank Project of Hubei under Grant No. HBSXK2017055, and the Humanities and social Sciences foundation of Department of Education of Hubei under Grant No. 17Q121. Baolin Li is with School of Management , Northwestern Polytechnical University, Xi’an 710072, P.R.China. He is also with School of Economics and Management, Hubei University of Automotive T echnology, Shiyan 442002, P.R.China. Juanru Wang (Corresponding author) is with School of Management , Northwestern Polytechnical University, Xi’an 710072, P.R.China (E-mail: wjuanru2017@163.com, wjuanru@nwpu.edu.cn). Lihua Yang and Xuetao Li are with School of Economics and Management, Hubei University of Automotive T echnology, Shiyan 442002, P.R.China.

attracted wide attentions owing to it can deal with not only the incomplete information but also the indeterminate information and inconsistent information. True-membership, indeterminacy-membership and false-membership in neutrosophic set are completely independent, whereas the uncertainty is dependent on the true-membership and false-membership in intuitionistic fuzzy set. To date, some research achievements about NS have been made. One hand, different kinds of NS is developed with specific description in order to apply NS in the real application. A single-valued neutrosophic set (SVNS) and some properties were proposed [10] and analyzed. Ye [11] defined the concept of simplified neutrosophic sets (SNSs), and introduced a MCDM method using a simplified neutrosophic weighted arithmetic average operator and a simplified neutrosophic weighted geometric average operator. Wang [12] introduced the definition of interval neutrosophic set (INS) and discussed operators of INS. Peng [13] defined multi-valued NSs, and applied the power aggregation operators to solve MCGDM problems. Liu [14] proposed the concept of interval neutrosophic hesitant fuzzy set, and presented the operations and developed generalized hybrid weighted aggregation operators. On the other hand, the correlation coefficient, similarity measure and entropy of NS are developed. Ye [15] introduced the correlation coefficient and weighted correlation coefficient of SVNS. Majumdar [16]defined similarity measures between two SVNSs and investigated entropy of SVNSs. Ye[17] proposed the cross-entropy of SVNSs. Ye [18]defined distances between INSs , and proposed the similarity measures between INSs based on the relationship between similarity measures and distances . Wang [28] proposed some new distance measures for dual hesitant fuzzy sets, and study the properties of the measures . The information aggregation operators are very important to process the fuzzy decis ion-making problems in different fields. Yager [19] and Xu [20] defined weighted arithmetic average operator and weighted geometric average operator. Zhao [21]developed generalized aggregation operators for IFS. Wang and Liu [22] proposed intuitionistic fuzzy geometric aggregation operators based on Einstein operations. Liu [23] proposed some Hamacher aggregation operators for the interval-valued intuitionistic fuzzy numbers. Furthermore, some information aggregation operators for NS are also discussed. Liu [23] proposed a multiple attribute decision-making method based on single-valued neutrosophic normalized weighted Bonferroni mean. Zhang [25] defined the operations for INSs, and developed two interval neutrosophic number aggregation operators. Yang [26]

(Advance online publication: 10 February 2018)


IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________ proposed a multi-criteria decision-making method using power aggregation operators for single-valued neutrosophic sets. However, the operations of SNNs provided by Ye [11] may be irrational in some situations, in order to avoid this shortcoming, the neutrosophic number aggregation operators based on the Einstein t-norm and t-conorm operational rules in the context of simplified neutrosophic environment are proposed in this paper. Meanwhile, the generalized aggregation operator has become the focus of research because it can be reduced to arithmetric, geometric and harmonic aggregation operators. However, until to now, there is no research about generalized neutrosophic number aggregation operators based on Einstein operations under simplified neutrosophic environment. Therefore, the aim of the paper is to combine Einstein operations and generalized aggregation operators to SNNS, and then propose the novel GSNNEWA aggregation operator, Where the simplified neutrosophic number Einstein weighted average (SNNEWA) operator, the simplified neutrosophic number Einstein weighted geometric average (SNNEWGA) operator, and the simplified neutrosophic number Einstein weighted harmonic average (SNNEWHA) operator are special cases of the GSNNEWA operator proposed. The remainder of this paper is organized as follows. In section Ⅱ, some novel operational laws of SNNS based on Einstein operations are defined. In section Ⅲ, generalized simplified neutrosophic number Einstein weighted aggregation (GSNNEWA) operator is proposed, and some desirable properties are analyzed. Moreover, some special cases of the proposed operator are also discussed in section Ⅲ. The new method for multi-criteria decision making based on the proposed operator is presented and an illustrative example is shown in section Ⅳ. Finally, the main conclusions of this paper are summarized in Section Ⅴ. II. NOVEL OPERAT IONS BASED ON EINST EIN by TA ( x) , I A (x) and FA (x) , which

A NS A in X is characterized are singleton subintervals /subsets in the real standard [0,1] , that is TA ( x) : X  [0,1] , I A ( x) : X  [0,1] , and FA ( x) : X  [0,1] . Then, a simplification of A is denoted by [11]:

A   x, TA ( x), I A ( x), FA ( x) x  X  ,

For convenience, we will use the SNS where TA (x) , I A (x) and FA (x) are single values in the real standard [0,1] rather than subintervals /subsets in the real standard [0,1] . Therefore, each SNS can be represented by three real numbers in [0,1] .we can adapt A  TA ( x), I A ( x), FA ( x)  to represent an element in SNS. In particular, if X has only one element, and call it a simplified neutrosophic number (SNN). The set of all SNNs is represented as SNNS. Let A  (T1 , I1 , F1 ) and B  (T2 , I 2 , F2 ) be two SNSs, then operational relations are defined as follows [11]: (1) A  B  T1  T2  T1T2 , I1  I 2  I1I 2 , F1  F2  F1F2  (2) A  B  T1T2 , I1I 2 , F1F2     (3) A  1  (1  T1 ) ,1  (1  I1 ) ,1  (1  F1 ) 

 0

(4) A  T1 , I1 , F1    0 However, in some situations, there are some limitations in definition above. Theoretically, the sum of any element and the maximum element is equal to the maximum value, and the multiple of any number and the minimum number is equal to the any one. But this may be incorrect in some cases. For instance, Let A  0.6,0.5,0.5  and B  1,0,0  be two SNSs. Obviously, B  (1,0,0) is the larger value of these SNSs. However, according to operations A  B  1,0.5,0.5  B above, , similarly, A  0.6,0.5,0.5  is the smaller value of these SNSs. However, according to operations above, A  B  0.6,0,0  A .Thus, the operations defined above are irrational. Therefore, some novel operations are proposed in this paper. The t-norm and t-conorm play an important role in the building process of operation rules and aggregation operators. A strict Archimedean t-norm and a strict Archimedean t-conorm can be represented as 1 T ( x, y )  k 1 (k ( x)  k ( y )) S ( x, y )  l (l ( x)  l ( y )) and , where l (t )  k (1  t ) . Einstein t-norm and t-conorm are as follows T ( x, y) 

xy x y S ( x, y )  1  (1  x)(1  y) , 1  xy

Here, k (t )  log

2 2  (1  t ) 1 2  t k 1 (t )  log 2 l (t )  1  t l (t )  log e 1 . et  1 , 1 t , t ,

Then, some novel operational rules of SNNs based on Einstein operations are defined. Let A  (T1 , I1 , F1 ) and B  (T2 , I 2 , F2 ) be two SNSs, then the new operational relations based on Einstein operations are defined as follows: T T

II

FF

1 2 1 2 1 2 (1) A  B  1  T T , 1  (1  I )(1  I ) , 1  (1  F )(1  F )  1 2 1 2 1 2

I I

TT

F F

1 2 1 2 1 2 (2) A  B  1  (1  T )(1  T ) , 1  I I , 1  F F  1 2 1 2 1 2

(1  T1 )   (1  T1 ) 

2( I1 )  2( F1 )  ,      )  ( I ) ( 2  F 1 1 1 )  ( F1 )

(3) A  (1  T )   (1  T )  , (2  I 1

(4) A



1

2(T1 ) (1  I1 )  (1  I1 ) (1  F1 )  (1  F1 ) , ,  (2  T1 )   (T1 )  (1  I1 )   (1  I1 )  (1  F1 )   (1  F1 ) 

 0

 0

Take into account the aforementioned example again. When applying new operational laws, A  B  1,0,0  B , A  B  0.6,0.5,0.5  A ,and these results coincide with the theory. Therefore, the new operational relations above based on Einstein operations can avoid irrational result in certain cases. The novel operations proposed in this paper is better than the operations in literature [11]. Subsequently, the novel operation laws proposed will be used to establish new aggregation operators. III. GENERALIZED SIMPLIFIED NEUT ROSOPHIC NUMBER EINST EIN W EIGHT ED A GGREGAT ION OPERAT ORS In this section, some generalized simplified neutrosophic number Einstein aggregation operators are developed, and some properties are discussed.

(Advance online publication: 10 February 2018)


IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________ 2(T1 ) 2(T1 )  ) w1  (1  ) w1   (2  T1 )  (T1 ) (2  T1 )  (T1 )  , 2(T1 ) 2(T1 )  w1 w1 (1  )  (1  ) (2  T1 )  (T1 )  (2  T1 )   (T1 ) 

A. GSNNEWA operator Considering advantages of generalized weighted average (GWA) operator [27], we extend it to simplified neutrosophic environment. Let Aj  Tj , I j , Fj  j  1, 2, , n  be a collection of SNNs, and w  ( w1 , w2 ,, wn ) be the weight vector of Aj  j  1,2,, n , n

w j  1 .The generalized simplified satisfying w j  0 and  j 1

neutrosophic number Einstein weighted average (GSNNEWA) operator of dimension n is the mapping GSNNEWA: SNN n  SNN , then the GSNNEWA operator is defined as n

1

GSNNEWA ( A1 , A2 ,, An )  ( w j Aj )  

j 1

For a SNNs Aj  j  1,2,, n , we have the following result. GSNNEWA( A1 , A2 , , An ) n

2( u j j   v j j )  w

j 1

n

w

j 1

1

n

n

1

n

( u j j  3 v j j )   ( u j j   v j j )  w

j 1

n

w

j 1

n

w

j 1

1

n

w

j 1

j 1

n

n

w

1

w

w

j 1

j 1

n

n

( t j j 3 x j j )  ( t j j  x j j ) w

j 1 n

w

j 1 n

w

j 1

1

n

w

j 1

j 1

n

n

w

w

1

1

n

j 1

j 1

n

n

j 1

j 1

w

j 1

w

((2  T1 )  3(T1 )  ) w1  ((2  T1 )   (T1 )  ) w1 , ((2  T1 )  3(T1 )  ) w1  ((2  T1 )   (T1 )  ) w1

2((1  I1 )  (1  I1 ) ) w1 , ((1  I1 )  3(1  I1 )  ) w1  ((1  I1 )   (1  I1 )  ) w1

w

w

Thus, w1 A1  w2 A2

,

( y j j 3 z j j )  ( y j j  z j j ) w

(1)

1

j 1

w

(1  F1 )  (1  F1 )  w1 ) (1  F1 )  (1  F1 ) (1  F1 )  (1  F1 ) w1 (1  F1 )   (1  F1 )  w1 (2  ) ( ) (1  F1 )  (1  F1 ) (1  F1 )   (1  F1 )  2(

w

( y j j 3 z j j )  ( y j j  z j j ) 

(1  I1 )  (1  I1 )  w1 ) (1  I1 )  (1  I1 ) ,   (1  I1 )  (1  I1 ) w1 (1  I1 )   (1  I1 )  w1 (2  )  ( ) (1  I1 )  (1  I1 ) (1  I1 )  (1  I1 ) 2(

2((1  F1 )  (1  F1 ) ) w1 ((1  F1 )  3(1  F1 )  ) w1  ((1  F1 )   (1  F1 )  ) w1

,

j 1

n

( t j j 3 x j j )  ( t j j  x j j ) 

w1 A1 

1

n

(1 

1

1

j 1

Where u j  (2  T j )  3(T j ) , v j  (2  T j )   (T j )  ,

t j  (1  I j )  3(1  I j ) , x j  (1  I j )   (1  I j )  , y j  (1  Fj )  3(1  Fj ) , z j  (1  Fj )  (1  Fj )  , Then the aggregated result using the GSNNEWA operator is still a SNN. Proof. The proof can be done by using the mathematical induction. 1) When n=2, then 2(T1 ) (1  I1 )  (1  I1 ) (1  F1 )  (1  F1 ) A1  , ,   (2  T1 )  (T1 ) (1  I1 )  (1  I1 ) (1  F1 )  (1  F1 )

(u1w1  v1w1 ) (u2w2  v2w2 ) 2 x1w1 2 x2w2   (u1w1  v1w1 ) (u2w2  v2w2 ) t1w1  x1w1 t2w2  x2w2  , , w1 w1 w2 w2 (u  v ) (u  v ) 2 x w1 2 x w2 1  1w1 1w1  2w2 2w2 1  (1  w1 1 w1 )(1  w2 2 w2 ) (2) (u1  v1 ) (u2  v2 ) t1  x1 t2  x2 2 z1w1 2 z w2  w2 2 w2 w1 y  z1 y2  z2 2 z w1 2 z w2 1  (1  w1 1 w1 )(1  w2 2 w2 ) y1  z1 y2  z 2 w1 1

u1w1 u2w2  v1w1 v2w2 2 x1w1 x2w2 2 z1w1 z2w2 , , u1w1 u2w2  v1w1 v2w2 t1w1 t2w2  x1w1 x2w2 y1w1 y2w2  z1w1 z2w2

2) When n=k, we get w1 A1  w2 A2  k

k

 wk Ak

u

wj j

 vj j

u

wj j

 v

j 1 k

j 1

j 1 k

j 1

k

, wj j

k

2 x j j

w

j 1

k

t j 1

3) When n=k+1, we can get

(Advance online publication: 10 February 2018)

wj j

k

x j 1

(3)

2 z j j

w

, wj j

w

j 1

k

y j 1

wj j

k

 zj j j 1

w


IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________ k

w j 1

j

of Aj  j  1,2,, n , then

Aj  wk 1 Ak1 k

k

w

j 1 k

u j 1

 v j 1

k

1

w

j 1 k

wj j

u

wj j

u

wj j

j 1 k

j 1

k

w

t j 1

j

x j 1

k

k

j

j 1

2 z j j w

j 1

k

y j 1

k

 zj j

wj j

j 1

k

2 z j j

1  (1 

k

y j 1

k 1

k

z

wj j

j 1

k 1

u

wj j

 vj j

u

wj j

 vj j

j 1 k 1

w

j 1

j 1

k 1

k 1

2 x j j

w

j 1 k 1

2 zkwk11 ) ykwk11  zkwk11

)(1  wj j

,

w

j 1

k 1

k 1

j 1

w

j 1

,

  xj j

wj j

k 1

y

w

j 1

j 1

wj j

k 1

2( 

k

(2 

u

wj j

 vj j

k

SNNEWA( A1 , A2 ,

j 1

w

j 1

k

1

)  (

w

wj j

 vj j

u

wj j

 vj j

k

n

 yj j   zj j n

w

n

w

n

( y j 1 n

( y j 1

wj j

wj j

w

j 1

n

n

3 z )  ( y j 1 n

wj j

j 1

1

n

3 z )  ( y j 1

wj j

w

j 1

1

j 1

w

1

j 1

k

t j 1

wj j

k

  xj j

wj

)

uj 

1

wj j

 z )

wj j

 z j j )

j 1 n

wj j

w

w

j 1 n

w

j 1

j 1

n

n

1

w

j 1

n

wj j

n

1

n

3 x )  ( t j 1

w

j 1

n

wj j

j 1

w

j 1

wj j

n

 x ) j 1

wj j

1

1

,

1

1

j 1

The proof is completed, and the novel GSNNEWA operator is calculated.

4  2 Fj (1  Fj )(1  Fj )

We can easily prove that the GSNNEWA operator has the following properties. 1) Idempotency: Let Aj  TA , I A , FA  j  1,2,, n be a j

j

j

collection of SNNs, and A  TA , I A , FA be a SNN. If Aj  A

 j  1,2,, n , then GSNNEWA(A ,A , ,A )  A . 1

n

2

2) Commutativity: Let Aj  TA , I A , FA  j  1,2,, n be a  collection of SVNNs, if Aj  j  1,2,, n is any permutation j

j

j

 (3  T )

wj

j

j 1 n

 (3  T )

,

n

 (2  I j 1

wj

,t j 

(2  T j )T j

n

) j Ij j w

j

w

j 1

,

wj

j 1

n

 (2  F )

n

  Fj

wj

j

j 1

4  2I j (1  I j )(1  I j )

2 Fj

, zj 

(1  Fj )(1  Fj )

wj

j 1

, xj 

2 I j (1  I j )(1  I j )

,

j 1 n

  (T j  1)

n

2 ( I j )

wj

, wj

j 1

n

2 ( Fj )

wj

j 1

n

 (2  I j 1

n

) j   ( I j ) w

j

, wj

j 1

wj

j 1

n

 (2  F )

wj

j

j 1

n

  ( Fj ) j 1

3) if   0 ,then the GSNNEWA operator will be reduced to the simplified neutrosophic number Einstein weighted geometric average(SNNEWGA) operator which is defined as follows: SNNEWGA( A1 , A2 , n

2 T j 1

n

 (2  T ) j 1

j

wj

,

, An ) n

 3 (T j  1)

j

j 1

B. Properties of GSNNEWA operator

n

2 Fj

w

j 1

2T j  2

,vj 

(2  T j )T j

n

n

n

wj

SNNEWHA( A1 , A2 ,

( t j j 3 x j j )  ( t j j  x j j ) ,

  (1  T j )

n

2 I j j

j 1

6  2T j

w

j 1

wj

2) If   1 , then the GSNNEWA operator will be reduced to the simplified neutrosophic number Einstein weighted harmonic average(SNNEWHA) operator which is defined as follows:

yj 

( u j j  3 v j j )   ( u j j   v j j )  ( t j 1

)   (1 

w

j 1

,

2 x j j

1

  xj j

w

j 1

k

w

k

  xj j

wj j

)

w

n

j 1

j 1

j 1

1

n

t

)

w

1

n

w

wj j

1

1

k

 yj j   zj j j 1

j 1

, An ')

  (1  T j ) j 1 n

j

j 1

w

k

)

2( u j j   v j j ) 

k

j 1

k

w

j 1

j 1

w

j 1

j 1

t

)   (1 

j 1

 (1  T )

j 1 n

j 1

k

w

  xj j

2 x j j

1

)  (1 

1

w

2 z j j

)   (1 

, An )  GSNNEWA( A1 ', A2 ',

, An ) n

j

1

k

w

j 1

1

k

wj j

k

k

w

 yj j  zj j

w

j 1

 (1  T )

wj

w

k

2 z j j

t j 1

,

j 1

j 1

)   (1 

w

k

2 x j j

w

j 1

w

j 1 k

2 z j j

j 1

j 1

j 1 k

j 1

1

k

k

u

k

j 1

w

(1 

)

 vj j

j 1

 yj j   zj j k

1

k

2 x j j

w

j 1 k

w

w

k

 vj j

w

j 1 k

2 z j j

k

wj j

 vj j

j 1

(1 

j 1 k

wj j

j 1 k

k

k

u

wj j

u j 1

(1 

j 1 k

be two

w

, An ) k

u

and Aj '  TAj ' , I Aj ' , FAj '

j

SNNEWA operator is defined as follows:

(4)

 zj j

Therefore, considering these results, we can get Equation (1) holds for any n. 4) Finally, we can get GSNNEWA( A1 , A2 ,

j

u j  2  2Tj , v j  2  2Tj , t j  4  2I j , x j  2I j , y j  4  2Fj , z j  2Fj ,

2 z j j

w

j 1

t

Some special operators based on the different parameter  of GSNNEWA operator will be discussed in the following. 1) If   1 , then the GSNNEWA operator will be reduced to the simplified neutrosophic number Einstein weighted average (SNNEWA) operator. Thus,

wk 1 k 1

w

C. Special cases

2 zkwk11 y  zkwk11

, then 

GSNNEWA( A1 , A2 ,

j 1

k

j

collections of SNNs, if Aj  Aj ' for all j  1,2, ,n  ,then

2 x wk 1 )(1  wk 1 k 1 wk 1 ) tk 1  xk 1

w

j

Let Aj  TA ,I A ,FA

k

j,

4) Monotonicity:

w

  xj j

wj j

all  FA j  FA _

GSNNEWA(A ,A2 , ,An )  GSNNEWA(A1,A2 , ,An )  GSNNEWA(A1 ,A2 , ,An )

2x tkwk11  x

 wj j

j

j

 1

wk 1 k 1 wk 1 k 1

j 1

t

j

SNNs. If for TA   TA j  TA  , I A j   I A j  I A j _ ,and FA

w

2 x j j

1  (1 

j

j 1

k

 j  1,2,, n ,

TA j , I A j , FA j

 and A j  TA , I A , FA  j  1,2,, n  be three collections of

(u wk 1  vkwk11 )  kwk 11 (uk 1  vkwk11 )

 vj j

Boundedness:

 j  1,2,, n  , Aj 

Let A j  TA j  , I A j  , FA j 

w

j 1 k

j 1

wj j

3) ,

 vj j

k

k

(ukwk11  vkwk11 ) (ukwk11  vkwk11 )

wj j

2 x j j

GSNNEWA(A1,A2 , ,An )  GSNNEWA(A1 ,A2 , ,An ).

uj j  vj j

, An ) n

wj j n

  Tj j 1

wj

,

n

 (1  I

) j   (1  I j )

wj

j

 (1  I

) j   (1  I j )

wj

j

j 1 n

j 1

w

w

j 1 n

j 1

n

,

 (1  F )

wj

 (1  F )

wj

j 1 n

j 1

j

j

n

  (1  Fj )

wj

  (1  Fj )

wj

j 1 n

j 1

From the above discussion, we can easily know that GSNNEWA operator is more generalized. IV. A N ILLUST RAT IVE EXAMP LE In this section, we will use the GSNNEWA operator to deal with the multi-criteria decision-making problems under the simplified neutrosophic environment, where the

(Advance online publication: 10 February 2018)

wj


IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________ alternative values are in the form of SNNs and the criteria weights are in the form of crisp values. Let x  (T , I , F ) be a SNN, and the cosine similarity measure S (x) between SNN x and the ideal alternative (1,0,0) can be defined as follows [15]: T T2  I2  F2

However, the cosine similarity measure for SVNNs might be unacceptable. For example, let a1  0.3,0,0  and a2  0.7,0,0  be two alternatives, and the ideal alternative is a *  1,0,0  .According to the calculated formula of similarity measure

under

simplified neutrosophic environment, S1 (a1 , a )  S 2 (a2 , a * )  1 can be obtained. However, it *

cannot indicate which alternative is better. In fact, it is clear that

a2 is

n

A. Hamming distance measure

S ( x) 

SNNEWGA( A1 , A2 ,

superior to a1 .Therefore, we introduce Hamming

distance to rank alternatives instead of cosine similarity measure. Let x  (T1 , I1 , F1 ) and y  (T2 , I 2 , F2 ) be any two SVNNs, then the Hamming distance between x and y can be defined as follows: d ( x, y )  T1  T2  I1  I 2  F1  F2

We know that the Hamming distance can solve the problem in the literature [15]. Let us consider the same example above, according to the calculated formula of Hamming distance, D 1(a1 ,a * )  0.7,D 2(a2 ,a * )  0.3 can be obtained, which indicate a1 is inferior to a2 . B. An example Next, we will consider the same decision-making problem adapted from Ye [11]. The example is about an investment company with four possible alternatives based on three criteria. A1 , A2 , A3 and A4 are four alternatives, where A1 is a car company, A2 is a food company, A3 is a computer company, A3 is an arms company. C1 , C2 and C3 are corresponding criteria, where C1 represents the risk analysis, C2 represents the growth analysis, C3 represents the environmental impact analysis. The weight vector of the criteria is W  (0.35,0.25,0.4) . The simplified netrosophic decision matrix is shown in the following forms:  0.4,0.2,0.3 0.4,0.2,0.3 0.2,0.2,0.5    0 . 6 , 0 . 1 , 0 . 2 0 . 6 , 0 . 1 , 0 . 2 0.5,0.2,0.2  D  0.3,0.2,0.3 0.5,0.2,0.3 0.5,0.3,0.2    0 . 7 , 0 . 0 , 0 . 1 0 . 6 , 0 . 1 , 0 . 2 0 .4,0.3,0.2   To get the best alternative, the following steps are involved: Step1: Utilize the GSNNEWA operator to calculate the comprehensive evaluation value of each alternative. For simplicity, suppose   0 , then the GSNNEWA operator will be reduced to the simplified neutrosophic number Einstein weighted geometric average (SNNEWGA) operator.

2 T j 1

n

 (2  T ) j 1

j

wj

, An ) n

wj j n

  Tj j 1

wj

,

n

 (1  I

) j   (1  I j )

wj

j

 (1  I

) j   (1  I j )

wj

j

j 1 n

j 1

w

w

j 1 n

n

,

j 1

 (1  F )

wj

 (1  F )

wj

j 1 n

j 1

j

j

n

  (1  Fj )

wj

  (1  Fj )

wj

j 1 n

j 1

Thus, the comprehensive evaluation value of each alternative can be obtained by the above formula. Therefore, we can get 1  0.3062,0.2,0.3846 ;  2  0.5586,0.1404,0.2 ;  3  0.4212, 0.2406, 0.2606 ;  4  0.5446,0.1478,0.1654

Step2:

Calculate

Hamming distance measure evaluate the similarity of each alternative and the ideal alternative. The ideal alternative is * defined as   1,0,0 , as we all known, the smaller the distance value is, the bigger the similarity is, and the better the alternative is. S (i ,  * )(i  1, 2,3, 4) to

D1(1, * )  1.2784, D1( 2 , * )  0.7818,

D1(3 , * )  1.08, D1(4 , * )  0.7686,

Step3: Give the ranking order of all alternatives based on the obtained distance values. We can get the ranking order of four alternatives. That is A4 A2 A3 A1 Step4: Get the best alternative and the worst alternative. The best alternative is A4 , and the worst alternative is A1 . V. CONCLUSION In the real world, the indeterminate information and inconsistent information existing commonly cannot be deal with by FSs [29, 30] and IFSs. The simplified neutrosophic set is an extension of traditional fuzzy set, which is more suitable for real scientific and engineering application. In a word, firstly, we proposed some novel operational relations based on Einstein operations which can avoid the disadvantages of some irrational operations, and we extend generalized aggregation operators to accommodate the simplified neutrosophic set. Secondly, we combine Einstein operations and generalized aggregation operators under simplified neutrosophic environment in order to make use of their advantages. Thirdly, the novel GSNNEWA operator is firstly proposed, some desirable properties and some special cases of the proposed operator are also analyzed. Finally, an illustrative example on the basis of the GSNNEWA operator utilizing Hamming distance measure was presented in order to demonstrate the effectiveness and application of the proposed method. In this paper, there are the same ranking results when we compare the proposed method with the method presented in the literature [11]. However, the GSNNEWA operator proposed in this paper can avoid some irrational operations, which is more general and more flexible, which is the extension of aggregation operator proposed by Ye [11]. Meanwhile, we use the Hamming distance instead of the cosine similarity measure in [15], the Hamming distance measure can avoid some unacceptable situations. Therefore, the example shows that the novel aggregation operator proposed in the paper is more effectiveness and practicality. In the future, we will study some new aggregation operators under simplified neutrosophic environments, and give the

(Advance online publication: 10 February 2018)


IAENG International Journal of Applied Mathematics, 48:1, IJAM_48_1_10 ______________________________________________________________________________________ application of the proposed operator to the other fields. REFERENCES [1] L. A. Zadeh, “ Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338-353, 1965. [2] K. T . Atanassov, “ Intuitionistic fuzzy sets,” Fuzzy Sets and Systems, vol. 20, no. 1, pp. 87-96, 1986. [3] K. T . Atanassov, “ T wo theorems for intuitionistic fuzzy sets,” Fuzzy Sets and Systems, vol. 110, no. 2, pp. 267-269, 2000. [4] Z. Pei and L. Zheng, “ A novel approach to multi-attribute decision making based on intuitionistic fuzzy sets,” Expert Systems with Applications, vol. 39, no. 3, pp. 2560-2566, 2012. [5] S. Zeng and W. Su, “ Intuitionistic fuzzy ordered weighted distance operator,” Knowledge-Based Systems, vol. 24, no. 8, pp.1224-1232, 2011. [6] Z. S. Xu, “ Intuitionistic fuzzy multiattribute decision making: an interactive method,” IEEE Transactions on Fuzzy Systems, vol.20, no. 3, pp. 514-525, 2012. [7] V. T orra, “ Hesitant fuzzy sets,” Int. J. Intell. Syst. vol.25, pp. 529–539, 2010. [8] V. T orra and Y. Narukawa, “ On hesitant fuzzy sets and decision,” 18th IEEE Int. Conf. Fuzzy Syst. (Jeju Island,Korea,), pp. 1378–1382. 2009. [9] F. Smarandache, A unifying field in logics. neutrosophy: Neutrosophic probability, set and logic, American Research Press, Rehoboth, 1999. [10] H.Wang, F. Smarandache, Y. Q. Zhang, and R. Sunderraman, “ Single valued neutrosophic sets,” Multispace and Multistructure, vol. 4, pp. 410–413, 2010. [11] J. Ye, “ A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets,” Journal of Intelligent & Fuzzy Systems, vol.26, no. 5, pp. 2459-2466, 2014. [12] H. Wang, F. Smarandache, Y. Q. Zhang, and R. Sunderraman, Interval Neutrosophic Sets and Logic:T heory and Applications in Computing, Hexis, Phoenix, Ariz, USA, 2005. [13] J.J. Peng, J.Q. Wang and X.H. Wu, “ Multi-valued Neutrosophic Sets and Power Aggregation Operators with T heir Applciation in Multi-criteria Group Decision-making Problems,” International Journal of Computational Intelligence Systems, vol.8, no.2, pp. 345-363, 2015. [14] P.D. Liu and L.L Shi, “ T he generalized hybrid weighted average operator based on interval neutrosophic hesit ant set and its application to multiple attribute decision making, ” Neural Computing & Application, vol.26, pp. 457-471,2015. [15] J. Ye, “ Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment,” International Journal of General Systems, vol. 42, no. 4, pp. 386-394, 2013. [16] P.Majumdar and S.K. Samanta, “ On similarity and entropy of neutrosophic sets,” Journal of Intelligent & Fuzzy Systems, vol.26, no. 3, pp. 1245-1252, 2014. [17] J.Ye, “ Single valued neutrosophic cross-entropy for multicriteria decision making problems,” Applied Mathematical Modelling, vol.38, no. 3, pp. 1170-1175, 2014. [18] J. Ye, “ Similarity measures between interval neutrosophic sets and their applications in multicriteria decision-making,” Journal of Intelligent and Fuzzy Systems, vol. 26, no. 1, pp. 165-172, 2014. [19] R. R. Yager, “ On ordered weighted averaging aggregation operators in multicriteria decision making,” IEEE Trans. on Systems, Man and Cybernetics Cybernetics, vol. 18, no. 1, pp. 183-190, 1988. [20] Z. S. Xu and R. R. Yager, “Some geometric aggregation operators based on intuitionistic fuzzy sets,” International Journal of General Systems, vol. 35,no. 4, pp. 417-433, 2006. [21] H. Zhao, Z. S. Xu, M. F. Ni, and S. S. Liu, “Generalized aggregation operators for intuitionistic fuzzy sets,” International Journal of Intelligent Systems, vol. 25, no. 1, pp. 1-30, 2010. [22] W.Z.Wang and X. W. Liu, “ Intuitionistic fuzzy geometric aggregation operators based on Einstein operations,” International

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

Journal of Intelligent Systems, vol. 26, no. 11, pp. 1049-1075, 2011. P.D.Liu, “Some Hamacher aggregation operators based on the interval-valued intuitionistic fuzzy numbers and their application to Group Decision Making,” IEEE Trans. on Fuzzy systems, vol. 22, no. 1, pp. 83-97, 2014. P.D. Liu and Y.M. Wang, “ multiple attribute decision-making method based on single-valued neutrosophic normalized weighted Bonferroni mean,” Neural Computing & Application, vol. 25, pp. 2001-2010, 2014. H.Y.Zhang, J.Q. Wang and X.H. Chen, “ Interval neutrosophic sets and their application in multicriteria decision making problems,” The Scientific World Journal, 2014. L.H.Yang and B.L.Li. “A Multi-Criteria Decision-Making Method Using Power Aggregation Operators for Single-valued Neutrosophic Sets,” International Journal of Database Theory and Application. vol. 9, no. 2, pp. 23-32, 2016. H. Zhao, Z. S. Xu, M. F. Ni, and S. S. Liu, “Generalized aggregation operators for intuitionistic fuzzy sets,” International Journal of Intelligent System s, vol. 25, no. 1, pp. 1-30, 2010. L.Wang, X.Zheng, L.Zhang, and Q. Yue, “ Notes on distance and similarity measures of dual hesitant fuzzy sets,” IAENG International Journal of Applied Mathematics, vol. 46, no. 4, pp. 488-494, 2016. H.Yano, and R.R.Zhang, “Interactive decision making for multiobjective fuzzy random programming problems with simple recourse through a fractile model,” IAENG International Journal of Applied Mathematics, vol. 46, no. 3, pp. 379-387, 2016. A.Serhat, and K.Cengiz, “ Evaluation of E-commerce website quality using fuzzy multi-criteria decision making approach,” IAENG International Journal of Computer Science, vol. 39, no. 1, pp. 64-70, 2012.

(Advance online publication: 10 February 2018)


Turn static files into dynamic content formats.

Create a flipbook