Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
Sufficient Dimension Reduction: An Information-Theoretic Viewpoint
Previous Article in Journal
Pedestrian Detection with Multi-View Convolution Fusion Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Interval-Valued q-Rung Dual Hesitant Linguistic Multi-Attribute Decision-Making Method Based on Linguistic Scale Functions and Power Hamy Mean

1
School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China
2
Beijing Logistics Informatics Research Base, Beijing 100044, China
3
School of Economics and Management, Beijing University of Chemical Technology, Beijing 100029, China
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(2), 166; https://doi.org/10.3390/e24020166
Submission received: 6 December 2021 / Revised: 5 January 2022 / Accepted: 11 January 2022 / Published: 22 January 2022
(This article belongs to the Special Issue Information Theory of Decisions and Actions)

Abstract

:
The interval-valued q-rung dual hesitant linguistic (IVq-RDHL) sets are widely used to express the evaluation information of decision makers (DMs) in the process of multi-attribute decision-making (MADM). However, the existing MADM method based on IVq-RDHL sets has obvious shortcomings, i.e., the operational rules of IVq-RDHL values have some weaknesses and the existing IVq-RDHL aggregation operators are incapable of dealing with some special decision-making situations. In this paper, by analyzing these drawbacks, we then propose the operations for IVq-RDHL values based on a linguistic scale function. After it, we present novel aggregation operators for IVq-RDHL values based on the power Hamy mean and introduce the IVq-RDHL power Hamy mean operator and IVq-RDHL power weighted Hamy mean operator. Properties of these new aggregation operators are also studied. Based on these foundations, we further put forward a MADM method, which is more reasonable and rational than the existing one. Our proposed method not only provides a series of more reasonable operational laws but also offers a more powerful manner to fuse attribute values. Finally, we apply the new MADM method to solve the practical problem of patient admission evaluation. The performance and advantages of our method are illustrated in the comparative analysis with other methods.

1. Introduction

Multi-attribute decision-making (MADM) is a frequently used method for determining choices in daily life. This is because most real-life decision-making problems are very complicated, and to make a wise decision, decision makers (DMs) have to evaluate all the feasible forms of multiple aspects before determining the ranking order of alternatives [1,2,3,4,5,6,7,8,9,10]. There are many methods to obtain the rankings of alternatives in the MADM framework, and the aggregation operator (AO) is a powerful technique, which helps DMs acquire the optimal or best alternative. AO refers to a series of special functions that integrate individual attribute values into a collective one. By ranking the comprehensive evaluation values of candidates, the corresponding ranking results of alternatives are determined. More and more complex realistic decision-making problems have prompted many scholars and scientists to realize the importance of studying and exploring the interaction between attributes. This is because there exist complex interrelationships between attributes, which should be considered along with the attribute values when obtaining the comprehensive evaluation ranks of alternatives. Considering it, the Bonferroni mean (BM) [11] and HEronian mean (HEM) [12] were proposed to capture the interrelationship among interacted attributes. Therefore, BM and HEM were widely used by scholars to deal with MADM problems [13,14,15,16] to produce reasonable aggregation results. However, it is insufficient to solely use BM or HEM to aggregate attributes, because DMs’ may provide extreme evaluation values and negatively affect the decision-making results. Due to the lack of enough professional knowledge and time shortage, the decision experts may put forward some extreme values subjectively, which can have a negative influence on aggregation results. He et al. [17] noticed this phenomenon, and they combined the power average (PA) [18] with BM and proposed the power Bonferroni mean (PBM) operator. The authors applied PBM in hesitant fuzzy sets and comparative analysis reveals the advantages of PBM over PA and BM [17]. Afterwards, Liu and Li [19] soon extended PBM to interval-valued intuitionistic fuzzy sets, proposed interval-valued intuitionistic fuzzy AOs and applied them in an air quality evaluation in Guangzhou, China. Wang and Li [20] studied PBM in a Pythagorean fuzzy environment, along with the interactive operational rules. Under the framework of the Dempster–Shafer theory, Liu and Gao [21] continued to study intuitionistic fuzzy PBM operators and applied them in air-condition systems selection. Liu and Liu [22] further generalized PBM into linguistic intuitionistic fuzzy sets and investigated their applications in MADM problems. Liu and Liu [23] used PBM to fuse linguistic q-rung orthopair fuzzy information. He et al. [24] studied the dual form of PBM, proposed the power geometric BM and investigated its performance and advantages in MADM problems. Similar to the PBM operator, Liu [25] introduced the definition of power HEM (PHEM) operator by integrating PA with HEM. PHEM has similar performance and capability as PBM, and it has also been investigated under hesitant fuzzy linguistic terms sets [26], linguistic neutrosophic sets [27], q-rung orthopair hesitant fuzzy sets [28], neutrosophic cubic sets [29], interval-valued dual hesitant fuzzy sets [30], etc., which illustrates the effectiveness and advantages of PHEM.
The aforementioned literature implies the high efficiency of PBM and PHEM in aggregating fuzzy decision-making information under different environments; however, the shortcoming of PBM and PHEM is still prominent, i.e., they just consider the interrelationship that exists between the two attributes rather than among all attributes. Later, Liu et al. [31] proposed the power Hamy mean (PHM) operators, with a combination of PA with Hamy mean (HM) [32] and studied it in interval neutrosophic MADM problems. Compared with PBM and PHEM, PHM takes the interrelationship among multiple input arguments into consideration, and this feature makes PHM suitable and flexible to be employed to fuse attribute values. Based on the pioneering works, Liu and Li [33] and Liu et al. [34] utilized PHM to fuse fuzzy linguistic information.
Nevertheless, as practical MADM problems are very complicated, the interval-valued q-rung dual hesitant linguistic (IVq-RDHL) set proposed by Feng and her colleagues [35] can express complex decision information and is a promising information description tool. Therefore, we analyze the advantages and superiorities of IVq-RDHL sets from three perspectives. First of all, more and more scholars have become aware of the importance of allowing DMs to express their assessments quantificationally and qualitatively [36,37,38,39], while IVq-RDHL sets describe both DMs’ quantitative and qualitative evaluation information, providing DMs with an effective manner to convey their ideas. Secondly, IVq-RDHL sets allow the existence of multiple membership degrees (MDs) and non-membership degrees (NMDs), which can effectively express the hesitation of DMs. Thirdly, IVq-RDHL sets can provide more sufficient space for the description of decision information because they allow the sum of the qth power of MD and the qth power of NMD to be less than or equal to one. In order to make full use of IVq-RDHL sets in decision-making problems, Feng et al. [35] continued to propose operational rules, a comparison method, and AOs of Ivq-RDHL values, and based on which, a novel MADM method was designed. In addition, the performance and advantages of this method proposed are further proved by illustrative examples and comparative analysis.
However, the method proposed by Feng et al. [35] still has some significant shortcomings, which are mainly divided into two aspects. First, the operational laws of IVq-RDHL values cannot solve the different translation requirements of different DMs for the same semantics. (In Section 3, we analyzed the shortcomings of these operating rules in detail.) Second, the method based on IVq-RDHL Maclaurin symmetric mean operators fails to consider the impact of DMs’ unreasonable evaluation value on the final decision result, although they have the capacity of capturing the interrelationship among attributes. More and more evidence shows that while considering the impact of DMs’ evaluation value, the relationship among attributes can also be considered [40,41,42,43,44,45].
Based on the above analysis, an MADM method under IVq-RDHL sets is proposed in this paper. The main motivations of this study are as follows:
(1)
Firstly, we introduce the operational laws of IVq-RDHL values based on linguistic scale functions to overcome the shortcoming of existing operations rules. (We analyzed in detail why novel operational rules are more effective and rational in Section 3).
(2)
Secondly, considering the good performance of PHM in fusing fuzzy information, we generalized PHM into IVq-RDHL sets and presented AOs for IVq-RDHL values that can overcome the shortcomings of existing AOs.
(3)
Thirdly, we introduced a new MADM method under the IVq-RDHL environment based on the novel AOs. In addition, a practical example about the patient admission evaluation is employed to show the validity and advantages of our new method.
The paper is structured as follows. We review basic notions connected with IVq-RDHL sets in Section 2. Section 3 proposes novel operations for IVq-RDHL values based on a linguistic scale function and studies their properties. Section 4 puts forward new IVq-RDHL AOs based on PHM. Section 5 introduces a new IVq-RDHL MADM method. Section 6 is a series of illustrative examples. Section 7 summarizes the manuscript and outlines future research.

2. Preliminaries

In this section, we briefly review the basic concepts, including IVq-RDHLSs, Hamy mean, power average, and power Hamy mean operators.

2.1. The IVq-RDHLSs

