Next Article in Journal
An Entropy-Assisted Particle Swarm Optimizer for Large-Scale Optimization Problem
Next Article in Special Issue
Granulation of Hypernetwork Models under the q-Rung Picture Fuzzy Environment
Previous Article in Journal
Prediction of Discretization of GMsFEM Using Deep Learning
Previous Article in Special Issue
Extended Fuzzy Metrics and Fixed Point Theorems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linguistic Spherical Fuzzy Aggregation Operators and Their Applications in Multi-Attribute Decision Making Problems

1
Hangzhou College of Commerce, Zhejiang Gongshang University, Hangzhou 310012, China
2
Department of Mathematics, Abdul Wali Khan Univesity, Mardan 23200, Pakistan
3
Department of Mathematics, Air Univerity, Islamabad 44000, Pakistan
4
School of Business, Ningbo University, Ningbo 315211, China
5
School of Managment, Fudan University, Shanghai 200433, China
*
Author to whom correspondence should be addressed.
Submission received: 6 April 2019 / Revised: 29 April 2019 / Accepted: 2 May 2019 / Published: 8 May 2019
(This article belongs to the Special Issue Fuzziness and Mathematical Logic )

Abstract

:
The key objective of the proposed work in this paper is to introduce a generalized form of linguistic picture fuzzy set, so-called linguistic spherical fuzzy set (LSFS), combining the notion of linguistic fuzzy set and spherical fuzzy set. In LSFS we deal with the vague and defective information in decision making. LSFS is characterized by linguistic positive, linguistic neutral and linguistic negative membership degree which satisfies the conditions that the square sum of its linguistic membership degrees is less than or equal to 1. In this paper, we investigate the basic operations of linguistic spherical fuzzy sets and discuss some related results. We extend operational laws of aggregation operators and propose linguistic spherical fuzzy weighted averaging and geometric operators based on spherical fuzzy numbers. Further, the proposed aggregation operators of linguistic spherical fuzzy number are applied to multi-attribute group decision-making problems. To implement the proposed models, we provide some numerical applications of group decision-making problems. In addition, compared with the previous model, we conclude that the proposed technique is more effective and reliable.

1. Introduction

Fuzzy set was first defined by Zadeh in (1965) [1]. Membership function is the only characteristic of the fuzzy set, but it can be hard at times to characterize more fuzzy data. So, to solve this drawback, Atanassov [2] introduced the intuitionistic fuzzy set (IFS), which is the extended form of Fuzzy set (FS), that consists of positive and negative membership degree. After that, in 1994, the notion of interval-valued IFS was introduced by Atanassov [3,4,5,6]. Operational laws and comparison rules for the interval-valued IFS are defined by Atanassov. Recently, more multi-criteria decision making problems have been proposed, which depend on the IFS [7,8,9,10,11,12,13].
In (2013) Yager [14] defined Pythagorean fuzzy set (PyFS). The positive and negative membership degree of PFS satisfied that the sum of square of positive and negative membership degree is less than or equal to one. Yager and Abbasov [15] developed some aggregation operators for multi-attribute decision making (MADM) problems under the Pythagorean fuzzy information. Peng and Yang [16] explain their relationship among these aggregation operators and established the superiority and inferiority ranking of multi-attribute group decision making (MAGDM) method. Using Einstein operation Garg [17] defined the generalized Pythagorean fuzzy information aggregation. Gou et al. [18] discussed many properties of Pythagorean fuzzy set such as continuity, derivability, and differentiability. Zeng et al. [19] examined a hybrid method for Pythagorean fuzzy multiple-criteria decision making (MCDM). Zeng [20], applied the Pythagorean fuzzy probabilistic ordered weighted averaging operator on MAGDM problem. Sajjad et al. [21] defined Pythagorean hesitant fuzzy sets and also discussed their application to group decision making, where the weighting vector is not given. The operation of division and subtraction for the Pythagorean fuzzy set are defined by Peng and Yang [16], and explain their comparable properties. The notion of Pythagorean fuzzy linguistic sets is proposed by Peng and Yong [22], score function and operational laws for the Pythagorean fuzzy linguistic numbers are also developed. Khan et al. [23] proposed the pythagorean fuzzy Dombi aggregation operators based on PyFS information. Liu and Wang [24] proposed some q-rung orthopair fuzzy aggregation operators and discussed their applications to multiple-attribute decision making and in [25] proposed the q-Rung orthopai fuzzy Bonferroni mean aggregation operators.
Cuong [26,27] introduced a novel concept of picture fuzzy set (PFS), which dignified in three different functions presenting the positive, neutral and negative membership degrees. Cuong [28], studied some characteristics of PFSs and also approved their distance measures. Cuong and Hai [29] defined first time fuzzy logic operators and implications on PFSs, and also introduced principle operations for fuzzy derivation forms in the picture fuzzy logic. Cuong et al. [30] examined the characteristic of picture fuzzy t-norm and t-conorm. Phong et al. [31] explored certain configurations of picture fuzzy relations. Wei et al. [32,33,34] defined many procedures to compute the closeness between PFSs. Presently, many researchers have developed more models in the PFSs condition: Correlation coefficients of PFS were proposed by Sing [35], who applies them to clustering analysis. Son et al. [36,37] provided time arrangement calculation and temperature estimation on the basis of PFSs domain. Son et al. [38,39] defined picture fuzzy separation measures, generalized picture fuzzy distance measures and picture fuzzy association measures, and combined it to tackle grouping examination under PFSs condition. To improve the achievements of the classical fuzzy inference system, Son et al. [40] defined a novel fuzzy derivation structure on PFS. Thong et al. [41,42] utilized the picture fuzzy clustering method for complex data and particle clump optimization. Wei [43] exhibited PF aggregation operators and tested them to MADM problem for ranking EPR framework. Using the concept of picture fuzzy weighted cross-entropy, Wei [44] studied basic leadership technique and used this technique to rank the option. Based on PFSs, Yang et al. [45] defined adjustable soft discernibly matrix and tested it in decision making. Garg [46] designed aggregation operations on PFSs and applied them to MCDM problems. Peng et al. [47] proposed a PFS approach for the decision making problem. The readers can also see [48,49] for the PFS. To handle MAGDM problems, Ashraf et al. [50] give two techniques to aggregate the picture fuzzy information, one is picture fuzzy aggregation operators and the second one is using TOPSIS method. Bo and Zhang [51] studied more operations of picture fuzzy relations such as type-2 inclusion relation, type-2 union, type-2 intersection and type-2 complement operations and also defined the anti-reflexive kernel, symmetric kernel, reflexive closure and symmetric closure of a picture fuzzy relation. Ashraf et al. [52] developed the structure of cubic sets to the picture fuzzy sets. They also defined the notion of positive internal, neutral internal, negative internal and positive-external, neutral external and negative external cubic picture fuzzy sets. Ashraf [53] proposed the novel concept of picture fuzzy linguistic fuzzy set and discussed its applications. For further study, we refer to [54,55,56,57].
Sometimes in real life, we face many problems which cannot be handled by using PFS, for example when P ( x ) + I ( x ) + N ( x ) > 1 . In such condition, PFS has no ability to obtain any satisfactory result. Ashraf et al. [58] proposed the new concept of spherical fuzzy set, which is a generalized form of PFSs and Pythgorean fuzzy set to resolve the issues in existing structures. Spherical fuzzy set gives more space to the decision maker to deal with uncertainty in decision making problems. After that, Ashraf and Saleem [59] proposed the aggregation operators for spherical fuzzy sets and in [60] Ashraf et al. proposed the GRA method for spherical fuzzy linguistic fuzzy set and discussed its applications. In [61] Zeng et al. proposed the covering-based spherical fuzzy rough set model hybrid with TOPSIS approach.
According to the analyses above, this study aims to propose the notion of linguistic spherical fuzzy set. In addition, due to the importance of aggregation operators in the decision making technique, we propose averaging and geometric aggregation operators for linguistic spherical fuzzy information. After that, we propose the multi-attribute decision making approach to deal with uncertainty in decision making problems based on defined aggregation operators.
The remainder of this article is arranged as: Section 2 briefly discuses the fundamental notations of linguistic fuzzy set and spherical fuzzy set. In Section 3, we define some operational laws of LSFSs and their proofs. Section 4 consists of linguistic spherical fuzzy aggregation operators. Section 5 consists of some discussion on the application of the defined approach. In Section 6, an algorithm is developed with the numerical example. In Section 7, we discuss the comparison and advantages of the proposed work and finally, conclusions are drawn in Section 8.

2. Preliminaries

