Next Article in Journal
Dynamic Modeling and Vibration Characteristics Analysis of Transmission Process for Dual-Motor Coupling Drive System
Next Article in Special Issue
A Symmetric Banzhaf Cooperation Value for Games with a Proximity Relation among the Agents
Previous Article in Journal
Special Issue of Symmetry: “Integral Transformations, Operational Calculus and Their Applications”
Previous Article in Special Issue
The Linguistic Interval-Valued Intuitionistic Fuzzy Aggregation Operators Based on Extended Hamacher T-Norm and S-Norm and Their Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Linguistic Picture Fuzzy Set and Its Application in Multi-Criteria Decision-Making: An Illustration to the TOPSIS and TODIM Methods Based on Entropy Weight

1
Department of Statistics, Hunan University of Science and Technology, Xiangtan 411201, China
2
Department of Mathematics and Statistics, Central South University, Changsha 410083, China
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(7), 1170; https://doi.org/10.3390/sym12071170
Submission received: 8 June 2020 / Revised: 8 July 2020 / Accepted: 9 July 2020 / Published: 14 July 2020

Abstract

:
The paper considers the multi-criteria decision-making problem based on linguistic picture fuzzy information. Firstly, we propose the concept of linguistic picture fuzzy set(LPFS), where the positive-membership, the neutral-membership and the negative-membership are represented by linguistic variables, and its operation rules are also discussed. The linguistic picture fuzzy weighted averaging (LPFWA) operator and linguistic picture fuzzy weighted geometric (LPFWG) operator are developed based on the proposed operation rules. Secondly, we propose the generalized weighted distance measure, the generalized weighted Hausdorff distance measure, and the generalized hybrid weighted distance measure between LPFSs and discuss their properties. Thirdly, we extend the technique for order of preference by similarity to the ideal solution (TOPSIS) method and the TODIM (an acronym in Portuguese of interactive and multi-criteria decision-making) method to the proposed distance measure, and the linguistic picture fuzzy entropy method is proposed to calculate the weights of the criteria. Finally, an illustrative example is given to verify the feasibility and effectiveness of the proposed methods, the comparative analysis with other existing methods and sensitivity analysis of the proposed methods are also discussed.

1. Introduction

In 1965, Zadeh [1] proposed the fuzzy set (FS) F = { ( x , μ F ( x ) ) | x X } , where μ F ( x ) represents the membership degree of x X to the set F. Since it was put forward, it was extended in many aspects. One of the generalizations of FS is intuitionistic fuzzy set (IFS), which was introduced by Atanassov [2] by adding the non-membership degree to the FS. The IFS was defined as E = { ( x , μ E ( x ) , v E ( x ) ) | x X } , where μ E ( x ) and v E ( x ) represent the the membership degree and the non-membership degree of x X to the set E. Although the IFS has been successfully applied in many fields, they cannot represent all decision information. For example, the voters are divided into four groups of those who: vote for, abstain, vote against, and refusal of the voting, which cannot be expressed by the FS and the IFS. In order to express such information, Cuong [3] proposed the concept of picture fuzzy set (PFS) P = { ( x , μ P ( x ) , η P ( x ) , v P ( x ) ) | x X } , where μ P ( x ) , η P ( x ) and v P ( x ) represent the positive membership degree, the neutral membership degree, and the negative membership degree of x X to the set P, respectively. The PFS is suitable to represent the decision information involving more answers: yes, abstain, no, refusal. Comparing with IFS, the hesitancy degree of PFS is dividend into two parts: neutral degree and refusal degree.
In traditional multi-criteria decision-making problems, the decision makers use numerical values to evaluate the alternatives. However, in many practical decision-making problems, due to the complexity of the decision-making environment, the decision makers may prefer to use linguistic variables [4,5,6] to represent evaluation information, which is more aligned to human being’s cognition. Since the introduction of linguistic variable, the linguistic term set (LTS) and its extension have been studied and applied to many fields [7,8,9,10,11,12,13,14,15,16,17]. For example, Chen et al. [12] proposed the concept of linguistic intuitionistic fuzzy set (LIFS) where the membership degree and the non-membership degree are represented by linguistic terms. However, the LIFS has some limitations in representing the decision maker’s opinions in qualitative evaluation involving more answers: yes, abstain, no, refusal. Although some scholars have studied the picture linguistic term set [13,14,15], but its positive membership, neutral membership, and negative membership represent the element of X to a certain linguistic term, they are expressed by numerical values. In some situations, the evaluation is suitable to be represented by linguistic terms.
The linguistic picture fuzzy set has effective reliability to demonstrate the questionable and probable datum which emerge in real decision-making problems. The motivations and goals of the paper are given as follows: (1) Introduce the concept of linguistic picture fuzzy set; (2) Put forward some new operational laws for linguistic picture fuzzy set and discuss their properties; (3) Propose the linguistic picture fuzzy weighted average operator and the linguistic picture fuzzy weighted geometric average operator; and (4) Establish the multi-criteria decision-making method on the basis of the TODIM method and TOPSIS method under linguistic picture fuzzy environment, which can deal with uncertainty information effectively.

2. Literature Review

2.1. Application of Picture Fuzzy Set in Decision-Making Methods

PFS has more degrees of freedom to express the uncertain information in practical decision-making problems, which is more realistic and computational driven. Recently, many scholars applied the PFS to multi-criteria decision-making problems. Wei [18] proposed the picture fuzzy cross entropy and utilized it to rank the alternatives in real decision-making problems. Furthermore, Wei [19] introduced the operations of PFSs and proposed picture 2-tuple Bonferroni mean operator according to the proposed operations. Considering the sum of degrees of PFSs in [19] exceeds 1, Wang [20] proposed some new operations of PFSs and applied them into multi-criteria decision-making problems. Wang [21] constructed a multi-criteria decision-making framework for risk evaluation of construction project with picture fuzzy information. For many other applications of PFS in decision-making methods, we can refer to [22,23,24,25,26].
On the other hand, we know that the distance measure can describe the difference between FSs, which is an important aspect in multi-criteria decision-making problems. Many distance measures between FSs have been proposed in the past few years. The common distance measures are the Hamming distance measure, the the Euclidean distance measure, generalized distance measure, and the Hausdorff distance measure [27,28,29,30,31]. These distance measures are widely used with TOPSIS method, TODIM method, et al.

2.2. An Overview of the TOPSIS Method with the Recent Development

As we know, the TOPSIS method is an important multi-criteria decision-making method proposed by Hwang and Yoon [32], which select the best alternative based on its closest distance to the positive ideal solution and the farthest distance to the negative ideal solution. In recent years, many scholars have carried out extensive research on it. For example, Sajjad et al. [33] developed the TOPSIS method to interval-valued Pythagorean fuzzy set. Liu et al. [34] introduced the concept of Fermatean fuzzy linguistic term sets based on linguistic scale function and extended the TOPSIS method to the proposed Fermatean fuzzy linguistic term sets. Furthermore, Chen et al. [35] proposed the proportional interval type-2 hesitant fuzzy set based on Hamacher aggregation operators and extended the TOPSIS method to its fuzzy decision environment. The TOPSIS is a ranking method based on the concept of compromised solution. In realistic decision-making problems with a TOPSIS method, an important step is how to balance the separations of an alternative from the positive ideal solution and the negative ideal solution.
The TOPSIS method is not only reasonable but also implicitly considered the relative importance of the alternative to positive ideal solution and negative ideal solution.

2.3. An Overview of the TODIM Method with the Recent Development

The TODIM method was proposed by Gomes and Lima [36] based on the prospect theory, which considered the behavior of decision makers. Many scholars have studied the TODIM decision-making methods. For example, Gomes and Rangel [37] defined a reference value for the rents by the TODIM method of multi-criteria decision aiding. Zhang and Xu [38] developed the TODIM method to hesitant fuzzy environment based on the decision maker’s psychological behavior. Furthermore, Ji et al. [39] introduced a projection-based TODIM method under neurotrophic environments and applied it to personnel selection. Liu et al. [40] extended the TODIM method to the distance measure under Fermatean fuzzy linguistic environment. According to the existing studies about the TODIM methods, we know that the TODIM method is an acronym in Portuguese of interactive and multi-criteria decision-making, which considers the behavior of decision makers. The advantage of TODIM method is the potential value of gains and losses can be used to reflect risk preferences.
In general, this paper developed the TOPSIS method and TODIM method to the proposed LPFSs. There are several contributions of the paper, which are given as follows:
(1)
We give the concept of LPFS and define the operation rules between LPFSs, which have more advantages to deal with the uncertainty in multi-criteria decision-making problems.
(2)
We propose the linguistic picture fuzzy weighted averaging operator, the linguistic picture fuzzy weighted geometric operator, and the hybrid distance measures between LPFSs.
(3)
We define the linguistic picture fuzzy entropy to calculate the objective weights of the criteria in multi-criteria decision-making problems, then we develop the TOPSIS method and TODIM method with linguistic picture fuzzy entropy to the proposed distance measures.
The rest of the paper is organized as follows: In Section 2, we briefly review some basic concepts and operation laws about IFS, PFS, and LTS. In Section 3, we first give the definition of LPFS and define its basic operation rules, then the LPFWA operator and the LPFWG operator are developed. In Section 4, we propose the generalized weighted distance measure, the generalized weighted Hausdorff distance measure and the generalized hybrid weighted distance measure between LPFSs and discuss their properties. In Section 5, we extend the TOPSIS and TODIM method to the proposed distance measure, and the corresponding decision-making methods are established based on entropy weight to deal with the multi-criteria decision-making problems. In Section 6, an illustrative example is given to verify the feasibility and effectiveness of the proposed methods, the comparative analysis with other existing methods and sensitivity analysis of the proposed methods are also discussed. Finally, the conclusions and future studies are given in Section 7.

3. Preliminaries

In this section, we review some basic concepts and operations related to IFS, PFS, and LTS. Throughout the paper, let X = { x 1 , x 2 , , x n } be a finite and discrete set.

3.1. Intuitionistic Fuzzy Set

Definition 1.
[2] Let X be a fixed set, and an IFS E is defined as follows:
E = { ( x , μ E ( x ) , v E ( x ) ) | x X } ,
where μ E ( x ) ( 0 μ E ( x ) 1 ) and v E ( x ) ( 0 v E ( x ) 1 ) represent the membership degree and the non-membership degree of x X to the set E, respectively, and they satisfy the condition: 0 μ E ( x ) + v E ( x ) 1 for any x X . π E ( x ) = 1 μ E ( x ) v E ( x ) is the hesitant degree of x X to the set E.

3.2. Picture Fuzzy Set

