SR-Fuzzy Sets and Their Weighted Aggregated Operators in Application to Decision-Making
Abstract
An intuitionistic fuzzy set is one of the efficient generalizations of a fuzzy set for dealing with vagueness/uncertainties in information. Under this environment, in this manuscript, we familiarize a new type of extensions of fuzzy sets called square-root fuzzy sets (briefly, SR-Fuzzy sets) and contrast SR-Fuzzy sets with intuitionistic fuzzy sets and Pythagorean fuzzy sets. We discover the essential set of operations for the SR-Fuzzy sets along with their several properties. In addition, we define a score function for the ranking of SR-Fuzzy sets. To study multiattribute decision-making problems, we introduce four new weighted aggregated operators, namely, SR-Fuzzy weighted average (SR-FWA) operator, SR-Fuzzy weighted geometric (SR-FWG) operator, SR-Fuzzy weighted power average (SR-FWPA) operator, and SR-Fuzzy weighted power geometric (SR-FWPG) operator over SR-Fuzzy sets. We apply these operators to select the top-rank university and show how we can choose the best option by comparing the aggregate outputs through score values.
1. Introduction
The idea of fuzzy sets was proposed by Zadeh [1] to handle the imprecise information. The notion of rough set theory was originally introduced by Pawlak [2], and it was applied to many different domains (see [3–5]). The concept of soft sets was first defined by Molodtsov [6] as a general mathematical tool for dealing with uncertain objects. The merging between fuzzy sets and some uncertainty approaches such as rough sets and soft sets have been discussed in [7–9].
In several real-life situations, the degree of nonmembership is not obtained from the degree of membership. In these cases, the notion of intuitionistic fuzzy sets defined by Atanassov [10] worked very well. It is one of the interesting generalizations of fuzzy sets with best applicability. In various fields, the applications of intuitionistic fuzzy sets appear, including optimization problems, medical diagnosis, and decision-making [11–15]. However, there are numerous situations where the decision-maker may supply the degrees of membership and nonmembership of a specific attribute in such a way that their sum is greater than one. Therefore, Yager [16] put forward the concept of Pythagorean fuzzy sets which is a generalization of intuitionistic fuzzy sets, and it is a more powerful tool to solve uncertain problems. Ibrahim et al. [17] defined a new generalization of Pythagorean fuzzy sets called (3, 2)-Fuzzy sets. The main advantage of (3, 2)-Fuzzy sets is that they can characterize more vague cases than Pythagorean fuzzy sets, which can be exploited in many decision-making problems.
The idea of intuitionistic fuzzy weighted averaging operators was proposed by Xu [18]. Some geometric weighted, geometric ordered weighted, and geometric hybrid operators under the environment of intuitionistic fuzzy sets were introduced by Xu and Yager [19]. In Refs. [20–25], many researchers worked in the area of intuitionistic fuzzy sets and established various aggregation operators which are applied to group decision-making. After the advent of the Pythagorean fuzzy sets, the operators of Pythagorean fuzzy aggregation have also become an important and interesting field for research. Yager and Abbasov [26, 27], in 2013, introduced the concepts of weighted geometric, weighted averaging, ordered weighted geometric, and ordered weighted averaging operators in the frame of Pythagorean fuzzy environment. The essential properties of Pythagorean fuzzy aggregation operators were investigated by the authors of [28]. Shahzadi et al. [29] established some aggregation operators under Pythagorean fuzzy data for assessing the distinct preferences of the choice among the decision-making process. By using Pythagorean fuzzy values, Rahman et al. presented many aggregation operators like weighted geometric [30], hybrid geometric [31], weighted averaging [32], and ordered weighted geometric operators [33] and also discussed their practical applications.
The aims of writing this paper are (1) to present a novel extension of intuitionistic fuzzy set called SR-Fuzzy sets which is not obtained from q-rung orthopair fuzzy sets, (2) to introduce novel types of weighted aggregation operators and discuss their main properties, and (3) to investigate a MCDM methods depending on these operators.
In this paper, we define the concept of SR-Fuzzy sets and compare it with the other types of fuzzy sets in Section 2. Then, we introduce the set of operations for the SR-Fuzzy sets and explore their main features in Section 3. Also, the concepts of weighted aggregated operators for SR-Fuzzy sets are investigated. Thereafter, we describe MADM problems under these operators in Section 4. Finally, we outline the main achievements of the paper and propose some upcoming works in Section 5.
Before we present our main concepts and results, we recall the definitions of the intuitionistic fuzzy set (IFS) and Pythagorean fuzzy set (PFS).
Definition 1. Let S be a universal set such that YΘ : S⟶[0, 1] and ΨΘ : S⟶[0, 1] are mapping. Then, the intuitionistic fuzzy set (IFS) [10] (resp., Pythagorean fuzzy set (PFS) [16]) is defined by the following:
2. SR-Fuzzy Sets
In this section, we initiate the notion of SR-Fuzzy sets and study its features in detail. For computations, we use only six decimal places in the whole paper.
Definition 2. Let S be a universal set such that YΘ : S⟶[0, 1] and ΨΘ : S⟶[0, 1] are mapping. Then, the SR-Fuzzy set (briefly, SR-FS) Θ is defined as following:
Then, there is a degree of indeterminacy of p ∈ S to Θ defined by
It is obvious that . Otherwise, πΘ(p) = 0 whenever .
In the interest of simplicity, we shall mention the symbol Θ = (YΘ, ΨΘ) for the SR-FS Θ = {〈p, YΘ(p), ΨΘ(p)〉: p ∈ S}. The space of SR-Fuzzy membership grades is displayed in Figure 1.
Example 1. Assume that YΘ(p) = 0.3 and ΨΘ(p) = 0.8 for S = {p}. Then, Θ = (0.3,0.8) is not an intuitionistic fuzzy set because 0.3 + 0.8 = 1.1 > 1. In contrast, Θ = (0.3,0.8) is an SR-FS because .