Definition 1.
[27] Let Ķ be a universal set, then a PFS R in Ķ is defined as
R = { ( ķ , a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) ) | ķ Ķ } ,
where a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) : Ķ [ 0 , 1 ] , and satisfy the condition that: 0 a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) 1 . Furthermore, a ˘ R ( ķ ) , e ˇ R (ķ) and ı ˘ R (ķ) indicate the positive, neutral and negative grads of the element ķ∈Ķ to the set R , respectively. For each PFS R Ķ , π R (ķ) = 1 a ˘ R ( ķ ) e ˇ R ( ķ ) ı ˘ R (ķ) is said to be the refusal degree of Ķ to R .
Definition 2.
[62,63] Let S ^ = ( s ´ 1 , s ´ 2 , , s ´ g ) be the finite and absolutely order distinct term set. Then, S ^ is said to be a linguistic set, and the value of g is considered an odd number, e.g., 3 , 5 , , when g = 3 , then S ^ can be written as S ^ = ( s ´ 1 , s ´ 2 , s ´ 3 ) = (poor, fair, good)
The following characteristics of the linguistic set S ^ must be satisfied;
(1) Ordered: s ´ k s ´ l , k l ;
(2) Negation: Neg ( s ´ k ) = s ´ g 1 k ;
(3) Max: ( s ´ k , s ´ l ) = s ´ k , iff k l ;
(4) Min: ( s ´ k , s ´ l ) = s ´ k , iff k l .
The extended form of the discrete set S ^ is called a continuous linguistic set and defined as S ^ * = { s ´ ψ | s ´ 0 s ´ ψ s ´ g , ψ [ 0 , g ] , and if s ´ ψ S ^ * , then s ´ ψ is said to be original set otherwise, virtual set.
Definition 3.
[53] Let Ķ 0 , and S ^ * = { s ´ ψ | s ´ 0 s ´ ψ s ´ g , ψ [ 0 , g ] , be a continues linguistic set. Then, a LPFS is defined as
R = { ķ , s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) | ķ Ķ } ,
where s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) S ^ * represent the linguistic positive, linguistic neutral and linguistic negative degrees of the element Ķ to R . Simply, the triple of s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) is denoted as R = s ´ α , s ´ β , s ´ γ and referred to as linguistic picture fuzzy value (LPFV).
For any ķ∈Ķ, the condition α + β + γ g is always satisfied, and π ( ķ ) = s ´ g α β γ is the linguistic refusal degree of Ķ to R . Obviously, if α β γ = g , then LPFS has the minimum linguistic indeterminacy degree, that is, π ( ķ ) = s ´ 0 , which means that the membership degree of ķ to R can be precisely expressed with a single linguistic term and LPFS R is reduced to a linguistic variable. Oppositely, if α = β = γ = 0 , then LPFS R (ķ) has the maximum linguistic indeterminacy degree; that is, π ( ķ ) = s ´ 0 .
Definition 4.
[58] A SFS R on the universal set Ķ is defined as
R = { ķ , a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) | ķ Ķ } ,
where the function a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) : ķ [ 0 , 1 ] . For each ķ∈Ķ a ˘ R ( ķ ) , e ˇ R (ķ) and ı ˘ R (ķ) are respectively called the positive, neutral and negative membership degree of ķ in R , it holds that a ˘ R ( ķ ) 2 + e ˇ R ( ķ ) 2 + ı ˘ R ( ķ ) 2 1 for all ķ∈Ķ, the degree of refusal is defined as π R ( ķ ) = 1 a ˘ R ( ķ ) 2 + e ˇ R ( ķ ) 2 + ı ˘ R ( ķ ) 2 . For SFS { ķ , a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) | ķ∈ķ } , a triple components a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) is called SFN and denoted as R = a ˘ R ( ķ ) , e ˇ R ( ķ ) , ı ˘ R ( ķ ) , where a ˘ R ( ķ ) , e ˇ R (ķ) and ı ˘ R ( ķ ) [ 0 , 1 ] , under the following condition;
0 a ˘ R ( ķ ) 2 + e ˇ R ( ķ ) 2 + ı ˘ R ( ķ ) 2 1 .

3. Linguistic Spherical Fuzzy Set

Definition 5.
Let Ķ be a universe of discourse and S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , g ] , be a continues linguistic term set. Then, a LSFS is defined as
R = { ķ , s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) | ķ Ķ } ,
where s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) S ^ * are the linguistic positive, neutral and negative membership degree of the element ķ to R . The triple s ´ α ( ķ ) , s ´ β ( ķ ) , s ´ γ ( ķ ) is denoted as R = s ´ α , s ´ β , s ´ γ and called is linguistic spherical fuzzy value (LSFV).
For any ķ∈Ķ, the condition α 2 + β 2 + γ 2 g 2 is always satisfied, and π ( ķ ) = s ´ g 2 α 2 β 2 γ 2 is called linguistic refusal degree of ķ to R .
Definition 6.
Let R = s ´ α 1 , s ´ β 1 , s ´ γ 1 is LSFV with s ´ α 1 , s ´ β 1 , s ´ γ 1 S ^ * . Then, we defined the score function as
Ş ( R ) = s ´ ( g 2 + α 2 β 2 γ 2 ) / 3
and defined the accuracy function as
E ¯ ( R ) = s ´ ( α 2 + β 2 + γ 2 ) / 3
It can be easily verified that 0 ( g 2 + α 1 2 β 1 2 γ 1 2 ) / 3 g 2 and α 1 2 + β 1 2 + γ 1 2 g 2 , which means that s ´ g 2 + α 2 β 2 γ 2 / 3 , s ´ α 2 + β 2 + γ 2 / 3 S ^ * .
Now, we define the comparison rules for the two LSFNs R and Z , based on the score and accuracy function.
(a) If Ş ( R ) > Ş ( Z ) , then R > Z ;
(b) If Ş ( R ) = Ş ( Z ) and
  · Ē ( R ) > Ē ( Z ) , then R > Z ;
  · Ē ( R ) = Ē ( Z ) , then, R = Z .
