Next Article in Journal
Analysis of Homotopy Perturbation Method for Solving Fractional Order Differential Equations
Previous Article in Journal
PHSS Iterative Method for Solving Generalized Lyapunov Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Extended Single-Valued Neutrosophic Projection-Based Qualitative Flexible Multi-Criteria Decision-Making Method

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(1), 39; https://doi.org/10.3390/math7010039
Submission received: 23 November 2018 / Revised: 24 December 2018 / Accepted: 26 December 2018 / Published: 3 January 2019

Abstract

:
With respect to multi-criteria decision-making (MCDM) problems in which the criteria denote the form of single-valued neutrosophic sets (SVNSs), and the weight information is also fully unknown, a novel MCDM method based on qualitative flexible multiple criteria (QUALIFLEX) is developed. Firstly, the improved cosine measure of the included angle between two SVNSs is defined. Then, the improved single-valued neutrosophic projection is developed, and the corresponding improved single-valued neutrosophic bidirectional projection and single-valued neutrosophic bidirectional projection difference are investigated. Moreover, the partial ordering relation of SVNSs is developed. Secondly, an extended QUALIFLEX method based on an improved single-valued neutrosophic projection measure is proposed to handle MCDM problems in which the weights of criteria are completely unknown. Finally, an example for selection of a green supplier, as well as a performance comparison analysis, are provided to demonstrate the effectiveness of the proposed method.

1. Introduction

It is well-known that successful decision-making often requires consideration of several factors or criteria. This kind of decision-making problem, simultaneously involving different criteria, is called a multi-criteria decision making (MCDM) problem. In many cases, it is in fact difficult for decision-makers to definitely express their preference in solving MCDM problems with inaccurate, uncertain, or incomplete information. Under these circumstances, Zadeh’s fuzzy sets (FSs) [1], where the membership degree is represented by a real number between zero and one, are regarded as an important tool to solve the problems associated with MCDM [2,3], fuzzy logic and optimization [4], approximate reasoning [5], and pattern recognition [6].
However, FSs cannot handle some cases in which the membership degree is difficult to define by only a particular value. In order to overcome the lack of knowledge on non-membership degrees, Atanassov [7] presented intuitionistic fuzzy sets (IFSs), as the extension of Zadeh’s FSs. IFSs simultaneously take the membership degree, the non-membership degree, and the degree of hesitation into account. Therefore, they are more appropriate and practical in addressing fuzziness and uncertainty than the FSs.
Although the FS theory has been developed and generalized, it still cannot deal with all sorts of uncertainties in different real problems. Some types of uncertainties, such as indeterminate information and inconsistent information, cannot be properly handled. To better elucidate the scope of FSs and IFSs, Smarandache et al. [8,9,10] proposed neutrosophic logic and neutrosophic sets (NSs). Rivieccio [11] pointed out that an NS is a set in which each element of the universe has a degree of truth, indeterminacy, and falsity, respectively, and it lies in [ 0 ,   1 + ] , the non-standard unit interval. Obviously, it is the extension of the standard interval [ 0 ,   1 ] of IFSs. In addition, the uncertainty presented here, that is, the indeterminacy factor, is dependent on truth and falsity values, while the incorporated uncertainty is dependent on the degree of belongingness, as well as the degree of non-belongingness of IFSs [12]. It is noteworthy that because of the uncertain, incomplete, and inaccurate information, NSs are difficult to apply to real-life situations. Hence, a single-valued neutrosophic set (SVNS) was proposed, which is an instance of NS [8,12]. Wang et al. [13] and Lupiáñez [14] proposed the concept of interval neutrosophic sets (INSs), and presented the set-theoretic operators of INSs. Hu et al. [15] developed an interval neutrosophic projection-based the VlseKriterijumskaOptimizacija I KompromisnoResenje (VIKOR) method; Wang et al. [16] studied the fuzzy stochastic MCDM method associated with interval neutrosophic probability. Wang et al. [17] investigated a cloud service reliability method based on multi-valued neutrosophic measures. Besides, other extensions of NSs, including neutrosophic cubic sets [18,19], single-valued neutrosophic hesitant fuzzy sets (SVNHFSs) [20,21], rough neutrosophic sets (RNSs) [22,23], interval rough neutrosophic sets (IRNSs) [24], single-valued neutrosophic graphic [25,26], bipolar single-valued neutrosophic graphic [27], and other extensions [28], were proposed and applied to solve various problems.
In particular, SVNS, as an important tool to express ambiguous information, has always received great attention from researchers and has been studied from different aspects, including outranking relations, aggregation operators, and information measures. For a single-valued neutrosophic MCDM method based on outranking relations, Peng et al. [29] proposed a single-valued neutrosophic outranking method by combing elimination and choice expressing reality (ELECTRE) III. For a single-valued neutrosophic MCDM method based on aggregation operators, Wu et al. [30] defined a simplified neutrosophic prioritized aggregation operator, Ye [31] also developed a simplified neutrosophic aggregation operator, Garg [32] presented a single-valued neutrosophic operator based on Frank’s norm, and Liu and Wang [33] proposed a single-valued neutrosophic normalized weighted Bonferroni mean (SVNNWBM) operator. For a single-valued neutrosophic MCDM method based on information measures, Ye [34,35] studied similarity of SVNSs, and applied them to cluster analysis, Ye [36] defined a single-valued neutrosophic cross-entropy, and Ye [37] investigated projection and bidirectional projection measures of SVNSs. To our knowledge, entropy, cross entropy, similarity, and distance and projection of SVNSs are significant measures to deal with ambiguous information. In particular, projection based on the included angle between objects plays a key role in solving MCDM problems.
Moreover, the qualitative flexible multiple criteria (QUALIFLEX) method was developed by Paelinck [38,39,40], who utilized outranking relations or priority functions for ranking the alternatives in terms of priority among the criteria, which was based on the pair-wise comparisons of alternatives with respect to each criterion under all possible permutations of the alternatives, and identified the optimal permutation, maximizing the value of concordance/discordance index [41]. Recently, several extensions have been developed to enhance the QUALIFLEX method [42,43]. For instance, Ji et al. [44] defined a triangular neutrosophic QUALIFLEX and an acronym in Portuguese of interactive and multicriteria decision making (TODIM) method for treatment selection, and Li and Wang [45] developed a probability hesitant fuzzy QUALIFLEX approach to select green suppliers.
After reviewing the existing references presented above, we can conclude that there are some limitations about existing single-valued neutrosophic MCDM methods. Firstly, those aforementioned methods based on aggregation operators always involve operations, impacting the final results to some extent. In other words, different aggregation operators are always involved in different operations that can lead to different rankings. Secondly, the outranking method based on elimination and choice expressing reality (ELECTRE) is only appropriate for MCDM problems in which the number of alternatives is much bigger than the number of criteria. Thirdly, a single-valued neutrophic projection defined by Ye is unreasonable, as previously discussed in Ye [37] in some cases. Furthermore, the principal advantage of the QUALIFLEX method is that it can effectively handle the decision-making problems in which the number of criteria is clearly greater than the number of alternatives, and which are not extended to a single-valued neutrosophic environment. Therefore, the main objectives of this research are concluded as follows: (1) provide the improved projection measure of SVNSs based on the improved included angle of SVNSs, in addition to defining the corresponding single-valued neutrosophic bidirectional projection and the corresponding bidirectional projection difference; (2) extend the QUALIFLEX method to a single-valued neutrosophic environment based on the proposed projection. Thus, for a single-valued neutrosophic MCDM problem, where the weight information is fully unknown, the methodology can be concluded in the following steps. Firstly, the weight of criteria can be calculated by utilizing the maximizing deviation method. As a result, the possible permutations can be determined. Secondly, the concordance index of each permutation is calculated based on the proposed projection. Eventually, according to the value of corresponding concordance index, the maximum of all permutations is selected. Consequently, the corresponding permutation is the optimal ranking of alternatives. Moreover, the proposed method is more appropriate for handling single-valued neutrosophic information, where the weight of criteria is completely unknown, and the number of alternatives is smaller than the number of criteria.
The present study is summarized as follows. In Section 2, some definitions and operations of SVNSs are introduced. The projection and bidirectional projection of SVNSs are reviewed as well. Then, an improved single-valued neutrosophic projection, a single-valued neutrosophic bidirectional projection, and the corresponding bidirectional projection difference are developed in Section 3. Next, the single-valued projection-based QUALIFLEX method accompanied with unknown weight information is developed in Section 4. In Section 5, the selection of a green supplier is presented to assess the efficacy of the proposed approach. Finally, we summarize the paper with a further discussion in Section 6.