Definition 1
([35]). Let X be a fixed set and S ˜ be a continuous linguistic term sets (LTS) of S = { s i | i = 1 , 2 , , t } , then an interval-valued q-rung dual hesitant linguistic set (IVq-RDHLS) D defined on X is expressed as
D = { x , s θ ( x ) , h D ( x ) , g D ( x ) | x X } ,
where s θ ( x ) S ˜ , h D ( x ) = [ r D l , r D u ] h D ( x ) { [ r D l , r D u ] } and g D ( x ) = [ η D l , η D u ] g D ( x ) { [ η D l , η D u ] } are two sets of interval values in [0, 1], denoting the possible MG and NMG of the element. x X to the set D , respectively, such that [ r D l , r D u ] , [ η D l , η D u ] [ 0 , 1 ] , and 0 ( ( r D u ) + ) q + ( ( η D u ) + ) q 1 , q 1 , where, [ η D l , η D u ] g D ( x ) , ( r D u ) + h D + ( x ) = [ r D l , r D u ] h D ( x ) max { r D u } , and ( η D u ) + g D + ( x ) = [ η D l , η D u ] g D ( x ) max { η D u } for all x X . For convenience, we call d = s θ ( x ) , { { [ r D l , r D u ] } , { [ η D l , η D u ] } } an interval-valued q-rung dual hesitant linguistic variable (IVq-RDHLV), which can be denoted as d = s θ , ( h , g ) for simplicity. In addition, IVq-RDHLV can transferred into other fuzzy sets. For example, if q = 1 , then D is IVDHFLS; if q = 2 , then D can be simplified to a dual hesitant interval-valued Pythagorean linguistic set; if r l = r u and η l = η u , then D is simplified to the q-rung dual hesitation linguistic set.
Then, the operational laws of IVq-RDHLVs are as follows.
Definition 2
([35]). Let d = s θ , ( h , g ) , d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) be any three IVq-RDHLVs, then
(1) 
d 1 d 2 = s θ 1 + θ 2 , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2
{ { [ ( ( r 1 l ) q + ( r 2 l ) q ( r 1 l r 2 l ) q ) 1 / q , ( ( r 1 u ) q + ( r 2 u ) q ( r 1 u r 2 u ) q ) 1 / q ] } , { [ η 1 l η 2 l , η 1 u η 2 u ] } } ;
(2) 
d 1 d 2 = s θ 1 × θ 2 , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2
{ { [ r 1 l r 2 l , r 1 u r 2 u ] } , { [ ( ( η 1 l ) q + ( η 2 l ) q ( η 1 l η 2 l ) q ) 1 / q , ( ( η 1 u ) q + ( η 2 u ) q ( η 1 u η 2 u ) q ) 1 / q ] } } ;
(3) 
λ d = s λ θ , r h , η g { { [ ( 1 ( 1 ( r l ) q ) λ ) 1 / q , ( 1 ( 1 ( r u ) q ) λ ) 1 / q ] } , { ( η l ) λ , ( η u ) λ } } ;
(4) 
d λ = s θ λ , r h , η g { { ( r l ) λ , ( r u ) λ } , { [ ( 1 ( 1 ( η l ) q ) λ ) 1 / q , ( 1 ( 1 ( η u ) q ) λ ) 1 / q ] } } .
Definition 3
([35]). Assume that d = s θ , ( h , g ) is an IVq-RDHLV, then the score function of d is
S ( d ) = ( 1 + ( 1 # h [ r l , r u ] h r l ) q + ( 1 # h [ r l , r u ] h r u ) q ( 1 # g [ η l , η u ] g η l ) q ( 1 # g [ η l , η u ] g η l ) q ) × s θ 2 ,
and the accuracy function of d is
p ( d ) = ( ( 1 # h [ r l , r u ] h r l ) q + ( 1 # h [ r l , r u ] h r u ) q + ( 1 # g [ η l , η u ] g η l ) q + ( 1 # g [ η l , η u ] g η l ) q ) × s θ ,
where # h and # g represent the number of interval values in h and g , respectively. For example, assume that d = s 3 , { { [ 0.2 , 0.3 ] , [ 0.4 , 0.6 ] } { [ 0.7 , 0.8 ] } } is an IVq-RDHLV. Therefore, we canobtain # h = 2 and # g = 1 .
Suppose that d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) are any two IVq-RDHLVs, then
(1)
If S ( d 1 ) > S ( d 2 ) , then d 1 is superior to d 2 , denoted by d 1 > d 2 ;
(2)
If S ( d 1 ) = S ( d 2 ) , then calculate the accuracy score of the two IVq-RDHLVs
if p ( d 1 ) = p ( d 2 ) , then d 1 is equivalent to d 2 , denoted by d 1 = d 2 ;
if p ( d 1 ) > p ( d 2 ) , then d 1 is superior to d 2 , denoted by d 1 > d 2 .
Remark 1. 
Suppose that there are three IVq-RDHLVs: d 1 = s 5 , { { [ 0.5 , 0.6 ] } , { [ 0.1 , 0.2 ] } } and d 2 = s 5 , { { [ 0.6 , 0.7 ] } , { [ 0.1 , 0.2 ] , [ 0.3 , 0.4 ] } } , then the score values can be obtained by the Equation (2), and we have (assume that q = 2)
S ( d 1 ) = ( 1 + ( 0.5 ) q + ( 0.6 ) q ( 0.1 ) q ( 0.2 ) q ) × 5 2 = 1.56 × 5 2 = 3.9
S ( d 2 ) = ( 1 + ( 0.6 ) q + ( 0.7 ) q ( 1 2 ( 0.1 + 0.3 ) ) q ( 1 2 ( 0.2 + 0.4 ) ) q ) × 5 2 = 1.72 × 5 2 = 4.3
From the results, we can find that S ( d 1 ) < S ( d 2 ) , then d 1 < d 2 . If the score values are the same, then the accuracy values can be considered for comparison, which can be calculated by Equation (3).

2.2. HM, PA and PHM Operator

Definition 4
([18]). Suppose that a i ( i = 1 , 2 , , n ) is a collection of non-negative crisp numbers, then the PA operator is defined as
P A ( a 1 , a 2 , , a n ) = i = 1 n ( 1 + T ( a i ) ) a i i = 1 n ( 1 + T ( a i ) ) ,
where T ( a i ) = j = 1 , i j n S u p ( a i , a j ) . In addition, S u p ( a i , a j ) represents the support for a i from a j , satisfying the conditions:
(1) 
S u p ( a i , a j ) [ 0 , 1 ] ;
(2) 
S u p ( a i , a j ) = S u p ( a j , a i )
(3) 
S u p ( a , b ) S u p ( c , d ) , if | a , b | | c , d | .
Definition 5
([32]). Assume that a i ( i = 1 , 2 , , n ) is a collection of non-negative real numbers. If
H M ( k ) ( a 1 , a 2 , , a n ) = 1 i 1 < < i k n ( j = 1 k a i j ) 1 / k C n k ,
then H M ( k ) is the HM operator. In addition, k = 1 , 2 , , n , C n k is the binomial coefficient, and ( i 1 , i 2 , , i k ) t raverses all the k-tuple combination of ( 1 , 2 , , n ) .
Definition 6
([31]). Suppose that a i ( i = 1 , 2 , , n ) is a collection of non-negative real numbers. Then, the PHM operator is defined as
P H M ( k ) ( a 1 , a 2 , , a n ) = 1 C n k ( 1 i 1 < < i k n ( j = 1 k ( n ( 1 + T ( a i j ) ) a i j j = 1 n ( 1 + T ( a j ) ) ) ) 1 / k ) ,
where k = 1 , 2 , , n , C n k is the binomial coefficient, and ( i 1 , i 2 , , i k ) traverses all the k-tuple combination of ( 1 , 2 , , n ) . In addition, T ( a i ) = j = 1 , i j n S u p ( a i , a j ) and S u p ( a i , a j ) stand for the support for a i from a j satisfying the properties presented in Definition 4.

3. Novel Operations of IVq-RDHLVs Based on LSFs

3.1. Necessity of Proposing New Operations of IVq-RDHLVs

Feng et al. [35] originated some operations of IVq-RDHLVs, which, however, have some shortcomings.
(1)
The existing operations of IVq-RDHLVs are not closed. To illustrate this shortcoming in more detail, we provide the following example.
Example 1.
Assume that there are two IVq-RDHLVs a 1 = s 5 , { { [ 0.3 , 0.4 ] , [ 0.6 , 0.7 ] } , { [ 0.1 , 0.2 ] } } and a 2 = s 3 , { { [ 0.4 , 0.6 ] , [ 0.6 , 0.8 ] } { [ 0.2 , 0.5 ] } } defined on a given LTS S = { s 0 , s 1 , , s 5 } . According to the operational rules proposed by Feng et al. [35], we have
(1) 
α 1 α 2 = s 8 , { { [ 0.4172 , 0.6139 ] , [ 0.6838 , 0.8488 ] } , { [ 0.02 , 0.1 ] } }
(2) 
α 1 α 2 = s 15 , { { [ 0.12 , 0.24 ] , [ 0.36 , 0.56 ] } , { [ 0.2012 , 0.5010 ] } }
(3) 
α 1 3 = s 75 , { { [ 0.027 , 0.064 ] , [ 0.216 , 0.343 ] } , { [ 0.1246 , 0.2491 ] } }
(4) 
3 α 1 = s 15 , { { [ 0.3735 , 0.4973 ] , [ 0.7358 , 0.8424 ] } , { [ 0.001 , 0.008 ] } }
The calculation result of Example 1 shows that the operation proposed by Feng et al. [35] has a drawback: the calculation results of the linguistic term set (LTS) easily breaks the predefined upper limit; thus, these operations are not closed.
(2)
These rules proposed by Feng et al. [35] assumed that the semantic gap between any two adjacent LTs is always equal. However, in practical MADM problems, DMs may feel that the semantic gap will change when the subscript of the LT increase or decrease. For example, DMs may believe that the semantic gap between “extremely poor” and “very poor” is greater or smaller than “good” and “very good”.

3.2. The Notion of LFSs

Definition 7
([46]). Assume that S = { s i | i = 0 , 1 , , 2 t } is an LTS, and s i S is a linguistic variable. For any real number γ i ( i = 0 , 1 , 2 , , 2 t ) , an LSF f is a mapping from s i to γ i ( i = 0 , 1 , 2 , , 2 t ) such that:
f : s i γ i ( i = 0 , 1 , 2 , , 2 t ) ,
where 0 γ 0 < γ 1 < < γ 2 t .
The three most widely used LSFs are presented as follows.
LSF 1 :   f 1 ( s i ) = γ i = i 2 t ( i = 1 , 2 , , 2 t )
LSF 2 :   f 2 ( s i ) = γ i = { ρ t ρ t i 2 ρ t 2   ( i = 0 , 1 , 2 , , t ) ρ t + ρ t i 2 2 ρ t i 2   ( i = t + 1 , t + 2 , , 2 t )
LSF 3 :   f 3 ( s i ) = γ i = { t ε ( t i ) ε 2 t ε   ( i = 0 , 1 , 2 , , t ) t β + ( i t ) β 2 t β   ( i = t + 1 , t + 2 , , 2 t ) , ( ε , β [ 0 , 1 ] ) ,
For Equations (9) and (10), it can be seen that the absolute deviations between adjacent linguistic subscripts are different. For example, in Equation (9), the semantic gap between “extremely poor” and “very poor” is smaller than “good” and “very good”. However, in Equation (10), the semantic gap between “extremely poor” and “very poor” is greater than “good” and “very good”. For more information, please refer to the literature by Liu et al. (2019). In particular, if ε = β = 1 , then Equation (11) is reduced to Equation (8). Meanwhile, the function f can be further expanded to a continuous function such that f * : f ˜ Ω + ( Ω + = { d | d 0 } , d R ) , which satisfies f * ( s i ) = γ i . The inverse function of f * is depicted as f * 1 . Then, we can obtain
LSF   1 :   f 1 * 1 ( γ i ) = s 2 t * i ( i = 0 , 1 , 2 , , 2 t ) ,
LSF   2 :   f 2 * 1 ( γ i ) = { s t log ρ ( ρ t ( 2 ρ t 2 ) γ i ) ,   ( γ i [ 0 , 0.5 ] ) s t + log ρ ( ( 2 ρ t 2 ) γ i ρ t + 2 ) ,   ( γ i [ 0.5 , 1.0 ] ) ,
LSF   3 :   f 3 * 1 ( γ i ) = { s t ( t ε 2 × t ε × γ i ) 1 / ε ,   ( γ ε [ 0 , 0.5 ] ) s t + ( 2 × t β × γ i t β ) 1 / β ,   ( γ β [ 0.5 , 1 ] ) ,

3.3. Operational Rules of IVq-RDHLVs Based on the LSF

Definition 8.
Let d = s θ , ( h , g ) , d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) be any three IVq-RDHLVs, then
  • (1)  d 1 d 2 = f * 1 ( f * ( θ 1 ) + f * ( θ 2 ) f * ( θ 1 ) f * ( θ 2 ) ) ,
    r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ ( ( r 1 l ) q + ( r 2 l ) q ( r 1 l r 2 l ) q ) 1 / q , ( ( r 1 u ) q + ( r 2 u ) q ( r 1 u r 2 u ) q ) 1 / q ] } , { [ η 1 l η 2 l , η 1 u η 2 u ] } } ;
  • (2)  d 1 d 2 = f * 1 ( f * ( θ 1 ) f * ( θ 2 ) ) ,
    r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ r 1 l r 2 l , r 1 u r 2 u ] } , { [ ( ( η 1 l ) q + ( η 2 l ) q ( η 1 l η 2 l ) q ) 1 / q , ( ( η 1 u ) q + ( η 2 u ) q ( η 1 u η 2 u ) q ) 1 / q ] } } ;
  • (3)  λ d = f * 1 ( 1 ( 1 f * ( θ 1 ) ) λ ) ,
    r h , η g { { [ ( 1 ( 1 ( r l ) q ) λ ) 1 / q , ( 1 ( 1 ( r u ) q ) λ ) 1 / q ] } , { ( η l ) λ , ( η u ) λ } } ;
  • (4)  d λ = f * 1 ( ( f * ( θ ) ) λ ) ,
    r h , η g { { ( r l ) λ , ( r u ) λ } , { [ ( 1 ( 1 ( η l ) q ) λ ) 1 / q , ( 1 ( 1 ( η u ) q ) λ ) 1 / q ] } } .
