Next Article in Journal
Study of Unsymmetrical Magnetic Pulling Force and Magnetic Moment in 1000 MW Hydrogenerator Based on Finite Element Analysis
Previous Article in Journal
A New Fractional Curvature of Curves and Surfaces in Euclidean Space Using the Caputo’s Fractional Derivative
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Decision Analysis Algorithm Using Frank Aggregation in the SWARA Framework with p,qRung Orthopair Fuzzy Information

by
Jawad Ali
1,*,
Suhad Ali Osman Abdallah
2,* and
N. S. Abd EL-Gawaad
3
1
Institute of Numerical Sciences, Kohat University of Science and Technology, Kohat 26000, KPK, Pakistan
2
Applied College, Khamis Mushait, King Khalid University, Abha 62529, Saudi Arabia
3
Muhayil Asir, Applied College, King Khalid University, Abha 62529, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Symmetry 2024, 16(10), 1352; https://doi.org/10.3390/sym16101352
Submission received: 25 September 2024 / Revised: 5 October 2024 / Accepted: 10 October 2024 / Published: 12 October 2024
(This article belongs to the Section Engineering and Materials)

Abstract

:
The present study introduces an innovative approach to multi-criteria decision making (MCDM) aimed at handling decision analysis involving p,qrung orthopair fuzzy (p,qROF) data, where the criteria weights are completely unknown. To achieve this objective, we formulate generalized operational rules referred to as Frank operational rules, tailored for p,qROF numbers (p,qROFNs) utilizing the Frank t-norm and t-conorm. With these newly devised operations as a foundation, we create a variety of p,qROF aggregation operators (AOs) to effectively aggregate p,qROF information. Furthermore, we examine specific instances of these operators and rigorously establish their desirable properties, including idempotency, monotonicity, boundedness, and symmetry. Subsequently, we adapt the SWARA technique to the realm of p,qROF fuzzy data and this adapted technique becomes instrumental in determining criteria weights within the proposed MCDM framework centered around proposed AOs. We furnish a descriptive example to exemplify the practicality of the developed approach. Lastly, the effectiveness and soundness of our approach are underscored through both parameter analysis and a comparative evaluation.

1. Introduction

Multi-criteria decision making (MCDM) is a process that involves evaluating options or alternatives based on multiple criteria or attributes. This approach is widely used across various fields, such as business, engineering, green supplier management, construction development, and public policy. Decision experts (DEs) typically use precise numerical values to evaluate alternatives in accepted MCDM contexts. Cagri Tolga and Basar [1] applied theoretical concepts from MCDM to estimate the rates of population growth and food production resource increases under conditions of uncertainty. Tolga et al. [2] employed a more robust and effective evaluation strategy to select optimal medical devices for enhancement in the health sector, considering type-2 fuzzy environments. Additionally, due to limited data, insufficient information, and time constraints, property estimations—especially for subjective attributes—cannot always be represented by exact numbers. In such cases, fuzzy sets (FSs) often provide a more practical means of representation. Zadeh’s concepts [3] have been applied across various fields, including decision making, design recognition, and clinical diagnosis. However, for any fixed element within the universe of discourse, an FS can only use the membership degree (MD) to express certainty, which does not completely represent the fuzzy problem. To address this limitation, Atanassov and Yager advanced the concept of FSs by introducing the intuitionistic FS (IFS) [4], Pythagorean FS (PFS) [5,6], and q-rung orthopair FS (q-ROFS) [7], each incorporating additional components: non-membership degree (N-MD) and hesitancy degree (HD). The q-ROFS is a generalization of these concepts, with the IFS and PFS being special cases when q = 1 and q = 2 , respectively. In a q-ROFS, a pair , ʎ satisfies the constraints 0 , ʎ 1 and q + ʎ q 1 (where q 1 ), thus, a larger value of q expands the scope of fuzzy information it can represent.
Upon reviewing the preceding discussion, it is evident that certain limitations constrain existing theories. For example, within q-ROF environments, DEs are restricted by the requirement to assign identical values to the parameter q for both MD and N-MD. This constraint can significantly affect the decision-making process. To address these limitations and enhance the framework’s applicability, a novel approach has been proposed. Seikh and Mandal [8] originated the concept of p,q-rung orthopair fuzzy p,qROF sets (p,qROFSs), which extend q-ROFSs. p,qROFSs offer a more flexible structure by incorporating two adjustable parameters, p and q, allowing DEs to tailor MD and N-MD according to specific needs. This enhanced flexibility is better suited for managing complex decision-making scenarios, advancing the field by providing a more nuanced approach. Building on this innovative framework, researchers have developed various methodologies. For instance, Rahim et al. [9] explored sine trigonometric operations and their associated aggregation operators (AOs) for p,qROF numbers (p,qROFNs). Ali and Naeem [10] presented Aczel–Alsina AOs within the p,qROF framework to address MCDM problems. Chu et al. [11] investigated cubic p,qROFSs and their fundamental operational laws. Additionally, Rahim et al. [12] developed confidence-level-based AOs using p,qROFSs. These advancements highlight the substantial potential of p,qROFSs in enhancing decision-making processes and broadening the theoretical framework.
The AOs designed by Seikh and Mandal [8] are based on certain t-norms and t-conorms, with the product and probabilistic sum [13] being the most commonly used. These pairs are preferred for their computational simplicity. However, their major drawbacks include a lack of flexibility and robustness. To address these issues, some p,qROF AOs [10,14,15] have been introduced using alternative t-norms and t-conorms. These new AOs enhance robustness but still fall short in terms of flexibility, limiting their ability to incorporate all opinions and information necessary for modeling real-world MCDM problems. To bridge this gap, Frank [16] generalized the Łukasiewicz and probabilistic t-norms and t-conorms, proposing the Frank t-norm and t-conorm, which form a more flexible family of triangular norms. The inclusion of adjustable parameters in the Frank t-norm and t-conorm enhances their adaptability in information fusion, making them more suitable for modeling complex decision-making problems. Sarkoci [17] conducted a comparative study between Hamacher and Frank t-norms, concluding that they belong to the same family of t-norms.
Following the introduction of Frank t-norms and t-conorms, mathematicians have developed AOs utilizing this pair of norms. Zhang et al. [18] presented Frank AOs for interval-valued intuitionistic FSs (IFSs) and demonstrated their application in MCGDM problems. Qin et al. [19] explored Frank AOs for triangular interval type-2 fuzzy information based on Frank t-norms and t-conorms, applying them to MCGDM problems. In [20], the development and theory of Frank AOs within probabilistic hesitant fuzzy sets are given, while Tang et al. [21] explored their application in the context of dual hesitant fuzzy information. With the advent of p,qROFSs, DEs gained the flexibility to express information using MDs and N-MDs with varying power conditions. This flexibility, combined with the significance of Frank t-norms and t-conorms, makes the concept of Frank AOs within the p,q-ROFS framework particularly noteworthy. Despite their desirable properties, there has been a lack of studies examining the effects of varying parameters within Frank AOs on MCDM problems. This gap in research motivated the author to explore the family of Frank AOs and their properties within the p,qROF framework, based on Frank t-norms and t-conorms, and subsequently, apply them to MCDM problems.
The following arguments establish the necessity of this study:
(i)
The p,qROFS model’s broad applicability enables it to elucidate complex data in a versatile and comprehensive manner. As a construction-based decision-making strategy, the decision-making mechanism within the p,qROFS structure warrants greater attention.
(ii)
The Frank operations are highly adaptable due to the Frank parameter ß, allowing for flexibility in various decision-making environments based on the DE’s risk-taking appetite. By blending realistic elements with a degree of optimism, they cater to different consumer needs while avoiding strict adherence to recklessness. However, the literature lacks these operations in the p,qROF setting.
(iii)
The preferences of DEs often shift dynamically based on their pessimistic or optimistic outlooks toward the object being evaluated. Therefore, the AOs necessary for MCDM must be sufficiently comprehensive and flexible to encompass all DEs’ preferences while integrating the evaluation values.
(iv)
In real-world scenarios, many decision-making problems involve distinct processes and information that are often ambiguous and uncertain. As a result, decision-making theory must evolve to develop novel MCDM approaches. Existing methodologies for MCDM [10,12,14,15] in the p,qROF context have several limitations, especially when managing decision-making issues where the weights of the criteria are entirely unknown.
(v)
Numerous scholars have developed various MCDM approaches in the existing body of research to address MCDM problems. These approaches aim to determine the most appropriate material selection in different fuzzy contexts. However, there is a notable shortage of scientific studies on managing suitable material selection for construction in a p,qROF scenario using aggregation-based stepwise weight assessment ratio analysis (SWARA) techniques.
Building upon the aforementioned motivations, this research has resulted in the development of several noteworthy innovations, which are listed in detail below.
(i)
To establish novel Frank-norm-based operational laws and analyze their properties, followed by numerical examples to elucidate the operational procedures of the proposed operations.
(ii)
To formulate the Frank weighted averaging and weighted geometric operators, along with their ordered weighted and hybrid forms, for aggregating p,q-ROF data.
(iii)
To develop the theory behind Frank operators, including their essential characteristics, limiting cases, and interrelationships.
(iv)
To introduce the p,qROF SWARA method for determining the weights of criteria; this allows DEs to express their viewpoints more freely due to the absence of a scale. Compared to the best–worst method, SWARA offers simpler computations and is easier to understand as it does not require solving complex linear objective functions.
(v)
To develop an aggregation-based method within the p,qROF framework, utilizing the proposed operators and the SWARA approach, for evaluating and identifying sustainable material choices in the construction industry. By incorporating the SWARA technique into this aggregation-based methodology, we enhance its practicality in decision-making processes where the weight vector is initially unknown.
In Section 2, we revisit some fundamental definitions and preliminaries to provide a foundational understanding of the present study. Section 3 introduces new operational laws for p,qROFNs based on the Frank t-norm and t-conorm. Building on these operational laws, Section 4 outlines new AOs along with their related results and special cases. Section 5 presents an algorithm for solving decision-making problems using proposed Frank AOs and the SWARA approach. In Section 6, we validate the proposed method with a real-life example and analyze the impact of parameters and criteria weights on the decision-making outcomes. Section 7 offers a comparison between the results of our method and those of other significant models. Finally, Section 8 concludes the paper.

2. Preliminaries

In this section, we provide a succinct summary of the p,qROFS structure.
Definition 1 
([8]). Suppose we have a given set X. A p,qROFS denoted by D over X can be characterized as follows:
D = ą , ( ą ) , ʎ ( ą ) | ą X , p , q 1 ,
Here, the terms ( ą ) and ʎ ( ą ) exist within the range [ 0.1 ] and represent the MD and N-MD, respectively, assigned to the element ą X . This assignment is valid when the condition 0 ( ą ) p + ʎ ( ą ) q 1 is met. The degree of indeterminacy is defined as π ( ą ) = 1 ( ą ) p + ʎ ( ą ) q , where ℓ represents the least common multiple (lcm) of p and q. For the sake of convenience, in their work [8], Seikh and Mandal introduced the notation ϝ = , ʎ as a p,qROFN.
Remark 1. 
Consider a scenario where we are tasked with determining the smallest values of p and q greater than or equal to 1 for a given orthopair , ʎ such that the inequality p + ʎ q 1 holds true. While an explicit mathematical solution in a closed form might not be readily available, it is consistently viable to formulate a distinct solution for these challenges through the utilization of iterative computational techniques.
The minimal values of p and q that satisfy the condition p + ʎ q 1 are termed the p , q -niche of the orthopair , ʎ . In cases where p and q represent the p , q -niche of , ʎ , it can be deduced that , ʎ remains valid for all values of p greater than or equal to p , and for all values of q greater than or equal to q .
Consider a set of provided data X = ą 1 , ą 2 , , ą , and let F represent a fuzzy concept. In this context, an expert contributes their preferences for each element ą ι X in the form of an orthopair ( ą ι ) , ʎ ( ą ι ) . The task at hand is to determine suitable values for p and q that effectively capture the characteristics of the data. We can now proceed as outlined below:
  • Determine the p , q -niche, denoted as p ι and q ι , for each p , q -orthopair ( ą ι ) , ʎ ( ą ι ) .
  • Define the p , q -niche as follows: p = max ι p ι and q = max ι q ι .
  • Consequently, we can represent the fuzzy notion F as a p , q -ROFS.
Remark 2. 
  • Definition 1 simplifies to an IFS when we assign p = q = 1 .
  • Definition 1 simplifies to a PyFS when we assign p = q = 2 .
  • Definition 1 simplifies to an FFS when we assign p = q = 3 .
  • Definition 1 simplifies to a qROFS when we assign p = q .
  • Definition 1 simplifies to a 3,4-quasirung FS when p = 3 , q = 4 .
Definition 2 
([8]). Let ϝ, ϝ 1 , and ϝ 2 be any three p,qROFNs and > 0 , then the basic operational laws on them are listed as:
  • ϝ 1 ϝ 2 = 1 p + 2 p 1 p 2 p 1 / p , ʎ 1 ʎ 2 ;
  • ϝ 1 ϝ 2 = 1 2 , ʎ 1 q + ʎ 2 q ʎ 1 q ʎ 2 q 1 / p ;
  • ϝ = , 1 1 ʎ q 1 / q ;
  • ϝ = 1 1 p 1 / p , ʎ ;
  • ϝ c = ʎ , .