2. Preliminaries

In this section, some definitions, operations, and projection measures of SVNSs are reviewed, which may be utilized in the latter analysis.
Definition 1
[8]. An SVNS M on the universe X can be expressed as M = { x , T ( x ) , I ( x ) , F ( x ) | x X } , where, T ( x ) , I ( x ) , and F ( x ) are numerical numbers in [0,1], that is, T ( x ) : X [ 0 ,   1 ] , I ( x ) : X [ 0 , 1 ] , and F ( x ) : X [ 0 , 1 ] , denoting the truth-membership degree, indeterminacy-membership degree, and falsity-membership degree, respectively.
If there exists only one element in X , then M is called a single-valued neutrosophic number (SVNN), denoted by M = ( T , I , F )   for convenience.
Definition 2
[46]. Let M = ( M ( x 1 ) , M ( x 2 ) , , M ( x n ) ) , M 1 = ( M 1 ( x 1 ) , M 1 ( x 2 ) , , M 1 ( x n ) ) , and M 2 = ( M 2 ( x 1 ) , M 2 ( x 2 ) , , M 2 ( x n ) ) be three SVNSs on the universe X = { x 1 , x 2 , , x n } , then the following operations of SVNSs can be achieved:
(1) M 1 M 2 , if and only if T 1 ( x ) T 2 ( x ) , I 1 ( x ) I 2 ( x ) , and F 1 ( x ) F 2 ( x ) for any x X ;
(2) If M 1 M 2 and M 1 M 2 , then M 1 = M 2 ;
(3) M C = { x , F ( x ) , 1 I ( x ) , T ( x ) | x X } .
Definition 3
[37]. Let M 1 = ( M 1 ( x 1 ) , M 1 ( x 2 ) , , M 1 ( x n ) ) and M 2 = ( M 2 ( x 1 ) , M 2 ( x 2 ) , , M 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } . Then, the cosine measure of the included angle between two SVNSs can be defined as follows:
cos ( M 1 , M 2 ) = M 1 M 2 M 1 M 2
Here, M 1 M 2 = i = 1 n ( T 1 i ( x i ) T 2 i ( x i ) + I 1 i ( x i ) I 2 i ( x i ) + F 1 i ( x i ) F 2 i ( x i ) ) denotes the inner product between M 1 and M 2 . M 1 = i = 1 n ( T 1 i ( x i ) 2 + I 1 i ( x i ) 2 + F 1 i ( x i ) 2 ) and M 2 = i = 1 n ( T 2 i ( x i ) 2 + I 2 i ( x i ) 2 + F 2 i ( x i ) 2 ) represent the modules of M 1 and M 2 , respectively.
Definition 4
[37]. Let M 1 = ( M 1 ( x 1 ) , M 1 ( x 2 ) , , M 1 ( x n ) ) and M 2 = ( M 2 ( x 1 ) , M 2 ( x 2 ) , , M 2 ( x n ) ) to be two SVNSs on the universe X = { x 1 , x 2 , , x n } . The projection of M 1 on M 2 can be denoted as follows:
Pr o M 2 ( M 1 ) = M 2 cos ( M 1 , M 2 ) = i = 1 n ( T 1 i ( x i ) T 2 i ( x i ) + I 1 i ( x i ) I 2 i ( x i ) + F 1 i ( x i ) F 2 i ( x i ) ) i = 1 n ( T 2 i ( x i ) 2 + I 2 i ( x i ) 2 + F 2 i ( x i ) 2 )
The projection Pr o M 2 ( M 1 ) defined in Definition 4 reflects the degree to which an object is similar to another. Generally speaking, the greater the value of Pr o M 2 ( M 1 ) , the more M 1 is similar to M 2 . However, as discussed in Ye [37], the projection measure is unreasonable in some cases.
Example 1.
Let M 1 = { x , 1 , 1 , 1 } and M 2 = { x , 1 , 0 , 0 } be two SVNSs. From Equation (2), we can achieve Pr o M 2 ( M 1 ) = 1 × 1 + 1 × 0 + 1 × 0 1 2 = 1 and Pr o M 2 ( M 2 ) = 1 × 1 + 0 × 0 + 0 × 0 1 2 = 1 . Apparently, Pr o M 2 ( M 1 ) = Pr o M 2 ( M 2 ) , that is, M 1 is close to M 2 as M 2 to M 2 . However, it can be seen that M 1 and M 2 are different. Thus, cosine measure of the included angle between two SVNSs and the projection measure defined in Definitions 3 and 4, respectively, are unreasonable.
Definition 5
[37]. Let M 1 = ( M 1 ( x 1 ) , M 1 ( x 2 ) , , M 1 ( x n ) ) and M 2 = ( M 2 ( x 1 ) , M 2 ( x 2 ) , , M 2 ( x n ) ) to be two SVNSs on the universe X = { x 1 , x 2 , , x n } . Therefore, the single-valued neutrosophic bidirectional projection measure of M 1 on M 2 is developed as follows:
B Pr o S V N S ( M 1 , M 2 ) = M 1 M 2 M 1 M 2 + | M 1 M 2 | M 1 M 2
where M 1 M 2 = i = 1 n ( T 1 ( x i ) T 2 ( x i ) + I 1 ( x i ) I 2 ( x i ) + F 1 ( x i ) F 2 ( x i ) ) denotes the inner product between M 1 and M 2 . M 1 = i = 1 n ( T 1 ( x i ) 2 + I 1 ( x i ) 2 + F 1 ( x i ) 2 ) and M 2 = i = 1 n ( T 2 ( x i ) 2 + I 2 ( x i ) 2 + F 2 ( x i ) 2 ) represent the modules of M 1 and M 2 , respectively.
Example 2.
Based on Example 1 and Definition 5, we have B Pr o S V N S ( M 1 , M 2 ) = M 1 M 2 M 1 M 2 + | M 1 M 2 | M 1 M 2 = 3 3 + | 3 1 | = 1 2 1 3 < 1 and B Pr o S V N S ( M 2 , M 2 ) = M 2 M 2 M 2 M 2 + | M 2 M 2 | M 2 M 2 = 1 1 + 0 = 1 . Also, B Pr o S V N S ( M 2 , M 2 ) B Pr o S V N S ( M 1 , M 2 ) . Thus, M 2 is closer to M 2 than M 1 to M 2 , which is consistent with our intuition.
Apparently, the single-valued neutrosophic bidirectional projection measure defined by Ye [37] is more reasonable than the projection measure.

3. Improved Projection Measures of SVNSs

In this section, the improved single-valued neutrosophic projection, single-valued bidirectional projection, and single-valued bidirectional projection difference measures are defined, and the related properties are discussed.

3.1. The Improved Single-Valued Neutrosophic Projection Measure