Theorem 1.
Let d = s θ , ( h , g ) , d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) be any three IVq-RDHLVs, then
( 1 )   d 1 d 2 = d 2 d 1 ;
( 2 )   d 1 d 2 = d 2 d 1 ;
( 3 )   λ ( d 1 d 2 ) = λ d 1 λ d 2 ( λ 0 ) ;
( 4 )   λ 1 d λ 2 d = ( λ 1 λ 2 ) d ( λ 1 , λ 2 ) 0 ;
( 5 )   d 1 λ d 2 λ = ( d 1 d 2 ) λ ( λ 0 ) ;
( 6 )   d λ 1 d λ 2 = d λ 1 + λ 2 ( λ 1 , λ 2 0 ) .
It is easy to prove Equations (14) and (15), so we omit them here.
Proof. 
According to the operational rules of IVq-RDHLVs in Definition 8, we can obtain
λ ( d 1 d 2 ) = λ f * 1 ( 1 ( 1 f * ( θ 1 ) ) ( 1 f * ( θ 2 ) ) ) , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ ( ( r 1 l ) q + ( r 2 l ) q ( r 1 l r 2 l ) q ) 1 / q , ( ( r 1 u ) q + ( r 2 u ) q ( r 1 u r 2 u ) q ) 1 / q ] } , { [ η 1 l η 2 l , η 1 u η 2 u ] } } = f * 1 ( ( ( 1 f * ( θ 1 ) ) ( 1 f * ( θ 2 ) ) ) λ ) , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ ( 1 ( 1 ( r 1 l ) q ) λ ( 1 ( r 2 l ) q ) λ ) 1 / q , ( 1 ( 1 ( r 1 U ) q ) λ ( 1 ( r 2 U ) q ) λ ) 1 / q ] } , { [ ( η 1 l η 2 l ) λ , ( η 1 u η 2 u ) λ ] } } λ d 1 λ d 2 = f * 1 ( 1 ( 1 f * ( θ 1 ) ) λ ) , r 1 h 1 , η 1 g 1 { { [ ( 1 ( 1 ( r 1 l ) q ) λ ) 1 / q , ( 1 ( 1 ( r 1 u ) q ) λ ) 1 / q ] } , { ( η 1 l ) λ , ( η 1 u ) λ } } f * 1 ( 1 ( 1 f * ( θ 2 ) ) λ ) , r 2 h 2 , η 2 g 2 { { [ ( 1 ( 1 ( r 2 l ) q ) λ ) 1 / q , ( 1 ( 1 ( r 2 u ) q ) λ ) 1 / q ] } , { ( η 2 l ) λ , ( η 2 u ) λ } } = f * 1 ( ( 1 ( 1 f * ( θ 1 ) ) λ ( 1 f * ( θ 2 ) ) λ ) ) , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ ( 1 ( 1 ( r 1 l ) q ) λ ( 1 ( r 2 l ) q ) λ ) 1 / q , ( 1 ( 1 ( r 1 U ) q ) λ ( 1 ( r 2 U ) q ) λ ) 1 / q ] } , { [ ( η 1 l η 2 l ) λ , ( η 1 u η 2 u ) λ ] } } = λ ( d 1 d 2 )
According to the above process, it is obvious that Equation (16) holds for λ 0 . In addition, we have
λ 1 d λ 2 d = f * 1 ( 1 ( 1 f * ( θ ) ) λ 1 ( 1 f * ( θ ) ) λ 2 ) , r h , η g { { [ ( 1 ( 1 ( r l ) q ) λ 1 ( 1 ( r l ) q ) λ 2 ) 1 / q , ( 1 ( 1 ( r U ) q ) λ 1 ( 1 ( r U ) q ) λ 1 ) 1 / q ] } , { [ ( η l ) λ 1 ( η l ) λ 2 , ( η U ) λ 1 ( η U ) λ 2 ] } } = ( λ 1 + λ 2 ) d
According to the above process, Equation (17) is kept. Based on Definition 7 and Definition 8, we have
d 1 λ d 2 λ = f * 1 ( ( f * ( θ 1 ) f * ( θ 2 ) ) λ ) , r 1 h 1 , r 2 h 2 , η 1 g 1 , η 2 g 2 { { [ ( r 1 l r 2 l ) λ , ( r 1 u r 2 u ) λ ] } , { [ ( 1 ( 1 ( η 1 l ) q ) λ ( 1 ( η 2 l ) q ) λ ) 1 / q , ( 1 ( 1 ( η 1 U ) q ) λ ( 1 ( η 2 U ) q ) λ ) 1 / q ] } } = d 1 λ d 2 λ d λ 1 d λ 2 = f * 1 ( ( f * ( θ ) ) λ 1 ( f * ( θ 2 ) ) λ 2 ) , r h , η g { { [ ( r l ) λ 1 ( r l ) λ 2 , ( r U ) λ 1 ( r U ) λ 2 ] } , { [ ( 1 ( 1 ( η l ) q ) λ 1 ( 1 ( η l ) q ) λ 2 ) 1 / q , ( 1 ( 1 ( η U ) q ) λ 1 ( 1 ( η U ) q ) λ 1 ) 1 / q ] } } = d λ 1 + λ 2 .
So far, Theorem 1 have been proved.□

3.4. Comparison Method of IVq-RDHLVs Based on LSF