Example 1.
Let R = s ´ 3 , s ´ 5 , s ´ 2 , Z = s ´ 4 , s ´ 3 , s ´ 1 , C ˇ = s ´ 6 , s ´ 4 , s ´ 3 , D = s ´ 2 , s ´ 3 , s ´ 5 are the LSFNs, which are derived from S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , 7 ] } . Using Equation (5), we obtain
Ş ( R ) = s ´ ( 49 + 9 25 4 ) / 3 = s ´ 9.67 ; Ş ( Z ) = s ´ ( 49 + 16 9 1 ) / 3 = s ´ 18.34 ;
Ş ( C ˇ ) = s ´ ( 49 + 36 16 9 ) / 3 = s ´ 20.00 ; Ş ( D ) = s ´ ( 49 + 4 9 25 ) / 3 = s ´ 19.00 ;
Thus, we obtain C ˇ D Z R .
Definition 7.
Let R = s ´ α 1 , s ´ β 1 , s ´ γ 1 and Z = s ´ α 2 , s ´ β 2 , s ´ γ 2 are the two LSFNs, then
(i) R = Z if s ´ α 1 = s ´ α 2 , s ´ β 1 = s ´ β 2 and s ´ γ 1 = s ´ γ 2 ;
(ii) R C ˇ = s ´ γ 1 , s ´ β 1 , s ´ α 1 ;
(iii) R Z = min ( s ´ α 1 , s ´ α 2 ) , min ( s ´ 1 , s ´ β 2 ) , max ( s ´ γ 1 , s ´ γ 2 ) ;
(iv) R Z = max ( s ´ α 1 , s ´ α 2 ) , min ( s ´ 1 , s ´ β 2 ) min ( s ´ γ 1 , s ´ γ 2 ) ;
(v) R < Z if s ´ α 1 < s ´ α 2 , s ´ β 1 > s ´ β 2 and s ´ γ 1 > s ´ γ 2 .
Definition 8.
Let R = s ´ α 1 , s ´ β 1 , s ´ γ 1 and Z = s ´ α 2 , s ´ β 2 , s ´ γ 2 are the two LSFNs, where s ´ α 1 , s ´ β 1 , s ´ γ 1 , s ´ α 2 , s ´ β 2 , s ´ γ 2 S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , g ] } with λ > 0 (λ real number), then
(1) R + Z = s ´ g α 1 2 g 2 + α 2 2 g 2 α 1 2 α 2 2 g 4 , s ´ g β 1 β 2 g 2 , s ´ g γ 1 β 2 g 2 ;
(2) R × Z = s ´ g α 1 α 2 g 2 , s ´ g β 1 2 g 2 + β 2 2 g 2 β 1 2 β 2 2 g 4 , s ´ g γ 1 2 g 2 + γ 2 2 g 2 γ 1 2 γ 2 2 g 4 ;
(3) λ R = s ´ g 1 1 α 1 2 g 2 λ , s ´ g β 1 g λ , s ´ g γ 1 g λ ;
(4) R λ = s ´ g α 1 g λ , s ´ g 1 1 β 1 2 g 2 λ , s ´ g 1 1 γ 1 2 g 2 λ .
Theorem 1.
Let R = s ´ α 1 , s ´ β 1 , s ´ γ 1 and Z = s ´ α 2 , s ´ β 2 , s ´ γ 2 are the two LSFNs, where s ´ α 1 , s ´ β 1 , s ´ γ 1 , s ´ α 2 , s ´ β 2 , s ´ γ 2 S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , g ] } with λ , λ 1 , λ 2 > 0 be a real number, then we have
(1) λ ( R + Z ) = λ R + λ Z ;
(2) ( R × Z ) λ = R λ × Z λ ;
(3) λ 1 R + λ 2 R = ( λ 1 + λ 2 ) R ;
(4) R λ 1 × R λ 2 = R λ 1 + λ 2 ;
(5) R + Z = Z + R ;
(6) R × Z = Z × R .
Proof. 
From the following theorem, we shall only prove part (2), (3) and the proof of the rest are similar.
(2) Since R and Z are the LSFNs, then
R × Z = s ´ g ( α 1 α 2 / g 2 ) , s ´ g β 1 2 / g 2 + β 2 2 β 1 2 β 2 2 / g 4 , s ´ g γ 1 2 / g 2 + γ 2 2 γ 1 2 γ 2 2 / g 4 .
We have
( R × Z ) λ = s ´ g ( α 1 α 2 / g 2 ) λ , s ´ g 1 ( 1 ( β 1 2 / g 2 + β 2 2 / g 2 β 1 2 β 2 2 / g 4 ) ) λ , s ´ g 1 ( 1 ( γ 1 2 / g 2 + γ 2 2 / g 2 γ 1 2 β 2 2 / g 4 ) ) λ = s ´ g ( α 1 / g ) λ ( α 2 / g ) λ , s ´ g 1 ( 1 β 1 2 / g 2 ) λ ( 1 β 2 2 / g 2 ) λ , s ´ g 1 ( 1 γ 1 2 / g 2 ) λ ( 1 γ 2 2 / g 2 ) λ = s ´ g ( α 1 / g ) λ g ( α 2 / g ) λ , s ´ g { 1 ( 1 β 1 2 / g 2 ) λ } + { 1 ( 1 β 2 2 / g 2 ) λ } { 1 ( 1 β 1 2 / g 2 ) λ } { 1 ( 1 β 2 2 / g 2 ) λ } , s ´ g { 1 ( 1 γ 1 2 / g 2 ) λ } + { 1 ( 1 γ 2 2 / g 2 ) λ } { 1 ( 1 γ 1 2 / g 2 ) λ } { 1 ( 1 γ 2 2 / g 2 ) λ } = s ´ g ( α 1 / g 2 ) λ , s ´ g 1 ( 1 β 1 2 / g 2 ) λ , s ´ g 1 ( 1 γ 1 2 / g 2 ) λ × s ´ g ( α 2 / g 2 ) λ , s ´ g 1 ( 1 β 2 2 / g 2 ) λ , s ´ g 1 ( 1 γ 2 2 / g 2 ) λ = R λ × Z λ .
(3) For a real number λ 1 , λ 2 and LSFNs R and Z , we have
λ 1 R = s ´ g 1 ( 1 α 1 2 / g 2 ) λ 1 , s ´ g ( β 1 / g 2 ) λ 1 , s ´ g ( γ 1 / g 2 ) λ 1
and
λ 2 R = s ´ g 1 ( 1 α 1 2 / g 2 ) λ 1 , s ´ g ( β 1 / g 2 ) λ 1 , s ´ g ( γ 1 / g 2 ) λ 1 .
Thus, we have
λ 1 R + λ 2 Z = s ´ g { 1 ( 1 α 1 2 / g 2 ) λ 1 } + { 1 ( 1 α 1 2 / g 2 ) λ 2 } { 1 ( 1 α 1 2 / g 2 ) λ 1 } { 1 ( 1 α 1 2 / g 2 ) λ 2 } , s ´ g ( β 1 / g ) λ 1 ( β 1 / g ) λ 2 , s ´ g ( γ 1 / g ) λ 1 ( γ 1 / g ) λ 2 = s ´ g 1 ( 1 α 1 2 / g 2 ) λ 1 ( 1 α 1 2 / g 2 ) λ 2 , s ´ g ( β 1 / g ) λ 1 + λ 2 , s ´ g ( γ 1 / g ) λ 1 + λ 2 = ( λ 1 + λ 2 ) R .
Hence, λ 1 R + λ 2 Z = ( λ 1 + λ 2 ) R  □
Theorem 2.
Let R = s ´ α 1 , s ´ β 1 , s ´ γ 1 and Z = s ´ α 2 , s ´ β 2 , s ´ γ 2 are the two LSFNs, then
(1) ( R Z ) × ( R Z ) = R × Z ;
(2) ( R Z ) + ( R Z ) = R + Z .
Proof. 
Since, R = s ´ α 1 , s ´ β 1 , s ´ γ 1 and Z = s ´ α 2 , s ´ β 2 , s ´ γ 2 are the two LSFNs, then we have
( R Z ) × ( R Z ) = max ( s ´ α 1 , s ´ α 2 ) , min ( s ´ β 1 , s ´ β 2 ) , min ( s ´ γ 1 , s ´ γ 2 ) × min ( s ´ α 1 , s ´ α 2 ) , min ( s ´ β 1 , s ´ β 2 ) , max ( s ´ γ 1 , s ´ γ 2 ) = s ´ g max ( s ´ α 1 , s ´ α 2 ) / g min ( s ´ α 1 , s ´ α 2 ) / g , s ´ g min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 + min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 , s ´ g min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 + max ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 min ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 max ( s ´ β 1 2 , s ´ β 2 2 ) / g 2 , = s ´ g ( α 1 α 2 / g 2 ) , s ´ g β 1 2 / g 2 + β 2 2 / g 2 β 1 2 β 2 2 / g 4 , s ´ g γ 1 2 / g 2 + γ 2 2 / g 2 γ 1 2 γ 2 2 / g 4 = R × Z .
Part (2) can be similarly proved. □
Theorem 3.
Let R 1 , R 2 , and R 3 are three LSFNs, then
(1) ( R 1 R 2 ) R 3 = ( R 1 R 3 ) ( R 2 R 3 ) ;
(2) ( R 1 R 2 ) R 3 = ( R 1 R 3 ( R 2 R 3 ) ;
(3) ( R 1 R 2 ) + R 3 = ( R 1 + R 3 ) ( R 2 + R 3 ) ;
(4) ( R 1 R 2 ) + R 3 = ( R 1 + R 3 ) ( R 2 + R 3 ) ;
(5) ( R 1 R 2 ) × R 3 = ( R 1 × R 3 ) ( R 2 × R 3 ) ;
(6) ( R 1 R 2 ) × R 3 = ( R 1 × R 3 ) ( R 2 × R 3 ) .
Proof. 
We shall only prove part (1), other parts can be similarly proved.
Let R i = s ´ α i , s ´ β i , s ´ γ i , i = 1 , 2 , 3 are the three LSFNs, then we have
( R 1 R 2 ) R 3 = max ( s ´ α 1 , s ´ α 2 ) , min ( s ´ β 1 , s ´ β 2 ) , min ( s ´ γ 1 , s ´ γ 2 ) ( s ´ α 3 , s ´ β 3 , s ´ γ 3 ) = min ( max ( s ´ α 1 , s ´ α 2 , s ´ α 3 ) , min ( min ( s ´ β 1 , s ´ β 2 ) , s ´ β 3 ) , max ( min ( s ´ γ 1 , s ´ γ 2 ) , s ´ γ 3 ) = ( min ( s ´ α 1 , s ´ α 3 ) , min ( s ´ β 1 , s ´ β 3 ) max ( s ´ γ 1 , s ´ γ 3 ) ) ( min ( s ´ α 2 , s ´ α 3 ) , min ( s ´ β 2 , s ´ β 3 ) max ( s ´ γ 2 , s ´ γ 3 ) ) = ( R 1 R 3 ) ( R 2 R 3 ) .
 □

4. Linguistic Spherical Fuzzy Aggregation Operators

Some series of linguistic spherical fuzzy aggregation operators are defined in this section, and Λ represent the set of all LSFNs.

4.1. Averaging Aggregation Operators

Definition 9.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs. Then, the LSFWA operator of dimension n is a function L S F W A : Λ n Λ , and
L S F W A ( R 1 , R 2 , , R n ) = 1 R 1 + 2 R 2 + . + n R n
where = ( 1 , 2 , , n ) g is the weighting vector of R i ( i = 1 , , n ) with i > 0 , and i = 1 n i = 1 .
Theorem 4.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs. Then, by using the equation of LSFWA operator, the aggregated value is still an LSFN and is given by
L S F W A ( R 1 , R 2 , , R n ) = s ´ g 1 i = 1 n 1 α i 2 / g 2 i , s ´ g i = 1 n β i g i , s ´ g i = 1 n γ i g i
where = ( 1 , 2 , , n ) g is the weighting vector of R i ( i = 1 , , n ) with i > 0 , and i = 1 n i = 1 .
Proof. 
To prove this theorem, we utilized the mathematical induction principle on n.
Step 1: For n = 2 , we have R 1 = s ´ α 1 , s ´ β 1 , s ´ γ 1 and R 2 = s ´ α 2 , s ´ β 2 , s ´ γ 2 . Thus, by the LSFN operation, we have
1 R 1 = s ´ g 1 1 α 1 2 / g 2 1 , s ´ g β 1 g 1 , s ´ g γ 1 g 1 , 2 R 2 = s ´ g 1 1 α 2 2 / g 2 2 , s ´ g β 2 g 2 , s ´ g γ 2 g 2 .
Adding these two equations, we obtain
LSFWA ( α 1 , α 2 ) = 1 R 1 + 2 R 2 = s ´ g 1 1 α 1 2 / g 2 1 , s ´ g β 1 g 1 , s ´ g γ 1 g 1 + s ´ g 1 1 α 2 2 / g 2 2 , s ´ , g β 2 g 2 , s ´ g γ 2 g 2 = s ´ g 1 1 α 1 2 / g 2 1 1 α 2 2 / g 2 2 , s ´ g β 1 g 1 β 2 g 2 , s ´ g γ 1 g 1 γ 2 g 2 = s ´ g 1 i = 1 2 1 α i 2 / g 2 i , s ´ g i = 1 2 β i g i , s ´ g i = 1 2 γ i g i .
Which shows the result holds for n = 2 .
Step 2: Now, we suppose that Equation (8) is true for n = k , and prove for n = k + 1 , then we have
LSFWA ( R 1 , R 2 , , R k + 1 ) = i = 1 k i R i + k + 1 R k + 1 = s ´ g 1 i = 1 k 1 α i 2 / g 2 i , s ´ g i = 1 k β i g 2 1 , s ´ g i = 1 k γ i g 1 + s ´ g 1 1 α k + 1 2 / g 2 k + 1 , s ´ , g β k + 1 g k + 1 , s ´ g γ k + 1 g k + 1 = s ´ g 1 i = 1 k + 1 1 α i 2 / g 2 i , s ´ g i = 1 k + 1 β i g 1 , s ´ g i = 1 k + 1 γ i g 1 .
Hence, the result holds for n = k + 1 , and we proved by mathematical induction principle that the given result is true for all positive integers n .  □
Example 2.
Let R = s ´ 3 , s ´ 5 , s ´ 2 , Z = s ´ 4 , s ´ 3 , s ´ 1 , C ˇ = s ´ 6 , s ´ 4 , s ´ 3 , D = s ´ 2 , s ´ 3 , s ´ 5 are the LSFNs, which are derived from S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , 7 ] } . Assume that = ( 0.4 , 0.2 , 0.3 , , 0.1 ) T be the expert weight. Hence
i = 1 4 1 α i 2 / g 2 i = 1 3 2 / 7 2 0.4 × 1 4 2 / 7 2 0.2 × 1 6 2 / 7 2 0.3 × 1 2 2 / 7 2 0.1 = 0.537 ; i = 1 4 β i / g i = 5 / 7 0.4 × 3 / 7 0.2 × 4 / 7 0.3 × 3 / 7 0.1 = 0.573 ; i = 1 4 β i / g i = 2 / 7 0.4 × 1 / 7 0.2 × 3 / 7 0.3 × 5 / 7 0.1 = 0.310 .
So, using the LSFWA operator, we have
L S F W A ( R 1 , R 2 , R 3 , R 4 ) = s ´ g 1 i = 1 4 1 α i 2 / g 2 i , s ´ g i = 1 4 β i g i , s ´ g i = 1 4 γ i g i = s ´ 7 1 0.5337 , s ´ 7 × 0.573 , s ´ 7 × 0.310 = s ´ 4.76 , s ´ 3.99 , s ´ 2.17 .
Theorem 5.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs and the weight vector of R i ( i = 1 , , n ) are = ( 1 , 2 , , n ) g , where i > 0 and i = 1 n i = 1 , then one has the following:
(1) (Idempotency). If all R i ( i = 1 , 2 , , n ) are equal i.e., R i = s ´ α i , s ´ β i , s ´ γ i = s ´ α , s ´ β , s ´ γ i , then
L S F W A ( R 1 , R 2 , , R n ) = s ´ α , s ´ β , s ´ γ .
(2) (Monotonicity). Let R i = s ´ α i , s ´ β i , s ´ γ i and Z i = s ´ α i * , s ´ β i * , s ´ γ i * are the collection of LSFNs such that s ´ α i * s ´ α i , s ´ β i * s ´ β i and s ´ γ i * s ´ γ i , then
L S F W A ( R 1 , R 2 , , R n ) L S F W A ( Z 1 , Z 2 , , Z n ) .
(3) (Boundedness). Let R = min i ( s ´ α i ) , min i ( s ´ β i ) , max i ( s ´ γ i ) and R + = max i ( s ´ α i ) , min i ( s ´ β i ) , min i ( s ´ γ i ) be the two LSFNs, then
R L S F W A ( R 1 , R 2 , , R n ) R + .
Proof. 
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs which implies that s ´ α i , s ´ β i , s ´ γ i S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , g ] } and α i 2 + β i 2 + γ i 2 g 2 . Then
(1) If R i = s ´ α i , s ´ β i , s ´ γ i = s ´ α , s ´ β , s ´ γ i , then
LSFWA ( R 1 , R 2 , , R n ) = s ´ g 1 i = 1 n 1 α i 2 / g 2 i , s ´ g i = 1 n β i g i , s ´ g i = 1 n γ i g i = s ´ g 1 1 α i 2 / g 2 i = 1 n i , s ´ g β i g i = 1 n i , s ´ g γ i g i = 1 n i = s ´ g 1 1 α i 2 / g 2 i , s ´ g β i g i , s ´ g γ i g i = s ´ α , s ´ β , s ´ γ .
(2) If s ´ α i * s ´ α i for all i , it implies that α i * α i , then we have
α i * α i 0 1 α i * 2 g 2 1 α i 2 g 2 1
1 α i * 2 g 2 i 1 α i 2 g 2 i
i = 1 n 1 α i * 2 g 2 i i = 1 n 1 α i 2 g 2 i
1 i = 1 n 1 α i * 2 g 2 i 1 i = 1 n 1 α i 2 g 2 i
g 2 1 i = 1 n 1 α i * 2 g 2 i g 2 1 i = 1 n 1 α i 2 g 2 i .
On the other hand, s ´ β i * s ´ β i that is β i * β i i , then, β i * g β i g and hence i = 1 n β i * g i i = 1 n β i g i . and s ´ γ i * s ´ γ i that is γ i * γ i i , then, γ i * g γ i g and hence i = 1 n γ i * g i i = 1 n γ i g i . Therefore, according to Definition 6, we get
s ´ g 1 i = 1 n 1 α i * 2 / g 2 i , s ´ g i = 1 n β i * g i , s ´ g i = 1 n γ i * g i s ´ g 1 i = 1 n 1 α i 2 / g 2 i , s ´ g i = 1 n β i g i , s ´ g i = 1 n γ i g i .
That is, LSFW R ( R 1 , R 2 , , R n ) LSFW R ( Z 1 , Z 2 , , Z n ) .
(3) Since min ( i s ´ α i ) s ´ α i max i ( s ´ α i ) , min ( i s ´ β i ) s ´ β i max i ( s ´ β i ) and max ( i s ´ γ i ) s ´ γ i min i ( s ´ γ i ) , i , then, based on the properties of idempotency and monotonicity, we get
min ( i s ´ α i ) , min ( i s ´ β i ) , max i ( s ´ γ i ) LSFWA ( R 1 , R 2 , , R n ) max i ( s ´ α i ) , min ( i s ´ β i ) , min i ( s ´ γ i ) .
That is, R LSFWA ( R 1 , R 2 , , R n ) R + .  □
Definition 10.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs. Then, the LSFOWA operator of dimension n is a mapping L S F O W A : Λ n Λ , and
L S F O W A ( R 1 , R 2 , , R n ) = 1 R ( 1 ) + 2 R ( 2 ) + . + n R ( n ) = s ´ g 1 i = 1 n 1 α ( i ) 2 / g 2 i , s ´ g i = 1 n β ( i ) g i , s ´ g i = 1 n γ ( i ) g i ,
where R ( i ) = s ´ α ( i ) , s ´ β ( i ) , s ´ γ ( i ) is the ith largest of R 1 , R 2 , , R n and = ( 1 , 2 , , n ) T is the associated weight vector of R ( i ) ( i = 1 , , n ) with i > 0 , and i = 1 n i = 1 .
Theorem 6.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs and = ( 1 , 2 , , n ) T be the associated weight vector of R i ( i = 1 , , n ) are, where i > 0 and i = 1 n i = 1 , then one has the following:
(1) (Idempotency). If all R i ( i = 1 , , n ) are equal i.e., R i = s ´ α i , s ´ β i , s ´ γ i = s ´ α , s ´ β , s ´ γ i , then
L S F O W A ( R 1 , R 2 , , R n ) = s ´ α , s ´ β , s ´ γ .
(2) (Monotonicity). Let R i = s ´ α i , s ´ β i , s ´ γ i and Z i = s ´ α i * , s ´ β i * , s ´ γ i * are the set of LSFNs such that s ´ α i * s ´ α i , s ´ β i * s ´ β i and s ´ γ i * s ´ γ i , then
L S F O W A ( R 1 , R 2 , , R n ) L S F O W A ( Z 1 , Z 2 , , Z n ) .
(3) (Boundedness). Let R = min i ( s ´ α i ) , min i ( s ´ β i ) , max i ( s ´ γ i ) and R + = max i ( s ´ α i ) , min i ( s ´ β i ) , min i ( s ´ γ i ) be the two LSFNs, then
R L S F O W A ( R 1 , R 2 , , R n ) R + .