On the basis of the existing projection measure of SVNSs presented in Ye [37], the improved single-valued neutrosophic cosine measure and the corresponding projection measure are defined in the following.
Definition 6.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } . Thus, the improved cosine measure of the included angle between M ¯ 1 and M ¯ 2 is proposed as follows:
Cos S V N S ( M ¯ 1 , M ¯ 2 ) = i = 1 n ( T ¯ 1 ( x i ) T ¯ 2 ( x i ) + ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 2 ( x i ) ) + ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 2 ( x i ) ) ) i = 1 n ( T ¯ 1 ( x i ) 2 + ( 1 I ¯ 1 ( x i ) ) 2 + ( 1 F ¯ 1 ( x i ) ) 2 ) i = 1 n ( T ¯ 2 ( x i ) 2 + ( 1 I ¯ 2 ( x i ) ) 2 + ( 1 F ¯ 2 ( x i ) ) 2 )
Here, M ¯ 1 M ¯ 2 = i = 1 n ( T ¯ 1 ( x i ) T ¯ 2 ( x i ) + ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 2 ( x i ) ) + ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 2 ( x i ) ) ) denotes the inner product between M ¯ 1 and M ¯ 2 . Besides, M ¯ 1 = i = 1 n ( T ¯ 1 ( x i ) 2 + ( 1 I ¯ 1 ( x i ) ) 2 + ( 1 F ¯ 1 ( x i ) ) 2 ) and M ¯ 2 = i = 1 n ( T ¯ 2 ( x i ) 2 + ( 1 I ¯ 2 ( x i ) ) 2 + ( 1 F ¯ 2 ( x i ) ) 2 ) represent the modules of M ¯ 1 and M ¯ 2 , respectively.
If n = 1 , then M ¯ 1 and M ¯ 2 become two SVNNs. In this case, Equation (4) is reduced to the cosine measure of the included angle between two SVNNs, that is,
Cos S V N N ( M ¯ 1 , M ¯ 2 ) = T ¯ 1 T ¯ 2 + ( 1 I ¯ 1 ) ( 1 I ¯ 2 ) + ( 1 F ¯ 1 ) ( 1 F ¯ 2 ) ( T ¯ 1 2 + ( 1 I ¯ 1 ) 2 + ( 1 F ¯ 1 ) 2 ) ( T ¯ 2 2 + ( 1 I ¯ 2 ) 2 + ( 1 F ¯ 2 ) 2 )
Theorem 1.
The improved cosine measure of the included angle between M ¯ 1 and M ¯ 2 satisfies the following properties:
P1. 0 Cos S V N S ( M ¯ 1 , M ¯ 2 ) 1 ;
P2. Cos S V N S ( M ¯ 1 , M ¯ 2 ) = Cos S V N S ( M ¯ 2 , M ¯ 1 ) ;
P3. If M ¯ 1 = M ¯ 2 , then Cos S V N S ( M ¯ 1 , M ¯ 2 ) = 1 .
Proof. 
P1. Because M ¯ 1 M ¯ 2 0 , M ¯ 1 0 , and M ¯ 2 0 , Cos S V N S ( M ¯ 1 , M ¯ 2 ) = M ¯ 1 M ¯ 2 M ¯ 1 M ¯ 2 0 . According to the Cauchy–Schwartz inequality, we achieve ( x 1 y 1 + x 2 y 2 + x 3 y 3 ) ( x 1 2 + x 2 2 + x 3 2 ) ( y 1 2 + y 2 2 + y 3 2 ) , that is, M ¯ 1 M ¯ 2 M ¯ 1 M ¯ 2 . Therefore, Cos S V N S ( M ¯ 1 , M ¯ 2 ) = M ¯ 1 M ¯ 2 M ¯ 1 M ¯ 2 1 can be obtained accordingly. As a result, 0 Cos S V N S ( M ¯ 1 , M ¯ 2 ) 1 .
P2. Apparently, Cos S V N S ( M ¯ 1 , M ¯ 2 ) = T ¯ 1 T ¯ 2 + ( 1 I ¯ 1 ) ( 1 I ¯ 2 ) + ( 1 F ¯ 1 ) ( 1 F ¯ 2 ) ( T ¯ 1 2 + ( 1 I ¯ 1 ) 2 + ( 1 F ¯ 1 ) 2 ) ( T ¯ 2 2 + ( 1 I ¯ 2 ) 2 + ( 1 F ¯ 2 ) 2 ) = T ¯ 2 T ¯ 1 + ( 1 I ¯ 2 ) ( 1 I ¯ 1 ) + ( 1 F ¯ 2 ) ( 1 F ¯ 1 ) ( T ¯ 2 2 + ( 1 I ¯ 2 ) 2 + ( 1 F ¯ 2 ) 2 ) ( T ¯ 1 2 + ( 1 I ¯ 1 ) 2 + ( 1 F ¯ 1 ) 2 ) = Cos S V N S ( M ¯ 2 , M ¯ 1 ) .
P3. If M ¯ 1 = M ¯ 2 , then we have Cos S V N S ( M ¯ 1 , M ¯ 2 ) = Cos S V N S ( M ¯ 1 , M ¯ 1 ) = M ¯ 1 M ¯ 1 M ¯ 1 M ¯ 1 = 1 .
Moreover, the cosine measure of the included angle between M ¯ 1 and M ¯ 2 , that is, Cos S V N N ( M ¯ 1 , M ¯ 2 ) , always satisfies the properties presented in Theorem 1.  □
Definition 7.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } . Then, the improved single-valued neutrosophic projection measure of M ¯ 1 on M ¯ 2 can be developed as follows:
I Pr o M ¯ 2 ( M ¯ 1 ) = M ¯ 1 Co s S V N S ( M ¯ 1 , M ¯ 2 ) = M ¯ 1 M ¯ 2 M ¯ 2 = i = 1 n ( T ¯ 1 ( x i ) T ¯ 2 ( x i ) + ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 2 ( x i ) ) + ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 2 ( x i ) ) ) i = 1 n ( T ¯ 2 ( x i ) 2 + ( 1 I ¯ 2 ( x i ) ) 2 + ( 1 F ¯ 2 ( x i ) ) 2 ) .
Example 3.
Based on Example 1, I Pr o M ¯ 2 ( M ¯ 1 ) = 1 × 1 + ( 1 1 ) × ( 1 0 ) + ( 1 1 ) × ( 1 0 ) 1 2 + ( 1 0 ) 2 + ( 1 0 ) 2 = 1 3 and I Pr o M ¯ 2 ( M ¯ 2 ) = 1 × 1 + ( 1 0 ) × ( 1 0 ) + ( 1 0 ) × ( 1 0 ) 1 2 + ( 1 0 ) 2 + ( 1 0 ) 2 = 3 can be obtained. Because I Pr o M ¯ 2 ( M ¯ 2 ) > I Pr o M ¯ 2 ( M ¯ 1 ) , M ¯ 2 is much closer to M ¯ 2 than M ¯ 1 , the results are consistent with our intuition. Therefore, the improved single-valued neutrosophic projection measure is more reasonable and effective than the existing projection defined by Ye [37].
Theorem 2.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) , M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) , and M ¯ 3 = ( M ¯ 3 ( x 1 ) , M ¯ 3 ( x 2 ) , , M ¯ 3 ( x n ) ) be three SVNSs on the universe X = { x 1 , x 2 , , x n } , then the improved single-valued neutrosophic projection measure presented in Definition 7, that is, Equation (6), satisfies the following properties:
P1. 0 I Pr o M ¯ 2 ( M ¯ 1 ) 3 n ;
P2. If M ¯ 1 = M ¯ 2 , then I Pr o M ¯ 2 ( M ¯ 1 ) = I Pr o M ¯ 1 ( M ¯ 2 ) ;
P3. If M ¯ 1 M ¯ 2 M ¯ 3 , then I Pr o M ¯ 3 ( M ¯ 1 ) I Pr o M ¯ 3 ( M ¯ 2 ) .
Proof. 
P1. As 0 Cos S V N S ( M ¯ 1 , M ¯ 2 ) 1 and 0 M ¯ 1 3 n , 0 I Pr o M ¯ 2 ( M ¯ 1 ) = M ¯ 1 Co s S V N S ( M ¯ 1 , M ¯ 2 ) 3 n can be obtained.
P2. If M ¯ 1 = M ¯ 2 , then we have I Pr o M ¯ 2 ( M ¯ 1 ) = M ¯ 1 Co s S V N S ( M ¯ 1 , M ¯ 2 ) = M ¯ 2 Co s S V N S ( M ¯ 2 , M ¯ 1 ) = I Pr o M ¯ 1 ( M ¯ 2 ) .
P3. If M ¯ 1 M ¯ 2 M ¯ 3 , then we have T ¯ 1 ( x i ) T ¯ 2 ( x i ) T ¯ 3 ( x i ) , I ¯ 1 ( x i ) I ¯ 2 ( x i ) I ¯ 3 ( x i ) and F ¯ 1 ( x i ) F ¯ 2 ( x i ) F ¯ 3 ( x i ) for any x i X . Thus, T ¯ 1 ( x i ) · T ¯ 3 ( x i ) T ¯ 2 ( x i ) T ¯ 3 ( x i ) , ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 3 ( x i ) ) ( 1 I ¯ 2 ( x i ) ) ( 1 I ¯ 3 ( x i ) ) , and ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 3 ( x i ) ) ( 1 F ¯ 2 ( x i ) ) ( 1 F ¯ 3 ( x i ) ) . Thus, T ¯ 1 ( x i ) T ¯ 3 ( x i ) + ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 3 ( x i ) ) + ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 3 ( x i ) ) T ¯ 2 ( x i ) T ¯ 3 ( x i ) + ( 1 I ¯ 2 ( x i ) ) ( 1 I ¯ 3 ( x i ) ) + ( 1 F ¯ 2 ( x i ) ) ( 1 F ¯ 3 ( x i ) ) , that is, M ¯ 1 M ¯ 3 M ¯ 2 M ¯ 3 . According to Definition 7, we can achieve M ¯ 1 M ¯ 3 M ¯ 3 M ¯ 2 M ¯ 3 M ¯ 3 , that is, I Pr o M ¯ 3 ( M ¯ 1 ) I Pr o M ¯ 3 ( M ¯ 2 ) . □