Definition 3 
([8]). Let ϝ be a p,qROFN, then the score function can be defined as
S ϝ = 1 + p ʎ q 2 ,
where p , q [ 1 , ) , S ϝ 0 , 1 . The greater the value of S ϝ , the greater the p,qROFN ϝ.
Definition 4 
([8]). Let ϝ be a p,qROFN, then the degree of accuracy is characterized by
A ϝ = p + ʎ q ; A ϝ 0.1 .
When the computed score values are similar, the larger the degree of accuracy A ϝ , the larger the p,qROFN.
When the computed score values are the same, we then examine their accuracy. A higher degree of accuracy A ϝ corresponds to a larger p,qROFN.
Triangular norms (t-norms) have been extensively researched since Zadeh pioneered the max and min operations as examples of triangular norms and their corresponding triangular conorms (t-conorms). Several notable pairs of t-norms and t-conorms include the product t-norm and probabilistic sum t-conorm [22], the Einstein t-norm and t-conorm [23], the Łukasiewicz t-norm and t-conorm [13], and the Hamacher t-norm and t-conorm [24].
Frank operations, such as Frank’s product and Frank’s sum, serve as additional examples of t-norms and t-conorms, respectively. The Frank t-norm T F and Frank t-conorm S F are formulated as follows:
T F Æ 1 , Æ 2 = log ß 1 + ß Æ 1 1 ß Æ 2 1 ß 1 Æ 1 , Æ 2 0.1 2 ,
S F Æ 1 , Æ 2 = 1 log ß 1 + ß 1 Æ 1 1 ß 1 Æ 2 1 ß 1 Æ 1 , Æ 2 0.1 2 .
According to Wang et al. [25], the Frank t-norm and Frank t-conorm exhibit the following features:
T F Æ 1 , Æ 2 + S F Æ 1 , Æ 2 = Æ 1 + Æ 2 ,
T F Æ 1 , Æ 2 Æ 1 + S F Æ 1 , Æ 2 Æ 1 = 1 .
The following findings [25] can be easily verified using limit theory.
(1)
If ß 1 , then T F Æ 1 , Æ 2 Æ 1 + Æ 2 Æ 1 Æ 2 and S F Æ 1 , Æ 2 Æ 1 Æ 2 ; the Frank t-norm and Frank t-conorm are reduced to probabilistic product and probabilistic sum.
(2)
If ß , then T F Æ 1 , Æ 2 min Æ 1 + Æ 2 , 1 and S F Æ 1 , Æ 2 max 0 , Æ 1 + Æ 2 1 ; the Frank t-norm and Frank t-conorm are reduced to the Łukasiewicz product and Łukasiewicz sum, respectively.

3. p,qROF Frank Operational Rules

This section introduces the Frank operations of p,qROFNs and explores their intriguing characteristics.
Definition 5. 
Let ϝ 1 = 1 , ʎ 1 and ϝ 2 = 2 , ʎ 2 be two p,qROFNs and > 0 , then:
  • ϝ 1 ϝ 2 = 1 log ß 1 + ß 1 1 p 1 ß 1 2 p 1 ß 1 p , log ß 1 + ß ʎ 1 q 1 ß ʎ 2 q 1 ß 1 q ;
  • ϝ 1 ϝ 2 = log ß 1 + ß 1 p 1 ß 2 p 1 ß 1 p , 1 log ß 1 + ß 1 ʎ 1 q 1 ß 1 ʎ 2 q 1 ß 1 q ;
  • ϝ 1 = log ß 1 + ß 1 p 1 ß 1 1 p , 1 log ß 1 + ß 1 ϑ 1 q 1 ß 1 1 q ;
  • ϝ 1 = 1 log ß 1 + ß 1 1 p 1 ß 1 1 p , log ß 1 + ß ʎ 1 q 1 ß 1 1 q ;
  • ϝ 1 c = ʎ 1 , 1 .
Theorem 1. 
Let ϝ ȶ = ȶ , ʎ ȶ ȶ = 1 , 2 and ϝ = , ʎ be three p,qROFNs, and , 1 , 2 > 0 , then: 2
1. ϝ 1 ϝ 2 = ϝ 2 ϝ 1 ;5. 1 ϝ 2 ϝ = 1 + 2 ϝ ;
2. ϝ 1 ϝ 2 = ϝ 2 ϝ 1 ;6. ϝ 1 ϝ 2 = ϝ 1 + 2 ;
3. ϝ 1 ϝ 2 = ϝ 1 ϝ 2 ;7. 1 2 ϝ = 1 2 ϝ .
4. ϝ 1 ϝ 2 = ϝ 1 ϝ 2 ;
Proof. 
We establish the validity of components 1, 2, 3, and 4, and employ a similar approach for the remaining ones.
  • It is obvious.
  • ϝ 1 ϝ 2 = 1 log ß 1 + ß 1 1 p 1 ß 1 2 p 1 ß 1 p , log ß 1 + ß ʎ 1 q 1 ß ʎ 2 q 1 ß 1 q ,
    Utilizing the Frank operational law (4) as defined in Definition 5, it can be deduced that
    ϝ 1 ϝ 2 = 1 log ß 1 + ß log ß 1 + ß 1 1 p 1 ß 1 2 p 1 ß 1 1 ß 1 1 p , log ß 1 + ß log ß 1 + ß ʎ 1 q 1 ß ʎ 2 q 1 ß 1 1 ß 1 1 q = 1 log ß 1 + ß 1 1 p 1 ß 1 2 p 1 ß 1 2 1 p , log ß 1 + ß ʎ 1 q 1 ß ʎ 2 q 1 ß 1 2 1 q .
    Now,
    ϝ 1 ϝ 2 = 1 log ß 1 + ß 1 1 p 1 ß 1 1 p , log ß 1 + ß ʎ 1 q 1 ß 1 1 q 1 log ß 1 + ß 1 2 p 1 ß 1 1 p , log ß 1 + ß ʎ 2 q 1 ß 1 1 q = 1 log ß 1 + ß log ß 1 + ß 1 1 p 1 ß 1 1 1 ß log ß 1 + ß 1 2 p 1 ß 1 1 1 ß 1 p , log ß 1 + ß log ß 1 + ß ʎ 1 q 1 ß 1 1 1 ß log ß 1 + ß ʎ 2 q 1 ß 1 1 1 ß 1 q = 1 log ß 1 + ß 1 1 p 1 ß 1 2 p 1 ß 1 2 1 p , log ß 1 + ß ʎ 1 q 1 ß ʎ 2 q 1 ß 1 2 1 q .
    From Equations (8) and (9), we obtain ϝ 1 ϝ 2 = ϝ 1 ϝ 2 .
  • 1 ϝ 2 ϝ = 1 log ß 1 + ß 1 p 1 1 ß 1 1 1 p , log ß 1 + ß ʎ q 1 1 ß 1 1 1 q 1 log ß 1 + ß 1 p 1 2 ß 1 2 1 p , log ß 1 + ß ʎ q 1 2 ß 1 2 1 q = 1 log ß 1 + ß log ß 1 + ß 1 p 1 1 ß 1 1 1 1 ß log ß 1 + ß 1 p 1 2 ß 1 2 1 1 ß 1 p , log ß 1 + ß log ß 1 + ß ʎ q 1 1 ß 1 1 1 1 ß log ß 1 + ß ʎ q 1 2 ß 1 2 1 1 ß 1 q = 1 log ß 1 + ß 1 p 1 1 + 2 ß 1 1 + 2 1 p , log ß 1 + ß ʎ q 1 1 + 2 ß 1 1 + 2 1 q .
    1 + 2 ϝ = 1 log ß 1 + ß 1 p 1 1 + 2 ß 1 1 + 2 1 p , log ß 1 + ß ʎ q 1 1 + 2 ß 1 1 + 2 1 q .
    Consequently, by utilizing Equations (10) and (11), the desired outcome is obtained.
  • Since 2 ϝ = 1 log ß 1 + ß 1 p 1 2 ß 1 2 1 p , log ß 1 + ß ʎ q 1 2 ß 1 2 1 q .
    Building upon this, we can additionally formulate
    1 2 ϝ = 1 log ß 1 + ß log ß 1 + ß 1 p 1 2 ß 1 2 1 1 1 ß 1 1 1 p , log ß 1 + ß log ß 1 + ß ʎ q 1 2 ß 1 2 1 1 1 ß 1 1 1 q
    = 1 log ß 1 + ß 1 p 1 1 2 ß 1 1 2 1 p , log ß 1 + ß ʎ q 1 1 2 ß 1 1 2 1 q
      = 1 2 ϝ .
Theorem 2. 
Let ϝ 1 = 1 , ʎ 1 and ϝ 2 = 2 , ʎ 2 be two p,qROFNs, then:
  • ϝ 1 ϝ 2 c = ϝ 1 c ϝ 2 c ;
  • ϝ 1 ϝ 2 c = ϝ 1 c ϝ 2 c .
Proof. 
The proof is straightforward, and thus, omitted in this context. □

4. p,qROF Frank Aggregation Operators

Utilizing the presented Frank operation rules, we proceed to introduce a set of weighted aggregation operators for p,qROFNs.

4.1. p,qROF Frank Averaging Aggregation Operators

