Next Article in Journal
Hardware Communications: An Open-Source Ethernet Switch Implementing the Parallel Redundancy Protocol
Previous Article in Journal
A Proposal for Rapid Assessment of Long-Distance Oil and Gas Pipelines After Earthquakes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Enhanced MCDM Based on the TOPSIS Technique and Aggregation Operators Under the Bipolar pqr-Spherical Fuzzy Environment: An Application in Firm Supplier Selection

by
Zanyar A. Ameen
1,*,
Hariwan Fadhil M. Salih
1,
Amlak I. Alajlan
2,*,
Ramadhan A. Mohammed
3 and
Baravan A. Asaad
4,5
1
Department of Mathematics, College of Science, University of Duhok, Duhok 42001, Iraq
2
Department of Mathematics, College of Science, Qassim University, Buraydah 51452, Saudi Arabia
3
Department of Mathematics, College of Basic Education, University of Duhok, Duhok 42001, Iraq
4
Department of Mathematics, College of Science, University of Zakho, Zakho 42002, Iraq
5
Department of Computer Science, College of Science, Cihan University-Duhok, Duhok 42001, Iraq
*
Authors to whom correspondence should be addressed.
Appl. Sci. 2025, 15(7), 3597; https://doi.org/10.3390/app15073597
Submission received: 13 February 2025 / Revised: 20 March 2025 / Accepted: 21 March 2025 / Published: 25 March 2025

Abstract

:
Multiple criteria decision-making (MCDM) is a significant area of decision-making theory that certainly warrants attention. It might be difficult to accurately convey the necessary decision facts when navigating decision-making problems since we frequently run into complicated issues and unpredictable situations. To address this, introducing the novel idea of the bipolar pqr-spherical fuzzy set ( B pqr SFS), a hybrid structure of the bipolar fuzzy set (BFS) and the pqr-spherical fuzzy set (pqr-SFS), is the main goal of this work. The fundamental (set-theoretic and algebraic) operations on B pqr SFSs are explained as well as their relations to several known models. A distance measure, such as Euclidean distance, among B pqr SFNs, is provided. Afterward, we expand the fundamental aggregation operators to the pqr-spherical fuzzy ( B pqr SF) environment by developing bipolar pqr-spherical fuzzy-weighted averaging and bipolar pqr-spherical fuzzy-weighted geometric operators for aggregating B pqr SFNs. According to the aforementioned distance measure and operators, an MCDM approach is established consisting of two algorithms, namely, the TOPSIS method and the method using the proposed operators in the B pqr SF context. Moreover, a numerical example is provided in order to ensure that the presented model is applicable. By using the two algorithms, a comparative analysis of the proposed method with other existing ones is given in order to verify the feasibility of the suggested decision-making procedure.

1. Introduction

This part provides a literature overview of relevant concepts that will be employed in this study.

Extensions of Fuzzy Set Theory: Review

Numerous real-world problems involve fuzziness, such as MCDM, pattern recognition, data mining, etc. The knowledge in these areas is often subject to intrinsic ambiguity or uncertainty and is incomplete. Dealing with this massive information is essential for making informed decisions, gaining meaningful insights, and revealing valuable insights.
To resolve such issues, Zadeh [1] introduced the idea of fuzzy sets (FSs), where each element receives a membership degree (MD) that indicates how closely the element is related to the other elements. These fractions are generally encapsulated as real numbers in the closed [ 0 , 1 ] interval, where 0 means not a part of this group, 1 means completely a member of the group, and everything in between represents some level of participation.
After the concept of FSs, Atanassov [2] proposed the concept of intuitionistic fuzzy sets (IFSs). IFSs provided a more descriptive presentation by accounting for membership degrees (MDs) along with non-membership degrees (¬MDs), representing the intrinsic uncertainty and confusion presented in practical situations. IFS is extensively used for MCDM processing, particularly when MD and ¬MD sums range from zero to one. But in real situations, the sum of MD and ¬MD is sometimes > 1 .
Yager [3] established an innovative notion known as the Pythagorean fuzzy set (PyFS) that generalized IFS. In this regard, the MCDM domain has been extended due to the excellent features of PyFS to describe and control undecided. As we know, PyFS is limited to having the sum of the squares of MD and ¬MD be ≤1.
Yager [4] introduced the q-rung orthopair FS (q-ROFS) as a subsequent evolution of both PyFS and IFS, removing the restrictions mentioned above. Dounis and Stefopoulos [5] used q-ROFS for intelligent medical diagnosis. By extending the latter models, decision-makers have more freedom in selecting values as they wish; on the other hand, it forces them to pick one parameter for all selected values.
Seikh and Mandal [6] introduced p,q-quasirung orthopair fuzzy sets (p,q-QOFSs), which give decision-makers the flexibility to choose different powers for MD and ¬MD, i.e., ( ( MD ) p + ( ¬ MD ) q 1 , such that p and q could be the same or different). A similar approach appeared in [7] under the name of n,m-rung orthopair fuzzy sets (nm-ROFSs), where m , n are in Z + . This change allows for a more flexible encoding of information that accommodates diverse preferences and needs in decision-making contexts. All the aforementioned studies focus on the application of MD and ¬MD while overlooking the impact of the neutral degree, which is a significant factor during the DM process as well.
Cuong and Kreinovich [8] solved the above challenge by introducing the notion of picture fuzzy sets (PFSs). PFSs define the degree of membership as positive (+ve), negative (−ve), and neutral degrees, which correspond to MD, a neutral membership degree (NMD), and ¬MD, respectively, under three distinct functions, inferring the following constraint: ( MD ) + ( NMD ) + ( ¬ MD ) 1 . But in some real-life scenarios, the requirement ( MD ) + ( NMD ) + ( ¬ MD ) 1 might not be met.
Mahmood et al. [9] proposed a spherical fuzzy set (SFS), which imposes the new restriction ( MD ) 2 + ( NMD ) 2 + ( ¬ MD ) 2 1 , making uncertainty management more flexible. It was also introduced by Gündoğdu and Kahraman [10]. So, let us try specific values for MD = 0.7 , NMD = 0.4 , and ¬MD = 0.6 ; squaring these numbers does not work, as ( 0.7 ) 2 + ( 0.4 ) 2 + ( 0.6 ) 2 > 1 .
Mahmood et al. [9] extended SFSs to T-spherical FSs (T-SFSs), where ( MD ) n + ( NMD ) n + ( ¬ MD ) n 1 , for some integer n 2 . Such an arrangement affords the decision-makers flexibility in assigning any MD, NMD, or ¬MD value inside [ 0 , 1 ] . For instance, if we take n = 3 , and MD = 0.7 , NMD = 0.4 , and ¬MD = 0.6 , we obtain ( 0.7 ) 3 + ( 0.4 ) 3 + ( 0.6 ) 3 1 . Ullah et al. [11] introduced and defined the term ’correlation coefficients of T-SFS’, where levels of membership degrees of the terms should meet the constraints, i.e., ( MD ) n + ( NMD ) n + ( ¬ MD ) n 1 . This assumes homogeneity in the levels of MD, NMD, and ¬MD. In actual scenarios, these levels might differ. So, if a decision-maker sets MD = 0.9 , NMD = 0.5 , and ¬MD = 0.7 , for instance, we see that ( 0.9 ) 3 + ( 0.5 ) 3 + ( 0.7 ) 3 = 1.12 implies this violate linearly aggregation rule. So, a more nuanced approach is needed. Enabling different term levels for MD, NMD, and ¬MD makes it possible to reflect the multi-factorial reality.
Ali and Naeem [12] proposed a new extension of T-SFS, called r,s,t-spherical fuzzy sets (srt-SFSs), which lift all restrictions inflicted by classical sets. Equivalently, Rahim et al. [13] introduced the concept of pqr-spherical fuzzy sets (pqr-SFSs) with little restriction. We follow the latter notation in this work. In pqr-SFSs, the triplet (MD, NMD, and ¬MD) is constrained according to ( MD ) p + ( NMD ) q + ( ¬ MD ) r 1 , where p , r are +ve integers with q = L C M ( p , r ) . The pqr-SFSs have been studied in several manners by several researchers; see [14,15]. Karaaslan and Karamaz [16] also extended this concept to interval-valued pqr-spherical fuzzy sets.
Bipolarity is the existence of two opposing or contrasting components, powers, or circumstances. In many areas, it refers to the state of balance between two opposing or complementary poles, commonly considered as good/bad or beneficial/non-beneficial angles. Thus, bipolarity has practical and theoretical applications in everything from psychology and political science to physics and decision-making. Bipolar fuzzy sets are a generalization of conventional fuzzy sets, which are very useful in complex real-life situations where both, +ve, and negative, −ve, feelings need to be considered. These methods can accommodate dual uncertainties, making them applicable in a variety of fields like decision-making, pattern identification, medical diagnosis, sentiment analysis, risk assessment, and AI. As the demand for higher-level models in ambiguous and uncertain situations develops, extended bipolar fuzzy sets are anticipated to play an increasingly important role in enhancing computer intelligence.
The first extension in this form was the bipolar intuitionistic fuzzy set (BIFS) [17] introduced by Ezhilmaran and Sankar. By the same scenario stated in the first paragraph, the bipolar Pythagorean fuzzy set (BPyFS) [18], Fermatean bipolar fuzzy set (FBFS) [19], bipolar q-rung orthopair fuzzy set (Bq-ROFS) [20], bipolar m,n-rung orthopair fuzzy set (Bmn-ROFS) [21], and spherical bipolar fuzzy set (SBFS) [22] are introduced.
Lastly, the bipolar T-spherical fuzzy set (BT-FS) [23], is a model that includes both +ve and −ve values of MD, NMD, and ¬MD. Specifically, MD + , NMD+, ¬MD+ [ 0 , 1 ] , and MD, NMD , ¬ MD [ 1 , 0 ] , satisfy the conditions 0 ( MD + ) n + ( NMD + ) n + ( ¬ MD + ) n 1 and 1 ( MD ) n + ( NMD ) n + ( ¬ MD ) n 0 , for some +ve integer, n 2 . This requirement forces decision-makers to give an equal n to MD, NMD, and ¬MD. In some cases, decision-makers may have to assign different levels of authority to the MD, NMD, or ¬MD. Such requirements cannot be catered to by BT-SFSs. Therefore, in order to overcome these limitations, we introduce the bipolar pqr-spherical fuzzy set ( B pqr SFS), which allows decision-makers to choose any +ve integers p , q , r , without violating condition 0 ( MD + ) p + ( NMD + ) q + ( ¬ MD + ) r 1 , and 1 ( MD ) p + ( NMD ) q + ( ¬ MD ) r 0 . By permitting decision-makers to allocate different parameters, p , q , and r to MD + , NMD + , ¬ MD + [ 0 , 1 ] and MD , NMD , ¬ MD [ 1 , 0 ] , respectively, B pqr SFSs create a relatively open stage for DM processes. More specifically, if a decision-maker sets MD + = 0.95 , NMD + = 0.5 , and ¬ MD + = 0.6 ; MD = 0.03 , NMD = 0.4 , and ¬ MD = 0.2 for example. In that case, for p = q = r = 4 , one can see that ( 0.95 ) 4 + ( 0.5 ) 4 + ( 0.6 ) 4 > 1 and ( 0.03 ) 4 + ( 0.4 ) 4 + ( 0.2 ) 4 > 0 violate the restricted conditions for the BT-F model. However, for p = 4 , q = 5 , and r = 6 , both restrictions hold true, showing the power of choosing different parameters and, consequently, the robustness of the proposed model. Figure 1 illustrates its position and demonstrates how the most well-known extended fuzzy sets are derived from the conventional fuzzy set.
A T-spherical fuzzy set, which satisfies the restriction ( MD ) n + ( NMD ) n + ( ¬ MD ) n 1 for some integer n 2 , is a verbal generalization of various types of extended fuzzy sets (discussed above). However, it is not free from limitations. Then, the concept of pqr-spherical fuzzy sets lifts approximately all restrictions imposed by earlier sets. In a pqr-spherical fuzzy set, the triplet (MD, NMD, and ¬MD) is constrained to ( MD ) p + ( NMD ) q + ( ¬ MD ) r 1 , where p , r Z + such that q = L C M ( p , r ) . This approach does not allow DM to evaluate MD, NMD, and ¬MD in a +ve as well as −ve manner. The bipolar T-spherical fuzzy set [23] appeared in the literature, which contains both +ve and −ve values of MD, NMD, and ¬MD. However, this approach fails to provide an additional flexible atmosphere for DM procedures by permitting decision-makers to set multiple values for p , q , r for +ve and −ve values of MD, NMD, and ¬MD, respectively. This encourages us to put forward the bipolar pqr-spherical fuzzy set, a model that overcomes the preceding restrictions. Furthermore, bipolar pqr-spherical fuzzy sets generalize various fuzzy models in the literature and many MCDM techniques can be extended based on them.
This article offers a new notion of bipolar pqr-spherical fuzzy sets along with its principal operations, which expand on the existing bipolar T-spherical fuzzy sets and pqr-spherical fuzzy sets. Both averaging and geometric aggregation operators are put forward to aggregate bipolar pqr-spherical fuzzy information in the MCDM issues based on the prescribed operations. An extension of the TOPSIS technique for bipolar pqr-spherical fuzzy sets is proposed, which generalizes other methods.
The structure of this paper is outlined as follows: Section 2 presents some fundamental definitions and associated concepts succinctly. In Section 3, we present the operational laws and aggregation operators pertaining to pqr-spherical fuzzy numbers. Section 4 introduces the MCDM and TOPSIS methods, along with a numerical example to illustrate the suggested approach. Section 5 conducts an intensive comparative evaluation of the suggested methods in relation to previously established models. The conclusion of this paper is found in Section 6.

2. Background Concepts