3.2. The Single-Valued Neutrosophic Bidirectional Projection Measure

On the basis of the improved single-valued neutrosophic inner product and single-valued neutrosophic projection measure, the corresponding improved single-valued neutrosophic bidirectional projection measure is developed in this section.
Definition 8.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } . Then, the corresponding improved single-valued neutrosophic bidirectional projection measure of M ¯ 1 on M ¯ 2 is developed as follows:
I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) = 1 1 + | M ¯ 1 M ¯ 2 | M ¯ 1 M ¯ 2
where M ¯ 1 M ¯ 2 = i = 1 n ( T ¯ 1 ( x i ) T ¯ 2 ( x i ) + ( 1 I ¯ 1 ( x i ) ) ( 1 I ¯ 2 ( x i ) ) + ( 1 F ¯ 1 ( x i ) ) ( 1 F ¯ 2 ( x i ) ) ) denotes the inner product between M ¯ 1 and M ¯ 2 . In addition, M ¯ 1 = i = 1 n ( T ¯ 1 ( x i ) 2 + ( 1 I ¯ 1 ( x i ) ) 2 + ( 1 F ¯ 1 ( x i ) ) 2 ) and M ¯ 2 = i = 1 n ( T ¯ 2 ( x i ) 2 + ( 1 I ¯ 2 ( x i ) ) 2 + ( 1 F ¯ 2 ( x i ) ) 2 ) represent the modules of M ¯ 1 and M ¯ 2 , respectively.
Example 4.
According to Example 1 and Definition 8, we have I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) = 1 1 + | M ¯ 1 M ¯ 2 | M ¯ 1 M ¯ 2 = 1 1 + | 1 3 | × 1 = 3 3 and I B Pr o S V N S ( M ¯ 2 , M ¯ 2 ) = 1 1 + | M ¯ 2 M ¯ 2 | M ¯ 2 M ¯ 2 = 1 1 + 0 = 1 . Then, I B Pr o S V N S ( M ¯ 2 , M ¯ 2 ) > I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) . Apparently, the results achieved using the corresponding single-valued neutrosophic bidirectional projection measure are the same as the results of the bidirectional projection measure in Ye [37]. In other words, the corresponding single-valued neutrosophic bidirectional projection measure based on improved single-valued neutrosophic projection is as effective as the bidirectional projection measure presented by Ye [34].
Theorem 3.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } , accordingly, the improved single-valued neutrosophic bidirectional projection measure presented in Definition 8, that is, Equation (7), satisfies the following properties:
P1. 0 I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) 1 ;
P2. I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) = I B Pr o S V N S ( M ¯ 2 , M ¯ 1 ) ;
P3.If M ¯ 1 = M ¯ 2 , then I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) = 1 .
Proof. 
P1. Because 0 1 1 + | M ¯ 1 M ¯ 2 | M ¯ 1 M ¯ 2 1 , 0 I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) 1 .
P2. I B Pr o S V N S ( M ¯ 1 , M ¯ 2 ) = 1 1 + | M ¯ 1 M ¯ 2 | M ¯ 1 M ¯ 2 = 1 1 + | M ¯ 2 M ¯ 1 | M ¯ 2 M ¯ 1 = I B Pr o S V N S ( M ¯ 2 , M ¯ 1 ) .
P3. If M ¯ 1 = M ¯ 2 , then I B Pr o S V N S ( M ¯ 1 , M ¯ 1 ) = 1 1 + | M ¯ 1 M ¯ 1 | M ¯ 1 M ¯ 1 = 1 1 + 0 = 1 . □
Theorem 4.
Let M ¯ = ( M ¯ ( x 1 ) , M ¯ ( x 2 ) , , M ¯ ( x n ) ) , M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) , and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be three SVNSs on the universe X = { x 1 , x 2 , , x n } , and M * be an ideal SVNS, consequently, the following properties can be achieved:
P1. 0 I B Pr o S V N S ( M ¯ , M * ) 1 ;
P2. I B Pr o S V N S ( M ¯ , M * ) = I B Pr o S V N S ( M * , M ¯ ) ;
P3. I B Pr o S V N S ( M * , M * ) = 1 .
Proof. 
According to the proof of Theorem 3, Theorem 4 is true as well.  □

3.3. The Single-Valued Neutrosophic Bidirectional Projection Difference Measure

According to single-valued neutrosophic bidirectional projection, the corresponding difference measure and the partial ordering relation of SVNSs are discussed in the following.
Definition 9.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } , and M * be the ideal SVNS, then the single-valued neutrosophic bidirectional projection difference measure between M ¯ 1 and M ¯ 2 can be defined as follows:
D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * )
Theorem 5.
The bidirectional projection difference measure defined in Definition 9, that is, Equation (8), satisfies the following properties:
P1. 1 D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) 1 ;
P2. If M ¯ 1 = M ¯ 2 , then D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = 0 ;
P3. If D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) 0 and D i f f I B Pr o ( M ¯ 2 , M ¯ 3 ) 0 , thus D i f f I B Pr o ( M ¯ 1 , M ¯ 3 ) 0 .
Proof. 
P1. On the basis of Theorem 4, we have 0 I B Pr o S V N S ( M ¯ 1 , M * ) 1 and 0 I B Pr o S V N S ( M ¯ 2 , M * ) 1 , that is, 1 I B Pr o S V N S ( M ¯ 2 , M * ) 0 . Thus, 1 I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) 1 , that is, 1 D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) 1 .
P2. If M ¯ 1 = M ¯ 2 , then D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 1 , M * ) = 0 .
P3. As D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 1 , M * ) 0 and D i f f I B Pr o ( M ¯ 2 , M ¯ 3 ) = I B Pr o S V N S ( M ¯ 2 , M * ) I B Pr o S V N S ( M ¯ 3 , M * ) 0 , D i f f I B Pr o ( M ¯ 1 , M ¯ 3 ) = I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 3 , M * ) = ( I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) ) + ( I B Pr o S V N S ( M ¯ 2 , M * ) I B Pr o S V N S ( M ¯ 3 , M * ) ) 0 . □
Definition 10.
Let M ¯ 1 = ( M ¯ 1 ( x 1 ) , M ¯ 1 ( x 2 ) , , M ¯ 1 ( x n ) ) and M ¯ 2 = ( M ¯ 2 ( x 1 ) , M ¯ 2 ( x 2 ) , , M ¯ 2 ( x n ) ) be two SVNSs on the universe X = { x 1 , x 2 , , x n } , and M * be an ideal SVNS. Then, the partial ordering relation of SVNSs can be formulated as follows:
(1) If D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) > 0 , that is, I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) > 0 , that is, I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) > 0 , then M ¯ 1 is preferred to M ¯ 2 , denoted by M ¯ 1 M ¯ 2 ;
(2) If D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = 0 , that is, I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) = 0 , then M ¯ 1 is indifferent to M ¯ 2 , denoted by M ¯ 1 ~ M ¯ 2 ;
(3) If D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) < 0 , that is, I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) < 0 , then M ¯ 1 is inferior to M ¯ 2 , denoted by M ¯ 1 M ¯ 2 .
Example 5.
Let M ¯ 1 = { x , 0.6 , 0.2 , 0.2 } and M ¯ 2 = { x , 0.6 , 0.1 , 0.1 } be two SVNSs. Based on Equations (7) and (8), we I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) < 0 can obtain D i f f I B Pr o ( M ¯ 1 , M ¯ 2 ) = I B Pr o S V N S ( M ¯ 1 , M * ) I B Pr o S V N S ( M ¯ 2 , M * ) = 1 1 + | 0.6 2 + 0.8 2 + 0.8 2 1 2 + 1 2 + 1 2 | × ( 0.6 × 1 + 0.8 × 1 + 0.8 × 1 ) 1 1 + | 0.6 2 + 0.9 2 + 0.9 2 1 2 + 1 2 + 1 2 | × ( 0.6 × 1 + 0.9 × 1 + 0.9 × 1 ) = 0.0101 < 0 . Thus, M ¯ 1 is inferior to M ¯ 2 , that is, M ¯ 1 M ¯ 2 , which is consistent with our intuition.

4. The Single-Valued Neutrosophic Projection-Based QUALIFLEX Method