Definition 2.
[3] Let X be a fixed set, and a PFS P is defined as follows:
P = { ( x , μ p ( x ) , η p ( x ) , v p ( x ) ) | x X } ,
where μ P ( x ) ( 0 μ P ( x ) 1 ) , η P ( x ) ( 0 η P ( x ) 1 ) and v P ( x ) ( 0 v P ( x ) 1 ) represent the positive membership degree, the neutral membership degree, and the negative membership degree of x X to the set P, respectively, and they satisfy with the follow condition: 0 μ P ( x ) + η P ( x ) + v P ( x ) 1 for any x X . The refusal membership degree ξ P ( x ) = 1 μ P ( x ) η P ( x ) v P ( x ) .
The PFS is a generalization of FS and IFS. If the set X has only one element, the PFS is reduced to P = ( μ P , η P , v P ) , we call it a picture fuzzy number (PFN).
Definition 3.
[3] Letting P 1 = { ( x , μ P 1 ( x ) , η P 1 ( x ) , v P 1 ( x ) ) | x X } and P 2 = { ( x , μ P 2 ( x ) , η P 2 ( x ) , v P 2 ( x ) ) | x X } be any two PFSs on X, the consequent operations of PFSs are given as follows:
(1) 
P 1 P 2 iff x X , μ P 1 ( x ) μ P 2 ( x ) , η P 1 ( x ) η P 2 ( x ) and v P 1 ( x ) v P 2 ( x ) ;
(2) 
P 1 = P 2 iff P 1 P 2 and P 2 P 1 ;
(3) 
P 1 P 2 = { ( x , max ( μ P 1 ( x ) , μ P 2 ( x ) ) , min ( η P 1 ( x ) , η P 2 ( x ) ) , min ( v P 1 ( x ) , v P 2 ( x ) ) ) | x X } ;
(4) 
P 1 P 2 = { ( x , min ( μ P 1 ( x ) , μ P 2 ( x ) ) , max ( η P 1 ( x ) , η P 2 ( x ) ) , max ( v P 1 ( x ) , v P 2 ( x ) ) ) | x X } ;
(5) 
P 1 ¯ = { ( x , v P 1 ( x ) , η P 1 ( x ) , μ P 1 ( x ) ) | x X } .
Definition 4.
[23] Letting P 1 = { ( x , μ P 1 ( x ) , η P 1 ( x ) , v P 1 ( x ) ) | x X } and P 2 = { ( x , μ P 2 ( x ) , η P 2 ( x ) , v P 2 ( x ) ) | x X } be any two PFSs on X, λ > 0 , the operations of PFSs are defined as follows:
(1) 
P 1 P 2 = ( μ P 1 ( x ) + μ P 2 ( x ) μ P 1 ( x ) μ P 2 ( x ) , η P 1 ( x ) η P 2 ( x ) , v P 1 ( x ) v P 2 ( x ) ) ;
(2) 
P 1 P 2 = ( μ P 1 ( x ) μ P 2 ( x ) , η P 1 ( x ) + η P 2 ( x ) η P 1 ( x ) η P 2 ( x ) , v P 1 ( x ) + v P 2 ( x ) v P 1 ( x ) v P 2 ( x ) ) ;
(3) 
λ P 1 = ( 1 ( 1 μ P 1 ( x ) ) λ , ( η P 1 ( x ) ) λ , ( v P 1 ( x ) ) λ ) ;
(4) 
P 1 λ = ( ( μ P 1 ( x ) ) λ , 1 ( 1 η P 1 ( x ) ) λ , 1 ( 1 v P 1 ( x ) ) λ ) .
Definition 5.
[26] Letting P = ( μ P , η P , v P ) be a PFN, the score function S ( P ) and the accuracy function H ( P ) can be defined as follows:
S ( P ) = μ P v P , S ( P ) [ 1 , 1 ] , H ( P ) = μ P + η P + v P , H ( P ) [ 0 , 1 ] .
Definition 6.
[26] For any two PFNs P 1 = ( μ P 1 , η P 1 , v P 1 ) and P 2 = ( μ P 2 , η P 2 , v P 2 ) , S ( P 1 ) and S ( P 2 ) are the score functions of P 1 and P 2 , H ( P 1 ) and H ( P 2 ) are the accuracy functions of P 1 and P 2 , the comparison rules of P 1 and P 2 are given as follows:
(1) 
If S ( P 1 ) < S ( P 2 ) , then P 1 P 2 ;
(2) 
If S ( P 1 ) > S ( P 2 ) , then P 1 P 2 ;
(3) 
If S ( P 1 ) = S ( P 2 ) , then
(a) 
if H ( P 1 ) < H ( P 2 ) , then P 1 P 2 ;
(b) 
if H ( P 1 ) = H ( P 2 ) , then P 1 P 2 .

3.3. Linguistic Term Set

Definition 7.
[4] Let S = { s i | i = 0 , 1 , , 2 τ } be a finite discrete linguistic term set, which satisfies the following properties:
(1) 
The set S is ordered: s i s j if i j ;
(2) 
Negation operator: n e g ( s i ) = s j where j = 2 τ i ;
(3) 
Maximization operator: M a x ( s i , s j ) = s i if s i s j ;
(4) 
Minimization operator: M i n ( s i , s j ) = s j if s i s j .
In order to describe the linguistic evaluation information accurately in multi-attribute decision-making problems, Xu [41] extended the discrete linguistic term set S to the continuous linguistic term set S ¯ [ 0 , 2 τ ] = { s i | i [ 0 , 2 τ ] } .

4. Linguistic Picture Fuzzy Set

In this section, we first propose the LPFS and its operational rules. The score function and accuracy function of LPFS are described, which play an important role in comparing linguistic picture fuzzy numbers. Then, we propose the LPFWA operator and the LPFWG operator, and their properties are also given. Furthermore, we propose the hybrid distance measure for LPFSs and discuss its properties.

4.1. Linguistic Picture Fuzzy Set and Its Operations

Definition 8.
Letting X = { x 1 , x 2 , , x n } be a fixed set, the LPFS κ is defined as
κ = { ( x i , s α ( x i ) , s β ( x i ) , s θ ( x i ) ) | x i X } ,
where s α ( x i ) , s β ( x i ) , s θ ( x i ) represent the linguistic positive membership degree, the linguistic neutral membership degree, and the linguistic negative membership degree of x i X to the set κ, respectively. For any x i X , the conditions s α ( x i ) , s β ( x i ) , s θ ( x i ) S [ 0 , 2 τ ] and 0 α + β + θ 2 τ are always established. The linguistic refusal membership degree is s 2 τ α β θ ( x i ) . If the set X has only one element, we call κ = ( s α , s β , s θ ) as a linguistic picture fuzzy number (LPFN).
Definition 9.
Let κ = ( s α , s β , s θ ) be a LPFN, and the score function L S ( κ ) is defined as follows:
L S ( κ ) = α θ ,
and the accuracy function L H ( κ ) can be given as:
L H ( κ ) = α + β + θ .
Based on the proposed score function and accuracy function, the comparison rule between two LPFNs κ 1 and κ 2 is given as follows:
(1)
If L S ( κ 1 ) > L S ( κ 2 ) , then κ 1 κ 2 ;
(2)
If L S ( κ 1 ) = L S ( κ 2 ) , then
(a)
if L H ( κ 1 ) > L H ( κ 2 ) , then κ 1 κ 2 ;
(b)
if L H ( κ 1 ) = L H ( κ 2 ) , then κ 1 κ 2 .
Example 1.
Letting κ 1 = ( s 2 , s 1 , s 3 ) , κ 2 = ( s 4 , s 1 , s 2 ) and κ 3 = ( s 1 , s 1 , s 2 ) be three LPFNs defined on S [ 0 , 2 τ ] = S [ 0 , 8 ] , according to (1), we can get L S ( κ 1 ) = 1 , L S ( κ 2 ) = 2 and L S ( κ 3 ) = 1 . In order to compare with these LPFNs, we should continue calculating the score function of κ 1 and κ 3 . According to (2), we can get L H ( κ 1 ) = 6 and L H ( κ 3 ) = 4 . Thus, κ 2 κ 1 κ 3 is obtained based on Definition 9.

4.2. Some Operation Rules and Properties of Linguistic Picture Fuzzy Numbers

Based on the operations of picture fuzzy numbers, we introduce the operation rules of LPFNs as follows.
Definition 10.
Let κ 1 = ( s α 1 , s β 1 , s θ 1 ) and κ 2 = ( s α 2 , s β 2 , s θ 2 ) be two LPFNs, the operation rules between κ 1 and κ 2 are defined as follows:
(1) 
κ 1 κ 2 = ( s α 1 + α 2 α 1 α 2 2 τ , s β 1 β 2 2 τ , s θ 1 θ 2 2 τ ) ;
(2) 
κ 1 κ 2 = ( s α 1 α 2 2 τ , s β 1 + β 2 β 1 β 2 2 τ , s θ 1 + θ 2 θ 1 θ 2 2 τ ) ;
(3) 
λ κ 1 = ( s 2 τ 2 τ ( 1 α 1 2 τ ) λ , s 2 τ ( β 1 2 τ ) λ , s 2 τ ( θ 1 2 τ ) λ ) ;
(4) 
κ 1 λ = ( s 2 τ ( α 1 2 τ ) λ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ , s 2 τ 2 τ ( 1 θ 1 2 τ ) λ ) ;
(5) 
κ 1 κ 2 iff α 1 α 2 , β 1 β 2 and θ 1 θ 2 ;
(6) 
κ ¯ 1 = ( s θ 1 , s β 1 , s α 1 ) .
Example 2.
Let λ = 2 , κ 1 = ( s 2 , s 1 , s 4 ) and κ 2 = ( s 3 , s 2 , s 2 ) be two LPFNs defined on S [ 0 , 2 τ ] = S [ 0 , 8 ] , the operational rules can be shown as follows:
(1) 
κ 1 κ 2 = ( s 2 + 3 2 × 3 8 , s 1 × 2 8 , s 4 × 2 8 ) = ( s 4.25 , s 0.25 , s 1 ) ;
(2) 
κ 1 κ 2 = ( s 2 × 3 8 , s 1 + 2 1 × 2 8 , s 4 + 2 4 × 2 8 ) = ( s 0.75 , s 2.75 , s 5 ) ;
(3) 
2 κ 1 = ( s 8 8 ( 1 2 8 ) 2 , s 8 ( 1 8 ) 2 , s 8 ( 4 8 ) 2 ) = ( s 3.5 , s 0.125 , s 2 ) ;
(4) 
κ 1 2 = ( s 8 ( 2 8 ) 2 , s 8 8 ( 1 1 8 ) 2 , s 8 8 ( 1 4 8 ) 2 ) = ( s 0.5 , s 1.875 , s 6 ) ;
(5) 
Because 2 = α 1 < α 2 = 3 , 1 = β 1 < β 2 = 2 , 4 = θ 1 > θ 2 = 2 , it is easy to have κ 1 κ 2 .

4.3. Linguistic Picture Fuzzy Aggregation Operators

In this subsection, we develop the LPFWA operator and the LPFWG operator based on the operation rules defined in Definition 10, their properties are also discussed.
Definition 11.
Letting κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of LPFNs defined on S [ 0 , 2 τ ] and ω = ( ω 1 , ω 2 , , ω n ) be the weighted vector of κ j ( j = 1 , 2 , , n ) , satisfying with j = 1 n ω j = 1 ( 0 ω j 1 ), then the LPFWA operator is defined as follows:
L P F W A ( κ 1 , κ 2 , , κ n ) = j = 1 n ( ω j κ j ) .
Definition 12.
Letting κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of LPFNs defined on S [ 0 , 2 τ ] and ω = ( ω 1 , ω 2 , , ω n ) be the weighted vector of κ j ( j = 1 , 2 , , n ) , satisfying with j = 1 n ω j = 1 ( 0 ω j 1 ), the LPFWG operator is defined as follows:
L P F W G ( κ 1 , κ 2 , , κ n ) = j = 1 n ( κ j ω j ) .