The development of the intended model will be aided by keeping in mind the following basic definitions and properties:
Definition 1 
([22]). Let U denote a non-empty finite set. A T-spherical fuzzy set (T-SFS) is defined as follows:
T = { ( ρ , θ ( ρ ) , η ( ρ ) , λ ( ρ ) ) ρ U } ,
where θ ( ρ ) represents a +ve membership, η ( ρ ) represents neutral membership, and λ ( ρ ) represents a −ve membership with
0 θ ( ρ ) , η ( ρ ) , λ ( ρ ) 1 ,
and
( θ ( ρ ) ) q + ( η ( ρ ) ) q + ( λ ( ρ ) ) q 1 ,
where q Z + can be adjusted to a range of values based on the situation or requirements, the triplet T = ( θ , η , λ ) is named a T-spherical fuzzy number (abbreviated as T-SFN), such that ( θ ) q + ( η ) q + ( λ ) q 1 .
Definition 2 
([22]). Let T 1 = ( θ 1 , η 1 , λ 1 ) , T 2 = ( θ 2 , η 2 , λ 2 ) , and T = ( θ , η , λ ) be three T-SFNs. Then, we have the following:
1. 
T 1 T 2 = ( θ 1 ) q + ( θ 2 ) q ( θ 1 ) q ( θ 2 ) q 2 q , η 1 η 2 , λ 1 λ 2 .
2. 
T 1 T 2 = θ 1 θ 2 , ( η 1 ) q + ( η 2 ) q ( η 1 ) q ( η 2 ) q 2 q , ( λ 1 ) q + ( λ 2 ) q ( λ 1 ) q ( λ 1 ) q 2 q .
3. 
ϵ · T = ( 1 ( 1 ( θ ) q ) ϵ 2 q , ( η ) ϵ , ( λ ) ϵ ) .
4. 
T ϵ = ( ( θ ) ϵ , 1 ( 1 ( η ) q ) ϵ 2 q , 1 ( 1 ( λ ) q ) ) ϵ 2 q ) .
Definition 3 
([23]). Let U be an initial universe. A bipolar T-spherical fuzzy set (BT-SFS) over U is defined as follows:
B ¨ = { ( ρ , θ + ( ρ ) , η + ( ρ ) , λ + ( ρ ) , θ ( ρ ) , η ( ρ ) , λ ( ρ ) ) : ρ U } ,
where θ + , η + , λ + : U [ 0 , 1 ] refer to the +ve degree membership, neutral, and non-membership functions, respectively, and θ , η , λ : U [ 1 , 0 ] refer to the −ve degree membership, neutral, and non-membership functions, respectively, such that
0 ( θ + ( ρ ) ) q + ( η + ( ρ ) ) q + ( λ + ( ρ ) ) q 1 ,
and
1 ( θ ( ρ ) ) q + ( η ( ρ ) ) q + ( λ ( ρ ) ) q 0 ,
for each ρ U and some q Z + . The 6-tuple B = ( θ + , η + , λ + , θ , η , λ ) is conveniently called a bipolar T-spherical fuzzy number (BT-SFN).
Definition 4 
([23]). Let B 1 = ( θ 1 + , η 1 + , λ 1 + , θ 1 , η 1 , λ 1 ) and B 2 = ( θ 2 + , η 2 + , λ 2 + , θ 2 , η 2 , λ 2 ) denote two BT-SFNs. Then, we have the following:
1. 
B 1 B 2 = ( ( ( θ 1 + ) q ) 2 + ( ( θ 2 + ) q ) 2 ( ( θ 1 + ) q ) 2 ( ( θ 2 + ) q ) 2 , ( η 1 + ) q · ( η 2 + ) q , ( λ 1 + ) q · ( λ 2 + ) q , ( θ 1 + ) q · ( θ 2 + ) q , ( ( η 1 ) q ) 2 + ( ( η 2 ) q ) 2 ( ( η 1 ) q ) 2 ( ( η 2 ) q ) 2 , ( ( λ 1 ) q ) 2 + ( ( λ 2 ) q ) 2 ( ( λ 1 ) q ) 2 ( ( λ 2 ) q ) 2 ) .
2. 
B 1 B 2 = ( ( θ 1 + ) q · ( θ 2 + ) q , ( ( η 1 + ) q ) 2 + ( ( η 2 + ) q ) 2 ( ( η 1 + ) q ) 2 ( ( η 2 + ) q ) 2 , ( ( λ 1 + ) q ) 2 + ( ( λ 2 + ) q ) 2 ( ( λ 1 + ) q ) 2 ( ( λ 2 + ) q ) 2 , ( ( θ 1 ) q ) 2 + ( ( θ 2 ) q ) 2 ( ( θ 1 ) q ) 2 ( ( θ 2 ) q ) 2 , ( η 1 ) q · ( η 2 ) q , ( λ 1 ) q · ( λ 2 ) q ) .
3. 
ϵ · B = ( 1 ( 1 ( ( θ B + ) q ) 2 ) ϵ , ( ( η B + ) q ) ϵ , ( ( λ B + ) q ) ϵ , ( ( θ B + ) q ) ϵ , 1 ( 1 ( ( ( η B + ) q ) 2 ) ) ϵ , 1 ( 1 ( ( ( λ B + ) q ) 2 ) ) ϵ ) .
4. 
B ϵ = ( ( θ B + ) q ) ϵ , 1 ( 1 ( ( η B + ) q ) 2 ) ϵ , 1 ( 1 ( ( λ B + ) q ) 2 ) ϵ , 1 ( 1 ( ( ( θ B + ) q ) 2 ) ) ϵ , ( ( η B ) q ) ϵ , ( ( λ B ) q ) ϵ ) .
Definition 5 
([12,13]). Let U denote a non-empty finite set. A pqr-spherical fuzzy set (pqr-SFS) is defined as follows:
S = { ( ρ , θ ( ρ ) , η ( ρ ) , λ ( ρ ) ) ρ U } ,
such that θ ( ρ ) represents a +ve membership, η ( ρ ) represents neutral membership, and λ ( ρ ) represents a −ve membership, where
0 θ ( ρ ) , η ( ρ ) , λ ( ρ ) 1 ,
and
( θ ( ρ ) ) p + ( η ( ρ ) ) q + ( λ ( ρ ) ) r 1 ,
for any +ve integers p , q , r . The triplet S = ( θ , η , λ ) such that ( θ ) p + ( η ) q + ( λ ) r 1 is called a pqr-spherical fuzzy number (pqr-SFN).
Definition 6 
([13]). Let S 1 = ( θ 1 , η 1 , λ 1 ) , S 2 = ( θ 2 , η 2 , λ 2 ) , and S = ( θ , η , λ ) denote three pqr-SFNs. Then, we have the following:
1. 
S 1 S 2 = ( θ 1 ) p + ( θ 2 ) p ( θ 1 ) p ( θ 2 ) p 2 p , η 1 η 2 , λ 1 λ 2 .
2. 
S 1 S 2 = ( θ 1 θ 2 , ( η 1 ) q + ( η 2 ) q ( η 1 ) q ( η 2 ) q 2 q , ( λ 1 ) r + ( λ 2 ) r ( λ 1 ) r ( λ 1 ) r 2 r ) .
3. 
ϵ · S = ( 1 ( 1 ( θ ) p ) ϵ 2 p , ( η ) ϵ , ( λ ) ϵ ) .
4. 
S ϵ = ( ( θ ) ϵ , 1 ( 1 ( η ) q ) ϵ 2 q , 1 ( 1 ( λ ) r ) ) ϵ 2 r ) .

3. Bipolar pqr-Spherical Fuzzy Sets