Definition 6. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs, then the p,qROF Frank weighted averaging operator (p,qROFWA) is
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g ϝ g ,
where = 1 , 2 , , j T represents the weight vector associated with ϝ g g = 1 , 2 , . . , j , satisfying the conditions g > 0 and g = 1 j g = 1 . In particular, when = 1 j , 1 j , , 1 j T , the p,qROF Frank weighted averaging (p,qROFFWA) operator simplifies to the p,qROF fuzzy Frank averaging (p,qROFFA) operator of dimension j, given by
R O F F A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 j g = 1 j ϝ g .
Theorem 3. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a collection of p,qROFNs, then the resultant output by employing the p,qROFFWA operator remains a p,qROFN, and
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 log ß 1 + g = 1 j ß 1 g p 1 g p , log ß 1 + g = 1 j ß ʎ g q 1 g q .
Proof. 
We verify this through a mathematical induction process based on j.
For j = 2 , we have
R O F F W A p , q ϝ 1 , ϝ 2 = 1 ϝ 1 2 ϝ 2
= 1 log ß 1 + ß 1 1 log ß 1 + ß 1 1 p 1 1 ß 1 1 1 1 ß 1 1 log ß 1 + ß 1 2 t 1 2 ß 1 2 1 1 ß 1 p , log ß 1 + ß 1 1 log ß 1 + ß ʎ 1 q 1 1 ß 1 1 1 1 ß 1 1 log ß 1 + ß ʎ 2 q 1 2 ß 1 2 1 1 ß 1 q
= 1 log ß 1 + 1 + ß 1 1 p 1 1 ß 1 1 1 1 1 + ß 1 2 p 1 2 ß 1 2 1 1 ß 1 p , log ß 1 + 1 + ß ʎ 1 q 1 1 ß 1 1 1 1 1 + ß ʎ 2 q 1 2 ß 1 2 1 1 ß 1 q
= 1 log ß 1 + 1 + ß 1 1 p 1 1 ß 1 1 1 1 1 + ß 1 2 p 1 2 ß 1 2 1 1 ß 1 p , log ß 1 + 1 + ß ʎ 1 q 1 1 ß 1 1 1 1 1 + ß ʎ 2 q 1 2 ß 1 2 1 1 ß 1 q
= 1 log ß 1 + ß 1 1 p 1 1 ß 1 2 p 1 2 p , log ß 1 + ß ʎ 1 q 1 1 ß ʎ 2 q 1 2 q .
Hence, the outcome is valid when j = 2 .
Assuming that Equation (14) is true for j = l , let us examine the case where j = l + 1 , yielding
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ l + 1 = p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ l l + 1 ϝ l + 1
= 1 log ß 1 + g = 1 l ß 1 g p 1 g p , log ß 1 + g = 1 l ß ʎ g q 1 g q
1 log ß 1 + ß 1 ( l + 1 ) p 1 ( l + 1 ) ß 1 ( l + 1 ) 1 p , log ß 1 + ß ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 ( l + 1 ) 1 q
= 1 log ß 1 + g = 1 l ß 1 g p 1 g ß 1 ( l + 1 ) p 1 ( l + 1 ) ß 1 ( l + 1 ) 1 ß 1 p , log ß 1 + g = 1 l ß ʎ g q 1 g ß ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 ( l + 1 ) 1 ß 1 q
= 1 log ß 1 + g = 1 l ß 1 g p 1 g ß 1 ( l + 1 ) p 1 ( l + 1 ) ß 1 g = 1 l ( g ) 1 ß 1 ß 1 ( l + 1 ) 1 p , log ß 1 + g = 1 l ß ʎ g q 1 g ß ʎ ( l + 1 ) q 1 ( l + 1 ) g = 1 l ß 1 ( g ) 1 ß 1 ß 1 ( l + 1 ) 1 q
= 1 log ß 1 + g = 1 l ß 1 g p 1 g ß 1 ( l + 1 ) p 1 ( l + 1 ) ß 1 g = 1 l + 1 ( g ) 1 p , log ß 1 + g = 1 l ß ʎ g q 1 g ß ʎ ( l + 1 ) q 1 ( l + 1 ) g = 1 l + 1 ß 1 ( g ) 1 q
= 1 log ß 1 + g = 1 l ß 1 g p 1 g ß 1 ( l + 1 ) p 1 ( l + 1 ) p , log ß 1 + g = 1 l ß ʎ g q 1 g ß ʎ ( l + 1 ) q 1 ( l + 1 ) q
Thus, the outcome remains valid for j = l + 1 . As a result, using the approach of mathematical induction, the assertion presented in Equation (14) is applicable to all positive integer values of j. □
Example 1. 
Let ϝ 1 = 0.5 , 0.4 , ϝ 2 = 0.4 , 0.3 , and ϝ 3 = 0.9 , 0.5 be three p,qROFNs, and = 0.4 , 0.3 , 0.3 T be the weight vector of ϝ g g = 1 , 2 , 3 . Suppose ß = 3 , then by Definition 6 and Theorem 3, we can obtain ( p = 3 , q = 2 )
R O F F W A p , q ϝ 1 , ϝ 2 , ϝ 3 = 1 log 3 1 + g = 1 3 3 1 g 3 1 g 3 , log 3 1 + g = 1 3 3 ʎ g 2 1 g 2 = 1 log 3 1 + 3 1 0.5 3 1 0.4 3 1 0.4 3 1 0.3 3 1 0.9 3 1 0.3 3 , log 3 1 + 3 0.4 2 1 0.4 3 0.3 2 1 0.3 3 0.5 2 1 0.3 2 = 0.7023 , 0.3940
Theorem 4. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs, and let ß > 1 . As ß 1 , the p,qROFFWA operator tends to the following limit:
lim ß 1 R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j 1 g p g p , g = 1 j ʎ g q g q .
Proof. 
As ß 1 , then g = 1 j ß 1 g p 1 g , g = 1 j ß ʎ g q 1 g 0 , 0
Using the logarithmic property and the principle of infinitesimal changes, we obtain
log ß 1 + g = 1 j ß 1 g p 1 g = ln 1 + g = 1 j ß 1 g p 1 g ln ß g = 1 j ß 1 g p 1 g ln ß
log ß 1 + g = 1 j ß ʎ g q 1 g = ln 1 + g = 1 j ß ʎ g q 1 g ln ß g = 1 j ß ʎ g q 1 g ln ß
Utilizing Taylor’s expansion formula, we obtain
ß 1 g p = 1 + 1 g p ln ß + ( 1 g p ) ln ß 2 2 ! +
ß ʎ g q = 1 + ʎ g q ln ß + ( ʎ g q ) ln ß 2 2 ! +
Also, since ß > 1 , then ln ß > 0 , ß 1 g p = 1 + 1 g p ln ß + O ln ß ,
ß ʎ g q = 1 + ʎ g q ln ß + O ln ß .
It follows that ß 1 g p 1 g 1 g p ln ß g
g = 1 j ß 1 g p 1 g g = 1 j 1 g p g = 1 j ln ß g
g = 1 j ß 1 g p 1 g g = 1 j 1 g p ln ß g = 1 j g
g = 1 j ß 1 g p 1 g ln ß g = 1 j 1 g p .
In a similar fashion, we can obtain g = 1 j ß ʎ g q 1 g ln ß g = 1 j ʎ g q .
Then, we have
lim ß 1 R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = lim ß 1 1 log ß 1 + g = 1 j ß 1 g p 1 g p , log ß 1 + g = 1 j ß ʎ g q 1 g q = lim ß 1 1 ln 1 + g = 1 j ß 1 g p 1 g ln ß p , ln 1 + g = 1 j ß ʎ g q 1 g ln ß q = lim ß 1 1 g = 1 j ß 1 g p 1 g ln ß p , g = 1 j ß ʎ g q 1 g ln ß q = 1 g = 1 j 1 g p g p , g = 1 j ʎ g q g q
which completes the proof. □
Theorem 5. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a collection of p,qROFNs, and let ß > 1 . As ß , the p,qROFFWA operator tends to the following limit:
lim ß R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g g p p , 1 g = 1 j g ʎ g q q .
Proof. 
In accordance with Theorem 3, we obtain
lim ß R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j
= lim ß 1 log ß 1 + g = 1 j ß 1 g p 1 g p , lim ß log ß 1 + g = 1 j ß ʎ g q 1 g q
Applying limit rules, the logarithmic transformation, and L’Hôpital’s rule, we can deduce that
1 lim ß ln 1 + g = 1 j ß 1 g p 1 g ln ß p , lim ß ln 1 + g = 1 j ß ʎ g q 1 g ln ß q
= 1 lim ß g = 1 j ß 1 g p 1 g 1 + g = 1 j ß 1 g p 1 g g = 1 j g 1 g p ß g p ß 1 g p 1 1 ß p , 1 lim ß g = 1 j ß ʎ g q 1 g 1 + g = 1 j ß ʎ g q 1 g g = 1 j g ʎ g q ß ʎ g q 1 ß ʎ g q 1 1 ß q ,
= 1 lim ß g = 1 j ß 1 g p 1 g 1 + g = 1 j ß 1 g p 1 g g = 1 j g 1 g p ß 1 g p ß 1 g p 1 p , 1 lim ß g = 1 j ß ʎ g q 1 g 1 + g = 1 j ß ʎ g q 1 g g = 1 j g ʎ g q ß ʎ g q ß ʎ g q 1 q
= 1 g = 1 j g 1 g p p , 1 g = 1 j g ʎ g q q
= g = 1 j g g p p , 1 g = 1 j g ʎ g q q
which ends the validation of Theorem 5. □
Theorem 6. 
(Idempotency) Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs; if ϝ g = ϝ 0 g , then
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = ϝ 0 .
Proof. 
Since for all g ϝ g = ϝ 0 = 0 , ʎ 0 , and g = 1 j g = 1 , according to Theorem 3, we obtain
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j =
1 log ß 1 + g = 1 j ß 1 0 p 1 g p , log ß 1 + g = 1 j ß ʎ 0 q 1 g q
= 1 log ß ß 1 0 p p , log ß ß ʎ 0 q q = 0 , ʎ 0 = ϝ 0 .
Hence, the proof is finalized. □
Theorem 7. 
(Monotonicity) Let ϝ g = g , ʎ g g = 1 , 2 , , j and ϝ ˙ g = ˙ g , ʎ ˙ g g = 1 , 2 , , j be two families of p,qROFNs such that g ˙ g , and ʎ g ʎ ˙ g g , then
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j p , q R O F F W A ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j .
Proof. 
As per Definition 3, when and ʎ g ʎ ˙ g g , then
1 log ß 1 + g = 1 j ß 1 g p 1 g p 1 log ß 1 + g = 1 j ß 1 ˙ g p 1 g p log ß 1 + g = 1 j ß ʎ g q 1 g q log ß 1 + g = 1 j ß ʎ ˙ g q 1 g q
Thus, S R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j S R O F F W A p , q ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j
Hence, R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j p , q R O F F W A ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j .
Theorem 8. 
(Boundedness) Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs, and let ϝ = min 1 g j g , max 1 g j ʎ g , ϝ + = max 1 g j g , min 1 g j ʎ g , then
ϝ p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ j ϝ + .
Proof. 
Since for all g , min 1 g j g g max 1 g j g , and min 1 g j ʎ g ʎ g max 1 g j ʎ g , thus, relying on idempotency and monotonicity, we obtain
ϝ p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ j ϝ + . □
Theorem 9. 
(Shift-invariance) Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs and ϝ ˙ = ˙ , ʎ ˙ as another p,qROFN. In this context, we have
R O F F W A p , q ϝ 1 ϝ ˙ , ϝ 2 ϝ ˙ , , ϝ j ϝ ˙ = p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ j ϝ ˙ .
Theorem 10. 
(Homogeneity) Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs, and let > 0 be any real number. Then, we have
R O F F W A p , q ϝ 1 , ϝ 2 , , ϝ j = p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ j .
The derivation of the aforementioned two theorems can be straightforwardly obtained through the presented Frank operational rules of p,qROFNs. However, due to space limitations, we omit the proof here.
Using the operational rules outlined in Definition 5, we analyze the subsequent results.
Definition 7. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs. Then, the p,qROF fuzzy Frank ordered weighted averaging (p,qROFFOWA) operator is defined as follows:
R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g ϝ δ ( g ) ,
where = 1 , 2 , , j T is the position weights of ϝ g g = 1 , 2 , . . , j satisfying g > 0 and g = 1 j g = 1 . ρ ( 1 ) , ρ ( 2 ) , , ρ ( j ) is a permutation of 1 , 2 , 3 , , j , so that ϝ ρ ( g 1 ) ϝ ρ ( g ) for g = 2 , 3 . . , j .
Theorem 11. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs. Then, the result attained through the p,qROFFOWA operator remains a p,qROFN, and
R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 log ß 1 + g = 1 j ß 1 ρ ( g ) p 1 g p , log ß 1 + g = 1 j ß ʎ ρ ( g ) q 1 g q .
Proof. 
The proof of this outcome follows an analogous approach to that of Theorem 3, and is therefore omitted here. □
Example 2. 
Let ϝ 1 = 0.5 , 0.4 , ϝ 2 = 0.4 , 0.3 , and ϝ 3 = 0.9 , 0.5 represent three p,qROFNs. In accordance with Definition 3, when p = 3 , q = 2 ,
S ϝ 1 = 0.4825 . , S ϝ 2 = 0.4870 , S ϝ 3 = 0.7395
Since S ϝ 3 > S ϝ 2 > S ϝ 1 , we have ϝ ρ ( 1 ) = 0.9 , 0.5 , ϝ ρ ( 2 ) = 0.4 , 0.3 , and ϝ ρ ( 3 ) = 0.5 , 0.4 , and = 0.3 , 0.4 , 0.3 T is the weight vector associated with the p,qROFFOWA operator. Assuming ß = 3 , then based on Definition 7 and Theorem 11, we can derive
R O F F O W A p , q ϝ ρ ( 1 ) , ϝ ρ ( 2 ) , ϝ ρ ( 3 ) = 1 log 3 1 + g = 1 3 3 1 ρ ( g ) 3 1 g 3 , log 3 1 + g = 1 3 3 ʎ ρ ( g ) 2 1 g 2 = 1 log 3 1 + 3 1 0.9 3 1 0.3 3 1 0.4 3 1 0.4 3 1 0.5 3 1 0.3 3 , log 3 1 + 3 0.5 2 1 0.3 3 0.3 2 1 0.4 3 0.4 2 1 0.3 2 = 0.6987 , 0.3820 .
Theorem 12. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs, and let ß > 1 . As ß 1 , the p,qROFFOWA operator tends towards the following limit:
lim ß 1 R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j 1 ρ ( g ) p g p , g = 1 j ʎ ρ ( g ) q g q .
Theorem 13. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs, and let ß > 1 . As ß , the p,qROFFOWA operator converges to the following limit:
lim ß R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g ρ ( g ) p p , 1 g = 1 j g ʎ ρ ( g ) q q .
Just like the p,qROFFWA operator, the p,qROFFOWA operator exhibits properties of boundedness, idempotency, monotonicity, shift-invariance, and homogeneity. In addition to these properties, the p,qROFFOWA operator presents the following desired outcomes.
Theorem 14. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs. Then, the following holds:
(i) 
If = 1 , 0 , , 0 T , then R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = max ϝ 1 , ϝ 2 , , ϝ j .
(ii) 
If = 0 , 0 , , 1 T , then R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = min ϝ 1 , ϝ 2 , , ϝ j .
(iii) 
If g = 1 and i = 0 i g , then R O F F O W A p , q ϝ 1 , ϝ 2 , , ϝ j = ϝ ρ ( g ) , where ϝ ρ ( g ) is the gth largest of ϝ g , g = 1 , 2 , , j .
Considering the definitions of the p,qROFFWA and p,qROFFOWA operators, it becomes evident that the p,qROFFWA operator solely assigns weights to the p,qROFNs, while the p,qROFFOWA operator exclusively focuses on the ordered positions of p,qROFNs. In practical real-world scenarios, both aspects should be simultaneously considered. To overcome this limitation, we introduce a solution by defining a hybrid averaging operator [26] based on the Frank t-norm and t-conorm. This hybrid operator takes into account both the provided p,qROFNs and their corresponding ordered positions.
Definition 8. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a set of p,qROFNs. In this context, the p,qROF fuzzy Frank hybrid averaging (p,qROFFHA) operator is defined as follows:
R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g ϝ ^ ρ ( g ) ,
where = 1 , 2 , , j T is the weight vector associated with p,qROFFHA such that g > 0 and g = 1 j g = 1 , = 1 , 2 , , j T is the weight vector of ϝ g g = 1 , 2 , . . , j such that g > 0 and g = 1 j g = 1 . ϝ ^ ρ ( g ) is the gth largest of the weighted p,qROFNs ϝ ^ g ϝ ^ g = j g ϝ g , g = 1 , 2 , . . , j and j is the balancing coefficient.
Theorem 15. 
Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs, then the result obtained by using the p,qROFFHA operator is still a p,qROFN, and
R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 log ß 1 + g = 1 j ß 1 ^ ρ ( g ) p 1 g p , log ß 1 + g = 1 j ß ʎ ^ ρ ( g ) q 1 g q ,
Proof. 
The proof needed for this result resembles that of Theorem 3, thus we skip it here. □
Example 3. 
Let ϝ 1 = 0.5 , 0.4 , ϝ 2 = 0.4 , 0.3 , and ϝ 3 = 0.9 , 0.5 , be three p,qROFNs (p = 3, q = 2), and = 0.4 , 0.4 , 0.2 T be the weight vector of ϝ g g = 1 , 2 , 3 . Assume ß = 3 , then, based on Definition 5, we can compute the weighted p,qROFNs:
ϝ ^ 1 = 3 × 0.4 × ϝ 1 = 1 log 3 1 + 3 1 0.5 4 1 3 × 0.4 3 1 3 × 0.4 1 3 , log 3 1 + 3 0.4 4 1 3 × 0.4 3 1 3 × 0.4 1 2 = 0.4210 , 0.1042 ; ϝ ^ 2 = 3 × 0.4 × ϝ 2 = 1 log 3 1 + 3 1 0.4 4 1 3 × 0.4 3 1 3 × 0.4 1 3 , log 3 1 + 3 0.3 4 1 3 × 0.4 3 1 3 × 0.4 1 2 = 0.3124 , 0.0522 ;
ϝ ^ 3 = 3 × 0.2 × ϝ 3 = 1 log 3 1 + 3 1 0.9 4 1 3 × 0.2 3 1 3 × 0.2 1 3 , log 3 1 + 3 0.5 4 1 3 × 0.2 3 1 3 × 0.2 1 2 = 0.7671 , 0.4665 .
As per Definition 3, we can acquire the score of ϝ ^ g g = 1 , 2 , 3 :
S ϝ ^ 1 = 0.5319 , S ϝ ^ 2 = 0.5139 , S ϝ 3 ^ = 0.6169 .
Since S ϝ ^ 3 > S ϝ ^ 2 > S ϝ ^ 1 , we have ϝ ^ ρ ( 1 ) = 0.7671 , 0.4665 , ϝ ^ ρ ( 2 ) = 0.3124 , 0.0522 , and ϝ ^ ρ ( 3 ) = 0.4210 , 0.1042 . Suppose = 0.3 , 0.4 , 0.3 T is the weight vector associated with the p,qROFFHA operator, we can deduce from Definition 8 and Theorem 15 the following outcome:
R O F F H A p , q ϝ ^ ρ ( 1 ) , ϝ ^ ρ ( 2 ) , ϝ ^ ρ ( 3 ) = 1 log 3 1 + g = 1 3 3 1 ^ ρ ( g ) 3 1 g 3 , log 3 1 + g = 1 3 3 ʎ ^ ρ ( g ) 2 1 g 2 = 1 log 3 1 + 3 1 0.7671 3 1 0.3 3 1 0.3124 3 1 0.4 3 1 0.4210 3 1 0.3 3 , log 3 1 + 3 0.4665 2 1 0.3 3 0.0522 2 1 0.4 3 0.1042 2 1 0.3 2 = 0.5702 , 0.1274 .
Theorem 16. 
Consider a series of p,qROFNs denoted as ϝ g = g , ʎ g , where g = 1 , 2 , , j , and let ß > 1 . As ß approaches 1, the p,qROFFHA operator tends towards the following limit:
lim ß 1 R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j 1 ^ ρ ( g ) p g p , g = 1 j ʎ ^ ρ ( g ) q g q .
Theorem 17. 
Consider the set ϝ g = g , ʎ g , where g = 1 , 2 , , j , constitutes a set of p,qROFNs. Additionally, let ß > 1 . When ß tends towards infinity, the p,qROFFHA operator converges to the following limit:
lim ß R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g ^ ρ ( g ) p p , 1 g = 1 j g ʎ ^ ρ ( g ) q q .
Just like the properties observed in the p,qROFFWA operator, the p,qROFFHA operator exhibits characteristics of boundedness, idempotency, monotonicity, shift-invariance, and homogeneity. In addition to these traits, the p,qROFFHA operator presents the following special cases:
Corollary 1. 
The p,qROFFWA operator is a special case of the p,qROFFHA operator.
Proof. 
Let = 1 j , 1 j , , 1 j T , then
R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 ϝ ^ ρ ( 1 ) 2 ϝ ^ ρ ( 2 ) j ϝ ^ ρ ( j ) = 1 j ϝ ^ ρ ( 1 ) ϝ ^ ρ ( 2 ) ϝ ^ ρ ( j ) = 1 ϝ 1 2 ϝ 2 j ϝ j = p , q R O F F W A ϝ 1 , ϝ 2 , , ϝ j .
Corollary 2. 
The p,qROFFOWA operator is a special case of the p,qROFFHA operator.
Proof. 
Let = 1 j , 1 j , , 1 j T , then
   R O F F H A p , q ϝ 1 , ϝ 2 , , ϝ j = 1 ϝ ^ ρ ( 1 ) 2 ϝ ^ ρ ( 2 ) j ϝ ^ ρ ( j ) = 1 ϝ ρ ( 1 ) 2 ϝ ρ ( 2 ) j ϝ ρ ( j ) = p , q R O F F O W A ϝ 1 , ϝ 2 , , ϝ j .