5. The Distance Measures between Linguistic Picture Fuzzy Sets

In this section, we first develop the generalized weighted distance measure and the generalized weighted Hausdorff distance measure between LPFSs, respectively, then combing the proposed two distance measures, we define a generalized hybrid weighted distance measure between LPFSs.
Definition 13.
Letting A = { ( s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) ) | x j X } and B = { ( s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) ) | x j X } be two LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B ) , the generalized weighted distance measure between LPFSs is defined as follows:
d 1 w ( A , B ) = 1 2 j = 1 n ω j α A ( x j ) α B ( x j ) 2 τ λ + β A ( x j ) β B ( x j ) 2 τ λ + θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ > 0 , ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ).
Definition 14.
Let A = { ( s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) ) | x j X } and B = { ( s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) ) | x j X } be two LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B ) , the generalized weighted Hausdorff distance measure between LPFSs is defined as follows:
d 1 W H ( A , B ) = j = 1 n ω j max α A ( x j ) α B ( x j ) 2 τ λ , β A ( x j ) β B ( x j ) 2 τ λ , θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ 1 , ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
Definition 15.
Let A = { ( s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) ) | x j X } and B = { ( s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) ) | x j X } be two LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B ) , the generalized hybrid weighted distance measure between LPFSs is defined as follows:
d 1 H W Y ( A , B ) = j = 1 n ω j 2 max α A ( x j ) α B ( x j ) 2 τ λ , β A ( x j ) β B ( x j ) 2 τ λ , θ A ( x j ) θ B ( x j ) 2 τ λ + 1 2 α A ( x j ) α B ( x j ) 2 τ λ + β A ( x j ) β B ( x j ) 2 τ λ + θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ 1 , ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .

6. Results

In this section, we develop the TOPSIS method and TODIM method based on the proposed distance measure to linguistic picture fuzzy decision-making environment and propose the corresponding linguistic picture fuzzy multi-criteria decision-making methodology using linguistic picture fuzzy entropy.
Assuming that a linguistic picture fuzzy multi-criteria decision-making problem has m alternatives { A 1 , A 2 , , A m } , each alternative is evaluated based on the criterion { C 1 , C 2 , , C n } , and ω = { ω 1 , ω 2 , , ω j } is the corresponding weight vector of criterion C j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) . The evaluation of alternatives given by the decision-maker is represented by LPFNs A i j = ( s α i j , s β i j , s θ i j ) ( i = 1 , 2 , , m ; j = 1 , 2 , , n ) , and the linguistic picture fuzzy information matrix A is given as follows:
A = ( A i j ) m × n = C 1 C 2 C n A 1 A 2 A m ( s α 11 , s β 11 , s θ 11 ) ( s α 12 , s β 12 , s θ 12 ) ( s α 1 n , s β 1 n , s θ 1 n ) ( s α 21 , s β 21 , s θ 21 ) ( s α 22 , s β 22 , s θ 22 ) ( s α 2 n , s β 2 n , s θ 2 n ) ( s α m 1 , s β m 1 , s θ m 1 ) ( s α m 2 , s β m 2 , s θ m 2 ) ( s α m n , s β m n , s θ m n ) .
The purpose of the multi-criteria decision-making problem is to rank the alternatives and choose the appropriate one. In the following, we develop the TOPSIS and TODIM methods to LPFSs, respectively.

6.1. Multi-Criteria Decision Making with TOPSIS Method Based on Entropy Weight under the Linguistic Picture Fuzzy Decision Environment

In the following, the proposed distance measure with TOPSIS method and TODIM method under linguistic picture fuzzy decision environment is summarized by the following algorithmic steps.
Step 1: Normalize the evaluation decision matrix.
In the TOPSIS method, we should choose the alternative that has the shortest distance from the positive ideal solution and the longest distance from the negative ideal solution. The positive ideal solution is a solution that maximizes all the benefit criteria and minimizes all the cost criteria. Firstly, we determine the adjustment method based on the type of attribute criteria. For the benefit type criterion, we do not need to do anything, but, for the cost type criterion, we apply the negation operator defined in Definition 10 to adjust the corresponding element A i j = ( s α i j , s β i j , s θ i j ) in decision matrix, which can be obtained as follows:
A ˜ i j = ( s α i j , s β i j , s θ i j ) , for benefit type criterion ; ( s θ i j , s β i j , s α i j ) , for cost type criterion .
Step 2: Calculate the weight vector of criteria based on linguistic picture fuzzy entropy.
In order to get the objective weights of the criteria, we first introduce the entropy weight method, and the corresponding definition of linguistic picture fuzzy entropy is defined as follows.
Definition 16.
Let A = { ( s α A ( x ) , s β A ( x ) , s θ A ( x ) ) | x X } and B = { ( s α B ( x ) , s β B ( x ) , s θ B ( x ) ) | x X } be two L P F S s defined on X = { x 1 , x 2 , , x n } , where s α i ( x ) , s β i ( x ) and s θ i ( x ) S [ 0 , 2 τ ] ( i = A , B ) for any x X , if the function E s : L P F S s ( X ) [ 0 , 1 ] satisfies the following conditions:
(1) 
E s ( A ) = 0 if A is a crisp set;
(2) 
E s ( A ) = 1 if α A = β A = θ A ;
(3) 
E s ( A ) E s ( B ) if | α A β A | + | α A θ A | + | β A θ A | | α B β B | + | α B θ B | + | β B θ B | ;
(4) 
E s ( A ) = E s ( A ¯ ) , where A ¯ is the complement of A,
then E s is a linguistic picture fuzzy entropy.
Definition 17.
Let A = ( s α A , s β A , s θ A ) be a LPFN, where α A , β A and θ A [ 0 , 2 τ ] , the linguistic picture fuzzy entropy measure is defined as follows:
E s ( A ) = 1 1 2 τ × 2 | α A β A | + | α A θ A | + | β A θ A | .
Example 3.
Letting κ 1 = ( s 3 , s 2 , s 1 ) be a LPFN, where s 3 , s 2 and s 1 S [ 0 , 2 τ ] = S [ 0 , 8 ] , we can obtain
E s ( A ) = 1 1 2 × 8 × 2 | 3 2 | + | 3 1 | + | 2 1 | = 0.8438 .
Now, we apply (7) to calculate the entropy value of A ˜ i j , and the corresponding entropy value matrix E = ( E i j ) m × n is obtained as follows:
E = C 1 C 2 C n A 1 A 2 A m E 11 E 12 E 1 n E 21 E 22 E 2 n E m 1 E m 2 E m n .
Aggregate and normalize the entropy value matrix E, which is given as follows:
ξ j = i = 1 m E i j i = 1 m j = 1 n E i j , ( i = 1 , 2 m , j = 1 , 2 n ) ,
where E i j is the corresponding entropy value.
Calculate the objective weights of criteria, the weight of criterion C j is obtained by
ω j = 1 ξ j i = 1 n ( 1 ξ j ) , ( j = 1 , 2 , , n ) ,
where ξ j is the normalized entropy value.
Step 3: Obtain the linguistic picture fuzzy positive-ideal solution and negative-ideal solution, respectively, which can be described as follows:
A + = { A ˜ 1 + , A ˜ 2 + , , A ˜ n + } , A = { A ˜ 1 , A ˜ 2 , , A ˜ n } ,
where A ˜ j + = m a x { A ˜ 1 j , A ˜ 2 j , , A ˜ m j } and A ˜ j = m i n { A ˜ 1 j , A ˜ 2 j , , A ˜ m j } , which are determined by the score function and accuracy function of LPFNs defined in Definition 9.
Step 4: Utilize the proposed distance measure to calculate the separation distance measure D i + ( A i , A + ) and D i ( A i , A ) , which are given by
D i + = D i + ( A i , A + ) = j = 1 n ω j d 1 H W Y ( A i j , A ˜ j + ) , D i = D i ( A i , A ) = j = 1 n ω j d 1 H W Y ( A i j , A ˜ j ) .
Step 5: Calculate the closeness coefficient ρ i of each alternative A i , which is obtained by
ρ i = D i D i + D i + ,
the bigger ρ i is, the better alternative A i will be.
In general, the flow diagram of the proposed TOPSIS method is depicted in Figure 1.
In the following, we extend the TODIM method to the proposed distance measure under linguistic picture fuzzy decision environment, and the steps of the algorithm are given as follows.
Step 1 and Step 2 are the same as TOPSIS method, and here we do not give the specific steps.
Step 3: Calculate the relative weight of each criteria.
To compare the evaluation of the alternatives with different criteria, we consider the relative weight of the criterion. Assume that ω r j is the weight of criterion C j relative to C r , which can be calculated by the following formula:
ω r j = ω j ω r , j = 1 , 2 , , n ,
where ω r = max { ω j | j = 1 , 2 , , n } .
Step 4: Calculate the overall dominance degree of the alternative A i over alternative A k under criterion C j , which is represented as follows:
δ ( A i , A k ) = j = 1 n ϕ j ( A i , A k ) , i , k = 1 , 2 , , m ,
where ϕ j ( A i , A k ) is the dominance degree of the alternative A i over A k under criterion C j , and
ϕ j ( A i , A k ) = ω r j j = 1 n ω r j ( d 1 H N Y ( A i j , A k j ) ) q q , A i j > A k j ; 0 , A i j = A k j ; 1 η j = 1 n ω r j ω r j ( d 1 H N Y ( A i j , A k j ) ) q q , A i j < A k j .
The hybrid linguistic picture distance d 1 H N Y ( A i j , A k j ) denotes the distance measure between A i j and A k j , and the comparison result between A i j and A k j is determined by Definition 9. The parameter q ( q 1 ) is a regulating variable that can be determined by the decision maker’s preference, and the parameter η represents the attenuation factor of the loss.
Step 5: Calculate the overall dominance degree of the alternatives A i , which is obtained by
Ψ ( A i ) = k = 1 m δ ( A i , A k ) min i { k = 1 m δ ( A i , A k ) } max i { k = 1 m δ ( A i , A k ) } min i { k = 1 m δ ( A i , A k ) } ,
where i = 1 , 2 , , m .
Step 6: Ranking the alternatives according to the value of Ψ ( A i ) , the bigger Ψ ( A i ) is, the better alternative will be.
The flow diagram of the proposed TODIM method is depicted in Figure 2.

7. Numerical Example

In this section, we give a numerical example (adapted from Chan and Kumar [42]) to illustrate the feasibility and effectiveness of the proposed methods. The comparisons with other existing methods are also discussed to show their advantages.

7.1. Background