4.2. Geometric Aggregation Operators

Definition 11.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs. Then, the LSFWG operator of dimension n is a mapping L S F W G : Λ n Λ , and
L S F W G ( R 1 , R 2 , , R n ) = i = 1 n R i i = s ´ g i = 1 n α i g i , s ´ g 1 i = 1 n 1 β i 2 / g 2 i , s ´ g 1 i = 1 n 1 γ i 2 / g 2 i ,
where Λ is the collection of all LSFNs, = ( 1 , 2 , , n ) T is the weight vector of R i ( i = 1 , , n ) , such that i > 0 , and i = 1 n i = 1 .
Theorem 7.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs and the weight vector of R i ( i = 1 , , n ) are = ( 1 , 2 , , n ) T , where i > 0 and i = 1 n i = 1 . Then we have the following properties:
(1) (Idempotency). If all R i ( i = 1 , , n ) are equal i.e., R i = s ´ α i , s ´ β i , s ´ γ i = s ´ α , s ´ β , s ´ γ i , then
L S F W G ( R 1 , R 2 , , R n ) = s ´ α , s ´ β , s ´ γ .
(2) (Monotonicity). Let R i = s ´ α i , s ´ β i , s ´ γ i and Z i = s ´ α i * , s ´ β i * , s ´ γ i * are the collecttion of LSFNs such that s ´ α i * s ´ α i , s ´ β i * s ´ β i and s ´ γ i * s ´ γ i , then
L S F W G ( R 1 , R 2 , , R n ) L S F W G ( Z 1 , Z 2 , , Z n ) .
(3) (Boundedness). Let R = ( min i ( s ´ α i ) , min i ( s ´ β i ) , max i ( s ´ γ i ) ) and
R + = ( max i ( s ´ α i ) , min i ( s ´ β i ) , min i ( s ´ γ i ) ) be the two LSFNs, then
R L S F W G ( R 1 , R 2 , , R n ) R + .
Proof. 
The proof of these properties are the same as the proof of Theorem 5. □
Definition 12.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs. Then, the LSFOWG operator of dimension n is a mapping L S F O W G : Λ n Λ , and
L S F O W G ( R 1 , R 2 , , R n ) = i = 1 n R ( i ) i = s ´ g i = 1 n α ( i ) g i , s ´ g 1 i = 1 n 1 β ( i ) 2 / g 2 i , s ´ g 1 i = 1 n 1 γ ( i ) 2 / g 2 i ,
where R ( i ) = s ´ α ( i ) , s ´ β ( i ) , s ´ γ ( i ) is the ith largest of R 1 , R 2 , , R n and = ( 1 , 2 , , n ) T is the associated weight vector of R ( i ) ( i = 1 , , n ) with i > 0 , and i = 1 n i = 1 .
The LSFOWG operator also satisfies the properties as given in Theorem 6.
Lemma 1.
Let ķ i 0 , y i > 0 ( i = 1 , 2 , , n ) and i = 1 n y i = 1 , then
i = 1 n ķ i y i i = 1 n y i ķ i ,
where equality holds only if ķ 1 = ķ 2 = = ķ n .
We derived the following theorem, based on Lemma 1.
Theorem 8.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs, then one has
(i) L S F W A ( R 1 , R 2 , , R n ) L S F W G ( R 1 , R 2 , , R n ) ;
(ii) L S F O W A ( R 1 , R 2 , , R n ) L S F O W G ( R 1 , R 2 , , R n )
with equality if and only if R 1 = R 2 = R n
Proof. 
Let = ( 1 , 2 , , n ) T be the weights of alternative R i ( i = 1 , , n ) with i > 0 and i = 1 n i = 1 . Then, part (i) can be proved as;
By the Lemma 1, we have
i = 1 n 1 α i 2 / g 2 i i = 1 n i 1 α i 2 / g 2 = i = 1 n i i = 1 n i α i 2 / g 2 1 i = 1 n 1 α i 2 / g 2 i i = 1 n i α i 2 / g 2 i = 1 n α i 2 / g 2 i
with equality if and only if α 1 = α 2 = = α n ; that is,
g 2 1 i = 1 n 1 α i 2 / g 2 i g 2 i = 1 n α i 2 / g 2 i g 2 1 i = 1 n 1 α i 2 / g 2 i g 2 i = 1 n α i 2 / g 2 i = g i = 1 n α i / g i s ´ g 1 i = 1 n 1 α i 2 / g 2 i s ´ g i = 1 n α i / g i
with equality if and only if α 1 = α 2 = = α n . On the other hand,
i = 1 n β i 2 / g 2 i i = 1 n i ( β i 2 / g 2 ) = 1 i = 1 n i 1 β i 2 / g 2 i = 1 n β i 2 / g 2 i 1 i = 1 n i 1 β i 2 / g 2 i g 2 i = 1 n β i 2 / g 2 i g 2 1 i = 1 n i 1 β i 2 / g 2 i g i = 1 n β i / g i g 1 i = 1 n i 1 β i 2 / g 2 i s ´ g i = 1 n β i / g i , s ´ g 1 i = 1 n i 1 β i 2 / g 2 i
with equality if and only if β 1 = β 2 = , = β n .
And
i = 1 n γ i 2 / g 2 i i = 1 n i ( γ i 2 / g 2 ) = 1 i = 1 n i 1 γ i 2 / g 2 i = 1 n γ i 2 / g 2 i 1 i = 1 n i 1 γ i 2 / g 2 i g 2 i = 1 n γ i 2 / g 2 i g 2 1 i = 1 n i 1 γ i 2 / g 2 i g i = 1 n γ i / g i g 1 i = 1 n i 1 γ i 2 / g 2 i s ´ g i = 1 n γ i / g i , s ´ g 1 i = 1 n i 1 γ i 2 / g 2 i
with equality if and only if γ 1 = γ 2 = = γ n .
Now, utilizing the score function of LSFNs, we have
s ´ g 1 i = 1 n 1 α i 2 / g 2 i , s ´ g i = 1 n β i / g i , s ´ g i = 1 n γ i / g i s ´ g i = 1 n α i / g i , s ´ g 1 i = 1 n i 1 β i 2 / g 2 i , s ´ g 1 i = 1 n i 1 γ i 2 / g 2 i
with equality if and only if α 1 = α 2 = = α n , β 1 = β 2 = = β n and γ 1 = γ 2 = = γ n ; that as
LSFWA ( R 1 , R 2 , , R n ) LSFWG ( R 1 , R 2 , , R n ) .
 □