Based on LSF f, the comparison method of IVq-RDHLVs is put forward as follows.
Definition 9.
Assume that d = s θ , ( h , g ) is an IVq-RDHLV, then the score function of d can be calculated by
S ( d ) = ( 1 + ( 1 # h [ r l , r u ] h r l ) q + ( 1 # h [ r l , r u ] h r u ) q ( 1 # g [ η l , η u ] g η l ) q ( 1 # g [ η l , η u ] g η l ) q ) × f * ( θ ) 2 .
and the accuracy function of d can be computed by
p ( d ) = ( ( 1 # h [ r l , r u ] h r l ) q + ( 1 # h [ r l , r u ] h r u ) q + ( 1 # g [ η l , η u ] g η l ) q + ( 1 # g [ η l , η u ] g η l ) q ) × f * ( θ ) .
For any two IVq-RDHLVs d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) , the specific comparison rules are presented in Definition 3.

3.5. Distance Measure of IVq-RDHLVs

In this section, we propose a new concept of the distance between two IVq-RDHLVs based on the LSF.
Definition 10.
Suppose that d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) are any two IVq-RDHLVs, then the distance between d 1 and d 2 is expressed as
d ( d 1 , d 2 ) = ( 1 2 ( # h + # g ) ( i = 1 # h ( | ( ( γ 1 L ) σ ( i ) ) q ( ( γ 2 L ) σ ( i ) ) q | + | ( ( γ 1 U ) σ ( i ) ) q ( ( γ 2 U ) σ ( i ) ) q | ) + j = 1 # g ( | ( ( η 1 L ) σ ( j ) ) q ( ( η 2 L ) σ ( j ) ) q | + | ( ( η 1 U ) σ ( j ) ) q ( ( η 2 U ) σ ( j ) ) q | ) ) × | f * ( θ 1 ) f * ( θ 2 ) | .
where [ ( γ 1 L ) σ ( i ) , ( γ 1 U ) σ ( i ) ] h 1 , [ ( γ 2 L ) σ ( i ) , ( γ 2 U ) σ ( i ) ] h 2 , [ ( η 1 L ) σ ( i ) , ( η 1 U ) σ ( i ) ] g 1 , [ ( η 2 L ) σ ( i ) , ( η 2 U ) σ ( i ) ] g 2 , [ ( γ 1 L ) σ ( i ) , ( γ 1 U ) σ ( i ) ] < [ ( γ 1 L ) σ ( i + 1 ) , ( γ 1 U ) σ ( i + 1 ) ] , [ ( γ 2 L ) σ ( i ) , ( γ 2 U ) σ ( i ) ] < [ ( γ 2 L ) σ ( i + 1 ) , ( γ 2 U ) σ ( i + 1 ) ] , [ ( η 1 L ) σ ( i ) , ( η 1 U ) σ ( i ) ] < [ ( η 1 L ) σ ( i + 1 ) , ( η 1 U ) σ ( i + 1 ) ] and [ ( η 2 L ) σ ( i ) , ( η 2 U ) σ ( i ) ] < [ ( η 2 L ) σ ( i + 1 ) , ( η 2 U ) σ ( i + 1 ) ] . In addition, #h represents the number of interval values contained in h1 and h2, and #g represents the number of elements that make up g1 and g2.
Remark 2. 
([35]). Assume that d 1 = s θ 1 , ( h 1 , g 1 ) and d 2 = s θ 2 , ( h 2 , g 2 ) are any two IVq-RDHLVs. From Definition 10, it is obvious that #h1 = #h2 and #g1 = #g2, which means that h1 and h2 should have the same number of values, and g1 and g2 should have the same number of values when calculating the distance. However, this condition cannot be always satisfied. In order to make the MD and NMD numbers of the two IVq-RDHFEs equal, Feng et al. [35] proposed two methods to adjust the IVq-RDHFEs, which fail to satisfy the condition. Inspired by this idea, we extend the shorter IVq-RDHLV to satisfy the condition by adding the largest interval values in MD and NMD, respectively.
Example 2.
Assume that there are two evaluation values denoted by IVq-RDHLVs, which are d 1 = { s 3 , { [ 0.3 , 0.4 ] } , { [ 0.3 , 0.5 ] , [ 0.4 , 0.6 ] , [ 0.7 , 0.8 ] } } and d 2 = { s 5 , { [ 0.2 , 0.3 ] , [ 0.4 , 0.7 ] } { [ 0.3 , 0.5 ] , [ 0.6 , 0.8 ] } } defined on a given LTS S = { s 0 , s 1 , s 2 , s 3 , s 4 , s 5 } . For calculation, d 1 and d 2 can be transformed to d 1 and d 2 , respectively ( q = 5 ).
d 1 = { s 3 , { [ 0.3 , 0.4 ] , [ 0.3 , 0.4 ] } , { [ 0.3 , 0.5 ] , [ 0.4 , 0.6 ] , [ 0.7 , 0.8 ] } } , d 2 = { s 5 , { [ 0.2 , 0.3 ] , [ 0.4 , 0.7 ] } , { [ 0.3 , 0.5 ] , [ 0.3 , 0.5 ] , [ 0.6 , 0.8 ] } } .
If we use LSF1, then the distance between d 1 and d 2 is
d ( d 1 , d 2 ) = | 3 6 5 5 | × ( 1 2 ( 2 + 3 ) ( ( | ( 0.3 ) q ( 0.2 ) q | + | ( 0.4 ) q ( 0.3 ) q | + | ( 0.3 ) q ( 0.4 ) q | + | ( 0.4 ) q ( 0.7 ) q | ) + ( | ( 0.3 ) q ( 0.3 ) q | + | ( 0.5 ) q ( 0.5 ) q | + | ( 0.4 ) q ( 0.3 ) q | + | ( 0.6 ) q ( 0.5 ) q | + | ( 0.7 ) q ( 0.6 ) q | + | ( 0.8 ) q ( 0.8 ) q | ) ) = 1 3 × ( 1 10 ( ( 0.4 ) q + ( 0.7 ) q ( 0.3 ) q ( 0.2 ) q ) + ( ( 0.7 ) q + ( 0.4 ) q ( 0.3 ) q ( 0.5 ) q ) )   = 0.0107
For two IVq-RDHLVs d 1 and d 2 , d ( d 1 , d 2 ) represents the distance between d 1 and d 2 and satisfy the following properties:
(1)
d ( d 1 , d 2 ) [ 0 , 1 ] ;
(2)
d ( d 1 , d 2 ) = 0 if and only if d 1 = d 2 ;
(3)
d ( d 1 , d 2 ) = d ( d 2 , d 1 ) .

4. Aggregation Operators of IVq-RDHLVs and Their Properties

4.1. The Interval-Valued q-Rung Dual Hesitant Linguistic Power Hamy Mean (IVq-RDHLPHM) Operator

Definition 11. 
Let d i ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, and then tIVq-RDHLPHM operator is defined as
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = 1 C n k ( 1 i 1 < < i k n ( j = 1 k ( n ( 1 + T ( d i j ) ) d i j i = 1 n ( 1 + T ( d i ) ) ) ) 1 / k ) ,
where k = 1 , 2 , , n , C n k is the binomial coefficient and ( i 1 , i 2 , , i k ) traverses all the k-tuple combination of ( 1 , 2 , , n ) . Moreover, T ( d i ) = j = 1 , i j n S u p ( d i , d j ) and S u p ( d i , d j ) stand for the support for d i from d j and satisfy the conditions presented in Definition 4.
In order to simplify Equation (22), assume that
σ i = 1 + T ( d i ) i = 1 n ( 1 + T ( d i ) ) ,
then Equation (22) can be transformed as
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = 1 C n k ( 1 i 1 < < i k n ( j = 1 k ( n σ i j d i j ) ) ) 1 / k ) ,
where 0 σ i 1 and i = 1 n σ i = 1 .
Theorem 2. 
Let d i = s θ i , ( h i , g i ) ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, then the results aggregated by the IVq-RDHLPHM operator is also an IVq-RDHLV and
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) 1 / k ) 1 / q C n k ] } } .
Proof. 
From Definitions 8 and 9, we can obtain
n σ i j d i j = f * 1 ( 1 ( 1 f * ( θ i j ) ) n σ i j ) , r i j h i j , η i j g i j { { [ ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / q , ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / q ] } , { [ ( η i j L ) n σ i j , ( η i j U ) n σ i j ] } }
and
j = 1 k ( n σ i j d i j ) = f * 1 ( j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) ) , r i j h i j , η i j g i j { { [ j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / q , j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / q ] } , { [ ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) ) 1 / q , ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) ) 1 / q ] } } .
Further,
j = 1 k ( n σ i j d i j ) 1 / k = f * 1 ( j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) , r i j h i j , η i j g i j { { [ j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / k q , j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / k q ] } , { [ ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) 1 / k ) 1 / q , ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) 1 / k ) 1 / q ] } }
and
1 i 1 < < i k n ( j = 1 k ( n σ i j d i j ) ) 1 / k = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / k ) ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / k ) ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) 1 / k ) 1 / q , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) 1 / k ) 1 / q ] } } .
Finally,
1 C n k 1 i 1 < < i k n ( j = 1 k ( n σ i j d i j ) ) 1 / k = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) 1 / k ) 1 / q C n k ] } } .
Theorem 3. 
Let d i = s θ i , ( h i , g i ) ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, if d i = d = s θ , ( h , g ) for all i, and there is only one MD and NMD in d, then
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = d .
Proof. 
According to d i = d = s θ , ( h , g ) , we can have S u p ( d i , d j ) = 1 for all i , j = ( 1 , 2 , 3 , , n ) ( i j ) , then σ i j = 1 n hold for all i. According to Theorem 2, we obtain
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n σ i j ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q σ i j ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q σ i j ) 1 / k ) 1 / q C n k ] } } = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n × 1 n ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n × 1 n ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n × 1 n ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q × 1 n ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q × 1 n ) 1 / k ) 1 / q C n k ] } } = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( f * ( θ i j ) ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( ( γ i j L ) q ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( ( γ i j U ) q ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) q ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) q ) 1 / k ) 1 / q C n k ] } } = f * 1 ( 1 1 i 1 < < i k n ( 1 f * ( θ i ) ) 1 C n k ) , r i h i , η i g i { { [ ( 1 1 i 1 < < i k n ( 1 ( γ i L ) q ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 ( γ i U ) q ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 ( 1 ( η i L ) q ) ) 1 / q C n k , 1 i 1 < < i k n ( 1 ( 1 ( η i U ) q ) ) 1 / q C n k ] } } = f * 1 ( 1 ( 1 f * ( θ ) ) 1 C n k × C n k ) , r h , η g { { [ ( 1 ( 1 ( γ l ) q ) 1 C n k × C n k ) 1 / q , ( 1 ( 1 ( γ u ) q ) 1 C n k × C n k ) 1 / q ] } { [ ( ( η l ) q ) C n k × 1 q C n k , ( ( η u ) q ) C n k × 1 q C n k ] } } = f * 1 ( f * ( θ ) ) , r h , η g , { { [ ( ( γ l ) q ) 1 / q , ( ( γ u ) q ) 1 / q ] } , { [ η l , η u ] } } = θ , r h , η g , { { [ γ l , γ u ] } , { [ η l , η u ] } } = d
Theorem 4.
Let d i = s θ i , ( h i , g i ) ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, if d = min ( d 1 , d 2 , , d n ) and d + = max ( d 1 , d 2 , , d n ) , then
x I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) y .
where x = 1 C n k 1 i 1 < < i k n ( j = 1 k ( n σ i j d ) ) 1 / k and y = 1 C n k 1 i 1 < < i k n ( j = 1 k ( n σ i j d + ) ) 1 / k .
Proof. 
From Definition 11, we can obtain
n σ i j d n σ i j d i j   and   j = 1 k ( n σ i j d ) j = 1 k n σ i j d i j
Then,
( j = 1 k ( n σ i j d ) ) 1 / k ( j = 1 k n σ i j d i j ) 1 / k
Further,
1 i 1 < < i k n ( j = 1 k ( n σ i j d ) ) 1 / k 1 i 1 < < i k n ( j = 1 k n σ i j d i j ) 1 / k
Thus,
1 C n k 1 i 1 < < i k n ( j = 1 k ( n σ i j d ) ) 1 / k 1 C n k 1 i 1 < < i k n ( j = 1 k n σ i j d i j ) 1 / k
which means that x I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) .
Similarly, we can also prove that I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) y . Thus, the proof of Theorem 4 is completed. □
Next, we will explore several special cases of the IVq-RDHLPHM operator when the parameter values changes.
Case 1. 
When k = 1 , the proposed IVq-RDHLPHM operator is simplified to IVq-RDHL power average (IVq-RDHLPA) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 f * ( θ i ) ) σ i ) , r i h i , η i g i { { [ ( 1 i = 1 n ( 1 ( γ i L ) q ) σ i ) 1 / q , ( 1 i = 1 n ( 1 ( γ i U ) q ) σ i ) 1 / q ] } , { [ i = 1 k ( η i L ) σ i , i = 1 k ( η i U ) σ i ] } } = i = 1 n σ i d i = I V q R D H L P A ( d 1 , d 2 , , d n ) .
Moreover, for all S u p ( d i , d j ) = t > 0 , i j , then the IVq-RDHLPHM operator is simplified to the IVq-RDHL average (IVq-RDHLA) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 f * ( θ i ) ) 1 / n ) , r i h i , η i g i { { [ ( 1 i = 1 n ( 1 ( γ i L ) q ) 1 / n ) 1 / q , ( 1 i = 1 n ( 1 ( γ i U ) q ) 1 / n ) 1 / q ] } , { [ i = 1 k ( η i L ) 1 / n , i = 1 k ( η i U ) 1 / n ] } } = 1 n i = 1 n d i = I V q R D H L A ( d 1 , d 2 , , d n ) .
Case 2. 
When k = n , the IVq-RDHLPHM operator is simplified to IVq-RDHL power geometric (IVq-RDHLPG) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( j = 1 k ( 1 ( 1 f * ( θ j ) ) n σ j ) 1 n ) , r j h j , η j g j { { [ j = 1 k ( γ j L ) σ j , j = 1 k ( γ j U ) σ j ] } , { [ ( 1 j = 1 n ( 1 ( η j L ) q ) σ j ) 1 / q , ( 1 j = 1 n ( 1 ( η j U ) q ) σ j ) 1 / q ] } } = ( j = 1 n n σ j d j ) 1 / n = I V q R D H L P G ( d 1 , d 2 , , d n ) .
Moreover, for all S u p ( d i , d j ) = t > 0 , i j , then the IVq-RDHLPHM operator is simplified to IVq-RDHL geometric (IVq-RDHLG) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( j = 1 k ( f * ( θ j ) ) 1 n ) , r j h j , η j g j { { [ j = 1 k ( γ j L ) 1 n , j = 1 k ( γ j U ) 1 n ] } , { [ ( 1 j = 1 n ( 1 ( η j L ) q ) 1 n ) 1 / q , ( 1 j = 1 n ( 1 ( η j U ) q ) 1 n ) 1 / q ] } } = ( j = 1 n d j ) 1 / n = I V q R D H L G ( d 1 , d 2 , , d n ) .
Case 3. 
When q = 1 , the IVq-RDHLPHM operator is simplified to interval-valued dual hesitant linguistic PHM (IVDHLPHM) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) ) n σ i j ) 1 / k ) 1 C n k , 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) ) n σ i j ) 1 / k ) 1 C n k ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n σ i j ) 1 / k ) 1 / C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n σ i j ) 1 / k ) 1 / C n k ] } } .
Moreover, for all S u p ( d i , d j ) = t > 0 , i j , then the IVq-RDHLPHM operator is simplified to interval-valued dual hesitant linguistic HM (IVDHLHM) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( f * ( θ i j ) ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ 1 1 i 1 < < i k n ( 1 j = 1 k ( γ i j L ) 1 / k ) 1 C n k , 1 1 i 1 < < i k n ( 1 j = 1 k ( γ i j U ) 1 / k ) 1 C n k ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) ) 1 / k ) 1 / C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) ) 1 / k ) 1 / C n k ] } } .
Case 4. 
When q = 2 , the IVq-RDHLPHM operator is simplified to interval-valued dual hesitant Pythagorean linguistic PHM (IVDHPLPHM) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n σ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) 2 ) n σ i j ) 1 / k ) 1 C n k ) 1 / 2 , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) 2 ) n σ i j ) 1 / k ) 1 C n k ) 1 / 2 ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) 2 n σ i j ) 1 / k ) 1 / C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) 2 n σ i j ) 1 / k ) 1 / C n k ] } } .
In addition, for all S u p ( d i , d j ) = t > 0 , i j , the IVq-RDHLPHM operator is simplified to interval-valued dual hesitant Pythagorean linguistic HM (IVDHPLHM) operator.
I V q R D H L P H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( f * ( θ i j ) ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( γ i j L ) 2 / k ) 1 C n k ) 1 / 2 , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( γ i j U ) 2 / k ) 1 C n k ) 1 / 2 ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) 2 ) 1 / k ) 1 / 2 C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) 2 ) 1 / k ) 1 / 2 C n k ] } } .

4.2. The Interval-Valued q-Rung Dual Hesitant Linguistic Power Weighted Hamy Mean (IVq-RDHLPWHM) Operator

Let d i ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs and k = 1 , 2 , , n . The corresponding weight vector can be denoted as w = ( w 1 , w 2 , , w n ) T , satisfying 0 w i 1 and i = 1 n w i = 1 . Then, the IVq-RDHLPWHM operator is expressed as
I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) = 1 C n k ( 1 i 1 < < i k n ( j = 1 k ( n w i j ( 1 + T ( d i j ) ) d i j i = 1 n w i ( 1 + T ( d i ) ) ) ) 1 / k ) ,
where C n k is the binomial coefficient, and ( i 1 , i 2 , , i k ) traverses all the k-tuple combination of ( 1 , 2 , , n ) . In addition, T ( d i ) = j = 1 , i j n S u p ( d i , d j ) and S u p ( d i , d j ) represents the support for d i from d j , satisfying the conditions depicted in Definition 4.
For convenience, we assume
δ i = w i ( 1 + T ( d i ) ) i = 1 n w i ( 1 + T ( d i ) ) ,
then, Equation (37) can be transformed into
I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) = 1 C n k ( 1 i 1 < < i k n ( j = 1 k ( n δ i j d i j ) ) 1 / k ) ,
where 0 δ i 1 and i = 1 n δ i = 1 .
Theorem 5.
Let d i = s θ i , ( h i , g i ) ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, then the results aggregated by the IVq-RDHLPWHM operator is also an IVq-RDHLV and
I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) = f * 1 ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 f * ( θ i j ) ) n δ i j ) 1 / k ) 1 C n k ) , r i j h i j , η i j g i j { { [ ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j L ) q ) n δ i j ) 1 / k ) 1 C n k ) 1 / q , ( 1 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( 1 ( γ i j U ) q ) n δ i j ) 1 / k ) 1 C n k ) 1 / q ] } { [ 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j L ) n q δ i j ) 1 / k ) 1 / q C n k , 1 i 1 < < i k n ( 1 j = 1 k ( 1 ( η i j U ) n q δ i j ) 1 / k ) 1 / q C n k ] } } .
The specific proof process of Theorem 5 is omitted here because it is similar to the proof of Theorem 2.
Theorem 6.
(Boundedness) Let d i = s θ i , ( h i , g i ) ( i = 1 , 2 , , n ) be a collection of IVq-RDHLVs, if d = min ( d 1 , d 2 , , d n ) and d + = max ( d 1 , d 2 , , d n ) , then
x I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) y .
where x = 1 C n k 1 i 1 < < i k n ( j = 1 k ( n δ i j d ) ) 1 / k and y = 1 C n k 1 i 1 < < i k n ( j = 1 k ( n δ i j d + ) ) 1 / k .
Proof. 
From Definition 11, we can obtain
n δ i j d n δ i j d i j and j = 1 k ( n δ i j d ) j = 1 k n δ i j d i j
Then,
( j = 1 k ( n δ i j d ) ) 1 / k ( j = 1 k n δ i j d i j ) 1 / k
Further,
1 i 1 < < i k n ( j = 1 k ( n δ i j d ) ) 1 / k 1 i 1 < < i k n ( j = 1 k n δ i j d i j ) 1 / k
Thus,
1 C n k 1 i 1 < < i k n ( j = 1 k ( n δ i j d ) ) 1 / k 1 C n k 1 i 1 < < i k n ( j = 1 k n δ i j d i j ) 1 / k
which means that x I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) .□
Similarly, we can also prove that I V q R D H L P W H M ( k ) ( d 1 , d 2 , , d n ) y . Thus, the proof of Theorem 6 is completed.