In this section, a bipolar pqr-spherical fuzzy set, which is a hybrid model that incorporates both BFS and pqr-SFS, is defined, and we provide its fundamental operations:
Definition 7. 
Let U be an initial universe. A bipolar pqr-spherical fuzzy set ( B pqr SFS) over U is defined as follows:
T ¨ = { ( ρ , θ + ( ρ ) , η + ( ρ ) , λ + ( ρ ) , θ ( ρ ) , η ( ρ ) , λ ( ρ ) ) : ρ U } ,
where θ + , η + , λ + : U [ 0 , 1 ] refer to the +ve degree membership, neutral, and non-membership functions, respectively, and θ , η , λ : U [ 1 , 0 ] refer to the −ve degree membership, neutral, and non-membership functions, respectively, such that
0 ( θ + ( ρ ) ) p + ( η + ( ρ ) ) q + ( λ + ( ρ ) ) r 1 ,
and
1 ( θ ( ρ ) ) p + ( η ( ρ ) ) q + ( λ ( ρ ) ) r 0 ,
for each ρ U and some p , q , r Z + . For convenience, we call τ ¨ = ( θ + , η + , λ + , θ , η , λ ) a bipolar pqr-spherical fuzzy number ( B p q r SFN).
This model can be effectively applied to various real-world situations, including electoral voting systems, business strategies, finance, agricultural optimization, and medical treatments. More precisely, profit and loss statements are commonly used in the business and finance fields. BpqrSFS allows us to link business decision-making activities. When people invest their money in certain firms, their primary goal is to maximize profits within a set time frame. BpqrSFS has the ability to deal with such situations and issues by BpqrSFN, which is represented by ( θ + , η + , λ + , θ , η , λ ) , where θ + is the degree of satisfaction that produces profit, η + is the degree of abstinence that produces profit, and λ + is the degree of dissatisfaction that produces profit, where θ is the degree of satisfaction that causes a loss, η is the degree of abstinence that causes a loss, and λ is the degree of dissatisfaction that causes a loss.
In accordance with existing literature, we shall refer to the proposed set as a bipolar (p,q,r)-spherical (or bipolar (r,s,t)-spherical) fuzzy set. However, we prefer to stick with the way mentioned above.
Remark 1. 
Definition 7 yields the following definitions in certain cases:
1. 
bipolar T-spherical fuzzy set (BT-SFS) [23] if p = q = r .
2. 
spherical bipolar fuzzy set (SBFS) [22] if p = q = r = 2 .
3. 
bipolar picture fuzzy set (BPFS) [24] if p = q = r = 1 .
4. 
bipolar mn-rung orthopair fuzzy set (Bmn-ROFS) [21] if η τ ¨ + ( ρ ) = η τ ¨ ( ρ ) = 0 .
5. 
Fermatean bipolar fuzzy set (FBFS) [19] if p = q = r = 3 and η τ ¨ + ( ρ ) = η τ ¨ ( ρ ) = 0 .
6. 
bipolar Pythagorean fuzzy set (BPyFS) [18] if p = q = r = 2 and η τ ¨ + ( ρ ) = η τ ¨ ( ρ ) = 0 .
7. 
bipolar intuitionistic fuzzy set (BIFS) [17] if p = q = r = 1 and η τ ¨ + ( ρ ) = η τ ¨ ( ρ ) = 0 .
8. 
pqr-spherical fuzzy set (pqr-SFS) [12,13] if θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
9. 
T-spherical fuzzy set (T-SFS) [9] if p = q = r and θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
10. 
spherical fuzzy set (SFS) [9,25] if p = q = r = 2 and θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
11. 
picture fuzzy set (PFS) [8] if p = q = r = 1 and θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
12. 
p,q-quasirung orthopair fuzzy set (pq-QROFS) [6] if η τ ¨ + ( ρ ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
13. 
q-rung orthopair fuzzy set (q-ROFS) [4] if p = q and η τ ¨ + ( ρ ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
14. 
Fermatean fuzzy set (FFS) [26] if p = q = 3 and η τ ¨ + ( ρ ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
15. 
Pythagorean fuzzy set (PyFS) [3] if p = q = 2 and η τ ¨ + ( ρ ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
16. 
intuitionistic fuzzy set (IFS) [2] if p = q = 1 and η τ ¨ + ( ρ ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
17. 
fuzzy set (FS) [1] if p = 1 and η τ ¨ + ( ρ ) = λ τ ¨ + ( ρ ) ) = θ τ ¨ ( ρ ) = η τ ¨ ( ρ ) = λ τ ¨ ( ρ ) ) = 0 .
Next, Table 1 highlights the exceptional performance of our novel model compared to existing models, excelling in membership degree (MD), neutral degree (NMD), non-membership degree (¬MD), offering greater flexibility in parameter selection, and effectively capturing bipolarity.
Now, we present the fundamental operations on B pqr SFNs.
Definition 8. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) and ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) be two B p q r SFNs. Then, we have the following:
1. 
τ ¨ ˜ ¨ , if θ τ ¨ + θ ¨ + , η τ ¨ + η ¨ + , λ τ ¨ + λ ¨ + , θ τ ¨ θ ¨ , η τ ¨ η ¨ , and λ τ ¨ λ ¨ .
2. 
τ ¨ = ¨ if τ ¨ ˜ ¨ and ¨ ˜ τ ¨ .
3. 
τ ¨ c = ( λ τ ¨ + , η τ ¨ + , θ τ ¨ + , λ τ ¨ , η τ ¨ , θ τ ¨ ) , where τ ¨ c means the complement of τ ¨ .
4. 
τ ¨ ˜ ¨ = min ( θ τ ¨ + , θ ¨ + ) , min ( η τ ¨ + , η ¨ + ) , max ( λ τ ¨ + , λ ¨ + ) , max ( θ τ ¨ , θ ¨ ) , max ( η τ ¨ , η ¨ ) , min ( λ τ ¨ , λ ¨ ) .
5. 
τ ¨ ˜ ¨ = max ( θ τ ¨ + , θ ¨ + ) , min ( η τ ¨ + , η ¨ + ) , min ( λ τ ¨ + , λ ¨ + ) , min ( θ τ ¨ , θ ¨ ) , max ( η τ ¨ , η ¨ ) , max ( λ τ ¨ , λ ¨ ) .
Proposition 1. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) , ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) , and ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) denote B p q r SFNs. Then, we have the following:
1. 
τ ¨ ˜ ¨ and ¨ ˜ ¨ τ ¨ ˜ ¨ .
2. 
τ ¨ ˜ ¨ = ¨ ˜ τ ¨ .
3. 
τ ¨ ˜ ¨ = ¨ ˜ τ ¨ .
4. 
τ ¨ ˜ ( ¨ ˜ ¨ ) = ( τ ¨ ˜ ¨ ) ˜ ¨ .
5. 
τ ¨ ˜ ( ¨ ˜ ¨ ) = ( τ ¨ ˜ ¨ ) ˜ ¨ .
6. 
( τ ¨ ˜ ¨ ) ˜ ¨ = ¨ .
7. 
( τ ¨ ˜ ¨ ) ˜ ¨ = ¨ .
8. 
τ ¨ ˜ ( ¨ ˜ ¨ ) = ( τ ¨ ˜ ¨ ) ˜ ( τ ¨ ˜ ¨ ) .
9. 
τ ¨ ˜ ( ¨ ˜ ¨ ) = ( τ ¨ ˜ ¨ ) ˜ ( τ ¨ ˜ ¨ ) .
Proof. 
See Appendix A (1). □
Proposition 2. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) and ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) denote B p q r SFNs. Then, we have the following:
1. 
( τ ¨ ˜ ¨ ) c = ¨ c ˜ τ ¨ c .
2. 
( τ ¨ ˜ ¨ ) c = ¨ c ˜ τ ¨ c .
3. 
( τ ¨ c ) c = τ ¨ .
Proof. 
See Appendix A (2). □
Remark 2. 
Given any B p q r SFNs τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) and ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) , then τ ¨ c , τ ¨ ˜ ¨ , τ ¨ ˜ ¨ are also B p q r SFNs.
Example 1. 
Consider the initial universe U = { ρ 1 } , and let τ ¨ = { 0.4 , 0.3 , 0.8 , 0.5 , 0.3 , 0.6 } , ¨ = { 0.5 , 0.2 , 0.7 , 0.4 , 0.6 , 0.8 } be B p q r SFNs. Then, we have the following:
1. 
Neither τ ¨ ˜ ¨ nor ¨ ˜ τ ¨ , since η τ ¨ + η ¨ + and θ ¨ + θ τ ¨ + .
2. 
τ ¨ c = 0.8 , 0.3 , 0.4 , 0.6 , 0.3 , 0.5 .
3. 
τ ¨ ˜ ¨ = 0.4 , 0.2 , 0.8 , 0.4 , 0.3 , 0.8 .
4. 
τ ¨ ˜ ¨ = 0.5 , 0.2 , 0.7 , 0.5 , 0.3 , 0.6 .
Next, we present the sum, product, scalar product, and exponent operations on the B pqr SFSs.
Definition 9. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) and ¨ = ( θ ¨ + , η ¨ + , λ ¨ + , θ ¨ , η ¨ , λ ¨ ) denote B p q r SFNs ( B p q r SFNs) and let ϵ R + . Then, we have the following:
1. 
τ ¨ ¨ = ( ( θ τ ¨ + ) 2 p + ( θ ¨ + ) 2 p ( θ τ ¨ + ) 2 p ( θ ¨ + ) 2 p 2 p , η τ ¨ + · η ¨ + , λ τ ¨ + · λ ¨ + , θ τ ¨ · θ ¨ , ( η τ ¨ ) 2 q + ( η ¨ ) 2 q ( η τ ¨ ) 2 q ( η ¨ ) 2 q 2 q , ( λ τ ¨ ) 2 p + ( λ ¨ ) 2 p ( λ τ ¨ ) 2 p ( λ ¨ ) 2 p 2 r ) .
2. 
τ ¨ ¨ = ( θ τ ¨ + · θ ¨ + , ( η τ ¨ + ) 2 q + ( η ¨ + ) 2 q ( η τ ¨ + ) 2 q ( η ¨ + ) 2 q 2 q , ( λ τ ¨ + ) 2 r + ( λ ¨ + ) 2 r ( λ τ ¨ + ) 2 r ( λ ¨ + ) 2 r 2 r , ( θ τ ¨ ) 2 p + ( θ ¨ ) 2 p ( θ τ ¨ ) 2 p ( θ ¨ ) 2 p 2 p , η τ ¨ · η ¨ , λ τ ¨ · λ ¨ ) .
3. 
ϵ . τ ¨ = ( 1 ( 1 ( θ τ ¨ + ) 2 p ) ϵ 2 p , ( η τ ¨ + ) ϵ , ( λ τ ¨ + ) ϵ , ( θ τ ¨ ) ϵ , 1 ( 1 ( η τ ¨ ) 2 q ) ϵ 2 q , 1 ( 1 ( λ τ ¨ ) 2 r ) ϵ 2 r ) .
4. 
τ ¨ ϵ = ( ( θ τ ¨ + ) ϵ , 1 ( 1 ( η τ ¨ + ) 2 q ) ϵ 2 q , 1 ( 1 ( λ τ ¨ + ) 2 r ) ϵ 2 r , 1 ( 1 ( θ τ ¨ ) 2 p ) ϵ 2 p , ( η τ ¨ ) ϵ , ( λ τ ¨ ) ϵ ) .
Example 2. 
Recall the B p q r SFNs τ ¨ = { 0.4 , 0.3 , 0.8 , 0.5 , 0.3 , 0.6 } and ¨ = { 0.5 , 0.2 , 0.7 , 0.4 , 0.6 , 0.8 } considered in Example 1 such that p = 4 , q = 3 , r = 6 and let ϵ = 0.3 . Then, we have the following:
1. 
τ ¨ ¨ = { 0.2598 , 0.06 , 0.56 , 0.2 , 0.3618 , 0.6431 } .
2. 
τ ¨ ¨ = { 0.2 , 0.0926 , 0.6586 , 0.2598 , 0.18 , 0.48 } .
3. 
ϵ . τ ¨ = { 0.1184 , 0.6968 , 0.9352 , 0.8123 , 0.0603 , 0.2946 } .
4. 
τ ¨ ϵ = { 0.7597 , 0.0603 , 0.5258 , 0.1851 , 0.6968 , 0.8579 } .
Theorem 1. 
Let τ ¨ 1 = ( θ τ ¨ 1 + , η τ ¨ 1 + , λ τ ¨ 1 + , θ τ ¨ 1 , η τ ¨ 1 , λ τ ¨ 1 ) , τ ¨ 2 = ( θ τ ¨ 2 + , η τ ¨ 2 + , λ τ ¨ 2 + , θ τ ¨ 2 , η τ ¨ 2 , λ τ ¨ 2 ) , and τ ¨ 3 = ( θ τ ¨ 3 + , η τ ¨ 3 + , λ τ ¨ 3 + , θ τ ¨ 3 , η τ ¨ 3 , λ τ ¨ 3 ) denote B p q r SFSs. Then, we have the following:
1. 
τ ¨ 1 τ ¨ 2 = τ ¨ 2 τ ¨ 1 .
2. 
τ ¨ 1 τ ¨ 2 = τ ¨ 2 τ ¨ 1 .
3. 
( τ ¨ 1 τ ¨ 2 ) τ ¨ 3 = τ ¨ 1 ( τ ¨ 2 τ ¨ 3 ) .
4. 
( τ ¨ 1 τ ¨ 2 ) τ ¨ 3 = τ ¨ 1 ( τ ¨ 2 τ ¨ 3 ) .
Proof. 
Straightforward. □
Theorem 2. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) , τ ¨ 1 = ( θ τ ¨ 1 + , η τ ¨ 1 + , λ τ ¨ 1 + , θ τ ¨ 1 , η τ ¨ 1 , λ τ ¨ 1 ) , and τ ¨ 2 = ( θ τ ¨ 2 + , η τ ¨ 2 + , λ τ ¨ 2 + , θ τ ¨ 2 , η τ ¨ 2 , λ τ ¨ 2 ) denote three B p q r SFSs and ϵ , ϵ 1 , ϵ 2 > 0 . Then, we have the following:
1. 
ϵ · τ ¨ 1 τ ¨ 2 = ϵ · τ ¨ 1 ϵ · τ ¨ 2 .
2. 
( ϵ 1 ϵ 2 ) · τ ¨ = ϵ 1 · τ ¨ ϵ 2 · τ ¨ .
3. 
τ ¨ ϵ 1 + ϵ 2 = τ ¨ ϵ 1 τ ¨ ϵ 2 .
4. 
τ ¨ 1 τ ¨ 2 ϵ = τ ¨ 1 ϵ τ ¨ 2 ϵ .
Proof. 
See Appendix A (3). □
One of the most important tools in the fuzzy set analysis is the distance measure. It is commonly used when making decisions. The most commonly used distance measurement is the Euclidean distance. This distance measure between B pqr SFNs, which will be utilized later in the TOPSIS method, is provided in this section.
Definition 10. 
Let τ ¨ and ¨ be two B p q r SFNs on a set U = { ρ 1 , ρ 2 , , ρ n } . A distance measure between τ ¨ and ¨ is D ¨ : ( B p q r S F N ) 2 [ 0 , 1 ] , if the following conditions are satisfied:
1. 
0 D ¨ ( τ ¨ , ¨ ) 1 ;
2. 
D ¨ ( τ ¨ , ¨ ) = D ¨ ( ¨ , τ ¨ ) ;
3. 
D ¨ ( τ ¨ , ¨ ) = 0 if and only if τ ¨ = ¨ .
Definition 11. 
Let τ ¨ and ¨ be two B p q r SFNs on a set U = { ρ 1 , ρ 2 , , ρ n } . We define the distance measure between τ ¨ and ¨ as follows:
D ¨ ( τ ¨ , ¨ ) = 1 6 [ ( θ τ ¨ + ) p ( θ ¨ + ) p 2 + ( η τ ¨ + ) q ( η ¨ + ) q 2 + ( λ τ ¨ + ) r ( λ ¨ + ) r 2 + ( θ τ ¨ ) p ( θ ¨ ) p 2 + ( η τ ¨ ) q ( η ¨ ) q 2 + ( λ τ ¨ ) r ( λ ¨ ) r 2 ] .
Notice that characteristics of Definition 10 are clearly met by the distance measure mentioned in Equation (1).
Example 3. 
Recalling again the B p q r SFNs τ ¨ = { 0.4 , 0.3 , 0.8 , 0.5 , 0.3 , 0.6 } and ¨ = { 0.5 , 0.2 , 0.7 , 0.4 , 0.6 , 0.8 } given in Example 1 such that p = 2 , q = 3 , r = 4 . Then, we have the following: D ¨ ( τ ¨ , ¨ ) = 0.1923 .

4. Bipolar pqr-Spherical Fuzzy Aggregation Operators

This section extends the basic aggregation operators into the B pqr SFS environment by creating bipolar pqr-spherical fuzzy-weighted averaging and bipolar pqr-spherical fuzzy-weighted geometric operators for aggregating the B pqr SFNs.

4.1. Bipolar pqr-Spherical Fuzzy-Weighted Average Operators

In this subsection, the weighted average operator for aggregating B pqr SFNs is introduced, and its key characteristics are examined.
Definition 12. 
Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) , for j = 1 , 2 , , l , be a collection of B p q r SFNs, then the formulation of the bipolar pqr-spherical fuzzy-weighted average ( B p q r SFWA) operator is expressed as follows:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = j = 1 l ϵ j · τ ¨ j ,
whereas ϵ = ( ϵ 1 , ϵ 2 , , ϵ l ) is meant to the weight of τ ¨ j for j = 1 , 2 , , l such that j = 1 l ϵ j = 1 and each ϵ j > 0 .
The following theorems are derived from the B pqr SFNs operating rules.
Theorem 3. 
The B p q r SFWA operator is defined as follows:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = ( 1 j = 1 l ( 1 ( θ τ ¨ + ) 2 p ) ϵ j 2 p , j = 1 l ( η τ ¨ + ) ϵ j , j = 1 l ( λ τ ¨ + ) ϵ j , j = 1 l ( θ τ ¨ ) ϵ j , 1 j = 1 l ( 1 ( η τ ¨ ) 2 q ) ϵ j 2 q , 1 j = 1 l ( 1 ( λ τ ¨ ) 2 r ) ϵ j 2 r ) .
Proof. 
See Appendix A (4). □
Theorem 4 
(Idempotency). Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) denote a family of B p q r SFNs, for j { 1 , 2 , , l } . If τ ¨ j = τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) for all j, then
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = τ ¨ .
Proof. 
See Appendix A (5). □
Theorem 5 
(Monotonicity). If τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) and ¨ j = ( θ ¨ j + , η ¨ j + , λ ¨ j + , θ ¨ j , η ¨ j , λ ¨ j ) are two families of B p q r SFNs indexed by j = 1 , 2 , , l , and if τ ¨ j ¨ j for all j, then
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) B p q r S F W A ( ¨ 1 , ¨ 2 , , ¨ l ) .
Proof. 
See Appendix A (6). □
Theorem 6 
(Boundedness). Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) ( j = 1 , 2 , , l ) denote a collection of B p q r SFNs. Then, we have the following:
min j = 1 , 2 , , l { τ ¨ j } B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) max j = 1 , 2 , , l { τ ¨ j } .
Proof. 
See Appendix A (7). □

4.2. Bipolar pqr-Spherical Fuzzy-Weighted Geometric Operators