Example 3.
Let R 1 = s ´ 1 , s ´ 3 , s ´ 4 , R 2 = s ´ 3 , s ´ 1 , s ´ 5 , R 3 = s ´ 4 , s ´ 2 , s ´ 6 , R 4 = s ´ 2 , s ´ 4 , s ´ 3 are the LSFNs, which are derived from S ^ * = { s ´ α | s ´ 0 s ´ α s ´ g , α [ 0 , 7 ] } . Assume that = ( 0.3 , 0.4 , 0.2 , , 0.1 ) T are the weighting vector of R i .
We obtain the following aggregated LSFNs, by applying Equations (8), and (15):
L S F W A ( R 1 , R 2 , R 3 , R 4 ) = s ´ 7 1 i = 1 4 1 α i 2 / 7 2 i , s ´ 7 i = 1 4 β i 7 i , s ´ 7 i = 1 4 γ i 7 i = s ´ 2.88 , s ´ 1.86 , s ´ 4.61 ; L S F W G ( R 1 , R 2 , , R n ) = s ´ 7 i = 1 4 α i 7 i , s ´ 7 1 i = 1 4 1 β i 2 / 7 2 i , s ´ g 1 i = 1 4 1 γ i 2 / 7 2 i = s ´ 2.18 , s ´ 2.46 , s ´ 4.95 .
From the computational results, we can write
L S F W A ( R 1 , R 2 , , R n ) = s ´ 2.88 , s ´ 1.86 , s ´ 4.61 L S F W G ( R 1 , R 2 , , R n ) = s ´ 2.18 , s ´ 2.46 , s ´ 4.95 .
Now, to determine the aggregated LSFN, utilizing the LSFOWA and LSFOWG operators, first we find the score values of R i ( i = 1 , 2 , 3 , 4 ) as follows:
Ş ( R 1 ) = s ´ ( 49 + 1 9 4 ) / 3 = s ´ 12.33 = s ´ 3.51 , Ş ( R 2 ) = s ´ ( 49 + 9 1 25 ) / 3 = s ´ 10.66 = s ´ 3.26 , Ş ( R 3 ) = s ´ ( 49 + 16 4 36 ) / 3 = s ´ 8.33 = s ´ 2.88 , Ş ( R 4 ) = s ´ ( 49 + 4 16 9 ) / 3 = s ´ 9.33 = s ´ 3.05 .
Since Ş ( R 1 ) > Ş ( R 2 ) > Ş ( R 4 ) > Ş ( R 3 ) , then
R ( 1 ) = R 1 , R ( 2 ) = R 2 , R ( 3 ) = R 4 , R ( 4 ) = R 3 .
The associated weight vector of R ( i ) are = ( 0.155 , 0.345 , 0.345 , 0.155 ) T , and can be determined by the normal distribution method [64]. Then, by Equations (8) and (19), we have
L S F O W A ( R 1 , R 2 , , R n ) = s ´ 7 1 i = 1 4 1 α ( i ) 2 / 7 2 i , s ´ 7 i = 1 4 β ( i ) 7 i , s ´ 7 i = 1 4 γ ( i ) 7 i = s ´ 2.79 , s ´ 2.12 , s ´ 4.14 ; L S F O W G ( R 1 , R 2 , , R n ) = s ´ 7 i = 1 4 α ( i ) 7 i , s ´ 7 1 i = 1 4 1 β ( i ) 2 / 7 2 i , s ´ 7 1 i = 1 4 1 γ ( i ) 2 / 7 2 i = s ´ 2.32 , s ´ 2.93 , s ´ 4.64 .
From these results, we prove that
L S F O W G ( R 1 , R 2 , , R n ) = s ´ 2.79 , s ´ 2.12 , s ´ 4.14 > L S F O W G ( R 1 , R 2 , , R n ) = s ´ 2.32 , s ´ 2.93 , s ´ 4.64 .

4.3. Some Properties of Linguistic Spherical Fuzzy Weighted Aggregation Operators

Theorem 9.
Let R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) be the set of LSFNs, and R = s ´ α , s ´ β , s ´ γ is also LSFN, with the weighting vector = ( 1 , 2 , , n ) T , where i > 0 and i = 1 n i = 1 , then
(1) L S F W A ( R 1 + R , R 2 + R , , R n + R ) L S F W A ( R 1 × R , R 2 × R , , R n × R ) ,
(2) L S F W G ( R 1 + R , R 2 + R , , R n + R ) L S F W G ( R 1 × R , R 2 × R , , R n × R ) ,
(3) L S F W A ( R 1 + R , R 2 + R , , R n + R ) L S F W A ( R 1 , R 2 , , R n ) × R ,
(4) L S F W G ( R 1 + R , R 2 + R , , R n + R ) L S F W G ( R 1 , R 2 , , R n ) × R ,
(5) L S F W A ( ( R 1 , R 2 , , R n ) + R L S F W A ( R 1 , R 2 , , R n ) × R ,
(6) L S F W G ( ( R 1 , R 2 , , R n ) + R L S F W G ( R 1 , R 2 , , R n ) × R .
Proof. 
We shall prove only part (1), (3) and (5) and the proofs of the remaining parts are similarly proved.
(1) For R i = s ´ α i , s ´ β i , s ´ γ i ( i = 1 , , n ) and R = s ´ α , s ´ β , s ´ γ , we can write
R i + R = s ´ g 1 1 α i 2 / g 2 i 1 α 2 / g 2 , s ´ g β i g i β g , s ´ g γ i g i γ g .
Now,
α i 2 g 2 + α 2 g 2 α i 2 α 2 g 4 α i 2 α 2 g 4 1 α i 2 g 2 1 α 2 g 2 1 α i 2 α 2 g 4 i = 1 n 1 α i 2 g 2 i 1 α 2 g 2 i = 1 n 1 α i 2 α 2 g 4 i 1 i = 1 n 1 α i 2 g 2 i 1 α 2 g 2 1 i = 1 n 1 α i 2 α 2 g 4 i g 1 i = 1 n 1 α i 2 g 2 i 1 α 2 / g 2 g 1 i = 1 n 1 α i 2 α 2 g 4 i s ´ g 1 i = 1 n 1 α i 2 g 2 i 1 / g 2 s ´ g 1 i = 1 n 1 α i 2 α 2 g 4 i .
Similarly, we get
s ´ g i = 1 n β i g i β g s ´ g i = 1 n 1 1 β i 2 / g 2 1 β 2 / g 2 i
and
s ´ g i = 1 n γ i g i γ g s ´ g i = 1 n 1 1 γ i 2 / g 2 1 γ 2 / g 2 i .
Thus, by using Equation (8), we get
LSFWA ( R 1 + R , R 2 + R , , R n + R ) = s ´ g 1 i = 1 n 1 α i 2 / g 2 i 1 α 2 / g 2 , s ´ g i = 1 n β i g i β g , s ´ g i = 1 n γ i g i γ g
and
LSFWA ( R 1 + R , R 2 + R , , R n + R ) = s ´ g 1 i = 1 n 1 α i 2 / g 2 i 1 α 2 / g , s ´ g i = 1 n 1 1 β i 2 / g 2 1 β 2 / g 2 i , s ´ g i = 1 n 1 1 γ i 2 / g 2 1 γ 2 / g 2 i .
According to Definition 6, we get
LSFWA ( R 1 + R , R 2 + R , , R n + R ) LSFWA ( R 1 × R , R 2 × R , , R n × R ) .
(3) Since 1 α 2 g 2 1 , which implies that
i = 1 n 1 α i 2 / g 2 i i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) 1 i = 1 n 1 α i 2 / g 2 i 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) 1 i = 1 n 1 α i 2 / g 2 i 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) α g 1 i = 1 n 1 α i 2 / g 2 i α g 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) g ( α / g ) 1 i = 1 n 1 α i 2 / g 2 i g 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) s ´ g ( α / g ) 1 i = 1 n 1 α i 2 / g 2 i s ´ g 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) .
Similarly, we show that
s ´ g i = 1 n β i g i β g s ´ g 1 1 i = 1 n β i 2 g 2 i 1 β 2 / g 2
and
s ´ g i = 1 n γ i g i γ g s ´ g 1 1 i = 1 n γ i 2 g 2 i 1 γ 2 / g 2 .
Since,
LSFWA ( R 1 + R , R 2 + R , , R n + R ) = s ´ g 1 i = 1 n 1 α i 2 / g 2 i ( 1 α 2 / g 2 ) , s ´ g i = 1 n β i g i β g , s ´ g i = 1 n γ i g i γ g
and
LSFWA ( R 1 , R 2 , , R n ) × R = s ´ g 1 i = 1 n 1 α i 2 / g 2 i , s ´ g i = 1 n β i g i , s ´ g i = 1 n γ i g i × s ´ α , s ´ β , s ´ γ = s ´ g ( α / g ) 1 i = 1 n 1 α i 2 / g 2 i , s ´ g 1 1 i = 1 n β i 2 g 2 i 1 β 2 / g 2 , s ´ g 1 1 i = 1 n γ i 2 g 2 i 1 γ 2 / g 2 .
Thus, according to Definition 6, we get
LSFWA ( R 1 + R , R 2 + R , , R n + R ) LSFWA ( R 1 , R 2 , , R n ) × R .
 □