4.2. p,qROF Frank Geometric Aggregation Operators

The present section is dedicated to presenting a sequence of p,qROF fuzzy Frank geometric aggregation operators, which stem from the introduced Frank operations. Within the realm of geometric aggregation operators, we delve into an exploration of the p,qROFFWG, p,qROFFOWG, and p,qROFFHWG operators. Additionally, we provide fundamental definitions, observations, and outcomes, including corollaries, associated with these operators that are grounded in the utilization of the Frank t-norm and t-conorm.
Definition 9. 
Consider the collection ϝ g = g , ʎ g , where g = 1 , 2 , , j represents a set of p,qROFNs. In this context, the p,qROF fuzzy Frank weighted geometric operator, denoted as (p,qROFFWG), is defined as follows:
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ϝ g g ,
where = 1 , 2 , , j T represents the weight vector of ϝ g g = 1 , 2 , . . , j , wherein g > 0 and the sum over g from 1 to j yields g = 1 j g = 1 . Notably, if = 1 j , 1 j , , 1 j T , then the p,qROFFWG operator simplifies to the p,qROF fuzzy Frank geometric (p,qROFFG) operator of dimension j, and its formulation is as follows:
R O F F A p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ϝ g 1 j .
Theorem 18. 
Consider the set ϝ g = g , ʎ g , where g = 1 , 2 , , j denotes a series of p,qROFNs. Then, the result yielded by utilizing the p,qROFFWG operator remains a p,qROFN, and this outcome can be expressed as
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = log ß 1 + g = 1 j ß g p 1 g p , 1 log ß 1 + g = 1 j ß 1 ʎ g q 1 g q .
Proof. 
We establish its validity through mathematical induction based on the value of j.
When j = 2 , we observe that
R O F F W G p , q ϝ 1 , ϝ 2 = ϝ 1 1 ϝ 2 2
= log ß 1 + ß 1 1 log ß 1 + ß 1 p 1 1 ß 1 1 1 1 ß 1 1 log ß 1 + ß 2 p 1 2 ß 1 2 1 1 ß 1 p , 1 log ß 1 + ß 1 1 log ß 1 + ß 1 ʎ 1 q 1 1 ß 1 1 1 1 ß 1 1 log ß 1 + ß 1 ʎ 2 q 1 2 ß 1 2 1 1 ß 1 q
= log ß 1 + 1 + ß 1 p 1 1 ß 1 1 1 1 1 + ß 2 p 1 2 ß 1 2 1 1 ß 1 p , 1 log ß 1 + 1 + ß 1 ʎ 1 q 1 1 ß 1 1 1 1 1 + ß 1 ʎ 2 q 1 2 ß 1 2 1 1 ß 1 q
= log ß 1 + ß 1 p 1 1 ß 2 p 1 2 p , 1 log ß 1 + ß 1 ʎ 1 q 1 1 ß 1 ʎ 2 q 1 2 q .
Hence, the result remains valid for j = 2 .
Assuming that Equation (32) is true for j = l , we can demonstrate that for j = l + 1 the following applies:
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ l + 1 = p , q R O F F W G ϝ 1 , ϝ 2 , , ϝ l ϝ l + 1 l + 1
= log ß 1 + g = 1 l ß g p 1 g p , 1 log ß 1 + g = 1 l ß 1 ʎ g q 1 g q log ß 1 + ß ( l + 1 ) p 1 ( l + 1 ) ß 1 ( l + 1 ) 1 p , 1 log ß 1 + ß 1 ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 ( l + 1 ) 1 q
= log ß 1 + g = 1 l ß g p 1 g ß ( l + 1 ) p 1 ( l + 1 ) ß 1 ( l + 1 ) 1 ß 1 p , 1 log ß 1 + g = 1 l ß 1 ʎ g q 1 g ß 1 ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 ( l + 1 ) 1 ß 1 q
= log ß 1 + g = 1 l ß g p 1 g ß ( l + 1 ) p 1 ( l + 1 ) ß 1 g = 1 l ( g ) 1 ß 1 ß 1 ( l + 1 ) 1 p , 1 log ß 1 + g = 1 l ß 1 ʎ g q 1 g ß 1 ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 g = 1 l ( g ) 1 ß 1 ß 1 ( l + 1 ) 1 q
= log ß 1 + g = 1 l ß g p 1 g ß ( l + 1 ) p 1 ( l + 1 ) ß 1 g = 1 l + 1 ( g ) 1 p , 1 log ß 1 + g = 1 l ß 1 ʎ g q 1 g ß 1 ʎ ( l + 1 ) q 1 ( l + 1 ) ß 1 g = 1 l + 1 ( g ) 1 q
= log ß 1 + g = 1 l ß g p 1 g ß ( l + 1 ) p 1 ( l + 1 ) p , 1 log ß 1 + g = 1 l ß 1 ʎ g q 1 g ß 1 ʎ ( l + 1 ) q 1 ( l + 1 ) q .
Therefore, the outcome is valid for j = l + 1 . Consequently, by employing the approach of mathematical induction, the result as presented in Equation (32) is established for all positive integers j. □
Example 4. 
(Continued from Example 1) In accordance with Definition 9 and Theorem 18, it can be deduced that
R O F F W G p , q ϝ 1 , ϝ 2 , ϝ 3 = log 3 1 + g = 1 3 3 g 3 1 g 3 , 1 log 3 1 + g = 1 3 3 1 ʎ g 2 1 g 2 = log 3 1 + 3 0.5 3 1 0.4 3 0.4 3 1 0.3 3 0.9 3 1 0.3 3 , 1 log 3 1 + 3 1 0.4 2 1 0.4 3 1 0.3 2 1 0.3 3 1 0.5 2 1 0.3 2 = 0.5694 , 0.4095 .
Theorem 19. 
Consider the set ϝ g = g , ʎ g for g = 1 , 2 , , j , which constitutes a series of p,qROFNs. Additionally, let ß > 1 . As ß approaches 1, the p,qROFFWG operator converges towards the following limit:
lim ß 1 R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j g p g p , 1 g = 1 j 1 ʎ g q g q .
Proof. 
As ß approaches 1, the expression g = 1 j ß p g 1 g , g = 1 j ß 1 ʎ q g 1 g tends to converge to the point 0.0 due to the logarithmic property and the application of the rule of infinitesimal changes. This can be expressed as
log ß 1 + g = 1 j ß g p 1 g = ln 1 + g = 1 j ß g p 1 g ln ß g = 1 j ß g p 1 g ln ß
log ß 1 + g = 1 j ß 1 ʎ g q 1 g = ln 1 + g = 1 j ß 1 ʎ g q 1 g ln ß g = 1 j ß 1 ʎ g q 1 g ln ß
Utilizing Taylor’s expansion formula, we obtain
ß ϑ g t = 1 + g p ln ß + ( g p ) ln ß 2 2 ! +
ß 1 g p = 1 + 1 ʎ g q ln ß + ( 1 ʎ g q ) ln ß 2 2 ! +
Also, since ß > 1 , then ln ß > 0 , ß g p = 1 + g p ln ß + O ln ß ,   ß 1 ʎ g q = 1 + 1 ʎ g q ln ß + O ln ß .
It follows that ß g p 1 g g p ln ß g
g = 1 j ß g p 1 g g = 1 j g p g = 1 j ln ß g
g = 1 j ß g p 1 g g = 1 j g p ln ß g = 1 j g
g = 1 j ß g p 1 g ln ß g = 1 j g p .
Similarly, we can acquire
g = 1 j ß 1 ʎ g q 1 g ln ß g = 1 j 1 ʎ g q .
Then, we have
lim ß 1 R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = lim ß 1 log ß 1 + g = 1 j ß g p 1 g p , 1 log ß 1 + g = 1 j ß 1 ʎ g q 1 g q = lim ß 1 ln 1 + g = 1 j ß g p 1 g ln ß p , 1 ln 1 + g = 1 j ß 1 ʎ g q 1 g ln ß q = lim ß 1 g = 1 j ß g p 1 g ln ß p , 1 g = 1 j ß 1 ϑ g q 1 g ln ß q = g = 1 j g p g p , 1 g = 1 j 1 ʎ g q g q
which ends the proof. □
Theorem 20. 
Consider the set ϝ g = g , ʎ g for g = 1 , 2 , , j , forming a series of p,qROFNs. Additionally, let ß > 1 . As ß , the p,qROFFWG operator approaches the following limit:
lim ß R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j g g p p , g = 1 j g ʎ g q q .
Proof. 
In accordance with Theorem 18, it follows that
lim ß R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = lim ß log ß 1 + g = 1 j ß g p 1 g p , lim ß 1 log ß 1 + g = 1 j ß 1 ʎ g q 1 g q .
Utilizing limit principles, logarithmic transform, and L’Hôpital’s rule, it can be deduced that
lim ß ln 1 + g = 1 j ß g p 1 g ln ß p , 1 lim ß ln 1 + g = 1 j ß 1 ʎ g q 1 g ln ß q
= 1 lim ß g = 1 j ß g p 1 g 1 + g = 1 j ß g p 1 g g = 1 j g ϑ g t ß g p 1 ß g p 1 1 ß p , 1 lim ß g = 1 j ß 1 ʎ g q 1 g 1 + g = 1 j ß 1 ʎ g q 1 g g = 1 j g 1 ʎ g q ß ʎ g q ß 1 ʎ g q 1 1 ß q ,
= 1 lim ß g = 1 j ß g p 1 g 1 + g = 1 j ß g p 1 g g = 1 j g g p ß g p ß g p 1 p , 1 lim ß g = 1 j ß 1 ʎ g q 1 g 1 + g = 1 j ß 1 ʎ g q 1 g g = 1 j g 1 ʎ g q ß 1 ʎ g q ß 1 ʎ g q 1 q
= 1 g = 1 j g g p p , 1 g = 1 j g 1 ʎ g q q
= 1 g = 1 j g g p p , g = 1 j g ʎ g q q
which ends the proof of Theorem 18. □
Theorem 21. 
(Idempotency) Consider ϝ g = g , ʎ g , where g = 1 , 2 , , j is a set of p,qROFNs. If ϝ g = ϝ 0 for all values of g, then
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = ϝ 0 .
Proof. 
Given that ϝ g = ϝ 0 = 0 , ʎ 0 holds for all values of g, and g = 1 j g = 1 , it follows from Theorem 18 that
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = log ß 1 + g = 1 j ß 0 p 1 g p , 1 log ß 1 + g = 1 j ß 1 ʎ 0 q 1 g q
            = log ß ß 0 p p , 1 log ß ß 1 ʎ 0 q q = 0 , ʎ 0 = ϝ 0 .