The QUALIFLEX method is based on the pair-wise comparisons of alternatives with respect to each criterion under all possible permutations of the alternatives. It is a useful outranking method because of its flexibility with respect to cardinal and ordinal information [47] and has been extensively extended to different environments. Although the method of Ye [37] based on single-valued neutrosophic bidirectional projection is simple and effective, it cannot consider the relations between criteria. Moreover, because of decision-maker’s knowledge, the weight information of criteria is always partly known or incompletely known in some real decision-making situations, so the single-valued neutrosophic projection-based QUALIFLEX method with incomplete weight information is proposed in this section.
In an actual decision-making process, because of the intangibility of the decision environment and the decision-maker’s subjectivity, it is difficult to express their preferences. SVNS can overcome these shortcomings by consideration of three different aspects of decision-makers. Moreover, management-based decision-making problems always involve several criteria. Thus, the MCDM method with single-valued neutrosophic information plays a major role in management. Assume a group of alternatives denoted as M ¯ = { M ¯ 1 , M ¯ 2 , , M ¯ n } and corresponding criteria denoted by C = { c 1 , c 2 , , c m } , in which the weight of criterion w j is fully unknown. M ¯ i j = T M ¯ i j , I M ¯ i j , F M ¯ i j represents the evaluation value of M ¯ i with respect to criterion c j . T M ¯ i j , I M ¯ i j , and F M ¯ i j indicate the truth-membership, the indeterminacy-membership, and the falsity-membership, respectively. The proposed method consists of the following steps.
Step 1. Normalization of the decision matrix.
Each criterion can be divided into two types—benefit-based criteria, meaning the lager the better; and cost-based criteria, meaning the smaller the better. For the benefit-based criteria, nothing needs to be conducted; for the cost-based criteria, the criterion values can be transformed as M ¯ i j = ( M ¯ i j ) c   ( i = 1 , 2 , , n ; j = 1 , 2 , , m ) . Here, ( M ¯ i j ) c is the complement of M ¯ i j as presented in Definition 2.
Step 2. Calculation of the weight of criteria.
On the basis of the maximizing deviation method of SVNSs defined by Sahin and Liu [48], the weight of criteria ϖ j ( j = 1 , 2 , , m ) can be achieved as follows:
ϖ j * = i = 1 n t = 1 n ( | T M ¯ i j T M ¯ t j | + | I M ¯ i j I M ¯ t j | + | F M ¯ i j F M ¯ t j | ) j = 1 m i = 1 n t = 1 n ( | T M ¯ i j T M ¯ t j | + | I M ¯ i j I M ¯ t j | + | F M ¯ i j F M ¯ t j | ) ( i , t = 1 , 2 , , n ; j = 1 , 2 , , m )
Step 3. Determination of the possible permutations.
For a group of alternative M ¯ i ( i = 1 , 2 , , n ) , there exist n ! permutations of different ranks of alternatives. Assume P δ represents the δ -th permutation as follows:
P δ = ( , M ¯ ξ , , M ¯ ς , ) ( δ = 1 , 2 , , n ! ; ξ , ς = 1 , 2 , , n )
Here, M ¯ ξ , M ¯ ς M ¯ and M ¯ ξ is superior than or equal to M ¯ ς .
Step 4. Calculation of the concordance index.
For each pair of alternatives ( M ¯ ξ , M ¯ ς ) ( M ¯ ξ , M ¯ ς M ¯ ) with respect to the j -th criterion, the corresponding concordance index φ j δ ( M ¯ ξ , M ¯ ς ) , can be defined as follows:
φ j δ ( M ¯ ξ , M ¯ ς ) = D i f f I B Pr o ( M ¯ ξ , M ¯ ς )
According to the partial ordering relation of SVNSs, the following assumptions can be true:
(1) If φ j δ ( M ¯ ξ , M ¯ ς ) > 0 , that is, D i f f I B Pr o ( M ¯ ξ j , M ¯ ς j ) > 0 , then M ¯ ξ ranks over M ¯ ς with respect to the j -th criterion under the δ -th permutation;
(2) If φ j δ ( M ¯ ξ , M ¯ ς ) = 0 , that is, D i f f I B Pr o ( M ¯ ξ j , M ¯ ς j ) = 0 , then both M ¯ ξ and M ¯ ς have the same rank with respect to the j -th criterion under the δ -th permutation;
(3) If φ j δ ( M ¯ ξ , M ¯ ς ) < 0 , that is, D i f f I B Pr o ( M ¯ ξ j , M ¯ ς j ) < 0 , then M ¯ ς ranks over M ¯ ξ with respect to the j -th criterion under the δ -th permutation.
Step 5. Determination of the weighted concordance index.
Considering the importance weight ϖ j of each criterion that c j C is expressed by SVNNs, the weighted concordance/discordance index φ j δ ( M ¯ ξ , M ¯ ς ) for each pair of alternatives ( M ¯ ξ , M ¯ ς ) ( M ¯ ξ , M ¯ ς M ¯ ) can be denoted as follows:
φ δ ( M ¯ ξ , M ¯ ς ) = j = 1 m φ j δ ( M ¯ ξ , M ¯ ς ) ϖ j ( j = 1 , 2 , , m )
Here, ϖ j ( j = 1 , 2 , , m ) is the weight of criteria c j ( j = 1 , 2 , , m ) .
Step 6. Calculation of the comprehensive concordance index.
For the δ -th permutation, the corresponding comprehensive concordance index φ δ can be calculated as follows:
φ δ = Μ ¯ ξ , Μ ¯ ς Μ ¯ φ δ ( M ¯ ξ , M ¯ ς )
Step 7. Ranking the alternatives.
According to the partial ordering relation of SVNNs, it can be observed that the greater the comprehensive concordance index value, the more optimal the final ranking. Thus, the optimal rank can be obtained with the help of the maximal comprehensive concordance/discordance index φ δ , that is,
P * = max δ = 1 n ! { φ δ }

5. An Illustrative Example

In this section, an example of an MCDM problem (adapted from that provided in the work of [49]) is used to demonstrate the application and effectiveness of the proposed decision-making approach.
In order to attenuate environmental impacts and increase ecological efficiency, ABC automobile manufacturing company attempts to implement green practices at all stages of the manufacturing process to achieve profit and market share objectives. Thus, how to choose a proper green supplier from several potential suppliers is an MCDM problem. Assume that there are three possible green suppliers, M ¯ i ( i = 1 , 2 , 3 ) , that can be selected. Each supplier is assessed based on nine criteria, which are denoted by c j ( j = 1 , 2 , , 9 ) ; where c 1 is the pollution produced, such as average volume of air emission pollutant, waster, solid wastes, and harmful materials, which can be released per day during measurement period; c 2 is the resource consumption, such as resource consumption in terms of raw materials, energy, and water during the measurement period; c 3 is the eco-design, including design of products for reduced consumption of material/energy, design of products for reuse, recycle, and recovery of materials; c 4 is a green image, such as the ratio of green customers to total customers; c 5 is the environmental management system, including environmental certifications, such as ISO-1400, environmental policies, planning of environmental objectives, as well as checking and control of environmental activities; c 6 represents the commitment to green supply chain management on behalf of managers, including senior and mid-level managers’ commitment and support to improve green supply chain management practices and environmental performance; c 7 denotes the use of an environmentally-friendly technology, such as the application of the environmental science to conserve the natural environment and resources, and to curb the negative impacts of human involvement; c 8 represents the use of environmentally-friendly materials, including the level of green recyclable materials used in packaging and manufacturing of goods; and c 9 is the staff environmental training, involving training targets. Moreover, c 1 is a minimizing type, and other criteria are of the maximizing type. A decision-maker was invited to assess the performance of these three potential suppliers using each criterion in form of SVNNs. The evaluation results are presented in Table 1.

5.1. An Illustration of the Proposed Method