5. Algorithm for Decision Making Problem with Linguistic Spherical Fuzzy Information

Assume that we have m alternatives R = { R 1 , R 2 , , R m ) and n attributes C ˇ = { C ˇ 1 , C ˇ 2 , , C ˇ n ) , whose weighting vectors are = ( 1 , 2 , , n ) T , with j > 0 and j = 1 n j = 1 . Decision maker set is D = { d 1 , d 2 , , d p ) , where υ k denotes their weights, such that υ k > 0 and k = 1 p υ k = 1 . The decision maker gives their preference values in LSFNs form, α i j k = s ´ α i j k , s ´ β i j k , s ´ γ i j k , where s ´ α i j k , s ´ β i j k , s ´ γ i j k S ^ * = { s ´ h | h [ 0 , 1 ] } for every alternative under the given attributes. The decision maker collective information is given in the form of the decision matrix R k = α i j k m × n .
Step 1. Developed the linguistic spherical fuzzy decision-matrix R k = α i j k m × n .
Step 2. Using the LSFOWA operator:
r i j = s ´ α i j , s ´ β i j , s ´ γ i j = LSFOWA ( α i j 1 , α i j 2 , , α i j l ) = s ´ g 1 k = 1 l 1 α ( i j ) k 2 / g 2 υ k , s ´ g k = 1 l γ ( i j ) k g υ k , s ´ g k = 1 l γ ( i j ) k g υ k
or using the LSFOWG operator:
r i j = s ´ α i j , s ´ β i j , s ´ γ i j = LSFOWG ( α i j 1 , α i j 2 , , α i j l ) = s ´ g k = 1 l α ( i j ) k g υ k , s ´ g 1 k = 1 l 1 β ( i j ) k 2 / g 2 υ k , s ´ g 1 k = 1 l 1 γ ( i j ) k 2 / g 2 υ k .
Step 3. Accumulate all r i j ( j = 1 , , n ) for every alternative R i ( i = 1 , , m ) by the LSFWA operator:
r i = LSFWA ( r i 1 , r i 2 , , r i n ) = s ´ g 1 j = 1 n 1 α i j 2 / g 2 i , s ´ g j = 1 n β i j g i , s ´ g j = 1 n γ i j g i
or using the LSFWG operator
r i = LSFWA ( r i 1 , r i 2 , , r i n ) = s ´ g j = 1 n α i j g i , s ´ g 1 j = 1 n 1 β i j 2 / g 2 i , s ´ g 1 j = 1 n 1 γ i j 2 / g 2 i .
Step 4. Rank the alternative R i , according to the Definition 6.

6. Illustrative Example

In this section, we will present the proposed method of MADM based on linguistic spherical fuzzy information which relates the assessment and rank of heavy rainfall in the Lasbella district and adjoining areas of the Baluchistan, Pakistan. Then, the decision making approach will provide the desired ranking.
A recent storm caused a spell of heavy rainfall in the Lasbella district, and adjoining areas of Baluchistan, Pakistan were hit with unprecedented flash floods in February 2019. A large number of roads, which connect the Lasbella district with other parts of Baluchistan were destroyed in this flood. In this context, the Pakistan government has had to take on a considerable number of road building projects either to preserve the roads already built or to undertake new roads.
These projects have been carried out by a limited number of well-established contractors, and the selection process has been on the basis of bid price alone. In recent years, the increased project complexity, technical capability, higher performance, and safety and financial requirements have been demanding the use of multi-attribute decision making methods. For this, the Pakistan government has issued a notice in the newspapers, and three experts take the responsibility of selecting the best construction company out of a set of four possible alternatives, X = R 1 = Ahmed Construction , R 2 = Matracon Pakistan Private ( Pvt ) Limited ( Ltd ) , R 3 = Eastern Highway Company , R 4 = Banu Mukhtar Concrete Pvt . Ltd .
On the basis of the attributes, C ˇ 1 = technical capability, C ˇ 2 = higher performance, C ˇ 3 = saifiety, C ˇ 4 = financial requirements, bids for these projects will take place. The objective of the government is to choose the best construction company. In order to fulfill this, the three experts d 1 , d 2 , and d 3 are call to give their preferences for every alternative under the given attributes with the linguistic term set S ^ = ( s ´ 1 , s ´ 2 , s ´ 3 , s ´ 4 , s ´ 5 , s ´ 6 , s ´ 7 , s ´ 8 , s ´ 9 ) . Consider = ( 0.3 , 0.1 , 0.2 , 0.4 ) T the weighting vector of attributes.
Step 1: For each alternative, preferences of the experts are given in the form of decision-matrices R k = α i j k 4 × 4 ( k = 1 , 2 , 3 ) are shown in Table 1, Table 2 and Table 3.
Step 2: We utilized the normal distribution method [64] to compute the associated weighting vector of the decision maker and get υ = ( 0.243 , 0.514 , 0.243 ) T . Now, we utilize the LSFOWA and LSFOWG operators to aggregate the decision-matrices R = r i j 4 × 4 are shown in Table 4 and Table 5.
Step 3: We used the LSFWA and LSFWG operators to aggregate r i j ( j = 1 , , 4 ) into the cumulative r i for every alternative R i ( i = 1 , , 4 ) , under the attribute weighting vector = ( 0.3 , 0.1 , 0.2 , 0.3 ) T . We summarized the corresponding results and their ranking in Table 6.
Step 4:. Rank of the alternatives are follows

7. Comparative Study and Discussion

In this comparison, we used the method proposed by S. Ashraf and S. Abdullah [58] to solve the example used in this paper. As the attribute information in [58] occurs in the form of SFNs, we then convert LSFNs to SFNs.
From Table 7, we observe that there is no difference in the ranking result between our approach and the approach developed in [58]. Thus, our method is more generalized than the method proposed in [58], and our approach has a wider range of applications than the approach proposed in [58]. From Table 7, it is clear that the ranking of alternatives is the same in the linguistic spherical fuzzy numbers and spherical fuzzy numbers [58].

8. Conclusions

The objective of writing this article is to present the notion of “linguistic spherical fuzzy set”, which is the combination of LFSs and SFSs. The basic properties of linguistic spherical fuzzy operators are discussed. Subsequently, we write a new algorithm for the decision-making based on the defined linguistic spherical fuzzy aggregation operators by analyzing the limitations and advantages in the existing literature. The proposed approach will yield an objective decision result based on information from the decision problem only. Finally, we include a descriptive example to show the appropriateness of the developed technique, and a comparison with the existing method.

Author Contributions

Conceptualization, S.A. (Shahzaib Ashraf) and S.A. (Saleem Abdullah); methodology, M.Q.; software, S.A. (Shahzaib Ashraf); validation, H.J., S.A. (Shahzaib Ashraf), S.A. (Saleem Abdullah) M.Q., M.B. and S.Z.; formal analysis, S.A. (Shahzaib Ashraf); investigation, S.A. (Shahzaib Ashraf); data curation, M.Q.; writing—original draft preparation, S.A. (Shahzaib Ashraf), M.Q.; writing—review and editing, H.J., S.A. (Saleem Abdullah), M.B. and S.Z.; visualization, S.A. (Saleem Abdullah), S.Z.; supervision, S.A. (Shahzaib Ashraf); project administration, S.A. (Shahzaib Ashraf); funding acquisition, S.Z.

Funding

This paper is supported by Philosophy and Social Science Planning Projects of Zhejiang (No. 16ZJQN022YB), Zhejiang Province Natural Science Foundation (No. LY18G010007), Zhejiang Public Technology Applied Research Projects (No. LGG18F020001), Major Humanities and Social Sciences Research Projects in Zhejiang Universities (No. 2018QN058) and K. C. Wong Magna Fund in Ningbo University.

Acknowledgments

