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 . 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
[27] Let Ķ be a universal set, then a PFS in Ķ is defined as
(1)
where ķĶ and satisfy the condition that: ķķķ Furthermore, ķ(ķ) and (ķ) indicate the positive, neutral and negative grads of the element ķ∈Ķ to the set respectively. For each PFS Ķ(ķ) ķķ(ķ) is said to be the refusal degree of Ķ to[62,63] Let be the finite and absolutely order distinct term set. Then, is said to be a linguistic set, and the value of g is considered an odd number, e.g., when then can be written as (poor, fair, good)
The following characteristics of the linguistic set must be satisfied;
(1) Ordered:
(2) Negation: Neg
(3) Max: iff
(4) Min: iff
The extended form of the discrete set is called a continuous linguistic set and defined as and if then is said to be original set otherwise, virtual set.
[53] Let Ķ and be a continues linguistic set. Then, a LPFS is defined as
(2)
where represent the linguistic positive, linguistic neutral and linguistic negative degrees of the element Ķ to Simply, the triple of is denoted as and referred to as linguistic picture fuzzy value (LPFV).For any ķ∈Ķ, the condition is always satisfied, and ķ is the linguistic refusal degree of Ķ to Obviously, if then LPFS has the minimum linguistic indeterminacy degree, that is, ķ which means that the membership degree of ķ to can be precisely expressed with a single linguistic term and LPFS is reduced to a linguistic variable. Oppositely, if then LPFS (ķ) has the maximum linguistic indeterminacy degree; that is, ķ
[58] A SFS on the universal set Ķ is defined as
(3)
where the function ķķķ: ķ For each ķ∈Ķ ķ(ķ) and (ķ) are respectively called the positive, neutral and negative membership degree of ķ in it holds that for all ķ∈Ķ, the degree of refusal is defined as ķ For SFS ķķķķķ∈ķ a triple components is called SFN and denoted as where ķ(ķ) and ķ under the following condition;
3. Linguistic Spherical Fuzzy Set
Let Ķ be a universe of discourse and be a continues linguistic term set. Then, a LSFS is defined as
(4)
where are the linguistic positive, neutral and negative membership degree of the element ķ to The triple is denoted as and called is linguistic spherical fuzzy value (LSFV).For any ķ∈Ķ, the condition is always satisfied, and ķ is called linguistic refusal degree of ķ to
Let is LSFV with Then, we defined the score function as
(5)
and defined the accuracy function as(6)
It can be easily verified that and which means that
Now, we define the comparison rules for the two LSFNs and , based on the score and accuracy function.
(a) If Ş then
(b) If Ş and
· ĒĒ then
· ĒĒ then,
Let are the LSFNs, which are derived from Using Equation (5), we obtain
Ş Ş
Ş Ş
Thus, we obtain
Let and are the two LSFNs, then
(i) if and
(ii)
(iii)
(iv)
(v) if and
Let and are the two LSFNs, where with (λ real number), then
(1)
(2)
(3)
(4)
Let and are the two LSFNs, where with be a real number, then we have
(1)
(2)
(3)
(4)
(5)
(6)
From the following theorem, we shall only prove part (2), (3) and the proof of the rest are similar.
(2) Since and are the LSFNs, then
We have
(3) For a real number , and LSFNs and we have
andThus, we have
Hence, □
Let and are the two LSFNs, then
(1)
(2)
Since, and are the two LSFNs, then we have
Part (2) can be similarly proved. □
Let and are three LSFNs, then
(1)
(2)
(3)
(4)
(5)
(6)
We shall only prove part (1), other parts can be similarly proved.
Let are the three LSFNs, then we have
□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
Let be the set of LSFNs. Then, the LSFWA operator of dimension n is a function and
(7)
where is the weighting vector of with andLet be the set of LSFNs. Then, by using the equation of LSFWA operator, the aggregated value is still an LSFN and is given by
(8)
where is the weighting vector of with andTo prove this theorem, we utilized the mathematical induction principle on n.
Step 1: For we have and Thus, by the LSFN operation, we have
Adding these two equations, we obtain
Which shows the result holds for
Step 2: Now, we suppose that Equation (8) is true for and prove for then we have
Hence, the result holds for and we proved by mathematical induction principle that the given result is true for all positive integers □
Let are the LSFNs, which are derived from Assume that be the expert weight. Hence
So, using the LSFWA operator, we have
Let be the set of LSFNs and the weight vector of are where and then one has the following:
(1) (Idempotency). If all are equal i.e., then
(9)
(2) (Monotonicity). Let and are the collection of LSFNs such that and then
(10)
(3) (Boundedness). Let and be the two LSFNs, then
(11)
Let be the set of LSFNs which implies that and Then
(1) If then
(2) If for all it implies that then we have
On the other hand, that is then, and hence and that is then, and hence Therefore, according to Definition 6, we get
That is,
(3) Since and ∀ then, based on the properties of idempotency and monotonicity, we get
That is, □
Let be the set of LSFNs. Then, the LSFOWA operator of dimension n is a mapping and
where is the ith largest of and is the associated weight vector of with and
Let be the set of LSFNs and be the associated weight vector of are, where and then one has the following:
(1) (Idempotency). If all are equal i.e., then
(12)
(2) (Monotonicity). Let and are the set of LSFNs such that and then
(13)
(3) (Boundedness). Let and be the two LSFNs, then
(14)
4.2. Geometric Aggregation Operators
Let be the set of LSFNs. Then, the LSFWG operator of dimension n is a mapping and
(15)
where Λ is the collection of all LSFNs, is the weight vector of such that andLet be the set of LSFNs and the weight vector of are where and Then we have the following properties:
(1) (Idempotency). If all are equal i.e., then
(16)
(2) (Monotonicity). Let and are the collecttion of LSFNs such that and then
(17)
(3) (Boundedness). Let and
be the two LSFNs, then
(18)
The proof of these properties are the same as the proof of Theorem 5. □
Let be the set of LSFNs. Then, the LSFOWG operator of dimension n is a mapping and
(19)
where is the ith largest of and is the associated weight vector of with andThe LSFOWG operator also satisfies the properties as given in Theorem 6.
Let ķ and then
(20)
where equality holds only if ķķķWe derived the following theorem, based on Lemma 1.
Let be the set of LSFNs, then one has
(i) ;
(ii)
with equality if and only if
Let be the weights of alternative with and Then, part (i) can be proved as;
By the Lemma 1, we have
with equality if and only if that is,(21)
with equality if and only if On the other hand,(22)
with equality if and only ifAnd
(23)
with equality if and only ifNow, utilizing the score function of LSFNs, we have
with equality if and only if and that as □Let are the LSFNs, which are derived from Assume that are the weighting vector of
We obtain the following aggregated LSFNs, by applying Equations (8), and (15):
From the computational results, we can write
Now, to determine the aggregated LSFN, utilizing the LSFOWA and LSFOWG operators, first we find the score values of as follows:
Since ŞŞŞŞ then
The associated weight vector of are and can be determined by the normal distribution method [64]. Then, by Equations (8) and (19), we have
From these results, we prove that
4.3. Some Properties of Linguistic Spherical Fuzzy Weighted Aggregation Operators
Let be the set of LSFNs, and is also LSFN, with the weighting vector where and then
(1) ,
(2) ,
(3) ,
(4) ,
(5) ,
(6) .
We shall prove only part (1), (3) and (5) and the proofs of the remaining parts are similarly proved.
(1) For and we can write
Now,
Similarly, we get
andThus, by using Equation (8), we get
andAccording to Definition 6, we get
(3) Since , which implies that
Similarly, we show that
andSince,
andThus, according to Definition 6, we get
□5. Algorithm for Decision Making Problem with Linguistic Spherical Fuzzy Information
Assume that we have m alternatives and n attributes , whose weighting vectors are , with and Decision maker set is , where denotes their weights, such that and The decision maker gives their preference values in LSFNs form, , where for every alternative under the given attributes. The decision maker collective information is given in the form of the decision matrix
Step 1. Developed the linguistic spherical fuzzy decision-matrix
Step 2. Using the LSFOWA operator:
or using the LSFOWG operator:Step 3. Accumulate all for every alternative by the LSFWA operator:
or using the LSFWG operatorStep 4. Rank the alternative 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,
On the basis of the attributes, technical capability, higher performance, saifiety, 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 , and are call to give their preferences for every alternative under the given attributes with the linguistic term set . Consider the weighting vector of attributes.
Step 1: For each alternative, preferences of the experts are given in the form of decision-matrices 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 Now, we utilize the LSFOWA and LSFOWG operators to aggregate the decision-matrices are shown in Table 4 and Table 5.
Step 3: We used the LSFWA and LSFWG operators to aggregate into the cumulative for every alternative , under the attribute weighting vector . 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.
Tables
Table 1(Decision-matrix).
(Decision-matrix).
(Decision-matrix).
Aggregated value of R by utilizing the LSFOWA operator.
Aggregated value of R by utilizing the LSFOWG operator.
Overall preference value and the alternatives ranking.
Ranking | |||||
---|---|---|---|---|---|
LSFOWA | |||||
LSFWA | |||||
LSFOWG | |||||
LSFWG |
Ranking of different methods.
Ranking | |||||
---|---|---|---|---|---|
LSFWA operator | |||||
LSFWG operator | |||||
SPFWA operator [58] |
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2019 by the authors.
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.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details



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; School of Managment, Fudan University, Shanghai 200433, China