Next Article in Journal
On (Λ,Υ,ℜ)-Contractions and Applications to Nonlinear Matrix Equations
Next Article in Special Issue
The Trapezoidal Fuzzy Two-Dimensional Linguistic Power Generalized Hamy Mean Operator and Its Application in Multi-Attribute Decision-Making
Previous Article in Journal
Algorithms and Data Structures for Sparse Polynomial Arithmetic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators

1
School of Business, Sichuan Normal University, Chengdu 610101, China
2
School of Economics and Management, Chongqing University of Arts and Sciences, Chongqing 402160, China
3
School of Statistics, Southwestern University of Finance and Economics, Chengdu 611130, China
*
Authors to whom correspondence should be addressed.
Mathematics 2019, 7(5), 442; https://doi.org/10.3390/math7050442
Submission received: 24 April 2019 / Revised: 10 May 2019 / Accepted: 11 May 2019 / Published: 17 May 2019

Abstract

:
In this article, we expand the Muirhead mean (MM) operator and dual Muirhead mean (DMM) operator with single-valued neutrosophic 2-tuple linguistic numbers (SVN2TLNs) to propose the single-valued neutrosophic 2-tuple linguistic Muirhead mean (SVN2TLMM) operator, the single-valued neutrosophic 2-tuple linguistic weighted Muirhead mean (SVN2TLWMM) operator, the single-valued neutrosophic 2-tuple linguistic dual Muirhead mean (SVN2TLDMM) operator, and the single-valued neutrosophic 2-tuple linguistic weighted dual Muirhead mean (SVN2TLWDMM) operator. Multiple attribute decision making (MADM) methods are then proposed using these operators. Finally, we utilize an applicable example for green supplier selection in green supply chain management to prove the proposed methods.

1. Introduction

In order to effectively depict the fuzziness and uncertainty information in real multiple attribute decision making (MADM) problems, Smarandache [1,2] proposed the use of neutrosophic sets (NSs), which have attracted the attention of many scholars. The main advantage of NSs is their capacity to denote inconsistent and indeterminate information. An NS has more potential power than any other fuzzy mathematical tool, such as the fuzzy set [3], the intuitionistic fuzzy set (IFS) [4], and the interval-valued neutrosophic fuzzy set (IVIFS) [5]. However, it is hard to use NSs to solve practical MADM problems. Therefore, Wang et al. [6,7] proposed the use of a single-valued neutrosophic set (SVNS) and an interval neutrosophic set (INS), which can include much more information than fuzzy sets, IFSs, and IVIFSs. Ye [8] proposed the use of MADM with the correlation coefficients of SVNSs. Broumi and Smarandache [9] investigated the correlation coefficients of interval neutrosophic numbers (INNs). Biswas et al. [10] proposed the use of single-valued neutrosophic number TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) models. Liu et al. [11] developed the generalized Hamacher operations for SVNSs. Sahin and Liu [12] presented the maximizing deviation method using neutrosophic settings. Ye [13] defined some similarity measures of INSs. Zhang et al. [14] defined some interval neutrosophic information aggregating operators. Ye [15] proposed the use of a simplified neutrosophic set (SNS), which included SVNSs and INSs. Many researchers have given their attention to SNSs. For example, Peng et al. [16] presented some basic operational laws of simplified neutrosophic number (SNNs) and proposed the use of simplified neutrosophic aggregation operators. Additionally, Peng et al. [17] studied an outranking method to handle simplified neutrosophic information, and then Zhang et al. [18] presented an extended version of Peng’s method using an interval neutrosophic environment. Liu and Liu [19] developed a generalized weighted power operator with SVNNs. Deli and Subas [20] discussed a method to rank SVNNs. Peng et al. [21] proposed the use of multi-valued neutrosophic sets and defined some power operators for multiple attribute group decision making (MAGDM). Zhang et al. [22] defined the weighted correlation coefficient for INNs. Chen and Ye [23] proposed the use of Dombi operations with SVNNs. Liu and Wang [24] proposed the use of the SVN normalized weighted Bonferroni mean (WBM). Wu et al. [25] proposed the use of prioritized operator and cross-entropy with SNSs in MADM problems. Li et al. [26] developed some SVNN Heronian mean operators in MADM problems. Xu et al. [27] proposed the use of the TODIM (an acronym in Portuguese for Interactive Multi-Criteria Decision Making) method for SVN MADM.
Even though SVNSs have been widely used in some areas, all the existing methods are unsuitable for expressing the truth-membership, indeterminacy-membership, and falsity-membership of an element to a 2-tuple linguistic term set, which can affect a decisionmaker’s confidence level when they are making evaluations. In order to overcome this limit, Wu et al. [28] defined the basic concept of single-valued neutrosophic 2-tuple linguistic sets (SVN2TLSs) to cope with this problem on the basis of the SVNSs [6] and 2-tuple linguistic term set [29,30]. Therefore, how to aggregate these single-valued neutrosophic 2-tuple linguistic numbers (SVN2TLNs) is an interesting issue. To solve it, we propose the use of some Muirhead mean (MM) operators with SVN2TLNs. In order to do this, the remainder of this paper is presented as follows: In Section 2, we introduce the concept of SVN2TLSs. In Section 3, we develop some MM operators with SVN2TLNs. In Section 4, we present a numerical example to select green suppliers with SVN2TLNs in order to illustrate the method proposed. Section 5 finishes this paper with some concluding remarks.

2. Preliminaries

Wu et al. [28] proposed the use of the concept of SVN2TLSs based on the SVNSs [6] and 2-tuple linguistic term sets [29,30].

2.1. Single-Valued Neutrosophic 2-Tuple Linguistic Sets

Definition 1 
([28]).ASVN2TLS A in X is givenas follows:
A = { ( s θ ( x ) , ρ ) , ( T A ( x ) , I A ( x ) , F A ( x ) , x X ) }
where s θ ( x ) S , T A ( x ) [ 0 , 1 ] , I A ( x ) [ 0 , 1 ] , and F A ( x ) [ 0 , 1 ] , with corresponding condition 0 T A ( x ) + I A ( x ) + F A ( x ) 3 , x X . The values T A ( x ) , I A ( x ) , and F A ( x ) represent, respectively, the truth-membership, the indeterminacy-membership, and the falsity-membership of the element x to the linguistic variable ( s θ ( x ) , ρ ) .
For convenience, Wu et al. [28] called a ˜ = ( s a , ρ a ) , ( T a , I a , F a ) a single-valued neutrosophic 2-tuple linguistic number, where T a ( 0 , 1 ) , I a ( 0 , 1 ) , F a ( 0 , 1 ) 0 T a + I a + F a 3 s θ ( x ) S , and ρ [ 0.5 , 0.5 ) .
Definition 2 
([31]).Let a ˜ 1 = ( s a 1 , ρ 1 ) , ( T a 1 , I a 1 , F a 1 ) and a ˜ 2 = ( s a 2 , ρ 2 ) , ( T a 2 , I a 2 , F a 2 ) be two SVN2TLNs, S ( a ˜ 1 ) = Δ Δ 1 ( s θ ( a 1 ) , ρ 1 ) ( 2 + T a 1 I a 1 F a 1 ) 3 , S ( a ˜ 1 ) [ 0 , t ] and S ( a ˜ 2 ) = Δ Δ 1 ( s θ ( a 2 ) , ρ 2 ) ( 2 + T a 2 I a 2 F a 2 ) 3 , S ( a ˜ 2 ) [ 0 , t ] be the scores values of a ˜ 1 and a ˜ 2 , respectively, and let H ( a ˜ 1 ) = Δ Δ 1 ( s θ ( a 1 ) , ρ 1 ) ( T a 1 F a 1 ) , H ( a ˜ 1 ) [ t , t ] and H ( a ˜ 2 ) = Δ Δ 1 ( s θ ( a 2 ) , ρ 2 ) ( T a 2 F a 2 ) , H ( a ˜ 2 ) [ t , t ] be the accuracy degrees of a ˜ 1 and a ˜ 2 , respectively. Then, if S ( a ˜ 1 ) < S ( a ˜ 2 ) , a ˜ 1 < a ˜ 2 ; if S ( a ˜ 1 ) = S ( a ˜ 2 ) ,then (1) if H ( a ˜ 1 ) = H ( a ˜ 2 ) , a ˜ 1 = a ˜ 2 , and (2) if H ( a ˜ 1 ) < H ( a ˜ 2 ) , a ˜ 1 < a ˜ 2 .
Definition 3 
([32]).Let a ˜ 1 = ( s a 1 , ρ 1 ) , ( T a 1 , I a 1 , F a 1 ) and a ˜ 2 = ( s a 2 , ρ 2 ) , ( T a 2 , I a 2 , F a 2 ) be two SVN2TLNs; then, the following is true:
(1)
a ˜ 1 a ˜ 2 = Δ ( Δ 1 ( s θ ( a 1 ) , ρ 1 ) + Δ 1 ( s θ ( a 2 ) , ρ 2 ) ) , ( T a 1 + T a 2 T a 1 T a 2 , I a 1 I a 2 , F a 1 F a 2 )
(2)
a ˜ 1 a ˜ 2 = Δ ( Δ 1 ( s θ ( a 1 ) , ρ 1 ) Δ 1 ( s θ ( a 2 ) , ρ 2 ) ) , ( T a 1 T a 2 , I a 1 + I a 2 I a 1 I a 2 , F a 1 + F a 2 F a 1 F a 2 ) ;
(3)
λ a ˜ 1 = Δ ( λ Δ 1 ( s θ ( a 1 ) , ρ 1 ) ) , ( 1 ( 1 T a 1 ) λ , ( I a 1 ) λ , ( F a 1 ) λ ) , λ > 0 ;
(4)
( a ˜ 1 ) λ = Δ ( Δ 1 ( s θ ( a 1 ) , ρ 1 ) λ ) , ( ( T a 1 ) λ , 1 ( 1 I a 1 ) λ , 1 ( 1 F a 1 ) λ ) , λ > 0 ,
where Δ 1 is the function of converting the 2-tuple linguistic variables to the exact numbers and Δ is the function of converting the computing results to the 2-tuple linguistic variables.