The authors would like to thank the editor in chief, associate editor and the anonymous referees for detailed and valuable comments which helped to improve this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Adamopoulos, G.I.; Pappis, C.P. A fuzzy-linguistic approach to a multi-criteria sequencing problem. Eur. J. Oper. Res. 1996, 92, 628–636. [Google Scholar] [CrossRef]
  3. Bustince, H. Handling multicriteria fuzzy decision making problems based on intuitionistic fuzzy sets. Notes Intuit. Fuzzy Sets 1995, 1, 42–47. [Google Scholar]
  4. Li, D.F. Multiattribute decision making models and methods using intuitionistic fuzzy sets. J. Comput. Syst. Sci. 2005, 70, 73–85. [Google Scholar] [CrossRef]
  5. Lin, L.; Yuan, X.H.; Xia, Z.Q. Multicriteria fuzzy decision-making methods based on intuitionistic fuzzy sets. J. Comput. Syst. Sci. 2007, 73, 84–88. [Google Scholar] [CrossRef]
  6. Wang, X.F.; Wang, J.Q.; Yang, W.E. Multi-criteria group decision making method based on intuitionistic linguistic aggregation operators. J. Intell. Fuzzy Syst. 2014, 26, 115–125. [Google Scholar]
  7. Zhao, H.; Xu, Z.; Ni, M.; Liu, S. Generalized aggregation operators for intuitionistic fuzzy sets. Int. J. Intell. Syst. 2010, 25, 1–30. [Google Scholar] [CrossRef]
  8. Li, J.; Zhang, C. A new solution of intuitionistic fuzzy multiple attribute decision-making based on attributes preference. In Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, Tianjin, China, 14–16 August 2009; Volume 3, pp. 228–232. [Google Scholar]
  9. Liu, P. Some Hamacher aggregation operators based on the interval-valued intuitionistic fuzzy numbers and their application to Group Decision Making. IEEE Trans. Fuzzy Syst. 2014, 22, 83–97. [Google Scholar] [CrossRef]
  10. Liu, P.; Zhang, X. Approach to Multi-Attributes Decision Making with Intuitionistic Linguistic Information based on Dempster-Shafer Evidence Theory. IEEE Access 2018, 6, 52969–52981. [Google Scholar] [CrossRef]
  11. Bagga, P.; Joshi, A.; Hans, R. QoS based Web Service Selection and Multi-Criteria Decision Making Methods. Int. J. Interact. Multimed. Artif. Intell. 2019, 5, 113–121. [Google Scholar] [CrossRef]
  12. Alberto Carrasco, R.; Francisca Blasco, M.; García-Madariaga, J.; Herrera-Viedma, E. A Fuzzy Linguistic RFM Model Applied to Campaign Management. Int. J. Interact. Multimed. Artif. Intell. 2019, 5, 21–27. [Google Scholar]
  13. Morente-Molinera, J.A.; Kou, G.; González-Crespo, R.; Corchado, J.M.; Herrera-Viedma, E. Solving multi-criteria group decision making problems under environments with a high number of alternatives using fuzzy ontologies and multi-granular linguistic modelling methods. Knowl.-Based Syst. 2017, 137, 54–64. [Google Scholar] [CrossRef]
  14. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  15. 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]
  16. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  17. Garg, H. A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making. Int. J. Intell. Syst. 2016, 31, 886–920. [Google Scholar] [CrossRef]
  18. Gou, X.; Xu, Z.; Ren, P. The properties of continuous Pythagorean fuzzy information. Int. J. Intell. Syst. 2016, 31, 401–424. [Google Scholar] [CrossRef]
  19. Zeng, S.; Chen, J.; Li, X. A hybrid method for Pythagorean fuzzy multiple-criteria decision making. Int. J. Inf. Technol. Decis. Mak. 2016, 15, 403–422. [Google Scholar] [CrossRef]
  20. Zeng, S. Pythagorean fuzzy multiattribute group decision making with probabilistic information and OWA approach. Int. J. Intell. Syst. 2017, 32, 1136–1150. [Google Scholar] [CrossRef]
  21. Khan, M.S.A.; Abdullah, S.; Ali, A.; Siddiqui, N.; Amin, F. Pythagorean hesitant fuzzy sets and their application to group decision making with incomplete weight information. J. Intell. Fuzzy Syst. 2017, 33, 3971–3985. [Google Scholar] [CrossRef]
  22. Peng, X.D.; Yang, Y. Multiple attribute group decision making methods based on Pythagorean fuzzy linguistic set. Comput. Eng. Appl. 2016, 52, 50–55. [Google Scholar]
  23. Khan, A.A.; Ashraf, S.; Abdullah, S.; Qiyas, M.; Luo, J.; Khan, S.U. Pythagorean Fuzzy Dombi Aggregation Operators and Their Application in Decision Support System. Symmetry 2019, 11, 383. [Google Scholar] [CrossRef]
  24. Liu, P.; Wang, P. Some q-Rung Orthopair Fuzzy Aggregation Operators and Their Applications to Multiple-Attribute Decision Making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  25. Liu, P.; Liu, J. Some q-Rung Orthopai Fuzzy Bonferroni Mean Operators and Their Application to Multi-Attribute Group Decision Making. Int. J. Intell. Syst. 2018, 33, 315–347. [Google Scholar] [CrossRef]
  26. Cuong, B.C. Picture Fuzzy Sets-First Results. Part 2, Seminar Neuro-Fuzzy Systems with Applications; Institute of Mathematics: Hanoi, Vietnam, 2013. [Google Scholar]
  27. Cuongg, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409. [Google Scholar]
  28. Cuong, B.C.; Van Hai, P. Some fuzzy logic operators for picture fuzzy sets. In Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE), Ho Chi Minh City, Vietnam, 8–10 October 2015; pp. 132–137. [Google Scholar]
  29. Cuong, B.C.; Kreinovitch, V.; Ngan, R.T. A classification of representable t-norm operators for picture fuzzy sets. In Proceedings of the 2016 Eighth International Conference on Knowledge and Systems Engineering (KSE), Hanoi, Vietnam, 6–8 October 2016; pp. 19–24. [Google Scholar]
  30. Phong, P.H.; Hieu, D.T.; Ngan, R.T.; Them, P.T. Some compositions of picture fuzzy relations. In Proceedings of the 7th National Conference on Fundamental and Applied Information Technology Research (FAIR’7), Thai Nguyen, Vietnam, 19–20 June 2014; pp. 19–20. [Google Scholar]
  31. Wei, G.; Alsaadi, F.E.; Hayat, T.; Alsaedi, A. Projection models for multiple attribute decision making with picture fuzzy information. Int. J. Mach. Learn. Cybern. 2018, 9, 713–719. [Google Scholar] [CrossRef]
  32. Wei, G.; Gao, H. The generalized Dice similarity measures for picture fuzzy sets and their applications. Informatica 2018, 29, 107–124. [Google Scholar] [CrossRef]
  33. Wei, G. Some similarity measures for picture fuzzy sets and their applications. Iran. J. Fuzzy Syst. 2018, 15, 77–89. [Google Scholar]
  34. Singh, P. Correlation coefficients for picture fuzzy sets. J. Intell. Fuzzy Syst. 2015, 28, 591–604. [Google Scholar]
  35. Son, L.H. DPFCM. Expert Syst. Appl. Int. J. 2015, 42, 51–66. [Google Scholar] [CrossRef]
  36. Thong, P.H. A new approach to multi-variable fuzzy forecasting using picture fuzzy clustering and picture fuzzy rule interpolation method. In Knowledge and Systems Engineering; Springer: Cham, Switzerland, 2015; pp. 679–690. [Google Scholar]
  37. Son, L.H. Generalized picture distance measure and applications to picture fuzzy clustering. Appl. Soft Comput. 2016, 46, 284–295. [Google Scholar] [CrossRef]
  38. Son, L.H. Measuring analogousness in picture fuzzy sets: From picture distance measures to picture association measures. Fuzzy Optim. Decis. Mak. 2017, 16, 359–378. [Google Scholar] [CrossRef]
  39. Van Viet, P.; Van Hai, P. Picture inference system: a new fuzzy inference system on picture fuzzy set. Appl. Intell. 2017, 46, 652–669. [Google Scholar]
  40. Thong, P.H. Picture fuzzy clustering for complex data. Eng. Appl. Artif. Intell. 2016, 56, 121–130. [Google Scholar] [CrossRef]
  41. Thong, P.H. A novel automatic picture fuzzy clustering method based on particle swarm optimization and picture composite cardinality. Knowl.-Based Syst. 2016, 109, 48–60. [Google Scholar] [CrossRef]
  42. Wei, G. Picture fuzzy aggregation operators and their application to multiple attribute decision making. J. Intell. Fuzzy Syst. 2017, 33, 713–724. [Google Scholar] [CrossRef]
  43. Wei, G. Picture fuzzy cross-entropy for multiple attribute decision making problems. J. Bus. Econ. Manag. 2016, 17, 491–502. [Google Scholar] [CrossRef]
  44. Yang, Y.; Liang, C.; Ji, S.; Liu, T. Adjustable soft discernibility matrix based on picture fuzzy soft sets and its applications in decision making. J. Intell. Fuzzy Syst. 2015, 29, 1711–1722. [Google Scholar] [CrossRef]
  45. Garg, H. Some picture fuzzy aggregation operators and their applications to multicriteria decision-making. Arab. J. Sci. Eng. 2017, 42, 5275–5290. [Google Scholar] [CrossRef]
  46. Peng, X.; Dai, J. Algorithm for picture fuzzy multiple attribute decision-making based on new distance measure. Int. J. Uncertain. Quantif. 2017, 7, 177–187. [Google Scholar] [CrossRef]
  47. Phuong, P.T.M.; Thong, P.H. Theoretical analysis of picture fuzzy clustering: Convergence and property. J. Comput. Sci. Cybern. 2018, 34, 17–32. [Google Scholar] [CrossRef]
  48. Thong, P.H.; Fujita, H. Interpolative picture fuzzy rules: A novel forecast method for weather nowcasting. In Proceedings of the 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Vancouver, BC, Canada, 24–29 July 2016; pp. 86–93. [Google Scholar]
  49. Van Viet, P.; Chau, H.T.M.; Van Hai, P. Some extensions of membership graphs for picture inference systems. In Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE), Ho Chi Minh City, Vietnam, 8–10 October 2015; pp. 192–197. [Google Scholar]
  50. Ashraf, S.; Mahmood, T.; Abdullah, S.; Khan, Q. Different approaches to multi-criteria group decision making problems for picture fuzzy environment. Bull. Braz. Math. Soc. New Ser. 2018, 1–25. [Google Scholar] [CrossRef]
  51. Bo, C.; Zhang, X. New operations of picture fuzzy relations and fuzzy comprehensive evaluation. Symmetry 2017, 9, 268. [Google Scholar] [CrossRef]
  52. Ashraf, S.; Abdullah, S.; Qadir, A. Novel concept of cubic picture fuzzy sets. J. New Theory 2018, 24, 59–72. [Google Scholar]
  53. Ashraf, S.; Mehmood, T.; Abdullah, S.; Khan, Q. Picture Fuzzy Linguistic Sets and Their Applications for Multi-Attribute Group. The Nucleus 2018, 55, 66–73. [Google Scholar]
  54. Khan, M.J.; Kumam, P.; Ashraf, S.; Kumam, W. Generalized Picture Fuzzy Soft Sets and Their Application in Decision Support Systems. Symmetry 2019, 11, 415. [Google Scholar] [CrossRef]
  55. Zeng, S.; Ashraf, S.; Arif, M.; Abdullah, S. Application of Exponential Jensen Picture Fuzzy Divergence Measure in Multi-Criteria Group Decision Making. Mathematics 2019, 7, 191. [Google Scholar] [CrossRef]
  56. Ashraf, S.; Abdullah, S.; Smarandache, F. Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems. Symmetry 2019, 11, 364. [Google Scholar] [CrossRef]
  57. Qiyas, M.; Abdullah, S.; Ashraf, S. Solution of multi-criteria group decision making problem based on picture linguistic informations. Int. J. Algebra Stat. 2019, 8, 1–11. [Google Scholar] [CrossRef]
  58. Ashraf, S.; Abdullah, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2019, 36, 2829–2844. [Google Scholar] [CrossRef]
  59. Ashraf, S.; Abdullah, S. Spherical aggregation operators and their application in multiattribute group decision-making. Int. J. Intell. Syst. 2019, 34, 493–523. [Google Scholar] [CrossRef]
  60. Ashraf, S.; Abdullah, S.; Mahmood, T. GRA method based on spherical linguistic fuzzy Choquet integral environment and its application in multi-attribute decision-making problems. Math. Sci. 2018, 12, 263–275. [Google Scholar] [CrossRef]
  61. Zeng, S.; Hussain, A.; Mahmood, T.; Irfan Ali, M.; Ashraf, S.; Munir, M. Covering-Based Spherical Fuzzy Rough Set Model Hybrid with TOPSIS for Multi-Attribute Decision-Making. Symmetry 2019, 11, 547. [Google Scholar] [CrossRef]
  62. Phong, P.H.; Cuong, B.C. Max–Min Composition of Linguistic Intuitionistic Fuzzy Relations and Application in Medical Diagnosis. VNU J. Sci. Comput. Sci. Commun. Eng. 2015, 30, 57–65. [Google Scholar]
  63. Herrera, F.; Herrera-Viedma, E. Linguistic decision analysis: Steps for solving decision problems under linguistic information. Fuzzy Sets Syst. 2000, 115, 67–82. [Google Scholar] [CrossRef]
  64. Xu, Z. An overview of methods for determining OWA weights. Int. J. Intell. Syst. 2005, 20, 843–865. [Google Scholar] [CrossRef]
