Next Article in Journal
Numerical Solution of an Interval-Based Uncertain SIR (Susceptible–Infected–Recovered) Epidemic Model by Homotopy Analysis Method
Next Article in Special Issue
An Innovative Grey Approach for Group Multi-Criteria Decision Analysis Based on the Median of Ratings by Using Python
Previous Article in Journal
On a Class of Isoperimetric Constrained Controlled Optimization Problems
Previous Article in Special Issue
An Intelligent System for Allocating Times to the Main Activities of Managers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Decision-Making Approach Based on New Aggregation Operators under Fermatean Fuzzy Linguistic Information Environment

Department of Management Control and Information Systems, University of Chile, Av. Diagonal Paraguay 257, Santiago 8330015, Chile
Axioms 2021, 10(2), 113; https://doi.org/10.3390/axioms10020113
Submission received: 10 April 2021 / Revised: 27 May 2021 / Accepted: 31 May 2021 / Published: 4 June 2021
(This article belongs to the Special Issue Multiple-Criteria Decision Making)

Abstract

:
Fermatean fuzzy linguistic (FFL) set theory provides an efficient tool for modeling a higher level of uncertain and imprecise information, which cannot be represented using intuitionistic fuzzy linguistic (IFL)/Pythagorean fuzzy linguistic (PFL) sets. On the other hand, the linguistic scale function (LSF) is the better way to consider the semantics of the linguistic terms during the evaluation process. It is worth noting that the existing operational laws and aggregation operators (AOs) for Fermatean fuzzy linguistic numbers (FFLNs) are not valid in many situations, which can generate errors in real-life applications. The present study aims to define new robust operational laws and AOs under Fermatean fuzzy linguistic environment. To do so, first, we define some new modified operational laws for FFLNs based on LSF and prove some important mathematical properties of them. Next, the work defines several new AOs, namely, the FFL-weighted averaging (FFLWA) operator, the FFL-weighted geometric (FFLWG) operator, the FFL-ordered weighted averaging (FFLOWA) operator, the FFL-ordered weighted geometric (FFLOWG) operator, the FFL-hybrid averaging (FFLHA) operator and the FFL-hybrid geometric (FFLHG) operator under Fermatean fuzzy linguistic environment. Several properties of these AOs are investigated in detail. Further, based on the proposed AOs, a new decision-making approach with Fermatean fuzzy linguistic information is developed to solve group decision-making problems with multiple attributes. Finally, to illustrate the effectiveness of the present approach, a real-life supplier selection problem is presented where the evaluation information of the alternatives is given in terms of FFLNs. Compared to the existing methods, the salient features of the developed approach are (1) it can solve decision-making problems with qualitative information data using FFLNs; (2) It can consider the attitudinal character of the decision-makers during the solution process; (3) It has a solid ability to distinguish the optimal alternative.

1. Introduction

The intuitionistic fuzzy set (IFS) theory was introduced by Atanassov [1] in 1983 to accommodate uncertain and vague concepts more precisely in complex real-life situations. An IFS assigns each element a degree of membership (DM) and a degree of non-membership (DNM), whose sum is always less than or equal to one. It has become an important and widely studied generalization of fuzzy sets [2]. Due to the applicability and effectiveness of the IFS theory, several researchers started work in this direction and established many significant results. For aggregating different intuitionistic fuzzy numbers (IFNs), a large number of AOs have been defined by considering various aspects of available information [3,4,5,6]. The Bonferroni mean operators were studied in [7,8,9,10] to capture the interrelationship between aggregated IFNs. Verma [11] proposed prioritized weighted aggregation operators with intuitionistic fuzzy information based on Einstein t-norms. Zhenghai and Xu [12,13,14] undertook a detailed study on intuitionistic fuzzy calculus and explored its utility in decision-making problems. Besides, several information measures have been proposed under an intuitionistic fuzzy environment, including distance measure [15,16,17,18], similarity measure [19,20,21,22], entropy measure [23,24,25,26], divergence measure [27,28,29], and inaccuracy measure [30] and applied them in different application areas including pattern recognition, medical diagnosis, and decision making.

1.1. Literature Review

In 2013, Yager [31] and Yager and Abbasov [32] proposed the notion of the Pythagorean fuzzy sets (PFSs) as a new generalization to IFSs. PFSs are more effective in modeling imperfect or vague information, which cannot be represented in terms of IFSs. For example: suppose an expert provides the DM of an alternative corresponding to a criterion as 0.8 and the DNM as 0.5. As we see, the sum of both degrees is 1.3, which does not satisfy the essential condition of IFS. Further, if we consider the sum of the squares of both the degrees, i.e., 0.82 + 0.52 then we obtain 0.89 < 1; hence, this information can be represented in the form of PFS, not in IFS. In a short span, the PFS theory has become an efficient tool for solving various real-life problems. Zhang and Xu [33] extended the TOPSIS method under the Pythagorean fuzzy environment. Yager [34] proposed some novel AOs for aggregating Pythagorean fuzzy numbers (PFNs). The power AOs were studied by Wei and Lu [35] under a Pythagorean fuzzy environment. Yang et al. [36] defined some Pythagorean fuzzy Bonferroni mean operators using t-norms. Akram et al. [37] developed a two-phase group decision-making approach using the ELECTRE III method with Pythagorean fuzzy information. Ejegwa [38] defined a modified Zhang and Xu’s distance measure for solving pattern recognition problems with Pythagorean fuzzy information. Molla et al. [39] extended the PROMETHEE method with PFSs and utilized them in medical diagnosis. Bakioglu and Atahan [40] conducted a detailed study on prioritizing risks in self-driving vehicles based on hybrid approaches with Pythagorean fuzzy information.
Again, let us assume the DM as 0.9 and the DNM as 0.6 in the above-discussed example. It is clear that we do not express this information by using IFS and PFS. To cope with this problem, Senapati and Yager [41] proposed the concept of Fermatean fuzzy set (FFS), where the DM and DNM are both real numbers that lie between 0 and 1 and satisfy the condition 0 ≤ (DM)3 + (DNM)3 ≤ 1. The main advantage of the FFS is that it provides a better tool than IFS and PFS for handling the higher level of uncertainties arising in many real-life decision-making problems. As we obtain 0.93 + 0.63 < 1, hence FFS is an appropriate tool to capture this uncertain information. Later on, Senapati and Yager [42] defined some operations on FFSs and discussed their application in decision-making. To aggregate different Fermatean fuzzy numbers (FFNs), Senapati and Yager [43] developed some weighted averaging/geometric AOs and utilized them to solve decision-making problems with multiple criteria. Aydemir and Yilmaz Gunduz [44] used the TOPSIS method with Dombi AOs for solving decision-making problems with Fermatean fuzzy information. Mishra et al. [45] formulated a Fermatean fuzzy CRITIC-EDAS approach to select sustainable logistics providers.
In many real-life situations, due to the increase in complexities and uncertainties in practical decision problems, an expert feels difficulty expressing his/her preference information by exact numerical values. Besides, many attributes and criteria can be evaluated quickly and effectively in terms of linguistic values. Firstly, Zadeh [46,47] developed the idea of the linguistic term set (LTS) in 1975. For example—suppose an expert evaluates the performance of a motorbike, then he/she may use the terms “good”, “excellent”, etc., to express his/her evaluation information because linguistic terms (LTs) are very close to human cognition. In 2010, Wang and Li [48] developed a hybrid set theory by combining the notions of LTS and IFS in a single formulation, which is known as the intuitionistic linguistic fuzzy sets (ILFSs). In the literature, several research studies have been conducted under the intuitionistic linguistic fuzzy environment. Liu [49] proposed some generalized dependent AOs with intuitionistic linguistic fuzzy numbers (ILFNs) and studied their application in decision-making. Liu and Wang [50] defined some intuitionistic linguistic generalized power aggregation operators. Su et al. [51] studied ordered weighted distance averaging operators with intuitionistic linguistic fuzzy information. Yu et al. [52] presented an extended TODIM method for solving MAGDM problems with ILFNs.
Recently, Liu et al. [53] generalized the notion of ILFSs and introduced Fermatean fuzzy linguistic sets (FFLS) by integrating the idea of LTS with FFS. Besides, a MCDM approach was formulated for solving decision problems with Fermatean fuzzy linguistic information. Further, Liu et al. [54] defined some new distance and similarity measures between FFLSs based on linguistic scale function (LSF) and utilized them in the development of TODIM and TOPSIS methods. In conclusion, Fermatean fuzzy linguistic set theory has a broader scope of applications in different practical areas. However, a limited investigation has been conducted on FFLSs and their applications. It is also worth noting that the operational laws defined by Liu et al. [54] for FFLNs are not valid in general. Therefore, it is significant to pay attention to the research studies under the Fermatean fuzzy linguistic environment.

1.2. Objective and Contributions of the Work

The main objective of this work is to define the modified operational laws for Fermatean fuzzy linguistic numbers (FFLNs) and study different AOs based on them to aggregate Fermatean fuzzy linguistic information. To fulfill the aim of the proposed study, firstly, the work defines some new modified operational laws for FFLNs based on LSF, which overcome the drawbacks of the existing operational laws. We also study several essential properties of the proposed modified operational laws. Then, the paper develops several new AOs for aggregating different FFLNs and discusses several properties associated with them. Finally, a decision-making approach is formulated to solve MAGDM problems under the Fermatean fuzzy linguistic environment. The contributions of this paper can be summarized as follows:
1. 
New and improved operational laws are introduced for FFLNs with their properties.
2. 
Several new AOs such as the FFL-weighted averaging (FFLWA) operator, the FFL-weighted geometric (FFLWG) operator, the FFL-ordered weighted averaging (FFLOWA) operator, the FFL-ordered weighted geometric (FFLOWG) operator, the FFL-hybrid averaging (FFLHA) operator and the FFL-hybrid geometric (FFLHG) operator are defined for aggregating Fermatean fuzzy linguistic information.
3. 
A MAGDM method based on the proposed AOs is constructed to support the decision-making problems under Fermatean fuzzy linguistic environment.
4. 
A sensitivity analysis is also conducted to analyze the impact of different AOs on the ranking of the alternatives.

1.3. Organization of the Paper

The rest of the manuscript is organized as follows: In Section 2 we briefly review some preliminary results on linguistic variables (LVs), LSF, FFS, FFLS and discuss some significant drawbacks of the Fermatean fuzzy linguistic operational laws defined by Liu et al. [54]. Section 3 presents modified algebraic operational laws for FFLNs based on LSF and proves several important properties of FFLNs using proposed operation laws. Then, we define the FFLWA, FFLWG, FFLOWA, FFLOWG, FFLHA, and FFLHG AOs to aggregate different FFLNs. In Section 4, based on the developed AOs, a MAGDM approach is formulated for solving real-life decision problems with Fermatean fuzzy linguistic information. Then, a real-life supplier selection problem is given to illustrate the decision-making steps and effectiveness of the developed approach. In Section 5 we conclude the paper and discuss some future works.

2. Preliminaries

2.1. Linguistic Variables

The linguistic variable provides a useful tool to represent qualitative information in terms of linguistic values. According to Herrera and Martínez [55], the linguistic variable can be defined as follows:
Definition 1 
([55]).Let L ^ = { d | d = 0 , 1 . , 2 t } be a totally ordered discrete LTS with the odd cardinality. Any level d denotes a possible value for a linguistic variable and t is a positive integer. The LTS should meet the following properties:
i. 
i j i j ;
ii. 
n e g ( d ) = 2 t d ;
iii. 
max ( i , j ) = i i j ;
iv. 
min ( i , j ) = i i j ;
where neg denotes the negation operator.
For example, a well-known set of seven linguistic terms can be defined as:
L ^ = { 0 = N ( none ) , 1 = VL ( very   low ) , 2 = L ( low ) , 3 = M ( medium ) ,             4 = H (   high   ) , 5 = VH ( very   high ) , 6 = P ( perfect ) } .
Further, Xu [56] defined the extended continuous LTS L [ 0 , 2 t ] = { d | 0 d 2 t , d [ 0 , 2 t ] } , where, if d L , then d is called the original linguistic term (OLT), otherwise d is called the virtual linguistic term (VLT). However, d L is usually used by the decision-makers to evaluate attributes/alternatives while d L [ 0 , 2 t ] only appears in the calculation process.
Definition 2 
([56]).Let α , β L [ 0 , 2 t ] and λ , λ 1 , λ 2 [ 0 , 1 ] , then some operational laws are given as follows:
(i) 
α β = α + β ;
(ii) 
α β = α × β ;
(iii) 
λ α = λ α ;
(iv) 
λ ( α β ) = λ α λ β ;

2.2. Linguistic Scale Function

