Next Article in Journal
On Common Fixed Point Results for New Contractions with Applications to Graph and Integral Equations
Previous Article in Journal
On the Unitary Representations of the Braid Group B6
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Single-Valued Neutrosophic Power Shapley Choquet Average Operators and Their Applications to Multi-Criteria Decision-Making

1
School of Information, Zhejiang University of Finance & Economics, Hangzhou 310018, China
2
School of Accounting, Zhejiang University of Finance & Economics, Hangzhou 310018, China
3
School of Business, Central South University, Changsha 410083, China
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(11), 1081; https://doi.org/10.3390/math7111081
Submission received: 12 October 2019 / Revised: 1 November 2019 / Accepted: 6 November 2019 / Published: 9 November 2019

Abstract

:
Single-valued neutrosophic sets (SVNSs), which involve in truth-membership, indeterminacy-membership and falsity-membership, play a significant role in describing the decision-makers’ preference information. In this study, a single-valued neutrosophic multi-criteria decision-making (MCDM) approach is developed based on Shapley fuzzy measures and power aggregation operator that takes a correlative relationship among criteria into account and also simultaneously reduces the effects of abnormal preference information. Firstly, two aggregation operators, namely, generalized weighted single-valued neutrosophic power Shapley Choquet average (GWSVNPSCA) operator and generalized weighted single-valued neutrosophic power Shapley Choquet geometric (GWSVNPSCG) operator, are accordingly defined, and the corresponding properties are discussed as well. Secondly, based on the proposed aggregation operators, an integrated MCDM approach is proposed to effectively solve single-valued neutrosophic problems where the weight information is incompletely known. A programming model is constructed to obtain the optimal Shapley fuzzy measure. Next, the proposed operators are utilized to aggregate the decision-makers’ preference information. Finally, a theoretical example with tourism attraction selection is provided to examine the efficacy of the developed approach, in which the results is found reasonable and credible.

1. Introduction