Hence, the proof is concluded. □
Theorem 22. 
(Monotonicity) Consider ϝ g = g , ʎ g g = 1 , 2 , , j and ϝ ˙ g = ˙ g , ʎ ˙ g g = 1 , 2 , , j , two classes of p,qROFNs, so that g ˙ g and ʎ g ʎ ˙ g g , then
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j R O F F W G p , q ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j .
Proof. 
As per Definition 3, when g ˙ g and ʎ g ʎ ˙ g g , then
log ß 1 + g = 1 j ß g p 1 g p log ß 1 + g = 1 j ß ˙ g p 1 g p 1 log ß 1 + g = 1 j ß 1 ʎ g q 1 g q 1 log ß 1 + g = 1 j ß 1 ʎ ˙ g q 1 g q
Thus, S R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j S R O F F W G p , q ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j .
Hence, R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j p , q R O F F W G ϝ ˙ 1 , ϝ ˙ 2 , , ϝ ˙ j .
Theorem 23. 
(Boundedness) Consider ϝ g = g , ʎ g g = 1 , 2 , , j is a class of p,qROFNs, and let ϝ = min 1 g j g , max 1 g j ʎ g , ϝ + = max 1 g j g , min 1 g j ʎ g , then
ϝ p , q R O F F W G ϝ 1 , ϝ 2 , , ϝ j ϝ + .
Proof. 
Since for all g , min 1 g j g g max 1 g j g , and min 1 g j ʎ g ʎ g max 1 g j ʎ g , based on the principles of idempotency and monotonicity, we obtain
ϝ p , q R O F F W G ϝ 1 , ϝ 2 , , ϝ j ϝ + . □
Theorem 24. 
(Shift-invariance) Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs and ϝ ˙ = ˙ , ʎ ˙ be any other p,qROFNs, then
R O F F W G p , q ϝ 1 ϝ ˙ , ϝ 2 ϝ ˙ , , ϝ j ϝ ˙ = p , q R O F F W G ϝ 1 , ϝ 2 , , ϝ j ϝ ˙ .
Theorem 25. 
(Homogeneity) Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs and > 0 be any real number, then
R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j = R O F F W G p , q ϝ 1 , ϝ 2 , , ϝ j .
The validation of the aforementioned pair of theorems can be readily deduced from the presented operational rules of p,qROFNs. However, due to limitations in space, we abstain from presenting it here.
Definition 10. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j to be a class of p,qROFNs. In this context, the p,qROF fuzzy Frank ordered weighted geometric (p,qROFFOWG) operator can be expressed as
R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ϝ ρ ( g ) g ,
where = 1 , 2 , , j T is the position weights of ϝ g g = 1 , 2 , . . , j satisfying g > 0 and g = 1 j g = 1 . ρ ( 1 ) , ρ ( 2 ) , , ρ ( j ) is a permutation of 1 , 2 , 3 , , j such that ϝ ρ ( g 1 ) ϝ ρ ( g ) for g = 2 , 3 . . , j .
Theorem 26. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, then the result yielded by utilizing the p,qROFFOWG operator is still a p,qROFN, and
R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = log ß 1 + g = 1 j ß ρ ( g ) p 1 g p , 1 log ß 1 + g = 1 j ß 1 ʎ ρ ( g ) q 1 g q .
Proof. 
The demonstration of this result follows an analogous approach to that of Theorem 18, and thus, we exclude it here. □
Example 5. 
(Continued from Example 2) As per Definition 10 and Theorem 18, we can obtain
R O F F O W G p , q ϝ ρ ( 1 ) , ϝ ρ ( 2 ) , ϝ ρ ( 3 ) = log 3 1 + g = 1 3 3 ρ ( g ) 3 1 g 3 , 1 log 3 1 + g = 1 3 3 1 ʎ ρ ( g ) 2 1 g 2 = log 3 1 + 3 0.7 3 1 0.3 3 0.3 3 1 0.4 3 0.6 3 1 0.3 3 , 1 log 3 1 + 3 1 0.5 2 1 0.3 3 1 0.5 2 1 0.4 3 1 0.8 2 1 0.3 2 = 0.5577 , 0.4005 .
Theorem 27. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, and ß > 1 . As ß 1 , the p,qROFFOWG operator tends towards the following limit:
lim ß 1 R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ρ ( g ) p g p , 1 g = 1 j 1 ʎ ρ ( g ) q g q .
Theorem 28. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, and ß > 1 . As ß , the p,qROFFOWG operator tends towards the following limit:
lim ß R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j g ρ ( g ) p p , g = 1 j g ʎ ρ ( g ) q q .
Just like the properties exhibited by the p,qROFFWG operator, the p,qROFFOWG operator displays characteristics such as boundedness, idempotency, monotonicity, shift-invariance, and homogeneity. Beyond these established properties, the p,qROFFOWG operator has the following results.
Theorem 29. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, then we have the following:
(i) 
If = 1 , 0 , , 0 T , then R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = max ϝ 1 , ϝ 2 , , ϝ j .
(ii) 
If = 0 , 0 , , 1 T , then R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = min ϝ 1 , ϝ 2 , , ϝ j .
(iii) 
If g = 1 and i = 0 i g , then R O F F O W G p , q ϝ 1 , ϝ 2 , , ϝ j = ϝ ρ ( g ) , where ϝ ρ ( g ) is the gth largest of ϝ g , g = 1 , 2 , , j .
By examining the definitions of the p,qROFFWG and p,qROFFOWG operators, it becomes evident that the p,qROFFWG operator exclusively assigns weights to the p,qROFNs, whereas the p,qROFFOWG operator solely assigns weights to the sequential placement of p,qROFNs. In practical real-world scenarios, it is imperative to consider both aspects simultaneously. To address this limitation, we introduce the hybrid geometric operator [26], which is based on the Frank t-norm and t-conorm. This operator assigns weights to the given p,qROFNs and their respective ordered positions.
Definition 11. 
Let ϝ g = g , ʎ g g = 1 , 2 , , j be a series of p,qROFNs, then the p,qROF fuzzy Frank hybrid geometric (p,qROFFHG) operator is
R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ϝ ^ ρ ( g ) g ,
where = 1 , 2 , , j T is the weight vector associated with p,qROFFHG such that g > 0 and g = 1 j g = 1 , = 1 , 2 , , j T is the weight vector of ϝ g g = 1 , 2 , . . , j such that g > 0 and g = 1 j g = 1 . ϝ ^ ρ ( g ) is the gth largest of the weighted p,qROFNs ϝ ^ g ϝ ^ g = ϝ g j g , g = 1 , 2 , . . , j and j is the balancing coefficient.
Theorem 30. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, then the result derived by utilizing the p,qROFFHG operator is still a p,qROFN, and
R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j = log ß 1 + g = 1 j ß ^ ρ ( g ) p 1 g p , 1 log ß 1 + g = 1 j ß 1 ʎ ^ ρ ( g ) q 1 g q ,
Proof. 
The verification of this result follows a pattern akin to the proof presented in Theorem 18, and hence, we exclude it here. □
Example 6. 
(Continued from Example 3) Utilizing Definition 5, we can derive the weighted p,qROFNs as follows:
ϝ ^ 1 = ϝ 1 3 × 0.4 = log 3 1 + 3 0.5 3 1 3 × 0.4 3 1 3 × 0.4 1 3 , 1 log 3 1 + 3 1 0.4 2 1 3 × 0.4 3 1 3 × 0.4 1 2 = 0.3181 , 0.1746 ;
ϝ ^ 2 = ϝ 2 3 × 0.4 = log 3 1 + 3 0.4 3 1 3 × 0.4 3 1 3 × 0.4 1 3 , 1 log 3 1 + 3 1 0.3 2 1 3 × 0.4 3 1 3 × 0.4 1 2 = 0.2215 , 0.0989 ;
ϝ ^ 3 = ϝ 3 3 × 0.2 = log 3 1 + 3 0.9 3 1 3 × 0.2 3 1 3 × 0.4 1 3 , 1 log 3 1 + 3 1 0.5 2 1 3 × 0.2 3 1 3 × 0.4 1 2 = 0.9216 , 0.1944 .
Using Definition 3, we obtain the score of ϝ ^ g g = 1 , 2 , 3 :
S ϝ ^ 1 = 0.5009 , S ϝ ^ 2 = 0.5005 , S ϝ 3 ^ = 0.8725 .
Since S ϝ ^ 3 > S ϝ ^ 1 > S ϝ ^ 2 , we have ϝ ^ ρ ( 1 ) = 0.9216 , 0.1944 , ϝ ^ ρ ( 2 ) = 0.3181 , 0.1746 , and ϝ ^ ρ ( 3 ) = 0.2215 , 0.0989 . Assume = 0.3 , 0.4 , 0.3 T is the weight vector associated with the p,qROFFHG operator. Then, by Definition 11 and Theorem 30, the following can be deduced:
R O F F H G p , q ϝ ^ ρ ( 1 ) , ϝ ^ ρ ( 2 ) , ϝ ^ ρ ( 3 ) = log 3 1 + g = 1 3 3 ^ ρ ( g ) 3 1 g 3 , 1 log 3 1 + g = 1 3 3 1 ʎ ^ ρ ( g ) 2 1 g 2 = log 3 1 + 3 0.9216 3 1 0.3 3 0.3181 3 1 0.4 3 0.2215 3 1 0.3 3 , 1 log 3 1 + 3 1 0.1944 2 1 0.3 3 1 0.1746 2 1 0.4 3 1 0.0989 2 1 0.3 2 = 0.4072 , 0.1652 .
Theorem 31. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, and ß > 1 . As ß 1 , the p,qROFFHG operator tends towards the following limit:
lim ß 1 R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j = g = 1 j ^ ρ ( g ) p g p , 1 g = 1 j 1 ʎ ^ ρ ( g ) q g q .
Theorem 32. 
Consider ϝ g = g , ʎ g g = 1 , 2 , , j as a class of p,qROFNs, and ß > 1 . As ß , the p,qROFFHG operator converges to the following limit:
lim ß R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j = 1 g = 1 j g ^ ρ ( g ) p p , g = 1 j g ʎ ^ ρ ( g ) q q .
Similar to the properties exhibited by the p,qROFFWG operator, the p,qROFFHG operator demonstrates boundedness, idempotency, monotonicity, shift-invariance, and homogeneity. In addition to these properties, the p,qROFFHG operator also encompasses the following special cases.
Corollary 3. 
The p,qROFFWG operator is a particular case of the p,qROFFHG operator.
Proof. 
Let = 1 j , 1 j , , 1 j T , then
R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j =           ϝ ^ ρ ( 1 ) 1 ϝ ^ ρ ( 2 ) 2 ϝ ^ ρ ( j ) j = ϝ ^ ρ ( 1 ) ϝ ^ ρ ( 2 ) ϝ ^ ρ ( j ) 1 j           = ϝ 1 1 ϝ 2 2 ϝ j j = p , q R O F F W G ϝ 1 , ϝ 2 , , ϝ j .
Corollary 4. 
The p,qROFFOWG operator is a particular case of the p,qROFFHG operator.
Proof. 
Let = 1 j , 1 j , , 1 j T , then
   R O F F H G p , q ϝ 1 , ϝ 2 , , ϝ j = ϝ ^ ρ ( 1 ) 1 ϝ ^ ρ ( 2 ) 2 ϝ ^ ρ ( j ) j = ϝ ρ ( 1 ) 1 ϝ ρ ( 2 ) 2 ϝ ρ ( j ) j = p , q R O F F O W G ϝ 1 , ϝ 2 , , ϝ j .

5. Proposed MCDM Method

This section aims to construct a sentiment analysis algorithm by employing the p,qROF Frank operators in conjunction with the stepwise methodology of the SWARA method.

Decision-Making Method

In order to address decision-making challenges effectively, both Frank AOs and the SWARA method have demonstrated their practical utility. Consequently, it becomes imperative to devise a novel approach that extends the application of the Frank AOs and the SWARA method to accommodate complex assessment information within the context of p,qROFNs. Therefore, this subsection undertakes the development of a sentiment analysis algorithm, leveraging the adaptability of p,qROFNs and integrating the Frank AOs and the SWARA method. The specified MCDM algorithm incorporating p,qROF information can be described as follows.
Let M = M 1 , M 2 , , M m be a set of alternatives, and Ξ = Ξ 1 , Ξ 2 , , Ξ j be the set of criteria whose weight vector is unknown. The characteristics of each alternative M ι ι = 1 , 2 , . . , m with respect to each criteria are delineated in terms of p,qROFNs ϝ ι g = ι g , ʎ ι g ; 0 ι g p + ʎ ι g q 1 . Then, we proceed with the creation of an MCDM algorithm, which primarily encompasses the following steps.
Step 1:
Development of data matrix:
Take the p,qROF data from DEs concerning the finite set of alternatives evaluated against the criteria, and organize it into the matrix M represented as ϝ ι g . Additionally, determine the minimum values of p and q required to ensure that all pairs of the provided data conform to the context of p,qROFNs.
Step 2:
Normalization:
Convert the data matrix D = ϝ ι g into its normalized version D ˜ = ϝ ˜ ι g using the rule given in Equation (48).
ϝ ˜ ι g = ϝ ι g , i f Ξ g is benefit type ϝ ι g c , i f Ξ g is cos t type ,
where ϝ ι g c denotes the complement of ϝ ι g .
Step 3:
Criteria weight determination:
Step 3.1:
Determine the score value of the DE’s opinions (p,qROFNs) regarding the considered criteria according to Equation (2).
Step 3.2:
Quantify the priority classification of the criteria in accordance with the DE’s priorities, listing the criteria from greatest to smallest.
Step 3.3:
Evaluate the level of relative importance, starting from the second criterion, as follows: The relative importance of criterion Ξ g in relation to the previous criterion Ξ g 1 is S ( Ξ g ) S ( Ξ g 1 ) . This difference is called the comparative significance of the mean value and is labeled g .
Step 3.4:
Assess the comparative coefficient in light of Equation (49).
g = 1 , i f g = 1 g + 1 , i f g > 1 .
Step 3.5:
Calculate the weight of the gth criterion following Equation (50).
Ω g = 1 , i f g = 1 Ω g 1 g , i f g > 1 .
Step 3.6:
Determine the normalized weight of the gth criterion on the basis of Equation (51).
g = Ω g g = 1 j Ω g ; g = 1 , 2 , , j .
Step 4:
Aggregation:
Aggregate the p,qROFNs ϝ ι g g = 1 , 2 , , j for each alternative o ι ι = 1 , 2 , , j into the overall preference value ϝ ι by using either the diagnosed p,qROFFWA or p,qROFFWG operators. Mathematically,
ϝ ι = p , q R O F F W A ϝ ι 1 , ϝ ι 2 , , ϝ ι m ,
ϝ ι = p , q R O F F W G ϝ ι 1 , ϝ ι 2 , , ϝ ι m ,
where = 1 , 2 , , j is the weight vector of the criteria calculated in step 3.
Step 5:
Score values:
Find the score values of S ϝ ι ι = 1 , 2 , , m of the overall values ϝ ι ι = 1 , 2 , , m .
Step 6:
Ranking:
Sort the alternatives M ι ι = 1 , 2 , , m based on the score values S ϝ ι and choose the optimal one.

6. Case Study

This section initially utilizes a case study to show the operation of the proposed MCDM method, followed by a series of experiments to investigate the impact of various parameter values on the aggregation results.

6.1. Problem Description