In the evaluation process, an expert uses LTs directly rather than their corresponding semantics. In general, the simplest way to deal with LTs is to use the levels of LTs directly. However, in different semantics decision-making environments, LTs have some differences in expressing evaluations. To resolve these issues, Wang et al. [57] defined the LSF to deal with linguistic information. According to the decision-making environment, experts can consider different LSFs, which express available linguistic information more flexibly and precisely in different semantic situations.
Definition 3 
([57]).Let L ^ = { d | d = 0 , 1 , 2 , , 2 t } be a discrete LTSs with the odd cardinality and κ d [ 0 , 1 ] be a real number, then the LSF φ can be defined as
φ : d κ d ,   d = 0 , 1 , 2 , , 2 t .
where φ is a strictly monotonically increasing function with respect to subscript d .
In general, there are three different linguistic scaling functions, given as
LSF 1 ([58]).
When the semantics of linguistic terms are uniformly (balanced) distributed, i.e., the absolute semantic gap (ASG) between any adjacent LTs is always equal.
φ 1 ( d ) = κ d = d 2 t ,   d = 0 , 1 , 2 , , 2 t .
LSF 2 ([58]).
When the ASG between two semantics of the adjacent LTs increases with the extension from t to both ends of LTS.
φ 2 ( d ) = κ d = { θ t θ t d 2 ( θ t 1 ) ,         d = 0 , 1 , 2 , , t , θ t + θ d t 2 2 ( θ t 1 ) , d = t + 1 , t + 2 , , 2 t ,
where θ is a threshold, which can be determined by a subjective method according to the specific problem, and it should be greater than or equal to 1. If the LTS is a set of seven terms, then θ [ 1.37 , 1.40 ] .
LSF 3 
([58]).When the ASG between two semantics of the adjacent LTs decreases with the extension from t to both ends of LTS.
φ 3 ( d ) = κ d = { t ρ ( t d ) ρ 2 t ρ ,                 d = 0 , 1 , 2 , , t , t τ + ( d t ) τ 2 t τ , d = t + 1 , t + 2 , , 2 t ,
where ρ , τ [ 0 , 1 ] are determined according to the specific problem. If the LTS is a set of seven terms, then ρ = τ = 0.8 .
Example 1.
Let L ^ = { 0 = N ( none ) , 1 = VL ( very   low ) , 2 = L ( low ) , 3 = M ( medium ) ,             4 = H (   high   ) , 5 = VH ( very   high ) , 6 = P ( perfect ) } be a LTS with seven terms.Figure 1, Figure 2 and Figure 3 show the balanced distribution of L ^ , unbalanced distribution of L ^ in an increasing trend and the unbalanced distribution of L ^ in a decreasing trend, respectively. Besides, Figure 4 represents the relationships between LTs of L ^ and their corresponding semantics under different situations.
Meanwhile, to avoid an information loss and to facilitate the calculation process, the LSF φ can be further generalized to an extended continuous LTS as follows:
Definition 4 
([57]).Let L ^ [ 0 , 2 t ] = { d | 0 d 2 t , d [ 0 , 2 t ] } be an extended continuous LTS and κ d [ 0 , 1 ] be a real number, then the LSF φ * is defined as
φ * : L ^ [ 0 , 2 t ] κ d
where φ * is also a strictly monotonically increasing function, and its inverse is expressed as φ * 1 .
Example 2.
Let L ^ [ 0 , 6 ] = { d | d [ 0 , 6 ] } be a continuous LTS, then the inverse corresponding to the LSFs φ 1 , φ 2 and φ 3 can be obtained as follows:
(1) If φ 1 ( d ) = κ d = d 6   ( d = [ 0 , 6 ] ) , then φ 1 1 ( κ d ) = 6 × κ d ( κ d [ 0 , 1 ] ) .
(2) If φ 2 ( d ) = κ d = { θ 3 θ 3 d 2 ( θ 3 1 ) ,           0 d 3 θ 3 + θ d 3 2 2 ( θ 3 1 ) ,   3 <   d 6 , then φ 2 1 ( κ d ) = { 3 log θ [ θ 3 ( 2 θ 3 2 ) κ d ] ,         κ d [ 0 , 0.5 ] , 3 + log θ [ ( 2 θ 3 2 ) κ d θ 3 + 2 ] , κ d ( 0.5 , 1 ] .  
(3) If φ 3 ( d ) = κ d = { 3 ρ ( 3 d ) ρ 2 × 3 ρ ,   0 d 3 3 τ + ( d 3 ) τ 2 × 3 τ ,   3 < d 6 , then φ 3 1 ( κ d ) = { 3 [ 3 ρ 2 × 3 ρ × κ d ] 1 / ρ , κ d [ 0 , 0.5 ] , 3 + [ 2 × 3 τ × κ d 3 τ ] 1 / τ , κ d ( 0.5 , 1 ] .  

2.3. Fermatean Fuzzy Linguistic Set

Definition 5 
([41]).A FFS F ^ in a fixed set X = { x 1 , x 2 , , x n } is given by
F ^ = { x j , ξ F ^ ( x j ) , ψ F ^ ( x j ) | x j X }
where ξ F ^ ( x j ) and ψ F ^ ( x j ) denote, respectively, the DM and DNM of x j X to the set F ^ , with the conditions ξ F ^ : X [ 0 , 1 ] , ψ F ^ : X [ 0 , 1 ] and 0 ( ξ F ^ ( x j ) ) 3 + ( ψ F ^ ( x j ) ) 3 1     x X .
For all x j X , the corresponding degree of hesitancy (DH) is defined as ζ F ^ ( x j ) = 1 ( ξ F ^ ( x j ) ) 3 ( ψ F ^ ( x j ) ) 3 3 . In the interest of simplicity, Senapati and Yager [41] called the pair ξ F ^ ( x j ) , ψ F ^ ( x j ) a FFLN and denoted by α = ξ α , ψ α , which satisfies the conditions ξ α [ 0 , 1 ] , ψ α [ 0 , 1 ] and 0 ( ξ α ) 3 + ( ψ α ) 3 1 .
Definition 6 
([53]).Let X = { x 1 , x 2 , , x n } be a fixed set and L ^ [ 0 , 2 t ] = { d | 0 d 2 t , d [ 0 , 2 t ] } be an extended continuous LTS, then a FFLS can be defined as
F = { x j , σ F ( x j ) , ξ F ( x j ) , ψ F ( x j ) | x j X }
where σ F ( x j ) L ^ [ 0 , 2 t ] , ξ F : X [ 0 , 1 ] and ψ F : X [ 0 , 1 ] , satisfying 0 ( ξ F ( x j ) ) 3 + ( ψ F ( x j ) ) 3 1     x j X . The numbers ξ F ( x j ) and ψ F ( x j ) represent, respectively, the DM and DNM of x j X to the linguistic term σ F ( x j ) . For all x j X , if ζ F ( x j ) = 1 ( ξ F ( x j ) ) 3 ( ψ F ( x j ) ) 3 3 , then ζ F ( x j ) is called the DH of x j X to σ F ( x j ) .
Note that when ξ F ( x j ) = 1 and ψ F ( x j ) = 0     x j X , the FFLS reduces to the LTS. In particular, when X has only one element, the FFLS is reduced into σ F ( x ) , ξ F ( x ) , ψ F ( x ) . For convenience, the triplet σ F ( x ) , ξ F ( x ) , ψ F ( x ) is called a FFLN and simply denoted by = σ ( ) , ξ , ψ , which meets the conditions ξ [ 0 , 1 ] , ψ [ 0 , 1 ] and 0 ( ξ ) 3 + ( ψ ) 3 1 . We indicate the collection of all FFLNs by Ω .
Definition 7 
([54]).Let L ^ [ 0 , 2 t ] be an extended continuous LTS, = σ ( ) , ξ , ψ , 1 = σ ( 1 ) , ξ 1 , ψ 1 and 2 = σ ( 2 ) , ξ 2 , ψ 2 be any three FFLNs, where σ ( ) , σ ( 1 ) , σ ( 2 ) L ^ [ 0 , 2 t ] . Further, consider that φ * and φ * 1 denote a linguistic scale function and its inverse function, respectively. Then, by using the LSF, some algebraic operational laws on FFLNs were defined by Liu et al. [54] as follows:
(i). 
1 2 = φ * 1 ( φ * ( σ ( 1 ) ) + φ * ( σ ( 2 ) ) ) , ξ 1 3 + ξ 2 3 ξ 1 3 ξ 2 3 3 , ψ 1 ψ 2 ;
(ii). 
1 2 = φ * 1 ( φ * ( σ ( 1 ) ) φ * ( σ ( 2 ) ) ) , ξ 1 ξ 2 , ψ 1 3 + ψ 2 3 ψ 1 3 ψ 2 3 3 ;
(iii). 
λ = φ * 1 ( λ φ * ( σ ( ) ) ) , 1 ( 1 ξ 3 ) λ 3 , ( ψ ) λ ,   λ 0 ;
(iv). 
λ = φ * 1 ( ( φ * ( σ ( ) ) ) λ ) , ( ξ ) λ , 1 ( 1 ψ 3 ) λ 3 ,   λ 0 ;
(v). 
n e g ( ) = φ * 1 ( φ * ( 2 t ) φ * ( σ ( ) ) ) , ψ , ξ .
Definition 8 
([54]).Let = σ ( ) , ξ , ψ be a FFLN and φ * be a LSF, the score and accuracy functions of are defined as
S ( ) = φ * ( σ ( ) ) × ( ξ 3 + 1 ψ 3 2 )   and   A ( ) = φ * ( σ ( ) ) × ( ξ 3 + ψ 3 )
For any two FFLNs 1 = σ ( 1 ) , ξ 1 , ψ 1 and 2 = σ ( 2 ) , ξ 2 , ψ 2 , the comparison rules between 1 and 2 are given as
(i).
If S ( 1 ) > S ( 2 ) ,   then   1 2 ;
(ii).
If S ( 1 ) = S ( 2 ) , then: (a) A ( 1 ) > A ( 2 ) ,   then   1 2 ; (b) A ( 1 ) = A ( 2 ) ,   then   1 = 2 .
Some shortcomings of the operational laws given in Definition 7
Here, we consider a numerical example in order to show the shortcomings of the operations on FFLNs defined by Liu et al. [54].
Example 3.
Let L ^ [ 0 , 6 ] = { d | d [ 0 , 6 ] } be an extended continuous LTS, 1 = 3 , 0.3 , 0.6 , 2 = 5 , 0.5 , 0.7 3 = 1 , 0 , 0.5 , 4 = 3 , 0 , 0.7 , 5 = 4 , 0.8 , 0 and 6 = 6 , 0.6 , 0 be six FFLNs. If φ * ( σ ( a ) ) = φ 2 ( σ ( a ) ) ( θ = 1.4 ) and λ = 4 , then according to the operational laws given in Definition 7, we have
(i). 
1 2 = φ 2 1 ( φ 2 ( 3 ) + φ 2 ( 5 ) ) , 0.3 3 + 0.5 3 0.3 3 0.5 3 3 , 0.6 × 0.7
= φ 2 1 ( 0.5000 + 0.7752 ) , 0.5279 , 0.4200 = φ 2 1 ( 1.2752 ) , 0.5279 , 0.4200 .
Here, we see that φ 2 ( 3 ) + φ 2 ( 5 ) = 1.2752 > 1 , therefore, φ 2 1 ( φ 2 ( 3 ) + φ 2 ( 5 ) ) = φ 2 1 ( 1.2752 ) is undefined.
(ii). 
1 3 = φ 2 1 ( φ 2 ( 3 ) φ 2 ( 1 ) ) , 0.3 × 0 , 0.6 3 + 0.5 3 0.6 3 × 0.5 3 3
= φ 2 1 ( 0.5000 × 0.2248 ) , 0.0000 , 0.6797 = 0.4619 , 0.0000 , 0.6797
and
1 4 = φ 2 1 ( φ 2 ( 3 ) φ 2 ( 3 ) ) , 0.3 × 0 , 0.6 3 + 0.7 3 0.6 3 × 0.7 3 3 = φ 2 1 ( 0.5000 + 0.5000 ) , 0.0000 , 0.7856 = 6 , 0.0000 , 0.7856
From Equations (9) and (10), it is clear that there is no effect of nonmembership values on the membership values of 1 3 and 1 4 . In general, if 1 = σ ( 1 ) , ξ 1 , ψ 1 , 2 = σ ( 2 ) , ξ 2 , ψ 2 and 3 = σ ( 3 ) , ξ 3 , ψ 3 are three different FFLNs satisfying, ξ 2 = ξ 3 = 0 , ψ 2 ψ 3 then we always obtain ξ 1 2 = ξ 1 3 = 0 . This outcome does not match our intuition.
(iii). 
2 5 = φ 2 1 ( φ 2 ( 5 ) + φ 2 ( 4 ) ) , 0.5 3 + 0.8 3 0.5 3 × 0.8 3 3 , 0.7 × 0 ,
= φ 2 1 ( 0.7752 + 0.6147 ) , 0.8306 , 0.0000 = φ 2 1 ( 1.3899 ) , 0.8306 , 0.0000
and
2 6 = φ 2 1 ( φ 2 ( 5 ) + φ 2 ( 6 ) ) , 0.5 3 + 0.6 3 0.5 3 × 0.6 3 3 , 0.7 × 0 = φ 2 1 ( 0.7752 + 1.0000 ) , 0.6797 , 0.0000 = φ 2 1 ( 1.7752 ) , 0.6797 , 0.0000
The obtained resulting values in Equations (11) and (12) indicate that there is no effect of the membership values on the nonmembership values of 2 5 and 2 6 . In general, if 1 = σ ( 1 ) , ξ 1 , ψ 1 , 2 = σ ( 2 ) , ξ 2 , ψ 2 and 3 = σ ( 3 ) , ξ 3 , ψ 3 are three different FFLNs satisfying, ξ 2 ξ 3 , ψ 2 = ψ 3 = 0 then we always obtain ψ 1 2 = ψ 1 3 = 0 . Additionally, φ 2 1 ( 1.3899 ) and φ 2 1 ( 1.7752 ) are undefined.
4 1 = φ 2 1 ( 4 × φ 2 ( 3 ) ) , 1 ( 1 0.3 3 ) 4 3 , ( 0.6 ) 4 = φ 2 1 ( 2.0000 ) , 0.4698 , 0.1296 ,
4 2 = φ 2 1 ( 4 × φ 2 ( 5 ) ) , 1 ( 1 0.5 3 ) 4 3 , ( 0.7 ) 4 = φ 2 1 ( 3.1008 ) , 0.7452 , 0.2401
From Equations (13) and (14), we can see that φ 2 1 ( 2.0000 ) and φ 2 1 ( 3.1008 ) are undefined because here κ d > 1 . Hence, 4 1 and 4 2 are not FFLNs.
Based on the above analysis, we conclude that the operational laws defined in Definition 7 are not suitable for FFLNs. Therefore, in order to nullify the above shortcomings, it is necessary to modify these operational laws. In the next section, we first define some new modified operational laws for FFLNs based on LSF and discuss their properties in detail. Then, we introduce some aggregation operators for aggregating different FFLNs.

3. Fermatean Fuzzy Aggregation Operators

3.1. Improved Operational Laws for FFLNs Based on LSF

Here, we define some improved operational laws for FFLNs, which overcome the shortcomings of the existing operations.
Definition 9.
Let L ^ [ 0 , 2 t ] be an extended continuous LTS, = σ ( ) , ξ , ψ , 1 = σ ( 1 ) , ξ 1 , ψ 1 and 2 = s σ ( 2 ) , ξ 2 , ψ 2 be three FFLNs, where σ ( ) , σ ( 1 ) , σ ( 2 ) L ^ [ 0 , 2 t ] . Further, consider that φ * and φ * 1 denote a linguistic scale function and its inverse function, respectively. The improved operational laws between them based on LSFs are defined as
(i) 
1 ˜ 2 = φ * 1 ( φ * ( σ ( 1 ) ) + φ * ( σ ( 2 ) ) φ * ( σ ( 1 ) ) φ * ( σ ( 2 ) ) ) , ξ 1 3 + ξ 2 3 ξ 1 3 ξ 2 3 3 ,   ψ 1 3 + ψ 2 3 ψ 1 3 ψ 2 3 ψ 1 3 ξ 2 3 ξ 1 3 ψ 2 3 3
= φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) ) , 1 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 3 ,   ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 3 ;
(ii) 
1 ˜ 2 = φ * 1 ( φ * ( σ ( 1 ) ) φ * ( σ ( 2 ) ) ) , ξ 1 3 + ξ 2 3 ξ 1 3 ξ 2 3 ξ 1 3 ψ 2 3 ψ 1 3 ξ 2 3 3 , ψ 1 3 + ψ 2 3 ψ 1 3 ψ 2 3 3 = φ * 1 ( φ * ( σ ( 1 ) ) φ * ( σ ( 2 ) ) ) , ( 1 ψ 1 3 ) ( 1 ψ 2 3 ) ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 3 , 1 ( 1 ψ 1 3 ) ( 1 ψ 2 3 ) 3 ;
(iii) 
λ ˜ = φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ ) , 1 ( 1 ξ 3 ) λ 3 , ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 ,   λ > 0 ;
(iv) 
^ ˜ λ = φ * 1 ( ( φ * ( σ ( ) ) ) λ ) , ( 1 ψ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 , 1 ( 1 ψ 3 ) λ 3 , λ > 0 .
Theorem 1.
The numbers 1 ˜ 2 , 1 ˜ 2 , λ ˜ , and ^ ˜ λ are also FFLNs.
Proof. 
Here, we shall prove only 1 ˜ 2 and λ ˜ are FFLNs, while others can be shown similarly. Since i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 ) are two FFLNs, where σ ( i ) L ^ [ 0 , 2 t ] , ξ i , ψ i [ 0 , 1 ] and 0 ξ i 3 + ψ i 3 1 , i = 1 , 2 . For σ ( 1 ) , σ ( 2 ) L ^ [ 0 , 2 t ] , based on the definition of the LSFs, we know 0 φ * ( σ ( 1 ) ) , φ * ( σ ( 2 ) ) 1 . Then, 0 1 ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) 1 φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) ) L ^ [ 0 , 2 t ] . Now 0 ξ 1 , ξ 2 1 , which implies 0 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 1 0 1 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 3 1 . Moreover, because 1 ξ 1 3 1 ξ 1 3 ψ 1 3 and 1 ξ 2 3 1 ξ 2 3 ψ 2 3 , then 0 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 3 1 .
Further ( 1 ( ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ) 3 ) 3 + ( ( ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ) ( ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) ) 3 ) 3 = 1 ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 1 . Thus, it shows that the a 1 ˜ a 2 is a FFLN.
For any λ > 0 , 0 1 ( 1 φ * ( σ ( ) ) ) λ 1 , which gives φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ ) L ^ [ 0 , 2 t ] . Additionally, 0 ξ 1 , ξ 2 , ψ 1 , ψ 2 1 , which implies 0 1 ( 1 ξ 3 ) λ 3 1 and 0 ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 1 .
Further ( 1 ( 1 ξ 3 ) λ 3 ) 3 + ( ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 ) 3 = 1 ( 1 ( ξ 3 + ψ 3 ) ) λ 1 . Hence, λ ˜ is also a FFLN.
This completes the proof. □
Example 4.
Let L ^ [ 0 , 6 ] = { d | d [ 0 , 6 ] } be an extended continuous LTS, = 2 , 0.4 , 0.5 , 1 = 3 , 0.3 , 0.6 , 2 = 5 , 0.5 , 0.7 be three FFLNs and λ = 5 . Then, according to the modified operation laws, we obtained the following results as shown in Table 1:
Further, if we consider Example 3 again and utilize the improved operational laws summarized in Definition 9, Table 2 presents the obtained results.
The obtained calculation results verify that the improved operational laws are more reasonable and realistic as per our intuition.
Theorem 2.
Let L ^ [ 0 , 2 t ] be an extended continuous LTS, and 1 = σ ( 1 ) , ξ 1 , ψ 1 , 2 = σ ( 2 ) , ξ 2 , ψ 2 and 3 = σ ( 3 ) , ξ 3 , ψ 3 be three FFLNs, where σ ( 1 ) , σ ( 2 ) , σ ( 3 ) L ^ [ 0 , 2 t ] . The following results hold:
(i). 
1 ˜ 2 = 2 ˜ 1 ;
(ii). 
1 ˜ 2 = 2 ˜ 1 ;
(iii). 
( 1 ˜ 2 ) ˜ 3 = 1 ˜ ( 2 ˜ 3 ) ;
(iv). 
( 1 ˜ 2 ) ˜ 3 = 1 ˜ ( 2 ˜ 3 ) .
Proof. 
The results follow directly from Definition 9, so we omit the proofs of them. □
Theorem 3. 
Let L ^ [ 0 , 2 t ] be an extended continuous LTS, = σ ( ) , ξ , ψ 1 = σ ( 1 ) , ξ 1 , ψ 1 , and 2 = σ ( 2 ) , ξ 2 , ψ 2 be three FFLNs and λ , λ 1 , λ 2 > 0 , where σ ( ) , σ ( 2 ) , σ ( 2 ) L ^ [ 0 , 2 t ] , then
(i). 
( λ ˜ 1 ) ˜ ( λ ˜ 2 ) = λ ˜ ( 1 ˜ 2 ) ;
(ii). 
( λ 1 ˜ ) ˜ ( λ 2 ^ ) = ( λ 1 + λ 2 ) ˜
(iii). 
( 1 ^ ˜ λ ) ˜ ( 2 ^ ˜ λ ) = ( 1 ˜ 2 ) ^ ˜ λ ;
(iv). 
( ^ ˜ λ 1 ) ˜ ( ^ ˜ λ 2 ) = ^ ˜ ( λ 1 + λ 2 ) ;
(v). 
λ 1 ˜ ( λ 2 ˜ ) = ( λ 1 λ 2 ) ˜ ;
(vi). 
( ^ ˜ λ 1 ) ^ ˜ λ 2 = ^ ˜ ( λ 1 λ 2 ) .
(vii). 
n e g ( 1 ˜ 2 ) = n e g ( 1 ) ˜ n e g ( 2 )
(viii). 
n e g ( 1 ˜ 2 ) = n e g ( 1 ) ˜ n e g ( 2 ) ;
(ix). 
( n e g ( ) ) ^ ˜ λ = n e g ( λ ˜ ) ;
(x). 
λ ˜ ( n e g ( ) ) = n e g ( ^ ˜ λ ) .
Proof. 
Here, we only prove the parts (i), (iii), (v), (vii), and (ix); the others can be proved similarly.
(i) From Definition 9, we have
λ ˜ 1 = φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) λ ) , 1 ( 1 ξ 1 3 ) λ 3 , ( 1 ξ 1 3 ) λ ( 1 ( ξ 1 3 + ψ 1 3 ) ) λ 3 ,
and
λ ˜ 2 = φ * 1 ( 1 ( 1 φ * ( σ ( 2 ) ) ) λ ) , 1 ( 1 ξ 2 3 ) λ 3 , ( 1 ξ 2 3 ) λ ( 1 ( ξ 2 3 + ψ 2 3 ) ) λ 3 ,
Using Equations (15) and (16), we obtain
( λ ˜ 1 ) ˜ ( λ ˜ 2 ) = φ * 1 ( 1 ( 1 φ * ( φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) λ ) ) ) ( 1 φ * ( φ * 1 ( 1 ( 1 φ * ( σ ( 2 ) ) ) λ ) ) ) ) , 1 ( 1 ( 1 ( 1 ξ 1 3 ) λ 3 ) 3 ) ( 1 ( 1 ( 1 ξ 1 3 ) λ 3 ) 3 ) 3 ,   ( 1 ( 1 ( 1 ξ 1 3 ) λ 3 ) 3 ) ( 1 ( 1 ( 1 ξ 2 3 ) λ 3 ) 3 )                         ( 1 ( ( 1 ( 1 ξ 1 3 ) λ 3 ) 3 + ( ( 1 ξ 1 3 ) λ ( 1 ( ξ 1 3 + ψ 1 3 ) ) λ 3 ) 3 ) )                       ( 1 ( ( 1 ( 1 ξ 2 3 ) λ 3 ) 3 + ( ( 1 ξ 2 3 ) λ ( 1 ( ξ 2 3 + ψ 2 3 ) ) λ 3 ) 3 ) ) 3 = φ * 1 ( 1 ( ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) ) λ ) , 1 ( ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ) λ 3 ,               ( ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ) λ ( ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) ) λ 3 = λ ˜ ( 1 ˜ 2 ) .
(iii) According to Definition 9, we have
1 ^ ˜ λ = φ * 1 ( ( φ * ( σ ( 1 ) ) ) λ ) , ( 1 ψ 1 3 ) λ ( 1 ( ξ 1 3 + ψ 1 3 ) ) λ 3 , 1 ( 1 ψ 1 3 ) λ 3 ,
and
2 ^ ˜ λ = φ * 1 ( ( φ * ( σ ( 2 ) ) ) λ ) , ( 1 ψ 2 3 ) λ ( 1 ( ξ 2 3 + ψ 2 3 ) ) λ 3 , 1 ( 1 ψ 2 3 ) λ 3 .
By Equations (17) and (18), we obtain
( 1 ^ ˜ λ ) ˜ ( 2 ^ ˜ λ ) = φ * 1 ( φ * ( φ * 1 ( ( φ * ( σ ( 1 ) ) ) λ ) ) φ * ( φ * 1 ( ( φ * ( σ ( 2 ) ) ) λ ) ) ) , ( ( 1 ( 1 ( 1 ψ 1 3 ) λ 3 ) 3 ) ( 1 ( 1 ( 1 ψ 2 3 ) λ 3 ) 3 ) ) ( ( 1 ( ( ( 1 ψ 1 3 ) λ ( 1 ( ξ 1 3 + ψ 1 3 ) ) λ 3 ) 3 + ( 1 ( 1 ψ 1 3 ) λ 3 ) 3 ) ) ( 1 ( ( ( 1 ψ 2 3 ) λ ( 1 ( ξ 2 3 + ψ 2 3 ) ) λ 3 ) 3 + ( 1 ( 1 ψ 2 3 ) λ 3 ) 3 ) ) ) 3   , 1 ( 1 ( 1 ( 1 ψ 1 3 ) λ 3 ) 3 ) ( 1 ( 1 ( 1 ψ 2 3 ) λ 3 ) 3 ) 3         = φ * 1 ( ( φ * ( σ ( 1 ) ) φ * ( σ ( 2 ) ) ) λ ) , ( ( 1 ψ 1 3 ) ( 1 ψ 2 3 ) ) λ ( ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) ) λ 3   , 1 ( ( 1 ψ 1 3 ) ( 1 ψ 2 3 ) ) λ 3 = ( 1 ˜ 2 ) ^ ˜ λ .
(v) For two positive real numbers λ 1 and λ 2 , we have
λ 1 ˜ ( λ 2 ˜ ) = λ 1 ( φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ 2 ) , 1 ( 1 ξ 3 ) λ 2 3 , ( 1 ξ 3 ) λ 2 ( 1 ( ξ 3 + ψ 3 ) ) λ 2 3 ) , = φ * 1 ( 1 ( 1 φ * ( φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ 2 ) ) ) λ 1 ) , 1 ( 1 ( 1 ( 1 ξ 3 ) λ 2 3 ) 3 ) λ 1 3 , ( 1 ( 1 ( 1 ξ 3 ) λ 2 3 ) 3 ) λ 1 ( 1 ( ( 1 ( 1 ξ 3 ) λ 2 3 ) 3 + ( ( 1 ξ 3 ) λ 2 ( 1 ( ξ 3 + ψ 3 ) ) λ 2 3 ) 3 ) ) λ 1 3 = φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ 1 λ 2 ) , 1 ( 1 ξ 3 ) λ 1 λ 2 3 , ( 1 ξ 3 ) λ 1 λ 2 ( 1 ( ξ 3 + ψ 3 ) ) λ 1 λ 2 3 = ( λ 1 λ 2 ) ˜
(vii) From Definitions 7 and 9, we have
n e g ( 1 ˜ 2 ) = φ * 1 ( φ * ( 2 t ) φ * ( φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) ) ) ) ,                 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 3 , 1 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 3 = φ * 1 ( φ * ( 2 t ) ( 1 ( 1 φ * ( σ ( 1 ) ) ) ( 1 φ * ( σ ( 2 ) ) ) ) ) ,             ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ( 1 ( ξ 1 3 + ψ 1 3 ) ) ( 1 ( ξ 2 3 + ψ 2 3 ) ) 3 , 1 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 3 = φ * 1 ( ( φ * ( 2 t ) φ * ( σ ( 1 ) ) ) ( φ * ( 2 t ) φ * ( σ ( 2 ) ) ) ) , ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) ( 1 ( ψ 1 3 + ξ 1 3 ) ) ( 1 ( ψ 2 3 + ξ 2 3 ) ) 3 , 1 ( 1 ξ 1 3 ) ( 1 ξ 2 3 ) 3 ; = n e g ( 1 ) ˜ n e g ( 2 )
(ix)  ( n e g ( ) ) ^ ˜ λ = ( φ * 1 ( φ * ( 2 t ) φ * ( σ ( ) ) ) , ψ , ξ ) λ
= φ * 1 ( ( φ * ( 2 t ) φ * ( σ ( ) ) ) λ ) , ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 , 1 ( 1 ξ 3 ) λ 3 = φ * 1 ( φ * ( 2 t ) φ * ( φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ ) ) ) , ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 , 1 ( 1 ξ 3 ) λ 3 = n e g ( φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) λ ) , 1 ( 1 ξ 3 ) λ 3 , ( 1 ξ 3 ) λ ( 1 ( ξ 3 + ψ 3 ) ) λ 3 ) = n e g ( λ ˜ ) .
This completes the proof. □
Next, by utilizing proposed improved operational laws on FFLNs, we propose some arithmetic and geometric aggregation operators for fusing a collection of FFLNs i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) .