The procedures for obtaining the optimal alternative, using the developed method, are as follows.
Step 1. Normalization of the decision-making matrix.
As c 1 is a minimizing type, and other criteria are of the maximizing type, the normalized SVNN decision matrix is calculated and shown in Table 2.
Step 2. Calculation of the weight of criteria.
From Equation (9), the weight of criteria can be obtained as ϖ = ( 0.0851 , 0.1064 , 0.0851 , 0.1277 , 0.1489 , 0.1489 , 0.1702 , 0.0851 , 0.0426 ) T .
Step 3. Determination of all the possible permutations.
As n = 3 , we have 6( 3 ! = 6 ) permutations of alternative rankings, that is, P 1 = ( M ¯ 1 , M ¯ 2 , M ¯ 3 ) , P 2 = ( M ¯ 1 , M ¯ 3 , M ¯ 2 ) , P 3 = ( M ¯ 2 , M ¯ 1 , M ¯ 3 ) , P 4 = ( M ¯ 2 , M ¯ 3 , M ¯ 1 ) , P 5 = ( M ¯ 3 , M ¯ 1 , M ¯ 2 ) , and P 6 = ( M ¯ 3 , M ¯ 2 , M ¯ 1 ) .
Step 4. Calculation of the concordance index.
According to the single-valued neutrosophic bidirectional projection and corresponding difference measure, that is, Equations (7) and (10), the concordance index φ j δ ( M ¯ ξ , M ¯ ς ) for each pair of alternatives ( M ¯ ξ , M ¯ ς ) ( M ¯ ξ , M ¯ ς M ¯ ) in the permutation P δ under criterion c j can be obtained (see Table 3).
Step 5. Calculation of the weighted concordance index.
The weighted concordance index φ δ ( M ¯ ξ , M ¯ ς ) can be calculated as presented in Table 4.
Step 6. Calculation of the comprehensive concordance index.
From Equation (13), the comprehensive concordance index φ δ can be calculated as shown in Table 5.
Step 7. Ranking the alternatives.
On the basis of the results presented in Table 5, φ 3 > φ 1 > φ 4 > φ 2 > φ 6 > φ 5 and P * = max κ = 1 n ! { φ δ } = P 3 can be obtained. Thus, the final order of the three plans is as follows: M ¯ 2 M ¯ 1 M ¯ 3 . The best plan is M ¯ 2 , while M ¯ 3 is the worst.

5.2. Comparison Analysis

To further validate the practicability of the proposed method, a comparison analysis was undertaken by utilizing some existing methods with the help of single-valued neutrosophic information.
The first comparative method is the projection measure method defined in Ye [37]. Because the compared method cannot appropriately handle single-valued neutrosophic information where the weight is fully unknown, the weights of criteria can be determined as ϖ = ( 0.0851 , 0.1064 , 0.0851 , 0.1277 , 0.1489 , 0.1489 , 0.1702 , 0.0851 , 0.0426 ) T . Then, from M ¯ j * = ( T j * , I j * , F j * ) = ( max i ( T j * ) , min i ( I j * ) , min i ( F j * ) ) ( j = 1 , 2 , , 9 ) , the corresponding ideal solution can be obtained as follows:
M ¯ * = { ( 0.7 , 0.4 , 0.5 ) , ( 0.6 , 0.3 , 0.2 ) , ( 0.7 , 0.3 , 0.3 ) , ( 0.7 , 0.1 , 0.2 ) , ( 0.7 , 0.2 , 0.2 ) , ( 0.7 , 0.2 , 0.2 ) 0.8 , 0.2 , 0.4 , 0.8 , 0.2 , 0.3 , 0.8 , 0.2 , 0.4 } .
Thus, the following results is determined as follows:
M ¯ * = 0.2871 ; | M ¯ | 1 = 0.3033 ; | M ¯ | 2 = 0.2935 ; | M ¯ | 3 = 0.2801 . Thus, according to the bidirectional projection measure defined in Ye [37], that is, Equation (3), the weighted bidirectional projection measure between an alternative M ¯ i ( i = 1 , 2 , 3 ) and the ideal solution M ¯ * can be calculated as follows:
B Pr o j w ( M ¯ 1 , M ¯ * ) = 0.9847 ; B Pr o j w ( M ¯ 2 , M ¯ * ) = 0.9939 ; B Pr o j w ( M ¯ 3 , M ¯ * ) = 0.9934 .
Then, the final ranking is M ¯ 2 M ¯ 3 M ¯ 1 .
Similarly, the projection measure between an alternative M ¯ i ( i = 1 , 2 , 3 ) and the ideal solution M ¯ * can be calculated as follows:
Pr o j w M ¯ * ( M ¯ 1 ) = 0.2908 ; Pr o j w M ¯ * ( M ¯ 2 ) = 0.2794 ; Pr o j w M ¯ * ( M ¯ 3 ) = 0.2666 .
The final ranking is M ¯ 1 M ¯ 2 M ¯ 3 . Apparently, the result using the projection measure is different from those using the bidirectional projection measure. In other words, we cannot utilize the proposed method in Ye [37] to choose the optimal ones of three potential suppliers.
In addition, some other existing methods with single-valued neutrosophic information are compared with the proposed approach. Those methods mainly focus on the outranking methods [29], aggregation operators [31,32,50,51], and measures [34,36,37]. Because the compared methods cannot deal with single-valued neutrosophic information where the weight information is completely unknown, the weight is determined as ϖ = ( 0.0851 , 0.1064 , 0.0851 , 0.1277 , 0.1489 , 0.1489 , 0.1702 , 0.0851 , 0.0426 ) T . Then, the compared results are eventually achieved and presented in Table 6.
According to the results presented in Table 6, it can be seen that the results obtained from the proposed approach are consistent with the compared methods presented by Garg [32], Ye [36], and Peng et al. [29]; the optimal green supplier is M ¯ 2 , whereas the worst green supplier is M ¯ 3 . For the other compared methods, there always exists a slight difference in the final rankings to some extent. Especially, although the preference relations between M ¯ 1 and M ¯ 3 cannot be discerned, the optimal alternative using the bidirectional projection of Ye [37] is the same as the one of the proposed approach.
According to the results presented above, we can conclude the following results. Firstly, the methods based on aggregation operators [31,32,50,51] involve different norms and parameters, which may produce different rankings. Moreover, it is difficult for decision-makers to choose an optimal operator, as well as corresponding parameters in a real decision-making process. Secondly, the results obtained using the method presented by Ye [37] are different form the proposed method’s findings. The reason is that the projection was defined based on the inner product. However, the inner product is unreasonable as discussed in Section 2. Thirdly, Peng et al.’s outranking method [29] is only appropriate for solving the MCDM problems in which the number of alternatives is more than the number of criteria. Finally, all the compared methods cannot deal with some special cases, in which the weight information is fully unknown. However, the proposed approach can avoid these shortcomings. Thus, the proposed method based on the projection is reasonable and effective, and it can further broaden the application of decision-making methods.

6. Conclusions

In this study, an improved cosine measure of the included angle between two SVNSs was initially defined. Then, an improved projection, bidirectional projection, and corresponding bidirectional projection difference of SVNSs were investigated. On the basis of the developed measures, a single-valued neutrosophic bidirectional projection-based QUALIFLEX approach was proposed to deal with MCDM problems in which the weights of criteria were fully unknown. A green supplier example demonstrated the effectiveness of the proposed method, and showed that the results are reasonable and credible. The main contribution of this research is that the developed improved projection can overcome the limitations, as we discussed previously. Furthermore, the proposed method based on the projection would be appropriate to handle the MCDM problems in which the number of alternatives is less than the number of criteria and the weight information is completely unknown, which can be used to obtain credible and realistic results. However, the main limitation of the proposed method is that it cannot properly deal with some problems in which the number of alternatives is greater than the number of criteria. In the future, the related distance measures of SVNSs will be further investigated.

Author Contributions

C.T. and J.J.P. work together to finish this work. W.Y.Z. and S.Z. provided many suggestions enhancing the readability of work. All authors approved the publication work.

Funding

This work is supported by the National Natural Science Foundation of China (Grant Nos. 71701065, 51475410, 51875503 and 71571193), the Postdoctoral Science Foundation of China (Grant No. 2017M610511), and Natural Science Foundation of Zhejiang Province (Grant No. LY17E050010).

Acknowledgments

The authors are deeply grateful for the comments provided by anonymous reviewers to improve this paper.

Conflicts of Interest

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

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–356. [Google Scholar] [CrossRef]
  2. Bellman, R.; Zadeh, L.A. Decision making in a fuzzy environment. Manag. Sci. 1970, 17, 141–164. [Google Scholar] [CrossRef]
  3. Yager, R.R. Multiple objective decision-making using fuzzy sets. Int. J. Man-Mach. Stud. 1997, 9, 375–382. [Google Scholar] [CrossRef]
  4. Zadeh, L.A. Fuzzy logic and approximate reasoning. Synthese 1975, 30, 407–428. [Google Scholar] [CrossRef]
  5. Sarkar, B.; Omair, M.; Choi, S.B. A multi-objective optimization of energy, economic, and carbon emission in a production model under sustainable supply chain management. Appl. Sci. 2018, 8, 1744. [Google Scholar] [CrossRef]
  6. Pedrycz, W. Fuzzy sets in pattern recognition: Methodology and methods. Pattern Recognit. 1990, 23, 121–146. [Google Scholar] [CrossRef]
  7. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  8. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistructure 2010, 4, 410–413. [Google Scholar]
  9. Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  10. Smarandache, F. A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics, 3rd ed.; Xiquan: Phoenix, AZ, USA, 2003. [Google Scholar]
  11. Rivieccio, U. Neutrosophic logics: Prospects and problems. Fuzzy Sets Syst. 2008, 159, 1860–1868. [Google Scholar] [CrossRef]
  12. Majumdar, P.; Samant, S.K. On similarity and entropy of neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 1245–1252. [Google Scholar]
  13. 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]
  14. Lupiáñez, F.G. Interval neutrosophic sets and topology. Kybernetes 2009, 38, 621–624. [Google Scholar] [CrossRef]
  15. Hu, J.H.; Pan, L.; Chen, X.H. An interval neutrosophic projection-based VIKOR method for selecting doctors. Cogn. Comput. 2017, 9, 801–816. [Google Scholar] [CrossRef]
  16. Wang, Y.; Wang, J.Q.; Wang, T.L. Fuzzy stochastic multi-criteria decision-making methods with interval neutrosophic probability based on regret theory. J. Intell. Fuzzy Syst. 2018, 35, 2309–2322. [Google Scholar] [CrossRef]
  17. Wang, Y.; Wang, X.K.; Wang, J.Q. Cloud service reliability assessment approach based on multi-valued neutrosophic cross-entropy and entropy measures. Filomat 2018. [Google Scholar] [CrossRef]
  18. Jun, Y.B.; Smarandache, F.; Kim, C.S. Neutrosophic cubic sets. New Math. Nat. Comput. 2017, 13, 41–54. [Google Scholar] [CrossRef]
  19. Ye, J. Operations and aggregation method of neutrosophic cubic numbers for multiple attribute decision-making. Soft Comput. 2018, 22, 7435–7444. [Google Scholar] [CrossRef]
  20. 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]
  21. Peng, J.J.; Wang, J.Q.; Hu, J.H.; Tian, C. Multi-criteria decision-making approach based on single-valued neutrosophic hesitant fuzzy geometric weighted Choquet integral heronian mean operator. J. Intell. Fuzzy Syst. 2018, 35, 3661–3674. [Google Scholar] [CrossRef]
  22. Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic set. Neutrosophic Sets Syst. 2014, 3, 62–67. [Google Scholar]
  23. Pramanik, S.; Roy, R.; Roy, K.T. Multi criteria decision making based on projection and bidirectional projection measures of rough neutrosophic sets. In New Trends in Neutrosophic Theory and Applications, Volume II; Pons Editions: Brussels, Belgium, 2017; pp. 1–15. [Google Scholar]
  24. 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. Neutrosophic Sets Syst. 2018, 19, 101–109. [Google Scholar]
  25. Broumi, S.; Talea, M.; Bakali, A.; Smarandache, F. Single valued neutrosophic graphs. J. New Theory 2016, 10, 86–101. [Google Scholar]
  26. Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F. Isolated single valued neutrosophic graphs. Neutrosophic Sets Syst. 2016, 11, 74–78. [Google Scholar]
  27. Broumi, S.; Talea, M.; Bakali, A.; Smarandache, F. On bipolar single valued neutrosophic graphs. J. New Theory 2016, 11, 84–102. [Google Scholar]
  28. Li, Y.Y.; Wang, J.Q.; Wang, T.L. A linguistic neutrosophic multi-criteria group decision-making approach with EDAS method. Arab. J. Sci. Eng. 2018. [Google Scholar] [CrossRef]
  29. 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]
  30. 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]
  31. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  32. Garg Nancy, 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] [CrossRef]
  33. 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]
  34. Ye, J. Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses. Artif. Intell. Med. 2015, 63, 171–179. [Google Scholar] [CrossRef]
  35. Ye, J. Clustering methods using distance-based similarity measures of single-valued neutrosophic Sets. J. Intell. Syst. 2014, 23, 379–389. [Google Scholar] [CrossRef]
  36. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision making problems. Appl. Math. Model. 2014, 38, 1170–1175. [Google Scholar] [CrossRef]
  37. Ye, J. Projection and bidirectional projection measures of single-valued neutrosophic sets and their decision-making method for mechanical design schemes. J. Exp. Artif. Intell. 2017, 29, 731–740. [Google Scholar] [CrossRef]
  38. Paelinck, J.H.P. Qualitative multiple criteria analysis. environmental protection and multiregional development. Pap. Reg. Sci. Assoc. 1976, 36, 59–76. [Google Scholar] [CrossRef]
  39. Paelinck, J.H.P. Qualitative multicriteria analysis: An application to airport location. Environ. Plan. A 1977, 9, 883–895. [Google Scholar] [CrossRef]
  40. Paelinck, J.H.P. Qualiflex: A flexible multiple-criteria method. Econ. Lett. 1978, 1, 193–197. [Google Scholar] [CrossRef]
  41. Martel, J.M.; Matarazzo, B. Other Outranking Approaches, in Multiple Criteria Decision Analysis: State of the Art Surveys; Springer: Berlin, Germany, 2005; pp. 197–259. [Google Scholar]
  42. Chen, T.Y. Data construction process and qualiflex-based method for multiple-criteria group decision making with interval-valued intuitionistic fuzzy sets. Int. J. Inf. Technol. Decis. Mak. 2013, 12, 425–467. [Google Scholar] [CrossRef]
  43. Chen, T.Y. Interval-valued intuitionistic fuzzy QUALIFLEX method with a likelihood-based comparison approach for multiple criteria decision analysis. Inf. Sci. 2014, 261, 149–169. [Google Scholar] [CrossRef]
  44. Ji, P.; Zhang, H.Y.; Wang, J.Q. Fuzzy decision-making framework for treatment selection based on the combined QUALIFLEX-TODIM method. Int. J. Syst. Sci. 2017, 48, 3072–3086. [Google Scholar] [CrossRef]
  45. Li, J.; Wang, J.Q. An extended QUALIFLEX method under probability hesitant fuzzy environment for selecting green suppliers. Int. J. Fuzzy Syst. 2017, 19, 1866–1879. [Google Scholar] [CrossRef]
  46. 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]
  47. Rebai, A.; Aouni, B.; Martel, J.-M. A multi-attribute method for choosing among potential alternatives with ordinal evaluation. Eur. J. Oper. Res. 2006, 174, 360–373. [Google Scholar] [CrossRef]
  48. Şahin, R.; Liu, P. Maximizing deviation method for neutrosophic multiple attribute decision making with incomplete weight information. Neural Comput. Appl. 2016, 27, 2017–2029. [Google Scholar] [CrossRef]
  49. Chen, T.Y.; Chang, C.H.; Lu, J.F.R. The extended QUALIFLEX method for multiple criteria decision analysis based on interval type-2 fuzzy sets and applications to medical decision making. Eur. J. Oper. Res. 2013, 226, 615–625. [Google Scholar] [CrossRef]
  50. 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]
  51. Peng, J.J.; Wang, J.Q.; Yang, L.J.; Qian, J. A novel multi-criteria group decision-making approach using simplied neutrosophic information. Int. J. Uncertain. Quantif. 2017, 7, 355–376. [Google Scholar] [CrossRef]
Table 1. Evaluation of the green suppliers by decision-makers in presence of different criteria.
Table 1. Evaluation of the green suppliers by decision-makers in presence of different criteria.
CriteriaSuppliers
M ¯ 1 M ¯ 2 M ¯ 3
c 1 (0.5,0.6,0.7)(0.6,0.5,0.5)(0.5,0.6,0.6)
c 2 (0.5,0.3,0.4)(0.6,0.5,0.2)(0.6,0.3,0.2)
c 3 (0.5,0.4,0.4)(0.7,0.3,0.3)(0.5,0.4,0.3)
c 4 (0.7,0.3,0.2)(0.5,0.2,0.4)(0.6,0.1,0.3)
c 5 (0.6,0.2,0.3)(0.5,0.4,0.2)(0.7,0.2,0.5)
c 6 (0.7,0.3,0.2)(0.6,0.4,0.3)(0.6,0.2,0.6)
c 7 (0.8,0.6,0.4)(0.7,0.4,0.6)(0.6,0.2,0.4)
c 8 (0.7,0.3,0.5)(0.8,0.2,0.4)(0.7,0.2,0.3)
c 9 (0.7,0.3,0.4)(0.8,0.2,0.4)(0.7,0.3,0.4)
Table 2. Normalized decision matrix.
Table 2. Normalized decision matrix.
CriteriaSuppliers
M ¯ 1 M ¯ 2 M ¯ 3
c 1 (0.7,0.4,0.5)(0.5,0.5,0.6)(0.6,0.4,0.5)
c 2 (0.5,0.3,0.4)(0.6,0.5,0.2)(0.6,0.3,0.2)
c 3 (0.5,0.4,0.4)(0.7,0.3,0.3)(0.5,0.4,0.3)
c 4 (0.7,0.3,0.2)(0.5,0.2,0.4)(0.6,0.1,0.3)
c 5 (0.6,0.2,0.3)(0.5,0.4,0.2)(0.7,0.2,0.5)
c 6 (0.7,0.3,0.2)(0.6,0.4,0.3)(0.6,0.2,0.6)
c 7 (0.8,0.6,0.4)(0.7,0.4,0.6)(0.6,0.2,0.4)
c 8 (0.7,0.3,0.5)(0.8,0.2,0.4)(0.7,0.2,0.3)
c 9 (0.7,0.3,0.4)(0.8,0.2,0.4)(0.7,0.3,0.4)
Table 3. The concordance index.
Table 3. The concordance index.
P 1 φ j 1 ( M ¯ 1 , M ¯ 2 ) φ j 1 ( M ¯ 1 , M ¯ 3 ) φ j 1 ( M ¯ 2 , M ¯ 3 ) P 2 φ j 2 ( M ¯ 1 , M ¯ 3 ) φ j 2 ( M ¯ 1 , M ¯ 2 ) φ j 2 ( M ¯ 3 , M ¯ 2 )
c 1 −0.0505−0.04760.0029 c 1 −0.0476−0.0505−0.0029
c 2 −0.0658−0.0698−0.0040 c 2 −0.0698−0.06580.0039
c 3 −0.0078−0.0427−0.0349 c 3 −0.0427−0.00780.0349
c 4 0.07740.0596−0.0178 c 4 0.05960.07740.0178
c 5 −0.07860.09000.1686 c 5 0.0900−0.0786−0.1686
c 6 0.02650.12900.1025 c 6 0.12900.0265−0.1025
c 7 0.0243−0.0843−0.1086 c 7 −0.08430.02430.1086
c 8 −0.0045−0.0461−0.0416 c 8 −0.0461−0.00450.0416
c 9 0.01880−0.0188 c 9 00.01880.0188
P 3 φ j 3 ( M ¯ 2 , M ¯ 1 ) φ j 3 ( M ¯ 2 , M ¯ 3 ) φ j 3 ( M ¯ 1 , M ¯ 3 ) P 4 φ j 4 ( M ¯ 2 , M ¯ 3 ) φ j 4 ( M ¯ 2 , M ¯ 1 ) φ j 4 ( M ¯ 3 , M ¯ 1 )
c 1 0.05050.0029−0.0476 c 1 0.00290.05050.0476
c 2 0.0658−0.0040−0.0698 c 2 −0.00400.06580.0698
c 3 0.0078−0.0349−0.0427 c 3 −0.03490.00780.0427
c 4 −0.0774−0.01780.0596 c 4 −0.0178−0.0774−0.0596
c 5 0.07860.16860.0900 c 5 0.16860.0786−0.0900
c 6 −0.02650.10250.1290 c 6 0.1025−0.0265−0.1290
c 7 −0.0243−0.1086−0.0843 c 7 −0.1086−0.02430.0843
c 8 0.0045−0.0416−0.0461 c 8 −0.04160.00450.0461
c 9 −0.0188−0.01880 c 9 −0.0188−0.01880
P 5 φ j 5 ( M ¯ 3 , M ¯ 1 ) φ j 5 ( M ¯ 3 , M ¯ 2 ) φ j 5 ( M ¯ 1 , M ¯ 2 ) P 6 φ j 6 ( M ¯ 3 , M ¯ 2 ) φ j 6 ( M ¯ 3 , M ¯ 1 ) φ j 6 ( M ¯ 2 , M ¯ 1 )
c 1 0.0476−0.0029−0.0505 c 1 −0.00290.04760.0505
c 2 0.06980.0040−0.0658 c 2 0.00400.06980.0658
c 3 0.04270.0349−0.0078 c 3 0.03490.04270.0078
c 4 −0.05960.01780.0774 c 4 0.0178−0.0596−0.0774
c 5 −0.0900−0.1686−0.0786 c 5 −0.1686−0.09000.0786
c 6 −0.1290−0.1025−0.0265 c 6 −0.1025−0.1290−0.0265
c 7 0.08430.10860.0243 c 7 0.10860.0843−0.0243
c 8 0.04610.0416−0.0045 c 8 0.04160.04610.0045
c 9 00.01880.0188 c 9 0.01880−0.0188
Table 4. The weighted concordance index.
Table 4. The weighted concordance index.
P 1 φ 1 ( M ¯ 1 , M ¯ 2 ) φ 1 ( M ¯ 1 , M ¯ 3 ) φ 1 ( M ¯ 2 , M ¯ 3 ) P 2 φ 2 ( M ¯ 1 , M ¯ 3 ) φ 2 ( M ¯ 1 , M ¯ 2 ) φ 2 ( M ¯ 3 , M ¯ 2 )
−0.00530.00680.01210.0068−0.0053−0.0121
P 3 φ 3 ( M ¯ 2 , M ¯ 1 ) φ 3 ( M ¯ 2 , M ¯ 3 ) φ 3 ( M ¯ 1 , M ¯ 3 ) P 4 φ 4 ( M ¯ 2 , M ¯ 3 ) φ 4 ( M ¯ 2 , M ¯ 1 ) φ 4 ( M ¯ 3 , M ¯ 1 )
0.00530.01210.00680.01210.0053−0.0069
P 5 φ 5 ( M ¯ 3 , M ¯ 1 ) φ 5 ( M ¯ 3 , M ¯ 2 ) φ 5 ( M ¯ 1 , M ¯ 2 ) P 6 φ 6 ( M ¯ 3 , M ¯ 2 ) φ 6 ( M ¯ 3 , M ¯ 1 ) φ 6 ( M ¯ 2 , M ¯ 1 )
−0.0069−0.0121−0.0053−0.0121−0.00690.0053
Table 5. The comprehensive concordance index.
Table 5. The comprehensive concordance index.
φ 1 φ 2 φ 3 φ 4 φ 5 φ 6
0.0137−0.01060.02430.0106−0.0243−0.0137
Table 6. The comparison results.
Table 6. The comparison results.
ReferencesAggregation OperatorRankings
Ye [31]Algebraic norm M ¯ 1 M ¯ 2 M ¯ 3
Garg [32]Frank norm ( λ = 1 , 3 ) M ¯ 2 M ¯ 1 M ¯ 3
Liu et al. [50]Hamacher operator ( λ = 1 , 3 ) M ¯ 2 M ¯ 1 M ¯ 3 or M ¯ 1 M ¯ 2 M ¯ 3
Peng et al. [51]Einstein norm M ¯ 2 M ¯ 3 M ¯ 1
ReferencesMeasureRankings
Ye [34]Cosine similarity M ¯ 2 M ¯ 3 M ¯ 1
Ye [36]Cross entropy M ¯ 2 M ¯ 1 M ¯ 3
Ye [37]Bidirectional projection
Projection
M ¯ 2 M ¯ 1 M ¯ 3
M ¯ 1 M ¯ 2 M ¯ 3
ReferencesOutrankingRankings
Peng et al. [29]ELECTRE III M ¯ 2 M ¯ 1 M ¯ 3
The proposed methodProjection M ¯ 2 M ¯ 1 M ¯ 3

Share and Cite

MDPI and ACS Style

Tian, C.; Zhang, W.Y.; Zhang, S.; Peng, J.J. An Extended Single-Valued Neutrosophic Projection-Based Qualitative Flexible Multi-Criteria Decision-Making Method. Mathematics 2019, 7, 39. https://doi.org/10.3390/math7010039

AMA Style

Tian C, Zhang WY, Zhang S, Peng JJ. An Extended Single-Valued Neutrosophic Projection-Based Qualitative Flexible Multi-Criteria Decision-Making Method. Mathematics. 2019; 7(1):39. https://doi.org/10.3390/math7010039

Chicago/Turabian Style

Tian, Chao, Wen Yu Zhang, Shuai Zhang, and Juan Juan Peng. 2019. "An Extended Single-Valued Neutrosophic Projection-Based Qualitative Flexible Multi-Criteria Decision-Making Method" Mathematics 7, no. 1: 39. https://doi.org/10.3390/math7010039

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