In real environment, a successful decision-making often requires consideration of multiple factors (criteria). This kind of problem related to decision-making simultaneously involving multiple criteria is called multi-criteria decision-making (MCDM) problem [1]. Since Zadeh put forward the theory of the fuzzy sets (FSs) in 1965 [2], MCDM based on FSs theory has been widely developed and applied to practical decision-making problems [3,4,5,6,7,8,9,10,11]. Due to the inherent fuzziness of human preference information, a single membership degree of FSs cannot properly describe the fuzziness and uncertainty in the decision-making process. After that, Atanassov [12] defined intuitionistic fuzzy sets (IFSs), including a membership, non-membership, and hesitation index, as the extension of FSs [2]. However, FSs and IFSs cannot deal with indeterminate information. Thus, Smarandache et al. [13,14] developed neutrosophic sets (NSs), involving truth membership, indeterminacy membership, and falsity membership, respectively, and it lies in the range of ] 0 ,   1 + [ [15]. Obviously, it is the extension of the standard interval [ 0 ,   1 ] of IFSs. Subsequently, a single-valued neutrosophic set (SVNS) was proposed, that is an instance of NS [16,17,18,19,20]. In addition, other extensions of NSs, including interval neutrosophic sets [21], neutrosophic cubic sets [22,23], single-valued neutrosophic hesitant fuzzy sets (SVNHFSs) [24], rough neutrosophic sets (RNSs) [25], interval rough neutrosophic sets (IRNSs) [26], probability multi-valued neutrosophic sets [27,28], and other extensions [29,30], were proposed and applied to solve theoretical problems.
Additionally, SVNS, as a popular method to describe DMs’ preference information, has greatly received scholars’ attention, and also was studied from different aspects, such as aggregation operators [31,32,33,34,35,36], outranking relations [37], and information measures [38,39]. For instance, Liu and Wang [31] presented a single-valued neutrosophic normalized weighted Bonferroni mean operator; Garg [36] presented single-valued neutrosophic Frank operators; Wu et al. [39] defined a simplified neutrosophic prioritized aggregation operator. Liu et al. [28] defined some single-valued neutrosophic Schweizer-Sklar prioritized aggregation operators. To our knowledge, aggregation operators play a significant role in solving MCDM problems. Different aggregation operators are mainly involved in different functions, which can reduce the effect of abnormal data provided by DMs. Especially, power aggregation (PA) operator, defined by Yager [40], can aggregate the information by using a weighted vector based on support degree among different arguments and allow the evaluation values to be supported.
In practice, we always experience some decision-making problems with the correlation between criteria. For example, tourism attraction selection, constraints of tourists, and preferences of tourists are correlated to each other, and male tourists prefer adventurous tourism attractions. Apparently, there is a redundancy between constraints and preferences, where the sum of the weights of constraints and preferences is greater than the weight of the combination s of two criteria.
The Shapley fuzzy measure and Choquet integral [41,42,43,44] are highly applied to deal with MCDM problems where the criteria are correlated [45,46]. For instance, Zhang et al. [44] presented some hesitant fuzzy linguistic Shapley Choquet integral operators; Meng et al. [47] developed interval-valued intuitionistic fuzzy Shapley Choquet integral operators; Qu et al. [48] defined dual hesitant fuzzy Shapley Choquet integral operators; Nie et al. [49] developed some Pythagorean fuzzy partitioned normalized weighted Bonferroni mean operator based on Shapley fuzzy measures.
From the above analysis, two shortcomings can be concluded as follows: (1) the existing single-valued neutrosophic aggregation operators only take the importance of assessment values or that of ordered position into account. However, criteria were often interdependent or interactive in the decision-making process; (2) Most of existing methods cannot handle some special MCDM problems where the weight information is incompletely known. Moreover, power aggregation operator can reduce the effects of abnormal assessment values, and Shapley fuzzy measures can simultaneously consider the importance and overall correlation among the criteria. To do this, the main contributions can be summarized as: (1) This paper proposes two new aggregation operators, namely the generalized weighted single-valued neutrosophic power Shapley Choquet average (GWSVNPSCA) operator and the generalized weighted single-valued neutrosophic power Shapley Choquet geometric (GWSVNPSCG) operator, which can avoid the first drawback. (2) This paper develops a MCDM approach based on proposed aggregation operators to solve single-valued neutrosophic problems with incomplete weight information, which can overcome the second drawback.
The rest of the study is constructed as follows. In Section 2, some related definitions are introduced. Then, the GWSVNPSCA and GWSVNPSCG operators are defined in Section 3. Next, the single-valued MCDM method accompanied with unknown weight information is constructed in Section 4. In Section 5, the selection of tourism attraction is provided to assess the effectiveness of the proposed method. Finally, we summarize the achieved results in Section 6.

2. Preliminaries

Here, some basic definitions, including Shapley fuzzy measure, PA operator, NSs, and SVNS, are described.

2.1. Shapley Fuzzy Measure

Definition 1
[42,43]. Let X = { x 1 , x 2 , , x n } be a finite set and P ( x ) be the power set of X . Then the function M : ( P ( x ) [ 0 , 1 ] ) is defined as a fuzzy measure, satisfying:
(1) 
μ ( Φ ) = 0 and μ ( X ) = 1 ;
(2) 
α , β P ( X ) and α β , then μ ( α ) μ ( β ) .
To measure the influence of each condition in a game, Shapley [42] defined the Shapley function as follows:
ϕ S ( μ , X ) = M X \ S ( n s m ) ! m ! ( n s + 1 ) ! ( μ ( S { M } ) μ ( M ) ) , S X .
Here n and m denote the cardinalities of X and M , respectively. As discussed in Zhang et al. [44], we have ϕ i ( μ , X ) 0 and i = 1 n ϕ i ( μ , X ) = 1 , which can be true. Then, ϕ i ( μ , X ) is called Shapley fuzzy measure [44]. Moreover, Shapley fuzzy measures, which will be utilized in latter analysis, are additive fuzzy measures.

2.2. PA Operator

The PA operator was developed by Yager [40] in the form of nonlinear weighted average aggregation operator.
Definition 2
[40]. The PA operator is given as:
P A ( ϑ 1 , ϑ 2 , , ϑ n ) = i = 1 n ( 1 + F ( ϑ i ) ) ϑ i i = 1 n ( 1 + F ( ϑ i ) ) .
where ϑ i ( i = 1 , 2 , , n ) includes positive real numbers. F ( ϑ i ) = i = 1 , j i n S u p ( ϑ i , ϑ j ) and S u p ( ϑ i , ϑ j ) denote the support degree for ϑ i from ϑ j . After that, the support degree satisfies the properties as follows:
(1) 
S u p ( ϑ i , ϑ j ) [ 0 , 1 ] ;
(2) 
S u p ( ϑ i , ϑ j ) = S u p ( ϑ j , ϑ i ) ;
(3) 
S u p ( ϑ i , ϑ j ) S u p ( ϑ s , ϑ t ) , i f f   | ϑ i ϑ j | < | ϑ s ϑ t | .

2.3. NSs and SVNSs

Definition 3
[13,14,50]. A NS ψ ˜ in X = { x 1 , x 2 , , x n } is characterized as: ψ ˜ = {   x , T ˜ ψ ˜ ( x ) , I ˜ ψ ˜ ( x ) , F ˜ ψ ˜ ( x ) | x X } . Here T ˜ ψ ˜ ( x ) , I ˜ ψ ˜ ( x ) , and F ˜ ψ ˜ ( x ) denote truth-membership, indeterminacy-membership and falsity-membership respectively. Furthermore, T ˜ ψ ˜ ( x ) , I ˜ ψ ˜ ( x ) , and F ˜ ψ ˜ ( x ) are subsets of ] 0 ,   1 + [ , that is, T ˜ ψ ˜ ( x ) : X ] 0 ,   1 + [ , I ˜ ψ ˜ ( x ) : X ] 0 ,   1 + [ , and F ˜ ψ ˜ ( x ) : X ] 0 ,   1 + [ to satisfy the condition required for 0 sup T ˜ ψ ˜ ( x ) + sup I ˜ ψ ˜ ( x ) + sup F ˜ ψ ˜ ( x ) 3 + .
Since NSs can difficultly handle practical problems because of their nonstandard intervals, Ye [16] defined SVNSs based on standard intervals and developed the corresponding operations for SVNSs.
Definition 4
[16]. An SVNS ψ in X = { x 1 , x 2 , , x n } is defined as: ψ = {   x , T ψ ( x ) , I ψ ( x ) , F ψ ( x ) | x X } . Here T ψ ( x ) , I ψ ( x ) , and F ψ ( x ) are subsets in the standard interval of [0,1], i.e., T ψ ( x ) : X [ 0 , 1 ] , I ψ ( x ) : X [ 0 , 1 ] , and F ψ ( x ) : X [ 0 , 1 ] . In particular, if X has only one element, then ψ is called a single-valued neutrosophic number (SVNN). For convenience, an SVNN is denoted by ψ = T ψ , I ψ , F ψ .
Definition 5
[16]. Let ψ = T ψ , I ψ , F ψ , ψ 1 = T ψ 1 , I ψ 1 , F ψ 1 and ψ 2 = T ψ 2 , I ψ 2 , F ψ 2 be three SVNNs, and with λ > 0 , the following operations can be defined:
(1) 
λ ψ = 1 ( 1 T ψ ) λ , 1 ( 1 I ψ ) λ , 1 ( 1 F ψ ) λ , λ > 0 ;
(2) 
ψ λ = T ψ λ , I ψ λ , F ψ λ , λ > 0 ;
(3) 
ψ 1 ψ 2 = T ψ 1 + T ψ 2 T ψ 1 T ψ 2 , I ψ 1 + I ψ 2 I ψ 1 I ψ 2 , F ψ 1 + F ψ 2 F ψ 1 F ψ 2 ;
(4) 
ψ 1 ψ 2 = T ψ 1 T ψ 2 , I ψ 1 I ψ 2 , F ψ 1 F ψ 2 .
However, the operations are unreasonable as previously outlined [32]. Then, Peng et al. [32] developed the improved operations of SVNNs and the corresponding comparison method.
Definition 6
[32]. Let ψ = T ψ , I ψ , F ψ , ψ 1 = T ψ 1 , I ψ 1 , F ψ 1 and ψ 2 = T ψ 2 , I ψ 2 , F ψ 2 be three SVNNs, and λ > 0 . The SVNNs operations are defined in the following:
(1) 
λ ψ = 1 ( 1 T ψ ) λ , I ψ λ , F ψ λ ;
(2) 
ψ λ = T ψ λ , 1 ( 1 I ψ ) λ , 1 ( 1 F ψ ) λ ;
(3) 
ψ 1 ψ 2 = T ψ 1 + T ψ 2 T ψ 1 T ψ 2 , I ψ 1 I ψ 2 , F ψ 1 F ψ 2 ;
(4) 
ψ 1 ψ 2 = T ψ 1 T ψ 2 , I ψ 1 + I ψ 2 I ψ 1 I ψ 2 , F ψ 1 + F ψ 2 F ψ 1 F ψ 2 .
Example 1.
Let ψ = 0.5 , 0.1 , 0.3 , ψ 1 = 0.7 , 0.1 , 0.1 , and ψ 2 = 0.5 , 0.2 , 0.3 be three SVNNs, and λ = 2 . Based on the operations presented in Definition 6, we can get the following results:
(1) 
λ ψ = 1 ( 1 0.5 ) 2 , 0.1 2 , 0.3 2 = 0.75 , 0.01 , 0.09 ;
(2) 
ψ λ = 0.5 2 , 1 ( 1 0.1 ) 2 , 1 ( 1 0.3 ) 2 = 0.025 , 0.19 , 0.51 ;
(3) 
ψ 1 ψ 2 = 0.7 + 0.5 0.7 0.5 , 0.1 0.2 , 0.1 0.3 = 0.85 , 0.02 , 0.03 ;
(4) 
ψ 1 ψ 2 = 0.7 0.5 , 0.1 + 0.2 0.1 0.2 , 0.1 + 0.3 0.1 0.3 = 0.35 , 0.28 , 0.37 .
Definition 7
[32]. Let ψ 1 = T ψ 1 , I ψ 1 , F ψ 1 and ψ 2 = T ψ 2 , I ψ 2 , F ψ 2 be two SVNNs. Then the method of comparison is defined as:
(1) 
If s ¯ ( ψ 1 ) > s ¯ ( ψ 2 ) , then ψ 1 ispreferableto ψ 2 ,representedby ψ 1 ψ 2 ;
(2) 
If s ¯ ( ψ 1 ) = s ¯ ( ψ 2 ) and a ¯ ( ψ 1 ) > a ¯ ( ψ 2 ) , then ψ 1 is preferable to ψ 2 , represented by ψ 1 ψ 2 ;
(3) 
If s ¯ ( ψ 1 ) = s ¯ ( ψ 2 ) , a ¯ ( ψ 1 ) = a ¯ ( ψ 2 ) and c ¯ ( ψ 1 ) > c ¯ ( ψ 2 ) , then ψ 1 is preferable to ψ 2 , represented by ψ 1 ψ 2 ;
(4) 
If s ¯ ( ψ 1 ) = s ¯ ( ψ 2 ) , a ¯ ( ψ 1 ) = a ¯ ( ψ 2 ) and c ¯ ( ψ 1 ) = c ¯ ( ψ 2 ) , then ψ 1 is indifferent to ψ 2 , represented by ψ 1 ~ ψ 2 .
(5) 
where s ¯ ( ψ i ) = ( T ψ i + 1 I ψ i + 1 F ψ i ) / 3 , a ¯ ( ψ i ) = T ψ i F ψ i and c ¯ ( ψ i ) = T ψ i ( i = 1 , 2 ) denote the score function, accuracy function and certainty function of SVNNs, respectively.
Example 2.
Let ψ 1 = 0.8 , 0.1 , 0.2 and ψ 2 = 0.6 , 0.2 , 0.3 be two SVNNs, then we have s ¯ ( ψ 1 ) = 0.83 and s ¯ ( ψ 2 ) = 0.7 . Since s ¯ ( ψ 1 ) > s ¯ ( ψ 2 ) , so ψ 1 is preferable to ψ 2 , i.e., ψ 1 ψ 2 .
Definition 8.
Let ψ 1 = T ψ 1 , I ψ 1 , F ψ 1 and ψ 2 = T ψ 2 , I ψ 2 , F ψ 2 be two SVNNs. The generalized normalized single-valued neutrosophic distance between two SVNNs of ψ 1 and ψ 2 can be defined as:
d g n s v n ( ψ 1 ,     ψ 2 ) = ( 1 5 ( | T ψ 1 T ψ 2 | γ + | I ψ 1 I ψ 2 | γ + | F ψ 1 F ψ 2 | γ + | max { T ψ 1 , I ψ 2 } max { I ψ 1 , T ψ 2 } | γ + | max { T ψ 1 , F ψ 2 } max { F ψ 1 , T ψ 2 } | γ ) ) 1 / γ ( γ > 0 ) .
Especially, if γ = 1 , then d g n s v n ( ψ 1 ,     ψ 2 ) may reduce to the normalized single-valued neutrosophic Hamming distance, i.e.,
d g n s v n ( ψ 1 ,     ψ 2 ) = 1 5 ( | T ψ 1 T ψ 2 | + | I ψ 1 I ψ 2 | + | F ψ 1 F ψ 2 | + | max { T ψ 1 , I ψ 2 } max { I ψ 1 , T ψ 2 } | + | max { T ψ 1 , F ψ 2 } max { F ψ 1 , T ψ 2 } | ) .
If γ = 2 , then d g n s v n ( ψ 1 ,     ψ 2 ) may reduce to the normalized single-valued neutrosophic Euclidean distance, i.e.,
d g n s v n ( ψ 1 ,     ψ 2 ) = ( 1 5 ( | T ψ 1 T ψ 2 | 2 + | I ψ 1 I ψ 2 | 2 + | F ψ 1 F ψ 2 | 2 + | max { T ψ 1 , I ψ 2 } max { I ψ 1 , T ψ 2 } | 2 + | max { T ψ 1 , F ψ 2 } max { F ψ 1 , T ψ 2 } | 2 ) ) 1 / 2 ( γ > 0 ) .
Example 3.
Based on Example 2, and let γ = 1 , then we have d g n s v n ( ψ 1 ,     ψ 2 ) = 1 5 ( | 0.8 0.6 | + | 0.1 0.2 | + | 0.2 0.3 | + | max { 0.8 , 0.2 } max { 0.1 , 0.6 } | + | max { 0.8 , 0.3 } max { 0.2 , 0.6 } | ) = 0.16 .

3. Generalized Weighted Single-Valued Neutrosophic Power Shapley Choquet Operators

Based on the PA operator and Shapley fuzzy measure, the GWSVNPSCA operator and GWSVNPSCG operator are defined respectively, and the corresponding properties are discussed as well.

3.1. Generalized Weighted Single-Valued Neutrosophic Power Shapley Choquet Averaging Operator

Definition 9.
Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs, and ϕ ( u , X ) be a Shapley fuzzy measure. Then, GWSVNPSCA operator with dimension n is a mapping GWSVNPSCA: S V N N n S V N N , and
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) = ( j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ψ σ ( j ) λ j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ .
Here, λ > 0 , ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( j = 1 , 2 , , n ) , while it can be presented as ψ σ ( 1 ) ψ σ ( 2 ) ψ σ ( n ) , B σ ( j ) = { σ ( j ) , σ ( j + 1 ) , , σ ( n ) } , B σ ( n + 1 ) = Φ , and ϕ B σ ( n + 1 ) ( u , X ) = 0 . Moreover, S ( ψ σ ( j ) ) = i = 1 , j i n ( ϕ B σ ( j ) ( μ , X ) ϕ B σ ( j + 1 ) ( μ , X ) ) S u p ( ψ σ ( j ) , ψ σ ( i ) ) , and S u p ( ψ σ ( j ) , ψ σ ( i ) ) = 1 d ( ψ σ ( j ) , ψ σ ( i ) ) presents the support for ψ σ ( j ) from ψ σ ( i ) , that satisfies the conditions:
(1) 
S u p ( ψ σ ( i ) , ψ σ ( j ) ) [ 0 , 1 ] ;
(2) 
S u p ( ψ σ ( i ) , ψ σ ( j ) ) = S u p ( ψ σ ( j ) , ψ σ ( i ) ) ;
(3) 
S u p ( ψ σ ( i ) , ψ σ ( j ) ) S u p ( ψ σ ( p ) , ψ σ ( q ) )   i f f   d ( ψ σ ( i ) , ψ σ ( j ) ) < d ( ψ σ ( p ) , ψ σ ( q ) ) , here d is the distance measure as defined in Definition 8.
Theorem 1.
Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs and ϕ ( u , X ) be the Shapley fuzzy measure. Then the aggregated results by utilizing the GWSVNPSCA operator is also an SVNN, i.e.,
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) = ( 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ , 1 ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ , 1 ( 1 j = 1 n ( 1 ( 1 F ψ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ .
Here, S ( ψ σ ( j ) ) = i = 1 , j i n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) S u p ( ψ σ ( j ) , ψ σ ( i ) ) and satisfies the conditions mentioned in Definition 9.
Proof. 
To simplify the process, let ω σ ( j ) = ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) in the following proof.
By using the mathematical induction method, if n = 2 , based on the operation laws in Definition 6, we have:
ψ σ ( 1 ) λ = T ψ σ ( 1 ) λ , 1 ( 1 I ψ σ ( 1 ) ) λ , 1 ( 1 F ψ σ ( 1 ) ) λ ,
ψ σ ( 2 ) λ = T ψ σ ( 2 ) λ , 1 ( 1 I ψ σ ( 2 ) ) λ , 1 ( 1 F ψ σ ( 2 ) ) λ ,
ω σ ( 1 ) ψ σ ( 1 ) λ = 1 ( 1 T ψ σ ( 1 ) λ ) ω σ ( 1 ) , ( 1 ( 1 I ψ σ ( 1 ) ) λ ) ω σ ( 1 ) , ( 1 ( 1 F ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ,
ω σ ( 2 ) ψ σ ( 2 ) λ = 1 ( 1 T ψ σ ( 2 ) λ ) ω σ ( 2 ) , ( 1 ( 1 I ψ σ ( 2 ) ) λ ) ω σ ( 2 ) , ( 1 ( 1 F ψ σ ( 2 ) ) λ ) ω σ ( 2 ) ,
ω σ ( 1 ) ψ σ ( 1 ) λ ω σ ( 2 ) ψ σ ( 2 ) λ = 1 ( 1 T ψ σ ( 1 ) λ ) ω σ ( 1 ) + 1 ( 1 T ψ σ ( 2 ) λ ) ω σ ( 2 ) ( 1 ( 1 T ψ σ ( 1 ) λ ) ω σ ( 1 ) ) ( 1 ( 1 T ψ σ ( 2 ) λ ) ω σ ( 2 ) ) , ( 1 ( 1 I ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 I ψ σ ( 2 ) ) λ ) ω σ ( 2 ) , ( 1 ( 1 F ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 F ψ σ ( 2 ) ) λ ) ω σ ( 2 )
= 1 ( 1 T ψ σ ( 1 ) λ ) ω σ ( 1 ) ( 1 T ψ σ ( 2 ) λ ) ω σ ( 2 ) , ( 1 ( 1 I ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 I ψ σ ( 2 ) ) λ ) ω σ ( 2 ) , ( 1 ( 1 F ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 F ψ σ ( 2 ) ) λ ) ω σ ( 2 ) .
( ω σ ( 1 ) ψ σ ( 1 ) λ ω σ ( 2 ) ψ σ ( 2 ) λ ) 1 / λ = ( 1 ( 1 T ψ σ ( 1 ) λ ) ω σ ( 1 ) ( 1 T ψ σ ( 2 ) λ ) ω σ ( 2 ) ) 1 / λ , 1 ( 1 ( 1 ( 1 I ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 I ψ σ ( 2 ) ) λ ) ω σ ( 2 ) ) 1 / λ , 1 ( 1 ( 1 ( 1 F ψ σ ( 1 ) ) λ ) ω σ ( 1 ) ( 1 ( 1 F ψ σ ( 2 ) ) λ ) ω σ ( 2 ) ) 1 / λ .
Apparently, if n = 2 , then Equation (7) holds.
If n = k , Equation (7) holds, i.e.,
ω σ ( 1 ) ψ σ ( 1 ) λ ω σ ( 2 ) ψ σ ( 2 ) λ , , ω σ ( k ) ψ σ ( k ) λ = 1 j = 1 k ( 1 T ψ σ ( j ) λ ) ω σ ( j ) , j = 1 k ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) , j = 1 k ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j )
and
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ k ) = ( 1 j = 1 k ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ) 1 λ , 1 ( 1 j = 1 k ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 λ , 1 ( 1 j = 1 k ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 λ .
Then for n = k + 1 , we have
ω σ ( 1 ) ψ σ ( 1 ) λ ω σ ( 2 ) ψ σ ( 2 ) λ , , ω σ ( k ) ψ σ ( k ) λ ω σ ( k + 1 ) ψ σ ( k + 1 ) λ = 1 j = 1 k ( 1 T ψ σ ( j ) λ ) ω σ ( j ) , j = 1 k ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) , j = 1 k ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j ) 1 ( 1 T ψ σ ( k + 1 ) λ ) ω σ ( k + 1 ) , ( 1 ( 1 I ψ σ ( k + 1 ) ) λ ) ω σ ( k + 1 ) , ( 1 ( 1 F ψ σ ( k + 1 ) ) λ ) ω σ ( k + 1 ) = 1 j = 1 k ( 1 T ψ σ ( j ) λ ) ω σ ( j ) + 1 ( 1 T ψ σ ( k + 1 ) λ ) ω σ ( k + 1 ) ( 1 j = 1 k ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ) ( 1 ( 1 T ψ σ ( k + 1 ) λ ) ω σ ( k + 1 ) ) , j = 1 k ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ( 1 ( 1 I ψ σ ( k + 1 ) ) λ ) ω σ ( k + 1 ) , j = 1 k ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j ) ( 1 ( 1 F ψ σ ( k + 1 ) ) λ ) ω σ ( k + 1 ) = 1 j = 1 k + 1 ( 1 T ψ σ ( j ) λ ) ω σ ( j ) , j = 1 k + 1 ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) , j = 1 k + 1 ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) .
Thus,
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ k + 1 ) = ( ω σ ( 1 ) ψ σ ( 1 ) λ ω σ ( 2 ) ψ σ ( 2 ) λ , , ω σ ( k ) ψ σ ( k ) λ ω σ ( k + 1 ) ψ σ ( k + 1 ) λ ) 1 / λ = ( 1 j = 1 k + 1 ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ) 1 / λ , 1 ( 1 j = 1 k + 1 ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ , 1 ( 1 j = 1 k + 1 ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ .
Thus, if n = k + 1 , Equation (7) is held. In the other words, for any positive real number n , Equation (7) is held.  □
Example 4.
Let ψ 1 = 0.7 , 0.1 , 0.3 and ψ 2 = 0.8 , 0.2 , 0.2 be two SVNNs, then we have s ¯ ( ψ 1 ) = 0.77 and s ¯ ( ψ 2 ) = 0.8 , i.e., ψ σ ( 1 ) = ψ 1 and ψ σ ( 2 ) = ψ 2 . Assume μ ( ) = 0 , μ ( { ψ 1 } ) = 0.6 , μ ( { ψ 2 } ) = 0.3 , and μ ( { ψ 1 , ψ 2 } ) = 1 , then ϕ ψ 1 ( μ , X ) = 0.65 , and ϕ ψ 2 ( μ , X ) = 0.35 . Based on the single-valued neutrosophic normalized Hamming distance presented in Definition 8, we can get S u p ( ψ 1 , ψ 2 ) = S u p ( ψ 1 , ψ 2 ) = 1 d g s v n n ( ψ 1 , ψ 2 ) = 0.9 . Thus, let λ = 1 , from Theorem 1, we have:
G W S V N P S C A ( ψ 1 , ψ 2 ) = ( 1 ( 1 T ψ 1 ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( 1 T ψ 2 ) ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) , 1 ( 1 I ψ 1 ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) I ψ 2 ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) , 1 ( 1 F ψ 1 ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) F ψ 2 ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) = ( 1 ( 1 0.7 ) ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ( 1 0.8 ) ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) ,   1 ( 1 0.1 ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) 0.2 ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) ,   1 ( 1 0.3 ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) 0.2 ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) = 0.7597 , 0.1461 , 0.2403 .
In the following, a number of properties of GWSVNPSCA operator are discussed.
Theorem 2
(Idempotency). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ 1 = ψ 2 = = ψ n = ψ = T ψ , I ψ , F ψ , then G S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) = ψ .
Proof. 
Since ψ 1 = ψ 2 = = ψ n = ψ = T ψ , I ψ , F ψ , thus we have
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) = G W S V N P S C A ( ψ , ψ , , ψ ) = ( 1 ( 1 T ψ λ ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) ) 1 λ ,                                                                                           1 ( 1 ( 1 ( 1 I ψ ) λ ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) ) 1 λ ,                                                                                           1 ( 1 ( 1 ( 1 F ψ ) λ ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ) ) ) 1 λ = ( 1 1 + T ψ λ ) 1 / λ ,   1 ( 1 1 + ( 1 I ψ ) λ ) 1 / λ ,   1 ( 1 1 + ( 1 F ψ ) λ ) 1 / λ = ( T ψ λ ) 1 / λ , 1 ( ( 1 I ψ ) λ ) 1 / λ ,   1 ( ( 1 F ψ ) λ ) 1 / λ = T ψ ,   I ψ ,   F ψ .
Thus, G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) = ψ can be true.  □
Theorem 3
(Permutability). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ ¯ j = ( T ¯ ψ ¯ j , I ¯ ψ ¯ j , F ¯ ψ ¯ j ) ( j = 1 , 2 , , n ) accompanies with any permutation of ψ j = ( T ψ j , I ψ j , F ψ j ) ( j = 1 , 2 , , n ) , then,
G W S V N P S C A ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) = G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) .
Proof. 
Since ψ ¯ j = T ¯ ψ ¯ j , I ¯ ψ ¯ j , F ¯ ψ ¯ j ( j = 1 , 2 , , n ) is an any permutation of ψ j = ( T ψ j , I ψ j , F ψ j ) ( j = 1 , 2 , , n ) , therefore ψ ¯ σ ( j ) = ψ σ ( j ) ( j = 1 , 2 , , n ) , i.e., T ¯ ψ ¯ σ ( j ) = T ψ σ ( j ) , I ¯ ψ ¯ σ ( j ) = I ψ σ ( j ) and F ¯ ψ ¯ σ ( j ) = F ψ σ ( j ) . Thus,
G W S V N P S C A ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) = ( 1 j = 1 n ( 1 T ¯ ψ ¯ σ ( j ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) ) 1 λ ,                                                                           1 ( 1 j = 1 n ( 1 ( 1 I ¯ ψ ¯ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) ) 1 λ ,                                                                           1 ( 1 j = 1 n ( 1 ( 1 F ¯ ψ ¯ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ σ ( j ) ) ) ) 1 λ = ( 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ ,   1 ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ ,                                                                                         1 ( 1 j = 1 n ( 1 ( 1 F ψ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ = G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) .              
 □
Theorem 4
(Boundedness). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ = min j { T ψ j } , max j { I ψ j } , max j { F ψ j } and ψ + = max j { T ψ j } , min j { I ψ j } , min j { F ψ j } , then ψ G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) ψ + .
Proof. 
For simplicity, let ω σ ( j ) = ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) in the following proof.
Since min j { T ψ j } T ψ σ ( j ) max j { T ψ j } , i.e., min j { T ψ j λ } T ψ σ ( j ) λ max j { T ψ j λ } ,
Then max j { T ψ j λ } T ψ σ ( j ) λ min j { T ψ j λ } 1 max j { T ψ j λ } 1 T ψ σ ( j ) λ 1 min j { T ψ j λ }
( 1 max j { T ψ j λ } ) ω σ ( j ) ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ( 1 min j { T ψ j λ } ) ω σ ( j )
1 max j { T ψ j λ } = j = 1 n ( 1 max j { T ψ j λ } ) ω σ ( j ) j = 1 n ( 1 T ψ σ ( j ) λ ) ω σ ( j ) j = 1 n ( 1 min j { T ψ j λ } ) ω σ ( j ) = 1 min j { T ψ j λ }
min j { T ψ j λ } 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ω σ ( j ) max j { T ψ j λ } 1 min j { T ψ j λ } 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ω σ ( j ) max j { T ψ j λ }
min j { T ψ j } = ( min j { T ψ j λ } ) 1 / λ ( 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ) 1 / λ ( max j { T ψ j λ } ) 1 / λ = max j { T ψ j }
Moreover, min j { I ψ j } I ψ σ ( j ) max j { I ψ j } 1 max j { I ψ j } 1 I ψ σ ( j ) 1 min j { I ψ j }
( 1 max j { I ψ j } ) λ ( 1 I ψ σ ( j ) ) λ ( 1 min j { I ψ j } ) λ
1 ( 1 min j { I ψ j } ) λ 1 ( 1 I ψ σ ( j ) ) λ 1 ( 1 max j { I ψ j } ) λ
( 1 ( 1 min j { I ψ j } ) λ ) ω σ ( j ) ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ( 1 ( 1 max j { I ψ j } ) λ ) ω σ ( j )
j = 1 n ( 1 ( 1 min j { I ψ j } ) λ ) ω σ ( j ) j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) j = 1 n ( 1 ( 1 max j { I ψ j } ) λ ) ω σ ( j )
( 1 ( 1 min j { I ψ j } ) λ ) j = 1 n ω σ ( j ) j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ( 1 ( 1 max j { I ψ j } ) λ ) j = 1 n ω σ ( j )
1 ( 1 min j { I ψ j } ) λ j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) 1 ( 1 max j { I ψ j } ) λ
( 1 max j { I ψ j } ) λ 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ( 1 min j { I ψ j } ) λ
( ( 1 max j { I ψ j } ) λ ) 1 / λ ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ ( ( 1 min j { I ψ j } ) λ ) 1 / λ
1 max j { I ψ j } ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ 1 min j { I ψ j }
min j { I ψ j } = 1 1 + min j { I ψ ( j ) } 1 ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ 1 1 + max j { I ψ j } = max j { I ψ j }
Similarly, min j { F ψ j } 1 ( 1 j = 1 n ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ max j { F ψ j } .
Thus, we have
1 3 ( min j { T ψ j } + 1 max j { I ψ j } + 1 max j { F ψ j } ) 1 3 ( ( 1 j = 1 n ( 1 T ψ σ ( j ) λ ) ω σ ( j ) ) 1 / λ + 1 ( 1 ( 1 j = 1 n ( 1 ( 1 I ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ ) + 1 ( 1 ( 1 j = 1 n ( 1 ( 1 F ψ σ ( j ) ) λ ) ω σ ( j ) ) 1 / λ ) ) 1 3 ( max j { T ψ j } + 1 min j { I ψ j } + 1 min j { F ψ j } )
i.e., s ¯ ( ψ ) s ( G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) ) s ¯ ( ψ + ) .
Hence, we can obtain ψ G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) ψ + .  □
Theorem 5
(Monotonicity). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) and ψ ¯ j = T ¯ ψ ¯ j , I ¯ ψ ¯ j , F ¯ ψ ¯ j ( j = 1 , 2 , , n ) be two groups of SVNNs. If T ψ j T ¯ ψ ¯ j , I ψ j I ¯ ψ ¯ j and F ψ j F ¯ ψ ¯ j for all j = 1 , 2 , , n , then
G W S V N P S C A ( ψ 1 , ψ 2 , , ψ n ) G W S V N P S C A ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) .
Proof. 
According to Theorem 4, Theorem 5 can be confirmed. Therefore, the process of treatment is omitted here.  □
Besides, GWSVNPSCA operator, which defined by combing the advantages of Shapley fuzzy measure and PA aggregation operator, can reduce the effects of abnormal data and simultaneously consider an interrelationship among data and criteria. It is more appropriate in aggregation data because of different parameter.

3.2. Generalized Weighted Single-Valued Neutrosophic Power Shapley Choquet Geometric Operator

Definition 10.
Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs, and ϕ ( u , X ) be the Shapley fuzzy measure. Then GWSVNPSCG operator of dimension n is a mapping GWSVNPSCG: S V N N n S V N N , and
G W S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) = 1 λ ( j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) λ ψ σ ( j ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) .
where λ > 0 , ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( j = 1 , 2 , , n ) satisfying ψ σ ( 1 ) ψ σ ( 2 ) ψ σ ( n ) , B σ ( j ) = { σ ( j ) , σ ( j + 1 ) , , σ ( n ) } and B σ ( n + 1 ) = Φ , ϕ B σ ( n + 1 ) ( u , X ) = 0 .
Theorem 6.
Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs, and ϕ ( u , X ) be the Shapley fuzzy measure. Next, the aggregated results by utilizing GWSVNPSCG operator are also an SVNN, i.e.,
G W S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) = 1 ( 1 j = 1 n ( 1 ( 1 T ψ σ ( j ) ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ ,             ( 1 j = 1 n ( 1 I ψ σ ( j ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ ,             ( 1 j = 1 n ( 1 F ψ σ ( j ) λ ) ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) j = 1 n ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ σ ( j ) ) ) ) 1 λ .
Proof. 
The proof is omitted here.  □
Example 5.
Based on Example 4 and Theorem 6, the following results can be obtained:
G W S V N P S C G ( ψ 1 , ψ 2 ) = 1 ( 1 T ψ 1 ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) T ψ 2 ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) ,                                                                       ( 1 ( 1 I ψ 1 ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( 1 I ψ 2 ) ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) ,                                                                       ( 1 ( 1 F ψ 1 ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( 1 F ψ 2 ) ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ( ϕ ψ 1 s ( μ , X ) ϕ ψ 2 s ( μ , X ) ) ( 1 + S ( ψ 1 ) ) + ( ϕ ψ 2 s ( μ , X ) 0 ) ( 1 + S ( ψ 2 ) ) ) = 1 ( 1 0.7 ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) 0.8 ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) , ( 1   ( 1 0.1 ) ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ( 1 0.2 ) ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) ,   ( 1 ( 1 0.3 ) ( 0.65 0.35 ) ( 1 + 0.27 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ( 1 0.2 ) ( 0.35 0 ) ( 1 + 0.315 ) ( 0.65 0.35 ) ( 1 + 0.27 ) + ( 0.35 0 ) ( 1 + 0.315 ) ) = 0.753 , 0.1561 , 0.247 .
Similarly, GWSVNPSCG operator has the following properties.
Theorem 7
(Idempotency). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ 1 = ψ 2 = = ψ n = ψ = T ψ , I ψ , F ψ , then G W S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) = ψ .
Theorem 8
(Permutability). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ ¯ j = ( T ¯ ψ ¯ j , I ¯ ψ ¯ j , F ¯ ψ ¯ j ) ( j = 1 , 2 , , n ) is any permutation of ψ j = ( T ψ j , I ψ j , F ψ j ) ( j = 1 , 2 , , n ) , then,
G W S V N P S C G ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) = G W S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) .
Theorem 9
(Boundedness). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) be a group of SVNNs. If ψ = min j { T ψ j } , max j { I ψ j } , max j { F ψ j } and ψ + = max j { T ψ j } , min j { I ψ j } , min j { F ψ j } , thus, ψ G S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) ψ + .
Theorem 10
(Monotonicity). Let ψ j = T ψ j , I ψ j , F ψ j ( j = 1 , 2 , , n ) and ψ ¯ j = T ¯ ψ ¯ j , I ¯ ψ ¯ j , F ¯ ψ ¯ j ( j = 1 , 2 , , n ) be two groups of SVNNs. If T ψ j T ¯ ψ ¯ j , I ψ j I ¯ ψ ¯ j and F ψ j F ¯ ψ ¯ j for all j = 1 , 2 , , n , then
G W S V N P S C G ( ψ 1 , ψ 2 , , ψ n ) G W S V N P S C G ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) .