3.2. FFL-Weighted Average (FFLWA) Operator

The weighted average (WA) is the most commonly used mean operator in a wide range of application areas. Here, we extend the idea of WA to the Fermetean fuzzy linguistic information environment and propose the following formal definition.
Definition 10.
Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of FFLNs. The FFL-weighted average (FFLWA) operator is a mapping FFLWA : Ω n Ω , such that
FFLWA ( 1 , 2 , , n ) = ˜ i = 1 n ( w i ˜ i ) ,
where w = ( w 1 , w 2 , , w n ) T is the weight vector of i with w i [ 0 , 1 ] , i = 1 n w i = 1 . Especially when w = ( 1 n , 1 n , , 1 n ) T , the FFLWA operator reduces to FFL-average (FFLA) operator, which is defined as
FFLWA ( 1 , 2 , , n ) = 1 n ˜ ( ˜ i = 1 n i ) .
Theorem 4.
Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of n FFLNs and w = ( w 1 , w 2 , , w n ) T be the weight vector of i with w i [ 0 , 1 ] , i = 1 n w i = 1 , then the aggregated value by using the FFLWA operator is also a FFLN and
FFLWA ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,                                 i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 .
Proof. 
The first result directly holds from Theorem 1. Using the principle of mathematical induction, we shall prove the result stated in Equation (21). Firstly, for n = 2 , by Definition 9, we obtain
w 1 ˜ 1 = φ * 1 ( 1 ( 1 φ * ( σ ( 1 ) ) ) w 1 ) , 1 ( 1 ξ 1 3 ) w 1 3 , ( 1 ξ 1 3 ) w 1 ( 1 ( ξ 1 3 + ψ 1 3 ) ) w 1 3 , w 2 ˜ 2 = φ * 1 ( 1 ( 1 φ * ( σ ( 2 ) ) ) w 2 ) , 1 ( 1 ξ 2 3 ) w 2 3 , ( 1 ξ 2 3 ) w 2 ( 1 ( ξ 2 3 + ψ 2 3 ) ) w 2 3 } .
Hence,
FFLWA ( 1 , 2 ) = φ * 1 ( 1 i = 1 2 ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 2 ( 1 ξ i 3 ) w i 3 ,                                 i = 1 2 ( 1 ξ i 3 ) w i i = 1 2 ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3
Hence, the result is valid for n = 2 .
Next, assume that Equation (21) is true for n = k , i.e.,
FFLWA ( 1 , 2 , , k ) = φ * 1 ( 1 i = 1 k ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 k ( 1 ξ i 3 ) w i 3 ,                               i = 1 k ( 1 ξ i 3 ) w i i = 1 k ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 .
Then, for n = k + 1 , by Definition 10, we have
FFLWA ( 1 , 2 , , k , k + 1 ) = FFLWA ( 1 , 2 , , k ) ˜ ( w k + 1 ˜ k + 1 ) = φ * 1 ( 1 i = 1 k ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 k ( 1 ξ i 3 ) w i 3 ,               i = 1 k ( 1 ξ i 3 ) w i i = 1 k ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 ˜ σ ( k + 1 ) , ξ k + 1 , ψ k + 1 = φ * 1 ( 1 i = 1 k ( 1 φ * ( σ ( i ) ) ) w i ( 1 φ * ( σ ( k + i ) ) ) w k + i ) , 1 i = 1 k ( 1 ξ i 3 ) w i ( 1 ξ k + 1 3 ) w k + 1 3 ,             i = 1 k ( 1 ξ i 3 ) w i ( 1 ξ k + 1 3 ) w k + 1 i = 1 k ( 1 ( ξ i 3 + ψ i 3 ) ) w i ( 1 ( ξ k + 1 3 + ψ k + 1 3 ) ) w k + 1 3 = φ * 1 ( 1 i = 1 k + 1 ( 1 φ * ( σ ( a i ) ) ) w i ) , 1 i = 1 k + 1 ( 1 ξ i 3 ) w i 3 ,                     i = 1 k + 1 ( 1 ξ i 3 ) w i i = 1 k + 1 ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3
i.e., the Equation (21) holds for n = k + 1 .
This proves the theorem. □
Theorem 5. 
The FFLWA operator, defined in Equation (21), holds the following properties:
(P1) (Idempotency): If i = = σ ( ) , ξ , ψ i , then
FFLWA ( 1 , 2 , , n ) = .
(P2) (Monotonicity): Let i = σ ( i ) , ξ i , ψ i and i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be two collections of FFLNs such that   σ ( i ) σ ( i ) , ξ i 3 ξ i 3 , ξ i 3 + ψ i 3 ξ i 3 + ψ i 3   i , then
FFLWA ( 1 , 2 , , n ) FFLWA ( 1 , 2 , , n ) .
(P3) (Boundedness): Let
= min ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , min ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) , max { 0 , ( max ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                                           min ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) ) } ,
and
+ = max ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , max ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) , ( min ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                                               max ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) ) ,
then
FFLWA ( 1 , 2 , , n ) + .
(P4): If = s σ ( ) , ξ , ψ is another FFLN, then
FFLWA ( 1 ˜ , 2 ˜ , , n ˜ ) = FFLWA ( 1 , 2 , , n ) ˜ .
(P5): Let ϑ > 0 be a real number, then
FFLWA ( ϑ ˜ 1 , ϑ ˜ 2 , , ϑ ˜ n ) = ϑ ˜ ( FFLWA ( 1 , 2 , , n ) ) .
(P6): Let = s σ ( ) , ξ , ψ be another FFLN and ϑ > 0 be a real number, then
FFLWA ( ( ϑ ˜ 1 ) ˜ , ( ϑ ˜ 2 ) ˜ , , ( ϑ ˜ n ) ˜ ) = ( ϑ ˜ ( FFLWA ( 1 , 2 , , n ) ) ) ˜ b .
(P7): Let i = σ ( i ) , ξ i , ψ i and i = s σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be two collections of FFLNs, then
FFLWA ( 1 ˜ 1 , 2 ˜ 2 , , n ˜ n ) = FFLWA ( 1 , 2 , , n ) ˜ FFLWA ( 1 , 2 , , n ) .
Proof. 
(P1) Assume that i = = σ ( ) , ξ , ψ i , then
FFLWA ( 1 , 2 , , n ) = FFLWA ( , , , ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( ) ) ) w i ) , 1 i = 1 n ( 1 ξ 3 ) w i 3 ,                                             i = 1 n ( 1 ξ 3 ) w i i = 1 n ( 1 ( ξ 3 + ψ 3 ) ) w i 3 = φ * 1 ( 1 ( 1 φ * ( σ ( ) ) ) w 1 + w 2 + + w n ) , 1 ( 1 ξ 3 ) w 1 + w 2 + + w n 3 ,                                         ( 1 ξ 3 ) w 1 + w 2 + + w n ( 1 ( ξ 3 + ψ 3 ) ) w 1 + w 2 + + w n 3                               = σ ( ) , ξ , ψ = .
(P2) Since   σ ( i ) σ ( i ) and φ * is a strictly monotonically increasing function, then
σ ( i ) σ ( i ) 1 φ * ( σ ( i ) ) 1 - φ * ( σ ( i ) )                                                   φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) } .
As ξ i 3 ξ i 3 ( i = 1 , 2 , , n )   and   ξ i 3 + ψ i 3 ξ i 3 + ψ i 3 ( i = 1 , 2 , , n ) , we have
1 i = 1 n ( 1 ξ i 3 ) w i 3 1 i = 1 n ( 1 ξ i 3 ) w i 3 i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 } .
According to Definition 10, we have
FFLWA ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,                   i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 ,
and
FFLWA ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,                       i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3
Now, using Definition 8, we obtain S ( FFLWA ( 1 , 2 , , n ) ) S ( FFLWA ( 1 , 2 , , n ) ) , which gives
FFLWA ( 1 , 2 , , n ) FFLWA ( 1 , 2 , , n ) .
(P3) It directly follows from Property 2.
(P4) Since, so
i ˜ = φ * 1 ( 1 ( 1 φ * ( σ ( i ) ) ) ( 1 φ * ( σ ( ) ) ) ) , 1 ( 1 ξ i 3 ) ( 1 ξ 3 ) 3 ,   ( 1 ξ i 3 ) ( 1 ξ 3 ) ( 1 ( ξ i 3 + ψ i 3 ) ) ( 1 ( ξ 3 + ψ 3 ) ) 3
Therefore,
FFLWA ( 1 ˜ , 2 ˜ , , n ˜ ) = φ * 1 ( 1 i = 1 n ( ( 1 φ * ( σ ( i ) ) ) ( 1 φ * ( σ ( ) ) ) ) w i ) , 1 i = 1 n ( ( 1 ξ i 3 ) ( 1 ξ 3 ) ) w i 3 ,   i = 1 n ( ( 1 ξ i 3 ) ( 1 ξ 3 ) ) w i i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) ( 1 ( ξ 3 + ψ 3 ) ) ) w i 3 = φ * 1 ( 1 ( i = 1 n ( ( 1 φ * ( σ ( i ) ) ) ) w i ) ( 1 φ * ( σ ( ) ) ) ) , 1 ( i = 1 n ( 1 ξ i 3 ) w i ) ( 1 ξ 3 ) 3 ,   ( i = 1 n ( 1 ξ i 3 ) w i ) ( 1 ξ 3 ) ( i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i ) ( 1 ( ξ 3 + ψ 3 ) ) 3 = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,                                                     i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 ˜ σ ( ) , ξ , ψ = FFLWA ( 1 , 2 , , n ) ˜ .
(P5) For any ϑ > 0 , we have
ϑ ˜ i = φ * 1 ( 1 ( 1 φ * ( σ ( i ) ) ) ϑ ) , 1 ( 1 ξ i 3 ) ϑ 3 , ( 1 ξ i 3 ) ϑ ( 1 ( ξ i 3 + ψ i 3 ) ) ϑ 3 .
Therefore,
FFLWA ( ϑ ˜ 1 , ϑ ˜ 2 , , ϑ ˜ n ) = φ * 1 ( 1 i = 1 n ( ( 1 φ * ( σ ( i ) ) ) ϑ ) w i ) , 1 i = 1 n ( ( 1 ξ i 3 ) ϑ ) w i 3 ,                                                   i = 1 n ( ( 1 ξ i 3 ) ϑ ) w i i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) ϑ ) w i 3 = φ * 1 ( 1 i = 1 n ( ( 1 φ * ( σ ( i ) ) ) w i ) ϑ ) , 1 i = 1 n ( ( 1 ξ i 3 ) w i ) ϑ 3 ,                                               i = 1 n ( ( 1 ξ i 3 ) w i ) ϑ i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) w i ) ϑ 3 = ϑ ˜ ( FFLWA ( 1 , 2 , , n ) ) .
(P6) From Property 4, we know
FFLWA ( 1 ˜ , 2 ˜ , , n ˜ ) = FFLWA ( 1 , 2 , , n ) ˜ ,
and according to Property 5, we have
FFLWA ( ϑ ˜ 1 , ϑ ˜ 2 , , ϑ ˜ n ) = ϑ ˜ ( FFLWA ( 1 , 2 , , n ) ) . ,
From Equations (36) and (37), we obtain the desired results.
(P7) Since i , i Ω , then
i ˜ i = φ * 1 ( 1 ( 1 φ * ( σ ( i ) ) ) ( 1 φ * ( σ ( i ) ) ) ) , 1 ( 1 ξ i 3 ) ( 1 ξ i 3 ) 3 ,   ( 1 ξ i 3 ) ( 1 ξ i 3 ) ( 1 ( ξ i 3 + ψ i 3 ) ) ( 1 ( ξ i 3 + ψ i 3 ) ) 3 .
Therefore,
FFLWA ( 1 ˜ 1 , 2 ˜ 2 , , n ˜ n ) = φ * 1 ( 1 i = 1 n ( ( 1 φ * ( σ ( i ) ) ) ( 1 φ * ( σ ( i ) ) ) ) w i ) , 1 i = 1 n ( ( 1 ξ i 3 ) ( 1 ξ i 3 ) ) w i 3 ,   i = 1 n ( ( 1 ξ i 3 ) ( 1 ξ i 3 ) ) w i i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) ( 1 ( ξ i 3 + ψ i 3 ) ) ) w i 3 = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ξ i 3 ) w i 3 ,   i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( ρ i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,   i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 ˜ φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( i ) ) ) w i ) , 1 i = 1 n ( 1 ξ i 3 ) w i 3 ,   i = 1 n ( 1 ξ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 = FFLWA ( 1 , 2 , , n ) ˜ FFLWA ( 1 , 2 , , n ) .
This proves the theorem. □

3.3. FFL-Ordered Weighted Average (FFLOWA) Operator

The ordered weighted averaging (OWA) operator [59] is an aggregation operator that provides a parameterized family of aggregation operators between the minimum and the maximum. In this subsection, we extend the idea of the FFLWA operator into the FFLOWA operator based on the OWA operator.
Definition 11.Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of FFLNs, the FFLOWA operator of dimension n is a mapping FFLOWA : Ω n Ω , that has an associated weight vector ω = ( ω 1 , ω 2 , , ω n ) T such that ω i [ 0 , 1 ] and i = 1 n ω i = 1 , then
FFLOWA ( 1 , 2 , , n ) = ˜ i = 1 n ( ω i ˜ ϕ ( i ) ) ,
where ϕ ( i ) is the i t h largest value of i ( i = 1 , 2 , , n ) .
Theorem 6. 
Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of FFLNs, then the aggregated value by using the FFLOWA operator is also a FFLN and
FFLOWA ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( ϕ ( i ) ) ) ) ω i ) , 1 i = 1 n ( 1 ξ ϕ ( i ) 3 ) ω i 3 ,                                           i = 1 n ( 1 ξ ϕ ( i ) 3 ) ω i i = 1 n ( 1 ( ξ ϕ ( i ) 3 + ψ ϕ ( i ) 3 ) ) ω i 3 .
Proof. 
The proof of this theorem is similar to Theorem 4, so it is omitted here. □
It can be easily proved that the FFLOWA operator holds the following properties.
(P1) (Idempotency): If i = = σ ( ) , ξ , ψ   i , then
FFLOWA ( 1 , 2 , , n ) = .
(P2) (Monotonicity): Let i = σ ( i ) , ξ i , ψ i and i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be two collections of FFLNs such that   σ ( i ) σ ( i ) , ξ i ξ i , ξ i + ψ i ξ i + ψ i   i , then
FFLOWA ( 1 , 2 , , n ) FFLOWA ( 1 , 2 , , n ) .
(P3) (Boundedness): Let
= min ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , min ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) , max { 0 , ( max ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                           min ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) ) } ,
and
+ = max ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , max ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) , ( min ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                 max ( ξ 1 3 , ξ 2 3 , , ξ n 3 ) )
then
FFLOWA ( 1 , 2 , , n ) + .
P4 (Commutativity): Let ( 1 , 2 , , , n ) be any permutation of ( 1 , 2 , , n ) , then
FFLOWA ( 1 , 2 , , n ) = FFLOWA ( 1 , 2 , , , n ) .
Further, motivated by the idea of geometric mean and ordered weighted geometric operator [60], we develop the FFLWG operator and the FFLOWG operator.