5. A MADM Method under IVq-RDHLSs

For a MADM problem, DMs express their assessment with IVq-RDHLSs information. Assume that there are m alternatives { A 1 , A 2 , , A m } that will be evaluated, and n attributes { C 1 , C 2 , , C n } should be considered in the process of decision making. The weight vector of the attributes is w = ( w 1 , w 2 , , w n ) T , which satisfy that 0 w j 1 and j = 1 n w j = 1 . When evaluating, DMs use IVq-RDHLS d i j = s θ i j , ( h i j , g i j ) ( i = 1 , 2 , , m ; j = 1 , 2 , , n ) to express their evaluation of the attribute C j ( j = 1 , 2 , , n ) of A i ( i = 1 , 2 , , m ) . Later, the overall evaluation information can be collected, and a decision matrix can be obtained, which can be written as R i j = ( d i j ) m × n . In the following, we introduce the steps of how to determine the ranks of alternatives based on the IVq-RDHLPWHM operator.
Step 1. Standardize the original decision values. Before aggregation, the original decision values should be standardized according to the following formula:
d i j = { s θ i j , ( h i j , g i j ) C j   i s   b e n e f i t   t y p e s θ i j , ( g i j h i j ) C j   i s   c o s t   t y p e ,
Step 2. Calculate the support
S u p ( d i l , d i m ) = 1 d ( d i l , d i m ) , ( l , m = 1 , 2 , , n , l m ) ,
Step 3. Compute the T ( d i j ) between the two IVq-RDHLS d i l and d i m by
T ( d i j ) = l , m = 1 , l m n S u p ( d i l , d i m ) .
Step 4. Compute the power weight δ i j associated with IVq-RDHLSs by
δ i j = w i ( 1 + T ( d i j ) ) i = 1 n w i ( 1 + T ( d i j ) ) .
Step 5. Calculate the overall evaluation values d i of the alternative A i by
d i = I V q R D H L P W H M ( k ) ( d i 1 , d i 2 , , d i n )
Step 6. Calculate the score values of d i ( i = 1 , 2 , , n ) according to the Equation (20).
Step 7. Rank all the alternatives according to the score values, and choose the best alternative.

6. A Case Study in Assessment Indicator System of Patient Admission Evaluation

With the development of society, the aging of the population and the improvement of health awareness, people’s medical needs are increasing rapidly. However, medical resources, such as bed resources, medical technology, and operating rooms, are limited. When scarce resources cannot accommodate a large number of hospitalized patients, a feasible solution is to prioritize the patient’s hospitalization list. In practical MADM problems, there are always qualitative criteria whose values can hardly be depicted by crisp values, such as the level of pain, the severity of illness, etc. The IVq-RDHLs provide a new and powerful technique to represent the qualitative judgments of experts. Therefore, in order to assess the relative priorities of patients for treatment on a waiting list, we construct an evaluation index system to allow the patients with a high degree of disease severity to be hospitalized.

6.1. Patient Admission Evaluation Criteria

In this section, we build a patient admission evaluation index system for general patient prioritization. In practical problems, the evaluation of patient prioritization involves multiple factors and multiple indicators, such as the level of pain, the severity of illness, and the impact on the patient’s life year, etc. To solve this problem, Li et al. [47] conducted an investigation on the admission process and obtained four dimensions, including clinical and functional disorders (C1), expected outcomes (C2), social factors (C3), patient’s basic information (C4), as shown in Table 1.
Example 3.
Suppose that there are four patients A i ( i = 1 , 2 , 3 , 4 ) needed to be considered for patient admission. The parameters C j ( j = 1 , 2 , 3 , 4 ) are employed in assessing the patients, in which C 1 represents clinical and functional disorders, C 2 represents expected outcomes, C 3 represents social factors, and C 4 represents patient basic information, whose weight vector is w = ( 0.3 , 0.3 , 0.2 , 0.2 ) T . Doctors mainly express their assessment information on patients in 5 levels {s1 = noting, s2=low, s3 = medium, s4 = high, s5 = very high}. To express the evaluation information of the patient’s symptoms in detail, doctors request to evaluate the four patients A i ( i = 1 , 2 , 3 , 4 ) from the perspective of the four parameters C j ( j = 1 , 2 , 3 , 4 ) by IVq-RDHLs. Then, a decision matrix d i j = s θ i j , ( h i j , g i j ) ( i = 1 , 2 , 3 , 4 ; j = 1 , 2 , 3 , 4 ) consisting of IVq-RDHLs can be obtained, which is shown inTable 2.
Step 1. After analysis, it is obvious that all attributes belong to benefit type, so there is no need to standardize the original matrix according to Equation (42).
Step 2. Calculate the support S u p ( d i l , d i m ) according to Equation (43) (suppose we choose LSF1 in the calculation process). For convenience, we use S l m to represent the value S u p ( d i l , d i m ) ( l , m = 1 , 2 , 3 , 4 ; i = 1 , 2 , 3 , 4 ; l m ) . After calculation,
S 12 = S 21 = ( 0.9961 , 0.9871 , 0.9953 , 0.9957 ) ; S 13 = S 31 = ( 0.9937 , 0.9913 , 0.9932 , 0.9826 ) ; S 14 = S 41 = ( 0.9894 , 0.9779 , 0.9668 , 0.9705 ) S 23 = S 32 = ( 0.9828 , 0.9911 , 0.9902 , 0.9738 ) . S 24 = S 42 = ( 0.9851 , 0.9860 , 0.9774 , 0.9896 ) S 34 = S 43 = ( 0.9937 , 0.9907 , 0.9647 , 0.9820 )
Step 3. Calculate T ( d i j ) according to Equation (44). The symbol T represents the value T ( d i j ) ,
T = [ 2.9792   2.9640   2.9702   2.9682 2.9563   2.9642   2.9731   2.9545 2.9553   2.9629   2.9481   2.9089 2.9488   2.9591   2.9384   2.9421 ]
Step 4. Calculate the power weight δ i j according to Equation (45), and we have
σ i j = [ 0.3006   0.2995   0.2000   0.1999 0.2996   0.3002   0.2006   0.1996 0.3006   0.3012   0.2001   0.1981 0.3000   0.3008   0.1995   0.1997 ]
Step 5. For the patients A i ( i = 1 , 2 , 3 , 4 ) , utilize the IVq-RDHLPWHM operator to calculate the evaluation d i ( i = 1 , 2 , 3 , 4 ) . (Assume that k = 2 and q = 4.) We omit them here because the aggregation results are complicated.
Step 6. Calculate the score values S ( d i ) ( i = 1 , 2 , 3 , 4 ) of the overall evaluation values, and we have
S ( d 1 ) = 0.0424 ;   S ( d 2 ) = 0.0745 ;   S ( d 3 ) = 0.0354 ;   S ( d 4 ) = 0.0211
Step 7. According to the score values S ( d i ) ( i = 1 , 2 , 3 , 4 ) , the ranking orders of the patients can be determined, that is A 2 > A 1 > A 3 > A 4 , which indicates that A 2 is the optimal patient that should be admitted to the hospital.

6.2. Sensitivity Analysis

From Definition 12, we can find that the parameters k, q, and LSF f play an important role in calculating the final decision results. Therefore, it is of high necessity to explore the influence on the final score values and ranking orders of alternatives. In this section, we explore how the parameters k, q and LSF affect the outcome of the decision, respectively.

6.2.1. The Impact of the Parameter q

In this part, we explore the influence of the parameter q on the final results. In order to do that, we select different values of q to calculate the results, and the results are shown in Table 3. For convince, we assume k = 2 and choose the LSF 1 when aggregating. The data in Table 3 tell us that the score values increase as the value of q increases. Although the score values are different, the ranking orders are the same A 2 > A 1 > A 3 > A 4 , and A 2 is the optimal patient that should be admitted. Then, how to determine the appropriate value of q is a meaningful and worthy issue. Considering this, the method proposed by Feng et al. [3] suggests that the value of q should be the smallest integer that makes 0 ( ( γ U ) + ) q + ( ( η U ) + ) q 1 ( q 1 ) . For example, an evaluation value produced by a DM using an IVq-RDHLE is s 3 , { { [ 0.5 , 0.6 ] , [ 0.6 , 0.9 ] } , { [ 0.2 , 0.5 ] , [ 0.4 , 0.7 ] } } . As 0.9 3 + 0.7 3 =   1.072 > 1 and 0.9 4 + 0.7 4 = 0.8962 < 1 , then the value of q should be taken as 4.

6.2.2. The Influence of the Parameter k

In this part, we discuss the impact of parameter k on the IVq-RDHLPWHM operator. Then, we assume the parameters q and LSF are stable and change the values of k. Based on this idea, we calculate the final results using the IVq-RDHLPWHM operator and obtain the results, as shown in Table 4. From Table 4, the score values of the four patients are obviously different. Specifically, the score values decrease when the parameter k increases. However, the ranking orders have not changed, i.e., A 2 > A 1 > A 3 > A 4 . In practical problems, the appreciated value of k can be selected according to the preference of the DM. When the DM has a positive attitude towards the alternatives, a smaller value of k will be selected.

6.2.3. The Influence of the LSF

Obviously, LSF f have an important impact on the final results. Therefore, we select different LSF f values to solve Example 3, and the score values are shown in Table 5. It is found from Table 5 that with different f values, the score values of the alternatives are different. However, A 2 > A 1 > A 3 > A 4 is always the ranking orders of alternative, and A 2 is the optimal alternative. Different LSF f values represent the understanding of a semantic gap by different DMs. In reality, the appropriate LSF f can be selected according to actual needs. If the DM thinks that adjacent semantics are equal, we can choose LSF1. If the DM has a positive attitude towards semantics, choose LSF2; otherwise, choose LSF3. All in all, the existence of LSF proves the practicality and flexibility of the new method.

6.3. Validity Analysis

In this section, we perform a comparative analysis between the two existing methods and our method. Later, we divided the comparison into two subsections as follows.

6.3.1. Compared with the Method Based on the IVq-RDHLWMSM Operator

In this subsection, the method based on the IVq-RDHLWMSM operator proposed by Feng et al. [35] and the method we proposed are used to calculate the decision results, and the results are shown in Table 6. In addition, we choose different values of k when using the IVq-RDHLWMSM operator [35] and choose different LSF values when using the IVq-RDHLPWHM operator. Although the score values are obtained by different methods and different parameters, the ranking orders are the same. To be precise, compared with the method proposed by Feng et al. [35], our method can consider the understanding of different semantics according to the adjustment of LSF. Therefore, our method has strong flexibility compared to the IVq-RDHLWMSM operator proposed by Feng et al.’s [35].

6.3.2. Compared with Du et al.’s Method

Example 4.
(Revised from Du et al. [48]) A hospital intends to choose a supplier of medical equipment, and the choice of the supplier is affected by many factors. Suppose that there are four suppliers A i ( i = 1 , 2 , 3 , 4 ) that should be evaluated based on the four attributes C j ( j = 1 , 2 , 3 , 4 , 5 ) : the quality ( C 1 ), the price ( C 2 ), the service performance ( C 3 ), and the user evaluation ( C 4 ). The weight vector of the attributes is w = ( 0.29 , 0.28 , 0.18 , 0.25 ) T . When evaluating, DMs were advised to use the interval-valued Pythagorean fuzzy linguistic variables (IVPFLVs) to express their opinion. Then, the decision matrix composed of IVPFLVs is omitted here, and it can be found in reference [48]. Later, two methods based on the IVPFLWA operator [48] and the IVq-RDHLPWHM operator were conducted to calculate the final ranking results. The results presented in Table 7 depict that the score values of each alternative are different, but the ranking orders are the same. In other words, our method cannot only deal with the problems under the IVq-RDHLVs environment but also solve the problems under the IVPFLVs fuzzy environment, which shows the usefulness and power of our proposed method.

6.4. Advantages of the Proposed Method

In this section, we analyze the advantages and strengths of our proposed method point by point.

6.4.1. The Flexibility of Its Operation

In most real MADM problems, DMs may have different semantic preference. The LSF is well-known for its ability to match different DMs’ semantic translation requirements. Our method based on IVq-RDHLPWHM also allows the DMs to choose the appropriate LSFs according to personal preference and the actual semantic environment for selecting the most suitable alternative. To illustrate this advantage, we use our method to solve the problem of Example 4 and obtain the final results by different LSFs (see Table 8). It can be clearly seen from Table 8 that although the score values obtained by different LSFs are different, the ranking orders calculated by different LSFs are completely the same. Therefore, our method can consider more semantic gaps and has more flexibility in solving MADM problems.

6.4.2. Its Capability of Effectively Dealing with DMs’ Unreasonable Evaluation Values

The IVq-RDHLPWHM operator we proposed combined the PA operator and Hamy mean operator. The PA operator is famous for its ability to weaken the influence of extreme evaluation values on the final result because it considers the power weighting of attributes. In the decision-making process, influenced by knowledge background and educational experience, DMs may feel hesitant or have a prejudice against some alternatives; as a result, they may give egregiously high or low arguments when providing assessment information. Therefore, our method can eliminate the influence of extreme values and make the decision results more reasonable.

6.4.3. It Powerfully Deals with the Complex Interrelationship among Multiple Attributes When Aggregating

The IVq-RDHLPWHM operator combines the PA operator and the HM operator. The HM operator can handle the complex interrelationships among attributes. Further, we use the IVq-RDHLPWHM operator to solve Example 4 by using different values of k and obtain the final results (presented in Table 9). Specifically, the value of parameter k indicates how to consider the relationship among attributes in the calculation process. However, the final ranking result of the alternatives shows that no matter what the values of k, the ranking orders are the same. Therefore, our method is robust to deal with the MADM problems because it can flexibly handle the correlation among attributes.

6.4.4. It Effectively Expresses DM’s Evaluation Comprehensively

Example 5.
In Example 4, DMs express their assessment of alternatives using the IVPFLs. In order to illustrate the advantage, we change the assessment of attribute C 3 of A 3 with { s 5 , { [ 0.8 , 0.9 ] } , { [ 0.4 , 0.5 ] } } . Then, use the IVPFLWA operator [48] and our method to solve the problem and obtain the final results (shown in Table 10). Obviously, we can find that the IVPFLWA operator cannot deal with the problem, but our method can still obtain the results. Next, we analyze the reasons for this result. The IVPFLWA operator can only solve the problem that satisfies that the sum of the second power of MG and the second power of NMG should be smaller than or equal to one. However, our method can break the constraint according to the definition of the IVq-RDHLPWHM operator. To be more precise, 0.9 2 + 0.5 2 = 1.06 > 1 , but if we set q = 3 , then 0.9 3 + 0.5 3 = 0.854 < 1 . Therefore, the IVq-RDHLPWHM operator can still deal with Example 5 and obtain the ranking orders, i.e., A 3 > A 4 > A 2 > A 1 , but the IVPFLWA operator cannot solve it. The parameter of q makes DMs describe more information compared with the IVPFLs, which provide a useful tool for DMs when expressing their evaluation on the alternatives more comprehensively.

6.5. Summarization

Based on the above analysis, we have summarized the characteristics of the existing MADM and displayed them in Table 11. From Table 11, it is obvious that our proposed method has more advantages in solving MADM problems compared with other methods. Next, we mainly analyze the following three aspects: (1) Compared with the method based on the IVq-RDHLWMSM operator proposed by Feng et al. [35], IVq-RDHLPWHM can effectively handle DMs’ extreme evaluation values; thereby, the decision results are more accurate and realistic. (2) In addition, the operational laws of our method are more flexible than those of the IVq-RDHLWMSM operator [35] because of the existence of LSF. By choosing different LSFs, the IVq-RDHLPWHM operator can capture the subjective evaluation of DMs, and it can make the final decision results more valuable. For example, a DM thinks that the semantic gap between “extremely bad” and “very bad” is smaller than “very good” and “extremely good”. When aggregating the evaluation values, we should choose LSF 2 to make the final decision results more reasonable. (3) Compared with the method based on the IVPFLWA operator [48], IVq-RDHLPWHM can capture the complicated relationship among the attributes and use it in the calculation of the final results. In addition, the applications of the IVq-RDHLPWHM operator are wider as it can deal with a larger information space, which shows that our method can effectively reduce the loss of evaluation information. In the condition of the DMs believe that adjacent semantics are not equal, the proposed IVq-RDHLPWHM operator based on LSF in this article can handle this issue well. Moreover, the IVq-RDHLPWHM operator can also handle the MADM problem, which is under the condition of the complex interrelationship among attributes and the extreme values proposed by DMs. All in all, our method is more robust and effective than existing methods when dealing with MADM problems.

7. Conclusions

In this paper, we introduce a new MADM method under the IVq-RDHLs fuzzy environment. Firstly, we proposed new operational rules of IVq-RDHLs that can satisfy different DMs’ semantic translation requirements. Secondly, inspired by the idea of the PHM operator and IVq-RDHLs, the IVq-RDHLPHM operator and the IVq-RDHLPWHM operator were proposed, which can not only reduce the negative influence of extreme values but also consider the interrelationships among attributes. Thirdly, we put forward a method based on the IVq-RDHLPWHM operator and show the main steps to dealing with MADM problems that involve IVq-RDHLs fuzzy information. Finally, numerical examples were used to reveal the validity of our method, and comparative analyses were used to explain the powerfulness of our methods. After the comparative analysis, it is obvious that the proposal of the IVq-RDHLPHM operator and the IVq-RDHLPWHM operator provide new solutions for MADM problems. It can not only deal with the understanding of different semantics between LTs by DMs but also capture the relationship among attributes and eliminate the influence of extreme values on the final decision. In the future, we will extend the decision-making methods to more actual MADM problems. In addition, combining IVq-RDHLs with traditional multi-objective decision-making methods (such as TOPSIS, AHP, etc.) to propose novel and powerful MADM methods is a good research direction. Moreover, we will explore more methods for IVq-RDHL information and apply them in modern realistic decision-making situations.

Author Contributions

Conceptualization, X.S.; formal analysis, X.F. and J.W.; funding acquisition, J.W.; methodology, X.S. and X.F.; supervision, J.W.; validation, X.S. and X.F.; writing original draft, X.S. and X.F. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Humanities and Social Science Foundation of the Ministry of Education of China (17YJC870015), First-class Discipline Construction (XK1802-5), and Fundamental Research Funds for the Central Universities (2021YJS067).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All data are included in the manuscript and fully available without restriction.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wu, X.; Song, Y.; Wang, Y. Distance-Based Knowledge Measure for Intuitionistic Fuzzy Sets with Its Application in Decision Making. Entropy 2021, 23, 1119. [Google Scholar] [CrossRef]
  2. Ali, S.; Kousar, M.; Xin, Q.; Pamučar, D.; Hameed, M.S.; Fayyaz, R. Belief and Possibility Belief Interval-Valued N-Soft Set and Their Applications in Multi-Attribute Decision-Making Problems. Entropy 2021, 23, 1498. [Google Scholar] [CrossRef]
  3. Feng, X.; Shang, X.; Wang, J.; Xu, Y. A multiple attribute decision-making method based on interval-valued q-rung dual hesitant fuzzy power Hamy mean and novel score function. Comput. Appl. Math. 2021, 40, 1–32. [Google Scholar] [CrossRef]
  4. Li, L.; Zhang, R.; Wang, J.; Shang, X. Some q-rung orthopair linguistic Heronian mean operators with their application to multi-attribute group decision making. Arch. Control Sci. 2018, 28, 551–583. [Google Scholar]
  5. Li, P.; Ji, Y.; Wu, Z.; Qu, S.-J. A New Multi-Attribute Emergency Decision-Making Algorithm Based on Intuitionistic Fuzzy Cross-Entropy and Comprehensive Grey Correlation Analysis. Entropy 2020, 22, 768. [Google Scholar] [CrossRef]
  6. Kou, Y.; Feng, X.; Wang, J. A Novel q-Rung Dual Hesitant Fuzzy Multi-Attribute Decision-Making Method Based on Entropy Weights. Entropy 2021, 23, 1322. [Google Scholar] [CrossRef] [PubMed]
  7. Xu, Y.; Liu, S.; Wang, J. Multiple attribute group decision-making based on interval-valued q-rung orthopair uncertain linguistic power Muirhead mean operators and linguistic scale functions. PLoS ONE 2021, 16, e0258772. [Google Scholar] [CrossRef]
  8. Wang, J.; Zhang, R.; Zhu, X.; Zhou, Z.; Shang, X.; Li, W. Some q-rung orthopair fuzzy Muirhead means with their application to multi-attribute group decision making. J. Intell. Fuzzy Syst. 2019, 36, 1599–1614. [Google Scholar] [CrossRef]
  9. Ji, C.; Zhang, R.; Wang, J. Probabilistic Dual-Hesitant Pythagorean Fuzzy Sets and Their Application in Multi-attribute Group Decision-Making. Cogn. Comput. 2021, 1–17. [Google Scholar] [CrossRef]
  10. Xia, Y.; Xiong, Z.; Wen, Z.; Lu, H.; Dong, X. Entropy-based risk control of geological disasters in mountain tunnels under un-certain environments. Entropy 2018, 20, 503. [Google Scholar] [CrossRef] [Green Version]
  11. Bonferroni, C. Sulle medie multiple di potenze. Boll. Dell’Unione Mat. Ital. 1950, 5, 267–270. [Google Scholar]
  12. Sykora, S. Mathematical Means and Averages: Generalized Heronian Means 2009. Available online: http://www.ebyte.it/library/docs/math09/Means_Heronian.html (accessed on 1 January 2022).
  13. Liu, P.; Wang, P. Multiple-Attribute Decision-Making Based on Archimedean Bonferroni Operators of q-Rung Orthopair Fuzzy Numbers. IEEE Trans. Fuzzy Syst. 2019, 27, 834–848. [Google Scholar] [CrossRef]
  14. Yu, D.; Lindahl, J.M.; Merigó, J.M. Dual hesitant fuzzy group decision making method and its application to supplier selection. Int. J. Mach. Learn. Cybern. 2015, 7, 819–831. [Google Scholar] [CrossRef]
  15. Xu, Z.; Yager, R.R. Intuitionistic Fuzzy Bonferroni Means. IEEE Trans. Syst. Man Cybern. Part B 2011, 41, 568–578. [Google Scholar] [CrossRef]
  16. Wei, G.; Gao, H.; Wei, Y. Some q-rung orthopair fuzzy Heronian mean operators in multiple attribute decision making. Int. J. Intell. Syst. 2018, 33, 1426–1458. [Google Scholar] [CrossRef]
  17. He, Y.; He, Z.; Wang, G.; Chen, H. Hesitant fuzzy power Bonferroni means and their application to multiple attribute decision making. IEEE Trans. Fuzzy Syst. 2015, 23, 1655–1668. [Google Scholar] [CrossRef]
  18. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern. Part. A Syst. Hum. 2001, 31, 724–731. [Google Scholar] [CrossRef]
  19. Liu, P.; Li, H. Interval-valued intuitionistic fuzzy power Bonferroni aggregation operators and their application to group de-cision making. Cogn Comput. 2017, 9, 494–512. [Google Scholar] [CrossRef]
  20. Wang, L.; Li, N. Pythagorean fuzzy interaction power Bonferroni mean aggregation operators in multiple attribute decision making. Int. J. Intell. Syst. 2020, 35, 150–183. [Google Scholar] [CrossRef]
  21. Liu, P.; Gao, H. Some intuitionistic fuzzy power Bonferroni mean operators in the framework of Dempster–Shafer theory and their application to multicriteria decision making. Appl. Soft Comput. 2019, 85, 105790. [Google Scholar] [CrossRef]
  22. Liu, P.; Liu, X. Multiattribute Group Decision Making Methods Based on Linguistic Intuitionistic Fuzzy Power Bonferroni Mean Operators. Complexty 2017, 2017, 1–15. [Google Scholar] [CrossRef]
  23. Liu, P.; Liu, W. Multiple-attribute group decision-making based on power Bonferroni operators of linguistic q-rung orthopair fuzzy numbers. Int. J. Intell. Syst. 2019, 34, 652–689. [Google Scholar] [CrossRef]
  24. He, Y.; He, Z.; Jin, C.; Chen, H. Intuitionistic fuzzy power geometric Bonferroni means and their application to multiple at-tribute group decision making. Int. J. Uncertain. Fuzz. 2015, 23, 285–315. [Google Scholar] [CrossRef]
  25. Liu, P. Multiple attribute group decision making method based on interval-valued intuitionistic fuzzy power Heronian ag-gregation operators. Comput. Ind. Eng. 2017, 108, 199–212. [Google Scholar] [CrossRef]
  26. Ju, D.; Ju, Y.; Wang, A. Multi-attribute group decision making based on power generalized Heronian mean operator under hesitant fuzzy linguistic environment. Soft Comput. 2019, 23, 3823–3842. [Google Scholar] [CrossRef]
  27. Liu, P.; Mahmood, T.; Khan, Q. Group Decision Making Based on Power Heronian Aggregation Operators Under Linguistic Neutrosophic Environment. Int. J. Fuzzy Syst. 2018, 20, 970–985. [Google Scholar] [CrossRef]
  28. Wang, J.; Wang, P.; Wei, G.; Wei, C.; Wu, J. Some power Heronian mean operators in multiple attribute decision-making based on q-rung orthopair hesitant fuzzy environment. J. Exp. Theor. Artif. Intell. 2020, 32, 909–937. [Google Scholar] [CrossRef]
  29. Liu, P.; Khan, Q.; Mahmood, T. Group decision making based on power Heronian aggregation operators under neutrosophic cubic environment. Soft Comput. 2019, 24, 1971–1997. [Google Scholar] [CrossRef]
  30. Jiang, S.; He, W.; Qin, F.; Cheng, Q. Multiple Attribute Group Decision-Making Based on Power Heronian Aggregation Operators under Interval-Valued Dual Hesitant Fuzzy Environment. Math. Probl. Eng. 2020, 2020, 1–19. [Google Scholar] [CrossRef]
  31. Liu, P.; Khan, Q.; Mahmood, T. Application of Interval Neutrosophic Power Hamy Mean Operators in MAGDM. Informatica 2019, 30, 293–325. [Google Scholar] [CrossRef]
  32. Hara, T.; Uchiyama, M.; Takahasi, S.-E. A refinement of various mean inequalities. J. Inequalities Appl. 1998, 1998, 932025. [Google Scholar] [CrossRef]
  33. Liu, Y.; Li, Y. The Trapezoidal Fuzzy Two-Dimensional Linguistic Power Generalized Hamy Mean Operator and Its Application in Multi-Attribute Decision-Making. Mathematics 2020, 8, 122. [Google Scholar] [CrossRef] [Green Version]
  34. Liu, P.; Xu, H.; Geng, Y. Normal wiggly hesitant fuzzy linguistic power Hamy mean aggregation operators and their application to multi-attribute decision making. Comput. Ind. Eng. 2020, 140, 106224. [Google Scholar] [CrossRef]
  35. Feng, X.; Shang, X.; Xu, Y.; Wang, J. A method to multi-attribute decision-making based on interval-valued q-rung dual hesitant linguistic Maclaurin symmetric mean operators. Complex. Intell. Syst. 2020, 6, 447–468. [Google Scholar] [CrossRef]
  36. Cao, H.; Zhang, R.; Wang, J. Some spherical linguistic Muirhead mean operators with their application to multi-attribute decision making. J. Intell. Fuzzy Syst. 2019, 37, 8097–8111. [Google Scholar] [CrossRef]
  37. Dong, J.; Wang, S. Arithmetic aggregation operators for interval-valued intuitionistic linguistic variables and application to multi-attribute group decision making. Iran J. Fuzzy Syst. 2016, 13, 1–23. [Google Scholar]
  38. Wang, J.; Zhang, R.; Li, L.; Zhu, X.; Shang, X. A novel approach to multi-attribute group decision making based on q-rung orthopair uncertain linguistic information. J. Intell. Fuzzy Syst. 2019, 36, 5565–5581. [Google Scholar] [CrossRef]
  39. Wang, J.; Shang, X.; Feng, X.; Sun, M. A novel multiple attribute decision making method based on q-rung dual hesitant un-certain linguistic sets and Muirhead mean. Arch. Control Sci. 2020, 30, 233–272. [Google Scholar]
  40. Wei, G.; Lin, R.; Wang, H.; Ran, L.G. Interval-valued dual hesitant fuzzy linguistic arithmetic aggregation operators in mul-tiple attribute decision making. Int. Core J. Eng. 2015, 1, 212–222. [Google Scholar]
  41. Li, L.; Zhang, R.; Wang, J.; Zhu, X.; Xing, Y. Pythagorean fuzzy power Muirhead mean operators with their application to multi-attribute decision making. J. Intell. Fuzzy Syst. 2018, 35, 2035–2050. [Google Scholar] [CrossRef]
  42. Liu, Z.; Teng, F.; Liu, P.; Ge, Q. Interval-valued intuitionistic fuzzy power maclaurin symmetric mean aggregation operators and their application to multiple attribute group decision-making. Int. J. Uncertain. Quantif. 2018, 8, 211–232. [Google Scholar] [CrossRef]
  43. Teng, F.; Liu, Z.; Liu, P. Some power Maclaurin symmetric mean aggregation operators based on Pythagorean fuzzy linguistic numbers and their application to group decision making. Int. J. Intell. Syst. 2018, 33, 1949–1985. [Google Scholar] [CrossRef]
  44. Wang, J.; Shang, X.; Bai, K.; Xu, Y. A new approach to cubic q-rung orthopair fuzzy multiple attribute group decision-making based on power Muirhead mean. Neural Comput. Appl. 2020, 32, 14087–14112. [Google Scholar] [CrossRef]
  45. Wang, J.; Tang, F.; Shang, X.; Xu, Y.; Bai, K.; Yan, Y. A novel approach to multi-attribute group decision-making based on q-rung orthopair fuzzy power dual Muirhead mean operators and novel score function. J. Intell. Fuzzy Syst. 2020, 39, 561–580. [Google Scholar] [CrossRef]
  46. Liu, Z.; Xu, H.; Zhao, X.; Liu, P.; Li, J. Multi-Attribute Group Decision Making Based on Intuitionistic Uncertain Linguistic Hamy Mean Operators With Linguistic Scale Functions and Its Application to Health-Care Waste Treatment Technology Selection. IEEE Access 2018, 7, 20–46. [Google Scholar] [CrossRef]
  47. Li, J.; Luo, L.; Wu, X.; Liao, C.; Liao, H.; Shen, W. Prioritizing the elective surgery patient admission in a Chinese public tertiary hospital using the hesitant fuzzy linguistic ORESTE method. Appl. Soft Comput. 2019, 78, 407–419. [Google Scholar] [CrossRef]
  48. Du, Y.; Hou, F.; Zafar, W.; Yu, Q.; Zhai, Y. A novel method for multiattribute decision making with interval-valued pythagorean fuzzy linguistic information. Int. J. Intell Syst. 2017, 32, 1085–1112. [Google Scholar] [CrossRef]
Table 1. The evaluation criteria of patient admission.
Table 1. The evaluation criteria of patient admission.
ParametersBrief Description
Clinical and functional disorders (C1).Clinical and functional disorders are an essential dimension of the indicator system, which describe the severities of patients’ diseases and the degrees of treatment needed in terms of the disease characteristics. It includes disease severity, pain level, etc.
Expected outcomes (C2)Expected outcomes refer to the effectiveness of treatment after hospitalization from the hospital’s point of view. To be precise, before admission, the hospital has the right to evaluate if the patients have expected negative effects after receiving treatment, such as mortality. In this sense, it includes the difficulty of treatment, the complication probability, etc.
Social factors (C3)When considering the admission of patients, we need to maximize social welfare from a moral point of view. In this regard, social factors include resource consumption during waiting periods, limitations in doing activities of daily living and so on.
Patient basic information (C4)The basic information of the patient should be considered in the comprehensive assessment process. For example, when other conditions are the same, patients who wait longer will be given higher priorities for treatment. A patient’s basic information can be described as follows: gender, age, waiting time under the same condition, etc.
Table 2. The interval-valued q-rung dual hesitant linguistic decision matrix D.
Table 2. The interval-valued q-rung dual hesitant linguistic decision matrix D.
A1A2
C1 s 2 , { { [ 0.6 , 0.7 ] , [ 0.5 , 0.8 ] } , { [ 0.3 , 0.4 ] , [ 0.4 , 0.5 ] } } s 2 , { { [ 0.7 , 0.8 ] , [ 0.8 , 0.9 ] } , { [ 0.2 , 0.3 ] , [ 0.2 , 0.5 ] } }
C2 s 1 , { { [ 0.6 , 0.7 ] } , { [ 0.1 , 0.4 ] , [ 0.3 , 0.5 ] } } s 3 { [ 0.4 , 0.6 ] , [ 0.6 , 0.7 ] } , { [ 0.1 , 0.3 ] , [ 0.3 , 0.4 ] }
C3 s 3 , { { [ 0.5 , 0.6 ] , [ 0.6 , 0.9 ] } , { [ 0.2 , 0.5 ] , [ 0.4 , 0.6 ] } } s 4 , { [ 0.6 , 0.8 ] } , { [ 0.2 , 0.4 ] , [ 0.3 , 0.4 ] }
C4 s 4 , { { [ 0.4 , 0.6 ] , [ 0.7 , 0.8 ] } , { [ 0.1 , 0.2 ] } } s 5 , { [ 0.5 , 0.6 ] , [ 0.7 , 0.9 ] } , { [ 0.1 , 0.2 ] , [ 0.3 , 0.6 ] }
A3A4
C1 s 2 , { { [ 0.5 , 0.6 ] } , { [ 0.5 , 0.7 ] , [ 0.6 , 0.7 ] } } s 3 , { { [ 0.3 , 0.6 ] , [ 0.5 , 0.8 ] } , { [ 0.4 , 0.6 ] , [ 0.5 , 0.6 ] } }
C2 s 3 , { { [ 0.4 , 0.5 ] , [ 0.5 , 0.6 ] } , { [ 0.4 , 0.5 ] , [ 0.5 , .0.7 ] } } s 2 , { { [ 0.3 , 0.5 ] , [ 0.5 , 0.7 ] } , { [ 0.4 , 0.6 ] , [ 0.6 , 0.7 ] } }
C3 s 1 , { { [ 0.4 , 0.6 ] , [ 0.6 , 0.7 ] } , { [ 0.2 , 0.4 ] , [ 0.3 , 0.6 ] } } s 4 , { { [ 0.3 , 0.5 ] } , { [ 0.6 , 0.8 ] , [ 0.8 , 0.9 ] } }
C4 s 5 , { { [ 0.6 , 0.8 ] , [ 0.7 , 0.8 ] } , { [ 0.4 , 0.6 ] , [ 0.5 , 0.6 ] } } s 1 , { { [ 0.1 , 0.3 ] , [ 0.2 , 0.4 ] } , { [ 0.6 , 0.8 ] , [ 0.7 , 0.8 ] } }
Table 3. Score values of alternatives A i ( i = 1 , 2 , 3 , 4 ) when q [ 1 , 5 ] based on IVq-RDHLPWHM operator (k = 2).
Table 3. Score values of alternatives A i ( i = 1 , 2 , 3 , 4 ) when q [ 1 , 5 ] based on IVq-RDHLPWHM operator (k = 2).
q Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
q = 1 S ( d 1 ) = 0.0281 ; S ( d 2 ) = 0.0508 ; S ( d 3 ) = 0.0241 ; S ( d 4 ) = 0.0139 A 2 > A 1 > A 3 > A 4
q = 2 S ( d 1 ) = 0.0330 ; S ( d 2 ) = 0.0594 ; S ( d 3 ) = 0.0263 ; S ( d 4 ) = 0.0145 A 2 > A 1 > A 3 > A 4
q = 3 S ( d 1 ) = 0.0381 ; S ( d 2 ) = 0.0677 ; S ( d 3 ) = 0.0307 ; S ( d 4 ) = 0.0176 A 2 > A 1 > A 3 > A 4
q = 4 S ( d 1 ) = 0.0424 ; S ( d 2 ) = 0.0745 ; S ( d 3 ) = 0.0354 ; S ( d 4 ) = 0.0211 A 2 > A 1 > A 3 > A 4
q = 5 S ( d 1 ) = 0.0458 ; S ( d 2 ) = 0.0797 ; S ( d 3 ) = 0.0398 ; S ( d 4 ) = 0.0246 A 2 > A 1 > A 3 > A 4
Table 4. Score values and ranking results of Example 3 with different values of k in the IVq-RDHLPWHM operator (q = 4).
Table 4. Score values and ranking results of Example 3 with different values of k in the IVq-RDHLPWHM operator (q = 4).
k Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
k = 1 S ( d 1 ) = 0.0480 ;   S ( d 2 ) = 0.0827 ;   S ( d 3 ) = 0.0440 ;   S ( d 4 ) = 0.0276 A 2 > A 1 > A 3 > A 4
k = 2 S ( d 1 ) = 0.0424 ;   S ( d 2 ) = 0.0745 ;   S ( d 3 ) = 0.0354 ;   S ( d 4 ) = 0.0211 A 2 > A 1 > A 3 > A 4
k = 3 S ( d 1 ) = 0.0404 ;   S ( d 2 ) = 0.0717 ;   S ( d 3 ) = 0.0323 ;   S ( d 4 ) = 0.0188 A 2 > A 1 > A 3 > A 4
k = 4 S ( d 1 ) = 0.2044 ;   S ( d 2 ) = 0.2408 ;   S ( d 3 ) = 0.1821 ;   S ( d 4 ) = 0.0927 A 2 > A 1 > A 3 > A 4
Table 5. Score functions and ranking orders by different LSFs (q = 4, k = 2).
Table 5. Score functions and ranking orders by different LSFs (q = 4, k = 2).
Parameters Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
Our method based on LSF1 (t = 3) S ( d 1 ) = 0.0424 ;   S ( d 2 ) = 0.0745 ;
S ( d 3 ) = 0.0354 ;   S ( d 4 ) = 0.0211 .
A 2 > A 1 > A 3 > A 4
Our   method   based   on   LSF 1   ( t = 3 ,   ρ = 1.6 ) S ( d 1 ) = 0.0277 ;   S ( d 2 ) = 0.0442 ;
S ( d 3 ) = 0.0226 ;   S ( d 4 ) = 0.0137 .
A 2 > A 1 > A 3 > A 4
Our   method   based   on   LSF 1   ( t = 3 ,   ε = β = 0.5 ) S ( d 1 ) = 0.0670 ;   S ( d 2 ) = 0.1262 ;
S ( d 3 ) = 0.0553 ;   S ( d 4 ) = 0.0339 .
A 2 > A 1 > A 3 > A 4
Table 6. Score functions and ranking orders by different methods.
Table 6. Score functions and ranking orders by different methods.
Methods Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
Feng et al.’s [35] method based on IVq-RDHLWMSM operator (k = 1) S ( d 1 ) = 1.1187 ;   S ( d 2 ) = 1.2410 ;
S ( d 3 ) = 1.0981 ;   S ( d 4 ) = 1.0135
A 2 > A 1 > A 3 > A 4
Feng et al.’s [35] method based on IVq-RDHLWMSM operator (k = 2) S ( d 1 ) = 0.8789 ;   S ( d 2 ) = 1.1015 ;
S ( d 3 ) = 0.8146 ;   S ( d 4 ) = 0.6472
A 2 > A 1 > A 3 > A 4
Feng et al.’s [35] method based on IVq-RDHLWMSM operator (k = 3) S ( d 1 ) = 0.4962 ;   S ( d 2 ) = 0.6929 ;
S ( d 3 ) = 0.4163 ;   S ( d 4 ) = 0.2843
A 2 > A 1 > A 3 > A 4
Feng et al.’s [35] method based on IVq-RDHLWMSM operator (k = 4) S ( d 1 ) = 0.1901 ;   S ( d 2 ) = 0.3002 ;
S ( d 3 ) = 0.1426 ;   S ( d 4 ) = 0.0863
A 2 > A 1 > A 3 > A 4
Our method based on LSF1(t = 3, k = 2, q = 4) S ( d 1 ) = 0.0424 ;   S ( d 2 ) = 0.0742 ;
S ( d 3 ) = 0.0346 ;   S ( d 4 ) = 0.0212 .
A 2 > A 1 > A 3 > A 4
Our   method   based   on   LSF 2 ( t = 3 ,   ρ = 1.2 ) S ( d 1 ) = 0.0358 ;   S ( d 2 ) = 0.0611 ;
S ( d 3 ) = 0.0297 ;   S ( d 4 ) = 0.0178 .
A 2 > A 1 > A 3 > A 4
Our   method   based   on   LSF 3 ( t = 3 ,   ε = 0.3 , β = 0.6 ) S ( d 1 ) = 0.0840 ;   S ( d 2 ) = 0.1518 ;
S ( d 3 ) = 0.0695 ;   S ( d 4 ) = 0.0427 .
A 2 > A 1 > A 3 > A 4
Table 7. The results of Example 4 calculated by different methods.
Table 7. The results of Example 4 calculated by different methods.
Methods Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
Du et al.’s [48] method based on IVPFLWA operator S ( d 1 ) = 1.5450 ;   S ( d 2 ) = 2.0000 ;
S ( d 3 ) = 2.2425 ;   S ( d 4 ) = 1.9920
A 3 > A 4 > A 2 > A 1
Our method based on LSF1 (t = 3, k = 2, q = 4) S ( d 1 ) = 0.0442 ;   S ( d 2 ) = 0.0627 ;
S ( d 3 ) = 0.0822 ;   S ( d 4 ) = 0.0766 .
A 3 > A 4 > A 2 > A 1
Table 8. The final results of Example 4 by the proposed methods (k = 2, q = 4).
Table 8. The final results of Example 4 by the proposed methods (k = 2, q = 4).
Parameters Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
Our methos based on LSF1 (t = 3) S ( d 1 ) = 0.0442 ;   S ( d 2 ) = 0.0627 ;
S ( d 3 ) = 0.0908 ;   S ( d 4 ) = 0.0721 .
A 3 > A 4 > A 2 > A 1
Our   methos   based   on   LSF 2   ( t = 3 ,   ρ = 1.6 ) S ( d 1 ) = 0.0265 ;   S ( d 2 ) = 0.0339 ;
S ( d 3 ) = 0.0506 ;   S ( d 4 ) = 0.0408 .
A 3 > A 4 > A 2 > A 1
Our   methos   based   on   LSF 3   ( t = 3 ,   ε = 0.6 ; β = 0.4 ) S ( d 1 ) = 0.0711 ;   S ( d 2 ) = 0.1136 ;
S ( d 3 ) = 0.1443 ;   S ( d 4 ) = 0.1191 .
A 3 > A 4 > A 2 > A 1
Table 9. Score values and ranking results of Example 4 with different values of k in the IVq-RDHLPWHM operator (q = 4).
Table 9. Score values and ranking results of Example 4 with different values of k in the IVq-RDHLPWHM operator (q = 4).
k Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
k = 1 S ( d 1 ) = 0.0462 ;   S ( d 2 ) = 0.0658 ;   S ( d 3 ) = 0.0956 ;   S ( d 4 ) = 0.0791 A 3 > A 4 > A 2 > A 1
k = 2 S ( d 1 ) = 0.0442 ;   S ( d 2 ) = 0.0627 ;   S ( d 3 ) = 0.0908 ;   S ( d 4 ) = 0.0721 A 3 > A 4 > A 2 > A 1
k = 3 S ( d 1 ) = 0.0435 ;   S ( d 2 ) = 0.0617 ;   S ( d 3 ) = 0.0892 ;   S ( d 4 ) = 0.0698 A 3 > A 4 > A 2 > A 1
k = 4 S ( d 1 ) = 0.2093 ;   S ( d 2 ) = 0.2439 ;   S ( d 3 ) = 0.2712 ;   S ( d 4 ) = 0.2278 A 3 > A 4 > A 2 > A 1
Table 10. The final results of Example 5 by different methods.
Table 10. The final results of Example 5 by different methods.
Methods Score   Values   S ( d i ) ( i = 1 , 2 , 3 , 4 ) Ranking Orders
Du et al.’s [48] method based on IVPFLWA operatorCannot be calculated-
Our method based on LSF1 (t = 3, k = 2, q = 4) S ( d 1 ) = 0.0442 ;   S ( d 2 ) = 0.0627 ;
S ( d 3 ) = 0.0934 ;   S ( d 4 ) = 0.0721 .
A 3 > A 4 > A 2 > A 1
Table 11. Characteristics of different MADM methods.
Table 11. Characteristics of different MADM methods.
Feng et al.’s [35] Method Based on IVq-RDHLWMSM OperatorDu et al.’s [48] Method Based on the IVPFLWA OperatorOur Method Based on the IVq-RDHLPWHM Operator
Allow the sum of MG and NMG to be greater than oneYesYesYes
Allow the different semantic gap between adjacent LTsNoNoYes
Consider the relationship among multiple attributes YesNoYes
Reduce the adverse influence of unreasonable evaluation valuesNoNoYes
The degree of flexibility and robustness of the operational rulesLowLowHigh
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shang, X.; Feng, X.; Wang, J. A Novel Interval-Valued q-Rung Dual Hesitant Linguistic Multi-Attribute Decision-Making Method Based on Linguistic Scale Functions and Power Hamy Mean. Entropy 2022, 24, 166. https://doi.org/10.3390/e24020166

AMA Style

Shang X, Feng X, Wang J. A Novel Interval-Valued q-Rung Dual Hesitant Linguistic Multi-Attribute Decision-Making Method Based on Linguistic Scale Functions and Power Hamy Mean. Entropy. 2022; 24(2):166. https://doi.org/10.3390/e24020166

Chicago/Turabian Style

Shang, Xiaopu, Xue Feng, and Jun Wang. 2022. "A Novel Interval-Valued q-Rung Dual Hesitant Linguistic Multi-Attribute Decision-Making Method Based on Linguistic Scale Functions and Power Hamy Mean" Entropy 24, no. 2: 166. https://doi.org/10.3390/e24020166

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