The novel concept of the weighted geometric operator for aggregating B pqr SFNs is presented in this subsection, along with an examination of its key characteristics.
Definition 13. 
Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) , for j = 1 , 2 , , l , be a collection of B p q r SFNs. Then the formulation of the bipolar pqr-spherical fuzzy-weighted geometric ( B p q r SFWG) operator is expressed as follows:
B p q r S F W G ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = j = 1 l ϵ j · τ ¨ j ,
where ϵ = ( ϵ 1 , ϵ 2 , , ϵ l ) denotes the weight of τ ¨ j for j = 1 , 2 , , l such that j = 1 l ϵ j = 1 and ϵ j > 0 .
Theorem 7. 
The B p q r SFWG operator is defined as follows:
B p q r S F W G ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = ( j = 1 l ( θ τ ¨ + ) ϵ j , 1 j = 1 l ( 1 ( η τ ¨ + ) 2 q ) ϵ j 2 q , 1 j = 1 l ( 1 ( λ τ ¨ + ) 2 r ) ϵ j 2 r , 1 j = 1 l ( 1 ( θ τ ¨ ) 2 p ) ϵ j 2 p , j = 1 l ( η τ ¨ ) ϵ j , j = 1 l ( λ τ ¨ ) ϵ j ) .
Proof. 
The same steps as those outlined in the proof of Theorem 3. □
Theorem 8 
(Idempotency). Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) denote a family of B p q r SFNs indexed by j = 1 , 2 , , l . If τ ¨ j = τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) for all j, then
B p q r S F W G ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = τ ¨ .
Proof. 
The proof is similar to the proof of Theorem 4. □
Theorem 9 
(Monotonicity). If τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) and ¨ j = ( θ ¨ j + , η ¨ j + , λ ¨ j + , θ ¨ j , η ¨ j , λ ¨ j ) are two families of B pqr SFNs indexed by j = 1 , 2 , , l , and if τ ¨ j ¨ j for all j, then
B p q r S F W G ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) B p q r S F W G ( ¨ 1 , ¨ 2 , , ¨ l ) .
Proof. 
The proof is similar to the proof of Theorem 5. □
Theorem 10 
(Boundedness). Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) ( j = 1 , 2 , , l ) denote a collection of B p q r SFNs. Then,
min j = 1 , 2 , , l { τ ¨ j } B n q r S F W G ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) max j = 1 , 2 , , l { τ ¨ j } .
Proof. 
The proof is similar to the proof of Theorem 6. □
Definition 14. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) denote a B p q r SFN. Then, the score function of B p q r SFN τ ¨ is defined as follows:
s c o r ( τ ¨ ) = 1 2 ( 1 + ( θ τ ¨ + ) p ( 1 ( η τ ¨ + ) q ( λ τ ¨ + ) r ) | θ τ ¨ | p ( 1 | η τ ¨ | q | λ τ ¨ | r ) ) .
Definition 15. 
Let τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) denote a B p q r SFN. Then, the accuracy function of B p q r SFN τ ¨ is defined as follows:
a c c u ( τ ¨ ) = 1 2 ( ( θ τ ¨ + ) p + ( η τ ¨ + ) q + ( λ τ ¨ + ) r + | θ τ ¨ | p + | η τ ¨ | q + | λ τ ¨ | r ) .
Definition 16. 
Let τ ¨ 1 = ( θ τ ¨ 1 + , η τ ¨ 1 + , λ τ ¨ 1 + , θ τ ¨ 1 , η τ ¨ 1 , λ τ ¨ 1 ) and τ ¨ 2 = ( θ τ ¨ 2 + , η τ ¨ 2 + , λ τ ¨ 2 + , θ τ ¨ 2 , η τ ¨ 2 , λ τ ¨ 2 ) be B p q r SFNs. Then, from Definitions 14 and 15, we have the following:
1. 
If s c o r ( τ ¨ 1 ) < s c o r ( τ ¨ 2 ) , then τ ¨ 1 τ ¨ 2 ( τ ¨ 1 is inferior to τ ¨ 2 );
2. 
If s c o r ( τ ¨ 1 ) > s c o r ( τ ¨ 2 ) , then τ ¨ 1 τ ¨ 2 ( τ ¨ 1 is superior to τ ¨ 2 );
3. 
If s c o r ( τ ¨ 1 ) = s c o r ( τ ¨ 2 ) , then
                        if a c c u ( τ ¨ 1 ) < a c c u ( τ ¨ 2 ) , then τ ¨ 1 τ ¨ 2 ( τ ¨ 1 is "inferior” to τ ¨ 2 );
                      if a c c u ( τ ¨ 1 ) > a c c u ( τ ¨ 2 ) , then τ ¨ 1 τ ¨ 2 ( τ ¨ 1 is “superior” to τ ¨ 2 );
                     if a c c u ( τ ¨ 1 ) = a c c u ( τ ¨ 2 ) , then τ ¨ 1 = τ ¨ 2 ( τ ¨ 1 is “equivalent” to τ ¨ 2 ).

5. MCDM Algorithms

In this part, two fundamental methods (algorithms) are applied to MCDM. The first one is the TOPSIS technique, and the second one involves using the proposed operators in the B pqr SF context, which introduces an approach for handling MCDM problems in a bipolar pqr-spherical environment using the two aforementioned aggregation operators. Let τ ¨ = { τ ¨ 1 , τ ¨ 2 , , τ ¨ n } denote a family of alternatives and C ¨ = { C ¨ 1 , C ¨ 2 , , C ¨ l } denote a set of criteria. Using the B pqr SFNs, the decision-maker assesses the n options in light of the l criteria.

5.1. Extension of the TOPSIS Method with Bipolar pqr-Spherical Fuzzy Sets

TOPSIS is a multi-criteria evaluation approach, established in 1981 by Hwang and Yoon [27], with subsequent improvements by Yoon in [28] and by Hwang et al. in [29]. TOPSIS was founded on the premise that the preferred option should have the lowest geometrical distance from the +ve ideal solution (PIS) and the greatest geometrical distance from the −ve ideal solution (NIS). In 2021, a booklet on TOPSIS in the fuzzy setting was released [30]. The TOPSIS approach comprises several essential metrics. A few researchers introduced the TOPSIS approach based on similarity measures (Hamming, Euclidean, and Dice similarity measures); others discovered the presence of various clustering operators and addressed several real-world issues. As a result, effective and suitable actions will be implemented. However, many strategic decision-making problems inside businesses will be mutually exclusive. Maldonado-Macías et al. [31] analyzed intuitionistic fuzzy TOPSIS. Junior et al. [32] compared the AHP technique with the TOPSIS technique in their application to specific supplier selections. Yilmaz et al. [33] developed the interval-valued type-2 fuzzy TOPSIS method to help international law practitioners and engineers make better decisions while dealing with unpredictable and dynamic systems. Jin et al. [34] introduced the picture fuzzy TOPSIS method to apply it to risk management problems. In 2019, Gündoğdu [10] formulated the fuzzy TOPSIS technique based on spherical fuzzy sets. Akram and Arshad [35] identified bipolar fuzzy TOPSIS methodologies and applications. Recently, Karaaslan and Karamaz [16] proposed the interval-valued pqr-spherical fuzzy TOPSIS method with some applications. This work developed the fuzzy TOPSIS method with B pqr SFs, named the B pqr SF TOPSIS method. The method’s stepwise procedure is explained as follows:
1.
The alternatives are evaluated using l criteria. The final values of the alternatives in relation to each criterion create a B pqr SF decision matrix, which is formed as follows:
D ¨ = [ s ¨ i j ] n × l = θ i j + , η i j + , λ i j + , θ i j , η i j , λ i j = s ¨ 11 s ¨ 12 s ¨ 1 l s ¨ 21 s ¨ 22 s ¨ 2 l s ¨ n 1 s ¨ n 2 s ¨ n l
= θ 11 + , η 11 + , λ 11 + , θ 11 , η 11 , λ 11 θ 12 + , η 12 + , λ 12 + , θ 12 , η 12 , λ 12 θ 1 l + , η 1 l + , λ 1 l + , θ 1 l , η 1 l , λ 1 l θ 21 + , η 21 + , λ 21 + , θ 21 , η 21 , λ 21 θ 22 + , η 22 + , λ 22 + , θ 22 , η 22 , λ 22 θ 2 l + , η 2 l + , λ 2 l + , θ 2 l , η 2 l , λ 2 l θ n 1 + , η n 1 + , λ n 1 + , θ n 1 , η n 1 , λ n 1 θ n 2 + , η n 2 + , λ n 2 + , θ n 2 , η n 2 , λ n 2 θ n l + , η n l + , λ n l + , θ n l , η n l , λ n l
where θ i j + [ 0 , 1 ] and θ i j [ 1 , 0 ] represent the +ve and −ve satisfaction degrees of alternative τ ¨ i under criterion C ¨ j ; η i j + [ 0 , 1 ] and η i j [ 1 , 0 ] represent the +ve and −ve neutrality degrees; and λ i j + [ 0 , 1 ] and λ i j [ 1 , 0 ] represent the +ve and −ve dissatisfaction degrees.
2.
If the criteria are not on the same scale, normalizing is needed, which is the normalizing of the decision matrix according to each criterion’s nature as follows:
[ s ¨ i j ] n × l = { θ i j + , η i j + , λ i j + , θ i j , η i j , λ i j } = { θ i j + , η i j + , λ i j + , θ i j , η i j , λ i j } for benefit criteria { λ i j + , η i j + , θ i j + , λ i j , η i j , θ i j } for non - benefit ( cos t ) criteria
3.
The decision-makers give each criterion a weight value in order to accomplish the normalcy condition, i . e . , regarding the weight vector ϵ = { ϵ 1 , ϵ 2 , , ϵ l } with
j = 1 l ϵ j = 1
4.
The B pqr SF-weighted normalized decision matrix is calculated using the attribute weight vector in the manner described below:
D ¨ ϵ = [ α ¨ i j ] n × l = α ¨ 11 α ¨ 12 α ¨ 1 l α ¨ 21 α ¨ 22 α ¨ 2 l α ¨ n 1 α ¨ n 2 α ¨ n l ,
where each α ¨ = [ ( a i j , c i j , d i j , e i j , m i j , n i j ) ] n × l = ϵ j · θ i j + , ϵ j · η i j + , ϵ j · λ i j + , ϵ j · θ i j , ϵ j · η i j , ϵ j · λ i j is calculated via Equation (3), for each i = 1 , 2 , , n and j = 1 , 2 , , l .
5.
The bipolar pqr-spherical fuzzy +ve ideal solution ( B pqr SFPIS) and the bipolar pqr-spherical fuzzy −ve ideal solution ( B pqr SFNIS) are calculated as follows:
B p q r S F P I S = { ( M 1 + ) P , ( N 1 + ) P , ( V 1 + ) P , ( M 1 ) P , ( N 1 ) P , ( V 1 ) P , ( M 2 + ) P , ( N 2 + ) P , ( V 2 + ) P , ( M 2 ) P , ( N 2 ) P , ( V 2 ) P , , ( M l + ) P , ( N l + ) P , ( V l + ) P , ( M l ) P , ( N l ) P , ( V l ) P } ,
where for j = 1 , 2 , , l ;
( M j + ) P = max i θ i j + , ( N j + ) P = min i η i j + , ( V j + ) P = min i λ i j + , ( M j ) P = min i θ i j , ( N j ) P = max i η i j , ( V j ) P = max i λ i j
and
B p q r S F N I S = { ( M 1 + ) N , ( N 1 + ) N , ( V 1 + ) N , ( M 1 ) N , ( N 1 ) N , ( V 1 ) N , ( M 2 + ) N , ( N 2 + ) N , ( V 2 + ) N , ( M 2 ) N , ( N 2 ) N , ( V 2 ) N , , ( M l + ) N , ( N l + ) N , ( V l + ) N , ( M l ) N , ( N l ) N , ( V l ) N } ,
where
( M j + ) N = min i θ i j + , ( N j + ) N = min i η i j + , ( V j + ) N = max i λ i j + , ( M j ) N = max i θ i j , ( N j ) N = max i η i j , ( V j ) N = min i λ i j .
6.
The normalized Euclidean distance of alternatives, τ ¨ i for ( i = 1 , 2 , , n ) , from bipolar pqr-spherical fuzzy +ve and −ve ideal solutions, is calculated as follows:
D ¨ l ( τ ¨ i , B p q r S F P I S ) = 1 6 l j = 1 l [ ( θ τ ¨ i j + ) p ( M j + ) P p 2 + ( η τ ¨ i j + ) q ( N j + ) P q 2 + ( λ τ ¨ i j + ) r ( V j + ) P r 2 + ( θ τ ¨ i j ) p ( M j ) P p 2 + ( η τ ¨ i j ) q ( N j ) P q 2 + ( λ τ ¨ i j ) r ( V j ) P r 2 ]
and
D ¨ l ( τ ¨ i , B p q r S F N I S ) = 1 6 l j = 1 l [ ( θ τ ¨ i j + ) p ( M j + ) N p 2 + ( η τ ¨ i j + ) q ( N j + ) N q 2 + ( λ τ ¨ i j + ) r ( V j + ) N r 2 + ( θ τ ¨ i j ) p ( M j ) N p 2 + ( η τ ¨ i j ) q ( N j ) N q 2 + ( λ τ ¨ i j ) r ( V j ) N r 2 ]
7.
The relative closeness degree of the corresponding alternative to the bipolar pqr-spherical fuzzy +ve ideal solution, denoted by ϖ i for i = 1 , 2 , , n , is computed by the following formula:
ϖ i = D ¨ l ( τ ¨ i , B p q r S F N I S ) D ¨ l ( τ ¨ i , B p q r S F P I S ) + D ¨ l ( τ ¨ i , B p q r S F N I S ) .
8.
The alternative that has the highest closeness degree value is selected as the best alternative.

5.2. Bipolar pqr-Spherical Fuzzy Aggregation Operator Method

Aggregation tools are essential in MCDM issues that utilize this method, as aggregation involves merging multiple numerical values into a single value; thus, we can refer to this method as an aggregator [36,37,38]. Numerous researchers have focused on the aggregation operators associated with different types of fuzzy numbers. After exploring certain operations concerning intuitionistic fuzzy numbers (IFNs), both geometric and averaging aggregation operators based on IFNs were developed, as described by Xu and Yager [39] and Xu [40]. Subsequently, picture fuzzy geometric and averaging aggregation operators were studied in [41]. Then, spherical aggregation operators were discussed in [25] in the context of MCDM problems. The latter operators were extended to the so-called T-spherical aggregation operators [42]. The concepts of pqr-spherical weighted (geometric and averaging) aggregation operators were proposed in [12,13], generalizing all earlier operators. The T-spherical aggregation operators were further extended to the bipolar T-spherical aggregation operators that appeared in [23], aggregating the given +ve and −ve values. In this study, we build upon the previous ideas by extending bipolar T-spherical aggregation operators to B pqr SF aggregation operators, which are the basis of the new method in MCDM. The stepwise procedure of the proposed method is explained as follows:
1.
The alternatives are evaluated using the l criterion. The final values of the alternatives with regard to each criterion are used to generate a B pqr SF decision matrix similar to Equation (5).
2.
If the criteria are not on the same scale, normalizing is needed, which is the normalizing of the decision matrix according to each criterion’s nature, as in Equation (6).
3.
The decision-makers give each criterion a weight value in order to accomplish the normalcy condition, i . e . , regarding the weight vector ϵ = { ϵ 1 , ϵ 2 , , ϵ l } with
j = 1 l ϵ j = 1 .
4.
The B pqr SFWA operator or B pqr SFWG operator is computed via s ¨ i , where
s ¨ i = θ ¨ i + , η ¨ i + , λ ¨ i + , θ ¨ i , η ¨ i , λ ¨ i = B p q r S F W A s ¨ i 1 , s ¨ i 2 , , s ¨ i l
and is obtained by Equation (2), or
s ¨ i = θ ¨ i + , η ¨ i + , λ ¨ i + , θ ¨ i , η ¨ i , λ ¨ i = B p q r S F W G s ¨ i 1 , s ¨ i 2 , , s ¨ i l
is obtained by Equation (4), for i = 1 , 2 , , n .
5.
Score function of τ ¨ i , denoted by s c o r ( τ ¨ i ) , is calculated using Definition 14.
6.
We sort the alternatives in decreasing order using the score values we obtained in step 5.

6. A Numerical Example Example of the Supplier Assessment Process

The supplier assessment process is critical for any business that wants to ensure its entire supply chain will be both efficient and reliable while also being cost-effective. The supplier assessment process involves evaluating potential and existing suppliers to determine their ability to meet the firm’s requirements in terms of quality, price, delivery time, and other defining criteria.
Supplier assessment data were collected in order to create long-term relationships with suppliers who can always provide products or services that meet company standards. This process also allows businesses to mitigate risks, like supply chain disruptions or compromised quality, and can lead to cost savings by making supplier partnerships more effective.
In this part, three criteria are used by a firm to assess four suppliers ( τ ¨ 1 , τ ¨ 2 , τ ¨ 3 , τ ¨ 4 ) for a long-term contract. The criteria are as follows: C 1 : cost (minimization), where lower costs are preferred; C 2 : quality (maximization): superior quality is appreciated; C 3 : delivery time (minimization): It is preferable to have faster delivery times, where the weight vector for the criteria is defined as ϵ = [ 0.4 0.4 0.2 ] . To apply the first algorithm:
1.
We obtain the B pqr SF evaluation matrix D ¨ = ( s ¨ i j ) in Table 2.
2.
The weight vector for the criteria above is ϵ = [ 0.4 0.4 0.2 ] .
3.
In this step, normalizing is needed as criteria are not on the same scale; in order to normalize them, we use step (3) in Definition 8. Criteria C 1 and C 3 need to be normalized by using Equation (6), as shown in Table 3.
4.
We calculate the weighted normalized B pqr SF decision matrix values by using Equation (7), where p = 3 , q = 4 , and r = 5 , as obtained in Table 4.
5.
The B pqr SFPIS and B pqr SFNIS are computed in Table 5:
6.
The Euclidean distances of alternatives τ ¨ i for ( i = 1 , 2 , , n ) from the bipolar pqr-spherical fuzzy +ve and −ve ideal solutions are calculated from Equations (8) and (9), respectively, in Table 6.
7.
The relative closeness degree of the corresponding alternative to the bipolar pqr-spherical fuzzy +ve ideal solution, denoted by ϖ i for i = 1 , 2 , , n , is computed by Formula (10), which is shown in Table 7 and Figure 2.
8.
The alternatives are ranked based on their final scores (relative closeness values) as follows:
τ ¨ 3 > τ ¨ 4 > τ ¨ 1 > τ ¨ 2 .
Therefore, τ ¨ 3 is the best supply to be selected.
To apply the second algorithm to the same numerical example used for the first algorithm:
1.
We obtain the B pqr SF evaluation matrix D ¨ = ( τ ¨ i j ) , as in Table 2.
2.
The weight vector for criteria is ϵ = [ 0.4 0.4 0.2 ] .
3.
Normalizing, in this step, is needed, as criteria are not on the same scale; and in order to normalize them, we use step 3 in Definition 8. Criteria C 1 and C 3 need to be normalized by using Equation (6), as shown in Table 3.
4.
In order to aggregate the information presented in Table 3, we calculate the B pqr SFWA operator or the B pqr SFG operator, computed via s ¨ i as shown below:
s ¨ 1 = B p q r S F W A ( s ¨ 11 , s ¨ 12 , s ¨ 13 ) = { 0.3548 , 0.0525 , 0.1732 , 0.1097 , 0.0716 , 0.132 } s ¨ 2 = B p q r S F W A ( s ¨ 21 , s ¨ 22 , s ¨ 23 ) = { 0.3877 , 0.0798 , 0.2072 , 0.0621 , 0.1274 , 0.0745 } s ¨ 3 = B p q r S F W A ( s ¨ 31 , s ¨ 32 , s ¨ 33 ) = { 0.3655 , 0.0246 , 0.397 , 0.2698 , 0.0008 , 0.0352 } s ¨ 4 = B p q r S F W A ( s ¨ 41 , s ¨ 42 , s ¨ 43 ) = { 0.5129 , 0.0765 , 0.139 , 0.2074 , 0.0039 , 0.2082 }
5.
Score values; the aggregated data are provided in Table 8.
6.
Based on the score values in Table 8, the ranking of alternative suppliers, as depicted in Figure 3, is as follows:
τ ¨ 4 > τ ¨ 2 > τ ¨ 1 > τ ¨ 3 .

7. Sensitivity Analysis

In this section, we performed a sensitivity analysis of the suggested approaches by varying the parameters p , q , and r. As a result, the B pqr SF TOPSIS procedure was divided into three situations. First, we set values to the parameters p = 3 , q = 4 , and r = 5 . Second, we swapped the values of p and r while keeping the value of q. Finally, we assigned a similar value to each parameter to analyze the performance of the proposed operators. Data from the preceding DM problem were gathered again using the processes outlined in the pqr-TOPSIS technique. Later, the relative closeness degrees for the alternatives were determined, and in all situations, τ ¨ 3 was found to be the best option and τ ¨ 2 to be the worst; see Table 9 and Figure 4.
In the second part of the analysis, we altered the parameters p , q , and r. As a consequence, the operation started with the parameters p = 3 , q = 4 , and r = 5 , in order to investigate the performance of the proposed operator. Data from the aforementioned DM problem were aggregated once more with the B pqr SFWA operator. The score function was then used to calculate the score values for the alternatives, which were ranked by τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 . Fixing q = 4 and switching p and r values yielded alternatives ranked as τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 (the rank of the final two options flips). This adjustment occurred when the value of q 5 . Table 10 and Figure 5 display the scores for different values of p , q , and r and show that τ ¨ 3 is always the best.

8. Comparative Analysis

This section of the paper provides a comparative analysis to ensure the stability of the suggested work. Before proceeding, it is recommended that you review Remark 1 in Section 3 and Table 1 to comprehend the superiority of the provided work. For example, if we set p = q = r = 2 , we can derive the BT-SF TOPSIS technique. In addition, if we remove the neutrality degree membership and set p = r , the q-ROF TOPSIS technique can be achieved. For additional study, we consider the numerical data in Table 9, Table 11, Table 12. We used our proposed approaches along with existing ones to the data supplied by the decision expert. The relative closeness of the alternatives suggests that τ ¨ 3 is the optimum alternative for all the previously described techniques, except in q-ROF TOPSIS, where q = 3 , 5 , 15 , τ ¨ 4 is optimal, whereas either τ ¨ 1 or τ ¨ 2 is ranked last; see Figure 4, Figure 6, Figure 7.
For the second method, Remark 1 in Section 3 justifies that different existing aggregation operators (in the contexts of IFSs, PyFSs, FFSs, q-ROFSs, mn-ROFSs, PFSs, SFSs, T-SFSs, pqr-FSs, BIFSs, BPyFSs, FBFSs, Bq-ROFSs, Bmn-ROFSs, BPFSs, SBFSs, and BT-SFSs) can be deduced from the Bpqr-SFWA operator. The aggregated results presented in Table 10, Table 13, Table 14, Table 15, Table 16, Table 17 and Table 18 suggest that τ ¨ 4 is the best alternative to be selected in almost all the operators except in the T-SF-weighted average (T-SFWA) and BTSF-weighted average (BTSFWA) operators for q = 1 , where τ ¨ 2 is the best. The good news is that the score values generated by the proposed operators for various values of p , q , and r demonstrate that the results almost match their findings, implying the proposed work’s stability. Figure 5, Figure 8, Figure 9, Figure 10, Figure 11, Figure 12 and Figure 13 show how the prospective operators’ score values compare to those of existing operators. This demonstrates that the proposed operator yields stable mathematical conclusions and can be utilized in place of existing operators in the context of Bpqr-SFSNs, and any extensions that may be derived from them. For some additional details, see the comparison in Table 19.

9. Conclusions

In this work, we define a new notion, named bipolar pqr-spherical fuzzy sets ( B pqr SFS), which is a combination of bipolar fuzzy sets and pqr-spherical fuzzy sets. Then, we investigate some basic properties of B pqr FSs, including the basic operational laws, complement operation, union operation, and intersection operation. This new framework allows for a more nuanced representation of uncertainty by accounting for different degrees of membership, non-membership, and neutrality, in addition to bipolarity. This adaptability of bipolar pqr-SFS has proven to be immensely valuable in intricate decision-making processes that involve evaluating both affirmative and adverse perceptions. Its utility in multi-criteria group decision-making problems has been demonstrated, and it has been shown that this framework is well-suited for capturing the complexities of bipolar judgmental reasoning during the decision-making process. This has been conducted by using two algorithms—the first one is referred to as the `technique for order of preference by similarity to ideal solution’ (TOPSIS) and the second one involves using the proposed operators themselves in the B pqr SF context, as well as providing a numerical example, which demonstrates the usefulness of the proposed set. Targeted applications were developed in the multi-criteria decision-making field to address problems in the B pqr SF environment using the two aforementioned aggregation operators. Additionally, a comparative study was used to show the applicability and viability of the proposed approach.
Future works will be applied with more decision-making methods, like VIKOR. In addition, a few other aggregation operators can be introduced to enhance the existing approaches owing to the generation of a more precise ranking outcome.

Author Contributions

Conceptualization, Z.A.A. and H.F.M.S.; methodology, Z.A.A., H.F.M.S. and B.A.A.; formal analysis, Z.A.A., H.F.M.S., A.I.A. and R.A.M.; investigation, H.F.M.S., A.I.A., R.A.M. and B.A.A.; writing—original draft preparation, Z.A.A. and H.F.M.S.; writing—review and editing, Z.A.A., H.F.M.S., A.I.A. and R.A.M.; funding acquisition, A.I.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding authors.

Acknowledgments

The researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for the financial support (QU-APC-2025).

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proof

Proof of proposition 1. 
We shall only prove the first statement; the others are straightforward to conclude.
(1) Suppose τ ¨ ˜ ¨ and ¨ ˜ ¨ . Therefore, θ τ ¨ + θ ¨ + , η τ ¨ + η ¨ + , λ τ ¨ + λ ¨ + , θ τ ¨ θ ¨ , η τ ¨ η ¨ , λ τ ¨ λ ¨ , and θ ¨ + θ ¨ + , η ¨ + η ¨ + , λ ¨ + λ ¨ + , θ ¨ θ ¨ , η ¨ η ¨ , and λ ¨ λ ¨ . Now, we have the following:
θ τ ¨ + θ ¨ + and θ ¨ + θ ¨ + θ τ ¨ + θ ¨ + , η τ ¨ + η ¨ + and η ¨ + η ¨ + η τ ¨ + η ¨ + , λ τ ¨ + λ ¨ + and λ ¨ + λ ¨ + λ τ ¨ + λ ¨ + , θ τ ¨ θ ¨ and θ ¨ θ ¨ θ τ ¨ θ ¨ , η τ ¨ η ¨ and η ¨ η ¨ η τ ¨ η ¨ , λ τ ¨ λ ¨ and λ ¨ λ ¨ λ τ ¨ λ ¨ .
Summing up all of the implications above yields τ ¨ ˜ ¨ . □
Proof of proposition 2. 
(1) Starting from LHS, we have the following:
( τ ¨ ˜ ¨ ) c = min ( θ τ ¨ + , θ ¨ + ) , min ( η τ ¨ + , η ¨ + ) , max ( λ τ ¨ + , λ ¨ + ) , max ( θ τ ¨ , θ ¨ ) , max ( η τ ¨ , η ¨ ) , min ( λ τ ¨ , λ ¨ ) c = max ( λ τ ¨ + , λ ¨ + ) , min ( η τ ¨ + , η ¨ + ) , min ( θ τ ¨ + , θ ¨ + ) , min ( λ τ ¨ , λ ¨ ) , max ( η τ ¨ , η ¨ ) , max ( θ τ ¨ , θ ¨ ) = τ ¨ c ˜ ¨ c .
The other parts are similar. □
Proof of Theorem 2. 
We prove that 1 and 3, and the proofs of 2 and 4 are similar, respectively. To prove 1, consider two B pqr SFSs, τ ¨ 1 and τ ¨ 2 and ϵ > 0 ,
ϵ · ( τ ¨ 1 τ ¨ 2 ) = ( 1 1 ( θ τ ¨ 1 + ) 2 p + ( θ τ ¨ 2 + ) 2 p ( θ τ ¨ 1 + ) 2 p ( θ τ ¨ 2 + ) 2 p ϵ 2 p , ( η τ ¨ 1 + · η τ ¨ 2 + ) ϵ , ( λ τ ¨ 1 + · λ τ ¨ 2 + ) ϵ , ( θ τ ¨ 1 · θ τ ¨ 2 ) ϵ , 1 1 ( η τ ¨ 1 ) 2 q ( η τ ¨ 2 ) 2 q + ( η τ ¨ 1 ) 2 q ( η τ ¨ 2 ) 2 q ϵ 2 q , 1 1 ( λ τ ¨ 1 ) 2 p ( λ τ ¨ 2 ) 2 p + ( λ τ ¨ 1 ) 2 p ( λ τ ¨ 2 ) 2 p ϵ 2 r )
= ( 1 1 ( θ τ ¨ 1 + ) 2 p ϵ · 1 ( θ τ ¨ 2 + ) 2 p ϵ 2 p , ( η τ ¨ 1 + ) ϵ · ( η τ ¨ 2 + ) ϵ , ( λ τ ¨ 1 + ) ϵ · ( λ τ ¨ 2 + ) ϵ , ( θ τ ¨ 1 ) ϵ · ( θ τ ¨ 2 ) ϵ , 1 1 ( η τ ¨ 1 ) 2 q ϵ · 1 ( η τ ¨ 2 ) 2 q ϵ 2 q , 1 1 ( λ τ ¨ 1 ) 2 r ϵ · 1 ( λ τ ¨ 2 ) 2 r ϵ 2 r ) = ( 1 ( 1 ( θ τ ¨ 1 + ) 2 p ) ϵ 2 p , ( η τ ¨ 1 + ) ϵ , ( λ τ ¨ 1 + ) ϵ , ( θ τ ¨ 1 ) ϵ , 1 ( 1 ( η τ ¨ 1 ) 2 q ) ϵ 2 q , 1 ( 1 ( λ τ ¨ 1 ) 2 r ) ϵ 2 r ) ( 1 ( 1 ( θ τ ¨ 2 + ) 2 p ) ϵ 2 p , ( η τ ¨ 2 + ) ϵ , ( λ τ ¨ 2 + ) ϵ , ( θ τ ¨ 2 ) ϵ , 1 ( 1 ( η τ ¨ 2 ) 2 q ) ϵ 2 q , 1 ( 1 ( λ τ ¨ 2 ) 2 r ) ϵ 2 r ) = ϵ · τ ¨ 1 ϵ · τ ¨ 2 .
To prove 3, for τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) and ϵ 1 , ϵ 2 > 0 ,
τ ¨ ϵ 1 + ϵ 2 = ( ( θ τ ¨ + ) ϵ 1 + ϵ 2 , 1 ( 1 ( η τ ¨ + ) 2 q ) ϵ 1 + ϵ 2 2 q , 1 ( 1 ( λ τ ¨ + ) 2 r ) ϵ 1 + ϵ 2 2 r , 1 ( 1 ( θ τ ¨ ) 2 p ) ϵ 1 + ϵ 2 2 p , ( η τ ¨ ) ϵ 1 + ϵ 2 , ( λ τ ¨ ) ϵ 1 + ϵ 2 ) = ( ( θ τ ¨ + ) ϵ 1 , 1 ( 1 ( η τ ¨ + ) 2 q ) ϵ 1 2 q , 1 ( 1 ( λ τ ¨ + ) 2 r ) ϵ 1 2 r , 1 ( 1 ( θ τ ¨ ) 2 p ) ϵ 1 2 p , ( η τ ¨ ) ϵ 1 , ( λ τ ¨ ) ϵ 1 ) ( ( θ τ ¨ + ) ϵ 2 , 1 ( 1 ( η τ ¨ + ) 2 q ) ϵ 2 2 q , 1 ( 1 ( λ τ ¨ + ) 2 r ) ϵ 2 2 r , 1 ( 1 ( θ τ ¨ ) 2 p ) ϵ 2 2 p , ( η τ ¨ ) ϵ 2 , ( λ τ ¨ ) ϵ 2 ) . = τ ¨ ϵ 1 τ ¨ ϵ 2 .
Proof of Theorem 3. 
Equation (2) is verified by using the principle of mathematical induction. For l = 2 , we have the following:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 ) = ϵ 1 · τ ¨ 1 ϵ 2 · τ ¨ 2 = ( 1 1 ( θ τ ¨ 1 + ) 2 p ϵ 1 · 1 ( θ τ ¨ 2 + ) 2 p ϵ 2 2 p , ( η τ ¨ 1 + ) ϵ 1 · ( η τ ¨ 2 + ) ϵ 2 , ( λ τ ¨ 1 + ) ϵ 1 · ( λ τ ¨ 2 + ) ϵ 2 , ( θ τ ¨ 1 ) ϵ 1 · ( θ τ ¨ 2 ) ϵ 2 , 1 1 ( η τ ¨ 1 ) 2 q ϵ 1 · 1 ( η τ ¨ 2 ) 2 q ϵ 2 2 q , 1 1 ( λ τ ¨ 1 ) 2 r ϵ 1 · 1 ( λ τ ¨ 2 ) 2 r ϵ 2 2 r ) = ( 1 j = 1 2 ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p , j = 1 2 ( η τ ¨ j + ) ϵ j , j = 1 2 ( λ τ ¨ j + ) ϵ j , j = 1 2 ( θ τ ¨ ) ϵ j , 1 j = 1 2 ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q , 1 j = 1 2 ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r ) .
Hence, for j = 2 , the conclusion is true.
Now, it is assumed that the result is true for j = m , i . e . ,
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = j = 1 m ϵ j · τ ¨ j = ( 1 j = 1 m ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p , j = 1 m ( η τ ¨ j + ) ϵ j , j = 1 m ( λ τ ¨ j + ) ϵ j , j = 1 m ( θ τ ¨ j ) ϵ j , 1 j = 1 m ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q , 1 j = 1 m ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r ) .
We now show that the result is true for l = m + 1 :
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ q + 1 ) = j = 1 m + 1 ϵ j · τ ¨ j = j = 1 m ϵ j · τ ¨ j ϵ k + 1 · τ ¨ k + 1 = ( 1 j = 1 m ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p , j = 1 m ( η τ ¨ j + ) ϵ j , j = 1 m ( λ τ ¨ j + ) ϵ j , j = 1 m ( θ τ ¨ j ) ϵ j , 1 j = 1 m ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q , 1 j = 1 m ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r ) ( 1 ( 1 ( θ τ ¨ m + 1 + ) 2 p ) ϵ m + 1 2 p , ( η τ ¨ m + 1 + ) ϵ m + 1 , ( λ τ ¨ m + 1 + ) ϵ m + 1 ,
( θ τ ¨ m + 1 ) ϵ m + 1 , 1 ( 1 ( η τ ¨ m + 1 ) 2 q ) ϵ m + 1 2 q , 1 ( 1 ( λ τ ¨ m + 1 ) 2 r ) ϵ m + 1 2 r ) = ( 1 j = 1 m + 1 ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p , j = 1 m + 1 ( η τ ¨ j + ) ϵ j , j = 1 m + 1 ( λ τ ¨ j + ) ϵ j , j = 1 m + 1 ( θ τ ¨ j ) ϵ j , 1 j = 1 m + 1 ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q , 1 j = 1 m + 1 ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r ) .
Therefore, for l = m + 1 , the statement is true. Thus, (2) is guaranteed to hold true for all natural numbers through the process of mathematical induction. □
Proof of Theorem 4. 
By assumption, for each j, τ ¨ j = τ ¨ = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) , so we have the following:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = ( 1 j = 1 l ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p , j = 1 l ( η τ ¨ j + ) ϵ j , j = 1 l ( λ τ ¨ j + ) ϵ j , j = 1 l ( θ τ ¨ j ) ϵ j , 1 j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q , 1 j = 1 l ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r ) = ( 1 ( 1 ( θ τ ¨ + ) 2 p ) j = 1 l ϵ j 2 p , ( η τ ¨ + ) j = 1 l ϵ j , ( λ τ ¨ + ) j = 1 l ϵ j , ( θ τ ¨ ) j = 1 l ϵ j , 1 ( 1 ( η τ ¨ ) 2 q ) j = 1 l ϵ j 2 q , 1 ( 1 ( λ τ ¨ ) 2 r ) j = 1 l ϵ j 2 r ) .
Since j = 1 l ϵ j = 1 , we have the following:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) = ( 1 ( 1 ( θ τ ¨ + ) 2 p ) 2 p , η τ ¨ + , λ τ ¨ + , θ τ ¨ , 1 ( 1 ( η τ ¨ ) 2 q ) 2 q , 1 ( 1 ( λ τ ¨ ) 2 r ) 2 r ) = ( θ τ ¨ + , η τ ¨ + , λ τ ¨ + , θ τ ¨ , η τ ¨ , λ τ ¨ ) = τ ¨ .
Proof of Theorem 5. 
Let τ ¨ j = ( θ τ ¨ j + , η τ ¨ j + , λ τ ¨ j + , θ τ ¨ j , η τ ¨ j , λ τ ¨ j ) and ¨ j = ( θ ¨ j + , η ¨ j + , λ ¨ j + , θ ¨ j , η ¨ j , λ ¨ j ) be two B pqr SFNs. Since τ ¨ j ¨ j , then j = 1 , 2 , , l ,
( θ τ ¨ j + ) 2 p ( θ ¨ j + ) 2 p ( 1 ( θ τ ¨ j + ) 2 p ) ( 1 ( θ ¨ j + ) 2 p ) j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j j = 1 l 1 ( θ ¨ j + ) 2 p ϵ j 1 j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j 1 j = 1 l 1 ( θ ¨ j + ) 2 p ϵ j 1 j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j 2 p 1 j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j 2 p .
This fulfills the inequality for the initial components of τ ¨ and ¨ . We use the same method for every other component.
Since j = 1 , 2 , , l ,
( η τ ¨ j + ) ( η ¨ j + ) j = 1 l ( η τ ¨ j + ) ϵ j j = 1 l ( η ¨ j + ) ϵ j .
Since j = 1 , 2 , , l ,
( λ τ ¨ j + ) ( λ ¨ j + ) j = 1 l ( λ τ ¨ j + ) ϵ j j = 1 l ( λ ¨ j + ) ϵ j .
Since τ ¨ j ¨ j , then j = 1 , 2 , , l ,
( θ τ ¨ j ) ( θ ¨ j ) ( θ τ ¨ j ) ( θ ¨ j ) j = 1 l ( θ τ ¨ j ) ϵ j j = 1 l ( θ ¨ j ) ϵ j j = 1 l ( θ τ ¨ j ) ϵ j j = 1 l ( θ ¨ j ) ϵ j .
Since j = 1 , 2 , , l , we have the following:
( η τ ¨ j ) 2 q ( η ¨ j ) 2 q j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j j = 1 l ( 1 ( η ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( η ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q 1 j = 1 l ( 1 ( η ¨ j ) 2 q ) ϵ j 2 q .
Since j = 1 , 2 , , l , we have the following:
( λ τ ¨ j ) 2 q ( λ ¨ j ) 2 q j = 1 l ( 1 ( λ τ ¨ j ) 2 q ) ϵ j j = 1 l ( 1 ( λ ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( λ τ ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( λ ¨ j ) 2 q ) ϵ j 1 j = 1 l ( 1 ( λ τ ¨ j ) 2 q ) ϵ j 2 q 1 j = 1 l ( 1 ( λ ¨ j ) 2 q ) ϵ j 2 q .
Based on the analysis above, we have the following:
B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) B p q r S F W A ( ¨ 1 , ¨ 2 , , ¨ l ) .
Proof of Theorem 6. 
For the first component ( θ τ ¨ j + ) for ( j = 1 , 2 , , l ) , if θ m = min 1 j l { ( θ τ ¨ j + ) } and θ M = max 1 j l { ( θ τ ¨ j + ) } , and notice that j = 1 l ϵ j = 1 , we have the following:
( θ m ) 2 p ( θ τ ¨ j + ) 2 p ( θ M ) 2 p j = 1 l ( 1 ( θ m ) 2 p ) ϵ j j = 1 l ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j j = 1 l ( 1 ( θ M ) 2 p ) ϵ j 1 j = 1 l ( 1 ( θ m ) 2 p ) ϵ j 2 p j = 1 l ( 1 ( θ τ ¨ j + ) 2 p ) ϵ j 2 p 1 j = 1 l ( 1 ( θ M ) 2 p ) ϵ j 2 p 1 1 ( θ m ) 2 p j = 1 l ϵ j 2 p j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j 2 p 1 1 ( θ M ) 2 p j = 1 l ϵ j 2 p θ m j = 1 l 1 ( θ τ ¨ j + ) 2 p ϵ j 2 p θ M ,
which satisfies the inequality for the first component of B pqr SFWA ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) .
We now apply this process to the remaining components. If η m = min 1 j l { η τ ¨ j + } and η M = max 1 j l { η τ ¨ j + } , then we have the following:
η m η τ ¨ j + η M j = 1 l ( η m ) ϵ j j = 1 l ( η τ ¨ j + ) ϵ j j = 1 l ( η M ) ϵ j ( η m ) j = 1 l ϵ j j = 1 l ( η τ ¨ j + ) ϵ j ( η M ) j = 1 l ϵ j
η m j = 1 l ( η τ ¨ j + ) ϵ j η M .
If λ m = min 1 j l { λ τ ¨ j + } and λ M = max 1 j l { λ τ ¨ j + } , then we have the following:
λ m λ τ ¨ j + λ M j = 1 l ( λ m ) ϵ j j = 1 l ( λ τ ¨ j + ) ϵ j j = 1 l ( λ M ) ϵ j λ m j = 1 l ( λ τ ¨ j + ) ϵ j λ M .
If θ m = min 1 j l { θ τ ¨ j } and θ M = max 1 j l { θ τ ¨ j } , then we have the following:
θ m θ τ ¨ j θ M j = 1 l ( θ m ) ϵ j j = 1 l ( θ τ ¨ j ) ϵ j j = 1 l ( θ M ) ϵ j ( θ m ) j = 1 l ϵ j j = 1 l ( θ τ ¨ j ) ϵ j ( θ M ) j = 1 l ϵ j θ m j = 1 l ( θ τ ¨ j ) ϵ j θ M .
If η m = min 1 j l { ( η τ ¨ j ) } and η M = max 1 j l { ( η τ ¨ j ) } , we have the following:
1 j = 1 l 1 ( η m ) 2 q ϵ j 2 q j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q 1 j = 1 l ( 1 ( η M ) 2 q ) ϵ j 2 q 1 1 ( η m ) 2 q j = 1 l ϵ j 2 q j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q 1 1 ( η M ) 2 q j = 1 l ϵ j 2 q η m j = 1 l ( 1 ( η τ ¨ j ) 2 q ) ϵ j 2 q η M .
If λ m = min 1 j l { ( λ τ ¨ j ) } and λ M = max 1 j l { ( λ τ ¨ j ) } , we have the following:
1 j = 1 l 1 ( λ m ) 2 r ϵ j 2 r j = 1 l ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r 1 j = 1 l ( 1 ( λ M ) 2 r ) ϵ j 2 r 1 1 ( λ m ) 2 r j = 1 l ϵ j 2 r j = 1 l ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r 1 1 ( λ M ) 2 r j = 1 l ϵ j 2 r λ m j = 1 l ( 1 ( λ τ ¨ j ) 2 r ) ϵ j 2 r λ M .
From the above investigation, by satisfying inequality 3 for all components of τ ¨ j for j = 1 , 2 , , l , we obtain the following:
min j = 1 , 2 , , l { τ ¨ j } B p q r S F W A ( τ ¨ 1 , τ ¨ 2 , , τ ¨ l ) max j = 1 , 2 , , l { τ ¨ j } .

References

  1. Zadeh, L. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar]
  3. 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; IEEE: Piscataway, NJ, USA, 2013; pp. 57–61. [Google Scholar]
  4. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  5. Dounis, A.; Stefopoulos, A. Intelligent Medical Diagnosis Reasoning Using Composite Fuzzy Relation, Aggregation Operators and Similarity Measure of q-Rung Orthopair Fuzzy Sets. Appl. Sci. 2023, 13, 12553. [Google Scholar] [CrossRef]
  6. Seikh, M.R.; Mandal, U. Multiple attribute group decision making based on quasirung orthopair fuzzy sets: Application to electric vehicle charging station site selection problem. Eng. Appl. Artif. Intell. 2022, 115, 105299. [Google Scholar] [CrossRef]
  7. Ibrahim, H.Z.; Alshammari, I. n,m-Rung orthopair fuzzy sets with applications to multicriteria decision making. IEEE Access 2022, 10, 99562–99572. [Google Scholar]
  8. Cuong, B.C.; Kreinovich, V. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  9. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar]
  10. Kutlu Gündoğdu, F.; Kahraman, C. Spherical fuzzy sets and spherical fuzzy TOPSIS method. J. Intell. Fuzzy Syst. 2019, 36, 337–352. [Google Scholar]
  11. Ullah, K.; Garg, H.; Mahmood, T.; Jan, N.; Ali, Z. Correlation coefficients for T-spherical fuzzy sets and their applications in clustering and multi-attribute decision making. Soft Comput. 2020, 24, 1647–1659. [Google Scholar]
  12. Ali, J.; Naeem, M. r,s,t-spherical fuzzy VIKOR method and its application in multiple criteria group decision making. IEEE Access 2023, 11, 46454–46475. [Google Scholar] [CrossRef]
  13. Rahim, M.; Amin, F.; Tag Eldin, E.M.; Khalifa, A.E.W.; Ahmad, S. p,q-Spherical fuzzy sets and their aggregation operators with application to third-party logistic provider selection. J. Intell. Fuzzy Syst. 2024, 46, 505–528. [Google Scholar] [CrossRef]
  14. Rahim, M.; Ahmad, S.; Bajri, S.A.; Alharbi, R.; Khalifa, H.A.E.W. Confidence Levels-Based p,q,r–Spherical Fuzzy Aggregation Operators and Their Application in Selection of Solar Panels. IEEE Access 2024, 12, 57863–57878. [Google Scholar] [CrossRef]
  15. Kang, L.; Khan, S.; Rahim, M.; Shah, K.; Abdeljawad, T. Development p,q,r–Spherical Fuzzy Einstein Aggregation Operators: Application in Decision-Making in Logo Design. IEEE Access 2024, 12, 68393–68409. [Google Scholar] [CrossRef]
  16. Karaaslan, F.; Karamaz, F. Interval-valued (p,q,r)-spherical fuzzy sets and their applications in MCGDM and MCDM based on TOPSIS method and aggregation operators. Expert Syst. Appl. 2024, 255, 124575. [Google Scholar] [CrossRef]
  17. Ezhilmaran, D.; Sankar, K. Morphism of bipolar intuitionistic fuzzy graphs. J. Discret. Math. Sci. Cryptogr. 2015, 18, 605–621. [Google Scholar] [CrossRef]
  18. Mohana, K.; Jansi, R. Bipolar Pythagorean fuzzy sets and their application based on multi-criteria decision-making problems. Int. J. Res. Advent Technol. 2018, 6, 3754–3764. [Google Scholar]
  19. Palanikumar, M.; Iampan, A. Novel approach to decision making based on type-II generalized fermatean bipolar fuzzy soft sets. Int. J. Innov. Comput. Inf. Control 2022, 18, 769–781. [Google Scholar]
  20. Li, J.; Yüksel, S.; Dınçer, H.; Mikhaylov, A.; Barykin, S.E. Bipolar q-ROF hybrid decision making model with golden cut for analyzing the levelized cost of renewable energy alternatives. IEEE Access 2022, 10, 42507–42517. [Google Scholar] [CrossRef]
  21. Ibrahim, H.Z. Multi-attribute group decision-making based on bipolar n,m-rung orthopair fuzzy sets. Granul. Comput. 2023, 8, 1819–1836. [Google Scholar] [CrossRef]
  22. Princy, R.; Mohana, K. Spherical bipolar fuzzy sets and its application in multi criteria decision making problem. J. New Theory 2019, 32, 58–70. [Google Scholar]
  23. Wang, H.; Saad, M.; Karamti, H.; Garg, H.; Rafiq, A. An Approach Toward Pattern Recognition and Decision-Making Using the Concept of Bipolar T-Spherical Fuzzy Sets. Int. J. Fuzzy Syst. 2023, 25, 2649–2664. [Google Scholar] [CrossRef]
  24. Riaz, M.; Garg, H.; Athar Farid, H.M.; Chinram, R. Multi-criteria decision making based on bipolar picture fuzzy operators and new distance measures. Comput. Model. Eng. Sci. 2021, 127, 771–800. [Google Scholar]
  25. 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]
  26. Senapati, T.; Yager, R.R. Fermatean fuzzy sets. J. Ambient Intell. Humaniz. Comput. 2020, 11, 663–674. [Google Scholar]
  27. Hwang, C.L.; Yoon, K. Methods for multiple attribute decision making. In Multiple Attribute Decision Making: Methods and Applications A State-of-the-Art Survey; Springer: Berlin/Heidelberg, Germany, 1981; Volume 186, pp. 58–191. [Google Scholar]
  28. Yoon, K. A reconciliation among discrete compromise solutions. J. Oper. Res. Soc. 1987, 38, 277–286. [Google Scholar]
  29. Hwang, C.L.; Lai, Y.J.; Liu, T.Y. A new approach for multiple objective decision making. Comput. Oper. Res. 1993, 20, 889–899. [Google Scholar]
  30. El Alaoui, M. Fuzzy TOPSIS: Logic, Approaches, and Case Studies; CRC Press: Boca Raton, FL, USA, 2021. [Google Scholar]
  31. Maldonado-Macías, A.; Alvarado, A.; García, J.L.; Balderrama, C.O. Intuitionistic fuzzy TOPSIS for ergonomic compatibility evaluation of advanced manufacturing technology. Int. J. Adv. Manuf. Technol. 2014, 70, 2283–2292. [Google Scholar]
  32. Junior, F.R.L.; Osiro, L.; Carpinetti, L.C.R. A comparison between Fuzzy AHP and Fuzzy TOPSIS methods to supplier selection. Appl. Soft Comput. 2014, 21, 194–209. [Google Scholar]
  33. Yilmaz, I.; Ecemis Yilmaz, H.K. A consensus framework for evaluating dispute resolution alternatives in international law using an interval-valued type-2 fuzzy TOPSIS approach. Appl. Sci. 2024, 14, 11046. [Google Scholar] [CrossRef]
  34. Jin, J.; Zhao, P.; You, T. Picture fuzzy TOPSIS method based on CPFRS model: An application to risk management problems. Sci. Program. 2021, 2021, 6628745. [Google Scholar] [CrossRef]
  35. Akram, M.; Shumaiza; Arshad, M. Bipolar fuzzy TOPSIS and bipolar fuzzy ELECTRE-I methods to diagnosis. Comput. Appl. Math. 2020, 39, 1–21. [Google Scholar] [CrossRef]
  36. Calvo, T.; Mayor, G.; Mesiar, R. Aggregation operators, Studies Fuzziness Soft Computing 97. Phys. Heidelb. 2002. [Google Scholar]
  37. Grabisch, M.; Marichal, J.L.; Mesiar, R.; Pap, E. Aggregation Functions, Cambridge University Press. In Proceedings of the 2008 6th International Symposium on Intelligent Systems and Informatics, Subotica, Serbia, 26–27 September 2008; IEEE: Piscataway, NJ, USA, 2008; pp. 1–7. [Google Scholar]
  38. Yager, R.R.; Kacprzyk, J. The Ordered Weighted Averaging Operators: Theory and Applications; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
  39. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  40. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  41. 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]
  42. Garg, H.; Ullah, K.; Mahmood, T.; Hassan, N.; Jan, N. T-spherical fuzzy power aggregation operators and their applications in multi-attribute decision making. J. Ambient Intell. Humaniz. Comput. 2021, 12, 9067–9080. [Google Scholar] [CrossRef]
  43. Akram, M.; Dudek, W.A.; Ilyas, M.F. Group decision making based on Pythagorean fuzzy TOPSIS method. Int. J. Intell. Syst. 2019, 34, 1455–1475. [Google Scholar] [CrossRef]
  44. Gul, M.; Lo, H.W.; Yucesan, M. Fermatean fuzzy TOPSIS-based approach for occupational risk assessment in manufacturing. Complex Intell. Syst. 2021, 7, 2635–2653. [Google Scholar] [CrossRef]
  45. Pınar, A.; Rouyendegh, B.D.; Özdemir, Y.S. q-Rung orthopair fuzzy TOPSIS method for green supplier selection problem. Sustainability 2021, 13, 985. [Google Scholar] [CrossRef]
Figure 1. Using main variant structures to obtain B pqr SFSs from fuzzy sets.
Figure 1. Using main variant structures to obtain B pqr SFSs from fuzzy sets.
Applsci 15 03597 g001
Figure 2. Ranking scores.
Figure 2. Ranking scores.
Applsci 15 03597 g002
Figure 3. Ranking scores.
Figure 3. Ranking scores.
Applsci 15 03597 g003
Figure 4. B pqr SF TOPSIS ranking results for different values of p,q,r.
Figure 4. B pqr SF TOPSIS ranking results for different values of p,q,r.
Applsci 15 03597 g004
Figure 5. Ranking results of B pqr SFWA operators for different values of p,q,r.
Figure 5. Ranking results of B pqr SFWA operators for different values of p,q,r.
Applsci 15 03597 g005
Figure 6. q-ROFS TOPSIS ranking results, for q = 1,2,3,5,15.
Figure 6. q-ROFS TOPSIS ranking results, for q = 1,2,3,5,15.
Applsci 15 03597 g006
Figure 7. BT-SFS TOPSIS ranking results, for q = 1,2,3,5.
Figure 7. BT-SFS TOPSIS ranking results, for q = 1,2,3,5.
Applsci 15 03597 g007
Figure 8. Ranking results of pqr-SFWA operators for different values of p,q,r.
Figure 8. Ranking results of pqr-SFWA operators for different values of p,q,r.
Applsci 15 03597 g008
Figure 9. Ranking results of q-ROFWA operators for different values of p,q,r.
Figure 9. Ranking results of q-ROFWA operators for different values of p,q,r.
Applsci 15 03597 g009
Figure 10. Ranking results of Bq-ROFWA operators for different values of p,q,r.
Figure 10. Ranking results of Bq-ROFWA operators for different values of p,q,r.
Applsci 15 03597 g010
Figure 11. Ranking results of B n m -ROFWA operators for different values of m,n.
Figure 11. Ranking results of B n m -ROFWA operators for different values of m,n.
Applsci 15 03597 g011
Figure 12. Ranking results of T-SFWA operators for different values of q.
Figure 12. Ranking results of T-SFWA operators for different values of q.
Applsci 15 03597 g012
Figure 13. Ranking results of T-SFWA operators for different values of q.
Figure 13. Ranking results of T-SFWA operators for different values of q.
Applsci 15 03597 g013
Table 1. Superiority of the proposed model compared to existing ones.
Table 1. Superiority of the proposed model compared to existing ones.
ModelMDNMD¬MDFSDP *Bipolarity
FS [1]YesNoNoNoNo
IFS [2]YesNoYesNoNo
PyFS [3]YesNoYesNoNo
FFS [26]YesNoYesNoNo
q-ROFS [4]YesNoYesNoNo
mn-ROFS [7]YesNoYesYesNo
PFS [8]YesYesYesNoNo
SFS [9,25]YesYesYesNoNo
T-SFS [9]YesYesYesNoNo
pqr-SFS [12,13]YesYesYesYesNo
BIFS [17]YesNoYesNoYes
BPyFS [18]YesNoYesNoYes
FBFS [19]YesNoYesNoYes
Bmn-ROFS [21]YesNoYesYesYes
BPFS [24]YesYesYesNoYes
SBFS [22]YesYesYesNoYes
BT-SFS [23]YesYesYesNoYes
ProposedYesYesYesYesYes
* FSDP means Flexibility in Selecting Different Parameters.
Table 2. B pqr SF evaluation matrix.
Table 2. B pqr SF evaluation matrix.
τ ¨ j Cost C 1 Quality C 2 Delivery Time C 3
τ ¨ 1 0.85 , 0.01 , 0.05 , 0.1 , 0.3 , 0.06 0.69 , 0.1 , 0.02 , 0.21 , 0.03 , 0.33 0.54 , 0.4 , 0.09 , 0.42 , 0.05 , 0.1
τ ¨ 2 0.79 , 0.03 , 0.08 , 0.2 , 0.4 , 0.02 0.72 , 0.2 , 0.03 , 0.17 , 0.1 , 0.065 0.68 , 0.09 , 0.21 , 0.32 , 0.23 , 0.08
τ ¨ 3 0.83 , 0.01 , 0.05 , 0.13 , 0.03 , 0.3 0.7 , 0.03 , 0.14 , 0.21 , 0.02 , 0.11 0.73 , 0.1 , 0.17 , 0.22 , 0.03 , 0.36
τ ¨ 4 0.8 , 0.09 , 0.04 , 0.24 , 0.04 , 0.32 0.82 , 0.06 , 0.01 , 0.12 , 0.07 , 0.5 0.81 , 0.09 , 0.1 , 0.12 , 0.03 , 0.26
Table 3. Normalized B pqr SF evaluation matrix.
Table 3. Normalized B pqr SF evaluation matrix.
τ ¨ j Cost C 1 Quality C 2 Delivery Time C 3
τ ¨ 1 0.05 , 0.01 , 0.85 , 0.06 , 0.3 , 0.1 0.69 , 0.1 , 0.02 , 0.21 , 0.03 , 0.33 0.09 , 0.4 , 0.54 , 0.1 , 0.05 , 0.42
τ ¨ 2 0.08 , 0.03 , 0.79 , 0.02 , 0.4 , 0.2 0.72 , 0.2 , 0.03 , 0.17 , 0.1 , 0.065 0.21 , 0.09 , 0.68 , 0.08 , 0.23 , 0.32
τ ¨ 3 0.05 , 0.01 , 0.83 , 0.3 , 0.03 , 0.13 0.7 , 0.03 , 0.14 , 0.21 , 0.02 , 0.11 0.17 , 0.1 , 0.73 , 0.36 , 0.03 , 0.22
τ ¨ 4 0.04 , 0.09 , 0.8 , 0.32 , 0.04 , 0.24 0.82 , 0.06 , 0.01 , 0.12 , 0.07 , 0.5 0.1 , 0.09 , 0.81 , 0.26 , 0.03 , 0.12
Table 4. Weighted normalized B pqr SF evaluation matrix.
Table 4. Weighted normalized B pqr SF evaluation matrix.
τ ¨ j Cost C1Quality C2Delivery Time C3
τ ¨ 1 {0.0018, 0.1585, 0.9524,
−0.3245,−0.0716, −0.0083}
{0.3548, 0.3981, 0.3092,
−0.5357,−0.0007, −0.0907}
{0.0047, 0.8326, 0.8841,
−0.631,−0.0017, −0.1279}
τ ¨ 2 {0.0047, 0.246, 0.9317,
−0.2091,−0.1272, −0.0333}
{0.3876, 0.5253, 0.3492,
−0.4922,−0.008, −0.0035}
{0.0258, 0.6178, 0.9258,
−0.6034,−0.0354, −0.0742}
τ ¨ 3 {0.0018, 0.1585, 0.9456,
−0.6178,−0.0007,−0.0141}
{0.3655, 0.246, 0.5544,
−0.5357,−0.0003,−0.0101}
{0.0169, 0.631, 0.939,
−0.8152,−0.0006,−0.0351}
τ ¨ 4 {0.0012, 0.3817, 0.9352,
−0.634,−0.0013, −0.048}
{0.5129, 0.3245, 0.2512,
−0.4282,−0.0039, −0.2082}
{0.0058, 0.6178, 0.9587,
−0.7638,−0.0006,−0.0104}
Table 5. BpqrSFPIS and BpqrSFNIS.
Table 5. BpqrSFPIS and BpqrSFNIS.
Ideal SolutionsCost C1Quality C2Delivery Time C3
BpqrSFPIS{0.0047, 0.1585, 0.91,
−0.634, −0.0007, −0.0083}
{0.5129, 0.246, 0.1585,
−0.5357, −0.0003, −0.0035}
{0.0258, 0.6178, 0.8841,
−0.8152, −0.0006, −0.0104}
BpqrSFNIS{0.0012, 0.1585, 0.9371,
−0.2091, −0.0007, −0.048}
{0.3548, 0.246, 0.4555,
−0.4282, −0.0003, −0.2082}
{0.0047, 0.6178, 0.9587,
−0.6034, −0.0006, −0.1279}
Table 6. The Euclidean distances of all alternatives with B pqr SFPIS and B pqr SFNIS, with the weighted normalized B pqr SF evaluation matrix.
Table 6. The Euclidean distances of all alternatives with B pqr SFPIS and B pqr SFNIS, with the weighted normalized B pqr SF evaluation matrix.
Alternatives D ¨ ( τ ¨ i , B pqr SFPIS ) D ¨ ( τ ¨ i , B pqr SFNIS )
τ ¨ 1 0.121 0.1036
τ ¨ 2 0.1043 0.0435
τ ¨ 3 0.052 0.0967
τ ¨ 4 0.0701 0.0841
Table 7. The relative closeness degrees.
Table 7. The relative closeness degrees.
Alternatives ϖ i
i = 1 0.4612
i = 2 0.2942
i = 3 0.6505
i = 4 0.5452
Table 8. The score values.
Table 8. The score values.
Alternatives scor ( τ ¨ i )
i = 1 0.605
i = 2 0.6205
i = 3 0.5996
i = 4 0.6793
Table 9. B pqr SF TOPSIS ranking results.
Table 9. B pqr SF TOPSIS ranking results.
B pqr SFS ϖ 1 ϖ 2 ϖ 3 ϖ 4 Ranking Results
p = 3 , q = 4 , r = 5 0.4540.29310.62150.5595 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2
p = 5 , q = 4 , r = 3 0.4630.34060.59090.5419 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2
p = 3 , q = 3 , r = 3 0.43890.32020.64680.6125 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2
Table 10. B pqr SFWA ranking results.
Table 10. B pqr SFWA ranking results.
B pqr SFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
p = 3 , q = 4 , r = 5 0.6050.62050.59960.6793 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
p = 5 , q = 4 , r = 3 0.54940.5610.54930.6193 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 4 , q = 5 , r = 3 0.57220.58590.57320.6468 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 3 , q = 3 , r = 3 0.60450.61940.59380.679 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
p = 2 , q = 4 , r = 6 0.65030.66990.62440.71 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
p = 3 , q = 5 , r = 7 0.6050.62060.6010.6792 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
p = 7 , q = 5 , r = 3 0.52340.53150.52440.5794 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 5 , q = 9 , r = 13 0.54960.56150.55270.6196 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 13 , q = 9 , r = 5 0.50250.50440.5030.524 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
Table 11. q-ROF TOPSIS ranking results.
Table 11. q-ROF TOPSIS ranking results.
q-ROFS ϖ 1 ϖ 2 ϖ 3 ϖ 4 Ranking Results
q = 1 ( I F S ) 0.16720.3090.72110.3239 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1
q = 2 ( P y F S ) 0.17490.30620.61760.5051 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1
q = 3 ( F F S ) 0.22130.38040.5620.6809 τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1
q = 5 0.25350.43170.60630.7735 τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1
q = 15 0.26360.38040.61810.7653 τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1
Table 12. BT-SF TOPSIS ranking results.
Table 12. BT-SF TOPSIS ranking results.
BT-SFS ϖ 1 ϖ 2 ϖ 3 ϖ 4 Ranking Results
q = 1 ( B P F S ) 0.4740.44380.65490.5778 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2
q = 2 ( B S F S ) 0.36610.42330.71350.6862 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1
q = 3 0.44060.30510.67760.5063 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2
q = 5 0.35570.500080.6590.6084 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1
Table 13. pqr-SFWA Ranking Results.
Table 13. pqr-SFWA Ranking Results.
pqr-SFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
p = 3 , q = 4 , r = 5 0.57370.58630.57380.6372 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 5 , q = 4 , r = 3 0.53070.53730.5070.5833 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
p = 2 , q = 4 , r = 6 0.61490.6310.61870.6809 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 3 , q = 5 , r = 7 0.57370.58650.57740.6373 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
p = 7 , q = 5 , r = 3 0.51310.51670.48840.5529 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
Table 14. Ranking results of q-ROFWA operators for different values of q.
Table 14. Ranking results of q-ROFWA operators for different values of q.
q-ROFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
q = 1 ( I F W A ) 0.2250.23830.01990.3759 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 2 ( P y F W A ) 0.19990.21910.08380.3424 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 3 ( F F W A ) 0.14220.16330.0930.2718 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 5 0.06560.08210.06110.1691 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 15 0.00150.00290.00190.0207 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
Table 15. Ranking results of B q -ROFWA operators.
Table 15. Ranking results of B q -ROFWA operators.
B q -ROFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
q = 1 ( B I F W A ) 0.19140.176−0.05440.2533 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
q = 2 ( B P y F W A ) 0.0940.0913−0.01830.1585 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
q = 3 ( B F F W A ) 0.03790.0424−0.00350.0818 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 5 0.00560.00870.00070.0201 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 15 0.0000240.0000030.000000520.0000005 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
Table 16. Ranking results of B n m ROFWA operators for different values of m,n.
Table 16. Ranking results of B n m ROFWA operators for different values of m,n.
B nm -ROFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
n = 1 , m = 2 0.17180.18960.00550.2102 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
n = 2 , m = 1 0.1560.1134−0.0440.2589 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
n = 3 , m = 7 0.07340.0890.06720.1343 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
n = 7 , m = 3 0.02760.0212−0.0130.0201 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
Table 17. Ranking results of T-SFWA operators for different values of q.
Table 17. Ranking results of T-SFWA operators for different values of q.
T-SFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
q = 1 ( P F W A ) −0.3743−0.254−0.4908−0.3733 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3
q = 2 ( S F W A ) −0.3678−0.2659−0.4548−0.3925 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3
q = 5 −0.2139−0.1521−0.2182−0.212 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3
q = 15 −0.2359−0.0124−0.0267−0.0227 τ ¨ 2 τ ¨ 4 τ ¨ 3 τ ¨ 1
Table 18. Ranking results of BT-SFWA for different values of q.
Table 18. Ranking results of BT-SFWA for different values of q.
BT-SFWA scor ( τ ¨ 1 ) scor ( τ ¨ 2 ) scor ( τ ¨ 3 ) scor ( τ ¨ 4 ) Ranking Results
q = 1 ( B P S F W A ) 0.5630.58540.46910.5755 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3
q = 2 ( B S F W A ) 0.54870.55890.54810.606 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 5 0.50490.50760.50570.5287 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
q = 15 0.5000030.500010.5000050.50052 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1
Table 19. A comparison between the proposed method and existing methods.
Table 19. A comparison between the proposed method and existing methods.
MethodParameter(s)Ranking ResultsOptimal Alternative
IFS TOPSIS [31]n/a τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
PyFS TOPSIS [43]n/a τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
FFS TOPSIS [44]n/a τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1 τ ¨ 4
q-ROF TOPSIS [45] q = 5 τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1 τ ¨ 4
q = 15 τ ¨ 4 τ ¨ 3 τ ¨ 2 τ ¨ 1 τ ¨ 4
BT-SFS TOPSIS [23] q = 1 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
q = 2 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
q = 3 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
q = 5 τ ¨ 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3
B pqr SF TOPSIS (proposed) p = 3 , q = 4 , r = 5 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
p = 5 , q = 4 , r = 3 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
p = 3 , q = 3 , r = 3 τ ¨ 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3
q-ROFWA [20] q = 1 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 2 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 5 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 15 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
T-SFWAO [42] q = 1 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3 τ ¨ 2
q = 2 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3 τ ¨ 2
q = 5 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3 τ ¨ 2
q = 15 τ ¨ 2 τ ¨ 4 τ ¨ 3 τ ¨ 1 τ ¨ 2
pqr-SFWAO [12] p = 3 , q = 4 , r = 5 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 5 , q = 4 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
p = 2 , q = 4 , r = 6 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 3 , q = 5 , r = 7 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 7 , q = 5 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
B q -ROFWAO [20] q = 1 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3 τ ¨ 4
q = 2 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3 τ ¨ 4
q = 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 5 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 15 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
B n m -ROFWAO [21] n = 1 , m = 2 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
n = 2 , m = 1 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3 τ ¨ 4
n = 3 , m = 7 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
n = 7 , m = 3 τ ¨ 4 τ ¨ 1 τ ¨ 2 τ ¨ 3 τ ¨ 4
BT-SFWA [23] q = 1 τ ¨ 2 τ ¨ 4 τ ¨ 1 τ ¨ 3 τ ¨ 2
q = 2 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
q = 5 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
q = 15 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
B pqr SFWAO (proposed) p = 3 , q = 4 , r = 5 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
p = 5 , q = 4 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 4 , q = 5 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 3 , q = 3 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
p = 2 , q = 4 , r = 6 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
p = 3 , q = 5 , r = 7 τ ¨ 4 τ ¨ 2 τ ¨ 1 τ ¨ 3 τ ¨ 4
p = 7 , q = 5 , r = 3 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 5 , q = 9 , r = 13 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
p = 13 , q = 9 , r = 5 τ ¨ 4 τ ¨ 2 τ ¨ 3 τ ¨ 1 τ ¨ 4
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ameen, Z.A.; Salih, H.F.M.; Alajlan, A.I.; Mohammed, R.A.; Asaad, B.A. Enhanced MCDM Based on the TOPSIS Technique and Aggregation Operators Under the Bipolar pqr-Spherical Fuzzy Environment: An Application in Firm Supplier Selection. Appl. Sci. 2025, 15, 3597. https://doi.org/10.3390/app15073597

AMA Style

Ameen ZA, Salih HFM, Alajlan AI, Mohammed RA, Asaad BA. Enhanced MCDM Based on the TOPSIS Technique and Aggregation Operators Under the Bipolar pqr-Spherical Fuzzy Environment: An Application in Firm Supplier Selection. Applied Sciences. 2025; 15(7):3597. https://doi.org/10.3390/app15073597

Chicago/Turabian Style

Ameen, Zanyar A., Hariwan Fadhil M. Salih, Amlak I. Alajlan, Ramadhan A. Mohammed, and Baravan A. Asaad. 2025. "Enhanced MCDM Based on the TOPSIS Technique and Aggregation Operators Under the Bipolar pqr-Spherical Fuzzy Environment: An Application in Firm Supplier Selection" Applied Sciences 15, no. 7: 3597. https://doi.org/10.3390/app15073597

APA Style

Ameen, Z. A., Salih, H. F. M., Alajlan, A. I., Mohammed, R. A., & Asaad, B. A. (2025). Enhanced MCDM Based on the TOPSIS Technique and Aggregation Operators Under the Bipolar pqr-Spherical Fuzzy Environment: An Application in Firm Supplier Selection. Applied Sciences, 15(7), 3597. https://doi.org/10.3390/app15073597

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