2.2. MM Operators

Muirhead [33] proposed the use of the MM operator. Tang et al. [34] developed some interval-valued Pythagorean fuzzy Muirhead mean operators. Wang et al. [35] proposed the use of some picture fuzzy Muirhead mean operators in MADM problems.
Definition 4 
([33]).Let a j ( j = 1 , 2 , , n ) be a set of nonnegative real numbers, and P = ( p 1 , p 2 , , p n ) R n be a vector of parameters if:
MM P ( a 1 , a 2 , , a n ) = ( 1 n ! σ S n j = 1 n a σ ( j ) p j ) 1 j = 1 n p j .
MMP is the MM operator, where σ ( j ) ( j = 1 , 2 , , n ) is any permutation of { 1 , 2 , , n } and S n is the set of all permutations of { 1 , 2 , , n } .

3. Some Muirhead Mean Operators with SVN2TLNs

3.1. The Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean (SVN2TLMM) Operator

This section covers MM and its fusing with SVN2TLNs and proposes the SVN2TLMM operator.
Definition 5. 
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. The SVN2TLMM operator is
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j .
Theorem 1. 
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. The aggregated value by using SVN2TLMM operators is also a SVN2TLN where
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j = { Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) ) 1 j = 1 n p j ) , ( ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j ) }
Proof. 
Based on the exponential operation laws of SVN2TLNs, we can derive
a ˜ σ ( j ) p j = { Δ ( ( Δ 1 ( s j , ρ j ) ) p j ) , ( ( T σ ( j ) ) p j , 1 ( 1 I σ ( j ) ) p j , 1 ( 1 F σ ( j ) ) p j ) } .
 □
Therefore, by utilizing the multiplication operation laws of SVN2TLNs, the j = 1 n a ˜ σ ( j ) p j can be derived as follows:
j = 1 n a ˜ σ ( j ) p j = { Δ ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) , ( j = 1 n ( T σ ( j ) ) p j , 1 j = 1 n ( 1 I σ ( j ) ) p j , 1 j = 1 n ( 1 F σ ( j ) ) p j ) } .
Therefore, according to the addition operation laws of SVN2TLNs, we can obtain
σ S n ( j = 1 n a ˜ σ ( j ) p j ) = { Δ ( σ S n ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) ) , ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) , σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) , σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) ) }
Furthermore, based on the scalar-multiplication operation of SVN2TLNs, we can derive
1 n ! ( σ S n ( j = 1 n a ˜ σ ( j ) p j ) ) = { Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) ) ) , ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! , σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) 1 n ! , σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) 1 n ! ) }
Therefore, the aggregated value by using SVN2TLMM operators can be listed as follows:
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j = { Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) ) 1 j = 1 n p j ) , ( ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j ) }
Therefore, Equation (4) is kept. In Equations (4)–(9), the Δ 1 is the function of converting the 2-tuple linguistic variables to the exact numbers and Δ is the function of converting the computing results to the 2-tuple linguistic variables.
Then, we need to prove that Equation (4) is a SVN2TLN. We need to prove two conditions as follows:
  0 T 1 , 0 I 1 , 0 F 1   0 T + I + F 3
Let
T = ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j I = 1 ( 1 σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j F = 1 ( 1 σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j
Proof. 
① Because 0 T σ ( j ) 1 , we get
0 ( T σ ( j ) ) p j 1   a n d   0 1 j = 1 n ( T σ ( j ) ) p j 1 .
Then,
0 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! 1
0 ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j 1 .
That means 0 T 1 , so ① is maintained. Similarly, we can find that 0 I 1 , 0 F 1 .
  Because   0 T 1 , 0 I 1 , 0 F 1 , 0 T + I + F 3 .
 □
Example 1. 
Let ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) be three SVN2TLNs, and P = ( 0.3 , 0.4 , 0.2 ) ; then, according to Equation (4), we have
SVN 2 TLMM ( 0.3 , 0.4 , 0.2 ) ( ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) ) = { Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( s j , ρ j ) ) p j ) ) 1 j = 1 n p j ) , ( ( 1 σ S n ( 1 j = 1 n ( T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 I σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 F σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j ) } = ( Δ ( 1 3 ! ( 3 0.3 × 4 0.4 × 2 0.2 + 3 0.3 × 2 0.4 × 4 0.2 + 4 0.3 × 3 0.4 × 2 0.2 + 4 0.3 × 2 0.4 × 3 0.2 + 2 0.3 × 3 0.4 × 4 0.2 + 2 0.3 × 4 0.4 × 3 0.2 ) 1 0.3 + 0.4 + 0.2 ) , ( ( 1 ( ( 1 0.7 0.3 × 0.8 0.4 × 0.6 0.2 ) × ( 1 0.7 0.3 × 0.6 0.4 × 0.8 0.2 ) × ( 1 0.8 0.3 × 0.7 0.4 × 0.6 0.2 ) × ( 1 0.8 0.3 × 0.6 0.4 × 0.7 0.2 ) × ( 1 0.6 0.3 × 0.7 0.4 × 0.8 0.2 ) × ( 1 0.6 0.3 × 0.8 0.4 × 0.7 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , 1 ( 1 ( ( 1 ( 1 0.5 ) 0.4 × ( 1 0.6 ) 0.3 × ( 1 0.7 ) 0.2 ) × ( 1 ( 1 0.5 ) 0.4 × ( 1 0.7 ) 0.3 × ( 1 0.6 ) 0.2 ) × ( 1 ( 1 0.6 ) 0.4 × ( 1 0.5 ) 0.3 × ( 1 0.7 ) 0.2 ) × ( 1 ( 1 0.6 ) 0.4 × ( 1 0.7 ) 0.3 × ( 1 0.5 ) 0.2 ) × ( 1 ( 1 0.7 ) 0.4 × ( 1 0.5 ) 0.3 × ( 1 0.6 ) 0.2 ) × ( 1 ( 1 0.7 ) 0.4 × ( 1 0.6 ) 0.3 × ( 1 0.5 ) 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , 1 ( 1 ( ( 1 ( 1 0.3 ) 0.4 × ( 1 0.2 ) 0.3 × ( 1 0.1 ) 0.2 ) × ( 1 ( 1 0.3 ) 0.4 × ( 1 0.1 ) 0.3 × ( 1 0.2 ) 0.2 ) × ( 1 ( 1 0.2 ) 0.4 × ( 1 0.3 ) 0.3 × ( 1 0.1 ) 0.2 ) × ( 1 ( 1 0.2 ) 0.4 × ( 1 0.1 ) 0.3 × ( 1 0.3 ) 0.2 ) × ( 1 ( 1 0.1 ) 0.4 × ( 1 0.3 ) 0.3 × ( 1 0.2 ) 0.2 ) × ( 1 ( 1 0.1 ) 0.4 × ( 1 0.2 ) 0.3 × ( 1 0.3 ) 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ) ) = ( s 4 , 0.475 ) , ( 0.6958 , 0.6080 , 0.2034 ) .
Then, we can identify some properties of the SVN2TLMM operator.
Property 1. 
(Idempotency) If a ˜ σ ( j ) = ( s j , ρ j ) , ( T σ ( j ) , I σ ( j ) , F σ ( j ) ) ( j = 1 , 2 , , n ) are equal, then
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = a ˜ .
Proof. 
Because a ˜ σ ( j ) = a ˜ = ( s , ρ ) , ( T , I , F ) , then
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = { Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( s , ρ ) ) p j ) ) 1 j = 1 n p j ) , ( ( 1 σ S n ( 1 j = 1 n T p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 I ) p j ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 σ S n ( 1 j = 1 n ( 1 F ) p j ) 1 n ! ) 1 j = 1 n p j ) } = { Δ ( 1 n ! ( n ! ( ( Δ 1 ( s , ρ ) ) j = 1 n p j ) ) 1 j = 1 n p j ) , ( ( 1 ( ( 1 T j = 1 n p j ) 1 n ! ) n ! ) 1 j = 1 n p j , 1 ( 1 ( ( 1 ( 1 I ) j = 1 n p j ) 1 n ! ) n ! ) 1 j = 1 n p j , 1 ( 1 ( ( 1 ( 1 F ) j = 1 n p j ) 1 n ! ) n ! ) 1 j = 1 n p j ) } = Δ ( Δ 1 ( s , ρ ) ) , ( T , I , F ) = a ˜ .
 □
Property 2. 
(Monotonicity) Let a ˜ j = ( s a j , ρ a j ) , ( T a j , I a j , F a j ) ( j = 1 , 2 , , n ) and b ˜ j = ( s b j , ρ b j ) , ( T b j , I b j , F b j ) ( j = 1 , 2 , , n ) be two sets of SVN2TLNs. If Δ 1 ( S a j , ρ a j ) Δ 1 ( S b j , ρ b j ) and T a j T b j a n d I a j I b j a n d F a j F b j hold for all j , then
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) SVN 2 TLMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
Proof. 
Let SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( s a , ρ a ) , ( T a , I a , F a ) and SVN 2 TLMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) = ( s b , ρ b ) , ( T b , I b , F b ) . Given that Δ 1 ( S a i , ρ a i ) Δ 1 ( S b i , ρ b i ) , we can obtain
j = 1 n ( Δ 1 ( S a i , ρ a i ) ) p j j = 1 n ( Δ 1 ( S b i , ρ b i ) ) p j
σ S n ( j = 1 n ( Δ 1 ( S a i , ρ a i ) ) p j ) σ S n ( j = 1 n ( Δ 1 ( S b i , ρ b i ) ) p j ) .
Therefore,
Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( S a i , ρ a i ) ) p j ) ) 1 j = 1 n p j ) Δ ( 1 n ! ( σ S n ( j = 1 n ( Δ 1 ( S b i , ρ b i ) ) p j ) ) 1 j = 1 n p j ) .
That means ( S a , ρ a ) ( S b , ρ b ) . Given that T a i T b i , we can also obtain
j = 1 n T a i p j j = 1 n T b i p j
σ S n ( 1 j = 1 n T a i p j ) 1 n ! σ S n ( 1 j = 1 n T b i p j ) 1 n !
( 1 σ S n ( 1 j = 1 n T a i p j ) 1 n ! ) 1 j = 1 n p j ( 1 σ S n ( 1 j = 1 n T b i p j ) 1 n ! ) 1 j = 1 n p j .
That is T a T b . Similarly, we can obtain I a I b and F a F b .
If Δ 1 ( S a i , ρ a i ) < Δ 1 ( S b i , ρ b i ) and T a i T b i and I a i I b i and F a i F b i ,
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) < SVN 2 TLMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
If Δ 1 ( S a i , ρ a i ) = Δ 1 ( S b i , ρ b i ) and T a i < T b i and I a i > I b i and F a i > F b i ,
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) < SVN 2 TLMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
If Δ 1 ( S a i , ρ a i ) = Δ 1 ( S b i , ρ b i ) and T a i = T b i and I a i = I b i and F a i = F b i ,
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = SVN 2 TLMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
So, Property 2 is correct. □
Property 3. 
(Boundedness) Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. If a ˜ i + = ( max i ( S i , ρ i ) , ( max i ( T i ) , min i ( I i ) , min i ( F i ) ) ) and a ˜ i = ( min i ( S i , ρ i ) , ( min i ( T i ) , max i ( I i ) , max i ( F i ) ) ) , then
a ˜ SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ + .
From Property 1:
SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = a ˜ SVN 2 TLMM P ( a ˜ + 1 , a ˜ + 2 , , a ˜ + n ) = a ˜ +
From Property 2:
a ˜ SVN 2 TLMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ + .

3.2. The Single-Valued Neutrosophic 2-Tuple Linguistic Weighted Muirhead Mean (SVN2TLWMM) Operator

In actual MADM, it is important to consider attribute weights. This section proposes the use of a SVN2TLWMM operator as follows:
Definition 6
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set ofSVN2TLNs with a weight vector of w i = ( w 1 , w 2 , , w n ) T , thereby satisfying w i [ 0 , 1 ] and i = 1 n w i = 1 , and let P = ( p 1 , p 2 , , p n ) R n be a vector of parameters if
SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n n w σ ( j ) a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j .
SVN 2 TLWMM w P is the single-valued neutrosophic 2-tuple linguistic MM, where σ ( j ) ( j = 1 , 2 , , n ) is any permutation of { 1 , 2 , , n } and S n is the set of all permutations of { 1 , 2 , , n } .
Theorem 2. 
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. The aggregated value by using SVN2TLWMM operators is also a SVN2TLN where
SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n n w σ ( j ) a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j = { Δ ( ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) ) ) 1 j = 1 n p j ) , ( ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j ) } .
Proof. 
From the exponential operation of the SVN2TLNs, we can derive
a ˜ σ ( j ) p j = Δ ( ( Δ 1 ( s j , ρ j ) ) p j ) , ( T σ ( j ) p j , 1 ( 1 I σ ( j ) ) p j , 1 ( 1 F σ ( j ) ) p j ) .
Therefore, by utilizing the scalar-multiplication operation laws of the SVN2TLNs, the n w σ ( j ) a ˜ σ ( j ) p j can be derived as
n w σ ( j ) a ˜ σ ( j ) p j = { Δ ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) , ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) , ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) , ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) }
Therefore, according to the multiplication operation of the SVN2TLNs, we can obtain
j = 1 n n w σ ( j ) a ˜ σ ( j ) p j = { Δ ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) , ( j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) , 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) , 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) . ) }
Therefore, by utilizing the addition operation of the SVN2TLNs, we can get
σ S n ( j = 1 n n w σ ( j ) a ˜ σ ( j ) p j ) = { Δ ( σ S n ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) ) , ( 1 σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) , σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) , σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) . ) }
Furthermore, based on the scalar-multiplication operation of the SVN2TLNs, we can derive
1 n ! ( σ S n ( j = 1 n n w σ ( j ) a ˜ σ ( j ) p j ) ) = { Δ ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) ) ) , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! , ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! , ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) }
Therefore, the aggregated value by using SVN2TLWMM operators can be listed as follows:
SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = ( 1 n ! ( σ S n ( j = 1 n n w σ ( j ) a ˜ σ ( j ) p j ) ) ) 1 j = 1 n p j = { Δ ( ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) ) ) 1 j = 1 n p j ) , ( ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j ) }
Therefore, Equation (23) is kept. In Equations (23)–(29), Δ 1 is the function of converting the 2-tuple linguistic variables to the exact numbers and Δ is the function of converting the computing results to the 2-tuple linguistic variables.
Then we need to prove that Equation (23) is a SVN2TLN.
  0 T 1 , 0 I 1 , 0 F 1      0 T + I + F 3 .
 □