3.4. FFL-Weighted Geometric (FFLWG) Operator

This subsection extends the notion of weighted geometric mean to the Fermetean fuzzy linguistic information environment and defines the FFL-weighted geometric operator as follows:
Definition 12. 
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of FFLNs. The FFL-weighted geometric (FFLWG) operator is a mapping FFLWG : Ω n Ω , such that
FFLWG ( 1 , 2 , , n ) = ˜ i = 1 n ( i ^ ˜ w i ) ,
where w = ( w 1 , w 2 , , w n ) T denotes the weight vector of i with w i [ 0 , 1 ] , i = 1 n w i = 1 . Especially, in the case of w = ( 1 n , 1 n , , 1 n ) T , the FFLWG operator is reduced into FFLG operator expressed as
FFLG ( a 1 , a 2 , , a n ) = ˜ i = 1 n ( i ^ ˜ 1 n ) .
Theorem 7. 
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of FFLNs, then the aggregated value by using the FFLWG operator is also a FFLN and
FFLWG ( 1 , 2 , , n ) = φ * 1 ( i = 1 n ( φ * ( σ ( i ) ) ) w i ) , i = 1 n ( 1 ψ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 , 1 i = 1 n ( 1 ψ i 3 ) w i 3 .
Proof. 
Based on improved operational laws on FFLNs mentioned in Definition 9, Theorem 6 is evident from Theorems 4. □
Theorem 8. 
The FFLWG operator satisfies the following properties:
(P1) (Idempotency): If i = = σ ( ) , ξ , ψ     i , then
FFLWG ( 1 , 2 , , n ) = .
(P2) (Monotonicity): Let i = σ ( i ) , ξ i , ψ i and i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be two collections of FFLNs such that σ ( i ) σ ( i ) , ψ i ψ i , ξ i + ψ i ξ i + ψ i   i , then
FFLWG ( 1 , 2 , , n ) FFLWG ( 1 , 2 , , n ) .
(P3) (Boundedness): Let
= min ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , max { 0 , ( min ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                                 max ( ψ 1 , ψ 2 , , ψ n ) ) } , max ( ψ 1 , ψ 2 , , ψ n )
and
+ = max ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) , ( max ( ξ 1 3 + ψ 1 3 , ξ 2 3 + ψ 2 3 , , ξ n 3 + ψ n 3 )                                             min ( ψ 1 3 , ψ 1 3 , , ψ 1 3 ) ) , min ( ψ 1 3 , ψ 1 3 , , ψ 1 3 ) ,
then
FFLWG ( 1 , 2 , , n ) + .
(P4): If = σ ( ) , ξ , ψ is another FFLN, then
FFLWG ( 1 ˜ , 2 ˜ , , n ˜ ) = FFLWG ( 1 , 2 , , n ) ˜ .
(P5): If ϑ > 0 is a real number, then
FFLWG ( 1 ^ ˜ ϑ , 2 ^ ˜ ϑ , , n ^ ˜ ϑ ) = ( FFLWFG ( 1 , 2 , , n ) ) ^ ˜ ϑ .
(P6): Let = σ ( ) , ξ , ψ be another FFLN and ϑ > 0 be a real number, then
FFLWG ( ( 1 ^ ˜ ϑ ) ˜ , ( 2 ^ ˜ ϑ ) ˜ , , ( n ^ ˜ ϑ ) ˜ ) = ( ( FFLWG ( 1 , 2 , , n ) ) ^ ˜ ϑ ) ˜ .
(P7): Let i = σ ( i ) , ξ i , ψ i and i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be two collections of FFLNs, then
FFLWG ( 1 ˜ 1 , 2 ˜ 2 , , n ˜ n ) = FFLWG ( 1 , 2 , , n ) ˜ FFLWG ( 1 , 2 , , n ) .
Proof. 
Here, we prove the properties 4 and 5 only, and others can proceed likewise. □
(P4) From Definition 9, we have
i ˜ = φ * 1 ( φ * ( σ ( i ) ) φ * ( σ ( ) ) ) , ( 1 ψ i 3 ) ( 1 ψ 3 ) ( 1 ( ξ i 3 + ψ i 3 ) ) ( 1 ( ξ 3 + ψ 3 ) ) 3 , 1 ( 1 ψ i 3 ) ( 1 ψ 3 ) 3
Therefore
FFLWG ( 1 ˜ , 2 ˜ , , n ˜ ) = φ * 1 ( i = 1 n ( φ * ( σ ( i ) ) φ * ( σ ( ) ) ) w i ) , i = 1 n ( ( 1 ψ i 3 ) ( 1 ψ 3 ) ) w i i = 1 n ( ( 1 ( ξ i 3 + ψ 1 3 ) ) ( 1 ( ξ 3 + ψ 3 ) ) ) w i 3 , 1 i = 1 n ( ( 1 ψ 3 ) ( 1 ψ 3 ) ) w i 3 = φ * 1 ( i = 1 n ( φ * ( σ ( i ) ) ) w i φ * ( σ ( ) ) ) , ( i = 1 n ( 1 ψ i 3 ) w i ) ( 1 ψ i 3 ) ( i = 1 n ( 1 ( ξ i 3 + ψ 1 3 ) ) w i ) ( 1 ( ξ i 3 + ψ i 3 ) ) 3 , 1 ( i = 1 n ( 1 ψ i 3 ) w i ) ( 1 ψ i 3 ) 3 = φ * 1 ( i = 1 n ( φ * ( σ ( i ) ) ) w i ) , i = 1 n ( 1 ψ i 3 ) w i i = 1 n ( 1 ( ξ i 3 + ψ i 3 ) ) w i 3 , 1 i = 1 n ( 1 ψ i 3 ) w i 3 ˜ σ ( ) , ξ , ψ = FFLWG ( 1 , 2 , , n ) ˜
(P5) Using Definition 9, we obtain
i ^ ˜ ϑ = φ * 1 ( ( φ * ( σ ( i ) ) ) ϑ ) , ( 1 ψ i 3 ) ϑ ( 1 ( ξ i 3 + ψ i 3 ) ) ϑ 3 , 1 ( 1 ψ i 3 ) ϑ 3
Therefore
FFLWG ( 1 ^ ˜ ϑ , 2 ^ ˜ ϑ , , n ^ ˜ ϑ ) = φ * 1 ( i = 1 n ( ( φ * ( σ ( i ) ) ) ϑ ) w i ) , i = 1 n ( ( 1 ψ i 3 ) ϑ ) w i i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) ϑ ) w i 3 , 1 i = 1 n ( ( 1 ψ i 3 ) ϑ ) w i 3 = φ * 1 ( i = 1 n ( ( φ * ( σ ( i ) ) ) w i ) ) ϑ , i = 1 n ( ( 1 ψ i 3 ) w i ) ϑ i = 1 n ( ( 1 ( ξ i 3 + ψ i 3 ) ) w i ) ϑ 3 , 1 i = 1 n ( ( 1 ψ i 3 ) w i ) ϑ 3 = ( FFLWFG ( 1 , 2 , , n ) ) ^ ˜ ϑ .