Note that πΘ(p) ≈ 0.015573, and hence, .
Remark 3. From Figure 2, we get that
- (1)
The space of Pythagorean membership grades is larger than the space of SR-Fuzzy membership grades
- (2)
The SR-Fuzzy and intuitionistic fuzzy sets intersect at the point
- (3)
For and , the space of SR-Fuzzy membership grades starts to be larger than the space of intuitionistic membership grades
- (4)
for and , the space of SR-Fuzzy membership grades starts to be smaller than the space of intuitionistic membership grades
Definition 4. Let and be two SR-FSs; then
- (1)
Θ1 = Θ2 if and only if and
- (2)
Θ1 ≥ Θ2 if and only if and
Example 2.
- (1)
If Θ1 = (0.2,0.9) and Θ2 = (0.2,0.9) for S = {p}, then Θ1 = Θ2
- (2)
If Θ1 = (0.2,0.9) and Θ2 = (0.1,0.91) for S = {p}, then Θ2 ≤ Θ1
Definition 5. Let and be two SR-Fuzzy sets (SR-FSs). Then
- (1)
- (2)
- (3)

Note that , so is an SR-Fuzzy set. It is obvious that .
Example 3. Assume that and are both SR-FSs for S = {p}. Then
- (1)
- (2)
- (3)
Theorem 6. Let and be two SR-FSs; then the following properties hold:
- (1)
Θ1∩Θ2 = Θ2∩Θ1
- (2)
Θ1 ∪ Θ2 = Θ2 ∪ Θ1
Proof. From Definition 5, we can obtain the following:
- (1)
- (2)
The proof is similar to (1)
Theorem 7. Let , and be three SR-FSs; then
- (1)
Θ1∩(Θ2∩Θ3) = (Θ1∩Θ2)∩Θ3
- (2)
Θ1 ∪ (Θ2 ∪ Θ3) = (Θ1 ∪ Θ2) ∪ Θ3
Proof. For the three SR-FSs Θ1, Θ2, and Θ3, according to Definition 5, we obtain the following:
- (1)
- (2)
The proof is similar to (1)
Theorem 8. Let and be two SR-FSs. Then
- (1)
(Θ1∩Θ2) ∪ Θ2 = Θ2
- (2)
(Θ1 ∪ Θ2)∩Θ2 = Θ2
Proof. From Definition 5, we obtain the following:
- (1)
- (2)
The proof is similar to (1)
Theorem 9. Let and be two SR-FSs; then
- (1)
- (2)
Proof. For the two SR-FSs Θ1 and Θ2, according to Definition 5, we obtain the following:
- (1)
- (2)
The proof is similar to (1)
3. Aggregation of SR-Fuzzy Sets and Its Properties
In this section, we introduce some new operations on SR-Fuzzy sets. Besides, we study the SR-Fuzzy aggregation operators and some attracted properties are indicated in detail.
3.1. Some Operations On SR-Fuzzy Sets
Definition 10. Let Θ = (YΘ, ΨΘ), and be three SR-FSs and ρ be a positive real value (ρ > 0). Then their operations are defined as follows:
- (1)
- (2)
- (3)
- (4)
Example 4. Suppose that and are both SR-FSs for S = {p}. Then
- (1)
- (2)
- (3)
, for ρ = 3
- (4)
, for ρ = 3
Theorem 11. If and are two SR-FSs, then Θ1 ⊕ Θ2 and Θ1 ⊗ Θ2 are also SR-FSs.
Proof. For SR-FSs and , the following relations are evident:
Then, we have
Since and , then , and we get , and hence, .
Similarly, we get
It is obvious that
Then we get
Therefore
Similarly, we have
These indicate that both of Θ1 ⊕ Θ2 and Θ1 ⊗ Θ2 are SR-FSs.
Theorem 12. Let Θ = (YΘ, ΨΘ) be an SR-FS and ρ be a positive real value. Then, ρΘ and Θρ are also SR-FSs.
Proof. Since , , and , then
It is obvious that ; then we get
Similarly, we also get
Therefore, ρΘ and Θρ are SR-FSs.
Theorem 13. Let and be two SR-FSs. Then the following properties hold:
- (1)
Θ1 ⊕ Θ2 = Θ2 ⊕ Θ1
- (2)
Θ1 ⊗ Θ2 = Θ2 ⊗ Θ1
Proof. From Definition 10, we obtain the following:
- (1)
- (2)
Theorem 14. Let Θ = (YΘ, ΨΘ), and be three SR-FSs. Then
- (1)
ρ(Θ1 ⊕ Θ2) = ρΘ1 ⊕ ρΘ2, for ρ > 0
- (2)
(ρ1 + ρ2)Θ = ρ1Θ ⊕ ρ2Θ, for ρ1, ρ2 > 0
- (3)
, for ρ > 0
- (4)
, for ρ1, ρ2 > 0
Proof. For the three SR-FSs Θ, Θ1, and Θ2, and ρ, ρ1, ρ2 > 0, according to Definition 10, we obtain the following:
- (1)
.
And
- (2)
- (3)
- (4)
Theorem 15. Let and be two SR-FSs and ρ > 0. Then
- (1)
ρ(Θ1 ∪ Θ2) = ρΘ1 ∪ ρΘ2
- (2)
Proof. For the two SR-FSs Θ1 and Θ2, and ρ > 0, according to Definitions 5 and 10, we obtain the following:
- (1)
.
And
- (2)
The proof is similar to (1)
Theorem 16. Let Θ = (YΘ, ΨΘ), and be three SR-FSs, and ρ > 0. Then
- (1)
- (2)
- (3)
- (4)
Proof. For the three SR-FSs Θ, Θ1 and Θ2, and ρ > 0, according to Definitions 5(3) and 10, we obtain the following:
- (1)
- (2)
- (3)
- (4)
Theorem 17. Let , , and be three SR-FSs. Then
- (1)
(Θ1∩Θ2) ⊕ Θ3 = (Θ1 ⊕ Θ3)∩(Θ2 ⊕ Θ3)
- (2)
(Θ1 ∪ Θ2) ⊕ Θ3 = (Θ1 ⊕ Θ3) ∪ (Θ2 ⊕ Θ3)
- (3)
(Θ1∩Θ2) ⊗ Θ3 = (Θ1 ⊗ Θ3)∩(Θ2 ⊗ Θ3)
- (4)
(Θ1 ∪ Θ2) ⊗ Θ3 = (Θ1 ⊗ Θ3) ∪ (Θ2 ⊗ Θ3)
Proof. By Definitions 5 and 10, we obtain the following:
- (1)
.
And .
Thus, (Θ1∩Θ2) ⊕ Θ3 = (Θ1 ⊕ Θ3)∩(Θ2 ⊕ Θ3)
- (2)
The proof is similar to (1)
- (3)
.
And .
Thus, (Θ1∩Θ2) ⊗ Θ3 = (Θ1 ⊗ Θ3)∩(Θ2 ⊗ Θ3)
- (4)
The proof is similar to (3)
Theorem 18. Let , , and be three SR-FSs. Then
- (1)
Θ1 ⊕ Θ2 ⊕ Θ3 = Θ1 ⊕ Θ3 ⊕ Θ2
- (2)
Θ1 ⊗ Θ2 ⊗ Θ3 = Θ1 ⊗ Θ3 ⊗ Θ2
Proof.
- (1)
- (2)
The proof is similar to (1)
In order to rank SR-FSs, we define the score function and accuracy function of the SR-FS:
Definition 19.
- (1)
The score function of an SR-FS Θ = (YΘ, ΨΘ) can be represented as
- (2)
The accuracy function of an SR-FS Θ = (YΘ, ΨΘ) can be represented as
Example 5. For an SR-FS Θ = (0.3,0.8), we find that score(Θ) ≈ −0.804427 and accuracy(Θ) ≈ 0.984427. In particular, if Θ = (0, 1), then score(Θ) = −1, and if Θ = (1, 0), then score(Θ) = 1.
Theorem 20. The suggested score function of any SR-FS Θ = (YΘ, ΨΘ), denoted by score(Θ) lies in [−1, 1].
Proof. Since for any SR-FS Θ, we have , hence and . Therefore, . Hence, score(Θ) ∈ [−1, 1].
Remark 21. The suggested accuracy function of any SR-FS Θ = (YΘ, ΨΘ), denoted by accuracy(Θ), lies in [0, 1].
3.2. Aggregation of SR-Fuzzy Sets
Definition 22. Let (i = 1, 2, ⋯, m) be a value of SR-FSs and be the weight vector of Θi with wi > 0 and . Then an SR-Fuzzy
- (1)
Weighted average (SR-FWA) operator is a function SR-FWA : Θm⟶Θ, where
- (2)
Weighted geometric (SR-FWG) operator is a function SR-FWG : Θm⟶Θ, where
- (3)
Weighted power average (SR-FWPA) operator is a function SR-FWPA : Θm⟶Θ, where
- (4)
Weighted power geometric (SR-FWPG) operator is a function SR-FWPG : Θm⟶Θ, where
Example 6. Suppose that Θ1 = (0.53,0.49), Θ2 = (0.52,0.51), Θ3 = (0.26,0.76), Θ4 = (0.51,0.53), Θ5 = (0.50,0.54), and Θ6 = (0.22,0.86) are six SR-Fuzzy sets, and let w = (0.12,0.32,0.22,0.13,0.10,0.11)T be a weight vector of Θi (i = 1, 2, ⋯, 6). Then
- (1)
SR − FWA(Θ1, Θ2, ⋯, Θ6) = (0.53 × 0.12 + 0.52 × 0.32 + 0.26 × 0.22 + 0.51 × 0.13 + 0.50 × 0.10 + 0.22 × 0.11,0.49 × 0.12 + 0.51 × 0.32 + 0.76 × 0.22 + 0.53 × 0.13 + 0.54 × 0.10 + 0.86 × 0.11) = (0.4277,0.6067)
- (2)
SR − FWG(Θ1, Θ2, ⋯, Θ6) = (0.530.12 × 0.520.32 × 0.260.22 × 0.510.13 × 0.500.10 × 0.220.11, 0.490.12 × 0.510.32 × 0.760.22 × 0.530.13 × 0.540.10 × 0.860.11) ≈ (0.404460,0.593219)
- (3)
- (4)
Remark 23. Note that the ordered values induced from the different operators introduced in Definition 22 need not be an SR-FS. To validate this matter, take the ordered values (0.452616,0.632933) which are given in (4) of the above example. By calculating, we find that which means that SR-FWPG(Θ1, Θ2, ⋯, Θ6) is not an SR-FS.
Theorem 24. Let (i = 1, 2, ⋯, m) be a value of SR-FSs, Θ = (YΘ, ΨΘ) be SR-FS, and be a weight vector of Θi with . Then
- (1)
SR − FWA(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR − FWA(Θ1 ⊗ Θ, Θ2 ⊗ Θ, ⋯, Θm ⊗ Θ)
- (2)
SR − FWG(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR − FWG(Θ1 ⊗ Θ, Θ2 ⊗ Θ, ⋯, Θm ⊗ Θ)
- (3)
SR − FWPA(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR − FWPA(Θ1 ⊗ Θ, Θ2 ⊗ Θ, ⋯, Θm ⊗ Θ)
- (4)
SR − FWPG(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR − FWPG(Θ1 ⊗ Θ, Θ2 ⊗ Θ, ⋯, Θm ⊗ Θ)
Proof. We will display the proof of (1) and (4). The other affirmations are proved in a similar fashion.
- (1)
For any (i = 1, 2, ⋯, m) and Θ = (YΘ, ΨΘ), we get
and
By Definition 10 (1) and (2), we have
Therefore, from (25), the proof is proved
- (4)
For any (i = 1, 2, ⋯, m) and Θ = (YΘ, ΨΘ), we get
Similarly
Now, by (1) and (2) of Definition 10, we have
Hence, SR-FWPG(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR-FWPG(Θ1 ⊗ Θ, Θ2 ⊗ Θ, ⋯, Θm ⊗ Θ).
Theorem 25. Let (i = 1, 2, ⋯, m) be a value of SR-FSs, Θ = (YΘ, ΨΘ) be SR-FS, and be the weight vector of Θi with ; then
- (1)
SR-FWA(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR-FWA(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (2)
SR-FWG(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR-FWG(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (3)
SR-FWPA(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR-FWPA(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (4)
SR-FWPG(Θ1 ⊕ Θ, Θ2 ⊕ Θ, ⋯, Θm ⊕ Θ) ≥ SR-FWPG(Θ1, Θ2, ⋯, Θm) ⊗ Θ
Proof. We will display the proof of (1). The other affirmations are proved in a similar fashion.
- (1)
For any (i = 1, 2, ⋯, m) and Θ = (YΘ, ΨΘ), we get
Similarly,
By (1) and (2) of Definition 10, we have
Hence, the desired result is proved.
Theorem 26. Let and (i = 1, 2, ⋯, m) be two values of SR-FSs, and be a weight vector of them with . Then
- (1)
SR − FWA(Θ1 ⊕ K1, Θ2 ⊕ K2, ⋯, Θm ⊕ Km) ≥ SR − FWA(Θ1 ⊗ K1, Θ2 ⊗ K2, ⋯, Θm ⊗ Km)
- (2)
SR − FWG(Θ1 ⊕ K1, Θ2 ⊕ K2, ⋯, Θm ⊕ Km) ≥ SR − FWG(Θ1 ⊗ K1, Θ2 ⊗ K2, ⋯, Θm ⊗ Km)
- (3)
SR − FWPA(Θ1 ⊕ K1, Θ2 ⊕ K2, ⋯, Θm ⊕ Km) ≥ SR − FWPA(Θ1 ⊗ K1, Θ2 ⊗ K2, ⋯, Θm ⊗ Km)
- (4)
SR − FWPG(Θ1 ⊕ K1, Θ2 ⊕ K2, ⋯, Θm ⊕ Km) ≥ SR − FWPG(Θ1 ⊗ K1, Θ2 ⊗ K2, ⋯, Θm ⊗ Km)
Proof. We will display the proof of (1). The other affirmations are proved in a similar fashion.
- (1)
For any and (i = 1, 2, ⋯, m), we get
Similarly
By (1) and (2) of Definition 10, we have
Thus, SR-FWA(Θ1 ⊕ K1, Θ2 ⊕ K2, ⋯, Θm ⊕ Km) ≥ SR-FWA(Θ1 ⊗ K1, Θ2 ⊗ K2, ⋯, Θm ⊗ Km).
Theorem 27. Let (i = 1, 2, ⋯, m) be a value of SR-FSs, and be the weight vector of Θi with and ρ ≥ 1; then
- (1)
- (2)
- (3)
- (4)
Proof. We will display the proof of (1). The other affirmations are proved in a similar fashion.
- (1)
For any (i = 1, 2, ⋯, m), we have
Let , and we have to show . Using the Newton generalized binomial theorem, we are able to get
Thus, , that is
Similarly,
Therefore .
Theorem 28. Let (i = 1, 2, ⋯, m) be a value of SR-FSs, Θ = (YΘ, ΨΘ) be SR-FS, and be a weight vector of Θi with and ρ ≥ 1. Then
- (1)
- (2)
- (3)
- (4)
Proof. We will display the proof of (1). The other affirmations are proved in a similar fashion.
- (1)
For any (i = 1, 2, ⋯, m) and Θ = (YΘ, ΨΘ), we have
Let , and we have to show that . At first we indicate and take the derivative of ; then
Therefore, if , then is monotonic increasing, and if , then is monotonic decreasing, so . Since , hence
Similarly
Hence, .
To prove the following three results, we suppose that the values obtained from the introduced operators are an SR-FS (see Remark 23).
Theorem 29. Let (i = 1, 2, ⋯, m) be a value of SR-FSs, Θ = (YΘ, ΨΘ) be SR-FS, and be the weight vector of Θi with ; then
- (1)
SR-FWA(Θ1, Θ2, ⋯, Θm) ⊕ Θ ≥ SR-FWA(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (2)
SR-FWG(Θ1, Θ2, ⋯, Θm) ⊕ Θ ≥ SR-FWG(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (3)
SR-FWPA(Θ1, Θ2, ⋯, Θm) ⊕ Θ ≥ SR-FWPA(Θ1, Θ2, ⋯, Θm) ⊗ Θ
- (4)
SR-FWPG(Θ1, Θ2, ⋯, Θm) ⊕ Θ ≥ SR-FWPG(Θ1, Θ2, ⋯, Θm) ⊗ Θ
Proof. We will display the proof of (1). The other affirmations are proved in a similar fashion.
- (1)
For any (i = 1, 2, ⋯, m) and Θ = (YΘ, ΨΘ), we get
Similarly
By (1) and (2) of Definition 10, we obtain
Hence, the desired result is proved.
Theorem 30. Let and (i = 1, 2, ⋯, m) be two values of SR-FSs and be a weight vector of them with . Then
- (1)
SR − FWA(Θ1, Θ2, ⋯, Θm) ⊕ SR − FWA(K1, K2, ⋯, Km) ≥ SR − FWA(Θ1, Θ2, ⋯, Θm) ⊗ SR − FWA(K1, K2, ⋯, Km)
- (2)
SR − FWG(Θ1, Θ2, ⋯, Θm) ⊕ SR − FWG(K1, K2, ⋯, Km) ≥ SR − FWG(Θ1, Θ2, ⋯, Θm) ⊗ SR − FWG(K1, K2, ⋯, Km)
- (3)
SR − FWPA(Θ1, Θ2, ⋯, Θm) ⊕ SR − FWPA(K1, K2, ⋯, Km) ≥ SR − FWPA(Θ1, Θ2, ⋯, Θm) ⊗ SR − FWPA(K1, K2, ⋯, Km)
- (4)
SR − FWPG(Θ1, Θ2, ⋯, Θm) ⊕ SR − FWPG(K1, K2, ⋯, Km) ≥ SR − FWPG(Θ1, Θ2, ⋯, Θm) ⊗ SR − FWPG(K1, K2, ⋯, Km)
Theorem 31. Let (i = 1, 2, ⋯, m) be a value of SR-FSs and be the weight vector of Θi with and ρ ≥ 1; then
- (1)
- (2)
- (3)
- (4)
4. Application of SR-FSs to Select the Top-Rank University
In this section, we apply the SR-FWA, SR-FWG, SR-FWPA, and SR-FWPG operators to select the top-rank university among different universities.
One of the following techniques to handle the multicriteria decision-making (in short, MCDM) problems is based on the different types of fuzzy weighted operators. Herein, we, first, show the steps used in the proposed methodology for MCDM:
Step 1. Represent a MCDM problem under study using the SR-Fuzzy decision matrix.
Step 2. Transmit SR-Fuzzy decision matrix into the normalized SR-Fuzzy decision matrix.
Step 3. Compute for each alternative all kinds of SR-Fuzzy weighted operators.
Step 4. Compute the scores and accuracy functions for each alternative (as we showed in Remark 23, the ordered values induced from the different operators need not be an SR-FS; however, we apply the formulas of scores and accuracy functions given in Definition 19 for those ordered values).
Step 5. Compare the given alternatives based on the score function.
Step 6. If the score functions are equal for some alternatives, then compare between them in terms of accuracy function.
Step 7. Determine the optimal ranking order of the alternatives and recognize the optimal alternative(s).
In the next example, we illustrate how the above steps are applied to select the top-rank university among different universities.
Example 7. Let U = {U1, U2, U3} be a set of alternatives (universities) and P = {P1, P2, P3, P4, P5, P6, P7} be a set of seven attributes for the selection of universities, where
Suppose that the weight vector of the attributes given by the decision-maker is w = (0.1,0.37, 0.14,0.03,0.27,0.06,0.03)T. Obviously, . The SR-F values of the alternatives according to different attributes are given in Table 1, where is the positive membership degree for which alternative obeys the given attribute and is the membership degree for which alternative does not obey the given attribute such that and .
Universities | P1 | P2 | P3 | P4 | P5 | P6 | P7 |
---|---|---|---|---|---|---|---|
U1 | (0.7, 0.2) | (0.4, 0.5) | (0.4, 0.7) | (0.5, 0.5) | (0.4, 0.5) | (0.7, 0.1) | (0.8, 0.1) |
U2 | (0.6, 0.3) | (0.3, 0.6) | (0.3, 0.8) | (0.6, 0.4) | (0.4, 0.7) | (0.6, 0.1) | (0.7, 0.2) |
U3 | (0.8, 0.1) | (0.5, 0.4) | (0.5, 0.5) | (0.6, 0.4) | (0.7, 0.2) | (0.8, 0.1) | (1, 0) |
Applying the proposed aggregation operators given in Definition 22, score and accuracy functions, we find, as demonstrated in Table 2, that the optimal ranking order of the three universities is U3≻U1≻U2, and thus, the top alternative is U3.
U1 | U2 | U3 | rank order | |
---|---|---|---|---|
SR − FWA | (0.463, 0.462) | (0.396, 0.577) | (0.62, 0.3) | |
Score | -0.465337 | -0.602789 | -0.163323 | U3≻U1≻U2 |
Accuracy | 0.894075 | 0.916421 | 0.932123 | U3≻U2≻U1 |
SR − FWG | (0.449660, 0.413739) | (0.379393, 0.521591) | (0.606024, 0) | |
Score | -0.441031 | -0.578274 | 0.367265 | U3≻U1≻U2 |
Accuracy | 0.845420 | 0.866152 | 0.367265 | U2≻U1≻U3 |
SR − FWPA | (0.479479, 0.440997) | (0.414970, 0.553320) | (0.634823, 0.273865) | |
Score | -0.434176 | -0.571655 | -0.120321 | U3≻U1≻U2 |
Accuracy | 0.893976 | 0.916055 | 0.926321 | U3≻U2≻U1 |
SR − FWPG | (0.496476, 0.475544) | (0.425919, 0.605327) | (1, 0) | |
Score | -0.443109 | -0.596621 | 1 | U3≻U1≻U2 |
Accuracy | 0.936085 | 0.959435 | 1 | U3≻U2≻U1 |
Note that the score functions for the data given in Table 2 are unequal, so they are enough to determine the optimal alternative.
The method adopted in this application is illustrated in Figure 3.

5. Conclusions
This paper contributes to the fuzzy set theory in which interest in it grew since the moment Zadeh launched it. To handle some real-life issues which are difficult to solve using fuzzy set theory, some researchers extended this theory to other fuzzy models; the most important are IFSs and PFSs.
In this paper, we have proposed a new shape of fuzzy sets called an SR-Fuzzy set and revealed its relationship with other types of the generalizations of fuzzy sets. Then, some operators on SR-Fuzzy sets have been defined, and their relationships have been presented. Furthermore, we have introduced four new weighted aggregated operators over SR-Fuzzy sets and discussed their properties in detail. Moreover, we have shown this procedure with one practical fully developed example.
In future works, further applications of SR-Fuzzy sets may be investigated, and also, SR-Fuzzy soft sets may be explored. Also, we will try to generate the topology from the collection of SR-Fuzzy sets and introduce the ideas of connectedness and compactness in SR-Fuzzy topology.
Conflicts of Interest
The authors declare no conflicts of interest.
Open Research
Data Availability
No data were used to support this study.