Proof. 
Let
T = ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j I = 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j F = 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j
① Because 0 T σ ( j ) 1 , we get
0 T σ ( j ) p j 1   a n d 0 1 ( 1 T σ ( j ) p j ) n w σ ( j ) 1 .
Then,
0 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) 1
0 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! 1
0 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j 1 .
That means 0 T 1 , so ① is maintained.
Similarly, we can get 0 I 1 , 0 F 1 ,
② Because 0 T 1 , 0 I 1 , 0 F 1 , 0 T + I + F 3 . □
Example 2. 
Let ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , and ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) be three SVN2TLNs, P = ( 0.3 , 0.4 , 0.2 ) and w = ( 0.4 , 0.3 , 0.3 ) , then according to (23) we have:
    SVN 2 TLWMM ( 0 . 4 , 0 . 3 , 0 . 3 ) ( 0 . 3 , 0 . 4 , 0 . 2 ) ( ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) ) = { Δ ( ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( Δ 1 ( s j , ρ j ) ) p j ) ) ) ) 1 j = 1 n p j ) , ( ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j ) } .     ( Δ ( 1 3 ! ( 1.2 × 3 0.3 × 0.9 × 4 0.4 × 0.9 × 2 0.2 + 1.2 × 3 0.3 × 0.9 × 2 0.4 × 0.9 × 4 0.2 + 0.9 × 4 0.3 × 1.2 × 3 0.4 × 0.9 × 2 0.2 + 0.9 × 4 0.3 × 0.9 × 2 0.4 × 1.2 × 3 0.2 + 0.9 × 2 0.3 × 1.2 × 3 0.4 × 0.9 × 4 0.2 + 0.9 × 2 0.3 × 0.9 × 4 0.4 × 1.2 × 3 0.2 ) 1 0.3 + 0.4 + 0.2 ) , ( 1 ( ( 1 ( ( 1 ( 1 0.7 0.3 ) 3 × 0.4 ) × ( 1 ( 1 0.8 0.4 ) 3 × 0.3 ) × ( 1 ( 1 0.6 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 0.7 0.3 ) 3 × 0.4 ) × ( 1 ( 1 0.6 0.4 ) 3 × 0.3 ) × ( 1 ( 1 0.8 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 0.8 0.3 ) 3 × 0.3 ) × ( 1 ( 1 0.7 0.4 ) 3 × 0.4 ) × ( 1 ( 1 0.6 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 0.8 0.3 ) 3 × 0.3 ) × ( 1 ( 1 0.6 0.4 ) 3 × 0.3 ) × ( 1 ( 1 0.7 0.2 ) 3 × 0.4 ) ) ) × ( 1 ( ( 1 ( 1 0.6 0.3 ) 3 × 0.3 ) × ( 1 ( 1 0.7 0.4 ) 3 × 0.4 ) × ( 1 ( 1 0.8 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 0.6 0.3 ) 3 × 0.3 ) × ( 1 ( 1 0.8 0.4 ) 3 × 0.3 ) × ( 1 ( 1 0.7 0.2 ) 3 × 0.4 ) ) ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , )     = ( 1 ( 1 ( ( 1 ( ( 1 ( 1 ( 1 0.5 ) 0.4 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.6 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.7 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.5 ) 0.4 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.7 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.6 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.6 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 0.3 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.7 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.6 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.7 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 0.2 ) 3 × 0.4 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.7 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 0.3 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.6 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.7 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.6 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 0.2 ) 3 × 0.4 ) ) ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , 1 ( 1 ( ( 1 ( ( 1 ( 1 ( 1 0.3 ) 0.4 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.2 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.1 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.3 ) 0.4 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.1 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.2 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.2 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 0.3 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.1 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.2 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.1 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 0.2 ) 3 × 0.4 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.1 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 0.3 ) 3 × 0.4 ) × ( 1 ( 1 ( 1 0.2 ) 0.2 ) 3 × 0.3 ) ) ) × ( 1 ( ( 1 ( 1 ( 1 0.1 ) 0.4 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.2 ) 0.3 ) 3 × 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 0.2 ) 3 × 0.4 ) ) ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ) ) = ( s 3 , 0.415 ) , ( 0.6827 , 0.7900 , 0.2568 )
We will now discuss some properties of the SVN2TLWMM operator.
Property 4. 
(Monotonicity) Let a ˜ j = ( s a j , ρ a j ) , ( T a j , I a j , F a j ) ( j = 1 , 2 , , n ) and b ˜ j = ( s b j , ρ b j ) , ( T b j , I b j , F b j ) ( j = 1 , 2 , , n ) be two sets of SVN2TLNs. If Δ 1 ( S a j , ρ a j ) Δ 1 ( S b j , ρ b j ) and T a j T b j a n d I a j I b j a n d F a j F b j hold for all j , then:
SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) SVN 2 TLWMM n w P ( b ˜ 1 , b ˜ 2 , , b ˜ n )
The proof is similar to SVN2TLMM. It is omitted here.
Property 5. 
(Boundedness) Let a ˜ i = ( s i , ρ i ) , ( T i , I i , F i ) ( i = 1 , 2 , , n ) be a set of SVN2TLNs. If a ˜ i + = ( max i ( S i , ρ i ) , ( max i ( T i ) , min i ( I i ) , min i ( F i ) ) ) and a ˜ i = ( min i ( S i , ρ i ) , ( min i ( T i ) , max i ( I i ) , max i ( F i ) ) ) then:
a ˜ SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ +
From Theorem 2, we get:
SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = { Δ ( ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( min Δ 1 ( s j , ρ j ) ) p j ) ) ) ) 1 j = 1 n p j ) , ( ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 min T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 max I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 max F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j ) }
SVN 2 TLWMM n w P ( a ˜ + 1 , a ˜ + 2 , , a ˜ + n ) = { Δ ( ( 1 n ! ( σ S n ( j = 1 n ( n w σ ( j ) ( max Δ 1 ( s j , ρ j ) ) p j ) ) ) ) 1 j = 1 n p j ) , ( ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 max T σ ( j ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 min I σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j , 1 ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 ( 1 min F σ ( j ) ) p j ) n w σ ( j ) ) ) ) 1 n ! ) 1 j = 1 n p j ) }
From Property 4, we get:
a ˜ SVN 2 TLWMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ +
It is obvious that SVN2TLMM operators lacks the property of idempotency.

3.3. The Single-Valued Neutrosophic 2-Tuple Linguistic Dual Muirhead Mean (SVN2TLDMM) Operator

Qin and Liu [36] proposed the use of the dual Muirhead mean (DMM) operator.
Definition 7
Let a j ( j = 1 , 2 , , n ) be a set of non-negative real numbers and P = ( p 1 , p 2 , , p n ) R n be a vector of parameters if:
DMM P ( a 1 , a 2 , , a n ) = 1 j = 1 n p j ( σ S n j = 1 n p j a σ ( j ) ) 1 n !
DMM P is the dual Muirhead mean (DMM) operator, where σ ( j ) ( j = 1 , 2 , , n ) is any permutation of { 1 , 2 , , n } , and S n is the set of all permutations of { 1 , 2 , , n } .
In this section we will propose the SVN 2-tuple linguistic DMM (SVN2TLDMM) operator.
Definition 8
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set ofSVN2TLNs and let P = ( p 1 , p 2 , , p n ) R n be a vector of parameters if:
SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a ˜ σ ( j ) ) ) ) 1 n !
where σ ( j ) ( j = 1 , 2 , , n ) is any permutation of { 1 , 2 , , n } and S n is the set of all permutations of { 1 , 2 , , n } .
Theorem 3. 
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. The aggregated value by using the SVN2TLDMM operators is also a SVN2TLN where:
SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a ˜ σ ( j ) ) ) ) 1 n ! = { Δ ( 1 j = 1 n p j σ S n ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j . ) }
Proof. 
From the multiplication operation laws of SVN2TLNs depicted in Definition 3, we can obtain:
p j a σ ( j ) = Δ ( p j Δ 1 ( s j , ρ j ) ) , ( 1 ( 1 T σ ( j ) ) p j , I σ ( j ) p j , F σ ( j ) p j )
Therefore, according to the addition operation of SVN2TLNs, we can derive:
j = 1 n ( p j a σ ( j ) ) = Δ ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) , ( 1 j = 1 n ( 1 T σ ( j ) ) p j , j = 1 n I σ ( j ) p j , j = 1 n F σ ( j ) p j )
Therefore, based on the multiplication operation of SVN2TLNs, we can get:
σ S n ( j = 1 n ( p j a σ ( j ) ) ) = { Δ ( σ S n ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) ) , ( σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) , 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) , 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) ) }
Furthermore, by utilizing the exponential operation of SVN2TLNs we can derive:
( σ S n ( j = 1 n ( p j a σ ( j ) ) ) ) 1 n ! = { Δ ( σ S n ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) 1 n ! ) , ( σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! , 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) 1 n ! , 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) 1 n ! ) }
Therefore, the aggregated results using the SVN2TLDMM operator can be shown as:
SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a ˜ σ ( j ) ) ) ) 1 n ! = { Δ ( 1 j = 1 n p j σ S n ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j . ) }
Therefore, (41) is kept. In Equations (41)–(46), the symbol “ Δ 1 ” is the function of converting the 2-tuple linguistic variables to the exact numbers and “ Δ ” is the function of converting the computing results to the 2-tuple linguistic variables.
We now need to prove that (41) is a SVN2TLN. We need to prove the two conditions:
  0 T 1 , 0 I 1 , 0 F 1   0 T + I + F 3