4. A Single-Valued Neutrosophic MCDM Approach with Incomplete Weight Information

Assume ψ = { ψ 1 , ψ 2 , , ψ n } is a group of alternatives and C = { c 1 , c 2 , , c m } includes corresponding criteria. R = ( ψ i j ) n × m is the single-valued neutrosophic decision matrix, and ψ i j = T ψ i j , I ψ i j , F ψ i j ( i = 1 , 2 , , n ; j = 1 , 2 , , m ) can be provided by the DM with respect to ψ i for criterion c j being expressed by SVNNs. If the weight of criteria for the Shapley fuzzy measure would be known, then the corresponding aggregation operators can be directly used to obtain the aggregated values; otherwise, if it would be partly known or fully unknown, next, the weights of criteria should be initially determined. The scheme of proposed method can be presented in Figure 1, and the procedure aiming to determine the optimal alternative(s) is provided in the following.
Phase 1. Construction and normalization of the decision matrix
In this phase, the criteria for each alternative are assessed by DMs. The decision-matrix can be constructed accordingly. Moreover, the criteria always involves benefit type and cost type in MCDM problems. If the criteria are benefit-based, then, there is no need to normalize the decision matrix; otherwise, the cost-based criteria should be transformed into corresponding benefit-based criteria as:
ψ ¯ i j = { ψ i j ,             for   benefit   criteria   c j ( ψ i j ) c ,     for   cos t   criteria   c j ,   ( i = 1 , 2 , , n ; j = 1 , 2 , , m ) .
where, ( ψ i j ) c = F i j , 1 I i j , T i j is the complement of ψ i j .
Then, the normalized decision matrix R ¯ = ( ψ ¯ i j ) n × m can be obtained.
Phase 2. Determinations of the Shapley fuzzy measures
Step 2.1. Determination of ideal solutions
Let ψ ¯ + = ( ψ ¯ 1 + , ψ ¯ 2 + , , ψ ¯ n + ) be positive ideal solution, and ψ ¯ = ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) be negative ideal solution, respectively. Here, ψ ¯ j + = ( max i T ¯ i j , min i I ¯ i j , min i F ¯ i j ) and ψ ¯ j = ( min i T ¯ i j , max i I ¯ i j , max i F ¯ i j ) ( i = 1 , 2 , , n ; j = 1 , 2 , , m ) .
Step 2.2. Calculation of closeness coefficients
Based on the technique presented for order preference by similarity to ideal solution (TOPSIS) method [51], the closeness coefficient of candidate from positive ideal solution can be calculated as follows:
D i j + ( ψ ¯ i j , ψ ¯ + ) = d i j ( ψ ¯ i j , ψ ¯ + ) d i j ( ψ ¯ i j , ψ ¯ + ) + d i j ( ψ ¯ i j , ψ ¯ ) ( i = 1 , 2 , , n ; j = 1 , 2 , , m ) .
where, d i j ( ψ ¯ i j ,     ψ ¯ + ) can be obtained by using Equation (3).
Step 2.3. Determination of Shapley fuzzy measures
According to TOPSIS method [52], the smaller D i j + ( ψ ¯ i j , ψ ¯ + ) , the better ψ ¯ i j is. If the weight information of criteria would be partly known, then, an optimal model based on the Shapley fuzzy measure can be constructed as:
min j = 1 n D i j + ( ψ ¯ i j , ψ ¯ + ) ϕ c j ( μ , C ) s . t .     { μ ( C ) = 1 μ ( E ) μ ( F ) ,   E , F C   a n d   E F μ ( C j ) G j ,   μ ( C j ) 0 ,   j = 1 , 2 , , n
where, ϕ c j ( μ , C ) denotes the integral weight of the criterion c j , and G j represents the weight information.
Next, fuzzy measure and corresponding the Shapley fuzzy measure can be obtained by solving the mode (12).
Phase 3. Aggregation the preference information
Step 3.1. Determination of the supports
From Definition 9, we can achieve the supports S u p ( ψ ¯ i j , ψ ¯ i p ) as:
S u p ( ψ ¯ i j , ψ ¯ i p ) = 1 d ( ψ ¯ i j , ψ ¯ i p ) ,   i = 1 , 2 , , n ; j , p = 1 , 2 , , m ;   j p .
where, S u p ( ψ ¯ i j , ψ ¯ i p ) represents the support for ψ ¯ i j from ψ ¯ i p , satisfying the conditions provided in Definition 9. Besides, d ( ψ ¯ i j , ψ ¯ i j ) can be calculated by using the distance presented in Definition 8.
Step 3.2. Determination the weighted supports
The weighted support S ( ψ ¯ i j ) of ψ ¯ i j from ψ ¯ i p ( p = 1 , 2 , , m   and   p j ) can be calculated using the Shapley fuzzy measure of the criterion c j ( j = 1 , 2 , , m ) .
S ( ψ ¯ i j ) = p = 1 , p j m ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) S u p ( ψ ¯ i j , ψ ¯ i p ) ( p = 1 , 2 , , m ) .
Step 3.3. Determination of the weights
From Step 3.2, we can determine the weights π i j ( j = 1 , 2 , , m ) associated with ψ ¯ i j ( j = 1 , 2 , , m ) as:
π i j = ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ i j ) ) j = 1 m ( ϕ B σ ( j ) s ( μ , X ) ϕ B σ ( j + 1 ) s ( μ , X ) ) ( 1 + S ( ψ ¯ i j ) ) ( j = 1 , 2 , , m ) .
Here π i j 0 ( j = 1 , 2 , , m ) and j = 1 m π i j = 1 .
Step 3.4. Calculation of the global values
By using GWSVNPSCW operator, i.e., Equation (8), the global value α i ( i = 1 , 2 , , n ) of candidate ψ ¯ i ( i = 1 , 2 , , n ) can be obtained.
Step 3.5. Calculation of the values of score, accuracy, and certainty
Based on Definition 7, the values of score s ¯ ( α i ) , accuracy a ¯ ( α i ) , and certainty c ¯ ( α i ) of ψ i ( i = 1 , 2 , , n ) can be achieved.
Step 3.6. Ranking the alternatives
According to Step 3.5, all candidates ψ i ( i = 1 , 2 , , n ) can be ranked and the optimal one can be selected.