3.5. FFL-Ordered Weighted Geometric (FFLOWG) Operator

The ordered weighted geometric (OWG) operator [60] is a common aggregation operator in the field of information fusion. However, the existing OWG operator cannot aggregate FFLNs. Now, we define the FFLOWG operator based on the notion of the OWG operator to aggregate FFLNs.
Definition 13. 
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of FFLNs, the FFLOWG operator of dimension n is a mapping FFLOWG : Ω n Ω , that has an associated weight vector ω = ( ω 1 , ω 2 , , ω n ) T such that ω i [ 0 , 1 ] and i = 1 n ω i = 1 , then
FFLOWG ( 1 , 2 , , n ) = ˜ i = 1 n ( ϕ ( i ) ^ ˜ ω i ) ,
where ϕ ( i ) is the i t h largest value of i ( i = 1 , 2 , , n ) .
Theorem 9. 
Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of FFLNs, then the aggregated value by the FFLOWG operator is also a FFLN and
FFLOWG ( 1 , 2 , , n ) = φ * 1 ( i = 1 n ( φ * ( σ ( ϕ ( i ) ) ) ) ω i ) , i = 1 n ( 1 ψ ϕ ( i ) 3 ) ω i i = 1 n ( 1 ( ξ ϕ ( i ) 3 + ψ ϕ ( i ) 3 ) ) ω i 3 1 i = 1 n ( 1 ψ ϕ ( i ) 3 ) ω i 3  
Proof. 
We can derive the proof similar to Theorem 4, so we omit it here. □
Moreover, the FFLOWG operator also satisfies properties such as idempotency, monotonicity, boundedness, and commutativity.

3.6. FFL-Hybrid Average (FFLHA) Operator and FFL-Hybrid Geometric (FFLHG) Operator

From Definitions 10 to 13, we know that the FFLWA and FFLWG AOs only weight the FFLNs, while the FFLOWA and FFLOWG AOs weight the ordered position of the FFLNs instead of weighting the FFLNs itself. In both cases, the weights address different aspects during the aggregation process of the FFLNs. However, the developed aggregation operators for FFLNs consider only one of them. The hybrid averaging (HA) operator [61] is an aggregation operator that uses the weighted average (WA) and the ordered weighted averaging (OWA) operator in the same formulation. In the following, we propose the FFL-hybrid average (FFLHA) operator and the FFL-hybrid geometric (FFLHG) operator.
Definition 14. 
Let i = σ ( i ) , ξ i , ψ i ( i = 1 , 2 , , n ) be a collection of FFLNs, the FFL-hybrid average (FFLHA) operator of dimension n is a mapping FFLHA : Ω n Ω , that has an associated weight vector ω = ( ω 1 , ω 2 , , ω n ) T such that ω i [ 0 , 1 ] and i = 1 n ω i = 1 , then
FFLHA ( 1 , 2 , , n ) = ˜ i = 1 n ( ω i ˜ ˙ ϕ ( i ) )
where ˙ ϕ ( i ) is the i t h largest number of the weighted FFLNs ˙ i ( ˙ i = ( n w i ) ˜ i ,   i = 1 , 2 , , n ) , w = ( w 1 , w 2 , , w n ) T is the weight vector of i   ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] , i = 1 n w i = 1 and n is the balancing coefficient.
Theorem 10.
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of FFLNs, then the aggregated value by using the FFLHA operator is also a FFLN and
FFLHA ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( ˙ ϕ ( i ) ) ) ) w i ) , 1 i = 1 n ( 1 ξ ˙ ϕ ( i ) 3 ) w i 3 ,                                                       i = 1 n ( 1 ξ ˙ ϕ ( i ) 3 ) w i i = 1 n ( 1 ( ξ ˙ ϕ ( i ) 3 + ψ ˙ ϕ ( i ) 3 ) ) w i 3
Proof. 
The proof of this theorem is similar to Theorem 4. □
Definition 15. 
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of n FFLNs, the FFL-hybrid geometric (FFLHG) operator of dimension n is a mapping FFLHG : Ω n Ω , that has an associated weight vector ω = ( ω 1 , ω 2 , , ω n ) T such that ω i [ 0 , 1 ] and i = 1 n ω i = 1 , then
FFLHG ( 1 , 2 , , n ) = ˜ i = 1 n ( ˙ ϕ ( i ) ^ ˜ ω ) ,
where ˙ ϕ ( i ) is the i t h largest number of the weighted FFLNs ˙ i ( ˙ i = i ^ ˜ n w i ,   i = 1 , 2 , , n ) , w = ( w 1 , w 2 , , w n ) T is the weight vector of i   ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] , i = 1 n w i = 1 and n is the balancing coefficient.
Theorem 11. 
Let i = σ ( i ) , ξ i , ψ i ,   ( i = 1 , 2 , , n ) be a collection of FFLNs, then the aggregated value by using the FFLHG operator is also a FFLN and
FFLHG ( 1 , 2 , , n ) = φ * 1 ( 1 i = 1 n ( 1 φ * ( σ ( ˙ ϕ ( i ) ) ) ) w i ) , i = 1 n ( 1 ψ ˙ ϕ ( i ) 3 ) w i i = 1 n ( 1 ( ξ ˙ ϕ ( i ) 3 + ψ ˙ ϕ ( i ) 3 ) ) w i 3 ,   1 i = 1 n ( 1 ψ ˙ ϕ ( i ) 3 ) w i 3   . ,
Proof. 
The proof of this theorem can be obtained similar to Theorem 4. □
Note that similar to the FFLOWA and the FFLOWG operators, the FFLHA and FFLHG operators follow the idempotent, bounded, monotonic and commutative properties.
Remark 1.
If ω = ( 1 n , 1 n , , 1 n ) T , then FFLHA and FFLHG operators become the FFLWA operator and FFLWG operator, respectively;
Remark 2.
If w = ( 1 n , 1 n , , 1 n ) T , then the FFLHA and FFLHG operators are reduced into FFLOWA operator and FFLOWG operator, respectively.
In the next section, we formulate a new decision-making method to solve MAGDM problems under the Fermatean fuzzy linguistic environment. Then, we consider a real-life supplier selection problem to demonstrate the decision-making steps.

4. An Approach to MAGDM Making with Fermatean Fuzzy Linguistic Information

4.1. MAGDM Problem Description

For a MAGDM problem, let F = { F 1 , F 2 , , F m } be a set of alternatives, A = { A 1 , A 2 , A n } be an attribute set with the associated weighting vector ( w 1 , w 2 , , w n ) T , satisfying w j [ 0 , 1 ] and j = 1 n w j = 1 . Assume E = { E 1 , E 2 , , E t } is a collection of s experts whose weight vector is ( ω 1 , ω 2 , , ω s ) T , satisfying ω q [ 0 , 1 ] and q = 1 s ω q = 1 . Further, suppose that B ( q ) = ( i j ( q ) ) m × n is a decision matrix, where i j ( q ) = σ ( i j ) ( q ) , ξ i j ( q ) , ψ i j ( q ) represents an attribute evaluation value, given by the expert E q , for the alternative F i F concerning the attribute A j A such that 0 ( ξ i j ( q ) ) 3 + ( ψ i j ( q ) ) 3 1 and σ ( i j ) ( q ) L [ 0 , 2 t ] , i = 1 , 2 , , m ; j = 1 , 2 , , n . Then, the ranking of the alternatives is required to obtain the best alternative(s).

4.2. Decision Method