A manufacturer wants to choose the best global supplier for the most critical parts used in its production process. Four suppliers A i ( i = 1 , 2 , 3 , 4 ) are evaluated based on the criterion C j ( j = 1 , 2 , , 5 ) , and the criterion C j ( j = 1 , 2 , , 5 ) stands for “overall cost of the product”, “quality of the product”, “service performance of supplier”, “supplier’s profile” and “risk factor”, respectively. The evaluation information of the suppliers A i ( i = 1 , 2 , 3 , 4 ) is represented by the LPFN ( s α i , s β i , s θ i ) S [ 0 , 2 τ ] = S [ 0 , 8 ] , and the corresponding linguistic picture fuzzy decision matrix A is shown in Table 1, where the linguistic term S = { s 0 = extremely poor, s 1 = very poor, s 2 = poor, s 3 = slightly poor, s 4 = fair, s 5 = slightly good, s 6 = good, s 7 = very good, s 8 = extremely good}.
In the following, we apply the proposed TOPSIS and TODIM methods in Section 6 to solve the above multi-criteria decision-making problem, respectively.

7.2. TOPSIS Method

In this subsection, the TOPSIS method based on linguistic picture fuzzy entropy proposed in Section 6.1 is used to select the most appropriate alternative.
Step 1: Normalize the linguistic picture fuzzy decision matrix A.
Because the criteria C 1 and C 5 are the cost-type, we transform the matrix A to normalized matrix A ˜ by (6), the corresponding normalized decision matrix A ˜ is obtained in Table 2.
Step 2: Calculate the objective weights of each criteria based on linguistic picture fuzzy entropy.
We apply the linguistic picture fuzzy entropy to calculate the weights of each criteria and the entropy value matrix is obtained in Table 3. The weight vector ω = ( ω 1 , ω 2 , ω 3 , ω 4 , ω 5 ) = ( 0.2021 , 0.1995 , 0.1995 , 0.2021 , 0.1986 ) is obtained by using Equations (9) and (10).
Step 3: Determine the linguistic picture fuzzy positive-ideal solution A + and negative-ideal solution A , respectively, and the results are obtained as follows:
A + = { ( s 2 , s 1 , s 4 ) , ( s 5 , s 2 , s 1 ) , ( s 6 , s 1 , s 1 ) , ( s 5 , s 2 , s 1 ) , ( s 2 , s 2 , s 3 ) } , A = { ( s 1 , s 1 , s 6 ) , ( s 4 , s 2 , s 2 ) , ( s 3 , s 2 , s 1 ) , ( s 4 , s 2 , s 1 ) , ( s 1 , s 1 , s 6 ) } .
Step 4: Based on the obtained weight of the criteria in Step 2, we utilize the hybrid linguistic picture fuzzy distance measure d 1 H W Y ( λ = 3 ) defined in (4) to calculate the separation distance between A i and A + , A i and A , respectively, the results are obtained in Table 4.
Step 5: Calculate the closeness coefficient of each alternative as follows:
ρ 1 = 0.4633 , ρ 2 = 0.3551 , ρ 3 = 0.6979 , ρ 4 = 0.5215 ,
so the ranking order is A 3 A 4 A 1 A 2 , that is to say, the best alternative is A 3 .

7.3. TODIM Method

In the following, we apply the TODIM method to deal with the same numerical example, and the calculation steps are given as follows:
The results of Step 1 and Step 2 are the same as Section 7.2.
Step 3: Calculate the relative weight.
Since ω = ( 0.2021 , 0.1995 , 0.1995 , 0.2021 , 0.1968 ) , then ω r = ω 1 = ω 3 = 0.2021 . According to (14), we can obtain the relative weight as follows: ω 11 = 1 , ω 12 = 0.9868 , ω 13 = 0.9868 , ω 14 = 1 and ω 15 = 0.9738 .
Step 4: Calculate the overall dominance degree of the alternative A i over alternative A k under criteria C j .
We assume η = 2 and apply the hybrid generalized distance measure d 1 H W Y ( λ = 3 ) defined in (4) to calculate the overall dominance degree of the alternative A i over alternative A k under criteria C j ( j = 1 , 2 , 3 , 4 , 5 ) , which are obtained as follows:
ϕ 1 ( A i , A k ) = 0 0.2780 0.2501 0.2501 0.1124 0 0.0511 0.2561 0.1035 0.1263 0 0.1390 0.1035 0.1035 0.0562 0 ,
ϕ 2 ( A i , A k ) = 0 0.0558 0.1399 0.2578 0.1399 0 0.1399 0.1507 0.0558 0.0558 0 0.0507 0.1028 0.0601 0.1271 0 ,
ϕ 3 ( A i , A k ) = 0 0.0507 0.2799 0.0558 0.1271 0 0.2578 0.0507 0.1117 0.1028 0 0.1528 0.1399 0.1271 0.3830 0 ,
ϕ 4 ( A i , A k ) = 0 0.0511 0.0511 0.0562 0.1263 0 0.0562 0.1035 0.1263 0.1390 0 0.1263 0.1391 0.2561 0.0511 0 ,
ϕ 5 ( A i , A k ) = 0 0.1109 0.2595 0.1518 0.2818 0 0.2595 0.3871 0.1021 0.1021 0 0.1409 0.0597 0.1524 0.0555 0 ,
δ ( A i , A k ) = 0 0.0095 0.8843 0.5537 0.5627 0 0.5499 0.6397 0.2468 0.0046 0 0.2027 0.0129 0.0672 0.3473 0 .
Step 5: Using (17) to calculate the overall dominance degree of the alternative A i , we have Ψ ( A 1 ) = 0.1701 , Ψ ( A 2 ) = 0 , Ψ ( A 3 ) = 1 , Ψ ( A 4 ) = 0.7394 .
Step 6: Ranking the alternatives based on the overall dominance degree of the alternative, it is obvious that the ranking order of the alternatives is A 3 A 4 A 1 A 2 , so A 3 is the best alternative.

7.4. Comparison Analysis with Other Existing Methods

In this subsection, in order to verify the effectiveness of the proposed methods for solving the multi-criteria decision-making problems, we utilize the aggregation operators, the different distance measures, and other existing methods to calculate the same numerical example, and the results are given in Table 5.
From Table 5, we can see that the ranking results of the proposed methods are the same as the method of Krohling et al. [43] and Boran et al. [44], which can demonstrate the feasibility of the proposed TOPSIS and TODIM methods based on the linguistic picture fuzzy entropy in this paper.
If we apply the LPFWA operator and LPFWG operator to aggregate the decision information, respectively, we can obtain A 1 = L P F W A ( A ˜ 11 , A ˜ 12 , A ˜ 13 , A ˜ 14 , A ˜ 15 ) = ( s 3.2820 , s 2.2136 , s 1.8869 ) , A 2 = ( s 3.2820 , s 1.6464 , s 2.1621 ) , A 3 = ( s 4.0111 , s 1.5196 , s 1.7384 ) and A 4 = ( s 3.3579 , s 1.6433 , s 1.6428 ) . Based on the score function of LPFS, we can obtain A 3 A 4 A 1 A 2 . Similarly, we apply the LPFWG operator to obtain the aggregated decision values as follows: A 1 = ( s 2.4070 , s 2.4472 , s 3.1324 ) , A 2 = ( s 2.4070 , s 1.8503 , s 3.2625 ) , A 3 = ( s 2.9895 , s 1.6220 , s 2.4005 ) and A 4 = ( s 2 , 9949 , s 1.8477 , s 2.1491 ) . Using the score function of LPFS, we have A 4 A 3 A 1 A 2 . Obviously, the ranking result of the alternatives based on LPFWG operator is different from that obtained by the proposed method in this paper. The differences are the ranking orders between A 3 and A 4 . The main reason is that the operation of geometric operator does not satisfy the closure of operation and may cause the loss of decision information.
Compared with other existing methods, the proposed decision-making methods have some advantages in solving multi-criteria decision-making problems. In the methods of Krohling [43] and Boran [44] et al., they consider the TODIM and TOPSIS methods in IFS, which cannot meet the needs of decision-making problems involving more answers of types. We can know it from the following aspects.
Firstly, the proposed LPFS is a generalized form of IFS by incorporating the neutral membership degree, which can deal with the decision information better under uncertain conditions. Secondly, the proposed LPFS overcomes the limitations of PFS that represents the decision information with numerical value, which express the evaluation information with LTS that is closer to human cognitive ability. Thirdly, considering the weight of criteria is an important component of multi-criteria decision-making problem, we propose the linguistic picture fuzzy entropy to calculate the objective weight of criteria and reduce the randomness in decision-making process, which can improve the rationality of decision-making results. The proposed hybrid distance measures between LPFSs are constructed based on the geometric interpretation of LPFSs in some extent, which is more suitable for comparing the alternatives.

7.5. Sensitivity Analysis

In this subsection, we make the sensitivity analysis of parameters in the proposed TOPSIS and TODIM methods.
Firstly, in the TOPSIS method between LPFSs, we consider the influence of the parameter λ in hybrid distance measure d 1 W H Y . Letting λ = 1 , 2 , 10 , 55 , 100 , we can obtain the ranking results with different λ , which are given in Table 6, and the corresponding change diagram is shown in Figure 3. According to Figure 3, we can see that the calculation values of A 1 , A 2 and A 3 are increasing as λ increases. However, the calculation values of A 4 are decreasing as the value of λ increases, which shows that the change of λ in the distance measure may affect the decision makers. We can also see that the ranking order of the alternatives is A 3 A 4 A 2 A 1 for different λ , which illustrates the stability of the proposed TOPSIS method between LPFSs for different distance measures.
Secondly, we consider the influence of three parameters λ , η and q in the proposed TODIM method between LPFSs.
(1) We calculate the ranking results of the alternatives with different λ in hybrid distance measure d 1 W H Y . Assuming η = 2 and q = 2 , let λ = 1 , 2 , 10 , 55 , 100 , the calculation results of the alternatives with different λ are obtained in Table 7, the corresponding graph with change of parameter λ is shown in Figure 4. From Figure 4, we can see that the ranking results is always A 3 A 4 A 1 A 2 , which also shows the stability of parameter λ in the proposed TODIM method between LPFSs for different distance measures.
(2) We consider the influence of the parameter η in the TODIM method, which represents the sensitive coefficient of risk aversion. Assuming λ = 3 and q = 2 , let η = 1 , 1.5 , 2.5 , 3 , 5 , the ranking results with different η are shown in Table 8, we know the ranking order of the alternatives is A 3 A 4 A 1 A 2 . The corresponding graph with change of parameter η is shown in Figure 5, and it is clear that the ranking results are stable for different η , which illustrates that the decision maker is not sensitive to risk aversion.
(3) The parameter q in TODIM method is a regulation variable, which represents the preference of decision makers. Now, we consider the influence of q on decision results. Assuming λ = 3 and η = 2 , let q = 1 , 3 , 10 , 55 , 100 . The calculation results are obtained in Table 9 and the change graph corresponding to q is shown in Figure 6. According to Table 9, we can see that the ranking result of the alternatives is A 3 A 4 A 1 A 2 , and the change of parameter q does not change the stability of the TODIM method, which can also be illustrated from Figure 6.

8. Conclusions