In the present part, a detailed case study is given to illustrate the practical implementation of the devised technique in real-world scenarios involving numerous criteria and alternatives. This case study provides decision guidance for sustainable choice of materials in the construction industry. The choice of building materials in any construction project is crucial, as it significantly impacts the built environment’s resilience, safety, and sustainability. The following points underscore the importance of material selection:
Safety: The safety of a building is directly influenced by the materials used. Selecting substandard materials can lead to structural failures, endangering occupants. Thus, it is imperative to choose materials that comply with safety norms and have passed rigorous durability and strength tests [27].
Resilience: The resilience of the built environment is also determined by the materials used. Resilience refers to a structure’s ability to withstand natural disasters such as floods, earthquakes, and hurricanes. Using durable materials can prevent degradation and reduce the demand for maintenance and rebuilding [28].
Sustainability: The sustainability of the built environment is affected by the selected materials. Sustainable materials are reusable or recycled, with a low environmental impact. Using eco-friendly materials can reduce the building’s carbon footprint and promote environmental responsibility [29].
Cost: The cost of materials is a crucial consideration in building project planning. Selecting the right materials can reduce operational costs in the long run. For example, using durable materials can minimize the need for repairs and maintenance, leading to financial savings over time.
Regarding the choice of sustainable materials, incorporating DEs’ evaluations into the proposed approach is vital for addressing complex MCDM problems with numerous criteria and alternatives. DEs with diverse backgrounds and viewpoints can provide valuable insights to raise the standard of the outcomes. Therefore, a panel of DEs with various experiences should be assembled to offer data on the most significant assessment criteria, the weight of each criterion, and the performance evaluations of material choices against these criteria.
Initially, a set of criteria was compiled to address sustainability in material choice. After consulting with DEs, ten criteria were selected to cover the three dimensions, incorporating sustainability in material selection decisions. The impact of these criteria was subsequently assessed. The impact illustrates how each criterion affects overall sustainability. A cost criterion decreases the sustainability level as it increases, whereas a benefit criterion increases the sustainability level as it rises. Once the criteria are established, DEs must evaluate how the alternatives perform against each criterion. This evaluation can be conducted through questionnaires, where DEs use p,qROFNs to express their performance ratings for each alternative.
To avoid any misunderstandings regarding the criteria, each question should include a brief description explaining what the criterion entails. Additionally, the identified criteria for the sustainable material selection case are detailed in Table 1.
Consider that our objective is to rank six material alternatives, denoted as M i ( i = 1.2 , , 6 ) , and select the most sustainable material from among them. We consider ten criteria, as detailed in Table 1.
For evaluating the performance of each alternative against the criteria, we employ the p,qROFSs methodology. The parameter p is set to 3, and q is set to 2, representing the performance of each alternative in response to the criteria outlined in Table 2. This method allows us to systematically assess and rank the material alternatives based on their sustainability across the specified criteria.

6.2. Model Implementation

The following section outlines the stepwise process for calculating the optimal material selection.
Step 1: The p,qROF data provided by the DEs for the ten materials, evaluated against six criteria, is tabulated in Table 3.
Step 2: Based on the nature of the criteria, the data shown in Table 3 are normalized and are presented in Table 4.
Step 3: Following the proposed SWARA approach, the weights of the criteria are determined as follows:
Step 3.1: The score values of the DEs’ opinions on the ten criteria are calculated according to Equation (2), as shown below:
S Ξ 1 = 0.2564 , S Ξ 2 = 0.1477 , S Ξ 3 = 0.5185 , S Ξ 4 = 0.5734 , S Ξ 5 = 0.0949 , S Ξ 6 = 0.3006 , S Ξ 7 = 0.3750 , S Ξ 8 = 0.5496 , S Ξ 9 = 0.2150 , S Ξ 10 = 0.5448 .
Step 3.2: In accordance with the score values of the criteria, they are arranged in descending order as follows:
S Ξ 4 > , S Ξ 8 > , S Ξ 10 > , S Ξ 3 > , S Ξ 7 > , S Ξ 6 > , S Ξ 1 > , S Ξ 9 > , S Ξ 2 > , S Ξ 5 .
Step 3.3: The comparative significance of the mean values is quantified and the results are shown below.
1 = 0.0442 , 2 = 0.0673 , 3 = 0.0263 , 4 = 0.0000 , 5 = 0.0528 , 6 = 0.0744 , 7 = 0.1435 , 8 = 0.0238 , 9 = 0.0414 , 10 = 0.0048 ,
Step 3.4: With the aid of Equation (49), the comparative coefficient of each criteria is obtained as follows:
1 = 1.0442 , 2 = 1.0673 , 3 = 1.0263 , 4 = 1.0000 , 5 = 1.0528 , 6 = 1.0744 , 7 = 1.1435 , 8 = 1.0238 , 9 = 1.0414 , 10 = 1.0048 .
Step 3.5: Based on Equation (50), the weight vector of criteria is estimated as
Ω = 0.0896 , 0.0806 , 0.1150 , 0.1214 , 0.0766 , 0.0936 , 0.1005 , 0.1186 , 0.0861 , 0.1180 .
Step 3.5: Following Equation (51), the normalized weight vector of criteria is estimated as
= 0.0861 , 0.1150 , 0.0766 , 0.1214 , 0.0806 , 0.1186 , 0.1005 , 0.0936 , 0.1180 , 0.0896 .
Step 4: Employing the formulation of the p,qROFFWA and p,qROFFWG operators, the data of Table 4 is aggregated, and is summarized in Table 5.
Steps 5–6: Using Equation (2), the score values M ι ι = 1 , 2 , , 6 and the ordering of the alternatives based on these score values are derived in Table 6.

6.3. Sensitivity Analysis

In this section, we primarily examine the impact of parameters ß , p and q , as well as variations in criteria weights, on the final ranking of alternatives by considering various scenarios.

6.3.1. Sensitivity Regarding Parameters

The three parameters p , q , and ß associated with the established model certainly affect the final outcomes; therefore, we attempt to examine their effects.
To investigate the influence of parameter p on the ranking of alternative materials, we assign different values to p while the parameters q and ß are kept constant at 2 and 4, respectively. Table 7 presents the resulting rankings for each p value. Notably, for p values between 03 and 09, material M 1 emerges as the superior choice, followed by M 2 . However, this trend reverses when p exceeds 09, with M 2 taking precedence. Additionally, M 4 exhibits the lowest performance for p values of 03 and 05, whereas M 6 consistently ranks last for all other p values. In addition, M 3 initially occupies the fifth position for p = 03 but subsequently secures a consistent third place for all higher p values. These observations underscore the significant impact of parameter p on the material selection process.
Similarly to parameter p, we now illustrate the impact of parameter q on the ranking of selection materials. Various values for q are considered, such as 2, 3, 5, 7, 9, 11, 15, 20, and 25, while p = 3 and ß = 4 are kept constant. As shown in Table 8, the best material remains M 1 across all cases. For q = 2 and q = 3 , the second-best alternative is M 2 . However, for all other values of q, M 5 moves to the second position, previously occupying the third position in the cases where p = 2 and p = 3 . Additionally, it is observed that M 4 is the worst material in the first two cases, but M 3 takes this position in all other cases. This observation indicates that the ranking results are sensitive to changes in parameter q, though to a lesser extent than p, as the top alternative, M 1 , remains consistent across all scenarios.
To assess the sensitivity of our proposed operator to the Frank parameter ß, we revisited the material selection problem and evaluated it across a range of ß values. Table 9 presents the resulting final scores and rankings for each ß value. Notably, the ranking of materials remained consistent ( M 1 > M 2 > M 5 > M 6 > M 3 > M 4 ) regardless of the specific ß value employed, except for ß 01 . This observation suggests that the developed methodology exhibits robustness with respect to variations in the Frank parameter ß.

6.3.2. Sensitivity Regarding Criteria Weights

In this part, several simulation experiments were conducted to assess the impact of varying the criteria weights with the highest importance (i.e., 4 ) on the final outcomes. Building on the study by [33], ten scenarios were derived using Equation (54).
o t h e r = 1 α max 1 m a x × o t h e r
where o t h e r represents the updated values of all criteria except 4 ; α is the reduction coefficient, which can be subjectively determined by DEs; o t h e r indicates the original weight of the criteria excluding 4 ; and m a x denotes the original weight of criteria 4 . In this study, the value of α is set at 10 %, 20 %, …, 100%, allowing for the execution of 10 simulation experiments across 10 different scenarios. The variations in the criteria weights j under these different scenarios are illustrated in Table 10. Using these 10 sets of criteria weights, the corresponding outcomes for the alternatives are obtained, as shown in Table 10.
From Table 10, it is evident that variations in the value of the maximum weight criteria, 4 , lead to slight changes in the ranking of certain materials. However, the top-ranked alternative, M 1 , and the second-best alternative, M 2 , consistently maintain their positions across all 10 scenarios. In the first five scenarios, the worst alternative is M 5 . However, in the latter five scenarios, M 4 is ranked as the least favorable, with M 5 being more preferred in comparison.
This analysis underscores the significant role that criteria weights play in the selection process. The variations in these weights result in some changes in the overall ranking of the materials. The stability of the top alternatives, M 1 and M 2 , across different scenarios suggests a robustness in their selection, whereas the shifting positions of some materials highlight the sensitivity of alternatives to changes in criteria weights. This insight is crucial for DEs to understand the impact of weight adjustments on material rankings, ensuring more informed and reliable decisions.
After implementing the framed approach to the problem, the following managerial implications may be drawn.
The study’s managerial implications provide useful suggestions for enhancing decision making in construction material selection. Managers can make better-informed and precise decisions by using a structured, data-driven strategy that includes MCDM approaches and q-rung orthopair fuzzy sets, thereby reducing biases and enhancing results. This strategy highlights the importance of safety, resilience, and sustainability by ensuring that selected materials fulfill high durability and compliance criteria, lowering the danger of structural failure and legal liability. Incorporating environmental factors like C O 2 emissions and recyclability can improve a company’s reputation and long-term competitiveness by promoting sustainable practices.
Furthermore, the framework promotes cost efficiency by comparing initial charges against long-term savings in maintenance and disposal, so encouraging more strategic resource allocation. The participation of different DEs ensures a more thorough evaluation process, resulting in decisions that consider multiple stakeholder views. Finally, the approach’s versatility enables managers to modify it to specific project requirements while assuring regulatory compliance and stimulating innovation in sustainable construction, ultimately contributing to future-proofing and alignment with green building trends.

7. Comparative Study

A comparative analysis with established approaches is conducted in this section to benchmark the efficacy and generalizability of the proposed p,qROF operators. Prior studies [8,10,12,14,15,34] serve as the basis for comparison. Table 11 presents the ranking outcomes obtained by applying these existing AOs to a previously explored material selection problem. A comprehensive evaluation of its relative strengths can be detailed as follows by juxtaposing these results with those achieved by our p,qROF operators.
(i)
The ranking outcomes of the six materials utilizing the p,qROFWA operator [8] and the proposed p,qROFFWG operator are identical; however, they exhibit slight differences when compared to the results obtained using the proposed p,qROFFWA operator. It is also notable that the results derived through the p,qROFWG operator [8] are almost identical to those obtained via the devised p,qROFFWG operator, with the only discrepancy being the ranking order between M 5 and M 6 . Both the p,qROFWA and p,qROFWG operators are special cases of the proposed p,qROFFWA and p,qROFFWG operators, respectively, and can be derived when the Frank parameter ß 1 . Hence, our method demonstrates greater generality. Furthermore, the proposed operators, based on Frank t-norms, exhibit increased robustness and effectively capture the relationships between the arguments. The slight differences in material ranking are acceptable, as the ranking of alternatives depends on the parameter values and can change up to a specific threshold. Additionally, when ß , the proposed operators reduce to those based on the Łukasiewicz product and Łukasiewicz sum [25]. Therefore, the proposed Frank-based AOs can encompass almost all arithmetic and geometric AOs for p,qROFS, depending on the value of parameter ß.
(ii)
To apply the Rahim et al. [12] confidence-level operators to the presented problem, equal confidence levels were assigned to all DEs and criteria due to the unavailability of data on varying confidence levels. The data presented in Table 11 indicate that the CLp,qROFWA operator suggested by Rahim et al. ranks material M 5 as the best choice. However, their CLp,qROFWG operator ranks M 5 as the second-worst alternative. While differing rankings due to the nature of the operators are not uncommon, the substantial difference between being the best and the second-worst choice is notable. Notably, the developed operators offer greater generalization by including a Frank parameter ß. However, existing operators also have the advantage over the deployed ones of incorporating confidence levels, which can be beneficial in real-world scenarios where confidence in DEs may vary.
(iii)
In comparison with the p,qROFHWA and p,qROFHWG operators of [14], and the p,qROFDWA and p,qROFDWG operators of [15], it is evident that, similar to the proposed operators, the best alternative identified by these operators, except for the p,qROFDWA operator, is also M 1 . This consistency verifies the validity of the developed framework. Like the developed operators, these existing operators incorporate parameters—specifically Hamacher and Dombi—which adjust the aggregate value based on specific decision-making needs. However, based on the Frank norm, the proposed operators offer a significant advantage. The Frank t-norm and t-conorm provide greater flexibility than the Dombi and Hamacher norms, thus the p,qROFFWA and p,qROFFWG operators exhibit higher generality and flexibility in data aggregation. Furthermore, these operators can accommodate the relationships between various arguments, enhancing their applicability in diverse decision-making scenarios.
(iv)
From Ref. [10], it can be verified that, similar to the designed Frank operators, the Aczel–Alsina-based operators also possess the advantage of monotonicity. This property allows DEs to select appropriate values according to their risk preferences. As shown in Table 11, the most appropriate material identified by both the p,qROFAAWG [10] and q-ROFWPM [34] operators is M 1 , consistent with the results derived from the formulated operators. However, the main advantage of the developed method over these existing approaches is the incorporation of the proposed SWARA technique for determining criteria weights. The derived weights are then utilized in the decision-making process, enhancing the overall robustness and accuracy of the outcomes.
In light of the discussion, the proposed approach has the following key merits:
(i)
The operators introduced in this study are more general than those found in Ref. [8]. Unlike the p,q-ROFWA and p,q-ROFWG operators, which are based on algebraic t-norms and t-conorms, the operators developed here utilize Frank t-norms and t-conorms. Notably, as ß 1 , these operators simplify to the Seikh and Mandal operators [8].
(ii)
The developed method effectively captures the relationship between the arguments and includes a parameter ß that can be adjusted to tailor the aggregate value according to specific decision-making needs.
(iii)
Unlike the existing methods in [10,12,14,15], the deployed approach is capable of functioning even when criteria weights are unknown. This capability is enabled by combining the SWARA method for determining weights with the proposed AOs for ranking alternatives within the p,qROF environment.
Our research offers valuable insights into the theory and practical use of p,qROFSs and Frank AOs; however, it is essential to recognize some limitations within the current study.
(i)
The introduced AOs may exhibit context-specific applicability, and their performance might vary across different problem domains. Further experimentation and evaluation across varied scenarios are required to assess the broader utility of these approaches.
(ii)
Although the proposed operations and AOs address certain complexities in decision making, they may sometimes not fully account for all relevant factors or uncertainties. Our models need ongoing refinement and expansion to ensure their applicability to a wider range of real-world challenges.

8. Conclusions

In this paper, we first extended the Frank t-norm and t-conorm to p,qROF environments, introduced several new operational laws for p,qROFNs, and analyzed their properties and interrelationships. Building on these operational laws, we then developed a range of new AOs, including p,qROFFWA, p,qROFFOWA, p,qROFFHA, p,qROFFWG, p,qROFFOWG, and p,qROFFHA, specifically designed for scenarios where the arguments are p,qROFNs. We explored these operators’ desirable properties and special cases in detail and examined their interconnections. Furthermore, utilizing the p,qROFFWA and p,qROFFWG operators, we proposed an approach to solving p,qROF MCDM problems. We incorporated the SWARA method into the MCDM framework to determine the criteria weights. Subsequently, we discussed a real-world MCDM problem concerning the ’sustainable choice of materials in the construction industry’ to demonstrate our framed methodology’s applicability, feasibility, and superiority. The illustrated example shows that our decision-making procedure is more flexible and effective than existing methods due to the inclusion of operational parameters p, q, and ß, which can be adjusted based on the DEs’ preferences.
In the future, it is possible to continue the developed theory for other FSs such as r, s, and t-spherical FS [35], q-rung picture FS [36], circular intuitionistic FS [37], (a,b)-fuzzy soft set [38], and complemental FS [39]. Various other criteria weight determination techniques, such as best–worst, ITARA, OPA, etc., can also be extended to the p,qROF context to solve some other real-life decision-making problems.

Author Contributions

Conceptualization, J.A.; methodology, S.A.O.A.; software, N.S.A.E.-G.; validation, S.A.O.A.; formal analysis, J.A.; investigation, S.A.O.A.; resources, N.S.A.E.-G.; data curation, J.A.; writing—original draft preparation, J.A.;writing—review and editing, N.S.A.E.-G.; visualization, S.A.O.A.; supervision, J.A.; project administration, N.S.A.E.-G.; funding acquisition, S.A.O.A. All authors have read and agreed to the published version of the manuscript.

Funding

The current work was assisted financially to the Dean of Science and Research at King Khalid University via the Large Group Project under grant number RGP. 2/482/45.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article..

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Cagri Tolga, A.; Basar, M. The assessment of a smart system in hydroponic vertical farming via fuzzy MCDM methods. J. Intell. Fuzzy Syst. 2022, 42, 1–12. [Google Scholar] [CrossRef]
  2. Tolga, A.C.; Parlak, I.B.; Castillo, O. Finite-interval-valued Type-2 Gaussian fuzzy numbers applied to fuzzy TODIM in a healthcare problem. Eng. Appl. Artif. Intell. 2020, 87, 103352. [Google Scholar] [CrossRef]
  3. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  4. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  6. Yager, R.R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst. 2013, 22, 958–965. [Google Scholar] [CrossRef]
  7. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  8. 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]
  9. Rahim, M.; Garg, H.; Khan, S.; Alqahtani, H.; Khalifa, H.A.E.W. Group decision-making algorithm with sine trigonometric p, q-quasirung orthopair aggregation operators and their applications. Alex. Eng. J. 2023, 78, 530–542. [Google Scholar] [CrossRef]
  10. Ali, J.; Naeem, M. Analysis and application of p, q-quasirung orthopair fuzzy Aczel–Alsina aggregation operators in multiple criteria decision-making. IEEE Access 2023, 11, 49081–49101. [Google Scholar] [CrossRef]
  11. Chu, Y.M.; Garg, H.; Rahim, M.; Amin, F.; Asiri, A.; Ameer, E. Some p, q-cubic quasi-rung orthopair fuzzy operators for multi-attribute decision-making. Complex Intell. Syst. 2024, 10, 87–110. [Google Scholar] [CrossRef]
  12. Rahim, M.; Shah, K.; Abdeljawad, T.; Aphane, M.; Alburaikan, A.; Khalifa, H.A.E.W. Confidence Levels-Based p, q-Quasirung Orthopair Fuzzy Operators and Its Applications to Criteria Group Decision Making Problems. IEEE Access 2023, 11, 109983–109996. [Google Scholar] [CrossRef]
  13. Deschrijver, G.; Kerre, E.E. Uninorms in L-fuzzy set theory. Fuzzy Sets Syst. 2004, 148, 243–262. [Google Scholar] [CrossRef]
  14. Ahmad, T.; Rahim, M.; Yang, J.; Alharbi, R.; Khalifa, H.A.E.W. Development of p, q- quasirung orthopair fuzzy hamacher aggregation operators and its application in decision-making problems. Heliyon 2024, 10, e24726. [Google Scholar] [CrossRef] [PubMed]
  15. Rahim, M.; Eldin, E.M.; Khan, S.; Ghamry, N.A.; Alanzi, A.M.; Khalifa, H.A.E.W. Multi-criteria group decision-making based on dombi aggregation operators under p, q-quasirung orthopair fuzzy sets. J. Intell. Fuzzy Syst. 2024, 46, 53–74. [Google Scholar] [CrossRef]
  16. Frank, M.J. On the simultaneous associativity of F (x, y) and x+ y- F (x, y). Aequationes Math. 1979, 19, 194–226. [Google Scholar] [CrossRef]
  17. Sarkoci, P. Domination in the families of Frank and Hamacher t-norms. Kybernetika 2005, 41, 349–360. [Google Scholar]
  18. Zhang, X.; Liu, P.; Wang, Y. Multiple attribute group decision making methods based on intuitionistic fuzzy frank power aggregation operators. J. Intell. Fuzzy Syst. 2015, 29, 2235–2246. [Google Scholar] [CrossRef]
  19. Qin, J.; Liu, X. Frank Aggregation Operators for Triangular Interval Type-2 Fuzzy Set and Its Application in Multiple Attribute Group Decision Making. J. Appl. Math. 2014, 2014, 923213. [Google Scholar] [CrossRef]
  20. Yahya, M.; Abdullah, S.; Chinram, R.; Al-Otaibi, Y.D.; Naeem, M. Frank aggregation operators and their application to probabilistic hesitant fuzzy multiple attribute decision-making. Int. J. Fuzzy Syst. 2021, 23, 194–215. [Google Scholar] [CrossRef]
  21. Tang, X.; Yang, S.; Pedrycz, W. Multiple attribute decision-making approach based on dual hesitant fuzzy Frank aggregation operators. Appl. Soft Comput. 2018, 68, 525–547. [Google Scholar] [CrossRef]
  22. Xia, M.; Xu, Z.; Zhu, B. Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm. Knowl.-Based Syst. 2012, 31, 78–88. [Google Scholar] [CrossRef]
  23. Wang, W.; Liu, X. Intuitionistic fuzzy information aggregation using Einstein operations. IEEE Trans. Fuzzy Syst. 2012, 20, 923–938. [Google Scholar] [CrossRef]
  24. Liu, P. Some Hamacher aggregation operators based on the interval-valued intuitionistic fuzzy numbers and their application to group decision making. IEEE Trans. Fuzzy Syst. 2013, 22, 83–97. [Google Scholar] [CrossRef]
  25. Wang, W.S.; He, H.C. Research on flexible probability logic operator based on Frank T/S norms. Acta Electron. Sin. 2009, 37, 1141–1145. [Google Scholar]
  26. Xu, Z.; Da, Q.L. An overview of operators for aggregating information. Int. J. Intell. Syst. 2003, 18, 953–969. [Google Scholar] [CrossRef]
  27. Aghazadeh, E.; Yildirim, H.; Aliparast, S. Material selection in the construction projects: Challenges, Criteria and patterns. Int. J. Adv. Mech. Civ. Eng. 2019, 6, 42. [Google Scholar]
  28. Watson, S.S.; Ferraris, C.F.; Averill, J.D. Role of materials selection in the resilience of the built environment. Sustain. Resilient Infrastruct. 2018, 3, 165–174. [Google Scholar] [CrossRef]
  29. Goubran, S.; Walker, T.; Cucuzzella, C.; Schwartz, T. Green building standards and the united nations’ sustainable development goals. J. Environ. Manag. 2023, 326, 116552. [Google Scholar] [CrossRef]
  30. Akadiri, P.O.; Olomolaiye, P.O.; Chinyio, E.A. Multi-criteria evaluation model for the selection of sustainable materials for building projects. Autom. Constr. 2013, 30, 113–125. [Google Scholar] [CrossRef]
  31. Govindan, K.; Shankar, K.M.; Kannan, D. Sustainable material selection for construction industry–A hybrid multi criteria decision making approach. Renew. Sustain. Energy Rev. 2016, 55, 1274–1288. [Google Scholar] [CrossRef]
  32. Zhang, H.; Peng, Y.; Tian, G.; Wang, D.; Xie, P. Green material selection for sustainability: A hybrid MCDM approach. PLoS ONE 2017, 12, e0177578. [Google Scholar] [CrossRef] [PubMed]
  33. Liu, H.C.; Shi, H.; Li, Z.; Duan, C.Y. An integrated behavior decision-making approach for large group quality function deployment. Inf. Sci. 2022, 582, 334–348. [Google Scholar] [CrossRef]
  34. Du, W.S. Weighted power means of q-rung orthopair fuzzy information and their applications in multiattribute decision making. Int. J. Intell. Syst. 2019, 34, 2835–2862. [Google Scholar] [CrossRef]
  35. 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]
  36. Akram, M.; Shahzadi, G.; Alcantud, J.C.R. Multi-attribute decision-making with q-rung picture fuzzy information. Granul. Comput. 2022, 7, 197–215. [Google Scholar] [CrossRef]
  37. Atanassov, K.T. Circular intuitionistic fuzzy sets. J. Intell. Fuzzy Syst. 2020, 39, 5981–5986. [Google Scholar] [CrossRef]
  38. Al-shami, T.M.; Alcantud, J.C.R.; Mhemdi, A. New generalization of fuzzy soft sets:(a, b)-Fuzzy soft sets. Aims Math 2023, 8, 2995–3025. [Google Scholar] [CrossRef]
  39. Alcantud, J.C.R. Complemental fuzzy sets: A semantic justification of q-rung orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2023, 31, 4262–4270. [Google Scholar] [CrossRef]
Table 1. The chosen criteria for selecting sustainable materials [30,31,32].
Table 1. The chosen criteria for selecting sustainable materials [30,31,32].
Criteria GroupCriterionExplanationImpact
Economic Ξ 1 : Initial priceThe amount required for the production orCost
procurement of materials.
Ξ 2 : Maintenance priceThe funds that need to be allocated for maintenanceCost
throughout its useful lifespan.
Ξ 3 : Price of disposalThe cost required for the disposal of the material atCost
the end of its lifecycle.
Social Ξ 4 : Health and safetyThe material must be resilient to disruptions andBenefit
ensure user safety and well-being throughout its lifespan.
Ξ 5 : Durability against decayThe ability to withstand erosion, corrosion,Benefit
and similar factors.
Ξ 6 : FireproofThe ability to withstand fire.Benefit
Environment Ξ 7 : Water consumptionWater usage throughout the material’s lifecycle.Cost
Ξ 8 : CO2 emissionEmissions of CO2 over the material’s usage period.Cost
Ξ 9 : Energy savingTotal energy conserved by the substance.Benefit
Ξ 10 : Reuse and recyclabilityThe material’s potential for recycling and reuse.Benefit
Table 2. DEs’ opinions about the considered criteria.
Table 2. DEs’ opinions about the considered criteria.
Criteriap,qROFNs
Ξ 1 0.55 , 0.30
Ξ 2 0.44 , 0.25
Ξ 3 0.60 , 0.55
Ξ 4 0.70 , 0.48
Ξ 5 0.38 , 0.20
Ξ 6 0.52 , 0.40
Ξ 7 0.50 , 0.50
Ξ 8 0.72 , 0.42
Ξ 9 0.50 , 0.30
Ξ 10 0.68 , 0.48
Table 3. p,qROF decision matrix provided by DEs.
Table 3. p,qROF decision matrix provided by DEs.
Ξ 1 Ξ 2 Ξ 3 Ξ 4 Ξ 5
M 1 0.30 , 0.74 0.20 , 0.48 0.44 , 0.68 0.70 , 0.37 0.60 , 0.35
M 2 0.18 , 0.37 0.20 , 0.48 0.18 , 0.67 0.45 , 0.30 0.40 , 0.40
M 3 0.56 , 0.34 0.26 , 0.16 0.66 , 0.47 0.38 , 0.36 0.28 , 0.26
M 4 0.65 , 0.52 0.38 , 0.44 0.50 , 0.40 0.45 , 0.45 0.70 , 0.55
M 5 0.50 , 0.60 0.55 , 0.38 0.67 , 0.34 0.64 , 0.16 0.72 , 0.36
M 6 0.50 , 0.50 0.54 , 0.47 0.72 , 0.59 0.37 , 0.25 0.64 , 0.38
Ξ 6 Ξ 7 Ξ 8 Ξ 9 Ξ 10
M 1 0.30 , 0.17 0.45 , 0.35 0.34 , 0.28 0.45 , 0.50 0.75 , 0.68
M 2 0.34 , 0.24 0.67 , 0.62 0.58 , 0.47 0.35 , 0.40 0.55 , 0.50
M 3 0.60 , 0.55 0.31 , 0.28 0.48 , 0.40 0.25 , 0.25 0.35 , 0.30
M 4 0.68 , 0.64 0.26 , 0.18 0.42 , 0.24 0.57 , 0.65 0.30 , 0.32
M 5 0.55 , 0.40 0.72 , 0.50 0.65 , 0.42 0.50 , 0.58 0.64 , 0.46
M 6 0.48 , 0.36 0.74 , 0.52 0.66 , 0.48 0.62 , 0.40 0.72 , 0.48
Table 4. p,qROF normalized decision matrix.
Table 4. p,qROF normalized decision matrix.
Ξ 1 Ξ 2 Ξ 3 Ξ 4 Ξ 5
M 1 0.74 , 0.30 0.48 , 0.20 0.68 , 0.44 0.70 , 0.37 0.60 , 0.35
M 2 0.37 , 0.18 0.48 , 0.20 0.67 , 0.18 0.45 , 0.30 0.40 , 0.40
M 3 0.34 , 0.56 0.16 , 0.26 0.47 , 0.66 0.38 , 0.36 0.28 , 0.26
M 4 0.52 , 0.65 0.44 , 0.38 0.40 , 0.50 0.45 , 0.45 0.70 , 0.55
M 5 0.60 , 0.50 0.38 , 0.55 0.34 , 0.67 0.64 , 0.16 0.72 , 0.36
M 6 0.50 , 0.50 0.47 , 0.54 0.59 , 0.72 0.37 , 0.25 0.64 , 0.38
Ξ 6 Ξ 7 Ξ 8 Ξ 9 Ξ 10
M 1 0.30 , 0.17 0.35 , 0.45 0.28 , 0.34 0.45 , 0.50 0.75 , 0.68
M 2 0.34 , 0.24 0.62 , 0.67 0.47 , 0.58 0.35 , 0.40 0.55 , 0.50
M 3 0.60 , 0.55 0.28 , 0.31 0.40 , 0.48 0.25 , 0.25 0.35 , 0.30
M 4 0.68 , 0.64 0.18 , 0.26 0.24 , 0.42 0.57 , 0.65 0.30 , 0.32
M 5 0.55 , 0.40 0.50 , 0.72 0.42 , 0.65 0.50 , 0.58 0.64 , 0.46
M 6 0.48 , 0.36 0.52 , 0.74 0.48 , 0.66 0.62 , 0.40 0.72 , 0.48
Table 5. Aggregated results of alternatives.
Table 5. Aggregated results of alternatives.
p,qROFFWAp,qROFFWG
M 1 0.5819 , 0.3496 0.4987 , 0.4055
M 2 0.4886 , 0.3338 0.4537 , 0.4063
M 3 0.3933 , 0.3731 0.3303 , 0.4208
M 4 0.5105 , 0.4692 0.4233 , 0.5086
M 5 0.5545 , 0.4681 0.5193 , 0.5317
M 6 0.5515 , 0.4724 0.5243 , 0.5256
Table 6. Score values and ranking of materials.
Table 6. Score values and ranking of materials.
OperatorScore ValuesRanking
p,qROFFWA S M 1 = 0.5374 , S M 2 = 0.5026 , S M 3 = 0.4608 , M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
S M 4 = 0.4565 , S M 5 = 0.4757 , S M 6 = 0.4723 .
p,qROFFWG S M 1 = 0.4798 , S M 2 = 0.4642 , S M 3 = 0.4295 , M 1  >  M 2  >  M 6  >  M 5  >  M 3  >  M 4
S M 4 = 0.4086 , S M 5 = 0.4287 , S M 6 = 0.4339 .
Table 7. Results for R O F F W A p , q operator for various values of p.
Table 7. Results for R O F F W A p , q operator for various values of p.
p S M 1 S M 2 S M 3 S M 4 S M 5 S M 6 Ranking
p = 03 0.53740.50260.46080.45650.47570.4723 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
p = 05 0.48190.46170.43690.41400.41930.4159 M 1  >  M 2  >  M 3  >  M 5  >  M 6  >  M 4
p = 07 0.45900.44990.43130.40020.40010.3968 M 1  >  M 2  >  M 3  >  M 4  >  M 5  >  M 6
p = 09 0.44830.44610.42980.39490.39310.3899 M 1  >  M 2  >  M 3  >  M 4  >  M 5  >  M 6
p = 11 0.44300.44480.42930.39260.39030.3872 M 2  >  M 1  >  M 3  >  M 4  >  M 5  >  M 6
p = 15 0.43910.44420.42890.39100.38880.3857 M 2  >  M 1  >  M 3  >  M 4  >  M 5  >  M 6
p = 20 0.43780.44410.42880.39060.38840.3854 M 2  >  M 1  >  M 3  >  M 4  >  M 5  >  M 6
p = 25 0.43760.44410.42880.39050.38840.3853 M 2  >  M 1  >  M 3  >  M 4  >  M 5  >  M 6
Table 8. Results for R O F F W A p , q operator for various values of q.
Table 8. Results for R O F F W A p , q operator for various values of q.
q S M 1 S M 2 S M 3 S M 4 S M 5 S M 6 Ranking
q = 02 0.53740.50260.46080.45650.47570.4723 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
q = 03 0.57860.54060.50460.51540.53530.5323 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
q = 05 0.59870.55710.52700.55590.57600.5739 M 1  >  M 5  >  M 6  >  M 2  >  M 4  >  M 3
q = 07 0.60120.55890.53020.56460.58440.5828 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
q = 09 0.60150.55910.53060.56650.58620.5847 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
q = 11 0.60150.55920.53070.56690.58660.5851 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
q = 15 0.60160.55920.53070.56700.58670.5852 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
q = 20 0.60160.55920.53070.56700.58670.5852 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
q = 25 0.60160.55920.53070.56700.58670.5852 M 1  >  M 5  >  M 6  >  M 4  >  M 2  >  M 3
Table 9. Results for R O F F W A p , q operator for various values of ß.
Table 9. Results for R O F F W A p , q operator for various values of ß.
ß S M 1 S M 2 S M 3 S M 4 S M 5 S M 6 Ranking
ß 01 0.47470.46060.42700.40470.42400.4288 M 1  >  M 2  >  M 6  >  M 3  >  M 5  >  M 4
ß = 02 0.53970.50400.46190.45860.47850.4746 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 03 0.53830.50320.46130.45730.47680.4732 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 04 0.53740.50260.46080.45650.47570.4723 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 08 0.53540.50130.45980.45460.47310.4702 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 15 0.53390.50020.45890.45310.47100.4684 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 20 0.53320.49980.45850.45240.47010.4677 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 25 0.53280.49940.45830.45200.46940.4671 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 30 0.53240.49910.45800.45160.46880.4666 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 40 0.53180.49870.45770.45100.46800.4660 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
ß = 50 0.53140.49830.45740.45060.46740.4654 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
Table 10. Results for R O F F W A p , q operator for various weight vectors.
Table 10. Results for R O F F W A p , q operator for various weight vectors.
ScenarioWeight VectorScore ValuesRanking
S M 1 S M 2 S M 3 S M 4 S M 5 S M 6
(i) α = 10 % = 0.0968 , 0.1294 , 0.0862 , 0.01214 , 0.0906 , 0.1333 , 0.1130 , 0.1052 , 0.1327 , 0.1007 0.52240.49780.45670.45130.43460.4557 M 1 > M 2 > M 3 > M 6 > M 4 > M 5
(ii) α = 20 % = 0.0956 , 0.1277 , 0.0852 , 0.02428 , 0.0895 , 0.1317 , 0.1116 , 0.1039 , 0.1310 , 0.0995 0.52340.49790.45680.45130.43840.4567 M 1 > M 2 > M 3 > M 6 > M 4 > M 5
(iii) α = 30 % = 0.0944 , 0.1261 , 0.0840 , 0.03642 , 0.0884 , 0.1301 , 0.1102 , 0.1027 , 0.1294 , 0.0983 0.52440.49790.45680.45120.44220.4580 M 1 > M 2 > M 6 > M 3 > M 4 > M 5
(iv) α = 40 % = 0.0932 , 0.1245 , 0.0830 , 0.04856 , 0.0873 , 0.1284 , 0.1088 , 0.1014 , 0.1278 , 0.0970 0.52540.49800.45690.45110.44590.4591 M 1 > M 2 > M 6 > M 3 > M 4 > M 5
(v) α = 50 % = 0.0920 , 0.1229 , 0.0819 , 0.06070 , 0.0862 , 0.1268 , 0.1074 , 0.1001 , 0.1262 , 0.0958 0.52640.49800.45700.45100.44960.4602 M 1 > M 2 > M 6 > M 3 > M 4 > M 5
(vi) α = 60 % = 0.0909 , 0.1214 , 0.0808 , 0.07284 , 0.0851 , 0.1252 , 0.1061 , 0.0988 , 0.1245 , 0.0946 0.52730.49800.45700.45080.45310.4612 M 1 > M 2 > M 6 > M 3 > M 5 > M 4
(vii) α = 70 % = 0.0897 , 0.1198 , 0.0798 , 0.08498 , 0.0839 , 0.1235 , 0.1047 , 0.0975 , 0.1229 , 0.0933 0.52840.49810.45710.45080.45670.4623 M 1 > M 2 > M 6 > M 3 > M 5 > M 4
(viii) α = 80 % = 0.0885 , 0.1182 , 0.0787 , 0.09712 , 0.0828 , 0.1219 , 0.1033 , 0.0962 , 0.1213 , 0.0921 0.52940.49820.45720.45070.46030.4633 M 1 > M 2 > M 6 > M 5 > M 3 > M 4
(ix) α = 90 % = 0.0873 , 0.1166 , 0.0777 , 0.1093 , 0.0817 , 0.1202 , 0.1019 , 0.0949 , 0.1196 , 0.0908 0.53050.49830.45730.45070.46390.4644 M 1 > M 2 > M 6 > M 5 > M 3 > M 4
(x) α = 100 % = 0.0861 , 0.1150 , 0.0766 , 0.1214 , 0.0806 , 0.1186 , 0.1005 , 0.0936 , 0.1180 , 0.0896 0.53150.49830.45740.45060.46740.4654 M 1 > M 2 > M 5 > M 6 > M 3 > M 4
Table 11. Comparison with existing aggregation operators.
Table 11. Comparison with existing aggregation operators.
p,qROFWA [8]0.47470.46060.42700.40470.42400.4288 M 1  >  M 2  >  M 6  >  M 3  >  M 5  >  M 4
p,qROFWG [8]0.54240.50550.46310.46100.48150.4771 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
CLp,qROFWA [12]0.47440.47060.45660.47360.48340.4832 M 5  >  M 6  >  M 1  >  M 4  >  M 2  >  M 3
CLp,qROFWG [12]0.53920.54650.54430.52970.52810.5276 M 2  >  M 3  >  M 1  >  M 4  >  M 5  >  M 6
p,qROFHWA [14]0.15370.15290.12740.08370.08870.0909 M 1  >  M 2  >  M 3  >  M 6  >  M 5  >  M 4
p,qROFHWG [14]0.96100.95350.90940.91600.92610.9255 M 1  >  M 2  >  M 5  >  M 6  >  M 4  >  M 3
p,qROFDWA [15]0.38320.42250.35420.33210.39760.4094 M 2  >  M 6  >  M 5  >  M 1  >  M 3  >  M 4
p,qROFDWG [15]0.63210.56620.50320.53550.59950.5496 M 1  >  M 5  >  M 2  >  M 6  >  M 4  >  M 3
p,qROFAAWA [10]0.38500.38670.36900.34650.36010.3538 M 5  >  M 6  >  M 2  >  M 1  >  M 3  >  M 4
p,qROFAAWG [10]0.61700.55960.51510.53870.56980.5458 M 1  >  M 5  >  M 2  >  M 6  >  M 4  >  M 3
q-ROFWPM [34]0.62950.57380.54040.56520.57310.5690 M 1  >  M 2  >  M 5  >  M 6  >  M 4  >  M 3
Proposed p,qROFFWA operator0.53740.50260.46080.45650.47570.4723 M 1  >  M 2  >  M 5  >  M 6  >  M 3  >  M 4
Proposed p,qROFFWG operator0.47980.46420.42950.40860.42870.4339 M 1  >  M 2  >  M 6  >  M 5  >  M 3  >  M 4
CLp,qROFWA: confidence-level-based p,qROF weighted averaging; CLp,qROFWG: confidence-level-based p,qROF weighted geometric; p,qROFHWA: p,qROF Hamacher weighted averaging; p,qROFHWG: p,qROF Hamacher weighted geometric; p,qROFDWA: p,qROF Dombi weighted averaging; p,qROFDWG: p,qROF Dombi weighted geometric; p,qROFAAWA: p,qROF Aczel–Alsina weighted averaging; p,qROFAAWG: p,qROF Aczel–Alsina weighted geometric; q-ROFWPM: q-rung orthopair fuzzy weighted power mean.
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

Ali, J.; Abdallah, S.A.O.; Abd EL-Gawaad, N.S. Decision Analysis Algorithm Using Frank Aggregation in the SWARA Framework with p,qRung Orthopair Fuzzy Information. Symmetry 2024, 16, 1352. https://doi.org/10.3390/sym16101352

AMA Style

Ali J, Abdallah SAO, Abd EL-Gawaad NS. Decision Analysis Algorithm Using Frank Aggregation in the SWARA Framework with p,qRung Orthopair Fuzzy Information. Symmetry. 2024; 16(10):1352. https://doi.org/10.3390/sym16101352

Chicago/Turabian Style

Ali, Jawad, Suhad Ali Osman Abdallah, and N. S. Abd EL-Gawaad. 2024. "Decision Analysis Algorithm Using Frank Aggregation in the SWARA Framework with p,qRung Orthopair Fuzzy Information" Symmetry 16, no. 10: 1352. https://doi.org/10.3390/sym16101352

APA Style

Ali, J., Abdallah, S. A. O., & Abd EL-Gawaad, N. S. (2024). Decision Analysis Algorithm Using Frank Aggregation in the SWARA Framework with p,qRung Orthopair Fuzzy Information. Symmetry, 16(10), 1352. https://doi.org/10.3390/sym16101352

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