Let
T = 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j I = ( 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j F = ( 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j
① Since 0 T σ ( j ) 1 , we get:
0 ( 1 T σ ( j ) ) p j 1   a n d   0 1 j = 1 n ( 1 T σ ( j ) ) p j 1
0 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! 1
Then:
0 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j 1
That means 0 T 1 , so ① is maintained.
Similarly, we can get 0 I 1 , 0 F 1
② Because 0 T 1 , 0 I 1 , 0 F 1 , 0 T + I + F 3 .
Example 3. 
Let ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) be three SVN2TLNs, and P = ( 0.3 , 0.4 , 0.2 ) ; then, according to Equation (41), we have
SVN 2 TLDMM ( 0.3 , 0.4 , 0.2 ) ( ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) ) = { Δ ( 1 j = 1 n p j σ S n ( j = 1 n ( p j Δ 1 ( s j , ρ j ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n I σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 σ S n ( 1 j = 1 n F σ ( j ) p j ) 1 n ! ) 1 j = 1 n p j . ) } . = { Δ ( 1 0.3 + 0.4 + 0.2 ( ( 0.3 × 3 + 0.4 × 4 + 0.2 × 2 ) × ( 0.3 × 3 + 0.4 × 2 + 0.2 × 4 ) × ( 0.3 × 4 + 0.4 × 3 + 0.2 × 2 ) × ( 0.3 × 4 + 0.4 × 2 + 0.2 × 3 ) × ( 0.3 × 2 + 0.4 × 3 + 0.2 × 4 ) × ( 0.3 × 2 + 0.4 × 4 + 0.2 × 3 ) ) 1 3 ! ) ( 1 ( 1 ( ( 1 ( 1 0.7 ) 0.4 × ( 1 0.8 ) 0.3 × ( 1 0.6 ) 0.2 ) × ( 1 ( 1 0.7 ) 0.4 × ( 1 0.6 ) 0.3 × ( 1 0.8 ) 0.2 ) × ( 1 ( 1 0.8 ) 0.4 × ( 1 0.7 ) 0.3 × ( 1 0.6 ) 0.2 ) × ( 1 ( 1 0.8 ) 0.4 × ( 1 0.6 ) 0.3 × ( 1 0.7 ) 0.2 ) × ( 1 ( 1 0.6 ) 0.4 × ( 1 0.7 ) 0.3 × ( 1 0.8 ) 0.2 ) × ( 1 ( 1 0.6 ) 0.4 × ( 1 0.8 ) 0.3 × ( 1 0.7 ) 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , ( 1 ( ( 1 0.5 0.4 × 0.6 0.3 × 0.7 0.2 ) × ( 1 0.5 0.4 × 0.7 0.3 × 0.6 0.2 ) × ( 1 0.6 0.4 × 0.5 0.3 × 0.7 0.2 ) × ( 1 0.6 0.4 × 0.7 0.3 × 05 0.2 ) × ( 1 0.7 0.4 × 0.5 0.3 × 0.6 0.2 ) × ( 1 0.7 0.4 × 0.6 0.3 × 0.5 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 , ( 1 ( ( 1 0.3 0.4 × 0.2 0.3 × 0.1 0.2 ) × ( 1 0.3 0.4 × 0.1 0.3 × 0.2 0.2 ) × ( 1 0.2 0.4 × 0.3 0.3 × 0.1 0.2 ) × ( 1 0.2 0.4 × 0.1 0.3 × 0.3 0.2 ) × ( 1 0.1 0.4 × 0.3 0.3 × 0.2 0.2 ) × ( 1 0.1 0.4 × 0.2 0.3 × 0.3 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ) } . = ( s 3 , 0.004 ) , ( 0.7110 , 0.5949 , 0.1825 ) .
Similar to the SVN2TLMM operator, we can get the properties as follows:
Property 6. 
(Idempotency) If a ˜ σ ( j ) = ( s j , ρ j ) , ( T σ ( j ) , I σ ( j ) , F σ ( j ) ) ( j = 1 , 2 , , n ) are equal, then
SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = a ˜ .
Property 7. 
(Monotonicity) Let a ˜ j = ( s a j , ρ a j ) , ( T a j , I a j , F a j ) ( j = 1 , 2 , , n ) and b ˜ j = ( s b j , ρ b j ) , ( T b j , I b j , F b j ) ( j = 1 , 2 , , n ) be two sets of SVN2TLNs. If Δ 1 ( S a j , ρ a j ) Δ 1 ( S b j , ρ b j ) and T a j T b j a n d I a j I b j a n d F a j F b j hold for all j , then
SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) SVN 2 TLDMM P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
Property 8. 
(Boundedness) Let a ˜ i = ( s i , ρ i ) , ( T i , I i , F i ) ( i = 1 , 2 , , n ) be a set of SVN2TLNs. If a ˜ i + = ( max i ( S i , ρ i ) , ( max i ( T i ) , min i ( I i ) , min i ( F i ) ) ) and a ˜ i = ( min i ( S i , ρ i ) , ( min i ( T i ) , max i ( I i ) , max i ( F i ) ) ) , then
a ˜ SVN 2 TLDMM P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ + .

3.4. The Single-Valued Neutrosophic 2-Tuple Linguistic Weighted Dual Muirhead Mean (SVN2TLWDMM) Operator

In actual MADM, it is important to consider attribute weights. This section proposes the use of a SVN2TLWDMM operator.
Definition 9
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set ofSVN2TLNs with a weight vector of w i = ( w 1 , w 2 , , w n ) T , thereby satisfying w i [ 0 , 1 ] and i = 1 n w i = 1 , and let P = ( p 1 , p 2 , , p n ) R n be a vector of parameters if
SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a σ ( j ) n w σ ( j ) ) ) ) 1 n !
where σ ( j ) ( j = 1 , 2 , , n ) is any permutation of { 1 , 2 , , n } and S n is the set of all permutations of { 1 , 2 , , n } .
Theorem 4. 
Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. The aggregated value by using SVN2TLWDMM operators is also a SVN2TLN where
SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a σ ( j ) n w σ ( j ) ) ) ) 1 n ! = { Δ ( 1 j = 1 n p j ( σ S n ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j ) }
Proof. 
From the exponential operation laws of SVN2TLNs depicted in Definition 3, we can ascertain that
a σ ( j ) n w σ ( j ) = Δ ( ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) , ( T σ ( j ) n w σ ( j ) , 1 ( 1 I σ ( j ) ) n w σ ( j ) , 1 ( 1 F σ ( j ) ) n w σ ( j ) ) .
Then, based on the scalar-multiplication operation laws of SVN2TLNs, we can derive
p j a σ ( j ) n w σ ( j ) = { Δ ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) , ( 1 ( 1 T σ ( j ) n w σ ( j ) ) p j , ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j , ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) } .
Therefore, according to the addition operation laws of SVN2TLNs, we can get
j = 1 n ( p j a σ ( j ) n w σ ( j ) ) = { Δ ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) , ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j , j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j , j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) } .
Therefore, by utilizing the multiplication operation laws of SVN2TLNs, we can derive
σ S n ( j = 1 n ( p j a σ ( j ) n w σ ( j ) ) ) = { Δ ( σ S n ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) , ( σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) , 1 σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) , 1 σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) }
Furthermore, by using the exponential operation laws of SVN2TLNs, we can get
( σ S n ( j = 1 n ( p j a σ ( j ) n w σ ( j ) ) ) ) 1 n ! = { Δ ( ( σ S n ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! , 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! , 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! . ) }
Therefore, the fused results using the SVN2TLWDMM operator can be shown as follows:
SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = 1 j = 1 n p j ( σ S n ( j = 1 n ( p j a σ ( j ) n w σ ( j ) ) ) ) 1 n ! = { Δ ( 1 j = 1 n p j ( σ S n ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j ) }
Therefore, Equation (54) is kept. In Equations (54)–(60), Δ 1 is the function of converting the 2-tuple linguistic variables to the exact numbers and Δ is the function of converting the computing results to the 2-tuple linguistic variables.
Then, we need to prove that Equation (54) is a SVN2TLN. We need to prove the two conditions:
0 T 1 , 0 I 1 , 0 F 1    ( 0 T + I + F 3
 □
Proof. 
Let
T = 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j I = ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j F = ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j
① Because 0 T σ ( j ) 1 , we can get
0 ( 1 T σ ( j ) n w σ ( j ) ) p j 1   a n d   0 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j 1 .
Then,
0 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! 1
0 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j 1 .
That means 0 T 1 , so ① is maintained.
Similarly, we can get 0 I 1 , 0 F 1 .
② Because 0 T 1 , 0 I 1 , 0 F 1 , 0 T + I + F 3 . □
Example 4. 
Let ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) be three SVN2TLNs, and P = ( 0.3 , 0.4 , 0.2 ) and w = ( 0.4 , 0.3 , 0.3 ) ; then, according to Equation (54), we have
SVN 2 TLWDMM ( 0 . 4 , 0 . 3 , 0 . 3 ) ( 0 . 3 , 0 . 4 , 0 . 2 ) ( ( s 3 , 0 ) , ( 0.7 , 0.5 , 0.3 ) , ( s 4 , 0 ) , ( 0.8 , 0.6 , 0.2 ) , ( s 2 , 0 ) , ( 0.6 , 0.7 , 0.1 ) ) = { Δ ( 1 j = 1 n p j ( σ S n ( j = 1 n ( p j ( Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j ) } . = ( Δ ( 1 0.3 + 0.4 + 0.2 ( ( 0.3 × 3 1.2 + 0.4 × 4 0.9 + 0.2 × 2 0.9 ) × ( 0.3 × 3 1.2 + 0.4 × 2 0.9 + 0.2 × 4 0.9 ) × ( 0.3 × 4 0.9 + 0.4 × 3 1.2 + 0.2 × 2 0.9 ) × ( 0.3 × 4 0.9 + 0.4 × 2 0.9 + 0.2 × 3 1.2 ) × ( 0.3 × 2 0.9 + 0.4 × 3 1.2 + 0.2 × 4 0.9 ) × ( 0.3 × 2 0.9 + 0.4 × 4 0.9 + 0.2 × 3 1.2 ) ) 1 3 ! ) ( 1 ( 1 ( ( 1 ( 1 0.7 3 × 0.4 ) 0.3 × ( 1 0.8 3 × 0.3 ) 0.4 × ( 1 0.6 3 × 0.3 ) 0.2 ) × ( 1 ( 1 0.7 3 × 0.4 ) 0.3 × ( 1 0.6 3 × 0.3 ) 0.4 × ( 1 0.8 3 × 0.3 ) 0.2 ) × ( 1 ( 1 0.8 3 × 0.3 ) 0.3 × ( 1 0.7 3 × 0.4 ) 0.4 × ( 1 0.6 3 × 0.3 ) 0.2 ) × ( 1 ( 1 0.8 3 × 0.3 ) 0.3 × ( 1 0.6 3 × 0.3 ) 0.4 × ( 1 0.7 3 × 0.4 ) 0.2 ) × ( 1 ( 1 0.6 3 × 0.3 ) 0.3 × ( 1 0.7 3 × 0.4 ) 0.4 × ( 1 0.8 3 × 0.3 ) 0.2 ) × ( 1 ( 1 0.6 3 × 0.3 ) 0.3 × ( 1 0.8 3 × 0.3 ) 0.4 × ( 1 0.7 3 × 0.4 ) 0.2 ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ( 1 ( ( 1 ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.4 ) × ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.4 ) × ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.3 ) × ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.3 ) × ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.7 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.6 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.5 ) 3 × 0.4 ) 0.2 ) ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ( 1 ( ( 1 ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.4 ) × ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.4 ) × ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.3 ) × ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.3 ) × ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.2 ) ) × ( 1 ( 1 ( 1 ( 1 0.1 ) 3 × 0.3 ) 0.4 ) × ( 1 ( 1 ( 1 0.2 ) 3 × 0.3 ) 0.3 ) × ( 1 ( 1 ( 1 0.3 ) 3 × 0.4 ) 0.2 ) ) ) 1 3 ! ) 1 0.3 + 0.4 + 0.2 ) ) = ( s 3 , 0.024 ) , ( 0.7135 , 0.0013 , 0.0356 )
We will now discuss some properties of the SVN2TLWMM operator.
Property 9. 
(Monotonicity) Let a ˜ j = ( s a j , ρ a j ) , ( T a j , I a j , F a j ) ( j = 1 , 2 , , n ) and b ˜ j = ( s b j , ρ b j ) , ( T b j , I b j , F b j ) ( j = 1 , 2 , , n ) be two sets of SVN2TLNs. If Δ 1 ( S a j , ρ a j ) Δ 1 ( S b j , ρ b j ) and T a j T b j a n d I a j I b j a n d F a j F b j hold for all j , then
SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) SVN 2 TLWDMM n w P ( b ˜ 1 , b ˜ 2 , , b ˜ n ) .
The proof is similar to SVN2TLWMM. It is omitted here.
Property 10. 
(Boundedness) Let a ˜ j = ( s j , ρ j ) , ( T j , I j , F j ) ( j = 1 , 2 , , n ) be a set of SVN2TLNs. If a ˜ i + = ( max i ( S i , ρ i ) , ( max i ( T i ) , min i ( I i ) , min i ( F i ) ) ) and a ˜ i = ( min i ( S i , ρ i ) , ( min i ( T i ) , max i ( I i ) , max i ( F i ) ) ) , then
a ˜ SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ + .
From Theorem 4:
SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) = { Δ ( 1 j = 1 n p j ( σ S n ( j = 1 n ( p j ( min Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 min T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 max I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 max F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j ) }
SVN 2 TLWDMM n w P ( a ˜ + 1 , a ˜ + 2 , , a ˜ + n ) = { Δ ( 1 j = 1 n p j ( σ S n ( j = 1 n ( p j ( max Δ 1 ( s j , ρ j ) ) n w σ ( j ) ) ) ) 1 n ! ) , ( 1 ( 1 σ S n ( 1 j = 1 n ( 1 max T σ ( j ) n w σ ( j ) ) p j ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 min I σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j , ( 1 ( σ S n ( 1 j = 1 n ( 1 ( 1 min F σ ( j ) ) n w σ ( j ) ) p j ) ) 1 n ! ) 1 j = 1 n p j ) }
From Property 9:
a ˜ SVN 2 TLWDMM n w P ( a ˜ 1 , a ˜ 2 , , a ˜ n ) a ˜ + .
It is obvious that the SVN2TLWDMM operator lacks the property of idempotency.

4. Numerical Example and Comparative Analysis

4.1. Numerical Example

The green supplier selection is a classic MADM problem [37,38,39]. Therefore, in this section we use a numerical example to select green suppliers in green supply chain management with SVN2TLNs in order to show the proposed method. There are five possible green suppliers A i ( i = 1 , 2 , 3 , 4 , 5 ) to be selected. We selected four attributes to assess these possible green suppliers: G1 is the product quality factor, G2 is the environmental factor, G3 is the delivery factor, and G4 is the price factor. These five possible green suppliers A i ( i = 1 , 2 , 3 , 4 , 5 ) are to be assessed with SVN2TLNs by the decisionmaker using the above four attributes, whose weighting vectors ω = ( 0.2 , 0.3 , 0.4 , 0.1 ) are listed in Table 1.
We can now use the approach developed for selecting green suppliers in green supply chain management.
Step 1. According to SVN2TLNs r i j ( i = 1 , 2 , 3 , 4 , 5 , j = 1 , 2 , 3 , 4 ) , we can aggregate all SVN2TLNs r i j by using the SVN2TLWMM (SVN2TLWDMM) operator to get the SVN2TLNs A i ( i = 1 , 2 , 3 , 4 , 5 ) of the green suppliers A i . Supposing that P = ( 1 , 1 , 1 , 0 ) , the aggregating results are shown in Table 2.
Step 2. In accordance with the aggregating results in Table 2, the score values of the green suppliers are shown in Table 3.
Step 3. According to the score values listed in Table 3, the order of the green suppliers are listed in Table 4. The best green supplier is A4.

4.2. Influence of the Parameter on the Final Result

In order to show the effects on the ranking results by altering the parameters of P in the SVN2TLWMM (SVN2TLWDMM) operators, the results are listed in Table 5 and Table 6.

4.3. Comparative Analysis

We can now compare our proposed method with TOPSIS methods using the single-valued neutrosophic linguistic numbers (SVNLNs) proposed by Ye [32]. The comparative results are listed in Table 7.
In Table 7, we can see that we get the same best green supplier, and only two of the methods’ ranking results are slightly different. This shows that the method we proposed is reasonable and effective. However, the existing TOPSIS methods with SVNLNs [32] do not consider the relationship information among the arguments being aggregated and therefore cannot eliminate the influence of unfair arguments on decision results. Our proposed SVN2TLWMM and SVN2TLWDMM operators consider the relationship information among the arguments being aggregated.

5. Conclusions

In this paper, we investigated MADM problems with SVN2TLNs. Then, we utilized the Muirhead mean operator and dual Muirhead mean operator to develop some Muirhead mean operators with SVN2TLNs: the SVN2TLMM operator, the SVN2TLWMM operator, the SVN2TLDMM operator, and the SVN2TLWDMM operator. The main properties of these proposed operators were investigated. We then used these operators to propose some models for MADM problems with SVN2TLNs.
The case study for green supplier selection shows that the proposed MADM method is practical and effective. The advantages of the proposed approach are as follows:
(1) The proposed approach is based on SVN2TLNs, which are suitable to be used in real life situations. SVN2TLNs have the capacity to deal with imprecise and vague information. They are suitable for expressing the truth-membership, indeterminacy-membership, and falsity-membership of an element to a 2-tuple linguistic term, which can affect the decisionmaker’s confidence level when they are making the evaluation. Therefore, the decisionmakers may find it more flexible and convenient to express their opinions as SVN2TLNs. The existing operation rules and comparison rules were contrasted and discussed.
(2) Some Muirhead mean operators with SVN2TLNs were developed: the SVN2TLMM operator, the SVN2TLWMM operator, the SVN2TLDMM operator, and the SVN2TLWDMM operator. The main characteristics of these proposed operators were investigated.
(3) Some methods were established to solve MADM problems with SVN2TLNs, and the evaluation results turned out to be reasonable.
(4) MADM methods based on such operators with SVN2TLNs are novel decision making methods, and these methods were applied to green supplier selection in this study. Furthermore, MADM methods based on such operators with SVN2TLNs are not only easy to calculate, but can also realize the reasonable and stable ranking of alternatives.
In future studies, the application of the proposed aggregating operators of SVN2TLNs need to be studied in many other uncertain and fuzzy environments [40,41,42,43] and extended to other application domains [44,45].

Author Contributions

J.W., J.L., G.W., R.L. and C.W. conceived and worked together to achieve this work, J.W. compiled the computing program by Matlab and analyzed the data, J.W. and G.W. wrote the paper. Finally, all the authors have read and approved the final manuscript.

Funding

The work was supported by the National Natural Science Foundation of China under Grant No. 71571128 and the Humanities and Social Sciences Foundation of Ministry of Education of the People’s Republic of China (14YJCZH091). The APC was funded by Humanities and Social Sciences Foundation of Ministry of Education of the People’s Republic of China (14YJCZH091).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  2. Smarandache, F. A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics, 3rd ed.; American Research Press: Rehoboth, DE, USA, 2003. [Google Scholar]
  3. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  4. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Atanassov, K.; Gargov, G. Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  6. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single-valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  7. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval Neutrosophic Sets and Logic: Theory and Applications in Computing; Hexis: Phoenix, AZ, USA, 2005. [Google Scholar]
  8. Ye, J. Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. Int. J. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef]
  9. Broumi, S.; Smarandache, F. Correlation Coefficient of Interval Neutrosophic Set. Appl. Mech. Mater. 2013, 436, 511–517. [Google Scholar] [CrossRef]
  10. Biswas, P.; Pramanik, S.; Giri, B.C. TOPSIS method for multi-attribute group decision-making under single-valued neutrosophic environment. Neural Comput. Appl. 2016, 27, 727–737. [Google Scholar] [CrossRef]
  11. Liu, P.D.; Chu, Y.C.; Li, Y.W.; Chen, Y.B. Some generalized neutrosophic number Hamacher aggregation operators and their application to Group Decision Making. Int. J. Fuzzy Syst. 2014, 16, 242–255. [Google Scholar]
  12. Ahin, R.S.; Liu, P.D. Maximizing deviation method for neutrosophic multiple attribute decision making with incomplete weight information. Neural Comput. Appl. 2016, 27, 2017–2029. [Google Scholar]
  13. Ye, J. Similarity measures between interval neutrosophic sets and their applications in multicriteria decision-making. J. Intell. Fuzzy Syst. 2014, 26, 165–172. [Google Scholar]
  14. Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multicriteria decision making problems. Sci. Word J. 2014, 2014, 1–15. [Google Scholar] [CrossRef]
  15. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  16. Peng, J.J.; Wang, J.Q.; Wang, J.; Zhang, H.Y.; Chen, X.H. Simplified neutrosophic sets and their applications in multicriteria group decision-making problems. Int. J. Syst. Sci. 2016, 47, 2342–2358. [Google Scholar] [CrossRef]
  17. 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]
  18. Zhang, H.; Wang, J.Q.; Chen, X.H. An outranking approach for multi-criteria decision-making problems with interval-valued neutrosophic sets. Neural Comput. Appl. 2016, 27, 615–627. [Google Scholar] [CrossRef]
  19. Liu, P.D.; Xi, L. The neutrosophic number generalized weighted power averaging operator and its application in multiple attribute group decision making. Int. J. Mach. Learn. Cybernet. 2018, 9, 347–358. [Google Scholar] [CrossRef]
  20. Deli, I.; Subas, Y. A ranking method of single-valued neutrosophic numbers and its applications to multiattribute decision making problem. Int. J. Mach. Learn. Cybern. 2017, 8, 1309–1322. [Google Scholar] [CrossRef]
  21. Peng, J.J.; Wang, J.Q.; Wu, X.H.; Wang, J.; Chen, X.H. Multi-valued neutrosophic sets and power aggregation operators with their applications in multi-criteria group decision-making problems. Int. J. Comput. Intell. Syst. 2015, 8, 345–363. [Google Scholar] [CrossRef]
  22. Zhang, H.Y.; Ji, P.; Wang, J.Q.; Chen, X.H. An improved weighted correlation coefficient based on integrated weight for interval neutrosophic sets and its application in multi-criteria decision-making problem. Int. J. Comput. Intell. Syst. 2015, 8, 1027–1043. [Google Scholar] [CrossRef]
  23. Chen, J.Q.; Ye, J. Some Single-Valued Neutrosophic Dombi Weighted Aggregation Operators for Multiple Attribute Decision-Making. Symmetry 2017, 96, 82. [Google Scholar] [CrossRef]
  24. 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]
  25. Wu, X.H.; Wang, J.Q.; Peng, J.J.; Chen, X.H. Cross-entropy and prioritized aggregation operator with simplified neutrosophic sets and their application in multi-criteria decision-making problems. J. Intell. Fuzzy Syst. 2016, 18, 1104–1116. [Google Scholar] [CrossRef]
  26. Li, Y.; Liu, P.; Chen, Y. Some Single-Valued Neutrosophic Number Heronian Mean Operators and Their Application in Multiple Attribute Group Decision Making. Informatica 2016, 27, 85–110. [Google Scholar] [CrossRef]
  27. Xu, D.S.; Wei, C.; Wei, G.W. TODIM method for single-valued Neutrosophic multiple attribute decision making. Information 2017, 8, 125. [Google Scholar] [CrossRef]
  28. Wu, Q.; Zhou, L.G.; Chen, H.Y.; Guan, X.J. Some new Hamacher aggregation operators under single-valued neutrosophic 2-tuple linguisticenvironment and their applications to multi-attribute group decision making. Comput. Ind. Eng. 2018, 116, 144–162. [Google Scholar] [CrossRef]
  29. Herrera, F.; Martinez, L. A 2-tuple fuzzy linguistic representation model for computing with words. IEEE Trans. Fuzzy Syst. 2000, 8, 746–752. [Google Scholar]
  30. Herrera, F.; Martinez, L. An approach for combining linguistic and numerical information based on the 2-tuple fuzzy linguistic representation model in decision-making. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2000, 8, 539–562. [Google Scholar] [CrossRef]
  31. Ye, J. Some aggregation operators of interval neutrosophic linguistic numbers for multiple attribute decision making. J. Intell. Fuzzy Syst. 2014, 27, 2231–2241. [Google Scholar]
  32. Ye, J. An extended TOPSIS method for multiple attribute group decision making based on single-valued neutrosophic linguistic numbers. J. Intell. Fuzzy Syst. 2015, 28, 247–255. [Google Scholar]
  33. Muirhead, R.F. Some methods applicable to identities and inequalities of symmetric algebraic functions of n letters. Proc. Edinb. Math. Soc. 1902, 21, 144–162. [Google Scholar] [CrossRef]
  34. Tang, X.Y.; Wei, G.W.; Gao, H. Models for Multiple Attribute Decision Making with Interval-Valued Pythagorean Fuzzy Muirhead Mean Operators and Their Application to Green Suppliers Selection. Informatica 2019, 30, 153–186. [Google Scholar] [CrossRef]
  35. Wang, R.; Wang, J.; Gao, H.; Wei, G. Methods for MADM with Picture Fuzzy Muirhead Mean Operators and Their Application for Evaluating the Financial Investment Risk. Symmetry 2019, 11, 6. [Google Scholar] [CrossRef]
  36. Qin, J.Q.; Liu, X.W. 2-tuple linguistic Muirhead mean operators for multiple attribute group decision making and its application to supplier selection. Kybernetes 2017, 45, 2–29. [Google Scholar] [CrossRef]
  37. Wang, J.; Wei, G.W.; Wei, Y. Models for Green Supplier Selection with Some 2-Tuple Linguistic Neutrosophic Number Bonferroni Mean Operators. Symmetry 2018, 10, 131. [Google Scholar] [CrossRef]
  38. Gao, H. Pythagorean Fuzzy Hamacher Prioritized Aggregation Operators in Multiple Attribute Decision Making. J. Intell. Fuzzy Syst. 2018, 35, 2229–2245. [Google Scholar] [CrossRef]
  39. Li, Z.; Gao, H.; Wei, G. Methods for Multiple Attribute Group Decision Making Based on Intuitionistic Fuzzy Dombi Hamy Mean Operators. Symmetry 2018, 10, 574. [Google Scholar] [CrossRef]
  40. Li, Z.X.; Wei, G.W.; Gao, H. Methods for Multiple Attribute Decision Making with Interval-Valued Pythagorean Fuzzy Information. Mathematics 2018, 6, 228. [Google Scholar] [CrossRef]
  41. Kuo, M.S.; Liang, G.S. A soft computing method of performance evaluation with MCDM based on interval-valued fuzzy numbers. Appl. Soft Comput. 2012, 12, 476–485. [Google Scholar] [CrossRef]
  42. Wu, L.; Wei, G.; Gao, H.; Wei, Y. Some Interval-Valued Intuitionistic Fuzzy Dombi Hamy Mean Operators and Their Application for Evaluating the Elderly Tourism Service Quality in Tourism Destination. Mathematics 2018, 6, 294. [Google Scholar] [CrossRef]
  43. Li, Z.X.; Wei, G.W.; Lu, M. Pythagorean Fuzzy Hamy Mean Operators in Multiple Attribute Group Decision Making and Their Application to Supplier Selection. Symmetry-Basel 2018, 10, 205. [Google Scholar] [CrossRef]
  44. Wei, Y.; Qin, S.; Li, X.; Zhu, S.; Wei, G. Oil price fluctuation, stock market and macroeconomic fundamentals: Evidence from China before and after the financial crisis. Financ. Res. Lett. 2019, 30, 23–29. [Google Scholar]
  45. Wei, Y.; Yu, Q.; Liu, J.; Cao, Y. Hot money and China’s stock market volatility: Further evidence using the GARCH-MIDAS model. Phys. A Stat. Mech. Its Appl. 2018, 492, 923–930. [Google Scholar] [CrossRef]
Table 1. Single-valued neutrosophic 2-tuple linguistic number (SVN2TLN) decision matrix.
Table 1. Single-valued neutrosophic 2-tuple linguistic number (SVN2TLN) decision matrix.
G1G2G3G4
A1<(s6,0),(0.7,0.4,0.6)><(s4,0),(0.4,0.5,0.6)><(s3,0),(0.4,0.5,0.6)><(s4,0),(0.6,0.5,0.3)>
A2<(s3,0),(0.5,0.4,0.2)><(s5,0),(0.6,0.5,0.4)><(s2,0),(0.6,0.4,0.2)><(s3,0),(0.8,0.3,0.5)>
A3<(s2,0),(0.5,0.6,0.2)><(s3,0),(0.7,0.5,0.6)><(s4,0),(0.5,0.6,0.3)><(s5,0),(0.4,0.5,0.2)>
A4<(s5,0),(0.8,0.4,0.6)><(s4,0),(0.7,0.4,0.3)><(s6,0),(0.6,0.5,0.3)><(s4,0),(0.6,0.4,0.6)>
A5<(s1,0),(0.5,0.6,0.4)><(s5,0),(0.7,0.4,0.7)><(s1,0),(0.6,0.5,0.2)><(s3,0),(0.8,0.6,0.8)>
Table 2. The aggregating results of the green suppliers by the single-valued neutrosophic 2-tuple linguistic dual Muirhead mean (SVN2TLWMM) (single-valued neutrosophic 2-tuple linguistic weighted dual Muirhead mean (SVN2TLWDMM)) operator.
Table 2. The aggregating results of the green suppliers by the single-valued neutrosophic 2-tuple linguistic dual Muirhead mean (SVN2TLWMM) (single-valued neutrosophic 2-tuple linguistic weighted dual Muirhead mean (SVN2TLWDMM)) operator.
SVN2TLWMMSVN2TLWDMM
A1<(s4, −0.4633),(0.4692,0.5201,0.5716)><(s5, −0.2958),(0.5785,0.4324,0.4843)>
A2<(s3, −0.3366),(0.5757,0.4534,0.3992)><(s3, −0.0273),(0.6525,0.3702,0.2761)>
A3<(s3, −0.1294),(0.4853,0.5894,0.3953)><(s4, −0.2162),(0.5754,0.4996,0.2846)>
A4<(s4, −0.0021),(0.6189,0.4719,0.5075)><(s7, −0.0573),(0.7143,0.3868,0.3947)>
A5<(s2, −0.1995),(0.6013,0.5649,0.6052)><(s2, −0.2488),(0.6804,0.4747,0.4541)>
Table 3. The score values of the green suppliers.
Table 3. The score values of the green suppliers.
SVN2TLWMMSVN2TLWDMM
A1(s2, −0.3762)(s3, −0.3943)
A2(s2, −0.4702)(s2, −0.0122)
A3(s1, 0.4358)(s2, 0.2592)
A4(s2, 0.1847)(s4, 0.4730)
A5(s1, −0.1410)(s1, 0.0225)
Table 4. Ordering of the green suppliers.
Table 4. Ordering of the green suppliers.
Ordering
SVN2TLWMMA4 > A1 > A2 > A3 > A5
SVN2TLWDMMA4 > A1 > A3 > A2 > A5
Table 5. Ranking results for different parameters of the SVN2TLWMM operator.
Table 5. Ranking results for different parameters of the SVN2TLWMM operator.
Ps(A1)s(A2)s(A3)s(A4)s(A5)Ordering
(1,0,0,0)(s1, 0.3096)(s1, 0.2931)(s1, 0.2036)(s2, −0.1905)(s1, −0.1063)A4 > A1 > A2 > A3 > A5
(1,1,0,0)(s2, −0.4419)(s2, −0.4987)(s1, 0.4121)(s2, 0.1192)(s1, −0.0706)A4 > A1 > A2 > A3 > A5
(1,1,1,0)(s2, −0.3762)(s2, −0.4702)(s1, 0.4358)(s2, 0.1847)(s1, −0.1410)A4 > A1 > A2 > A3 > A5
(1,1,1,1)(s2, −0.3628)(s2, −0.4811)(s1, 0.4095)(s2, 0.1700)(s1, −0.2159)A4 > A1 > A2 > A3 > A5
(2,2,2,2)(s2, −0.3628)(s2, −0.4811)(s1, 0.4095)(s2, 0.1700)(s1, −0.2159)A4 > A1 > A2 > A3 > A5
(2,0,0,0)(s2, −0.2505)(s2, −0.2515)(s2, −0.3744)(s2, 0.3621)(s1, 0.3912)A4 > A1 > A2 > A3 > A5
(3,0,0,0)(s2, −0.0101)(s2, 0.0035)(s2, −0.1482)(s3, −0.3787)(s2, −0.2759)A4 > A1 > A2 > A3 > A5
Table 6. Ranking results for different parameters of the SVN2TLWDMM operator.
Table 6. Ranking results for different parameters of the SVN2TLWDMM operator.
Ps(A1)s(A2)s(A3)s(A4)s(A5)Ordering
(1,0,0,0)(s2, 0.2756)(s2, 0.0001)(s2, −0.0497)(s4, −0.4654)(s1, 0.0155)A4 > A1 > A2 > A3 > A5
(1,1,0,0)(s2, 0.3874)(s2, −0.0806)(s2, 0.0341)(s4, −0.0287)(s1, −0.0515)A4 > A1 > A3 > A2 > A5
(1,1,1,0)(s3, −0.3943)(s2, −0.0122)(s2, 0.2592)(s4, 0.4730)(s1, 0.0225)A4 > A1 > A3 > A2 > A5
(1,1,1,1)(s3, −0.2159)(s1, 0.2825)(s1, 0.2287)(s2, −0.4771)(s1, −0.0165)A1 > A4 > A2 > A3 > A5
(2,2,2,2)(s3, −0.2159)(s1, 0.2825)(s1, 0.2287)(s2, −0.4771)(s1, −0.0165)A1 > A4 > A2 > A3 > A5
(2,0,0,0)(s2, 0.2100)(s2, −0.0916)(s2, −0.1583)(s3, 0.2577)(s1, −0.1059)A4 > A1 > A2 > A3 > A5
(3,0,0,0,)(s2, 0.3086)(s2, 0.1445)(s2, 0.0336)(s3, 0.4540)(s1, 0.0299)A4 > A1 > A2 > A3 > A5
Table 7. Ordering of the green suppliers.
Table 7. Ordering of the green suppliers.
Ordering
TOPSIS with SVNLNsA4 > A1 > A2 > A3 > A5

Share and Cite

MDPI and ACS Style

Wang, J.; Lu, J.; Wei, G.; Lin, R.; Wei, C. Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators. Mathematics 2019, 7, 442. https://doi.org/10.3390/math7050442

AMA Style

Wang J, Lu J, Wei G, Lin R, Wei C. Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators. Mathematics. 2019; 7(5):442. https://doi.org/10.3390/math7050442

Chicago/Turabian Style

Wang, Jie, Jianping Lu, Guiwu Wei, Rui Lin, and Cun Wei. 2019. "Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators" Mathematics 7, no. 5: 442. https://doi.org/10.3390/math7050442

APA Style

Wang, J., Lu, J., Wei, G., Lin, R., & Wei, C. (2019). Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators. Mathematics, 7(5), 442. https://doi.org/10.3390/math7050442

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