In this paper, we proposed the LPFS based on PFS and LTS, where the positive-membership, the neutral-membership, and the negative-membership are represented by linguistic variables, and the LPFS can deal with the vague and imprecise information in qualitative environment. Furthermore, the operation rules of LPFSs, the LPFWA operator, and LPFWG operator are developed. Then, we define some distance measures between LPFSs, and the TOPSIS method and TODIM method are developed to the proposed distance measures based on the linguistic picture fuzzy entropy. Finally, an illustrative example is given to illustrate the effectiveness of the proposed methods, and the comparative analysis with other existing methods and sensitivity analysis of the proposed methods are also discussed.
Although the proposed linguistic picture fuzzy set can solve the multi-criteria decision-making problems, which still has the following limitations: (1) The linguistic term sets considered in this paper are calculated based on the subscript of linguistic terms and the subscript is integer, which may cause a loss of evaluation information. (2) The aggregated operators may not be a linguistic term set, which is unreasonable and counterintuitive. (3) The proposed hybrid distance measure only considered the Hausdorff distance measure based on the maximum value, which is susceptible to the extreme values and it may cause the inaccurate ranking result in the multi-criteria decision-making problems with extreme evaluation information.
In the future, in order to overcome the above limitations, we will take further studies from the following aspects: (1) The different semantic situations with linguistic scale function can be considered into the picture fuzzy sets, and it can be extended to the uncertain linguistic term set. (2) How to define a new aggregated operator that satisfies the closure of linguistic picture fuzzy set. (3) The proposed hybrid distance measure can take the mean and variance of linguistic picture fuzzy set into consideration and it can be extended to the continuous distance measure. Furthermore, the proposed method can be applied to practical decision-making problems such as pattern recognition, medical diagnosis et al.

Author Contributions

D.L. contributed to the conception of the study and wrote the manuscript. Y.L. performed the data analyses and wrote the manuscript; Z.L. helped perform the analysis with constructive discussions. All authors have read and agreed to the published version of the manuscript.

Funding

This research is fully supported by a grant of Social Science Foundation of China(15BTJ028).

Acknowledgments

The authors would like to express their thanks to the reviewers for their valuable comments on this article.

Conflicts of Interest

The authors declare no conflict of interests regarding the publication for the paper.

Abbreviations

LPFSLinguistic picture fuzzy set
LPFWALinguistic picture fuzzy weighted averaging
LPFWGLinguistic picture fuzzy weighted geometric
TOPSISTechnique for order of preference by similarity to ideal solution
TODIMTomada de decisao interativa multicriterio
FSFuzzy set
LTSLinguistic term set
LIFSLinguistic intuitionistic fuzzy set

Appendix A