Table 1. R 1 (Decision-matrix).
Table 1. R 1 (Decision-matrix).
C ˇ 1 C ˇ 2 C ˇ 3 C ˇ 4
R 1 s ´ 3 , s ´ 2 , s ´ 5 s ´ 2 , s ´ 4 , s ´ 3 s ´ 7 , s ´ 5 , s ´ 4 s ´ 5 , s ´ 4 , s ´ 2
R 2 s ´ 5 , s ´ 7 , s ´ 3 s ´ 6 , s ´ 7 , s ´ 8 s ´ 8 , s ´ 3 , s ´ 7 s ´ 4 , s ´ 6 , s ´ 4
R 3 s ´ 4 , s ´ 5 , s ´ 2 s ´ 2 , s ´ 3 , s ´ 5 s ´ 6 , s ´ 1 , s ´ 4 s ´ 5 , s ´ 7 , s ´ 3
R 4 s ´ 7 , s ´ 1 , s ´ 4 s ´ 3 , s ´ 4 , s ´ 8 s ´ 5 , s ´ 6 , s ´ 2 s ´ 6 , s ´ 4 , s ´ 2
Table 2. R 2 (Decision-matrix).
Table 2. R 2 (Decision-matrix).
C ˇ 1 C ˇ 2 C ˇ 3 C ˇ 4
R 1 s ´ 4 , s ´ 6 , s ´ 2 s ´ 6 , s ´ 5 , s ´ 3 s ´ 4 , s ´ 3 , s ´ 4 s ´ 1 , s ´ 4 , s ´ 7
R 2 s ´ 7 , s ´ 3 , s ´ 5 s ´ 1 , s ´ 2 , s ´ 6 s ´ 5 , s ´ 3 , s ´ 2 s ´ 2 , s ´ 4 , s ´ 3
R 3 s ´ 5 , s ´ 2 , s ´ 4 s ´ 3 , s ´ 6 , s ´ 5 s ´ 2 , s ´ 1 , s ´ 4 s ´ 7 , s ´ 5 , s ´ 3
R 4 s ´ 6 , s ´ 1 , s ´ 7 s ´ 3 , s ´ 8 , s ´ 3 s ´ 2 , s ´ 2 , s ´ 5 s ´ 4 , s ´ 2 , s ´ 6
Table 3. R 3 (Decision-matrix).
Table 3. R 3 (Decision-matrix).
C ˇ 1 C ˇ 2 C ˇ 3 C ˇ 4
R 1 s ´ 8 , s ´ 4 , s ´ 3 s ´ 2 , s ´ 2 , s ´ 5 s ´ 1 , s ´ 2 , s ´ 6 s ´ 7 , s ´ 3 , s ´ 4
R 2 s ´ 3 , s ´ 7 , s ´ 4 s ´ 5 , s ´ 3 , s ´ 2 s ´ 6 , s ´ 2 , s ´ 3 s ´ 2 , s ´ 6 , s ´ 3
R 3 s ´ 6 , s ´ 5 , s ´ 1 s ´ 7 , s ´ 6 , s ´ 5 s ´ 2 , s ´ 4 , s ´ 8 s ´ 4 , s ´ 3 , s ´ 1
R 4 s ´ 4 , s ´ 6 , s ´ 7 s ´ 6 , s ´ 8 , s ´ 4 s ´ 5 , s ´ 7 , s ´ 3 s ´ 6 , s ´ 7 , s ´ 8
Table 4. Aggregated value of R by utilizing the LSFOWA operator.
Table 4. Aggregated value of R by utilizing the LSFOWA operator.
C ˇ 1 C ˇ 2 C ˇ 3 C ˇ 4
R 1 s ´ 5.62 , s ´ 3.07 , s ´ 3.56 s ´ 3.82 , s ´ 3.58 , s ´ 3.42 s ´ 4.85 , s ´ 3.10 , s ´ 4.41 s ´ 5.29 , s ´ 3.76 , s ´ 3.19
R 2 s ´ 5.32 , s ´ 5.66 , s ´ 3.65 s ´ 4.22 , s ´ 2.99 , s ´ 4.88 s ´ 6.43 , s ´ 2.71 , s ´ 2.99 s ´ 3.24 , s ´ 5.44 , s ´ 3.50
R 3 s ´ 5.08 , s ´ 3.13 , s ´ 2.39 s ´ 4.50 , s ´ 5.02 , s ´ 4.95 s ´ 3.71 , s ´ 1.37 , s ´ 4.73 s ´ 5.24 , s ´ 4.13 , s ´ 2.23
R 4 s ´ 5.97 , s ´ 1.51 , s ´ 6.04 s ´ 4.12 , s ´ 4.01 , s ´ 5.59 s ´ 4.50 , s ´ 4.73 , s ´ 2.73 s ´ 5.17 , s ´ 3.19 , s ´ 4.88
Table 5. Aggregated value of R by utilizing the LSFOWG operator.
Table 5. Aggregated value of R by utilizing the LSFOWG operator.
C ˇ 1 C ˇ 2 C ˇ 3 C ˇ 4
R 1 s ´ 4.34 , s ´ 4.93 , s ´ 3.37 s ´ 2.61 , s ´ 4.02 , s ´ 3.71 s ´ 3.27 , s ´ 2.85 , s ´ 4.68 s ´ 3.67 , s ´ 3.82 , s ´ 4.50
R 2 s ´ 4.79 , s ´ 6.49 , s ´ 3.82 s ´ 2.27 , s ´ 4.41 , s ´ 6.36 s ´ 5.89 , s ´ 2.85 , s ´ 4.41 s ´ 2.82 , s ´ 5.62 , s ´ 3.60
R 3 s ´ 4.98 , s ´ 3.82 , s ´ 3.24 s ´ 2.97 , s ´ 5.47 , s ´ 4.93 s ´ 2.61 , s ´ 2.38 , s ´ 5.83 s ´ 4.84 , s ´ 5.01 , s ´ 2.77
R 4 s ´ 5.62 , s ´ 3.48 , s ´ 6.55 s ´ 3.54 , s ´ 5.62 , s ´ 5.90 s ´ 3.98 , s ´ 5.76 , s ´ 4.76 s ´ 4.84 , s ´ 4.59 , s ´ 6.36
Table 6. Overall preference value and the alternatives ranking.
Table 6. Overall preference value and the alternatives ranking.
R 1 R 2 R 3 R 4 Ranking
LSFOWA s ´ 5.24 , s ´ 3.34 , s ´ 3.58 s ´ 4.93 , s ´ 4.50 , s ´ 3.58 s ´ 4.93 , s ´ 3.12 , s ´ 2.85 s ´ 5.24 , s ´ 2.84 , s ´ 4.65 R 3 > R 1 > R 4 > R 2
LSFWA
LSFOWG s ´ 3.63 , s ´ 4.13 , s ´ 4.12 s ´ 3.76 , s ´ 5.25 , s ´ 4.22 s ´ 4.09 , s ´ 4.50 , s ´ 4.12 s ´ 4.73 , s ´ 4.85 , s ´ 4.91 R 3 > R 1 > R 4 > R 2
LSFWG
Table 7. Ranking of different methods.
Table 7. Ranking of different methods.
R 1 R 2 R 3 R 4 Ranking
LSFWA operator 5.306 4.890 5.393 5.139 R 3 > R 1 > R 4 > R 2
LSFWG operator 4.477 4.073 4.489 4.310 R 3 > R 1 > R 4 > R 2
SPFWA operator [58] 0.614 0.612 0.640 0.610 R 3 > R 1 > R 4 > R 2

Share and Cite

MDPI and ACS Style

Jin, H.; Ashraf, S.; Abdullah, S.; Qiyas, M.; Bano, M.; Zeng, S. Linguistic Spherical Fuzzy Aggregation Operators and Their Applications in Multi-Attribute Decision Making Problems. Mathematics 2019, 7, 413. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050413

AMA Style

Jin H, Ashraf S, Abdullah S, Qiyas M, Bano M, Zeng S. Linguistic Spherical Fuzzy Aggregation Operators and Their Applications in Multi-Attribute Decision Making Problems. Mathematics. 2019; 7(5):413. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050413

Chicago/Turabian Style

Jin, Huanhuan, Shahzaib Ashraf, Saleem Abdullah, Muhammad Qiyas, Mahwish Bano, and Shouzhen Zeng. 2019. "Linguistic Spherical Fuzzy Aggregation Operators and Their Applications in Multi-Attribute Decision Making Problems" Mathematics 7, no. 5: 413. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050413

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