5. Tourism Attraction Selection

In this section, a MCDM problem under single-valued environment is presented to illustrate the efficacy of the proposed method by selecting an appropriate tourism attraction. With the widespread popularity of the mobile Internet and the increasing demand of tourists regarding the quality of tourism services, online tourism, mobile tourism, and other services have gradually risen. Personalized tourism recommendations can provide tourism products for a user, reflecting his/her needs and preferences and help him/her promptly make tourism decisions. In the personalized tourism recommendation system, accurate and effective recommendations are provided mainly through four criteria related to preference information, including constraints, tourism resource bank, user’s tourism demand, and user’s preference for tourism products.
c 1 : Constraints are described as some objective conditions that affect the user’s decision making about tourism, including the age or physical condition of user, the gender or income of user, and weather conditions related to tourist attractions, carrying children and the elderly, etc.
c 2 : The tourist resource bank contains six aspects of the tourist products, including food, residence, tourism, entertainment, and purchase. It also contains the data related to various kinds of tourism products. The tourist resource bank is of great importance to analyze, produce, and make up the recommended results. Generally speaking, tourist attractions’ recommendation can collect the names of scenic spots and tickets, categories of scenic spots, grades, longitude and latitude directions, and so on.
c 3 : Tourism demand refers to the user’s demand for tourism products that they would like to purchase, that is, a subjective condition, such as the user’s tourism days, hotel’s condition, etc.
c 4 : The user’s preference for tourism products can be obtained by analyzing the tourist’s historical tourism data (such as the tourist photos uploaded by the user, the user’s comments or rating on the tourism products), the pages on the tourism website, purchase or transaction records of tourism products, etc.
According to the four criteria presented above, users should select the best tourist attraction according to their own and actual situation of the tourist attractions. Apparently, four criteria are correlated with each other. Suppose five tourist attractions (candidates) are taken into consideration, which are represented by ψ i ( i = 1 , 2 , 3 , 4 , 5 ) . During assessment, four criteria, namely: c 1 : constraints; c 2 : the tourist resource bank; c 3 : tourism demand; c 4 : preferences are considered. The corresponding weights of these four criteria are partly known, given as H = { 0.10 w 1 0.15 ,   0.10 w 2 0.20 ,   0.15 w 3 0.35 , 0.20 w 4 0.45 } . The evaluation of five candidates ψ i ( i = 1 , 2 , 3 , 4 , 5 ) is performed using SVNNs by the DM based on criterion c k ( k = 1 , 2 , 3 , 4 ) . Then, the single-valued neutrosophic decision matrix R = ( ψ k l ) 5 × 4 is established and shown in Table 1.