Theorem A1.
Letting κ 1 = ( s α 1 , s β 1 , s θ 1 ) , κ 2 = ( s α 2 , s β 2 , s θ 2 ) , and κ 3 = ( s α 3 , s β 3 , s θ 3 ) be any three LPFNs defined on S [ 0 , 2 τ ] , and λ , λ 1 , λ 2 > 0 , then we have
(1) 
κ 1 κ 2 = κ 2 κ 1 ;
(2) 
κ 1 κ 2 = κ 2 κ 1 ;
(3) 
λ ( κ 1 κ 2 ) = λ κ 1 λ κ 2 ;
(4) 
λ 1 κ 1 λ 2 κ 1 = ( λ 1 + λ 2 ) κ 1 ;
(5) 
( κ 1 κ 2 ) λ = κ 1 λ κ 2 λ ;
(6) 
κ 1 λ 1 κ 1 λ 2 = κ 1 ( λ 1 + λ 2 ) .
Proof. 
The proofs of properties are similar, and we only give the proof of (1), (3) and (5) here.
(1) According to Definition 10, we have
κ 1 κ 2 = ( s α 1 + α 2 α 1 α 2 2 τ , s β 1 β 2 2 τ , s θ 1 θ 2 2 τ ) = ( s α 2 + α 1 α 2 α 1 2 τ , s β 2 β 1 2 τ , s θ 2 θ 1 2 τ ) = κ 2 κ 1 .
(3) Based on Definition 10, we have
λ ( κ 1 κ 2 ) = ( s 2 τ 2 τ ( 1 α 1 + α 2 α 1 α 2 2 τ 2 τ ) λ , s 2 τ ( β 1 β 2 ( 2 τ ) 2 ) λ , s 2 τ ( θ 1 θ 2 ( 2 τ ) 2 ) λ ) = ( s 2 τ 2 τ ( 1 α 1 2 τ ) λ ( 1 α 2 2 τ ) λ , s 2 τ ( β 1 β 2 ( 2 τ ) 2 ) λ , s 2 τ ( θ 1 θ 2 ( 2 τ ) 2 ) λ ) .
Because λ κ 1 = ( s 2 τ 2 τ ( 1 α 1 2 τ ) λ , s 2 τ ( β 1 2 τ ) λ , s 2 τ ( θ 1 2 τ ) λ ) and λ κ 2 = ( s 2 τ 2 τ ( 1 α 2 2 τ ) λ , s 2 τ ( β 2 2 τ ) λ , s 2 τ ( θ 2 2 τ ) λ ) , then
λ κ 1 λ κ 2 = ( s 2 τ 2 τ ( 1 α 1 2 τ ) λ + 2 τ 2 τ ( 1 α 2 2 τ ) λ ( 2 τ 2 τ ( 1 α 1 2 τ ) λ ) ( 2 τ 2 τ ( 1 α 2 2 τ ) λ ) 2 τ , s ( 2 τ ( β 1 2 τ ) λ ) ( 2 τ ( β 2 2 τ ) λ ) 2 τ , s ( 2 τ ( θ 1 2 τ ) λ ) ( 2 τ ( θ 2 2 τ ) λ ) 2 τ ) = ( s 2 τ 2 τ ( 1 α 1 2 τ ) λ ( 1 α 2 2 τ ) λ , s 2 τ ( β 1 β 2 ( 2 τ ) 2 ) λ , s 2 τ ( θ 1 θ 2 ( 2 τ ) 2 ) λ ) = λ ( κ 1 κ 2 ) .
(5) Based on Definition 10, we have
( κ 1 κ 2 ) λ = ( s 2 τ ( α 1 α 2 ( 2 τ ) 2 ) λ , s 2 τ 2 τ ( 1 β 1 + β 2 β 1 β 2 2 τ 2 τ ) λ , s 2 τ 2 τ ( 1 θ 1 + θ 2 θ 1 θ 2 2 τ 2 τ ) λ ) = ( s 2 τ ( α 1 α 2 ( 2 τ ) 2 ) λ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ ( 1 β 2 2 τ ) λ , s 2 τ 2 τ ( 1 θ 1 2 τ ) λ ( 1 θ 2 2 τ ) λ ) .
Because κ 1 λ = ( s 2 τ ( α 1 2 τ ) λ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ , s 2 τ 2 τ ( 1 θ 1 2 τ ) λ ) and κ 2 λ = ( s 2 τ ( α 2 2 τ ) λ , s 2 τ 2 τ ( 1 β 2 2 τ ) λ , s 2 τ 2 τ ( 1 θ 2 2 τ ) λ ) , then
κ 1 λ κ 2 λ = s [ 2 τ ( α 1 2 τ ) λ ] [ 2 τ ( α 2 2 τ ) λ ] 2 τ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ + 2 τ 2 τ ( 1 β 2 2 τ ) λ [ 2 τ 2 τ ( 1 β 1 2 τ ) λ ] [ 2 τ 2 τ ( 1 β 2 2 τ ) λ ] 2 τ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ + 2 τ 2 τ ( 1 β 2 2 τ ) λ [ 2 τ 2 τ ( 1 θ 1 2 τ ) λ ] [ 2 τ 2 τ ( 1 θ 2 2 τ ) λ ] 2 τ = ( s 2 τ ( α 1 α 2 ( 2 τ ) 2 ) λ , s 2 τ 2 τ ( 1 β 1 2 τ ) λ ( 1 β 2 2 τ ) λ , s 2 τ 2 τ ( 1 θ 1 2 τ ) λ ( 1 θ 2 2 τ ) λ ) = ( κ 1 κ 2 ) λ .
Thus, Theorem A1 is proved.  ☐
Theorem A2.
Let κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of LPFNs, the aggregated value of LPFNs based on LPFWA operator is obtained as follows:
L P F W A ( κ 1 , κ 2 , , κ n ) = s 2 τ 2 τ j = 1 n ( 1 α j 2 τ ) ω j , s 2 τ j = 1 n ( β j 2 τ ) ω j , s 2 τ j = 1 n ( β j 2 τ ) ω j ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of κ j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
Proof. 
We apply the method of mathematical induction to prove Theorem A2.
(1)
When n = 2 , for κ 1 = ( s α 1 , s β 1 , s θ 1 ) and κ 2 = ( s α 2 , s β 2 , s θ 3 ) ,
L P F W A ( κ 1 , κ 2 ) = ω 1 κ 1 ω 2 κ 2 = ( s 2 τ 2 τ ( 1 α 1 2 τ ) ω 1 , s 2 τ ( β 1 2 τ ) ω 1 , s 2 τ ( θ 1 2 τ ) ω 1 ) ( s 2 τ 2 τ ( 1 α 2 2 τ ) ω 2 , s 2 τ ( β 2 2 τ ) ω 2 , s 2 τ ( θ 2 2 τ ) ω 2 ) = ( s 2 τ 2 τ ( 1 α 1 2 τ ) ω 1 + 2 τ 2 τ ( 1 α 2 2 τ ) ω 2 [ 2 τ 2 τ ( 1 α 1 2 τ ) ω 1 ] [ 2 τ 2 τ ( 1 α 1 2 τ ) ω 1 ] 2 τ , s [ 2 τ ( β 1 2 τ ) ω 1 ] [ 2 τ ( β 2 2 τ ) ω 2 ] 2 τ , s [ 2 τ ( θ 1 2 τ ) ω 1 ] [ 2 τ ( θ 2 2 τ ) ω 2 ] 2 τ ) = ( s 2 τ 2 τ ( 1 α 1 2 τ ) ω 1 ( 1 α 2 2 τ ) ω 2 , s 2 τ ( β 1 2 τ ) ω 1 ( β 2 2 τ ) ω 2 , s 2 τ ( θ 1 2 τ ) ω 1 ( θ 2 2 τ ) ω 2 ) .
Thus, (A1) is held for n = 2 .
(2)
Supposing that (A1) is held for n = m , then
L P F W A ( κ 1 , κ 2 , , κ m ) = ω 1 κ 1 ω 2 κ 2 ω m κ m = ( s 2 τ 2 τ j = 1 m ( 1 α j 2 τ ) ω j , s 2 τ j = 1 m ( β j 2 τ ) ω j , s 2 τ j = 1 m ( θ j 2 τ ) ω j ) .
when n = m + 1 , we have
L P F W A ( κ 1 , κ 2 , , κ m , κ m + 1 ) = ω 1 κ 1 ω 2 κ 2 ω m κ m ω m + 1 κ m + 1 = L P F W A ( κ 1 , κ 2 , , κ m ) ω m + 1 κ m + 1 = ( s 2 τ 2 τ j = 1 m ( 1 α j 2 τ ) ω j , s 2 τ j = 1 m ( β j 2 τ ) ω j , s 2 τ j = 1 m ( θ j 2 τ ) ω j ) ( s 2 τ 2 τ ( 1 α m + 1 2 τ ) ω m + 1 , s 2 τ ( β m + 1 2 τ ) ω m + 1 , s 2 τ ( θ m + 1 2 τ ) ω m + 1 ) = ( s 2 τ 2 τ j = 1 m + 1 ( 1 α j 2 τ ) ω j , s 2 τ j = 1 m + 1 ( β j 2 τ ) ω j , s 2 τ j = 1 m + 1 ( θ j 2 τ ) ω j ) .
That is to say, (A1) is held for n = m + 1 . According to the mathematical induction, (A1) is held for any n, so Theorem A2 is proved.  ☐
In the following, we prove the properties in Theorem A3 by using the LPFWA operator.
Theorem A3.
(1) Idempotency: Let κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of LPFNs, if κ j ( j = 1 , 2 , , n ) are all equal, that is, κ j = κ = ( s α , s β , s θ ) for all j, then
L P F W A ( κ 1 , κ 2 , , κ n ) = κ .
(2) Commutativity: Let κ j = ( s α j , s β j , s θ j ) and κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be two collections of LPFNs, if κ j ( j = 1 , 2 , , n ) is any permutation of κ j ( j = 1 , 2 , , n ) , then
L P F W A ( κ 1 , κ 2 , , κ n ) = L P F W A ( κ 1 , κ 2 , , κ n ) .
(3) Boundedness: Let κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a collection of LPFNs and α = min j { α j } , α + = max j { α j } , β = min j { β j } , β + = max j { β j } , θ = min j { θ j } , θ + = max j { θ j } , then
( s α , s β , s θ + ) L P F W A ( κ 1 , κ 2 , , κ n ) ( s α + , s β + , s θ ) .
Proof. 
(1) Since κ j = κ = ( s α , s β , s θ ) for all j ( j = 1 , 2 , , n ) , then
L P F W A ( κ 1 , κ 2 , , κ n ) = L P F W A ( κ , κ , , κ ) = ( s 2 τ 2 τ j = 1 n ( 1 α 2 τ ) ω j , s 2 τ j = 1 n ( β 2 τ ) ω j , s 2 τ j = 1 n ( θ 2 τ ) ω j ) = ( s α , s β , s θ ) = κ .
(2) According to Definition 11, we have
L P F W A ( κ 1 , κ 2 , , κ n ) = ( s 2 τ 2 τ j = 1 n ( 1 α j 2 τ ) ω j , s 2 τ j = 1 n ( β j 2 τ ) ω j , s 2 τ j = 1 n ( θ j 2 τ ) ω j ) , L P F W A ( κ 1 , κ 2 , , κ n ) = ( s 2 τ 2 τ j = 1 n ( 1 α j 2 τ ) ω j , s 2 τ j = 1 n ( β j 2 τ ) ω j , s 2 τ j = 1 n ( θ j 2 τ ) ω j ) .
Since κ j is any permutation of κ j ( j = 1 , 2 , , n ) , it is easy to know
L P F W A ( κ 1 , κ 2 , , κ n ) = L P F W A ( κ 1 , κ 2 , , κ n ) .
(3) Assume that L P F W A ( κ 1 , κ 2 , , κ n ) = ( s α c , s β c , s θ c ) , since α = min j { α j } , α + = max j { α j } , β = min j { β j } , β + = max j { β j } , θ = min j { θ j } , θ + = max j { θ j } , we can get
2 τ j = 1 n ( θ 2 τ ) ω j 2 τ j = 1 n ( θ j 2 τ ) ω j = s θ c 2 τ j = 1 n ( θ + 2 τ ) ω j
and
2 τ 2 τ j = 1 n ( 1 α 2 τ ) ω j 2 τ 2 τ j = 1 n ( 1 α j 2 τ ) ω j = s α c 2 τ 2 τ j = 1 n ( 1 α + 2 τ ) ω j .
Because s α and s θ are increasing as α and θ increase, then
s α s α c s α + , s θ s θ c s θ + .
We know L S ( s α , s β , s θ + ) = α θ + and L S ( s α + , s β , s θ ) = α + θ ,
then
L S ( s α , s β , s θ + ) L S ( L P F W A ( κ 1 , κ 2 , , κ n ) ) L S ( s α + , s β , s θ ) .
Thus, ( s α , s β , s θ + ) L P F W A ( κ 1 , κ 2 , , κ n ) ( s α + , s β , s θ ) is obtained.  ☐
Theorem A4.
Letting κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of LPFNs, the aggregated value of them based on LPFWG operator is obtained as follows:
L P F W G ( κ 1 , κ 2 , , κ n ) = ( s 2 τ j = 1 n ( α j 2 τ ) ω j , s 2 τ 2 τ j = 1 n ( 1 β j 2 τ ) ω j , s 2 τ 2 τ j = 1 n ( 1 θ j 2 τ ) ω j ) ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of κ j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
Proof. 
The proof is similar to Theorem A2, and we omit it here.  ☐
Theorem A5.
(1) Idempotency: Let κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a number of L P F N s , if κ j ( j = 1 , 2 , , n ) are all equal, that is, κ j = κ = ( s α , s β , s θ ) for all j, then
L P F W G ( κ 1 , κ 2 , , κ n ) = κ .
(2) Commutativity: Let κ j = ( s α j , s β j , s θ j ) and κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be two collections of LPFNs, if κ j ( j = 1 , 2 , , n ) is any permutation of κ j ( j = 1 , 2 , , n ) , then
L P F W G ( κ 1 , κ 2 , , κ n ) = L P F W G ( κ 1 , κ 2 , , κ n ) .
(3) Boundedness: Let κ j = ( s α j , s β j , s θ j ) ( j = 1 , 2 , , n ) be a collection of LPFNs and α = min j { α j } , α + = max j { α j } , β = min j { β j } , β + = max j { β j } θ = min j { θ j } , θ + = max j { θ j } , then
( s α , s β , s θ + ) L P F W G ( κ 1 , κ 2 , , κ n ) ( s α + , s β + , s θ ) .
Proof. 
The proof is similar to Theorem A3, we omit it here.  ☐
Theorem A6.
Letting A = { s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) | x j X } , B = { s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) | x j X } and C = { s α C ( x j ) , s β C ( x j ) , s θ C ( x j ) | x j X } be three LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B , C ) , the generalized weighted distance measure d 1 w ( A , B ) satisfies the following properties:
(1) 
0 d 1 w ( A , B ) 1 ;
(2) 
d 1 w ( A , B ) = 0 A = B ;
(3) 
d 1 w ( A , B ) = d 1 w ( B , A ) ;
(4) 
If A B C , then d 1 w ( A , B ) d 1 w ( A , C ) and d 1 w ( B , C ) d 1 w ( A , C ) .
Proof. 
(1) Based on the definition of LPFSs, we know that α i , β i , and θ i [ 0 , 2 τ ] ( i = A , B ) , and 0 α i + β i + θ i 2 τ ( i = A , B ) . For all x j X , it is easy to know that
0 | α A ( x j ) α B ( x j ) | 2 τ 0 α A ( x j ) α B ( x j ) 2 τ λ 1 ;
0 | β A ( x j ) β B ( x j ) | 2 τ 0 β A ( x j ) β B ( x j ) 2 τ λ 1 ;
0 | θ A ( x j ) θ B ( x j ) | 2 τ 0 θ A ( x j ) θ B ( x j ) 2 τ λ 1 .
According to the absolute value inequality, we have
α A α B 2 τ λ + β A β B 2 τ λ + θ A θ B 2 τ λ α A 2 τ λ + α B 2 τ λ + β A 2 τ λ + β B 2 τ λ + θ A 2 τ λ + θ B 2 τ λ = ( α A ) λ + ( β A ) λ + ( θ A ) λ + ( α B ) λ + ( β B ) λ + ( θ B ) λ ( 2 τ ) λ .
By Mathematical induction, the following inequality can be established,
( α A ) λ + ( β A ) λ + ( θ A ) λ + ( α B ) λ + ( β B ) λ + ( θ B ) λ ( 2 τ ) λ 2 .
When λ = 1 because 0 α i + β i + θ i 2 τ ( i = A , B ) , we have
α A + β A + θ A + α B + β B + θ B 2 τ 2 .
When λ = n , assuming that the inequality is held, that is,
( α A ) n + ( β A ) n + ( θ A ) n + ( α B ) n + ( β B ) n + ( θ B ) n ( 2 τ ) n 2 .
When λ = n + 1 because 0 α i + β i + θ i 2 τ ( i = A , B ) , we have
( α A ) n + 1 + ( β A ) n + 1 + ( θ A ) n + 1 + ( α B ) n + 1 + ( β B ) n + 1 + ( θ B ) n + 1 ( 2 τ ) n + 1 = ( α A ) n α A + ( β A ) n β A + ( θ A ) n θ A + ( α B ) n α B + ( β B ) n β B + ( θ B ) n θ B ( 2 τ ) n 2 τ 2 τ ( ( α A ) n + ( β A ) n + ( θ A ) n + ( α B ) n + ( β B ) n + ( θ B ) n ) ( 2 τ ) n 2 τ 2 .
Thus, 0 α A ( x j ) α B ( x j ) 2 τ λ + β A ( x j ) β B ( x j ) 2 τ λ + θ A ( x j ) θ B ( x j ) 2 τ λ 2 is obtained, which implies 0 d 1 ( A , B ) 1 .
(2) d 1 w ( A , B ) = 0 | α A ( x j ) α B ( x j ) | = 0 , | β A ( x j ) β B ( x j ) | = 0 and | θ A ( x j ) θ B ( x j ) | = 0 for all x j X α A ( x j ) = α B ( x j ) , β A ( x j ) = β B ( x j ) and θ A ( x j ) = θ B ( x j ) for all x j X A = B .
(3) Since
α A ( x j ) α B ( x j ) 2 τ = α B ( x j ) α A ( x j ) 2 τ ,
β A ( x j ) β B ( x j ) 2 τ = β B ( x j ) β A ( x j ) 2 τ ,
and
θ A ( x j ) θ B ( x j ) 2 τ = θ B ( x j ) θ A ( x j ) 2 τ ,
then d 1 w ( A , B ) = d 1 w ( B , A ) can be easily obtained.
(4) Because A B C , then 0 α A α B α C , 0 β A β B β C and θ A θ B θ C 0 .
It is easy to know
| α A α B | | α A α C | , | β A β B | | β A β C | , | θ A θ B | | θ A θ C | .
For any λ 0 , we have
α A α B 2 τ λ + β A β B 2 τ λ + θ A θ B 2 τ λ α A α C 2 τ λ + β A β C 2 τ λ + θ A θ C 2 τ λ .
Then,
d 1 ω ( A , B ) d 1 ω ( A , C ) is obtained .
Similarly, we have
d 1 ω ( B , C ) d 1 ω ( A , C ) .
  ☐
Theorem A7.
Letting A = { ( s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) ) | x j X } , B = { ( s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) ) | x j X } and C = { ( s α C ( x j ) , s β C ( x j ) , s θ C ( x j ) ) | x j X } be three LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B , C ) , the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) satisfies the following properties:
(1) 0 d 1 W H ( A , B ) 1 ;
(2) d 1 W H ( A , B ) = 0 A = B ;
(3) d 1 W H ( A , B ) = d 1 W H ( B , A ) ;
(4) If A B C , then d 1 W H ( A , B ) d 1 W H ( A , C ) and d 1 W H ( B , C ) d 1 W H ( A , C ) .
Proof. 
(1) Because 0 α i + β i + θ i 2 τ ( i = A , B ) for all x j X and λ 1 , we have
0 | α A ( x j ) α B ( x j ) | 2 τ 0 α A ( x j ) α B ( x j ) 2 τ λ 1 ;
0 | β A ( x j ) β B ( x j ) | 2 τ 0 β A ( x j ) β B ( x j ) 2 τ λ 1 ;
0 | θ A ( x j ) θ B ( x j ) | 2 τ 0 θ A ( x j ) θ B ( x j ) 2 τ λ 1 ;
Then, 0 m a x α A ( x j ) α B ( x j ) 2 τ λ , β A ( x j ) β B ( x j ) 2 τ λ , θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ 1 is obtained, that is, 0 d 1 W H ( A , B ) 1 .
The proofs of properties (2) to (4) are similar to Theorem A6, and we omit it here.   ☐
Theorem A8.
Let A = { ( s α A ( x j ) , s β A ( x j ) , s θ A ( x j ) ) | x j X } , B = { ( s α B ( x j ) , s β B ( x j ) , s θ B ( x j ) ) | x j X } and C = { ( s α C ( x j ) , s β C ( x j ) , s θ C ( x j ) ) | x j X } be three LPFSs defined on X = { x 1 , x 2 , , x n } , where s α i ( x j ) , s β i ( x j ) and s θ i ( x j ) S [ 0 , 2 τ ] ( i = A , B , C ) , the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) satisfying the following properties:
(1) 
0 d 1 H W Y ( A , B ) 1 ;
(2) 
d 1 H W Y ( A , B ) = 0 A = B ;
(3) 
d 1 H W Y ( A , B ) = d 1 H W Y ( B , A ) ;
(4) 
If A B C , then d 1 H W Y ( A , B ) d 1 H W Y ( A , C ) and d 1 H W Y ( B , C ) d 1 H W Y ( A , C ) .
Proof. 
The proof is similarly to Theorem A6, and it can be obtained based on Theorems A6 and A7, we omit it here.  ☐
• The Remarks of Definition 13
Remark A1.
If λ = 1 , the generalized weighted distance measure d 1 w ( A , B ) is reduced to the weighted Hamming distance measure d 2 w ( A , B ) between LPFSs, which is given as follows:
d 2 w ( A , B ) = 1 2 j = 1 n ω j α A ( x j ) α B ( x j ) 2 τ + β A ( x j ) β B ( x j ) 2 τ + θ A ( x j ) θ B ( x j ) 2 τ ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ).
If λ = 2 , the generalized weighted distance measure d 1 w ( A , B ) is reduced to the weighted Euclidean distance measure d 3 w ( A , B ) between LPFSs, which is given as follows:
d 3 w ( A , B ) = 1 2 j = 1 n ω j α A ( x j ) α B ( x j ) 2 τ 2 + β A ( x j ) β B ( x j ) 2 τ 2 + θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ).
Remark A2.
If ω j = 1 n for all j, the generalized weighted distance measure d 1 w ( A , B ) is reduced to the generalized normalized distance measure d 1 n ( A , B ) between LPFSs, which is given as follows:
d 1 n ( A , B ) = 1 2 n j = 1 n α A ( x j ) α B ( x j ) 2 τ λ + β A ( x j ) β B ( x j ) 2 τ λ + θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ 1 .
If ω j = 1 n for all j and λ = 1 , the generalized weighted distance measure d 1 ω ( A , B ) is reduced to the normalized Hamming distance measure d 2 n ( A , B ) between LPFSs, which is given as follows:
d 2 n ( A , B ) = 1 2 n j = 1 n α A ( x j ) α B ( x j ) 2 τ + β A ( x j ) β B ( x j ) 2 τ + θ A ( x j ) θ B ( x j ) 2 τ .
If ω j = 1 n for all j and λ = 2 , the generalized weighted distance measure d 1 w ( A , B ) is reduced to the normalized Euclidean distance measure d 3 n ( A , B ) between LPFSs, which is given as follows:
d 3 n ( A , B ) = 1 2 n j = 1 n α A ( x j ) α B ( x j ) 2 τ 2 + β A ( x j ) β B ( x j ) 2 τ 2 + θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 .
• The Remarks of Definition 14
Remark A3.
If λ = 1 , the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) is reduced to the weighted Hamming–Hausdorff distance measure d 2 W H ( A , B ) between LPFSs, which is given as follows:
d 2 W H ( A , B ) = j = 1 n ω j max α A ( x j ) α B ( x j ) 2 τ , β A ( x j ) β B ( x j ) 2 τ , θ A ( x j ) θ B ( x j ) 2 τ ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
If λ = 2 , the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) is reduced to the weighted Euclidean-Hausdorff distance measure d 3 W H ( A , B ) between LPFSs, which is given as follows:
d 3 W H ( A , B ) = j = 1 n ω j max α A ( x j ) α B ( x j ) 2 τ 2 , β A ( x j ) β B ( x j ) 2 τ 2 , θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
Remark A4.
If ω j = 1 n for all j, the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) is reduced to the normalized Hausdorff distance measure d 1 N H ( A , B ) between LPFSs, which is given as follows:
d 1 N H ( A , B ) = 1 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ λ , β A ( x j ) β B ( x j ) 2 τ λ , θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ 1 .
If ω j = 1 n for all j and λ = 1 , the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) is reduced to the normalized Hamming–Hausdorff distance measure d 2 N H ( A , B ) between LPFSs, which is given as follows:
d 2 N H ( A , B ) = 1 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ , β A ( x j ) β B ( x j ) 2 τ , θ A ( x j ) θ B ( x j ) 2 τ .
If ω j = 1 n for all j and λ = 2 , the generalized weighted Hausdorff distance measure d 1 W H ( A , B ) is reduced to the normalized Euclidean-Hausdorff distance d 3 N H ( A , B ) between LPFSs, which is given as follows:
d 3 N H ( A , B ) = 1 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ 2 , β A ( x j ) β B ( x j ) 2 τ 2 , θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 .
• The Remarks of Definition 15
Remark A5.
If λ = 1 , the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) is reduced to the hybrid weighted Hamming distance measure d 2 H W Y ( A , B ) between LPFSs, which is given as follows:
d 2 H W Y ( A , B ) = j = 1 n ω j 2 max α A ( x j ) α B ( x j ) 2 τ , β A ( x j ) β B ( x j ) 2 τ , θ A ( x j ) θ B ( x j ) 2 τ + 1 2 α A ( x j ) α B ( x j ) 2 τ + β A ( x j ) β B ( x j ) 2 τ + θ A ( x j ) θ B ( x j ) 2 τ ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
If λ = 2 , the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) is reduced to the hybrid weighted Euclidean distance measure d 3 H W Y ( A , B ) between LPFSs, which is given as follows:
d 3 H W Y ( A , B ) = j = 1 n ω j 2 max α A ( x j ) α B ( x j ) 2 τ 2 , β A ( x j ) β B ( x j ) 2 τ 2 , θ A ( x j ) θ B ( x j ) 2 τ 2 + 1 2 α A ( x j ) α B ( x j ) 2 τ 2 + β A ( x j ) β B ( x j ) 2 τ 2 + θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 ,
where ω = ( ω 1 , ω 2 , , ω n ) is the weight vector of x j ( j = 1 , 2 , , n ) , and satisfies with j = 1 n ω j = 1 ( 0 ω j 1 ) .
Remark A6.
If ω j = 1 n for all j, the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) is reduced to hybrid normalized distance measure d 1 H N Y ( A , B ) between LPFSs, which is given as follows:
d 1 H N Y ( A , B ) = 1 2 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ λ , β A ( x j ) β B ( x j ) 2 τ λ , θ A ( x j ) θ B ( x j ) 2 τ λ + 1 2 α A ( x j ) α B ( x j ) 2 τ λ + β A ( x j ) β B ( x j ) 2 τ λ + θ A ( x j ) θ B ( x j ) 2 τ λ 1 λ ,
where λ 1 .
If ω j = 1 n for all j and λ = 1 , the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) is reduced to hybrid normalized Hamming distance measure d 2 H N Y ( A , B ) between LPFSs, which is given as follows:
d 2 H N Y ( A , B ) = 1 2 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ , β A ( x j ) β B ( x j ) 2 τ , θ A ( x j ) θ B ( x j ) 2 τ + 1 2 α A ( x j ) α B ( x j ) 2 τ + β A ( x j ) β B ( x j ) 2 τ + θ A ( x j ) θ B ( x j ) 2 τ .
If ω j = 1 n for all j and λ = 2 , the generalized hybrid weighted distance measure d 1 H W Y ( A , B ) is reduced to hybrid normalized Euclidean distance measure d 3 H N Y ( A , B ) between LPFSs, which is given as follows:
d 3 H N Y ( A , B ) = 1 2 n j = 1 n max α A ( x j ) α B ( x j ) 2 τ 2 , β A ( x j ) β B ( x j ) 2 τ 2 , θ A ( x j ) θ B ( x j ) 2 τ 2 + 1 2 α A ( x j ) α B ( x j ) 2 τ 2 + β A ( x j ) β B ( x j ) 2 τ 2 + θ A ( x j ) θ B ( x j ) 2 τ 2 1 2 .

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy set. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Cuong, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  4. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  5. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-II. Inf. Sci. 1975, 8, 301–357. [Google Scholar] [CrossRef]
  6. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-III. Inf. Sci. 1975, 9, 43–80. [Google Scholar] [CrossRef]
  7. Herrera, F.; Herrera-Viedma, E. Linguistic decision analysis: Steps for solving decision problems under linguistic information. Fuzzy Sets Syst. 2000, 115, 67–82. [Google Scholar] [CrossRef]
  8. Herrera, F.; Herrera-Viedma, E.; Martinez, L. A Fuzzy Linguistic Methodology to Deal With Unbalanced Linguistic Term Sets. IEEE Trans. Fuzzy Syst. 2008, 16, 354–370. [Google Scholar] [CrossRef]
  9. Martinezlopez, L.; Ruan, D.; Herrera, F.; Herreraviedma, E.; Wang, P.P. Linguistic decision-making: Tools and applications. Inf. Sci. 2009, 179, 2297–2298. [Google Scholar] [CrossRef]
  10. Rodríguez, R.M.; MartıNez, L.; Herrera, F. A group decision-making model dealing with comparative linguistic expressions based on hesitant fuzzy linguistic term sets. Inf. Sci. 2013, 241, 28–42. [Google Scholar] [CrossRef]
  11. Liao, H.; Xu, Z.; Zeng, X.J.; Merigó, J.M. Qualitative decision-making with correlation coefficients of hesitant fuzzy linguistic term sets. Knowl. Based Syst. 2015, 76, 127–138. [Google Scholar] [CrossRef]
  12. Chen, Z.; Liu, P.; Pei, Z. An approach to multiple attribute group decision-making based on linguistic intuitionistic fuzzy numbers. Int. J. Comput. Intell. Syst. 2015, 8, 747–760. [Google Scholar] [CrossRef] [Green Version]
  13. Ashraf, S.; Mehmood, T.; Abdullah, S.; Khan, Q. Picture fuzzy linguistic sets and their applications for multi-attribute group. Nucleus 2018, 55, 66–73. [Google Scholar]
  14. Zhang, X.; Wang, J.; Hu, J. On novel operational laws and aggregation operators of picture 2-tuple linguistic information for MCDM problems. Int. J. Fuzzy Syst. 2018, 20, 958–969. [Google Scholar] [CrossRef]
  15. Liu, P.; Zhang, X. A novel picture fuzzy linguistic aggregation operator and its application to group decision-making. Cogn. Comput. 2018, 10, 242–259. [Google Scholar] [CrossRef]
  16. Wei, G.; Alsaadi, F.E.; Hayat, T.; Alsaedi, A. Picture 2-tuple linguistic aggregation operators in multiple attribute decision-making. Soft Comput. 2018, 22, 989–1002. [Google Scholar] [CrossRef]
  17. Wu, X.; Liao, H. An approach to quality function deployment based on probabilistic linguistic term sets and ORESTE method for multi-expert multi-criteria decision-making. Inf. Fusion 2018, 43, 13–26. [Google Scholar] [CrossRef]
  18. Wei, G. Picture fuzzy cross-entropy for multiple attribute decision-making problems. J. Bus. Econ. Manag. 2016, 17, 491–502. [Google Scholar] [CrossRef] [Green Version]
  19. Wei, G. Picture 2-Tuple Linguistic Bonferroni Mean Operators and Their Application to Multiple Attribute Decision Making. Int. J. Fuzzy Syst. 2017, 19, 997–1010. [Google Scholar] [CrossRef]
  20. Wang, C.; Zhou, X.; Tu, H.; Tao, S. Some geometric aggregation operators based on picture fuzzy sets and their application in multiple attribute decision-making. Ital. J. Pure Appl. Math. 2017, 37, 477–492. [Google Scholar]
  21. Wang, L.; Zhang, H.; Wang, J.; Li, L. Picture fuzzy normalized projection-based VIKOR method for the risk evaluation of construction project. Appl. Soft Comput. 2018, 64, 216–226. [Google Scholar] [CrossRef]
  22. Singh, P. Correlation coefficients for picture fuzzy sets. J. Intell. Fuzzy Syst. 2015, 28, 591–604. [Google Scholar] [CrossRef]
  23. Wei, G. Picture fuzzy aggregation operators and their application to multiple attribute decision-making. J. Intell. Fuzzy Syst. 2017, 33, 713–724. [Google Scholar] [CrossRef]
  24. Son, L.H. Generalized picture distance measure and applications to picture fuzzy clustering. Appl. Soft Comput. 2016, 46, 284–295. [Google Scholar] [CrossRef]
  25. Son, L.H. Measuring analogousness in picture fuzzy sets: From picture distance measures to picture association measures. Fuzzy Optim. Decis. Mak. 2017, 16, 359–378. [Google Scholar] [CrossRef]
  26. Jana, C.; Senapati, T.; Pal, M.; Yager, R.R. Picture fuzzy Dombi aggregation operators: Application to MADM process. Appl. Soft Comput. 2019, 74, 99–109. [Google Scholar] [CrossRef]
  27. Xu, Z.; Xia, M. Distance and similarity measures for hesitant fuzzy sets. Inf. Sci. 2011, 181, 2128–2138. [Google Scholar] [CrossRef]
  28. Wang, W.; Xin, X. Distance measure between intuitionistic fuzzy sets. Pattern Recognit. Lett. 2005, 26, 2063–2069. [Google Scholar] [CrossRef]
  29. Liu, D.; Chen, X.; Peng, D. Some cosine similarity measures and distance measures between q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2019, 34, 1572–1587. [Google Scholar] [CrossRef]
  30. Li, D.; Zeng, W. Distance measure of Pythagorean fuzzy sets. Int. J. Intell. Syst. 2018, 33, 348–361. [Google Scholar] [CrossRef]
  31. Xiao, F.; Ding, W. Divergence measure of Pythagorean fuzzy sets and its application in medical diagnosis. Appl. Soft Comput. 2019, 79, 254–267. [Google Scholar] [CrossRef]
  32. Yoon, K.; Hwang, C.L. TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) Ca Multiple Attribute Decision Making; Springer: Berlin, Germany, 1981. [Google Scholar]
  33. Sajjad Ali Khan, M.; Abdullah, S.; Yousaf Ali, M.; Hussain, I.; Farooq, M. Extension of TOPSIS method base on Choquet integral under interval-valued Pythagorean fuzzy environment. J. Intell. Fuzzy Syst. 2018, 34, 267–282. [Google Scholar] [CrossRef]
  34. Liu, D.; Liu, Y.; Chen, X. Fermatean fuzzy linguistic set and its application in multicriteria decision-making. Int. J. Intell. Syst. 2018, 34, 878–894. [Google Scholar] [CrossRef]
  35. Chen, Z.-S.; Yang, Y.; Wang, X.-J.; Chin, K.-S.; Tsui, K.-L. Fostering linguistic decision-making under uncertainty: A proportional interval type-2 hesitant fuzzy TOPSIS approach based on Hamacher aggregation operators and andness optimization models. Inf. Sci. 2019, 500, 229–258. [Google Scholar] [CrossRef]
  36. Gomes, L.F.; Lima, M. TODIM: Basics and apllication to multicriteria ranking of projects with environmental impacts. Found. Control Eng. 1991, 16, 113–127. [Google Scholar]
  37. Gomes, L.F.; Rangel, L.S. An application of the TODIM method to the multicriteria rental evaluation of residential properties. Eur. J. Oper. Res. 2009, 193, 204–211. [Google Scholar] [CrossRef]
  38. Zhang, X.; Xu, Z. The TODIM analysis approach based on novel measured functions under hesitant fuzzy environment. Knowl. Based Syst. 2014, 61, 48–58. [Google Scholar] [CrossRef]
  39. 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] [Green Version]
  40. Liu, D.; Liu, Y.; Wang, L. Distance measure for Fermatean fuzzy linguistic term sets based on linguistic scale function: An illustration of the TODIM and TOPSIS methods. Int. J. Intell. Syst. 2019, 34, 2807–2834. [Google Scholar] [CrossRef]
  41. Xu, Z. A method based on linguistic aggregation operators for group decision-making with linguistic preference relations. Inf. Sci. 2004, 166, 19–30. [Google Scholar] [CrossRef]
  42. Chan, F.T.S.; Kumar, N. Global supplier development considering risk factors using fuzzy extended AHP-based approach. Omega 2007, 35, 417–431. [Google Scholar] [CrossRef]
  43. Krohling, R.A.; Pacheco, A.G.C.; Siviero, A.L.T. IF-TODIM: An intuitionistic fuzzy TODIM to multi-criteria decision-making. Knowl. Based Syst. 2013, 53, 142–146. [Google Scholar] [CrossRef]
  44. Boran, F.E.; Genc, S.; Kurt, M.; Akay, D. A multi-criteria intuitionistic fuzzy group decision-making for supplier selection with TOPSIS method. Expert Syst. Appl. 2009, 36, 11363–11368. [Google Scholar] [CrossRef]
Figure 1. The flow diagram of the proposed TOPSIS method.
Figure 1. The flow diagram of the proposed TOPSIS method.
Symmetry 12 01170 g001
Figure 2. The flow diagram of the proposed TODIM method.
Figure 2. The flow diagram of the proposed TODIM method.
Symmetry 12 01170 g002
Figure 3. The ranking results by T O P S I S with different λ .
Figure 3. The ranking results by T O P S I S with different λ .
Symmetry 12 01170 g003
Figure 4. The ranking results by T O D I M method with η = 2 , q = 2 and different λ .
Figure 4. The ranking results by T O D I M method with η = 2 , q = 2 and different λ .
Symmetry 12 01170 g004
Figure 5. The ranking results by T O D I M with λ = 3 , q = 2 and different η .
Figure 5. The ranking results by T O D I M with λ = 3 , q = 2 and different η .
Symmetry 12 01170 g005
Figure 6. The ranking results by T O D I M with λ = 3 , η = 2 and different q.
Figure 6. The ranking results by T O D I M with λ = 3 , η = 2 and different q.
Symmetry 12 01170 g006
Table 1. The linguistic picture fuzzy decision matrix A.
Table 1. The linguistic picture fuzzy decision matrix A.
C 1 C 2 C 3 C 4 C 5
A 1 ( s 6 , s 1 , s 1 ) ( s 4 , s 3 , s 1 ) ( s 4 , s 3 , s 1 ) ( s 5 , s 2 , s 1 ) ( s 4 , s 3 , s 1 )
A 2 ( s 4 , s 3 , s 1 ) ( s 4 , s 2 , s 2 ) ( s 4 , s 2 , s 1 ) ( s 5 , s 1 , s 1 ) ( s 6 , s 1 , s 1 )
A 3 ( s 4 , s 2 , s 1 ) ( s 5 , s 2 , s 1 ) ( s 6 , s 1 , s 1 ) ( s 4 , s 2 , s 1 ) ( s 4 , s 1 , s 2 )
A 4 ( s 4 , s 1 , s 2 ) ( s 5 , s 1 , s 1 ) ( s 3 , s 2 , s 1 ) ( s 4 , s 3 , s 1 ) ( s 3 , s 2 , s 2 )
Table 2. The normalized linguistic picture fuzzy decision matrix A ˜ .
Table 2. The normalized linguistic picture fuzzy decision matrix A ˜ .
C 1 C 2 C 3 C 4 C 5
A 1 ( s 1 , s 1 , s 6 ) ( s 4 , s 3 , s 1 ) ( s 4 , s 3 , s 1 ) ( s 5 , s 2 , s 1 ) ( s 1 , s 3 , s 4 )
A 2 ( s 1 , s 3 , s 4 ) ( s 4 , s 2 , s 2 ) ( s 4 , s 2 , s 1 ) ( s 5 , s 1 , s 1 ) ( s 1 , s 1 , s 6 )
A 3 ( s 1 , s 2 , s 4 ) ( s 5 , s 2 , s 1 ) ( s 6 , s 1 , s 1 ) ( s 4 , s 2 , s 1 ) ( s 2 , s 1 , s 4 )
A 4 ( s 2 , s 1 , s 4 ) ( s 5 , s 1 , s 1 ) ( s 3 , s 2 , s 1 ) ( s 4 , s 3 , s 1 ) ( s 2 , s 2 , s 3 )
Table 3. The entropy matrix of A ˜ .
Table 3. The entropy matrix of A ˜ .
C 1 C 2 C 3 C 4 C 5
A 1 0.3750.6250.6250.50.625
A 2 0.6250.750.6750.50.375
A 3 0.6250.50.3750.6250.625
A 4 0.6250.50.750.6250.875
Table 4. The separation distance of each alternative.
Table 4. The separation distance of each alternative.
A 1 A 2 A 3 A 4
D i + 0.18620.23850.10240.2055
D i 0.16070.13130.23660.2239
Table 5. Comparison results with other distance measures and existing methods.
Table 5. Comparison results with other distance measures and existing methods.
ApproachRanking   Results
Approach from Krohling et al. [43] A 3 A 4 A 1 A 2
Approach from Boran et al. [44] A 3 A 4 A 1 A 2
Approach based on L P F W A operator A 3 A 4 A 1 A 2
Approach based on L P F W G operator A 4 A 3 A 1 A 2
T O P S I S