The decision method comprises the following steps.
Step 1: To nullify the effect of the different attributes, transform the decision matrices B ( q ) = ( i j ( q ) ) m × n into the normalized form B ^ ( q ) = ( ^ i j ( q ) ) m × n = ( σ ( ^ i j ) ( q ) , ξ ^ i j ( q ) , ψ ^ i j ( q ) ) m × n . The elements of the normalized decision matrices B ^ ( q ) can be obtained as follows:
^ i j ( q ) = { σ ( i j ) ( q ) , ξ i j ( q ) , ψ i j ( q ) ,   if   A j   is   benefit   type   attribute 2 t σ ( i j ) ( q ) , ψ i j ( q ) , ξ i j ( q ) ,   if   A j   is   cos t   type   attribute . ,
Step 2: Aggregate all the B ^ ( q ) = ( ^ i j ( q ) ) m × n into a collective normalized decision matrix B ^ = ( ^ i j ) m × n = ( σ ( ^ i j ) , ξ ^ i j , ψ ^ i j ) by using either FFLOWA operator
^ i j = FFLOWA ( ^ i j ( 1 ) , ^ i j ( 2 ) , , ^ i j ( s ) ) = φ * 1 ( 1 q = 1 s ( 1 φ * ( σ ( ^ i j ϕ ( q ) ) ) ) ω q ) , 1 q = 1 s ( 1 ξ ^ i j ϕ ( q ) 3 ) ω q 3 ,                                                                               q = 1 s ( 1 ξ ^ i j ϕ ( q ) 3 ) ω q q = 1 s ( 1 ( ξ ^ i j ϕ ( q ) 3 + ψ ^ i j ϕ ( q ) 3 ) ) ω q 3 ,
or FFLOWG operator
^ i j = FFLOWG ( ^ i j ( 1 ) , ^ i j ( 2 ) , , ^ i j ( s ) ) = φ * 1 ( q = 1 s ( φ * ( σ ( ^ i j ϕ ( q ) ) ) ) ω q ) , 1 q = 1 s ( 1 ψ ^ i j ϕ ( q ) 3 ) ω q q = 1 s ( 1 ( ξ ^ i j ϕ ( q ) 3 + ψ ^ i j ϕ ( q ) 3 ) ) ω q 3 ,   1 q = 1 s ( 1 ψ ^ i j ϕ ( q ) 3 ) ω q 3 ,
where ^ i j σ ( q ) = σ ( ^ i j ) ϕ ( q ) , ξ ^ i j ϕ ( q ) , ψ ^ i j ϕ ( q ) is the q t h largest value of ^ i j ( q ) and ( ω 1 , ω 2 , , ω t ) T represents the associated ordered position weight vector with ω q [ 0 , 1 ] and q = 1 s ω q = 1 .
Step 3: Aggregate all the collective preference values ^ i j ( j = 1 , 2 , , n ) for obtaining the overall assessment values ˜ i   ( i = 1 , 2 , , m ) corresponding to the alternatives F i ( i = 1 , 2 , , m ) , based on either the FFLWA operator
˜ i = FFLWA ( ^ i 1 , ^ i 2 , , ^ i n ) = φ * 1 ( 1 j = 1 n ( 1 φ * ( σ ( ^ i j ) ) ) w j ) , 1 j = 1 n ( 1 ξ ^ i j 3 ) w j 3 ,                                                                   i = 1 n ( 1 ξ ^ i j 3 ) w j j = 1 n ( 1 ( ξ ^ i j 3 + ψ ^ i j 3 ) ) w j 3 ,
or FFLWG operator
˜ i = FFLWA ( ^ i 1 , ^ i 2 , , ^ i n ) = φ * 1 ( j = 1 n ( φ * ( σ ( ^ i j ) ) ) w j ) , j = 1 n ( 1 ψ ^ i j 3 ) w j j = 1 n ( 1 ( ξ ^ i j 3 + ψ ^ i j 3 ) ) w j 3 ,   1 j = 1 n ( 1 ψ ^ i j 3 ) w j 3 ,
Step 4. According to Definition 8, we obtain the order of the overall aggregated values ˜ i   ( i = 1 , 2 , , m ) .
Step 5. Rank all the alternatives F i   ( i = 1 , 2 , , m ) and hence select the most desirable one(s).

4.3. Numerical Example

In order to illustrate the application of the developed approach in practice, we consider a real-life decision problem about searching the global supplier with Fermatean fuzzy linguistic information.
Example 5.
Supplier selection is one of the most important processes to accomplish an effective supply chain because a supplier comprehensively contributes to the overall supply chain performance. Due to the involvement of a group of persons and many factors, supplier selection is typically considered a MAGDM problem. In the last few years, the supplier selection problem has received a considerable amount of attention from researchers working in different parts of the globe.
A Chilean company specializing in commercialized computer and office materials wants to select a suitable material supplier to assign the raw materials’ optimum order. After preliminary screening, five potential global suppliers { F 1 , F 2 , F 3 , F 4 , F 5 } were shortlisted for further evaluation. The company invites four experts { E 1 , E 2 , E 3 , E 4 } to evaluate the shortlisted suppliers concerning five attributes: (i) overall cost of the product A 1 ; (ii) service performance of the supplier A 2 ; (iii) reputation of the supplier A 3 ; (iv) quality of the product A 4 ; (v) delivery time of the product A 5 . The attribute weight vector is given as w = ( 0.20 , 0.15 , 0.25 , 0.25 , 0.15 ) T . The experts provide their evaluation information corresponding to each attribute in terms of FFLNs based on the following LTS:
L = { 0 = EP ( extremly   poor ) , 1 = VP ( very   poor ) , 2 = P (   poor ) , 3 = SP ( slightly   poor ) , 4 = F ( fair ) , 5 = SG ( slightly   good ) , 6 = G ( good ) , 7 = VG ( very   good ) , 8 = E G ( extremly   good ) } .
The experts provide the following Fermetean fuzzy linguistic decision matrices B ( q ) = ( i j ( q ) ) 5 × 5 ( q = 1 , 2 , 3 , 4 ) , as listed in Table 3, Table 4, Table 5 and Table 6, respectively.
Step 1: Since A 1 is a cost–type attribute while A 2 , A 3 , A 4 and A 5 are benefit-type attributes, so the normalized decision matrices B ^ ( q ) ( q = 1 , 2 , 3 , 4 ) are obtained using Equation (63) as follows (see Table 7, Table 8, Table 9 and Table 10).
Step 2: First, we calculate the experts’ weighting vector ω = ( 0.1550 , 0.3450 , 0.3450 , 0.1550 ) T based on the normal distribution method [62]. Then, utilizing the FFLOWA operator mentioned in Equation (64) (without loss of generality, we have taken the linguistic scaling function φ * = φ 2 ( θ = 1.4 ) to obtain the collective normalized decision matrix B ^ = ( ^ i j ) 5 × 5 . Using Equation (8), we obtain
S ( ^ 11 ( 1 ) ) = φ 2 ( 5 ) × ( 0.3 3 + 1 0.8 3 2 ) = 0.1469 ,   S ( ^ 11 ( 2 ) ) = φ 2 ( 6 ) × ( 0.2 3 + 1 0.5 3 2 ) = 0.2953 , S ( ^ 11 ( 3 ) ) = φ 2 ( 7 ) × ( 0.2 3 + 1 0.7 3 2 ) = 0.2683 ,   S ( ^ 11 ( 4 ) ) = φ 2 ( 6 ) × ( 0.1 3 + 1 0.7 3 2 ) = 0.2201 .
Since S ( ^ 11 ( 2 ) ) > S ( ^ 11 ( 3 ) ) > S ( ^ 11 ( 4 ) ) > S ( ^ 11 ( 1 ) ) , therefore ^ 11 ( 2 ) ^ 11 ( 3 ) ^ 11 ( 4 ) ^ 11 ( 1 ) .
^ 11 = F F L O W A ( ^ 11 ( 1 ) , ^ 11 ( 2 ) , ^ 11 ( 3 ) , ^ 11 ( 4 ) ) = φ 2 1 ( 1 ( 1 φ 2 ( 6 ) ) 0.1550 × ( 1 φ 2 ( 7 ) ) 0.3450 × ( 1 φ 2 ( 6 ) ) 0.3450 × ( 1 φ 2 ( 5 ) ) 0.1550 ) , 1 ( 1 0.2 3 ) 0.1550 × ( 1 0.2 3 ) 0.3450 × ( 1 0.1 3 ) 0.3450 × ( 1 0.3 3 ) 0.1550 3 ,     ( 1 0.2 3 ) 0.1550 × ( 1 0.2 3 ) 0.3450 × ( 1 0.1 3 ) 0.3450 × ( 1 0.3 3 ) 0.1550 ( 1 ( 0.2 3 + 0.5 3 ) ) 0.1550 × ( 1 ( 0.2 3 + 0.7 3 ) ) 0.3450 × ( 1 ( 0.1 3 + 0.7 3 ) ) 0.3450 × ( 1 ( 0.3 3 + 0.8 3 ) ) 0.1550 3 = 6.3636 , 0.2046 , 0.7016 .
Similarly, we can calculate other collective values. Table 11 presents the collective normalized decision matrix.
Step 3: Utilize the FFLWA operator given in Equation (66) with w = ( 0.20 , 0.15 , 0.25 , 0.25 , 0.15 ) T to derive the overall Fermetean fuzzy linguistic preference values ˜ i   ( i = 1 , 2 , 3 , 4 , 5 ) corresponding to each alternative F i ( i = 1 , 2 , 3 , 4 , 5 ) . Using the expression mentioned in Equation (66), we obtain
˜ 1 = F F L W A ( ^ 11 , ^ 12 , ^ 13 , ^ 14 , ^ 15 ) = φ 2 1 ( 1 ( 1 φ 2 ( 6.3636 ) ) 0.20 × ( 1 φ 2 ( 3.0842 ) ) 0.15 × ( 1 φ 2 ( 4.0947 ) ) 0.25 × ( 1 φ 2 ( 1.9102 ) ) 0.25 × ( 1 φ 2 ( 4.8442 ) ) 0.15 ) , 1 ( 1 0.2046 3 ) 0.20 × ( 1 0.6463 3 ) 0.15 × ( 1 0.5943 3 ) 0.25 × ( 1 0.6272 3 ) 0.25 × ( 1 0.6262 3 ) 0.15 3 ,     ( 1 0.2046 3 ) 0.20 × ( 1 0.6463 3 ) 0.15 × ( 1 0.5943 3 ) 0.25 × ( 1 0.6272 3 ) 0.25 × ( 1 0.6262 3 ) 0.15 ( 1 ( 0.2046 3 + 0.7016 3 ) ) 0.20 × ( 1 ( 0.6463 3 + 0.4778 3 ) ) 0.15 × ( 1 ( 0.5943 3 + 0.3966 3 ) ) 0.25 × ( 1 ( 0.6272 3 + 0.5882 3 ) ) 0.25 × ( 1 ( 0.6262 3 + 0.5809 3 ) ) 0.25 3 = 4.3017 , 0.5831 , 0.5647 .
The overall Fermetean fuzzy linguistic preference values ˜ i   ( i = 1 , 2 , 3 , 4 , 5 ) are recorded in Table 12.
Step 4: According to Definition 8, we have
S ( ˜ 1 ) = 0 . 2641 ,   S ( ˜ 2 ) = 0 . 6284 ,   S ( ˜ 3 ) = 0 . 1562 ,   S ( ˜ 4 ) = 0 . 2511 ,   S ( ˜ 5 ) = 0 . 2385
Step 5: The final ranking order of the suppliers following the score values S ( ˜ i ) is F 2 F 1 F 4 F 5 F 3 , thus, the most desirable supplier is F 2 .
Additionally, if we use the FFLOWG operator in Step 2 and the FFLWG operator in Step 3 instead of FFLOWA and FFLWA operators, respectively, in the developed method, then the procedure steps are as follows:
Step 1: Same as above.
Step 2: Utilizing the FFLOWG operator to aggregate all the normalized decision matrices B ^ ( q ) ( q = 1 , 2 , 3 , 4 ) , the obtained results corresponding to each alternative are shown in Table 13.
Step 3: The overall Fermetean fuzzy linguistic preference values ˜ i   ( i = 1 , 2 , 3 , 4 , 5 ) of each alternative F i ( i = 1 , 2 , 3 , 4 , 5 ) using the FFLWG operator are summarized in Table 14.
Step 4: The score values S ( ˜ i ) of the overall Fermetean fuzzy linguistic preference values obtained during Step 3 are calculated as
S ( ˜ 1 ) = 0 . 2143 ,   S ( ˜ 2 ) = 0 . 4602 ,   S ( ˜ 3 ) = 0 . 1923 ,   S ( ˜ 4 ) = 0 . 2363 ,   S ( ˜ 5 ) = 0 . 1934
Step 5. Since S ( ˜ 2 ) S ( ˜ 4 ) S ( ˜ 1 ) S ( ˜ 5 ) S ( ˜ 3 ) , therefore we obtain the final ranking order of the suppliers as F 2 F 4 F 1 F 5 F 3 . Hence, F 2 is the most desirable supplier.
It is worth noting that a decision-maker can choose the appropriate aggregation operator based on his/her behavior towards the aggregation procedure. If a decision-maker has optimistic behavior towards the aggregation of experts’ preference information and pessimistic behavior towards the final decision, then he/she uses the FFLOWA and FFLWG operators in Step 2 and Step 3, respectively, of the developed approach. A complete analysis has been conducted to analyze the effect of the decision-maker’s behavioral attitude on the final ranking. The results are summarized in Table 15, along with the suppliers’ ranking order. The results shown in Table 15 indicate that when we use the FFLOWA (or the FFLOWG) operator in Step 2 and the FFLWA (or FFLHA) operator in Step 3 then the ranking order of the alternatives is always F 2 F 1 F 4 F 5 F 3 . On the other hand, if we use the FFLOWA (or the FFLOWG) operator in Step 2 and the FFLWG (or FFLHG) operator in Step 3 then the ranking order of the alternatives is obtained as F 2 F 4 F 1 F 5 F 3 , which is slightly different from the previous ones. It shows the effect of the nature of varying aggregation operators on the final ranking order of the alternatives.
Apart from the above analysis, to examine the influence of the different LSFs on the alternatives’ ranking order, we have employed different LSFs in the calculation process of the developed decision-making approach. Then, after applying the steps, the corresponding results are summarized in Table 16.
From Table 16, it has been observed that although the score values of the alternatives are entirely different when we use different LSFs; however, the best alternative is always F 2 for the considered problem. Note that the use of different LSFs shows an influence on the final ranking order of the alternatives. It is also worth noting that, in other real-life decision problems, the best alternative may be different depending on the use of different aggregation operators. Our developed method provides an ability to the DMs for choosing the appropriate LSF according to his/her personal choice and the actual semantic environment.

4.4. Sensitivity Analysis

The decision-making approach developed in this paper uses various AOs with different LSFs to aggregate information data as provided by decision-makers. This section discusses the influence of these AOs and LSFs on the decision result.
A sensitivity analysis has been conducted to better understand the impact of the various AOs on the ranking order of the alternatives with different LSFs. Figure 5, Figure 6, Figure 7, Figure 8, Figure 9 and Figure 10 have been plotted, portraying the sensitivity of the results based on various AOs taking different LSFs. As shown in Figure 5, Figure 6, Figure 7, Figure 8, Figure 9 and Figure 10, changes in the AOs and LSFs significantly influence the ranking of alternatives.

4.5. A Comparative Overview of the Results Based on Different AOs

In order to compare the performance of the developed AOs with existing ones, this paper uses the AOs and decision method formulated by Li et al. [53] to solve the above considered MAGDM problem. The obtained values of the closeness coefficient and ranking order of the suppliers are summarized in Table 17.
From Table 17, it is inferred that the best alternative obtained by the proposed approach agrees with the method formulated by Li et al. [53] which confirms the consistency of the proposed operators. It is also clear from the results summarized in Table 17 that the best alternative ( F 2 ) and the worst alternative ( F 3 ) are the same by all the approaches. However, the complete ranking order of the suppliers is slightly different from our ranking order because of the use of different aggregation operators for aggregating the preference information of the decision-makers.
In addition, Spearman’s rank correlation test [63] is used for the subsequent analyses to identify the differences between the ranking orders of the alternatives obtained by using different AOs in the formulated approach. Spearman’s rank correlation measures the strength of association of two variables. It can be defined as follows:
r S R C = 1 6 j = 1 m d j 2 m ( m 2 1 ) ,
where m is the number of alternatives and d denotes the ranking difference of alternative F j between two different rankings. According to [63], r S R C lies between −1 to +1. r S R C = + 1 indicates a perfect positive relationship between the two sets of rankings and r S R C = 1 implies a perfect negative relationship between the two sets of rankings. The closer r S R C is to ± 1 , the stronger the relationship between the two rankings. Table 18, Table 19 and Table 20 summarize Spearman’s rank correlation coefficient values between different rankings obtained based on different AOs and LSFs.
From Table 18 and Table 19, we can easily see that the ranking orders obtained using FFLOWA+ FFLWA and FFLOWG+ FFLWA have a perfect positive relationship. Similarly, Table 19 and Table 20 show that the rankings obtained by the FFLOWA+ FFLWG and FFLOWA+ FFLHG also have a perfect positive relationship.

4.6. Some Advantages and Limitations of the Proposed Approach

  • The formulated approach can solve decision-making problems with qualitative information data in terms of FFLNs very efficiently.
  • We can also apply this method to solve many existing decision problems with intuitionistic fuzzy linguistic and Pythagorean fuzzy linguistic information [48,49,50].
  • The main limitation of this study is that it cannot handle the situations in which the attributes have some interaction and prioritization relationship between them.
  • The developed study opens a new door for further research under a qualitative information environment.
  • There can be some adverse situations in which the defined operational laws for FFLNs may not work. Then, we will need to undertake a further detailed investigation of the operational laws of FFLNs.

5. Conclusions

In this paper, we studied the MAGDM problems under a Fermatean fuzzy linguistic environment. To overcome the shortcomings of the existing operational laws of FFLNs, the paper has defined four new algebraic operational laws for FFLNs based on the idea of LSF. Several mathematical properties of the proposed operational laws have been studied in detail. Next, we formulated some AOs, including the FFLWA operator, the FFLWG operator, the FFLOWA operator, the FFLOWG operator, the FFLHA operator, and the FFLHG operator to aggregate different FFLNs. Furthermore, the work has proved many important properties of the proposed AOs, such as idempotency, monotonicity, commutativity, and boundedness, to establish their applicability in different areas. Utilizing the proposed AOs, the paper has developed a new decision-making approach to solve MAGDM problems with Fermatean fuzzy linguistic information. Finally, a real-life supplier selection problem has been considered to illustrate the steps of the proposed method.
In the future, we will employ the proposed AOs to solve some other decision-making problems such as medical diagnosis, pattern recognition, and image processing. Further, we will also develop some new aggregation operators such as Bonferroni mean operator, Heronian mean operator, and Hamy mean operator to aggregate the correlative Fermatean fuzzy linguistic information in future work.

Funding

This research was funded by the Chilean Government (Conicyt) through the Fondecyt Postdoctoral Program (Project Number 3170556).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

The author is very grateful to the anonymous reviewers for their valuable comments and constructive suggestions that greatly improved the quality of this paper.

Conflicts of Interest

The author declares that he has no conflict of interest.

References

  1. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  3. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar] [CrossRef]
  4. He, Y.; Chen, H.; Zhou, L.; Liu, J.; Tao, Z. Intuitionistic fuzzy geometric interaction averaging operators and their application to multi-criteria decision making. Inf. Sci. 2014, 259, 142–159. [Google Scholar] [CrossRef]
  5. Ma, Z.M.; Yang, W. Symmetric intuitionistic fuzzy weighted mean operators based on weighted Archimedean t-norms and t-conorms for multi-criteria decision making. Informatica 2020, 31, 89–112. [Google Scholar] [CrossRef] [Green Version]
  6. Zou, X.Y.; Chen, S.M.; Fan, K.Y. Multiple attribute decision making using improved intuitionistic fuzzy weighted geometric operators of intuitionistic fuzzy values. Inf. Sci. 2020, 535, 242–253. [Google Scholar] [CrossRef]
  7. He, Y.; He, Z.; Chen, H. Intuitionistic fuzzy interaction Bonferroni means and its application to multiple attribute decision making. IEEE Trans. Cyber. 2015, 45, 116–128. [Google Scholar] [CrossRef]
  8. Verma, R. Generalized Bonferroni mean operator for fuzzy number intuitionistic fuzzy sets and its application to multiattribute decision making. Int. J. Intell. Syst. 2015, 30, 499–519. [Google Scholar] [CrossRef]
  9. Liu, P.; Liu, J.; Chen, M.S. Some intuitionistic fuzzy Dombi Bonferroni mean operators and their application to multi-attribute group decision making. J. Oper. Res. Soc. 2018, 69, 1–24. [Google Scholar] [CrossRef]
  10. 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]
  11. Verma, R.; Sharma, B.D. Intuitionistic fuzzy Einstein prioritized weighted average operators and their application to multiple attribute group decision making. Appl. Math. Inf. Sci. 2015, 9, 3095–3107. [Google Scholar] [CrossRef]
  12. Ai, Z.; Xu, Z. Intuitionistic fuzzy double integrals and their fundamental properties. IEEE Trans. Fuzzy Syst. 2018, 26, 3782–3792. [Google Scholar] [CrossRef]
  13. Ai, Z.; Xu, Z. Line integrals of intuitionistic fuzzy calculus and their properties. IEEE Trans. Fuzzy Syst. 2018, 26, 1435–1446. [Google Scholar] [CrossRef]
  14. Ai, Z.; Xu, Z. Multiple definite integrals of intuitionistic fuzzy calculus and isomorphic mappings. IEEE Trans. Fuzzy Syst. 2018, 26, 670–680. [Google Scholar] [CrossRef]
  15. Zhang, H.; Yu, L. New distance measures between intuitionistic fuzzy sets and interval-valued fuzzy sets. Inf. Sci. 2013, 245, 181–196. [Google Scholar] [CrossRef]
  16. Ngan, R.T.; Son, L.H.; Cuong, B.C.; Ali, M. H-max distance measure of intuitionistic fuzzy sets in decision making. Appl. Soft Comput. J. 2018, 69, 393–425. [Google Scholar] [CrossRef]
  17. Mahanta, J.; Panda, S. A novel distance measure for intuitionistic fuzzy sets with diverse applications. Int. J. Intell. Syst. 2021, 36, 615–627. [Google Scholar] [CrossRef]
  18. Hao, Z.; Xu, Z.; Zhao, H.; Zhang, R. The context-based distance measure for intuitionistic fuzzy set with application in marine energy transportation route decision making. Appl. Soft Comput. 2021, 101, 107044. [Google Scholar] [CrossRef]
  19. Song, Y.; Wang, X.; Quan, W.; Huang, W. A new approach to construct similarity measure for intuitionistic fuzzy sets. Soft Comput. 2019, 23, 1985–1998. [Google Scholar] [CrossRef]
  20. Boran, F.E.; Akay, D. A biparametric similarity measure on intuitionistic fuzzy sets with applications to pattern recognition. Inf. Sci. 2014, 255, 45–57. [Google Scholar] [CrossRef]
  21. Raji-Lawal, H.Y.; Akinwale, A.T.; Folorunsho, O.; Mustapha, A.O. Decision support system for dementia patients using intuitionistic fuzzy similarity measure. Soft Comput. Lett. 2020, 2, 100005. [Google Scholar] [CrossRef]
  22. Singh, A.; Kumar, S. A novel dice similarity measure for IFSs and its applications in pattern and face recognition. Expert Syst. Appl. 2020, 149, 113245. [Google Scholar] [CrossRef]
  23. Verma, R.; Sharma, B.D. Exponential entropy on intuitionistic fuzzy sets. Kybernetika 2013, 49, 114–127. [Google Scholar]
  24. Verma, R.; Sharma, B.D. On intuitionistic fuzzy entropy of order-α. Adv. Fuzzy Syst. 2014, 1–8. [Google Scholar] [CrossRef] [Green Version]
  25. Verma, R.; Sharma, B.D. R-norm entropy on intuitionistic fuzzy sets. J. Intell. Fuzzy Syst. 2015, 28, 327–335. [Google Scholar] [CrossRef]
  26. Thao, N.X. Some new entropies and divergence measures of intuitionistic fuzzy sets based on Archimedean t-conorm and application in supplier selection. Soft Comput. 2021, 25, 5791–5805. [Google Scholar] [CrossRef]
  27. Verma, R.; Sharma, B.D. On generalized intuitionistic fuzzy divergence (relative information) and their properties. J. Uncertain Syst. 2012, 6, 308–320. [Google Scholar]
  28. Verma, R.; Sharma, B.D. Intuitionistic fuzzy Jensen-Rényi divergence: Applications to multiple-attribute decision making. Informatica 2013, 37, 399–409. [Google Scholar]
  29. Mishra, A.R.; Singh, R.K.; Motwani, D. Intuitionistic fuzzy divergence measure-based ELECTRE method for performance of cellular mobile telephone service providers. Neural Comput. Appl. 2020, 32, 3901–3921. [Google Scholar] [CrossRef]
  30. Verma, R.; Sharma, B.D. A new measure of inaccuracy with its application to multi-criteria decision making under intuitionistic fuzzy environment. J. Intell. Fuzzy Syst. 2014, 27, 1811–1824. [Google Scholar] [CrossRef]
  31. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  32. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  33. Zhang, X.; Xu, Z. Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  34. Yager, R.R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  35. Wei, G.; Lu, M. Pythagorean fuzzy power aggregation operators in multiple attribute decision making. Int. J. Intell. Syst. 2018, 33, 169–186. [Google Scholar] [CrossRef]
  36. Yang, Y.; Chin, K.; Ding, H.; Lv, H.; Li, Y. Pythagorean fuzzy Bonferroni means based on T-norm and its dual T-conorm. Int. J. Intell. Syst. 2019, 34, 1303–1336. [Google Scholar] [CrossRef]
  37. Akram, M.; Ilyas, F.; Al-Kenani, N.A. Two-phase group decision-aiding system using ELECTRE III method in Pythagorean fuzzy environment. Arab. J. Sci. Eng. 2021, 46, 3549–3566. [Google Scholar] [CrossRef]
  38. Ejegwa, P.A. Modified Zhang and Xu’s distance measure for Pythagorean fuzzy sets and its application to pattern recognition problems. Neural Comput. Appl. 2020, 32, 10199–10208. [Google Scholar] [CrossRef]
  39. Molla, M.U.; Giri, B.C.; Biswas, P. Extended PROMETHEE method with Pythagorean fuzzy sets for medical diagnosis problems. Soft Comput. 2021, 25, 4503–4512. [Google Scholar] [CrossRef]
  40. Bakioglu, G.; Atahan, A.O. AHP integrated TOPSIS and VIKOR methods with Pythagorean fuzzy sets to prioritize risks in self-driving vehicles. Appl. Soft Comput. 2021, 99, 106948. [Google Scholar] [CrossRef]
  41. Senapati, T.; Yager, R.R. Fermatean fuzzy sets. J. Ambient Intell. Humaniz. Comput. 2019. [Google Scholar] [CrossRef]
  42. Senapati, T.; Yager, R.R. Some new operations over Fermatean fuzzy numbers and application of Fermatean fuzzy WPM in multiple criteria decision making. Informatica 2019, 30, 391–412. [Google Scholar] [CrossRef] [Green Version]
  43. Senapati, T.; Yager, R.R. Fermatean fuzzy weighted averaging/geometric operators and its application in multi-criteria decision-making methods. Eng. Appl. Artif. Intell. 2019, 85, 112–121. [Google Scholar] [CrossRef]
  44. Aydemir, S.B.; Yilmaz Gunduz, S. Fuzzy TOPSIS method with Dombi aggregation operators and its application in multi-criteria decision making. J. Intell. Fuzzy Syst. 2020, 39, 851–869. [Google Scholar] [CrossRef]
  45. Mishra, A.R.; Rani, P.; Pandey, K. Fermatean fuzzy CRITIC-EDAS approach for the selection of sustainable third-party reverse logistics providers using improved generalized score function. J. Ambient. Intell. Humaniz. Comput. 2021, 1, 1. [Google Scholar] [CrossRef]
  46. 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]
  47. 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]
  48. Wang, J.B.; Li, H.B. Multi-criteria decision-making method based on aggregation operators for intuitionistic linguistic fuzzy numbers. Control Decis. 2010, 25, 1571–1574. [Google Scholar]
  49. Liu, P. Some generalized dependent aggregation operators with intuitionistic linguistic numbers and their application to group decision making. J. Comput. Syst. Sci. 2013, 79, 131–143. [Google Scholar] [CrossRef] [Green Version]
  50. Liu, P.; Wang, Y. Multiple attribute group decision making methods based on intuitionistic linguistic power generalized aggregation operators. Appl. Soft Comput. J. 2014, 17, 90–104. [Google Scholar] [CrossRef]
  51. Su, W.; Li, W.; Zeng, S.; Zhang, C. Atanassov’s intuitionistic linguistic ordered weighted averaging distance operator and its application to decision making. J. Intell. Fuzzy Syst. 2014, 26, 1491–1502. [Google Scholar] [CrossRef]
  52. Yu, S.; Wang, J.; Wang, J. An extended TODIM approach with intuitionistic linguistic numbers. Int. Trans. Oper. Res. 2018, 25, 781–805. [Google Scholar] [CrossRef]
  53. Liu, D.; Liu, Y.; Chen, X. Fermatean fuzzy linguistic set and its application in multicriteria decision making. Int. J. Intell. Syst. 2019, 34, 878–894. [Google Scholar] [CrossRef]
  54. 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]
  55. Herrera, F.; Martínez, L. A model based on linguistic 2-tuples for dealing with multigranular hierarchical linguistic contexts in multi-expert decision-making. IEEE Trans. Syst. Man Cybern. Part B Cybern. 2001, 31, 227–234. [Google Scholar] [CrossRef] [Green Version]
  56. Xu, Z. Intuitionistic preference relations and their application in group decision making. Inf. Sci. 2007, 177, 2363–2379. [Google Scholar] [CrossRef]
  57. Wang, J.Q.; Wu, J.T.; Wang, J.; Zhang, H.Y.; Chen, X.H. Interval-valued hesitant fuzzy linguistic sets and their applications in multi-criteria decision-making problems. Inf. Sci. 2014, 288, 55–72. [Google Scholar] [CrossRef]
  58. Liao, H.; Qin, R.; Gao, C.; Wu, X.; Hafezalkotob, A.; Herrera, F. Score-HeDLiSF: A score function of hesitant fuzzy linguistic term set based on hesitant degrees and linguistic scale functions: An application to unbalanced hesitant fuzzy linguistic MULTIMOORA. Inf. Fusion 2019, 48, 39–54. [Google Scholar] [CrossRef]
  59. Yager, R.R. On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cybern. 1988, 18, 183–190. [Google Scholar] [CrossRef]
  60. Chiclana, F.; Herrera, F.; Herrera-Viedma, E. The ordered weighted geometric operator: Properties and application in MCDM problems. In Proceedings of the 8th Conference Information Processing and Management of Uncertainty in Knowledge based Systems (IPMU), Madrid, Spain, 3–7 July 2000; pp. 985–991. [Google Scholar]
  61. Xu, Z.; Da, Q.L. An overview of operators for aggregating information. Int. J. Intell. Syst. 2003, 18, 953–969. [Google Scholar] [CrossRef]
  62. Xu, Z. An overview of methods for determining OWA weights. Int. J. Intell. Syst. 2005, 20, 843–865. [Google Scholar] [CrossRef]
  63. Parkan, C.; Wu, M.L. Decision-making and performance measurement models with applications to robot selection. Comput. Ind. Eng. 1999, 36, 503–523. [Google Scholar] [CrossRef]