5.1. The Decision-Making Process

The decision-making process, by using the proposed method, is as follows.
Phase 1. Construction and normalization of the decision matrix
Since the assessment values are provided by DMs in form of SVNNs and the criteria are benefit-based, as a result, the normalized decision matrix R ¯ = R = ( ψ i j ) n × m is obtained.
Phase 2. Determination of Shapley fuzzy measures
Step 2.1. Determination of ideal solutions
From Table 1, we can achieve positive ideal solution ψ ¯ + = ( ψ ¯ 1 + , ψ ¯ 2 + , , ψ ¯ n + ) and negative ideal solution ψ ¯ = ( ψ ¯ 1 , ψ ¯ 2 , , ψ ¯ n ) , as displayed in Table 2.
Step 2.2. Calculation of the closeness coefficient
Let λ = 2 , the closeness coefficient of alternative from positive ideal solution can be determined as given in Table 3.
Step 2.3. Determination of the Shapley fuzzy measures
Then the optimal Shapley fuzzy measure model on the basis of criteria can be constructed as:
min 0.0914 μ ( c 1 ) 0.0359 μ ( c 1 , c 2 ) 0.0139 μ ( c 1 , c 2 , c 3 ) 0.0579 μ ( c 1 , c 2 , c 4 ) 0.0167 μ ( c 1 , c 3 ) 0.0195 μ ( c 1 , c 3 , c 4 ) 0.00387 μ ( c 1 , c 4 ) + 0.0195 μ ( c 2 ) + 0.0387 μ ( c 2 , c 3 ) + 0.0914 μ ( c 2 , c 3 , c 4 ) + 0.0167 μ ( c 2 , c 4 ) + 0.0579 μ ( c 3 ) + 0.0359 μ ( c 3 , c 4 ) + 0.0139 μ ( c 4 ) + 2.5475 s . t .     { μ ( c 1 , c 2 , c 3 , c 4 ) = 1 μ ( E ) μ ( F ) ,   E , F C   a n d   E F 0.1 μ ( c 1 ) 0.15 0.10 μ ( c 2 ) 0.2 0.15 μ ( c 3 ) 0.35 0.25 μ ( c 1 ) 0.45
With the help of MATLAB software, the mathematical programming model presented above can be solved, and the fuzzy measure on the basis of the criteria is μ ( c 1 ) = μ ( c 2 ) = μ ( c 1 , c 2 ) = 0.1 ,
μ ( c 2 , c 3 ) = μ ( c 3 , c 4 ) = μ ( c 2 , c 3 , c 4 ) = μ ( c 1 , c 3 , c 4 ) = μ ( c 1 , c 2 , c 3 ) = μ ( c 1 , c 2 , c 3 , c 4 ) = 1 ,
μ ( c 4 ) = μ ( c 1 , c 4 ) = μ ( c 2 , c 4 ) = μ ( c 1 , c 2 , c 4 ) = 0.20 ,   μ ( c 3 ) = μ ( c 1 , c 3 ) = 0.35 .
Form Definition 1, the corresponding Shapley fuzzy measure can be calculated.
ϕ { c 1 } s = 0.025 , ϕ { c 2 } s = 0.1333 , ϕ { c 3 } s = 0.6583 , ϕ { c 4 } s = 0.1833 , ϕ { c 1 , c 2 } s = 0.1417 , ϕ { c 1 , c 3 } s = 0.6667 , ϕ { c 1 , c 4 } s = 0.1917 , ϕ { c 2 , c 3 } s = 0.8833 , ϕ { c 2 , c 4 } s = 0.4083 , ϕ { c 3 , c 4 } s = 0.9333 , ϕ { c 1 , c 2 , c 3 } s = 0.9000 , ϕ { c 1 , c 2 , c 4 } s = 0.4250 , ϕ { c 1 , c 3 , c 4 } s = 0.9500 , ϕ { c 2 , c 3 , c 4 } s = 0.9500 , ϕ { c 1 , c 2 , c 3 , c 4 } s = 1 .
Phase 3. Aggregation of the preference information
Step 3.1. Determination of the supports
From Definition 9, we can achieve the supports S u p ( ψ i j , ψ i p ) as follows:
S u p ( ψ 11 , ψ 12 ) = S u p ( ψ 12 , ψ 11 ) = 0.6485 , S u p ( ψ 11 , ψ 13 ) = S u p ( ψ 13 , ψ 11 ) = 0.6316 , S u p ( ψ 11 , ψ 14 ) = S u p ( ψ 14 , ψ 11 ) = 0.6322 , S u p ( ψ 12 , ψ 13 ) = S u p ( ψ 13 , ψ 12 ) = 0.6840 , S u p ( ψ 12 , ψ 14 ) = S u p ( ψ 14 , ψ 12 ) = 0.6854 , S u p ( ψ 13 , ψ 14 ) = S u p ( ψ 14 , ψ 13 ) = 0.6794 , S u p ( ψ 21 , ψ 22 ) = S u p ( ψ 22 , ψ 21 ) = 0.6552 , S u p ( ψ 21 , ψ 23 ) = S u p ( ψ 23 , ψ 21 ) = 0.7422 , S u p ( ψ 21 , ψ 24 ) = S u p ( ψ 24 , ψ 21 ) = 0.5870 , S u p ( ψ 22 , ψ 23 ) = S u p ( ψ 23 , ψ 22 ) = 0.6502 , S u p ( ψ 22 , ψ 24 ) = S u p ( ψ 24 , ψ 22 ) = 0.5779 , S u p ( ψ 23 , ψ 24 ) = S u p ( ψ 24 , ψ 23 ) = 0.5928 , S u p ( ψ 31 , ψ 32 ) = S u p ( ψ 32 , ψ 31 ) = 0.6808 , S u p ( ψ 31 , ψ 33 ) = S u p ( ψ 33 , ψ 31 ) = 0.7053 , S u p ( ψ 31 , ψ 34 ) = S u p ( ψ 34 , ψ 31 ) = 0.6525 , S u p ( ψ 32 , ψ 33 ) = S u p ( ψ 33 , ψ 32 ) = 0.6860 , S u p ( ψ 32 , ψ 34 ) = S u p ( ψ 34 , ψ 32 ) = 0.6445 , S u p ( ψ 33 , ψ 34 ) = S u p ( ψ 34 , ψ 33 ) = 0.6581 , S u p ( ψ 41 , ψ 42 ) = S u p ( ψ 42 , ψ 41 ) = 0.6047 , S u p ( ψ 41 , ψ 43 ) = S u p ( ψ 43 , ψ 41 ) = 0.6480 , S u p ( ψ 41 , ψ 44 ) = S u p ( ψ 44 , ψ 41 ) = 0.6470 , S u p ( ψ 42 , ψ 43 ) = S u p ( ψ 43 , ψ 42 ) = 0.6147 , S u p ( ψ 42 , ψ 44 ) = S u p ( ψ 44 , ψ 42 ) = 0.6047 , S u p ( ψ 43 , ψ 44 ) = S u p ( ψ 44 , ψ 43 ) = 0.6415 ,
S u p ( ψ 51 , ψ 52 ) = S u p ( ψ 52 , ψ 51 ) = 0.6564 , S u p ( ψ 51 , ψ 53 ) = S u p ( ψ 53 , ψ 51 ) = 0.6460 , S u p ( ψ 51 , ψ 54 ) = S u p ( ψ 54 , ψ 51 ) = 0.6522 , S u p ( ψ 52 , ψ 53 ) = S u p ( ψ 53 , ψ 52 ) = 0.6284 , S u p ( ψ 52 , ψ 54 ) = S u p ( ψ 54 , ψ 52 ) = 0.6665 , S u p ( ψ 53 , ψ 54 ) = S u p ( ψ 54 , ψ 53 ) = 0.6203 .
Step 3.2. Determination of the weighted supports
The weighted support of each assessment value could be obtained, as shown in Table 4.
Step 3.3. Determination of the weights
Next, the weights π i j associated with the ψ i j on the basis of the criterion c j could be achieved, as presented in Table 5.
Step 3.4. Calculation of the global values
By using GWSVNPSCW operator and λ = 2 , the global assessment value α i ( i = 1 , 2 , , n ) of candidate ψ ¯ i ( i = 1 , 2 , , n ) can be obtained as:
α 1 = G S V N P S C O A ( ψ 11 , ψ 12 , ψ 13 , ψ 14 ) = ( 1 j = 1 4 ( 1 T ψ 1 σ ( j ) 2 ) π 1 j ) 1 2 ,                                                                                   1 ( 1 j = 1 4 ( 1 ( 1 I ψ 1 σ ( j ) ) λ ) π 1 j ) 1 2 ,                                                                               1 ( 1 j = 1 4 ( 1 ( 1 F ψ 1 σ ( j ) ) λ ) π 1 j ) 1 2 = ( 1 ( 1 T 11 2 ) π 11 ( 1 T 13 2 ) π 13 ( 1 T 14 2 ) π 14 ( 1 T 12 2 ) π 12 ) 1 2 ,         1 ( 1 ( 1 ( 1 I 11 ) 2 ) π 11 ( 1 ( 1 I 13 ) 2 ) π 13 ( 1 ( 1 I 14 ) 2 ) π 14 ( 1 ( 1 I 12 ) 2 ) π 12 ) 1 2 ,         1 ( 1 ( 1 ( 1 F 11 ) 2 ) π 11 ( 1 ( 1 F 13 ) 2 ) π 13 ( 1 ( 1 F 14 ) 2 ) π 14 ( 1 ( 1 F 12 ) 2 ) π 12 ) 1 2 = 0.6719 , 0.1236 , 0.2173 .
α 2 = 0.7814 , 0.1134 , 0.1224 ;   α 3 = 0.7088 , 0.1608 , 0.0862 ;   α 4 = 0.7147 , 0.1189 , 0.1365 ;
α 5 = 0.7357 , 0.1975 , 0.1981 .
Step 3.5. Calculation of the values of score, accuracy, and certainty
According to Definition 7, the values of score s ¯ ( α i ) ( i = 1 , 2 , 3 , 4 , 5 ) can be calculated as follows:
s ¯ ( α 1 ) = 0.7770 ; s ¯ ( α 2 ) = 0.8485 ; s ¯ ( α 3 ) = 0.8206 ; s ¯ ( α 4 ) = 0.8198 ; s ¯ ( α 5 ) = 0.7800 .
Since the values of score are different, thus there is no need to calculate the values of accuracy and certainty.
Step 3.6. Ranking the candidates
Apparently, s ¯ ( α 2 ) > s ¯ ( α 3 ) > s ¯ ( α 4 ) > s ¯ ( α 5 ) > s ¯ ( α 1 ) , thus, we have ψ 2 ψ 3 ψ 4 ψ 5 ψ 1 . The optimal attraction is ψ 2 while the worst one is ψ 1 .
If the GWSVNPSCG operator is used in Step 3.4 to aggregate the preference information of each candidates, then, the final ranking is ψ 2 ψ 3 ψ 4 ψ 5 ψ 1 . The best attraction is ψ 2 as well.

5.2. Sensitivity Analysis

In order to discuss the influence of different values γ and λ on the final ranking, sensitivity analysis is carried out. If GWSVNPSCW and GWSVNPSCG operators are used respectively in the Step 3.4 and γ , λ ( 0 ,   10 ] , then the results of the two cases are shown in Table 6 and Table 7 and Figure 2, Figure 3, Figure 4, Figure 5 and Figure 6.
For GWSVNPSCW operator, if γ = λ = 1 , 2 , 10 , accordingly, the final ranking is ψ 2 ψ 3 ψ 4 ψ 5 ψ 1 ; however, if γ = λ = 4 , 6 , 8 , the final ranking is ψ 2 ψ 4 ψ 3 ψ 5 ψ 1 , as shown in Table 6. Although the position of ψ 3 and ψ 4 is different as two parameters changes, the optimal attraction is always ψ 2 , while the worst one is ψ 1 . Moreover, from the score values presented in Table 6, it can be seen that the difference between the first position and the second position is greater as two parameters change, demonstrating the rationality of the alternative ψ 2 as an optimal scheme. For GWSVNPSCG operator, if γ = λ = 1 , 2 , therefore, the final ranking is ψ 2 ψ 4 ψ 3 ψ 1 ψ 5 ; if γ = λ = 4 , 6 , as a result, the final ranking is ψ 2 ψ 4 ψ 5 ψ 1 ψ 3 ; however, if γ = λ = 8 , 10 , thus, the final ranking is ψ 2 ψ 4 ψ 1 ψ 5 ψ 3 , as shown in Table 7. Although the position of ψ 1 , ψ 3 , and ψ 5 is different, the optimal attraction is ψ 2 . Besides, in order to further understand the influence of parameters on final rankings, the trend of score values of five candidates are presented with two parameters in the range of ( 0 ,   1 ] by using GWSVNPSCW and GWSVNPSCG operators, as shown in Figure 1, Figure 2, Figure 3, Figure 4 and Figure 5. It can be seen that the fluctuation tendency of score values, as displayed in Figure 3, indicates that the candidate ψ 2 is always the best one.

5.3. Comparative Analysis

In order to examine the effectiveness of the developed method, results achieved by using GWSVNPSCA operator are compared to a number of existing methods based on aggregation operators [16,31,35,36,39,52]. Since the majority of available methods cannot truly resolve situations where the weight information is partly known, the weight is determined as w = ( 0.15 , 0.20 , 0.30 , 0.35 ) T for the comparative analysis.
For the proposed method, the determined weights could be utilized to aggregate preference information in Phase 3 and γ = 2 , For the method based on prioritized operator [39], we assume that the prioritization of the criteria satisfies c 1 c 2 c 3 c 4 . For the methods based on Bonferroni mean [31], Frank operator [36], and Hamacher operator [52], the corresponding parameters are determined as p = q = 1 and γ = 2 , respectively. Then, the results could be obtained as shown in Figure 7.
According to the results presented in Figure 7, we can conclude the following achievements. Firstly, the final ranking by using the developed method is the same as those previously presented methods [31], and the final order is ψ 2 ψ 4 ψ 3 ψ 5 ψ 1 . Moreover, the developed method includes PA operator that can highly reduce the effects of abnormal assessment values. Secondly, although the positions of ψ 3 , ψ 5 and ψ 1 based on the proposed method are different from other previously reported methods [35,36,39,52]. the optimal alternative is always ψ 2 , Finally, the result based on algebraic operator [16] is ψ 4 ψ 2 ψ 5 ψ 3 ψ 1 , which is not consistent with other methods. The main reason for this discrepancy is that the rules of corresponding operation are unreasonable as previously discussed [35].

5.4. Managerial Implications

In this study, an MCDM method based on the single-valued neutrosophic aggregation operators is proposed to handle tourism attraction selection problems. Moreover, this study investigates a sensitivity analysis and comparison analysis to prove the validity of the developed method. The results indicated that ψ 2 is the optimal one. The management implications of the developed method can be concluded in the following. First, the evaluation criteria of tourism attraction selection consist of constraints, tourism resource bank, user’s tourism demand, and user’s preference for tourism products, which can meet the requirements of personalized tourism recommendation. Second, DMs can express their preference information from three perspectives, i.e., truth, indeterminacy, and falsity, which can precisely describe the uncertain information. Third, the proposed aggregation operators consider the interrelationship among criteria, which can make the final results more in accordance with the actual situation. For example, the constraints c1, tourism demand c3, and tourism preference c4 are correlated with each other in the real decision-making environment. If the correlation cannot be considered in the decision-making process, then the accuracy of recommendations will be attenuated to some extent. Last, it is difficult for DMs to provide the weight information of criteria in the form of crisp values directly. Thus, the proposed method with incompletely weight information has important theoretical significance for managers to improve the accuracy of recommendations.

6. Conclusions

In this study, a single-valued neutrosophic MCDM problem with interdependent characteristics is investigated. Firstly, according to the power aggregation operator and Shapley fuzzy measure, the GWSVNPSCA and GWSVNPSCG operators are accordingly defined, and the corresponding special cases are discussed as well. Secondly, based on the developed aggregation operators, an integrated MCDM approach is proposed to effectively solve single-valued neutrosophic problems where the weights of the criteria were incompletely known. A mathematical programming model based on fuzzy measure is established to obtain the optimal Shapley fuzzy measure. Then, the developed operators are used to aggregate the preference information. Eventually, a theoretical example is presented to testify the effectiveness of the developed approach, in which it is revealed that the results are reasonable and credible. The main advantages of this research can be concluded in two aspects. On the one hand, the developed aggregation operators can take the interrelationship among criteria into account and also simultaneously reduce the effects of abnormal assessment values. On the other hand, the proposed MCDM methods can solve single-valued neutrosophic problems where the weight information is incompletely known or completely known. The limitation of this paper is that it cannot consider the multiple DMs in the decision-making process. In the future, the other fuzzy measures of SVNNs and their corresponding group decision-making methods should be further investigated.

Author Contributions

C.T. and J.-j.P. developed methodology and provided the original draft preparation. H.-y.S. designed the study. Z.-q.Z. and J.-q.W. analyzed the data. All authors approved the publication work.

Funding

This work is supported by the National Natural Science Foundation of China (Grant Nos. 71701065, 71871228, 61972336 and 61603331), and the Postdoctoral Science Foundation of China (Grant No. 2017M610511).

Conflicts of Interest

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

References

  1. Figueira, J.; Greco, S.; Ehrgott, M. Multiple criteria decision analysis: state of the art surveys; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2005; pp. 3–24. [Google Scholar]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–356. [Google Scholar] [CrossRef]
  3. Hu, Z.; Rao, C.J.; Tao, C.Y.; Childs, P.R.N.; Zhao, Y. A CBDT based process model to aid product conceptual design. Cluster Comput. 2017. [Google Scholar] [CrossRef]
  4. Rao, C.J.; Xiao, X.P.; Goh, M.; Zheng, J.J.; Wen, J.H. Compound mechanism design of supplier selection based on multi-attribute auction and risk management of supply chain. Comput. Ind. Eng. 2017, 105, 63–75. [Google Scholar] [CrossRef]
  5. Peng, H.G.; Shen, K.W.; He, S.S.; Zhang, H.Y.; Wang, J.Q. Investment risk evaluation for new energy resources: An integrated decision support model based on regret theory and ELECTRE III. Energy Convers. Manag. 2019, 183, 332–348. [Google Scholar] [CrossRef]
  6. Shen, K.W.; Wang, X.K.; Qiao, D.; Wang, J.Q. Extended Z-MABAC method based on regret theory and directed distance for regional circular economy development program selection with Z-information. IEEE Trans. Fuzzy Syst. 2019. [Google Scholar] [CrossRef]
  7. Wang, L.; Wang, X.K.; Peng, J.J.; Wang, J.Q. The differences in hotel selection among various types of travellers: A comparative analysis with a useful bounded rationality behavioural decision support model. Tour. Manag. 2020, 76, 103961. [Google Scholar] [CrossRef]
  8. Tian, C.; Peng, J.J.; Zhang, S.; Zhang, W.Y.; Wang, J.Q. Weighted picture fuzzy aggregation operators and their applications to multi-criteria decision-making problems. Comput. Ind. Eng. 2019, 137, 106037. [Google Scholar] [CrossRef]
  9. Jana, C.; Pal, M.; Wang, J.Q. Bipolar fuzzy Dombi prioritized weighted aggregation operators in multiple attribute decision making. Soft Comput. 2019. [Google Scholar] [CrossRef]
  10. Chen, S.X.; Wang, J.Q.; Wang, T.L. Cloud-based ERP system selection based on extended probabilistic linguistic MULTIMOORA method and Choquet integral operator. Comput. Appl. Math. 2019, 38, 88. [Google Scholar] [CrossRef]
  11. Tian, C.; Peng, J.J. An Integrated picture fuzzy ANP-TODIM multi-criteria decision-making approach for tourism attraction recommendation. Technol. Econ. Dev. Econ. 2020. [Google Scholar] [CrossRef]
  12. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Set Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  13. Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999; pp. 1–141. [Google Scholar]
  14. Smarandache, F. A Unifying Field in Logics: Neutrosophic logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics, 3rd ed.; Xiquan: Phoenix, AZ, USA, 2003; pp. 1–156. [Google Scholar]
  15. Rivieccio, U. Neutrosophic logics: Prospects and problems. Fuzzy Set Syst. 2008, 159, 1860–1868. [Google Scholar] [CrossRef]
  16. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  17. Şahin, R.; Liu, P. Correlation coefficient of single-valued neutrosophic hesitant fuzzy sets and its applications in decision making. Neural Comput. Appl. 2017, 28, 1387–1395. [Google Scholar] [CrossRef]
  18. Liu, P.; Li, H. Multiple attribute decision-making method based on some normal neutrosophic Bonferroni mean operators. Neural Comput. Appl. 2017, 28, 179–194. [Google Scholar] [CrossRef]
  19. Ji, P.; Wang, J.Q.; Zhang, H.Y. Frank prioritized Bonferroni mean operator with single-valued neutrosophic sets and its application in selecting third party logistics. Neural Comput. Appl. 2018, 30, 799–823. [Google Scholar] [CrossRef]
  20. Garg, H. Some hybrid weighted aggregation operators under neutrosophic set environment and their applications to multicriteria decision-making. Appl. Intell. 2018, 48, 4871–4888. [Google Scholar] [CrossRef]
  21. Liu, P.; Tang, G.; Liu, W. Induced generalized interval neutrosophic Shapley hybrid operators and their application in multi-attribute decision making. Sci. Iran. Trans. E Ind. Eng. 2017, 24, 2164–2181. [Google Scholar] [CrossRef] [Green Version]
  22. Jun, Y.B.; Smarandache, F.; Kim, C.S. Neutrosophic cubic sets. New Math. Nat. Comput. 2017, 13, 41–54. [Google Scholar] [CrossRef]
  23. Ye, J. Operations and aggregation method of neutrosophic cubic numbers for multiple attribute decision-making. Soft Comput. 2018, 22, 7435–7444. [Google Scholar] [CrossRef]
  24. Ye, J. Multiple-attribute decision-making method under a single-valued neutrosophic hesitant fuzzy environment. J. Intell. Syst. 2015, 24, 23–36. [Google Scholar] [CrossRef]
  25. Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic set. Neu. Sets Syst. 2014, 3, 62–67. [Google Scholar]
  26. Pramanik, S.; Roy, R.; Roy, K.T.; Smarandache, F. Multi attribute decision making strategy on projection and bidirectional projection measures of interval rough neutrosophic sets. Neu. Sets Syst. 2018, 19, 101–109. [Google Scholar]
  27. Peng, H.G.; Zhang, H.Y.; Wang, J.Q. Probability multi-valued neutrosophic sets and its application in multi-criteria group decision-making problems. Neural Comput. Appl. 2018, 30, 563–583. [Google Scholar] [CrossRef]
  28. Liu, P.; Khan, Q.; Mahmood, T. Multiple-attribute decision making based on single-valued neutrosophic Schweizer-Sklar prioritized aggregation operator. Cogn. Syst. Res. 2019, 57, 175–196. [Google Scholar] [CrossRef]
  29. Ji, P.; Zhang, H.Y.; Wang, J.Q. A fuzzy decision support model with sentiment analysis for items comparison in e-commerce: The case study of PConline.com. IEEE Trans. Syst. Man Cybemetics Syst. 2019, 49, 1993–2004. [Google Scholar] [CrossRef]
  30. Chen, T.; He, S.S.; Wang, J.Q.; Li, L.; Luo, H.Y. Novel operations for linguistic neutrosophic sets on the basis of Archimedean copulas and co-copulas and their application in multi-criteria decision-making problems. J. Intell. Fuzzy Syst. 2019, 37, 2887–2912. [Google Scholar] [CrossRef]
  31. Liu, P.; Mahmood, T.; Khan, Q. Group decision making based on power Heronian aggregation operators under linguistic neutrosophic environment. Int. J. Fuzzy Syst. 2018, 20, 970–985. [Google Scholar] [CrossRef]
  32. Liu, P.; Khan, Q.; Ye, J.; Mahmood, T. Group decision-making method under hesitant interval neutrosophic uncertain linguistic environment. Int. J. Fuzzy Syst. 2018, 20, 2337–2353. [Google Scholar] [CrossRef]
  33. Garg, H. Linguistic single-valued neutrosophic prioritized aggregation operators and their applications to multiple-attribute group decision-making. J. Ambient Intel. Hum. Comp. 2018, 9, 1975–1997. [Google Scholar] [CrossRef]
  34. Liu, P.D.; Wang, Y.M. Multiple attribute decision-making method based on single-valued neutrosophic normalized weighted Bonferroni mean. Neural Comput. Appl. 2014, 25, 2001–2010. [Google Scholar] [CrossRef]
  35. Peng, J.J.; Wang, J.Q.; Wang, J.; Zhang, H.Y.; Chen, X.H. Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int. J. Syst. Sci. 2016, 47, 2342–2358. [Google Scholar] [CrossRef]
  36. Garg, H. Novel single-valued neutrosophic decision making operators under Frank norm operations and its application. Int. J. Uncertain Quantif 2016, 6, 361–375. [Google Scholar]
  37. Peng, J.J.; Wang, J.Q.; Zhang, H.Y.; Chen, X.H. An outranking approach for multi-criteria decision-making problems with simplified neutrosophic sets. Appl. Soft Comput. 2014, 25, 336–346. [Google Scholar] [CrossRef]
  38. Ye, J. Projection and bidirectional projection measures of single-valued neutrosophic sets and their decision-making method for mechanical design schemes. J. Exp. Theor. Artif. Intell. 2017, 29, 731–740. [Google Scholar] [CrossRef]
  39. Wu, X.H.; Wang, J.Q.; Peng, J.J.; Chen, X.H. Cross-entropy and prioritized aggregation operator with amplified neutrosophic sets and their application in multi-criteria decision-making problems. Int. J. Fuzzy Syst. 2016, 18, 1104–1116. [Google Scholar] [CrossRef]
  40. Yager, R.R. Induced aggregation operators. Fuzzy Set Syst. 2003, 137, 59–69. [Google Scholar] [CrossRef]
  41. Grabisch, M. Fuzzy integral in multicriteria decision making. Fuzzy Set Syst. 1995, 69, 279–298. [Google Scholar] [CrossRef]
  42. Choquet, G. Theory of capacities. Ann. Inst. Fourier 1954, 5, 131–295. [Google Scholar] [CrossRef] [Green Version]
  43. Shapley, L.S. A value for n-person game. In Contributions to the Theory of Games II, Annals of Mathematics Studies; Princeton University Press: Princeton, NJ, USA, 1953; Volume 28, pp. 307–317. [Google Scholar]
  44. Zhang, E.; Teng, F.; Liu, P. Multiple attribute group decision-making method based on neutrosophic number generalized hybrid weighted averaging operator. Neural Comput. Appl. 2017, 28, 2063–2074. [Google Scholar] [CrossRef]
  45. Meyer, P.; Roubens, M. On the use of the Choquet integral with fuzzy numbers in multiple criteria decision support. Fuzzy Set Syst. 2006, 157, 927–938. [Google Scholar] [CrossRef] [Green Version]
  46. Deepa, J.; Sanjay, K. Interval-valued intuitionistic hesitant fuzzy Choquet integral based TOPSIS method for multi-criteria group decision making. Eur. J. Oper. Res. 2016, 248, 183–191. [Google Scholar]
  47. Meng, F.Y.; Zhang, Q.; Cheng, H. Approaches to multiple-criteria group decision making based on interval-valued intuitionistic fuzzy Choquet integral with respect to the generalized k-Shapley index. Knowl-Based Syst. 2013, 37, 237–249. [Google Scholar] [CrossRef]
  48. Qu, G.H.; Wang, Y.H.; Qu, W.H.; Lia, C.H.; Zhou, H.S. Some new generalized dual hesitant fuzzy generalized Choquet integral operators based on Shapley fuzzy measures. J. Intell. Fuzzy Syst. 2018, 35, 5477–5493. [Google Scholar] [CrossRef]
  49. Nie, R.X.; Tian, Z.P.; Wang, J.Q.; Hu, J.H. Pythagorean fuzzy multiple criteria decision analysis based on Shapley fuzzy measures and partitioned normalized weighted Bonferroni mean operator. Int. J. Intell. Syst. 2019, 34, 297–324. [Google Scholar] [CrossRef]
  50. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multisp. Multistr. 2010, 4, 410–413. [Google Scholar]
  51. Hwang, C.L.; Yoon, K. Multiple Attribute Decision Making: Methods and Applications, a State of the Art Survey; Springer: New York, NY, USA, 1981; pp. 1–10. [Google Scholar]
  52. Liu, P.; Chu, Y.; Li, Y.; Chen, Y. Some generalized neutrosophic number Hamacher aggregation operators and their application to group decision making. Int. J. Fuzzy Syst. 2014, 16, 242–255. [Google Scholar]
Figure 1. The scheme of proposed method.
Figure 1. The scheme of proposed method.
Mathematics 07 01081 g001
Figure 2. Score values of ψ 1 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Figure 2. Score values of ψ 1 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Mathematics 07 01081 g002
Figure 3. Score values of ψ 2 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Figure 3. Score values of ψ 2 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Mathematics 07 01081 g003aMathematics 07 01081 g003b
Figure 4. Score values of ψ 3 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Figure 4. Score values of ψ 3 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Mathematics 07 01081 g004
Figure 5. Score values of ψ 4 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Figure 5. Score values of ψ 4 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Mathematics 07 01081 g005
Figure 6. Score values of ψ 5 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Figure 6. Score values of ψ 5 with γ , λ ( 0 ,   10 ] by using two proposed operators.
Mathematics 07 01081 g006
Figure 7. Comparison analysis.
Figure 7. Comparison analysis.
Mathematics 07 01081 g007
Table 1. Decision-making matrix.
Table 1. Decision-making matrix.
c 1 c 2 c 3 c 4
ψ 1 (0.75,0.15,0.20)(0.68,0.13,0.25)(0.64,0.11,0.15)(0.65,0.09,0.18)
ψ 2 (0.62,0.21,0.17)(0.75,0.10,0.23)(0.58,0.20,0.22)(0.82,0.10,0.09)
ψ 3 (0.68,0.05,0.24)(0.71,0.20,0.17)(0.61,0.23,0.21)(0.74,0.2,0.05)
ψ 4 (0.72,0.11,0.21)(0.79,0.10,0.23)(0.73,0.14,0.2)(0.67,0.13,0.10)
ψ 5 (0.76,0.23,0.19)(0.65,0.16,0.22)(0.77,0.13,0.20)(0.71,0.06,0.22)
Table 2. Positive ideal solution and negative ideal solution.
Table 2. Positive ideal solution and negative ideal solution.
ψ ¯ + ψ ¯
c 1 (0.76,0.05,0.17)(0.62,0.23,0.24)
c 2 (0.79,0.10,0.17)(0.65,0.10,0.17)
c 3 (0.67,0.11,0.15)(0.58,0.23,0.22)
c 4 (0.82,0.06,0.05)(0.64,0.20,0.22)
Table 3. Closeness coefficient.
Table 3. Closeness coefficient.
c 1 c 2 c 3 c 4
ψ 1 0.30400.70550.56480.7342
ψ 2 0.79960.31320.92070.1437
ψ 3 0.42760.56580.85330.4606
ψ 4 0.31970.18570.24730.6565
ψ 5 0.42250.83590.13520.5942
Table 4. Weighted supports.
Table 4. Weighted supports.
c 1 c 2 c 3 c 4
ψ 1 0.61680.26040.69170.7351
ψ 2 0.59080.49070.83000.3231
ψ 3 0.57270.74600.70150.3391
ψ 4 0.56720.49690.83330.3664
ψ 5 0.22880.47470.86030.6942
Table 5. Weights.
Table 5. Weights.
c 1 c 2 c 3 c 4
ψ 1 0.02150.70620.23230.0400
ψ 2 0.16230.21260.01280.6122
ψ 3 0.16950.00690.19940.6242
ψ 4 0.12180.26290.01300.6023
ψ 5 0.70430.24520.01180.0388
Table 6. Score values by using GWSVNPSCW operator.
Table 6. Score values by using GWSVNPSCW operator.
Parameter ψ 1 ψ 2 ψ 3 ψ 4 ψ 5 Final Rankings
γ = λ = 1 0.77690.83600.83510.82170.7808 ψ 2 ψ 3 ψ 4 ψ 5 ψ 1
γ = λ = 2 0.77700.84850.82060.81980.7800 ψ 2 ψ 3 ψ 4 ψ 5 ψ 1
γ = λ = 4 0.78180.85470.80930.81350.8045 ψ 2 ψ 4 ψ 3 ψ 5 ψ 1
γ = λ = 6 0.78250.85610.81200.81440.8062 ψ 2 ψ 4 ψ 3 ψ 5 ψ 1
γ = λ = 8 0.78320.85740.81480.81530.8080 ψ 2 ψ 4 ψ 3 ψ 5 ψ 1
γ = λ = 10 0.78390.85870.81760.81630.8096 ψ 2 ψ 3 ψ 4 ψ 5 ψ 1
Table 7. Score values by using GWSVNPSCG operator.
Table 7. Score values by using GWSVNPSCG operator.
Parameter ψ 1 ψ 2 ψ 3 ψ 4 ψ 5 Final Rankings
γ = λ = 1 0.77780.82190.81260.81370.7720 ψ 2 ψ 4 ψ 3 ψ 1 ψ 5
γ = λ = 2 0.77280.82840.78760.80720.7727 ψ 2 ψ 4 ψ 3 ψ 1 ψ 5
γ = λ = 4 0.77430.82050.76610.79810.7763 ψ 2 ψ 4 ψ 5 ψ 1 ψ 3
γ = λ = 6 0.77170.80440.75720.79350.7718 ψ 2 ψ 4 ψ 5 ψ 1 ψ 3
γ = λ = 8 0.76960.79060.75100.79040.7687 ψ 2 ψ 4 ψ 1 ψ 5 ψ 3
γ = λ = 10 0.76790.78820.74640.77980.7662 ψ 2 ψ 4 ψ 1 ψ 5 ψ 3

Share and Cite

MDPI and ACS Style

Peng, J.-j.; Tian, C.; Zhang, Z.-q.; Song, H.-y.; Wang, J.-q. Single-Valued Neutrosophic Power Shapley Choquet Average Operators and Their Applications to Multi-Criteria Decision-Making. Mathematics 2019, 7, 1081. https://doi.org/10.3390/math7111081

AMA Style

Peng J-j, Tian C, Zhang Z-q, Song H-y, Wang J-q. Single-Valued Neutrosophic Power Shapley Choquet Average Operators and Their Applications to Multi-Criteria Decision-Making. Mathematics. 2019; 7(11):1081. https://doi.org/10.3390/math7111081

Chicago/Turabian Style

Peng, Juan-juan, Chao Tian, Zhi-qiang Zhang, Hai-yu Song, and Jian-qiang Wang. 2019. "Single-Valued Neutrosophic Power Shapley Choquet Average Operators and Their Applications to Multi-Criteria Decision-Making" Mathematics 7, no. 11: 1081. https://doi.org/10.3390/math7111081

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop