Next Article in Journal
Smart Antenna for Application in UAVs
Previous Article in Journal
Mobile Phone Recommender System Using Information Retrieval Technology by Integrating Fuzzy OWA and Gray Relational Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Valued Neutrosophic Distance-Based QUALIFLEX Method for Treatment Selection

1
School of Information, Zhejiang University of Finance & Economics, Hangzhou 310018, China
2
School of Business, Central South University, Changsha 410083, China
*
Author to whom correspondence should be addressed.
Information 2018, 9(12), 327; https://doi.org/10.3390/info9120327
Submission received: 20 November 2018 / Revised: 10 December 2018 / Accepted: 11 December 2018 / Published: 17 December 2018

Abstract

:
Multi-valued neutrosophic sets (MVNSs) consider the truth-membership, indeterminacy-membership, and falsity-membership simultaneously, which can more accurately express the preference information of decision-makers. In this paper, the normalized multi-valued neutrosophic distance measure is developed firstly and the corresponding properties are investigated as well. Secondly, the normalized multi-valued neutrosophic distance difference is defined and the corresponding partial ordering relation is discussed. Thirdly, based on the developed distances and comparison method, an extended multi-valued neutrosophic QUALItative FLEXible multiple criteria (QUALIFLEX) method is proposed to handle MCDM problems where the weights of criteria are completely unknown. Finally, an example for selection of medical diagnostic plan is provided to demonstrate the proposed method, together with sensitivity analysis and comparison analysis.

1. Introduction

Recently, neutrosophic sets (NSs) [1,2,3] have become very useful in many areas [4,5,6,7,8] since they collect data and provide some available information. However, because of the complexity and ambiguity of information in the real decision-making process, it is difficult for decision-makers to express their preference accurately by using their extensions, including single-valued neutrosophic sets (SNSs) [9,10] and interval neutrosophic sets (INSs) [11], interval-valued neutrosophic soft sets [12], neutrosophic soft multi-set [13], and neutrosophic refined sets [14]. Then, based on the definitions of SNSs and the hesitant fuzzy sets (HFSs) [15,16], Wang and Li [17] and Ye [18] defined the concept of multi-valued neutrosophic sets (MVNSs) and single-valued neutrosophic hesitant fuzzy sets (SVNHFSs), respectively. MVNSs and SVNHFSs are denoted by truth-membership, indeterminacy-membership, and falsity-membership functions, which comprise of a set of numerical numbers between zero and one. In recent years, MVNSs and SVNHFSs have been extensively studied and applied to different fields. For example, Peng et al. [19,20,21,22] defined multi-valued neutrosophic preference relations, outranking relations and aggregation operators. Ji et al. [23] defined an extended an acronym in Portuguese of the Interactive and Multicriteria Decision Making (TODIM) method with multi-valued neutrosophic information. Finally, based on the concept of MVNSs, Peng et al. [24] defined probability MVNSs, and Wu and Wang [25] investigated some cross-entropy measures of MVNSs and applied them to the selection of a middle-level manager.
Furthermore, those aforementioned methods with MVNSs always involve in operations and measures which impact on the final decision-making may be momentous. However, there exist other methods to avoid these defects, namely the relation model. Relation models could rank the alternatives in terms of priority among the criteria by using outranking relations or priority functions, such as Elimination Et Choix Traduisant la REalité (ELECTRE) [26,27] and QUALItative FLEXible multiple criteria method (QUALIFLEX) [28,29,30].
The QUALIFLEX method, which was introduced by Paelinck [28,29,30], is an effective outranking method to handle multi-criteria decision-making (MCDM) problems by arranging a set of preference rankings [31,32]. Moreover, QUALIFLEX method assumes that all possible permutations of the alternatives are determined. Then the best permutation can be identified by maximizing the concordance/discordance index value based on the pair-wise comparisons of alternatives under each criterion [33,34]. The principal advantage of QUALIFLEX method is that it can effectively handle decision-making problems where the criteria numbers are more than the alternative numbers obviously. Recently, several extended QUALIFLEX methods have been developed [35,36,37,38,39]. Moreover, Ji et al. [40] defined a triangular neutrosophic QUALIFLEX-TODIM method for treatment selection. Li and Wang [41] developed a probability hesitant fuzzy QUALIFLEX method to select green suppliers.
Based on the aforementioned studies, some attempts have been made to define outranking relations, preference, aggregation operators, and cross-entropy measures of MVNSs. According to the existing distances between MVNSs, the TODIM method proposed by Wang and Li [17] and Ji et al. [40] forms part of the multi-valued neutrosophic distance, which is a simple extension based on the Hamming distance. Moreover, if the distance of SNSs and HFSs were extended to MVNSs, then this should satisfy the conditions that two MVNSs should be of equal length, i.e., the lengths of the three memberships should be equal and ranked in ascending order; otherwise it needs to add the same element to the shorter one. Thus, in order to address this shortcoming, the main goals of this paper are: (1) provide the improved distance measure of MVNSs and the corresponding distance difference; and (2) extend the QUALIFLEX method to a multi-valued neutrosophic environment based on the proposed distance difference.
The paper is constructed as follows: In Section 2, some definitions and operations of MVNSs are introduced. Then the normalized multi-valued neutrosophic distance measure and corresponding difference distance as well as comparison method are developed in Section 3. The multi-valued distance-based QUALIFLEX method with incomplete weight information is constructed in Section 4. In Section 5, the selection of a medical diagnostic plan is presented to demonstrate the proposed approach. Finally, we summarize the paper with further discussion in Section 6.

2. MVNSs

Some definitions and operations of MVNSs are reviewed in this section, which will be utilized in later analysis.
Definition 1.
[17,18] A MVNS M in a space of points (objects) X can be expressed as M = { x , T ˙ ( x ) , I ˙ ( x ) , F ˙ ( x ) | x X } . T ˙ ( x ) , I ˙ ( x ) , and F ˙ ( x ) are denoted by HFSs respectively, i.e., three sets of numerical number in [0,1], denoting the truth-membership degree, indeterminacy-membership function and falsity-membership degree respectively, and satisfying 0 γ , η , ξ 1 , 0 γ + + η + + ξ + 3 , where γ T ˙ ( x ) , η I ˙ ( x ) , ξ F ˙ ( x ) , γ + = sup T ˙ ( x ) , η + = sup I ˙ ( x ) and ξ + = sup F ˙ ( x ) .
If there exists only one element in X , then M is called a multi-valued neutrosophic number (MVNN), denoted by M = T ˙ ( x ) , I ˙ ( x ) , F ˙ ( x ) . For convenience, a MVNN can be denoted by M = T ˙ , I ˙ , F ˙ .
Definition 2.
[19] Let M M V N S s , the complement of M can be defined as M C = { x , T ˙ C ( x ) , I ˙ C ( x ) , F ˙ C ( x ) | x X } . Here T ˙ C ( x ) = ξ F ˙ ( x ) { ξ ( x ) } , I ˙ C ( x ) = η I ˙ ( x ) { 1 η ( x ) } and F ˙ C ( x ) = γ T ˙ ( x ) { γ ( x ) } for all x X .
Definition 3.
Let M 1 = { x , T ˙ 1 ( x ) , I ˙ 1 ( x ) , F ˙ 1 ( x ) | x X } and M 2 = { x , T ˙ 2 ( x ) , I ˙ 2 ( x ) , F ˙ 2 ( x ) | x X } be two MVNSs. Then we have M 1 M 2 if γ 1 ( x ) γ 2 ( x ) , η 1 ( x ) η 2 ( x ) and ξ 1 ( x ) ξ 2 ( x ) for any x X . Here γ i ( x ) T ˙ i ( x ) , η i ( x ) I ˙ i ( x ) and ξ i ( x ) F ˙ i ( x ) ( i = 1 , 2 ) .
Definition 4.
[19] Let M 1 = { x , T ˙ 1 ( x ) , I ˙ 1 ( x ) , F ˙ 1 ( x ) | x X } and M 2 = { x , T ˙ 2 ( x ) , I ˙ 2 ( x ) , F ˙ 2 ( x ) | x X } be two MVNSs. Also let x X , all values in T ˙ i ( x ) , I ˙ i ( x ) and F ˙ i ( x ) ( i = 1 , 2 ) be ranked in ascending order. γ i σ ( ) ( x ) , η i σ ( ) ( x ) and ξ i σ ( ) ( x ) are the ( ) -th value in T ˙ i ( x ) , I ˙ i ( x ) and F ˙ i ( x ) ( i = 1 , 2 ) respectively. Then we have:
M 1 M 2 if γ 1 σ ( j ) ( x ) γ 2 σ ( j ) ( x ) and γ 1 σ ( l T ˙ 1 ) ( x ) γ 2 σ ( l T ˙ 2 ) ( x ) ( j = 1 , 2 , , l T ˙ ( x ) ; l T ˙ ( x ) = min ( l T ˙ 1 ( x ) , l T ˙ 2 ( x ) ) ) , η 1 σ ( k ) ( x ) η 2 σ ( k ) ( x ) and η 1 σ ( l I ˙ 1 ) ( x ) η 2 σ ( l I ˙ 2 ) ( x ) ( k = 1 , 2 , , l I ˙ ( x ) , l I ˙ ( x ) = min ( l I ˙ ( x ) , l I ˙ ( x ) ) ) , ξ 1 σ ( m ) ( x ) ξ 2 σ ( m ) ( x ) and ξ 1 σ ( l F ˙ 1 ) ( x ) ξ 2 σ ( l F ˙ 2 ) ( x ) ( m = 1 , 2 , , l F ˙ ( x ) , l F ˙ ( x ) = min ( l F ˙ ( x ) , l F ˙ ( x ) ) ) .
Where l T ˙ ( x ) , l I ˙ ( x ) and l F ˙ ( x ) are the number of elements in T ˙ i ( x ) , I ˙ i ( x ) and F ˙ i ( x ) ( i = 1 , 2 ) respectively.
Example 1.
Let M 1 = { x , { 0.1 , 0.3 } , { 0.3 } , { 0.2 } } and M 2 = { x , { 0.2 , 0.6 } , { 0.1 , 0.2 } , { 0.1 } } be two MVNSs. According to the proposed comparison method in Definition 3, we have l T ˙ = min ( l T ˙ 1 , l T ˙ 2 ) = 2 , γ 1 σ ( 1 ) γ 2 σ ( 1 ) and γ 1 σ ( 2 ) γ 2 σ ( 2 ) , l I ˜ = min ( l I ˜ 1 , l I ˜ 2 ) = 1 , η 1 σ ( 1 ) η 2 σ ( 1 ) and η 1 σ ( 1 ) η 2 σ ( 2 ) , l F ˙ = min ( l F ˙ 1 , l F ˙ 2 ) = 1 and ξ 1 σ ( 1 ) ξ 2 σ ( 1 ) . Therefore, we have M 1 M 2 .

3. Multi-Valued Neutrosophic Distance Measures

Based on the intuitionistic fuzzy H-max distance defined in Ngan et al. [42], the normalized multi-valued neutrosophic distance is proposed. Then the multi-valued neutrosophic distance difference is defined in this section.

3.1. The Normalized Multi-Valued Neutrosophic Distance

Definition 5.
Let M 1 , M 2 and M 3 be three MVNSs on the universe X = { x 1 , x 2 , , x n } . A mapping D : M V N S ( x ) × M V N S ( x ) R is a normalized distance measure of MVNSs iff it satisfies the following axioms:
  • H1. 0 D ( M 1 , M 2 ) 1 ;
  • H2. D ( M 1 , M 2 ) = D ( M 2 , M 1 ) ;
  • H3. D ( M 1 , M 2 ) = 0 iff M 1 = M 2 ;
  • H4. If M 1 M 2 M 3 , then D ( M 1 , M 3 ) D ( M 1 , M 2 ) and D ( M 1 , M 3 ) D ( M 2 , M 3 ) .
Definition 6.
Let M 1 and M 2 be two MVNSs on the universe X = { x 1 , x 2 , , x n } . The normalized multi-valued neutrosophic measure of M 1 and M 2 can be defined as:
D G m ( M 1 , M 2 ) = ( 1 5 n i = 1 n ( Δ γ i , 12 λ + Δ η i , 12 λ + Δ ξ i , 12 λ + Δ 12 λ ( γ i , η i ) + Δ 12 λ ( γ i , ξ i ) ) ) 1 / λ   ( λ 1 ) .
where Δ γ i , 12 = max γ 1 ( x i ) T ˙ 1 ( x i ) γ 2 ( x i ) T ˙ 2 ( x i ) | γ 1 ( x i ) γ 2 ( x i ) | ( i = 1 , 2 , , n ) ;
Δ η i , 12 = max η 1 ( x i ) I ˙ 1 ( x i ) η 2 ( x i ) I ˙ 2 ( x i ) | η 1 ( x i ) η 2 ( x i ) | ( i = 1 , 2 , , n ) ;
Δ ξ i , 12 = max ξ 1 ( x i ) F ˙ 1 ( x i ) ξ 1 ( x i ) F ˙ 1 ( x i ) | ξ 1 ( x i ) ξ 2 ( x i ) | ( i = 1 , 2 , , n ) ;
Δ 12 ( γ i , η i ) = | max γ 1 ( x i ) T ˙ 1 ( x i ) η 2 ( x i ) I ˙ 2 ( x i ) { γ 1 ( x i ) , η 2 ( x i ) } max γ 2 ( x i ) T ˙ 2 ( x i ) η 1 ( x i ) I ˙ 1 ( x i ) { γ 2 ( x i ) , η 1 ( x i ) } | ( i = 1 , 2 , , n ) ;
Δ 12 ( γ i , ξ i ) = | max γ j 1 ( x i ) T 1 ( x i ) ξ m 2 ( x i ) F 2 ( x i ) { γ j 1 ( x i ) , ξ m 2 ( x i ) } max γ 2 ( x i ) T ˙ 2 ( x i ) ξ 1 ( x i ) F ˙ 1 ( x i ) { γ 2 ( x i ) , ξ 1 ( x i ) } | ( i = 1 , 2 , , n ) .
(1) In particular, if λ = 1 , then the normalized multi-valued neutrosophic measure reduces to a normalized multi-valued neutrosophic Hausdorff measure, i.e.:
D G m ( M 1 , M 2 ) = 1 5 n i = 1 n ( Δ γ i , 12 + Δ η i , 12 + Δ ξ i , 12 + Δ 12 ( γ i , η i ) + Δ 12 ( γ i , ξ i ) ) .
(2) If λ = 2 , then the normalized multi-valued neutrosophic measure reduces to a normalized multi-valued neutrosophic Euclidean measure, i.e.:
D G m ( M 1 , M 2 ) = ( 1 5 n i = 1 n ( Δ γ i , 12 2 + Δ η i , 12 2 + Δ ξ i , 12 2 + Δ 12 2 ( γ i , η i ) + Δ 12 2 ( γ i , ξ i ) ) ) 1 / 2 .
Theorem 1.
The normalized multi-valued neutrosophic measure defined in Definition 6 is a normalized distance measure of MVNSs, i.e., D G m ( M 1 , M 2 ) satisfies the following axioms:
H1. 0 D G m ( M 1 , M 2 ) 1 ;
H2. D G m ( M 1 , M 2 ) = D G m ( M 2 , M 1 ) ;
H3. D G m ( M 1 , M 2 ) = 0 iff M 1 = M 2 ;
H4. If M 1 M 2 M 3 , then D G m ( M 1 , M 3 ) D G m ( M 1 , M 2 ) and D G m ( M 1 , M 3 ) D G m ( M 2 , M 3 ) .
Proof. 
H1: Since 0 Δ γ i , 12 1 , 0 Δ η i , 12 1 , 0 Δ ξ i , 12 1 , 0 Δ 12 ( γ i , η i ) 1 and 0 Δ 12 ( γ i , ξ i ) 1 , then we have 0 1 5 n i = 1 n ( Δ γ i , 12 λ + Δ ξ i , 12 λ + Δ η i , 12 λ + Δ 12 λ ( γ i , η i ) + Δ 12 λ ( γ i , ξ i ) ) 1 . Thus 0 D G m ( M 1 , M 2 ) 1 .
H2: Clearly, we have D G m ( M 1 , M 2 ) = D G m ( M 2 , M 1 ) .
H3: If M 1 = M 2 , then we have γ 1 σ ( j ) ( x i ) = γ 2 σ ( j ) ( x i ) ,   γ 1 σ ( l T ˙ 1 ) ( x i ) = γ 2 σ ( l T ˙ 2 ) ( x i ) and η 1 σ ( k ) ( x i ) = γ 2 σ ( k ) ( x i ) , η 1 σ ( l I 1 ) ( x ) = η 2 σ ( l I 2 ) ( x ) and ξ 1 σ ( m ) ( x ) = ξ 2 σ ( m ) ( x ) ,   ξ 1 σ ( l F ˙ 1 ) ( x ) = ξ 2 σ ( l F ˙ 2 ) ( x ) for any x i X , i.e., Δ γ i , 12 = Δ η i , 12 = Δ ξ i , 12 = Δ 12 ( γ i , η i ) = Δ 12 ( γ i , ξ i ) = 0 .
Therefore, D G m ( M 1 , M 2 ) = 0
H4: If M 1 M 2 M 3 , then we have 0 γ 1 σ ( j ) ( x i ) γ 2 σ ( j ) ( x i ) γ 3 σ ( j ) ( x i ) 1 , 0 γ 1 σ ( l T ˙ 1 ) ( x i ) γ 2 σ ( l T ˙ 2 ) ( x i ) γ 3 σ ( l T ˙ 3 ) ( x i ) 1 and 1 η 1 σ ( k ) ( x i ) η 2 σ ( k ) ( x i ) η 3 σ ( k ) ( x i ) 0 , 1 η 1 σ ( l I ˙ 1 ) ( x i ) η 2 σ ( l I ˙ 2 ) ( x i ) η 3 σ ( l I ˙ 3 ) ( x i ) 0 , and 1 ξ 1 σ ( m ) ( x i ) ξ 2 σ ( m ) ( x i ) ξ 3 σ ( m ) ( x i ) 0 , 1 ξ 1 σ ( l F ˙ 1 ) ( x i ) ξ 2 σ ( l F ˙ 2 ) ( x i ) ξ 3 σ ( l F ˙ 3 ) ( x i ) 0 for any x i X . Thus, Δ γ i , 12 λ Δ γ i , 13 λ , Δ η i , 12 λ Δ η i , 13 λ , Δ ξ i , 12 λ Δ ξ i , 13 λ , 1 max γ 3 ( x i ) T ˙ 3 ( x i ) η 1 ( x i ) I ˙ 1 ( x i ) { γ 3 ( x i ) , η 1 ( x i ) } max γ 2 ( x i ) T ˙ 2 ( x i ) η 1 ( x i ) I ˙ 1 ( x i ) { γ 2 ( x i ) , η 1 ( x i ) } max γ 1 ( x i ) T ˙ 1 ( x i ) η 2 ( x i ) I ˙ 2 ( x i ) { γ 1 ( x i ) , η 2 ( x i ) } max γ 1 ( x i ) T ˙ 1 ( x i ) η 3 ( x i ) I ˙ 3 ( x i ) { γ 1 ( x i ) , η 3 ( x i ) } 0 , i.e., Δ 12 λ ( γ i , η i ) Δ 13 λ ( γ i , η i ) and 1 max γ 3 ( x i ) T ˙ 3 ( x i ) ξ 1 ( x i ) F ˙ 1 ( x i ) { γ 3 ( x i ) , ξ 1 ( x i ) } max γ 2 ( x i ) T ˙ 2 ( x i ) ξ 1 ( x i ) F ˙ 1 ( x i ) { γ 2 ( x i ) , ξ 1 ( x i ) } max γ 1 ( x i ) T ˙ 1 ( x i ) ξ 2 ( x i ) F ˙ 2 ( x i ) { γ 1 ( x i ) , ξ 2 ( x i ) } max γ 1 ( x i ) T ˙ 1 ( x i ) ξ 3 ( x i ) F ˙ 3 ( x i ) { γ 1 ( x i ) , ξ 3 ( x i ) } 0 i.e., Δ 12 λ ( γ i , ξ i ) Δ 13 λ ( γ i , ξ i ) . Hence, D G m ( M 1 , M 3 ) D G m ( M 1 , M 2 ) .
Similarly, D G m ( M 1 , M 3 ) D G m ( M 2 , M 3 ) can be obtained. □
Property 1.
Let M 1 and M 2 be two MVNSs on the universe X = { x 1 , x 2 , , x n } . γ i σ ( ) ( x ) ,   η i σ ( ) ( x ) and ξ i σ ( ) ( x ) are the ( ) -th value in T ˙ i ( x ) , I ˙ i ( x ) and F ˙ i ( x ) ( i = 1 , 2 ) respectively. Then D G m ( M 1 C , M 2 C ) = D G m ( M 1 , M 2 ) iff γ 1 σ ( j ) ( x i ) = ξ 1 σ ( j ) ( x i ) and l T ˙ 1 ( x i ) = l F ˙ 1 ( x i ) , and γ 2 σ ( j ) ( x i ) = ξ 2 σ ( j ) ( x i ) and l T ˙ 2 ( x i ) = l F ˙ 2 ( x i ) for any x i X .
Proof. 
Since M 1 C = { x ,   ξ 1 ( x ) F ˙ 1 ( x ) { ξ 1 ( x ) } ,   η 1 ( x ) I ˙ 1 ( x ) { η 1 ( x ) } , γ 1 ( x ) T ˙ 1 ( x ) { γ 1 ( x ) } } and M 2 C = { x ,   ξ 2 ( x ) F ˙ 2 ( x ) { ξ 2 ( x ) } ,   η 2 ( x ) I ˙ 2 ( x ) { η 2 ( x ) } , γ 2 ( x ) T ˙ 2 ( x ) { γ 2 ( x ) } } , then D G m ( M 1 C , M 2 C ) = ( 1 5 n i = 1 n ( Δ ξ i , 12 λ + Δ η i , 12 λ + Δ γ i , 12 λ + Δ 12 λ ( ξ i , γ i ) + Δ 12 λ ( ξ i , η i ) ) ) 1 / λ . If γ 1 σ ( j ) ( x i ) = ξ 1 σ ( j ) ( x i ) and l T ˙ 1 ( x i ) = l F ˙ 1 ( x i ) , and γ 2 σ ( j ) ( x i ) = ξ 2 σ ( j ) ( x i ) and l T ˙ 2 ( x i ) = l F ˙ 2 ( x i ) for any x i X , then max γ 1 ( x i ) T ˙ 1 ( x i ) η 2 ( x i ) I ˙ 2 ( x i ) { γ 1 ( x i ) , η 2 ( x i ) } = max ξ 1 ( x i ) F ˙ 1 ( x i ) η 2 ( x i ) I ˙ 2 ( x i ) { ξ 1 ( x i ) , η 2 ( x i ) } and max γ 2 ( x i ) T ˙ 2 ( x i ) η 1 ( x i ) I ˙ 1 ( x i ) { γ 2 ( x i ) , η 1 ( x i ) } = max ξ 2 ( x i ) F ˙ 2 ( x i ) η 1 ( x i ) I ˙ 1 ( x i ) { ξ 2 ( x i ) , η 1 ( x i ) } , i.e., Δ 12 λ ( γ i , η i ) = Δ 12 λ ( ξ i , η i ) .
Thus, D G m ( M 1 C , M 2 C ) = ( 1 5 n i = 1 n ( Δ ξ i , 12 λ + Δ η i , 12 λ + Δ γ i , 12 λ + Δ 12 λ ( ξ i , γ i ) + Δ 12 λ ( ξ i , η i ) ) ) 1 / λ = D G m ( M 1 , M 2 ) . □
Property 2.
Let M 1 and M 2 be two MVNSs on the universe X = { x 1 , x 2 , , x n } , then we have the following results:
  • (1) if M 1 M 2 , then D G m ( M 1 M 2 , M 1 M 2 ) = D G m ( M 1 , M 2 ) ;
  • (2) if M 1 M 2 , then D G m ( M 1 M 2 , M 1 M 2 ) = D G m ( M 1 , M 2 ) .
Proof. 
(1) If M 1 M 2 , then we have γ M 1 ( x i ) γ M 2 ( x i ) ,   η M 1 ( x i ) η M 2 ( x i ) and ξ M 1 ( x i ) ξ M 2 ( x i ) for any x i X .
From Definition 2, we have:
| γ M 1 M 2 ( x i ) γ M 1 M 2 ( x i ) | = | max { γ M 1 ( x i ) , γ M 2 ( x i ) } min { γ M 1 ( x i ) , γ M 2 ( x i ) } | = | γ M 2 ( x i ) γ M 1 ( x i ) | = Δ γ i , 12 ; | η M 1 M 2 ( x i ) η M 1 M 2 ( x i ) | = | min { η M 1 ( x i ) , η M 2 ( x i ) } max { η M 1 ( x i ) , η M 2 ( x i ) } | = | η M 1 ( x i ) η M 2 ( x i ) | = η i , 12 ; | ξ M 1 M 2 ( x i ) ξ M 1 M 2 ( x i ) | = | min ξ { ν M 1 ( x i ) , ξ M 2 ( x i ) } max { ξ M 1 ( x i ) , ξ M 2 ( x i ) } | = | ξ M 2 ( x i ) ξ M 1 ( x i ) | = Δ ξ i , 12 .
Moreover,
| max { γ M 1 M 2 ( x i ) , η M 1 M 2 ( x i ) } max { γ M 1 M 2 ( x i ) , η M 1 M 2 ( x i ) } | = | max { max { γ M 1 ( x i ) , γ P 2 ( x i ) } , max { η M 1 ( x i ) , η M 2 ( x i ) } } max { min { γ M 1 ( x i ) , γ M 2 ( x i ) } , min { η M 1 ( x i ) , η M 2 ( x i ) } } | = | max { γ M 2 ( x i ) , η M 1 ( x i ) } max { γ M 1 ( x i ) , η M 2 ( x i ) } | = Δ 12 ( γ i , η i ) ; | max { γ M 1 M 2 ( x i ) , ξ M 1 M 2 ( x i ) } max { γ M 1 M 2 ( x i ) , ξ M 1 M 2 ( x i ) } | = | max { max { γ M 1 ( x i ) , γ M 2 ( x i ) } , max { ξ M 1 ( x i ) , ξ M 2 ( x i ) } } max { min { γ M 1 ( x i ) , γ M 2 ( x i ) } , min { ξ M 1 ( x i ) , ξ M 2 ( x i ) } } | = | max { γ M 2 ( x i ) , ξ M 1 ( x i ) } max { γ M 1 ( x i ) , ξ M 2 ( x i ) } | = Δ 12 ( γ i , ξ i ) . Then D G m ( M 1 M 2 , M 1 M 2 ) = ( 1 5 n i = 1 n ( Δ γ i , 12 λ + Δ ξ i , 12 λ + Δ η i , 12 λ + Δ 12 λ ( γ i , ξ i ) + Δ 12 λ ( γ i , η i ) ) ) 1 / λ = D G m ( M 1 , M 2 ) .
(2) Similarly, if M 1 M 2 , then D G m ( M 1 M 2 , M 1 M 2 ) = D G m ( M 1 , M 2 ) can be obtained.
Property 3.
Let M , M 1 and M 2 be three MVNSs, M * = { x , 1 , 0 , 0 } be an ideal MVNS, and D G m be the normalized multi-valued neutrosophic distance. Then we have:
  • (1) M M V N S S , 0 D G m ( M , M * ) 1 ;
  • (2) D G m ( M * , M * ) = 0 ;
  • (3) M M V N S S , D G m ( M , M * ) = D G m ( M * , M ) ;
  • (4) M 1 , M 2 M V N S S , i f M 1 M 2 , t h e n D G m ( M 1 , M * ) = D G m ( M 2 , M * ) .
Proof. 
Based on Theorem 1, the results can be obtained obviously. □

3.2. The Normalized Multi-Valued Neutrosophic Distance Difference

Definition 7.
Let M , M 1 and M 2 be three MVNSs, and M * = { x , 1 , 0 , 0 } be an ideal MVNS. Then the multi-valued neutrosophic distance difference between M 1 and M 2 can be defined as:
D i f f ( M 1 , M 2 ) = D G m ( M 1 , M * ) D G m ( M 2 , M * ) .
Theorem 2.
The multi-valued neutrosophic distance difference measure defined in Def. 7 satisfies the following properties:
  • (1) 1 D i f f ( M 1 , M 2 ) 1 ;
  • (2) if M 1 = M 2 , then D i f f ( M 1 , M 2 ) = 0 ;
  • (3) if M 1 M 2 , then D i f f ( M 1 , M 2 ) 0 ;
  • (4) if M 1 M 2 , then D i f f ( M 1 , M 2 ) 0 ;
  • (5) if D i f f ( M 1 , M 2 ) 0 and D i f f ( M 2 , M 3 ) 0 , then D i f f ( M 1 , M 3 ) 0 .
Proof. 
(1) Since 0 D G m ( M 1 , M * ) 1 and 0 D G m ( M 2 , M * ) 1 , so we have 1 D G m ( M 1 , M * ) D G m ( M 2 , M * ) 1 , i.e., 1 D i f f ( M 1 , M 2 ) 1 .
(2) if M 1 = M 2 , then D i f f ( M 1 , M 2 ) = D G m ( M 1 , M * ) D G m ( M 1 , M * ) = 0 .
(3) Since M * be an ideal MVNS, so M 1 M 2 M * can be obtained. According to Theorem 1, we have:
D G m ( M 1 , M * ) D G m ( M 2 , M * ) , i.e., D G m ( M 1 , M * ) D G m ( M 2 , M * ) 0 . Thus, D i f f ( M 1 , M 2 ) 0 .
(4) Similarly to the proof in (3), if M 1 M 2 , then D i f f ( M 1 , M 2 ) 0 .
(5) Since D i f f ( M 1 , M 2 ) = D G m ( M 1 , M * ) D G m ( M 1 , M * ) 0 and D i f f ( M 2 , M 3 ) = D G m ( M 2 , M * ) D G m ( M 3 , M * ) 0 . So G m ( M 1 , M * ) D G m ( M 2 , M * ) + D G m ( M 2 , M * ) D G m ( M 3 , M * ) 0 , i.e., D G m ( M 1 , M * ) D G m ( M 3 , M * ) 0 . Thus, D i f f ( M 1 , M 3 ) 0 . □
It is noted that for any two MVNSs M 1 and M 2 , the normalized multi-valued neutrosophic distance D G m ( M 1 , M * ) and D G m ( M 2 , M * ) are real values. Then one of following three conditions should be hold: D G m ( M 1 , M * ) > D G m ( M 2 , M * ) , D G m ( M 1 , M * ) = D G m ( M 2 , M * ) or D G m ( M 1 , M * ) < D G m ( M 2 , M * ) . It follows that normalized multi-valued neutrosophic distance satisfies the law of trichotomy. Then the partial ordering relation of MVNSs can be drawn via the difference distance.
Definition 8.
Let M , M 1 and M 2 be three MVNSs, and M * = { x , 1 , 0 , 0 } be an ideal MVNS. Then the partial ordering relation of MVNSs can be constructed as:
(1) If D i f f ( M 1 , M 2 ) > 0 , i.e., D G m ( M 1 , M * ) D G m ( M 2 , M * ) > 0 , then M 1 is inferior to M 2 , denoted by M 1 M 2 ;
(2) If D i f f ( M 1 , M 2 ) = 0 , i.e., D G m ( M 1 , M * ) D G m ( M 2 , M * ) = 0 , then M 1 is indifferent to M 2 , denoted by M 1 ~ M 2 ;
(3) If D i f f ( M 1 , M 2 ) < 0 , i.e., D G m ( M 1 , M * ) D G m ( M 2 , M * ) < 0 , then M 1 is preferred to M 2 , denoted by M 1 M 2 .
Example 2.
Let M 1 = { x , { 0.4 , 0.7 } , { 0.2 } , { 0.3 } } and M 2 = { x , { 0.5 , 0.6 } , { 0.2 } , { 0.3 } } be two MVNSs and M * = { x , 1 , 0 , 0 } be an ideal MVNS.
(1) Based on the comparison method in Definition 4, we have γ 1 σ ( 1 ) γ 2 σ ( 1 ) and γ 1 σ ( 2 ) γ 2 σ ( 2 ) . M 1 M 2 can be obtained.
(2) According to Definition 10, D G m ( M 1 , M * ) = 0.366 and D G m ( M 2 , M * ) = 0.374 can be obtained. From the comparison method in Definition 10, D G m ( M 1 , M * ) > D G m ( M 2 , M * ) , then M 1 is inferior to M 2 , i.e., M 1 M 2 .

4. The Multi-Valued Neutrosophic Distance-Based QUALIFLEX Approach

Assume a group of alternatives denoted by M = { M 1 , M 2 , , M n } and corresponding criteria denoted by C = { c 1 , c 2 , , c m } , and the weight of criterion w j is completely 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 , where T ˙ M i j , I ˙ M i j ,and F ˙ M i j are HFNs and indicate the truth-membership, the indeterminacy-membership, and the falsity-membership, respectively. The proposed method consists of the following steps.
Step 1. Transform the evaluation information into MVNNs
According to decision-makers’ knowledge and experience, experts provide evaluation values for criteria for each alternative at three levels: high, medium and low. In other words, the option about high, middle, and low in the evaluation process correspond to the three parameters of MVNS, namely, positive membership, neutral membership, and negative membership, respectively. In order to assure the accuracy and effectiveness of the evaluation information, no corresponding information was provided during the evaluation process, and decision-makers were not allowed to communicate with each other. M i j = T ˙ M i j , I ˙ M i j , F ˙ M i j is the set of evaluation values for all decision-makers. Then the decision-making matrix can be obtained.
Step 2. Normalize the decision matrix
For each criterion can be divided into two types, including benefit criteria, which means the lager the better, and cost criteria, which means the smaller the better. For the benefit criteria, nothing is done; for the cost 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 Def. 7.
Step 3. Calculate the weight of criteria
Based on the maximizing deviation method of SVNSs defined by Sahin and Liu [43], the non-linear programming model with MVNNs can be constructed as:
( L )   { max P ( ϖ ) = 1 5 1 / λ j = 1 m ς = 1 n τ = 1 m ϖ j ( Δ μ η ξ ) subject to ϖ j 0 ,   j = 1 m ϖ j 2 = 1 . j = 1 , 2 , , m
Then according to the Lagrange function, the weight of criteria can be determined as [43]:
ϖ j = ς = 1 n τ = 1 n ( Δ μ η ξ ) j = 1 m ( ς = 1 n τ = 1 n ( Δ μ η ξ ) ) 2 .
In order to normalize the weight, then we have:
ϖ j * = ς = 1 n τ = 1 n ( Δ μ η ξ ) j = 1 m ς = 1 n τ = 1 n ( Δ μ η ξ ) .
Here, ( Δ μ η ξ ) = ( 1 n i = 1 n ( Δ γ i , 12 λ + Δ η i , 12 λ + Δ ξ i , 12 λ + Δ 12 λ ( γ i , η i ) + Δ 12 λ ( γ i , ξ i ) ) ) 1 / λ .
Step 4. Determine 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:
P κ = ( , M ς , , M τ , ) , κ = 1 , 2 , , n !
where M ς , M τ M , and M ς is superior than or equal to M τ .
Step 5. Calculate the concordance/discordance index
For each pair of alternatives ( M ς , M τ ) ( M ς , M τ M ) respect to the j -th criterion, the corresponding concordance/discordance index φ j κ ( M ς , M τ ) can be defined as:
φ j κ ( M ς , M τ ) = D i f f ( M ¯ ς j , M ¯ τ j ) .
According to the multi-valued neutrosophic distance difference in Def. 10, the following can be true:
(1) If φ j κ ( M ς , M τ ) > 0 , i.e., D i f f ( M ¯ ς j , M ¯ τ j ) > 0 , then M τ ranks over M ς respect to the j -th criterion under the τ -th permutation;
(2) If φ j κ ( M ς , M τ ) = 0 , i.e., D i f f ( M ¯ ς j , M ¯ τ j ) = 0 , then both M ς and M τ have the same rank respect to the j -th criterion under the τ -th permutation;
(3) If φ j κ ( M ς , M τ ) < 0 , i.e., D i f f ( M ¯ ς j , M ¯ τ j ) < 0 , then M ς ranks over M τ respect to the j -th criterion under the τ -th permutation.
Step 6. Determine the weighted concordance/discordance index
Considering the importance weight ϖ j of each criterion c j C being expressed by MVNNs, the weighted concordance/discordance index φ κ ( M ς , M τ ) for each pair of alternatives ( M ς , M τ ) ( M ς , M τ M ) can be denoted as:
φ κ ( M ς , M τ ) = j = 1 m φ j κ ( M ς , M τ ) ( 1 D G m ( ϖ j , M * ) ) .
Step 7. Calculate the comprehensive concordance/discordance index
For the κ -th permutation, the corresponding comprehensive concordance/discordance index φ κ can be calculated as:
φ κ = M ς , M τ M φ κ ( M ς , M τ ) .
Step 8. Rank the alternatives
According to the partial ordering relation of MVNNs, it can be seen that the greater the comprehensive concordance/discordance index value is, the more optimal the final ranking is. Thus, the optimal rank can be obtained with the maximal comprehensive concordance/discordance index φ κ , i.e.:
P * = max κ = 1 n ! { φ κ } .

5. Illustrative Example

An example for selection of medical diagnostic plan (adapted from Chen et al. [37]) is provided in this section. There is a patient who was a 48 year old female with a history of diabetes mellitus. Her physician made a diagnosis of acute inflammatory demyelinating disease. Then the physician assessed the patient’s medical history and her current physical conditions and provided three treatment plans. Thus, how to select a suitable scheme is a MCDM problem. There are three possible schemes M i ( i = 1 , 2 , 3 ) to be selected, including steroid therapy M 1 , plasmapheresis M 2 , and albumin immune therapy M 3 . Each scheme can be assessed based on nine criteria, i.e., c j ( j = 1 , 2 , , 9 ) : c 1 is the survival rate; c 2 is the seriousness of the side effects; c 3 is the seriousness of the complications; c 4 is the possibility of a cure; c 5 is the uncomfortableness degree of the treatment; c 6 is the cost; c 7 is the number of days of hospitalization; c 8 is the probability of a recurrence and c 9 is the self-care capacity. Three decision-makers could assess three treatment plans under nine criteria in the form of MVNNs. When more than one decision-maker assesses the same value, it is counted once. The weights of criteria are completely unknown.

5.1. Illustration of the Developed Method

The steps of obtaining the optimal alternative, by using the developed approach, are as follows.
Step 1. Transform the evaluation information into MVNNs
Three decision-makers can provide evaluation values for criteria for each alternative at three levels: high, medium and low based on their knowledge and experience. Then sets of high, medium, and low correspond to the three parameters of MVNN, namely, positive membership, neutral membership, and negative membership, respectively. If two or more decision-makers provide the same value, then it is counted only once. Then the final evaluation information are in the form of MVNNs, i.e., M i j = T ˙ M i j , I ˙ M i j , F ˙ M i j . Thus, the decision matrix can be constructed as described in Table 1.
Step 2. Normalize the decision-making matrix
Since c 1 , c 4 , and c 9 are benefit types and other criteria are cost types, from Definition 2 the normalized MVNN decision matrix can be determined as presented in Table 2.
Step 3. Calculate the weight of criteria
From Equation (5), the weight of criteria can be obtained as ϖ = ( 0.11 , 0.15 , 0.09 , 0.15 , 0.06 , 0.10 , 0.13 , 0.11 , 0.10 ) .
Step 4. Determine all of the possible permutations
Since n = 3 , so we have 6( 3 ! = 6 ) permutations of alternative rankings, i.e.,
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 ) , P 6 = ( M 3 , M 2 , M 1 ) .
Step 5. Calculate the concordance/discordance index
From Equation (9), for each pair of alternatives ( M ς , M τ ) ( M ς , M τ M ) in the permutation P κ under criterion C j , the concordance/discordance index φ j κ ( M ς , M τ ) can be obtained. For simplicity, let λ = 1 in Equation (1), the normalized multi-valued neutrosophic distance is reduced to the normalized multi-valued neutrosophic Hausdorff distance, i.e., Equation (2), and the results can be founded in Table 3.
Step 6. Calculate the weighted concordance/discordance index.
For simplicity, let λ = 1 in Equation (1), the weighted concordance/discordance indices φ κ ( M ς , M τ ) can be calculated as presented in Table 4.
Step 7. Calculate the comprehensive concordance/discordance index.
From Equation (11), the comprehensive concordance/discordance index φ κ can be calculated as shown in Table 5.
Step 8. Rank the alternatives
From the results in Step 5 and Equation (14), φ 4 > φ 6 > φ 3 > φ 5 > φ 1 > φ 2 and P * = max κ = 1 n ! { φ κ } = P 4 can be obtained. Thus, the final order of the three plan is: M 2 M 3 M 1 . The best treatment plan is M 2 while the worst treatment plan is M 1 .

5.2. Sensitivity Analysis

In this subsection, the influence of λ on the ranking of alternatives is discussed. From Figure 1, we can see that the rankings of alternatives are slightly different. If λ = 1 , 2 , 4 , then the optimal permutation is P 4 . The best alternative is always M 2 ; while the worst alternative is M 1 ; while if λ = 6 , 8 , 10 , then the optimal permutation is P 6 . The best alternative is M 3 . Moreover, the values of comprehensive concordance/discordance index φ κ become smaller as parameter λ increases. Generally speaking, different values of parameter λ can reflect the decision-makers’ preferences and risk attitudes, which can provide more choices for decision-makers. Moreover, since the evaluation values for three memberships in MVNNs are sets of numerical numbers in [0, 1], so we can see that if the value of parameter is too large, then the difference for the distances of MVNNs will not be distinct.

5.3. Comparison Analysis

To further validate the practicability of the developed method, a comparison analysis was investigated by utilizing some existing methods with multi-valued neutrosophic information, i.e., Peng et al. [19,20,21] and Ji et al. [23].
To facilitate a comparison analysis, the same example is used here as well. Since the compared methods presented above cannot handle multi-valued neutrosophic information where the weight is completely unknown, the weights of the criteria was determined as ϖ = ( 0.11 , 0.15 , 0.09 , 0.15 , 0.06 , 0.10 , 0.13 , 0.11 , 0.10 ) T . Then the final results can be calculated as presented in Table 6.
From the results presented in Table 4, we can see that the results from the proposed approach are consistent with the compared methods in Peng et al. [15,16] and Ji et al. [23]; the optimal treatment plan is M 2 , while the worst treatment plan is M 1 . For the other compared method in Peng et al. [14], although there is a slight difference in the final rankings of these methods, the optimal treatment plan is M 2 or M 3 .
From the comparison analyses presented above, some results can be summarized.
Firstly, if the multi-valued neutrosophic power weighted arithmetic averaging operator and the multi-valued neutrosophic power weighted geometric averaging operator presented in Peng et al. [14] are used respectively, then the different rankings M 2 M 3 M 1 and M 3 M 2 M 1 can be obtained. However, different aggregation operators are always involved in the operations. Moreover, if the number of elements in MVNNs increases, then the number of elements in the aggregated value will exponentially increase. This will increase the difficulty of decision-making. Secondly, the method of Peng et al. [15] is suitable to solve the MCDM problems where the number of alternatives is more than the number of criteria; while the proposed approach and the method in Peng et al. [16] are preferred to handle MCDM problems where the number of alternatives is fewer than the number of criteria. Thirdly, all of the compared methods developed in Peng et al. [14,15,16] and Ji et al. [23] cannot deal with some special cases that the weight information is completely unknown. However, the proposed approach can avoid these shortcomings. Therefore, the primary characteristic of the approach developed are not only its ability to availably express the preference information by MVNNs, but also its consideration that the weights’ information is completely unknown. It can enlarge the application scope of decision-making methods.

6. Conclusions

In this paper, the normalized multi-valued neutrosophic distance measure is defined, then the normalized multi-valued neutrosophic difference distance is developed as well. Based on the developed distances, a multi-valued neutrosophic distance-based QUALIFLEX approach is proposed to deal with MCDM problems where the weights of criteria are completely unknown. A treatment selection example testified the practicability of the proposed method, and showed that the results are reasonable and credible. The mainly advantages of the developed method over the other methods is that it can handle the MCDM problems where the number of alternatives is fewer than the number of criteria and the weight information is completely unknown, which can be used to obtain the credible and realistic results. However, the limitation of the developed method is that it cannot be suitable for dealing with some problems where the number of alternatives is greater than the number of criteria. In the future, the related distance measures of MVNSs will be further investigated.

Author Contributions

J.J. Peng and C. Tian work together to finish this work. Two authors approved the publication work.

Funding

This work is supported by the National Natural Science Foundation of China (Nos. 71701065 and 71571193), the Postdoctoral Science Foundation of China (No. 2017M610511), and the Natural Science Foundation of Hubei Province (No. 2017CFC852).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Smarandache, F. A Unifying Field in Logics: Neutrosophy Logic; American Research Press: Santa Fe, NM, USA, 1999; pp. 1–141. [Google Scholar]
  2. Smarandache, F. A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability: Neutrsophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability; Infinite Study; American Research Press: Santa Fe, NM, USA, 2005. [Google Scholar]
  3. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  4. Mohamed, A.B.; Gunasekaran, M.; Abduallah, G. A hybrid approach of neutrosophic sets and DEMATEL method for developing supplier selection criteria. Des. Autom. Embed. Syst. 2018, 22, 257. [Google Scholar]
  5. Mohamed, A.B.; Mohamed, M.; Smarandache, F. An extension of neutrosophic AHP–SWOT analysis for strategic planning and decision-making. Symmetry 2018, 10, 116. [Google Scholar]
  6. Abdel-Basset, M.; Mohamed, M.; Hussien, A.N.; Sangaiah, A.K. A novel group decision-making model based on triangular neutrosophic numbers. Soft Comput. 2017, 1, 1–15. [Google Scholar] [CrossRef]
  7. Mohamed, A.B.; Mohamed, M.; Smarandache, F. A hybrid neutrosophic group ANP-TOPSIS framework for supplier selection problems. Symmetry 2018, 10, 226. [Google Scholar]
  8. Mohamed, A.B.; Zhou, Y.Q.; Mohamed, M.; Chang, V. A group decision making framework based on neutrosophic VIKOR approach for e-government website evaluation. J. Intell. Fuzzy Syst. 2018, 34, 4213–4224. [Google Scholar]
  9. Ye, J. Multicriteria decision-making method using the correlation coefficient under single-value neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef]
  10. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  11. 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]
  12. Deli, I. Interval-valued neutrosophic soft sets and its decision making. Int. J. Mach. Learn. Cybern. 2017, 8, 665–676. [Google Scholar] [CrossRef]
  13. Deli, İ.; Broumi, S.; Ali, M. Neutrosophic soft multi-set theory and its decision making. Neutrosophic Sets Syst. 2014, 5, 65–76. [Google Scholar]
  14. Broumi, S.; Deli, İ. Correlation measure for neutrosophic refined sets and its application in medical Diagnosis. Palest. J. Math. 2016, 5, 135–143. [Google Scholar]
  15. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decision. In Proceedings of the 18th IEEE International Conference on Fuzzy Systems, Jeju Island, Korea, 20–24 August 2009; pp. 1378–1382. [Google Scholar]
  16. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  17. Wang, J.Q.; Li, X.E. An application of the TODIM method with multi-valued neutrosophic set. Control Decis. 2015, 30, 1139–1142. [Google Scholar]
  18. 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]
  19. 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]
  20. Peng, J.J.; Wang, J.Q.; Wu, X.H. An Extension of the ELECTRE approach with multi-valued neutrosophic information. Neural Comput. Appl. 2017, 28, 1011–1022. [Google Scholar] [CrossRef]
  21. Peng, J.J.; Wang, J.Q.; Yang, W.E. A multi-valued neutrosophic qualitative flexible approach based on likelihood for multi-criteria decision-making problems. Int. J. Syst. Sci. 2017, 48, 425–435. [Google Scholar] [CrossRef]
  22. 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]
  23. Ji, P.; Zhang, H.Y.; Wang, J.Q. A projection-based TODIM method under multi-valued neutrosophic environments and its application in personnel selection. Neural Comput. Appl. 2018, 29, 221–234. [Google Scholar] [CrossRef]
  24. Peng, H.G.; Zhang, H.Y.; Wang, J.Q. Probability multi-valued neutrosophic sets and its application in multi-criteria group decision-making problems. Neural Comput. Appl. 2018, 30, 563–583. [Google Scholar] [CrossRef]
  25. Wu, X.H.; Wang, J.Q. Cross-entropy measures of multi-valued neutrosophic sets and its application in selecting middle-level manager. Int. J. Uncertain. Quantif. 2017, 7, 155–176. [Google Scholar] [CrossRef]
  26. Benayoun, R.; Roy, B.; Sussman, B. ELECTRE: Une Méthode pour Guider le Choix en Présence de Points de vue Multiples; Note de Travail; SEMA: Paris, France, 1996; p. 49. [Google Scholar]
  27. Roy, B. The outranking approach and the foundations of ELECTRE methods. Theory Decis. 1991, 31, 49–73. [Google Scholar] [CrossRef]
  28. Paelinck, J.H.P. Qualitative multiple criteria analysis, environmental protection and multiregional development. Pap. Reg. Sci. 1976, 36, 59–76. [Google Scholar] [CrossRef]
  29. Paelinck, J.H.P. Qualitative multicriteria analysis: An application to airport location. Environ. Plan. A 1977, 9, 883–895. [Google Scholar] [CrossRef]
  30. Paelinck, J.H.P. Qualiflex: A flexible multiple-criteria method. Econ. Lett. 1978, 1, 193–197. [Google Scholar] [CrossRef]
  31. Hwang, C.L.; Yoon, K. Multiple Attribute Decision Making: Methods and Applications; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1981. [Google Scholar]
  32. Lahdelma, R.; Miettinen, K.; Salminen, P. Ordinal criteria in stochastic multicriteria acceptability analysis (SMAA). Eur. J. Oper. Res. 2003, 147, 117–127. [Google Scholar] [CrossRef]
  33. Martel, J.-M.; Matarazzo, B. Other outranking approaches. In Multiple Criteria Decision Analysis: State of the art Surveys; Springer: Berlin/Heidelberg, Germany, 2005; pp. 197–259. [Google Scholar]
  34. Griffith, D.A.; Paelinck, J.H.P. Qualireg, a qualitative regression method. Adv. Geogr. Inf. Sci. 2011, 1, 227–233. [Google Scholar]
  35. Chen, T.Y.; Wang, J.C. Interval-valued fuzzy permutation method and experimental analysis on cardinal and ordinal evaluations. J. Comput. Syst. Sci. 2009, 75, 371–387. [Google Scholar] [CrossRef] [Green Version]
  36. 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]
  37. 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]
  38. Chen, T.Y. A signed-distance-based approach to importance assessment and multi-criteria group decision analysis based on interval type-2 fuzzy set. Knowl. Inf. Syst. 2013, 35, 193–231. [Google Scholar] [CrossRef]
  39. Zhang, X.L.; Xu, Z.S. Hesitant fuzzy QUALIFILEX approach with a signed distance-based comparison method for multiple criteria decision analysis. Expert Syst. Appl. 2015, 42, 873–884. [Google Scholar] [CrossRef]
  40. 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]
  41. 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]
  42. Ngan, R.T.; Son, L.H.; Cuong, B.C.; Ali, M. H-max distance measure of intuitionistic fuzzy sets in decision making. Appl. Soft Comput. 2018, 69, 393–425. [Google Scholar] [CrossRef]
  43. Şahin, R.; Liu, P. Maximizing deviation method for neutrosophic multiple attribute decision making with incomplete weight information. Neural Comput. Appl. 2016, 27, 1–13. [Google Scholar] [CrossRef]
Figure 1. The results of the sensitivity analysis.
Figure 1. The results of the sensitivity analysis.
Information 09 00327 g001
Table 1. The evaluations of three schemes by decision-makers under criteria.
Table 1. The evaluations of three schemes by decision-makers under criteria.
CriteriaSchemes
M 1 M 2 M 3
c 1 <{0.4,0.6,0.7},{0.1},{0.2}><{0.4,0.5},{0.1},{0.2}><{0.4,0.5,0.7},{0.3},{0.2}>
c 2 <{0.3},{0.3},{0.5,0.7}><{0.4},{0.1},{0.4}><{0.1,0.3},{0.2},{0.4,0.6}>
c 3 <{0.3},{0.2},{0.4,0.6}><{0.4},{0.1},{0.5,0.6,0.7}><{0.3},{0.2},{0.5}>
c 4 <{0.5,0.7},{0.2},{0.2}><{0.3,0.4},{0.2},{0.5}><{0.3,0.6},{0.1},{0.6}>
c 5 <{0.3},{0.2},{0.5}><{0.2},{0.3},{0.3,0.5}><{0.3},{0.2},{0.4}>
c 6 <{0.3},{0.1},{0.6,0.7}><{0.3},{0.2},{0.6}><{0.1},{0.2},{0.5,0.6,0.8}>
c 7 <{0.2},{0.1},{0.4,0.6,0.9}><{0.2},{0.4},{0.6,0.8}><{0.1},{0.2},{0.5,0.7,0.8}>
c 8 <{0.1},{0.3},{0.6,0.8}><{0.1},{0.2},{0.7,0.9}><{0.3},{0.1},{0.7}>
c 9 <{0.7,0.8,0.9},{0.1},{0.1}><{0.6,0.7,0.8},{0.2},{0.3}><{0.6,0.9},{0.2},{0.2}>
Table 2. Normalized decision matrix.
Table 2. Normalized decision matrix.
CriteriaSchemes
M 1 M 2 M 3
c 1 <{0.4,0.6,0.7},{0.1},{0.2}><{0.4,0.5},{0.1},{0.2}><{0.4,0.5,0.7},{0.3},{0.2}>
c 2 <{0.5,0.7},{0.3},{0.3}><{0.4},{0.1},{0.4}><{0.4,0.6},{0.2},{0.1,0.3}>
c 3 <{0.4,0.6},{0.2},{0.3}><{0.5,0.6,0.7},{0.1},{0.4}><{0.5},{0.2},{0.3}>
c 4 <{0.5,0.7},{0.2},{0.2}><{0.3,0.4},{0.2},{0.5}><{0.3,0.6},{0.1},{0.6}>
c 5 <{0.5},{0.2},{0.3}><{0.3,0.5},{0.3},{0.2}><{0.4},{0.2},{0.3}>
c 6 <{0.6,0.7},{0.1},{0.3}><{0.6},{0.2},{0.3}><{0.5,0.6,0.8},{0.2},{0.1}>
c 7 <{0.4,0.6,0.9},{0.1},{0.2}><{0.6,0.8},{0.4},{0.2}><{0.5,0.7,0.8},{0.2},{0.1}>
c 8 <{0.6,0.8},{0.3},{0.1}><{0.7,0.9},{0.2},{0.1}><{0.7},{0.1},{0.3}>
c 9 <{0.7,0.8,0.9},{0.1},{0.1}><{0.6,0.7,0.8},{0.2},{0.3}><{0.6,0.9},{0.2},{0.2}>
Table 3. The concordance/discordance index.
Table 3. The concordance/discordance 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 )
c1−0.08−0.04−0.04c1−0.04−0.08−0.04
c2−0.12−0.040.08c2−0.04−0.12−0.08
c30.06−0.02−0.08c3−0.020.060.08
c4−0.22−0.140.08c4−0.14−0.22−0.08
c5−0.04−0.06−0.02c5−0.06−0.040.02
c6−0.060.040.10c60.04−0.06−0.1
c7−0.06−0.020.04c7−0.02−0.06−0.04
c80.08−0.02−0.1c8−0.020.080.10
c9−0.12−0.060.06c9−0.06−0.12−0.06
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 )
c10.080.04−0.04c10.040.080.04
c20.120.08−0.04c20.080.120.04
c3−0.06−0.08−0.02c3−0.08−0.060.02
c40.220.08−0.14c40.080.220.14
c50.04−0.02−0.06c5−0.020.040.06
c60.060.100.04c60.100.06−0.04
c70.060.04−0.02c70.040.060.02
c8−0.08−0.10−0.02c8−0.10−0.080.02
c90.120.06−0.06c90.060.120.06
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 )
c10.04−0.04−0.08c1−0.040.040.08
c20.04−0.08−0.12c2−0.080.040.12
c30.020.080.06c30.080.02−0.06
c40.14−0.08−0.22c4−0.080.140.22
c50.060.02−0.04c50.020.060.04
c6−0.04−0.10−0.06c6−0.10−0.040.06
c70.02−0.04−0.06c7−0.040.020.06
c80.020.100.08c80.100.02−0.08
c90.06−0.06−0.12c9−0.060.060.12
Table 4. The weighted concordance/discordance index.
Table 4. The weighted concordance/discordance 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.2688−0.17070.0981−0.1707−0.2688−0.0981
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.26880.0981−0.17070.09810.26880.1707
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.1707−0.0981−0.2688−0.09810.17070.2688
Table 5. The comprehensive concordance/discordance index.
Table 5. The comprehensive concordance/discordance index.
φ 1 φ 2 φ 3 φ 4 φ 5 φ 6
−0.3414−0.53770.19630.5377−0.19630.3414
Table 6. The comparison results.
Table 6. The comparison results.
MethodsThe Final RankingThe Best Alternative(s)The Worst Alternative(s)
Peng et al. [14] M 2 M 3 M 1 or M 3 M 2 M 1 M 2 or M 3 M 1
Peng et al. [15] M 2 M 3 M 1 M 2 M 1
Peng et al. [16] M 2 M 3 M 1 M 2 M 1
Ji et al. [23] M 2 M 3 M 1 M 2 M 1
The proposed method M 2 M 3 M 1 M 2 M 1

Share and Cite

MDPI and ACS Style

Peng, J.-J.; Tian, C. Multi-Valued Neutrosophic Distance-Based QUALIFLEX Method for Treatment Selection. Information 2018, 9, 327. https://doi.org/10.3390/info9120327

AMA Style

Peng J-J, Tian C. Multi-Valued Neutrosophic Distance-Based QUALIFLEX Method for Treatment Selection. Information. 2018; 9(12):327. https://doi.org/10.3390/info9120327

Chicago/Turabian Style

Peng, Juan-Juan, and Chao Tian. 2018. "Multi-Valued Neutrosophic Distance-Based QUALIFLEX Method for Treatment Selection" Information 9, no. 12: 327. https://doi.org/10.3390/info9120327

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