Figure 1. The uniformly distributed linguistic terms set.
Figure 1. The uniformly distributed linguistic terms set.
Axioms 10 00113 g001
Figure 2. The semantics of the unbalanced distributed LTS in ASG increasing trend.
Figure 2. The semantics of the unbalanced distributed LTS in ASG increasing trend.
Axioms 10 00113 g002
Figure 3. The unbalanced distributed LTS in ASG decreasing trend.
Figure 3. The unbalanced distributed LTS in ASG decreasing trend.
Axioms 10 00113 g003
Figure 4. The relationships between LTs and their corresponding semantics under different situations.
Figure 4. The relationships between LTs and their corresponding semantics under different situations.
Axioms 10 00113 g004
Figure 5. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 1 .
Figure 5. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 1 .
Axioms 10 00113 g005
Figure 6. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 1 .
Figure 6. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 1 .
Axioms 10 00113 g006
Figure 7. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 2 .
Figure 7. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 2 .
Axioms 10 00113 g007
Figure 8. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 2 .
Figure 8. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 2 .
Axioms 10 00113 g008
Figure 9. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 3 .
Figure 9. Sensitivity analysis for the alternatives based on FFLOWA operator in step 2 with φ * = φ 3 .
Axioms 10 00113 g009
Figure 10. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 3 .
Figure 10. Sensitivity analysis for the alternatives based on FFLOWG operator in step 2 with φ * = φ 3 .
Axioms 10 00113 g010
Table 1. Values of different operations.
Table 1. Values of different operations.
Operation φ * = φ 1 φ * = φ 2   and   θ = 1.4 φ * = φ 3   and   ρ = τ = 0.8
1 ˜ 2 5.4996 , 0.5297 , 0.7655 5.5418 , 0.5297 , 0.7655 5.4896 , 0.5297 , 0.7655
1 ˜ 2 2.5002 , 0.4826 , 0.7856 2.0169 , 0.4826 , 0.7856 2.7468 , 0.4826 , 0.7856
λ ˜ 5.2098 , 0.6149 , 0.6945 5.6483 , 0.6149 , 0.6945 4.7348 , 0.6149 , 0.6945
^ ˜ λ 0.0246 , 0.5355 , 0.7452 0.0323 , 0.5355 , 0.7452 0.0157 , 0.5355 , 0.7452
Table 2. Calculation results of Example 3 based on the proposed operational laws.
Table 2. Calculation results of Example 3 based on the proposed operational laws.
Operation φ * = φ 2   and   θ = 1.4
1 ˜ 2 5.5418 , 0.5279 , 0.7655
1 ˜ 3 0.4582 , 0.2869 , 0.6797
1 ˜ 4 1.1365 , 0.2608 , 0.7856
2 ˜ 5 5.6534 , 0.8306 , 0.5511
2 ˜ 6 6.0000 , 0.6797 , 0.6455
4 ˜ 1 5.7540 , 0.4698 , 0.8281
4 ˜ 2 5.9902 , 0.7452 , 0.7969
Table 3. Decision matrix B ( 1 ) .
Table 3. Decision matrix B ( 1 ) .
A 1 A 2 A 3 A 4 A 5
F 1 3 , 0.8 , 0.3 1 , 0.5 , 0.5 4 , 0.6 , 0.1 1 , 0.2 , 0.3 5 , 0.4 , 0.6
F 2 5 , 0.7 , 0.2 4 , 0.6 , 0.4 7 , 0.7 , 0.3 6 , 0.8 , 0.1 4 , 0.5 , 0.7
F 3 4 , 0.4 , 0.7 2 , 0.2 , 0.8 3 , 0.4 , 0.6 2 , 0.6 , 0.6 5 , 0.5 , 0.1
F 4 1 , 0.7 , 0.5 3 , 0.4 , 0.5 4 , 0.3 , 0.4 4 , 0.2 , 0.1 2 , 0.6 , 0.2
F 4 3 , 0.3 , 0.1 4 , 0.7 , 0.1 1 , 0.8 , 0.5 5 , 0.5 , 0.8 4 , 0.9 , 0.1
Table 4. Decision matrix B ( 2 ) .
Table 4. Decision matrix B ( 2 ) .
A 1 A 2 A 3 A 4 A 5
F 1 2 , 0.5 , 0.2 3 , 0.7 , 0.6 5 , 0.2 , 0.4 5 , 0.3 , 0.9 7 , 0.4 , 0.3
F 2 4 , 0.6 , 0.1 7 , 0.9 , 0.5 6 , 0.8 , 0.4 8 , 0.9 , 0.3 3 , 0.8 , 0.3
F 3 5 , 0.9 , 0.3 4 , 0.5 , 0.2 3 , 0.4 , 0.2 2 , 0.4 , 0.5 1 , 0.7 , 0.1
F 4 7 , 0.5 , 0.4 2 , 0.5 , 0.1 4 , 0.6 , 0.7 5 , 0.2 , 0.8 5 , 0.5 , 0.3
F 4 5 , 0.2 , 0.5 1 , 0.6 , 0.8 1 , 0.9 , 0.6 7 , 0.1 , 0.7 2 , 0.2 , 0.2
Table 5. Decision matrix B ( 3 ) .
Table 5. Decision matrix B ( 3 ) .
A 1 A 2 A 3 A 4 A 5
F 1 1 , 0.7 , 0.2 4 , 0.6 , 0.1 3 , 0.8 , 0.3 1 , 0.6 , 0.5 2 , 0.8 , 0.0
F 2 2 , 0.6 , 0.4 8 , 0.9 , 0.2 6 , 0.6 , 0.1 7 , 0.9 , 0.6 3 , 0.7 , 0.0
F 3 4 , 0.9 , 0.6 4 , 0.6 , 0.7 2 , 0.4 , 0.4 4 , 0.1 , 0.8 5 , 0.6 , 0.2
F 4 3 , 0.4 , 0.4 5 , 0.7 , 0.0 6 , 0.2 , 0.5 5 , 0.6 , 0.8 7 , 0.1 , 0.4
F 4 7 , 0.3 , 0.9 3 , 0.8 , 0.3 1 , 0.7 , 0.6 6 , 0.3 , 0.5 1 , 0.8 , 0.6
Table 6. Decision matrix B ( 4 ) .
Table 6. Decision matrix B ( 4 ) .
A 1 A 2 A 3 A 4 A 5
F 1 2 , 0.7 , 0.1 4 , 0.7 , 0.0 3 , 0.6 , 0.6 4 , 0.8 , 0.2 5 , 0.2 , 0.9
F 2 3 , 0.6 , 0.9 6 , 0.5 , 0.3 7 , 0.9 , 0.2 8 , 0.9 , 0.4 5 , 0.7 , 0.1
F 3 4 , 0.3 , 0.4 3 , 0.6 , 0.9 4 , 0.2 , 0.5 5 , 0.4 , 0.7 4 , 0.2 , 0.6
F 4 3 , 0.3 , 0.5 1 , 0.3 , 0.4 3 , 0.7 , 0.4 3 , 0.8 , 0.3 2 , 0.6 , 0.7
F 4 5 , 0.6 , 0.4 4 , 0.4 , 0.8 1 , 0.5 , 0.5 2 , 0.4 , 0.7 4 , 0.5 , 0.6
Table 7. Normalized decision matrix B ^ ( 1 ) .
Table 7. Normalized decision matrix B ^ ( 1 ) .
A 1 A 2 A 3 A 4 A 5
F 1 5 , 0.3 , 0.8 1 , 0.5 , 0.5 4 , 0.6 , 0.1 1 , 0.2 , 0.3 5 , 0.4 , 0.6
F 2 3 , 0.2 , 0.7 4 , 0.6 , 0.4 7 , 0.7 , 0.3 6 , 0.8 , 0.1 4 , 0.5 , 0.7
F 3 4 , 0.7 , 0.4 2 , 0.2 , 0.8 3 , 0.4 , 0.6 2 , 0.6 , 0.6 5 , 0.5 , 0.1
F 4 7 , 0.5 , 0.7 3 , 0.4 , 0.5 4 , 0.3 , 0.4 4 , 0.2 , 0.1 2 , 0.6 , 0.2
F 5 5 , 0.1 , 0.3 4 , 0.7 , 0.1 1 , 0.8 , 0.5 5 , 0.5 , 0.8 4 , 0.9 , 0.1
Table 8. Normalized decision matrix B ^ ( 2 ) .
Table 8. Normalized decision matrix B ^ ( 2 ) .
A 1 A 2 A 3 A 4 A 5
F 1 6 , 0.2 , 0.5 3 , 0.7 , 0.6 5 , 0.2 , 0.4 5 , 0.3 , 0.9 7 , 0.4 , 0.3
F 2 4 , 0.1 , 0.6 7 , 0.9 , 0.5 6 , 0.8 , 0.4 8 , 0.9 , 0.3 3 , 0.8 , 0.3
F 3 3 , 0.3 , 0.9 4 , 0.5 , 0.2 3 , 0.4 , 0.2 2 , 0.4 , 0.4 1 , 0.7 , 0.1
F 4 1 , 0.4 , 0.5 2 , 0.5 , 0.1 4 , 0.6 , 0.7 5 , 0.2 , 0.8 5 , 0.5 , 0.3
F 5 3 , 0.5 , 0.2 1 , 0.6 , 0.8 1 , 0.9 , 0.6 7 , 0.1 , 0.7 2 , 0.2 , 0.2
Table 9. Normalized decision matrix B ^ ( 3 ) .
Table 9. Normalized decision matrix B ^ ( 3 ) .
A 1 A 2 A 3 A 4 A 5
F 1 7 , 0.2 , 0.7 4 , 0.6 , 0.1 3 , 0.8 , 0.3 1 , 0.6 , 0.5 2 , 0.8 , 0.0
F 5 6 , 0.4 , 0.6 8 , 0.9 , 0.2 6 , 0.6 , 0.1 7 , 0.9 , 0.6 3 , 0.7 , 0.0
F 3 4 , 0.6 , 0.9 4 , 0.6 , 0.7 2 , 0.4 , 0.4 4 , 0.1 , 0.8 5 , 0.6 , 0.2
F 4 5 , 0.4 , 0.4 5 , 0.7 , 0.0 6 , 0.2 , 0.5 5 , 0.6 , 0.8 7 , 0.1 , 0.4
F 4 1 , 0.9 , 0.3 3 , 0.8 , 0.3 1 , 0.7 , 0.6 6 , 0.3 , 0.5 1 , 0.8 , 0.6
Table 10. Normalized decision matrix B ^ ( 4 ) .
Table 10. Normalized decision matrix B ^ ( 4 ) .
A 1 A 2 A 3 A 4 A 5
F 1 6 , 0.1 , 0.7 4 , 0.7 , 0.0 3 , 0.6 , 0.6 4 , 0.8 , 0.2 5 , 0.2 , 0.9
F 2 5 , 0.9 , 0.6 6 , 0.5 , 0.3 7 , 0.9 , 0.2 8 , 0.9 , 0.4 5 , 0.7 , 0.1
F 3 4 , 0.4 , 0.3 3 , 0.6 , 0.9 4 , 0.2 , 0.5 5 , 0.4 , 0.7 4 , 0.2 , 0.6
F 4 5 , 0.5 , 0.3 1 , 0.3 , 0.4 3 , 0.7 , 0.4 3 , 0.8 , 0.3 2 , 0.6 , 0.7
F 5 3 , 0.4 , 0.6 4 , 0.4 , 0.8 1 , 0.5 , 0.5 2 , 0.4 , 0.7 4 , 0.5 , 0.6
Table 11. Collective normalized decision matrix B ^ based on FFLOWA operator.
Table 11. Collective normalized decision matrix B ^ based on FFLOWA operator.
A 1 A 2 A 3 A 4 A 5
F 1 6.3636 , 0.2046 , 0.7016 3.0842 , 0.6463 , 0.4778 4.0947 , 0.5943 , 0.3966 1.9102 , 0.6272 , 0.5882 4.8442 , 0.6262 , 0.5809
F 2 4.9662   , 0.5876 , 0.6750 8.0000 , 0.8048 , 0.4686 6.6072 , 0.3266 , 0.3266 8.000 , 0.8892 , 0.5234 3.4637 , 0.7244 , 0.3855
F 3 3.8309 , 0.4735 , 0.8315 3.2911 , 0.5571 , 0.8364 3.1444 , 0.2951 , 0.5097 2.6951 , 0.3791 , 0.6367 4.0135 , 0.4683 , 0.4152
F 4 5.1312 , 0.3942 , 0.5286 2.5714 , 0.5054 , 0.3709 4.1499 , 0.5602 , 0.5041 4.4243 , 0.5652 , 0.6810 4.4155 , 0.5367 , 0.4497
F 5 2.9330 , 0.6195 , 0.4349 3.0842 , 0.6778 , 0.6322 0.9998 , 0.7717 , 0.6001 5.9625 , 0.3895 , 0.7325 2.7125 , 0.6724 , 0.4952
Table 12. The overall FFL preference values ˜ i based on the FFLWA operator.
Table 12. The overall FFL preference values ˜ i based on the FFLWA operator.
F 1 F 2 F 3 F 4 F 5
4.3017 , 0.5831 , 0.5647 8.0000 , 0.7473 , 0.5436 3.2991 , 0.4379 , 0.7336 4.2602 , 0.5254 , 0.5559 3.2791 , 0.6571 , 0.6108
Table 13. Aggregated normalized decision matrix B ^ based on FFLOWG operator.
Table 13. Aggregated normalized decision matrix B ^ based on FFLOWG operator.
A 1 A 2 A 3 A 4 A 5
F 1 6.2263 , 0.2137 , 0.7007 2.7656 , 0.6538 , 0.4637 3.9865 , 0.5937 , 0.3980 1.4768 , 0.5857 , 0.6112 3.9815 , 0.5743 , 0.6318
F 2 4.7577   , 0.6489 , 0.6190 6.4552 , 0.8239 , 0.4017 6.5188 , 0.3211 , 0.3211 7.3788 , 0.9050 , 0.4721 3.3857 , 0.7149 , 0.4160
F 3 3.8103 , 0.6273 , 0.7881 3.1929 , 0.6306 , 0.7975 3.0632 , 0.3571 , 0.5091 2.4951 , 0.4715 , 0.6414 3.4022 , 0.5068 , 0.4347
F 4 4.1466 , 0.4034 , 0.5233 2.2839 , 0.5001 , 0.3805 3.9398 , 0.5654 , 0.5041 4.3441 , 0.5767 , 0.6729 3.3720 , 0.5447 , 0.4377
F 5 2.6262 , 0.6119 , 0.4495 2.7656 , 0.6350 , 0.6754 0.9998 , 0.7958 , 0.5559 5.3982 , 0.4159 , 0.7244 2.3979 , 0.6756 , 0.4893
Table 14. The overall Fermetean fuzzy linguistic preference values ˜ i based on the FFLWG operator.
Table 14. The overall Fermetean fuzzy linguistic preference values ˜ i based on the FFLWG operator.
F 1 F 2 F 3 F 4 F 5
3.1520 , 0.5552 , 0.5861 6.0409 , 0.7785 , 0.4727 3.0867 , 0.5716 , 0.6739 3.6215 , 0.5375 , 0.5460 2.3249 , 0.6565 , 0.6115
Table 15. The score values S ( ˜ i ) and ranking order of the suppliers.
Table 15. The score values S ( ˜ i ) and ranking order of the suppliers.
The Operator Used in Step 2The Operator Used in Step 3Score ValuesRanking of the Suppliers
S ( ˜ 1 ) S ( ˜ 2 ) S ( ˜ 3 ) S ( ˜ 4 ) S ( ˜ 5 )
FFLOWAFFLWA0.26410.62840.15620.25110.2385 F 2 F 1 F 4 F 5 F 3
FFLWG0.24070.48320.16790.25010.2030 F 2 F 4 F 1 F 5 F 3
FFLHA0.26180.62450.15680.25130.2235 F 2 F 1 F 4 F 5 F 3
FFLHG0.24270.53340.17040.24840.2165 F 2 F 4 F 1 F 5 F 3
FFLOWGFFLWA0.24080.48120.17650.23690.2228 F 2 F 1 F 4 F 5 F 3
FFLWG0.21430.46020.19230.23630.1934 F 2 F 4 F 1 F 5 F 3
FFLHA0.23850.46650.18040.23660.2151 F 2 F 1 F 4 F 5 F 3
FFLHG0.21250.42360.18730.22820.1899 F 2 F 4 F 1 F 5 F 3
Table 16. The score values S ( ˜ i ) and ranking order of the suppliers based on different LSFs.
Table 16. The score values S ( ˜ i ) and ranking order of the suppliers based on different LSFs.
LSFThe Operator Used in Step 2The Operator Used in Step 3Score ValuesRanking of the Suppliers
S ( ˜ 1 ) S ( ˜ 2 ) S ( ˜ 3 ) S ( ˜ 4 ) S ( ˜ 5 )
φ * = φ 1 FFLOWAFFLWA0.28130.62830.16100.26160.2414 F 2 F 1 F 4 F 5 F 3
FFLWG0.25310.47850.17020.25640.1797 F 2 F 4 F 1 F 5 F 3
FFLHA0.29050.61200.16020.30270.2336 F 2 F 4 F 1 F 5 F 3
FFLHG0.25230.47190.16860.25160.1813 F 2 F 1 F 4 F 5 F 3
FFLOWGFFLWA0.23680.51570.16290.23090.2074 F 2 F 1 F 4 F 5 F 3
FFLWG0.20020.47930.17520.22650.1629 F 2 F 4 F 1 F 3 F 5
FFLHA0.23730.50130.16380.25000.1929 F 2 F 4 F 1 F 5 F 3
FFLHG0.20000.43860.17220.23730.1560 F 2 F 4 F 1 F 3 F 5
φ * = φ 3
( ρ = τ = 0.8 )
FFLOWAFFLWA0.29130.62830.15910.30610.2448 F 2 F 4 F 1 F 5 F 3
FFLWG0.25540.50600.16690.28910.1695 F 2 F 4 F 1 F 5 F 3
FFLHA0.29050.61200.16020.30270.2336 F 2 F 4 F 1 F 5 F 3
FFLHG0.25690.47720.16610.27790.1718 F 2 F 4 F 1 F 5 F 3
FFLOWGFFLWA0.23980.52700.15370.23190.2009 F 2 F 1 F 4 F 5 F 3
FFLWG0.19310.48640.16500.22740.1901 F 2 F 4 F 1 F 5 F 3
FFLHA0.24120.51240.15540.23370.1907 F 2 F 1 F 4 F 5 F 3
FFLHG0.19420.44550.16400.22320.1481 F 2 F 4 F 1 F 3 F 5
Table 17. The values of the closeness coefficient ( ˜ i ) and ranking order of the suppliers.
Table 17. The values of the closeness coefficient ( ˜ i ) and ranking order of the suppliers.
Aggregation Operator UsedThe Closeness Coefficient ValuesRanking of the Suppliers
( ˜ 1 ) ( ˜ 2 ) ( ˜ 3 ) ( ˜ 4 ) ( ˜ 5 )
FFLWA0.38030.61090.22220.33170.3529 F 2 F 1 F 5 F 4 F 3
FFLWG0.39420.58560.20630.33960.3412 F 2 F 1 F 5 F 4 F 3
Table 18. Results of Spearman’s rank correlation with φ * = φ 1 .
Table 18. Results of Spearman’s rank correlation with φ * = φ 1 .
φ * = φ 1 FFLOWA+ FFLWAFFLOWA
+ FFLWG
FFLOWA
+ FFLHA
FFLOWA
+ FFLHG
FFLOWG
+ FFLWA
FFLOWG
+ FFLWG
FFLOWG
+ FFLHA
FFLOWG
+ FFLHG
FFLOWA+ FFLWA10.10.111−0.30.1−0.3
FFLOWA+ FFLWG0.1110.10.10.610.6
FFLOWA+ FFLHA0.1110.10.10.610.6
FFLOWA+ FFLHG10.10.111−0.30.1−0.3
FFLOWG+ FFLWA10.10.111−0.30.1−0.3
FFLOWG+ FFLWG−0.30.60.6−0.3−0.310.61
FFLOWG+ FFLHA0.1110.10.10.610.6
FFLOWG+ FFLHG−0.30.60.6−0.3−0.310.61
Table 19. Results of Spearman’s rank correlation with φ * = φ 2 .
Table 19. Results of Spearman’s rank correlation with φ * = φ 2 .
φ * = φ 1 FFLOWA+ FFLWAFFLOWA
+ FFLWG
FFLOWA
+ FFLHA
FFLOWA
+ FFLHG
FFLOWG
+ FFLWA
FFLOWG
+ FFLWG
FFLOWG
+ FFLHA
FFLOWG
+ FFLHG
FFLOWA+ FFLWA10.110.110.110.1
FFLOWA+ FFLWG0.110.110.110.11
FFLOWA+ FFLHA10.110.110.110.1
FFLOWA+ FFLHG0.110.110.110.11
FFLOWG+ FFLWA10.110.10.10.110.1
FFLOWG+ FFLWG0.11110.110.11
FFLOWG+ FFLHA10.110.110.110.1
FFLOWG+ FFLHG0.110.110.110.11
Table 20. Results of Spearman’s rank correlation with φ * = φ 3 .
Table 20. Results of Spearman’s rank correlation with φ * = φ 3 .
φ * = φ 1 FFLOWA+ FFLWAFFLOWA+ FFLWGFFLOWA
+ FFLHA
FFLOWA+ FFLHGFFLOWG+ FFLWAFFLOWG+ FFLWGFFLOWG+ FFLHAFFLOWG+ FFLHG
FFLOWA+ FFLWA11110.110.10.6
FFLOWA+ FFLWG11110.110.10.6
FFLOWA+ FFLHA11110.110.10.6
FFLOWA+ FFLHG11110.110.10.6
FFLOWG+ FFLWA0.10.10.10.10.10.11−0.3
FFLOWG+ FFLWG11110.110.10.6
FFLOWG+ FFLHA0.10.10.10.110.11−0.3
FFLOWG+ FFLHG0.60.60.60.6−0.30.6−0.31
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Verma, R. A Decision-Making Approach Based on New Aggregation Operators under Fermatean Fuzzy Linguistic Information Environment. Axioms 2021, 10, 113. https://doi.org/10.3390/axioms10020113

AMA Style

Verma R. A Decision-Making Approach Based on New Aggregation Operators under Fermatean Fuzzy Linguistic Information Environment. Axioms. 2021; 10(2):113. https://doi.org/10.3390/axioms10020113

Chicago/Turabian Style

Verma, Rajkumar. 2021. "A Decision-Making Approach Based on New Aggregation Operators under Fermatean Fuzzy Linguistic Information Environment" Axioms 10, no. 2: 113. https://doi.org/10.3390/axioms10020113

APA Style

Verma, R. (2021). A Decision-Making Approach Based on New Aggregation Operators under Fermatean Fuzzy Linguistic Information Environment. Axioms, 10(2), 113. https://doi.org/10.3390/axioms10020113

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