Processing math: 47%
Research article

The q-rung orthopair fuzzy-valued neutrosophic sets: Axiomatic properties, aggregation operators and applications

  • Received: 21 October 2023 Revised: 11 December 2023 Accepted: 12 December 2023 Published: 24 January 2024
  • MSC : 03E72, 90B50, 68T35

  • During the transitional phase spanning from the realm of fuzzy logic to the realm of neutrosophy, a multitude of hybrid models have emerged, each surpassing its predecessor in terms of superiority. Given the pervasive presence of indeterminacy in the world, a higher degree of precision is essential for effectively handling imprecision. Consequently, more sophisticated variants of neutrosophic sets (NSs) have been conceived. The key objective of this paper is to introduce yet another variant of NS, known as the q-rung orthopair fuzzy-valued neutrosophic set (q-ROFVNS). By leveraging the extended spatial range offered by q-ROFS, q-ROFVNS enables a more nuanced representation of indeterminacy and inconsistency. Our endeavor commences with the definitions of q-ROFVNS and q-ROFVN numbers (q-ROFVNNs). Then, we propose several types of score and accuracy functions to facilitate the comparison of q-ROFVNNs. Fundamental operations of q-ROFVNSs and some algebraic operational rules of q-ROFVNNs are also provided with their properties, substantiated by proofs and elucidated through illustrative examples. Drawing upon the operational rules of q-ROFVNNs, the q-ROFVN weighted average operator (q-ROFVNWAO) and q-ROFVN weighted geometric operator (q-ROFVNWGO) are proposed. Notably, we present the properties of these operators, including idempotency, boundedness and monotonicity. Furthermore, we emphasize the applicability and significance of the q-ROFVN operators, substantiating their utility through an algorithm and a numerical application. To further validate and evaluate the proposed model, we conduct a comparative analysis, examining its accuracy and performance in relation to existing models.

    Citation: Ashraf Al-Quran, Faisal Al-Sharqi, Atiqe Ur Rahman, Zahari Md. Rodzi. The q-rung orthopair fuzzy-valued neutrosophic sets: Axiomatic properties, aggregation operators and applications[J]. AIMS Mathematics, 2024, 9(2): 5038-5070. doi: 10.3934/math.2024245

    Related Papers:

    [1] Ashraf Al-Quran . T-spherical linear Diophantine fuzzy aggregation operators for multiple attribute decision-making. AIMS Mathematics, 2023, 8(5): 12257-12286. doi: 10.3934/math.2023618
    [2] Shahzaib Ashraf, Huzaira Razzaque, Muhammad Naeem, Thongchai Botmart . Spherical q-linear Diophantine fuzzy aggregation information: Application in decision support systems. AIMS Mathematics, 2023, 8(3): 6651-6681. doi: 10.3934/math.2023337
    [3] Hanan Alohali, Muhammad Bilal Khan, Jorge E. Macías-Díaz, Fahad Sikander . On (p,q)-fractional linear Diophantine fuzzy sets and their applications via MADM approach. AIMS Mathematics, 2024, 9(12): 35503-35532. doi: 10.3934/math.20241685
    [4] Muhammad Bilal Khan, Dragan Pamucar, Mohamed Abdelwahed, Nurnadiah Zamri, Loredana Ciurdariu . Using multi-attribute decision-making technique for the selection of agribots via newly defined fuzzy sets. AIMS Mathematics, 2025, 10(5): 12168-12204. doi: 10.3934/math.2025552
    [5] Attaullah, Shahzaib Ashraf, Noor Rehman, Asghar Khan, Muhammad Naeem, Choonkil Park . Improved VIKOR methodology based on q-rung orthopair hesitant fuzzy rough aggregation information: application in multi expert decision making. AIMS Mathematics, 2022, 7(5): 9524-9548. doi: 10.3934/math.2022530
    [6] Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan . Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making. AIMS Mathematics, 2023, 8(5): 11916-11942. doi: 10.3934/math.2023602
    [7] Sohail Ahmad, Ponam Basharat, Saleem Abdullah, Thongchai Botmart, Anuwat Jirawattanapanit . MABAC under non-linear diophantine fuzzy numbers: A new approach for emergency decision support systems. AIMS Mathematics, 2022, 7(10): 17699-17736. doi: 10.3934/math.2022975
    [8] Muhammad Akram, Sumera Naz, Feng Feng, Ghada Ali, Aqsa Shafiq . Extended MABAC method based on 2-tuple linguistic T-spherical fuzzy sets and Heronian mean operators: An application to alternative fuel selection. AIMS Mathematics, 2023, 8(5): 10619-10653. doi: 10.3934/math.2023539
    [9] Ahmad Bin Azim, Ahmad ALoqaily, Asad Ali, Sumbal Ali, Nabil Mlaiki, Fawad Hussain . q-Spherical fuzzy rough sets and their usage in multi-attribute decision-making problems. AIMS Mathematics, 2023, 8(4): 8210-8248. doi: 10.3934/math.2023415
    [10] Sumbal Ali, Asad Ali, Ahmad Bin Azim, Ahmad ALoqaily, Nabil Mlaiki . Averaging aggregation operators under the environment of q-rung orthopair picture fuzzy soft sets and their applications in MADM problems. AIMS Mathematics, 2023, 8(4): 9027-9053. doi: 10.3934/math.2023452
  • During the transitional phase spanning from the realm of fuzzy logic to the realm of neutrosophy, a multitude of hybrid models have emerged, each surpassing its predecessor in terms of superiority. Given the pervasive presence of indeterminacy in the world, a higher degree of precision is essential for effectively handling imprecision. Consequently, more sophisticated variants of neutrosophic sets (NSs) have been conceived. The key objective of this paper is to introduce yet another variant of NS, known as the q-rung orthopair fuzzy-valued neutrosophic set (q-ROFVNS). By leveraging the extended spatial range offered by q-ROFS, q-ROFVNS enables a more nuanced representation of indeterminacy and inconsistency. Our endeavor commences with the definitions of q-ROFVNS and q-ROFVN numbers (q-ROFVNNs). Then, we propose several types of score and accuracy functions to facilitate the comparison of q-ROFVNNs. Fundamental operations of q-ROFVNSs and some algebraic operational rules of q-ROFVNNs are also provided with their properties, substantiated by proofs and elucidated through illustrative examples. Drawing upon the operational rules of q-ROFVNNs, the q-ROFVN weighted average operator (q-ROFVNWAO) and q-ROFVN weighted geometric operator (q-ROFVNWGO) are proposed. Notably, we present the properties of these operators, including idempotency, boundedness and monotonicity. Furthermore, we emphasize the applicability and significance of the q-ROFVN operators, substantiating their utility through an algorithm and a numerical application. To further validate and evaluate the proposed model, we conduct a comparative analysis, examining its accuracy and performance in relation to existing models.



    Multiple criteria decision-making (MCDM) is the most common method to help decision-makers opt for the most in-demand alternative from a given alternative set, where the MCDM requires ranking all results (alternatives) according to effective mathematical tools to pick the best one(s) in real-world systems. At the forefront of classical MCDM theory, fuzzy sets (FSs), conceptualized by the renowned pioneer Zadeh [1], have emerged as a transformative force. With their unique ability to effectively tackle the challenges posed by ambiguous and misleading information [2,3], fuzzy sets have established themselves as an invaluable tool for navigating the intricacies of complex decision-making processes [4,5,6]. However, there are situations where fuzzy sets alone may not provide an accurate representation of vague and incomplete information in MCDM problems. To address these challenging scenarios effectively, intuitionistic fuzzy sets (IFSs) [7] have been developed. The uncertain data in IFS is portrayed by the form of two membership functions, namely, the membership function (MF) ˆζ and non-membership function (NMF) ˆϖ, and both values fulfill the following condition: ˆζ+ˆϖ<1. Some further expansion and modernization of IFS are portrayed in [8,9,10]. Subsequently, Yager [11] proposed the Pythagorean fuzzy set (PyFS) to make up for the shortcomings of IFS when ˆζ+ˆϖ1. In a simple way, the mechanism of action of PyFS is to square the values of each MF and NMF so that their sum is less than or equal to 1. This model attracted a large number of researchers and prompted them to make many contributions. For instance, in [12,13,14,15] authors conceptualized various measures like distance, similarity, divergence and fuzzy entropy in the PyF environment. Gao and Deng [16] presented PyFSs based on the negation of probability (NP) and applied the NPPyFS into technique for order preference by similarity to ideal solution (TOPSIS). Hussain et al. [17] studied the impact of Aczel-Alsina aggregation operators (AOs) on PyFSs when they developed novel types of PyFAOs by employing the Aczel-Alsina t-norm and Aczel-Alsina t-conorm. Ullah et al. [18] developed complex PyFSs and referred to their applications in pattern recognition. Subsequently, more and more contributions of PyFSs have been discussed by numerous scholars [19,20,21]. In some real-life situations, the handcuffs of the IFS and PyFS structures may be broken where the sum of both MF and NMF exceeds 1, i.e., ˆζ+ˆϖ>1 or the sum of the squares of both MF and NMF exceeds 1. For example, if we take the value (0.7, 0.9), we can simply note that 0.7+0.9>1. To tackle this issue, Yager [22] again constructed an innovative notion called q-ROFS as an acclaimed generalization of both IFS and PyFS structures, with the following standard condition: The sum of the qth powers of MF and NMF is less than or equal to 1. Obviously, we can conclude that q-ROFS is more general than IFS and PyFS and offers a greater degree of flexibility and reliability. Therefore, q-ROFS has been successfully applied to treat obscure data where two or more grounds for doubt arise simultaneously. As a result, Liu and Wang [23] introduced the pioneering q-ROF weighted averaging operator (q-ROFWAO) and the q-ROF weighted geometric operator (q-ROFWGO) as effective tools for handling decision information. They [24] also proposed MADM based on Archimedean T-norm and T-conorm (ATT), Bonferroni mean (BM) operators of a q-ROF environment. Wang et al. [25] utilized ten similarity measures and ten weighted similarity measures between q-ROFSs to deal with MADM problems. Liu et al. [26] coined the cosine similarity measure and a Euclidean distance measure of q‐ROFSs and studied their properties. Dhankhar et al.[27] initially defined the possibility degree-based measurement of q-ROFSs and clarified their theoretical structure. Deveci et al. [28] proposed a q-ROF OPA-RAFSI model to estimate three personal mobility alternative implementation options for autonomous cars in the metaverse. Lin et al. [29] initiated a general form of linguistic q-ROFSs and devised the operational laws, which are the linguistic q-ROF weighted averaging (LqROFWA) operator and the linguistic q-ROF weighted geometric (LqROFWG) operator. Li et al.[30] coined preference relations on q-ROFSs, and based on these preference relations, they built some algorithms for ranking and selecting the MCDM alternatives. Peng et al. [31] defined a new exponential operational law concerning q-ROFNs bases being positive real numbers and the exponents being q-ROFNs and applied it to derive the q-ROF weighted exponential aggregation operator (q-ROFWEAO). Deveci et al. [32] proposed a novel hybrid MCDM model named q-ROF full consistency method (q-ROF FUCOM) and q-ROF combined compromised solution (q-ROF CoCoSo), respectively, for the site picking of an offshore wind farm (OWF). Deveci et al.[33] developed a new approach to combinative distance-based assessment (CODAS)-based q-ROFSs, and this approach has been implemented to deal with the uncertain issues that occur in DM problems. Alnefaie et al. [34] formulated the q-ROFS for algebraic structures, and Habib et al. [35] investigated the formwork q-ROFS graph structures. The relationship between the q-ROFS and complex numbers (CN) was defined by Garg et al. [36] when they discussed several weighted averaging and geometric power aggregation operators for complex q-ROFSs (Cq-ROFSs).

    On the other hand, Smarandache [37] came up with the idea of the NSs, which expand the MF and NMF of FS, IFS and PyFS in order to handle the MADM issues that have uncertain, incomplete and indeterminate decision information. The notion of NSs is summarized by terms namely, MF, NMF, and, in addition, the indeterminacy term (IMF) with the following condition: The sum of these terms is equal to or limited to three, so it can describe the real-life data more constitutionally and accurately. Due to these features that characterize the concept of NSs, NSs have been extensively studied by several researchers in the academic environment around the world, where it has invaded all mathematical sciences branches. For example, in neutrosophic statistics, it represents sample sizes and control chart design constants as neutrosophic numbers, while in neutrosophic algebra many algebraic concepts have appeared, such as the neutrosophic subgroup and group and the neutrosophic ring, whose operations and axioms are partially MF, partially IMF and partially NMF. In neutrosophic possibility, every neutrosophic term (MF, IMF, and NMF) has a possibility degree. However, from a precise scientific perspective, some weaknesses appear when applying NSs to common data analysis in many daily life scenarios. To overcome this issue, Ye [38] proposed the idea of simplified neutrosophic sets (SNSs), which are considered a sub-class form of NSs, and introduced some AOs, including a SN-weighted arithmetic average (SNWAA) operator and a SN-weighted geometric average operator (SNWGA). Mishra et al. [39] presented MCDM using the NS environment. Ali and Smarandache [40] expanded three NS memberships from a real to a complex environment. Building upon their work, Al-Quran et al. [41,42] have further expanded NS by introducing Q-complex neutrosophic sets and fuzzy parameterized complex neutrosophic soft expert sets within the same environment. Expanding on these advancements, Al-Sharqi et al. [43] combined both NS and soft sets under the interval complex value. Karabasevi et al. [44] developed a novel extension of the TOPSIS method using NSs. Abdel-Basset et al. [45] suggested a neutrosophic MCDM (NMCDM) approach to assist patients and physicians in determining if a patient is suffering from heart failure. Jana and Pal [46] introduced a new aggregation operator of SVNSNs and utilized this operator to address medical diagnosis problems. Further, Ji et al. [47] studied the Frank normalized prioritized Bonferroni mean (FNPBM) under NS environment and defined some NS interaction FNPBM operators to solve MADM problems. Xu et al. [48] developed the neutrosophic TODIM method. Hu et al. [49] developed the local and global threshold criteria with the SVNS domain. Ye [50] extended the triangular NS to the trapezoidal NS, in which its main three characteristics (MF, NMF and IMF) are trapezoidal neutrosophic numbers rather than triangular neutrosophic numbers. Kaur and Garg [51] presented AOs based on generalized linguistic neutrosophic cubic weighted averages (GLNCWA) and generalized linguistic neutrosophic cubic weighted geometric using Archimedean norms. Jana et al. [52] further defined the score and accuracy functions on the interval trapezoidal neutrosophic set (ITNS), and then they defined the ITN-number weighted arithmetic averaging (ITNNWAA) operator and the ITN-number weighted geometric averaging (ITNNWGA) operator, along with their applications in real-life scenarios. Recently, a lot of emphasis has been placed on incorporating the features of NSs, IFSs and PyFs to increase accuracy and improve AOs to address data inaccuracies. Bhowmik and Pal [53] initiated the IFVNS and its operators with the condition that the sum of its MFs is less than or equal to two. Then, Unver et al. [54] redefined the IFVNS, when they defined the IF neutrosophic multi-sets (IFNMSs). They also presented some algebraic operations between IFVNSs in order to develop several AOs. Palanikumar et al. [55] discussed a new generalization of Pythagorean neutrosophic normal interval-valued weighted geometric (PNNIVWG) and obtained an algorithm that tackles the alternatives in MADM problems entrenched in these operators. Chellamani and Ajay [56] proposed several basic graphical ideas employing the Dombi operator within Pythagorean neutrosophic fuzzy graphs (PyNFG). Ajay and Chellamani [57] utilized soft parameters for the MCDM scenario under a PyFVNS environment. Palanikumar and Arulmozhi [58] developed a new approach to AOs using parameterized factors in the PyFVNS environment, and they proposed a score function based on aggregating of both TOPSIS and VIKOR techniques. Rajan and Krishnaswamy [59] developed clustering methods based on similarity measures between PyFVNSs. Siraj et al. [60] provoked the concept of a Pym-polar FNs (PmFNSs) for managing data that contains multi-polar facts. Lately, Bozyigit et al. [61] have redefined the PyFVNS, where each component of the NS encompasses a PyFVS under the condition: ˆζ2+ˆϖ21. However, the scope of IFVNSs and PyFVNSs is restricted because their capability is limited to addressing decision making problems where the evaluation values are represented using IF and PyF values, and these values are insufficient to fully convey the actual decision-related information. In this article, we broaden the scope of the notions of IFVNSs and PyFVNSs by incorporating the q-ROF values to the construction of the SNS. It is important to highlight that as the rung q increases, the range of acceptable orthopairs expands, and a greater number of orthopairs meet the bounding constraint. Consequently, by utilizing q-ROF values, we are able to represent a broader spectrum of fuzzy information. Hence, this paper introduces several key contributions.

    (1) The concept of the q-ROFVNS is introduced, which extends and incorporates the principles of previously published neutrosophic set-like literature.

    (2) The q-ROFVNWAO and q-ROFVNWGO are investigated by leveraging the operational laws of q-ROFVNNs.

    (3) The ranking is accomplished using various types of SFs and AFs.

    (4) An MADM problem is tackled by utilizing q-ROFVNNs and incorporating the q-ROFVNWAO and q-ROFVNWGO.

    (5) Through comparative analysis, geometric interpretations are presented to demonstrate the benefits of the proposed approaches.

    The subsequent sections of this manuscript are succinctly delineated as follows: Section 2 encompasses an exhaustive appraisal of the fundamental underpinnings surrounding the IFS, PyFS, q-ROFS, NS, SNS, IFVNS, and PyFVNS. Section 3, in its entirety, expounds upon the meticulous definition of the q-ROFVNS and delves into a comprehensive examination of its fundamental and algebraic operations. Furthermore, a multitude of diverse categories of SFs and AFs are meticulously introduced within this section. Section 4, on the other hand, engenders the conceptualization of the q-ROFVNWAO and q-ROFVNWGO, accompanied by an extensive discourse on their inherent properties. Notably, Section 5 unveils an exemplary MADM methodology that effectively harnesses the proposed operators. A compelling illustrative example is also presented here to vividly showcase the practical application of the proposed models. Section 6 culminates in a comprehensive comparative analysis meticulously elucidating the unequivocal superiority of the proposed methodologies. In the ultimate Section 7, conclusive remarks are expounded, encapsulating the key findings and outcomes.

    A few elementary terms are recalled from previously published papers in this part. The symbols ˆ and ˆΔ will represent [0, 1] and the universal set, respectively, throughout the paper.

    Definition 2.1. [7] An IFS ˆΞ is defined on ˆΔ as

    ˆΞ={(ˆδ,ˆζˆΞ(ˆδ),ˆϖˆΞ(ˆδ)):ˆδˆΔ},

    where ˆζˆΞ and ˆϖˆΞˆ are, respectively, the MF and NMF, such that 0ˆζˆΞ(ˆδ)+ˆϖˆΞ(ˆδ)1, ˆδˆΔ.

    Definition 2.2. [11] The PyFS ˆA in ˆΔ is formalized as

    ˆA={(ˆδ,ˆζˆA(ˆδ),ˆϖˆA(ˆδ)):ˆδˆΔ},

    where ˆζˆA:ˆΔˆ denotes the MF and ˆϖˆA:ˆΔˆ denotes the NMF with the condition that 0(ˆζˆA(ˆδ))2+(ˆϖˆA(ˆδ))21.

    Definition 2.3. [22] The q-ROFS ˆΛ on ˆΔ is expressed as

    ˆΛ={(ˆδ,ˆζˆΛ(ˆδ),ˆϖˆΛ(ˆδ)):ˆδˆΔ},

    where ˆζˆΛ(ˆδ) and ˆϖˆΛ(ˆδ) lie in ˆ under the condition 0(ˆζˆΛ(ˆδ))q+(ˆϖˆΛ(ˆδ))q1 (q1),ˆδˆΔ. The hesitancy part is given by: λˆΛ(ˆδ)=((ˆζˆΛ(ˆδ))q+(ˆϖˆΛ(ˆδ))q(ˆζˆΛ(ˆδ))q(ˆϖˆΛ(ˆδ))q)1/q.

    Definition 2.4. [37] A NS ˆM in ˆΔ is a structure of the form

    ˆM={<ˆδ;TˆM(ˆδ),IˆM(ˆδ),FˆM(ˆδ)>:ˆδˆΔ},

    where the mappings TˆM; IˆM; FˆM:ˆΔ]0;1+[ represent the MF, IMF and NMF functions, respectively, with 0TˆM+IˆM+FˆM3+.

    Definition 2.5. [38] A SNS ˆN in ˆΔ with a generic element u in ˆΔ is characterized as.

    ˆN={<ˆδ;TˆN(ˆδ),IˆN(ˆδ),FˆN(ˆδ)>:ˆδˆΔ},

    where the mappings TˆN; IˆN; FˆN:ˆΔˆ represent the MF, IMF and NMF functions, respectively, with 0TˆN+IˆN+FˆN3.

    This part exhibits the formal definitions of q-ROFVNS and q-ROFVNN, along with score functions (SF) of q-ROFVNN. Then, the basic and algebraic operations of q-ROFVNS are provided in the following parts.

    Definition 3.1. A q-ROFVNS S over ˆΔ is signified by S={ˆδ,TS,IS,FS:ˆδˆΔ}, where TS,IS and FS represent the membership, indeterminacy membership and non-membership neutrosophic values. Each of them is a q-rung orthopair fuzzy value, where ˆδˆΔ,q1, TS=(ˆζS,T(ˆδ),ˆϖS,T(ˆδ)) such that ˆζS,T(ˆδ),ˆϖS,T(ˆδ)ˆ, subject to the condition (ˆζS,T(ˆδ))q+(ˆϖS,T(ˆδ))q1, IS=(ˆζS,I(ˆδ),ˆϖS,I(ˆδ)) such that ˆζS,I(ˆδ),ˆϖS,I(ˆδ)ˆ, subject to the condition (ˆζS,I(ˆδ))q+(ˆϖS,I(ˆδ))q1, FS=(ˆζS,F(ˆδ),ˆϖS,F(ˆδ)) such that ˆζS,F(ˆδ),ˆϖS,F(ˆδ)ˆ, subject to the condition (ˆζS,F(ˆδ))q+(ˆϖS,F(ˆδ))q1. By definition, 0TS+IS+FS3. A q-ROFVNS S over ˆΔ can be written as.

    S={ˆδ,(ˆζS,T(ˆδ),ˆϖS,T(ˆδ)),(ˆζS,I(ˆδ),ˆϖS,I(ˆδ)),(ˆζS,F(ˆδ),ˆϖS,F(ˆδ)):ˆδˆΔ}.

    Definition 3.2. A collection of Γ=(ˆζT,ˆϖT),(ˆζI,ˆϖI),(ˆζF,ˆϖF) is called a q-ROFVN number (q-ROFVNN) with (ˆζT)q+(ˆϖT)q1, (ˆζI)q+(ˆϖI)q1 and (ˆζF)q+(ˆϖF)q1, (q1).

    Example 3.3. Suppose ˆΔ={u1,u2,u3}. Then,

    S={u1,(0.7,0.9),(0.1,0.8),(0.7,0.6),u2,(0.2,0.5),(0.3,0.8),(0.8,0.6),u3,(0.8,0.9),(0.3,0.8),(0.5,0.6)}

    is a q-ROFVNS (q=5).

    Remark 3.4. Some particular cases are as follows

    (1) When q=2, a q-ROFVNN S becomes a PyFVNN.

    (2) When q=1, a q-ROFVNN S becomes an IFVNN.

    Definition 3.5. Let S={ˆδ,(ˆζS,T(ˆδ),ˆϖS,T(ˆδ)),(ˆζS,I(ˆδ),ˆϖS,I(ˆδ)),(ˆζS,F(ˆδ),ˆϖS,F(ˆδ)):ˆδˆΔ} be a q-ROFVNS over ˆΔ. S is said to be an absolute q-ROFVNS denoted by SΨ if ˆζS,T(ˆδ)=ˆϖS,I(ˆδ)=ˆϖS,F(ˆδ)=1 and ˆϖS,T(ˆδ)=ˆζS,I(ˆδ)=ˆζS,F(ˆδ)=0, i.e., SΨ=(1,0),(0,1),(0,1), ˆδˆΔ.

    Definition 3.6. Let S={ˆδ,(ˆζS,T(ˆδ),ˆϖS,T(ˆδ)),(ˆζS,I(ˆδ),ˆϖS,I(ˆδ)),(ˆζS,F(ˆδ),ˆϖS,F(ˆδ)):ˆδˆΔ} be a q-ROFVNS over ˆΔ. S is said to be a null q-ROFVNS denoted by SΦ if ˆζS,T(ˆδ)=ˆϖS,I(ˆδ)=ˆϖS,F(ˆδ)=0 and ˆϖS,T(ˆδ)=ˆζS,I(ˆδ)=ˆζS,F(ˆδ)=1, i.e., SΦ=(0,1),(1,0),(1,0), ˆδˆΔ.

    In this section, we define the SF, accuracy function (AF), quadratic SF (QSF) and QAF.

    Definition 3.7. Let Γ=(ˆζT,ˆϖT),(ˆζI,ˆϖI),(ˆζF,ˆϖF) be q-ROFVNN. Then, the SF on Γ is signified by the mapping Π:qROFVNN(ˆΔ)[1,1] and defined as

    ΠΓ=Π(Γ)=13[[(ˆζT)q(ˆϖT)q][(ˆζI)q(ˆϖI)q][(ˆζF)q(ˆϖF)q]],q1. (1)

    qROFVNN(ˆΔ) is the collection of q-ROFVNNs on ˆΔ.

    Definition 3.8. The AF is signified by the mapping :qROFVNN(ˆΔ)ˆ and defined as

    2Γ=(Γ)=16[[(ˆζT)q+(ˆϖT)q]+[(ˆζI)q+(ˆϖI)q]+[(ˆζF)q+(ˆϖF)q]],q1. (2)

    qROFVNN(ˆΔ) is the collection of q-ROFVNNs on ˆΔ.

    Definition 3.9. Let Γ1 and Γ2 be two q-ROFVNNs.

    (1) If ΠΓ1<ΠΓ2, then Γ1<Γ2.

    (2) If ΠΓ1>ΠΓ2, then Γ1>Γ2.

    (3) If ΠΓ1=ΠΓ2 and Γ1<Γ2, then Γ1<Γ2.

    (4) If ΠΓ1=ΠΓ2 and Γ1>Γ2, then Γ1>Γ2.

    Definition 3.10. Let Γ=(ˆζT,ˆϖT),(ˆζI,ˆϖI),(ˆζF,ˆϖF) be a q-ROFVNN. Then, the QSF on Γ is determined by the mapping Ω:qROFVNN(ˆΔ)[1,1] and defined as

    OmegaΓ=Ω(Γ)=13[[(ˆζT)2q(ˆϖT)2q][(ˆζI)2q(ˆϖI)2q][(ˆζF)2q(ˆϖF)2q]],q1. (3)

    qROFVNN(ˆΔ) is the collection of q-ROFVNNs on ˆΔ.

    Definition 3.11. The QAF is signified by the mapping :qROFVNN(ˆΔ)ˆ and defined as

    4Γ=(Γ)=16[[(ˆζT)2q+(ˆϖT)2q]+[(ˆζI)2q+(ˆϖI)2q]+[(ˆζF)2q+(ˆϖF)2q]],q1. (4)

    qROFVNN(ˆΔ) is the collection of q-ROFVNNs on ˆΔ.

    Definition 3.12. Let Γ1 and Γ2 be two q-ROFVNNs.

    (1) If ΩΓ1<ΩΓ2, then Γ1<Γ2.

    (2) If ΩΓ1>ΩΓ2, then Γ1>Γ2.

    (3) If ΩΓ1=ΩΓ2 and Γ1<Γ2, then Γ1<Γ2.

    (4) If ΩΓ1=ΩΓ2 and Γ1>Γ2, then Γ1>Γ2.

    In order to present the basic operations on q-ROFVNS, we suppose that H, G are two q-ROFVNSs over ˆΔ, where H={ˆδ,TH,IH,FH:ˆδˆΔ}={ˆδ,(ˆζH,T(ˆδ),ˆϖH,T(ˆδ)),(ˆζH,I(ˆδ),ˆϖH,I(ˆδ)),(ˆζH,F(ˆδ),ˆϖH,F(ˆδ)):ˆδˆΔ}, and G={ˆδ,TG,IG,FG:ˆδˆΔ},={ˆδ,(ˆζG,T(ˆδ),ˆϖG,T(ˆδ)),(ˆζG,I(ˆδ),ˆϖG,I(ˆδ)),(ˆζG,F(ˆδ),ˆϖG,F(ˆδ)):ˆδˆΔ}.

    Definition 3.13. Let H, G be two q-ROFVNSs over ˆΔ. Then, H is a subset of G, denoted by HG if and only if.

    THqTG, i.e., ˆζH,T(ˆδ)ˆζG,T(ˆδ) and ˆϖH,T(ˆδ)ˆϖG,T(ˆδ),

    IHqIG, i.e., ˆζH,T(ˆδ)ˆζG,I(ˆδ) and ˆϖH,I(ˆδ)ˆϖG,I(ˆδ),

    FHqFG, i.e., ˆζH,F(ˆδ)ˆζG,F(ˆδ) and ˆϖH,F(ˆδ)ˆϖG,F(ˆδ). In this definition q represents the q-rung orthopair fuzzy subset.

    Definition 3.14. Let H, G be two q-ROFVNSs over ˆΔ. Then, H is equal to G, denoted by H=G if and only if.

    TH=TG, i.e., ˆζH,T(ˆδ)=ˆζG,T(ˆδ) and ˆϖH,T(ˆδ)=ˆϖG,T(ˆδ),

    IH=IG, i.e., ˆζH,T(ˆδ)=ˆζG,I(ˆδ) and ˆϖH,I(ˆδ)=ˆϖG,I(ˆδ),

    FH=FG, i.e., ˆζH,F(ˆδ)=ˆζG,F(ˆδ) and ˆϖH,F(ˆδ)=ˆϖG,F(ˆδ).

    Definition 3.15. Let H be a q-ROFVNS over ˆΔ. Then, the complement of H is denoted by (H)c and defined as (H)c={ˆδ,FH,(IH)cq,TH:ˆδˆΔ}, where cq is a q-ROF-complement, and (IH)cq=(ˆϖH,I(ˆδ),ˆζH,I(ˆδ)).

    Definition 3.16 Let H and G be two q-ROFVNSs over ˆΔ. The union of H and G is denoted by (HG) and defined as: (HG)={ˆδ,THqTG,IHqIG,FHqFG:ˆδˆΔ}, where q is the q-ROF-union, q is the q-ROF-intersection, and

    THqTG=((ˆζH,T(ˆδ)ˆζG,T(ˆδ)),(ˆϖH,T(ˆδ)ˆϖG,T(ˆδ))),

    IHqIG=((ˆζH,I(ˆδ)ˆζG,I(ˆδ)),(ˆϖH,I(ˆδ)ˆϖG,I(ˆδ))),

    FHqFG=((ˆζH,F(ˆδ)ˆζG,F(ˆδ)),(ˆϖH,F(ˆδ)ˆϖG,F(ˆδ))).

    =max,   =min.

    Definition 3.17. Let H and G be two q-ROFVNSs over ˆΔ. The intersection of H and G is denoted by (HG) and defined as (HG)={ˆδ,THqTG,IHqIG,FHqFG:ˆδˆΔ}, where q is the q-ROF-union, q is the q-ROF-intersection, and

    THqTG=((ˆζH,T(ˆδ)ˆζG,T(ˆδ)),(ˆϖH,T(ˆδ)ˆϖG,T(ˆδ))),

    IHqIG=((ˆζH,I(ˆδ)ˆζG,I(ˆδ)),(ˆϖH,I(ˆδ)ˆϖG,I(ˆδ))),

    FHqFG=((ˆζH,F(ˆδ)ˆζG,F(ˆδ)),(ˆϖH,F(ˆδ)ˆϖG,F(ˆδ))).

    =max,   =min.

    Example 3.18. If ˆΔ={u1,u2} such that

    H={u1,(0.7,0.9),(0.1,0.8),(0.7,0.6),u2,(0.2,0.5),(0.3,0.8),(0.8,0.6)}

    and

    G={u1,(0.3,0.9),(0.5,0.7),(0.9,0.6),u2,(0.1,0.7),(0.2,0.8),(0.9,0.7)}

    are two q-ROFVNSs, then

    (1) (H)c={u1,(0.7,0.6),(0.8,0.1),(0.7,0.9),u2,(0.8,0.6),(0.8,0.3),(0.2,0.5)},

    (2) (HG)={u1,(0.7,0.9),(0.1,0.8),(0.7,0.6),u2,(0.2,0.5),(0.2,0.8),(0.8,0.7)},

    (3) (HG)={u1,(0.3,0.9),(0.5,0.7),(0.9,0.6),u2,(0.1,0.7),(0.3,0.8),(0.9,0.6)}.

    Proposition 3.19. Let H={ˆδ,TH,IH,FH:ˆδˆΔ}, G={ˆδ,TG,IG,FG:ˆδˆΔ} and K={ˆδ,TK,IK,FK:ˆδˆΔ} be three q-ROFVNSs. Then, the following properties hold:

    (1)(HG)K=H(GK). (5)
    (2)(HG)K=H(GK). (6)
    (3)H(GK)=(HG)(HK). (7)
    (4)H(GK)=(HG)(HK). (8)
    (5)(HG)c=(H)c(G)c. (9)
    (6)(HG)c=(H)c(G)c. (10)

    Proof. We will prove properties (5) and (6) as the proof of the remaining properties is trivial.

    (5) For the left side, we have (HG)={ˆδ,THqTG,IHqIG,FHqFG:ˆδˆΔ}. According to Definition 3.16, we have

    (HG)c={ˆδ,FHqFG,(IHqIG)cq,THqTG:ˆδˆΔ}

    ={ˆδ,FHqFG,(IH)cqq(IG)cq,THqTG:ˆδˆΔ},

    =(H)c(G)c

    (6) For the left side, we have (HG)={ˆδ,THqTG,IHqIG,FHqFG:ˆδˆΔ}. According to Definition 3.17, we have

    (HG)c={ˆδ,FHqFG,(IHqIG)cq,THqTG:ˆδˆΔ}.

    ={ˆδ,FHqFG,(IH)cqq(IG)cq,THqTG:ˆδˆΔ},

    =(H)c(G)c.

    In this part, we present some algebraic operations for q-ROFVNNs.

    Definition 3.20. Let Γ1=( 1ˆζT, 1ˆϖT),( 1ˆζI, 1ˆϖI),( 1ˆζF, 1ˆϖF) and Γ2=( 2ˆζT, 2ˆϖT),( 2ˆζI, 2ˆϖI),( 2ˆζF, 2ˆϖF) be two q-ROFVNNs over ˆΔ and Θ>0. Then,

    (1)Γ1Γ2=(( ( 1ˆζT)q+( 2ˆζT)q ( 1ˆζT)q ( 2ˆζT)q )1q, 1ˆϖT 2ˆϖT),( 1ˆζI 2ˆζI,( ( 1ˆϖI)q+( 2ˆϖI)q ( 1ˆϖI)q ( 2ˆϖI)q )1q),( 1ˆζF 2ˆζF,( ( 1ˆϖF)q+( 2ˆϖF)q ( 1ˆϖF)q ( 2ˆϖF)q )1q). (11)
    (2)Γ1Γ2=( 1ˆζT 2ˆζT,( ( 1ˆϖT)q+( 2ˆϖT)q ( 1ˆϖT)q ( 2ˆϖT)q )1q),( ( 1ˆζI)q+( 2ˆζI)q ( 1ˆζI)q ( 2ˆζI)q )1q, 1ˆϖI 2ˆϖI),( ( 1ˆζF)q+( 2ˆζF)q ( 1ˆζF)q ( 2ˆζF)q )1q, 1ˆϖF 2ˆϖF). (12)
    (3)ΘΓ1= ((1(1 ( 1ˆζT)q)Θ)1q,( 1ˆϖT)Θ ),(( 1ˆζI)Θ,(1(1 ( 1ˆϖI)q)Θ)1q),(( 1ˆζF)Θ,(1(1 ( 1ˆϖF)q)Θ)1q). (13)
    (4)(Γ1)Θ=(( 1ˆζT)Θ,(1(1 ( 1ˆϖT)q)Θ)1q),((1(1 ( 1ˆζI)q)Θ)1q,( 1ˆϖI)Θ ),((1(1 ( 1ˆζF)q)Θ)1q,( 1ˆϖF)Θ ). (14)

    Example 3.21. Suppose Γ1=(0.7,0.8),(0.6,0.7),(0.4,0.8) and Γ2=(0.6,0.9),(0.4,0.9),(0.7,0.6) are two 3-ROFVNNs, and Θ=4. Then,

    (1) Γ1Γ2=(0.79,0.72),(0.24,0.94),(0.28,0.85),

    (2) Γ1Γ2=(0.42,0.95),(0.64,0.63),(0.73,0.48),

    (3) ΘΓ1=(0.93,0.41),(0.13,0.93),(0.03,0.98),

    (4) (Γ1)Θ=(0.24,0.98),(0.85,0.24),(0.61,0.41).

    Proposition 3.22. Let Γ1=( 1ˆζT, 1ˆϖT),( 1ˆζI, 1ˆϖI),( 1ˆζF, 1ˆϖF), Γ2=( 2ˆζT, 2ˆϖT),( 2ˆζI, 2ˆϖI),( 2ˆζF, 2ˆϖF) and Γ3=( 3ˆζT, 3ˆϖT),( 3ˆζI, 3ˆϖI),( 3ˆζF, 3ˆϖF) be three q-ROFVNNs over ˆΔ and Θ>0. Then, the following properties hold:

    (1)(Γ1Γ2)Γ3=Γ1(Γ2Γ3). (15)
    (2)(Γ1Γ2)Γ3=Γ1(Γ2Γ3). (16)
    (3)Θ(Γ1Γ2)=ΘΓ1ΘΓ2. (17)
    (4)(Γ1Γ2)Θ=ΓΘ1ΓΘ2. (18)

    Proof. We will prove properties (3) and (4) as the proof of the remaining properties is trivial.

    (3) Based on Definition 3.20 (items (1) and (3)), we have for the right side of the equation

    Θ(Γ1Γ2)=Θ((( ( 1ˆζT)q+( 2ˆζT)q ( 1ˆζT)q ( 2ˆζT)q )1q, 1ˆϖT 2ˆϖT),( 1ˆζI 2ˆζI,( ( 1ˆϖI)q+( 2ˆϖI)q ( 1ˆϖI)q ( 2ˆϖI)q )1q),( 1ˆζF 2ˆζF,( ( 1ˆϖF)q+( 2ˆϖF)q ( 1ˆϖF)q ( 2ˆϖF)q )1q)),
    =([1[1[( ( 1ˆζT)q+( 2ˆζT)q ( 1ˆζT)q ( 2ˆζT)q )1q]q]Θ]1q,( 1ˆϖT)Θ( 2ˆϖT)Θ),(( 1ˆζI)Θ( 2ˆζI)Θ,[1[1[( ( 1ˆϖI)q+( 2ˆϖI)q ( 1ˆϖI)q ( 2ˆϖI)q )1q]q]Θ]1q),(( 1ˆζF)Θ( 2ˆζF)Θ,[1[1[( ( 1ˆϖF)q+( 2ˆϖF)q ( 1ˆϖF)q ( 2ˆϖF)q )1q]q]Θ]1q),
    =([1[1[ ( 1ˆζT)q+( 2ˆζT)q ( 1ˆζT)q ( 2ˆζT)q ]]Θ]1q,( 1ˆϖT)Θ( 2ˆϖT)Θ),(( 1ˆζI)Θ( 2ˆζI)Θ,[1[1[ ( 1ˆϖI)q+( 2ˆϖI)q ( 1ˆϖI)q ( 2ˆϖI)q ]]Θ]1q),(( 1ˆζF)Θ( 2ˆζF)Θ,[1[1[ ( 1ˆϖF)q+( 2ˆϖF)q ( 1ˆϖF)q ( 2ˆϖF)q ]]Θ]1q),
    = ([1(1( 1ˆζT)q )Θ (1( 2ˆζT)q )Θ]1q,( 1ˆϖT)Θ ( 2ˆϖT )Θ ),( ( 1ˆζI)Θ ( 2ˆζI )Θ,[1(1( 1ˆϖI)q )Θ (1( 2ˆϖI )q )Θ]1q ),( ( 1ˆζF)Θ ( 2ˆζF )Θ,[1(1( 1ˆϖF )q)Θ (1( 2ˆϖF )q )Θ]1q ) .

    For the right side of the equation, we have

    ΘΓ1= ((1(1 ( 1ˆζT)q)Θ)1q,( 1ˆϖT)Θ ),(( 1ˆζI)Θ,(1(1 ( 1ˆϖI)q)Θ)1q),(( 1ˆζF)Θ,(1(1 ( 1ˆϖF)q)Θ)1q),
    ΘΓ2= ((1(1 ( 2ˆζT)q)Θ)1q,( 2ˆϖT)Θ ),(( 2ˆζI)Θ,(1(1 ( 2ˆϖI)q)Θ)1q),(( 2ˆζF)Θ,(1(1 ( 2ˆϖF)q)Θ)1q),
    ΘΓ1ΘΓ2= (([(1(1 ( 1ˆζT)q)Θ)1q]q+[(1(1 ( 2ˆζT)q)Θ)1q]q[(1(1 ( 1ˆζT)q)Θ)1q]q[(1(1 ( 2ˆζT)q)Θ)1q]q)1q,( 1ˆϖT)Θ( 2ˆϖT)Θ),(( 1ˆζI)Θ( 2ˆζI)Θ, ([(1(1 ( 1ˆϖI)q)Θ)1q]q+[(1(1 ( 2ˆϖI)q)Θ)1q]q[(1(1 ( 1ˆϖI)q)Θ)1q]q[(1(1 ( 2ˆϖI)q)Θ)1q]q)1q),(( 1ˆζF)Θ( 2ˆζF)Θ, ([(1(1 ( 1ˆϖF)q)Θ)1q]q+[(1(1 ( 2ˆϖF)q)Θ)1q]q[(1(1 ( 1ˆϖF)q)Θ)1q]q[(1(1 ( 2ˆϖF)q)Θ)1q]q)1q),
    = ((1(1 ( 1ˆζT)q)Θ+1(1 ( 2ˆζT)q)Θ[1(1 ( 1ˆζT)q)Θ][1(1 ( 2ˆζT)q)Θ])1q,( 1ˆϖT)Θ( 2ˆϖT)Θ),(( 1ˆζI)Θ( 2ˆζI)Θ, (1(1 ( 1ˆϖI)q)Θ+1(1 ( 2ˆϖI)q)Θ[1(1 ( 1ˆϖI)q)Θ][1(1 ( 2ˆϖI)q)Θ])1q),(( 1ˆζF)Θ( 2ˆζF)Θ, (1(1 ( 1ˆϖF)q)Θ+1(1 ( 2ˆϖF)q)Θ[1(1 ( 1ˆϖF)q)Θ][1(1 ( 2ˆϖF)q)Θ])1q),
    = ([1(1( 1ˆζT)q )Θ (1( 2ˆζT)q )Θ]1q,( 1ˆϖT)Θ ( 2ˆϖT )Θ ),( ( 1ˆζI)Θ ( 2ˆζI )Θ,[1(1( 1ˆϖI)q )Θ (1( 2ˆϖI )q )Θ]1q ),( ( 1ˆζF)Θ ( 2ˆζF )Θ,[1(1( 1ˆϖF )q)Θ (1( 2ˆϖF )q )Θ]1q ) .

    Thus, the right side of the equation equals the left side, which proves that Θ(Γ1Γ2)=ΘΓ1ΘΓ2. (4) Based on Definition 3.20 (item (2) and item (4)), we have for the right side of the equation

    (Γ1Γ2)Θ=(( 1ˆζT 2ˆζT,( ( 1ˆϖT)q+( 2ˆϖT)q ( 1ˆϖT)q ( 2ˆϖT)q )1q),( ( 1ˆζI)q+( 2ˆζI)q ( 1ˆζI)q ( 2ˆζI)q )1q, 1ˆϖI 2ˆϖI),( ( 1ˆζF)q+( 2ˆζF)q ( 1ˆζF)q ( 2ˆζF)q )1q, 1ˆϖF 2ˆϖF))Θ,
    =(( 1ˆζT)Θ( 2ˆζT)Θ,[1[1[( ( 1ˆϖT)q+( 2ˆϖT)q ( 1ˆϖT)q ( 2ˆϖT)q )1q]q]Θ]1q),([1[1[( ( 1ˆζI)q+( 2ˆζI)q ( 1ˆζI)q ( 2ˆζI)q )1q]q]Θ]1q,( 1ˆϖI)Θ( 2ˆϖI)Θ),([1[1[( ( 1ˆζF)q+( 2ˆζF)q ( 1ˆζF)q ( 2ˆζF)q )1q]q]Θ]1q,( 1ˆϖF)Θ( 2ˆϖF)Θ),
    =(( 1ˆζT)Θ( 2ˆζT)Θ,[1[1[ ( 1ˆϖT)q+( 2ˆϖT)q ( 1ˆϖT)q ( 2ˆϖT)q ]]Θ]1q),([1[1[ ( 1ˆζI)q+( 2ˆζI)q ( 1ˆζI)q ( 2ˆζI)q ]]Θ]1q,( 1ˆϖI)Θ( 2ˆϖI)Θ),([1[1[ ( 1ˆζF)q+( 2ˆζF)q ( 1ˆζF)q ( 2ˆζF)q ]]Θ]1q,( 1ˆϖF)Θ( 2ˆϖF)Θ),
    = (( 1ˆζT)Θ ( 2ˆζT )Θ,[1(1( 1ˆϖT)q )Θ (1( 2ˆϖT)q )Θ]1q ),( [1(1( 1ˆζI)q )Θ (1( 2ˆζI )q )Θ]1q,( 1ˆϖI)Θ ( 2ˆϖI )Θ ),( [1(1( 1ˆζF)q )Θ (1( 2ˆζF )q )Θ]1q,( 1ˆϖF)Θ ( 2ˆϖF )Θ ), .

    For the right side of the equation, we have

    (Γ1)Θ=(( 1ˆζT)Θ,(1(1 ( 1ˆϖT)q)Θ)1q),((1(1 ( 1ˆζI)q)Θ)1q,( 1ˆϖI)Θ ),((1(1 ( 1ˆζF)q)Θ)1q,( 1ˆϖF)Θ),
    (Γ2)Θ=(( 2ˆζT)Θ,(1(1 ( 2ˆϖT)q)Θ)1q),((1(1 ( 2ˆζI)q)Θ)1q,( 2ˆϖI)Θ ),((1(1 ( 2ˆζF)q)Θ)1q,( 2ˆϖF)Θ ),
    ΓΘ1ΓΘ2= (( 1ˆζT)Θ( 2ˆζT)Θ,([(1(1 ( 1ˆϖT)q)Θ)1q]q+[(1(1 ( 2ˆϖT)q)Θ)1q]q[(1(1 ( 1ˆϖT)q)Θ)1q]q[(1(1 ( 2ˆϖT)q)Θ)1q]q)1q),( ([(1(1 ( 1ˆζI)q)Θ)1q]q+[(1(1 ( 2ˆζI)q)Θ)1q]q[(1(1 ( 1ˆζI)q)Θ)1q]q[(1(1 ( 2ˆζI)q)Θ)1q]q)1q,( 1ˆϖI)Θ( 2ˆϖI)Θ),( ([(1(1 ( 1ˆζF)q)Θ)1q]q+[(1(1 ( 2ˆζF)q)Θ)1q]q[(1(1 ( 1ˆζF)q)Θ)1q]q[(1(1 ( 2ˆζF)q)Θ)1q]q)1q,( 1ˆϖF)Θ( 2ˆϖF)Θ),
    = (( 1ˆζT)Θ( 2ˆζT)Θ,(1(1 ( 1ˆϖT)q)Θ+1(1 ( 2ˆϖT)q)Θ[1(1 ( 1ˆϖT)q)Θ][1(1 ( 2ˆϖT)q)Θ]1q)),( (1(1 ( 1ˆζI)q)Θ+1(1 ( 2ˆζI)q)Θ[1(1 ( 1ˆζI)q)Θ][1(1 ( 2ˆζI)q)Θ])1q,( 1ˆϖI)Θ( 2ˆϖI)Θ),( (1(1 ( 1ˆζF)q)Θ+1(1 ( 2ˆζF)q)Θ[1(1 ( 1ˆζF)q)Θ][1(1 ( 2ˆζF)q)Θ])1q,( 1ˆϖF)Θ( 2ˆϖF)Θ),
    =((1ˆζT)Θ(2ˆζT)Θ,[1(1(1ˆϖT)q)Θ(1(2ˆϖT)q)Θ]1q),([1(1(1ˆζI)q)Θ(1(2ˆζI)q)Θ]1q,(1ˆϖI)Θ(2ˆϖI)Θ),([1(1(1ˆζF)q)Θ(1(2ˆζF)q)Θ]1q,(1ˆϖF)Θ(2ˆϖF)Θ).

    This proves that (Γ1Γ2)Θ=ΓΘ1ΓΘ2.

    Based on the algebraic operations of q-ROFVNNs, we go on with aggregation operators of q-ROFVNSs.

    Here, we define the q-ROFVNWA operator and discuss its properties.

    Definition 4.1. Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a set of q-ROFVNNs. The q-ROFVNWA operator is characterized by the transformation qROFVNWA:qROFVNN(ˆΔ)qROFVNN(ˆΔ) and defined as.

    qROFVNWA(Γ1,Γ2,...,Γn)=η1Γ1η2Γ2...ηnΓn,

    where ηεˆ is the weight of Γε, ε=1,...,n and nε=1ηε=1.

    Theorem 4.2. Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a set of q-ROFVNNs and η=(η1,η2,...ηn) be the weight vector of Γε. Then, qROFVNWA(Γ1,Γ2,...,Γn)

    =([1nε=1(1(εˆζT)q)ηε]1q,nε=1(εˆϖT)ηε),(nε=1(εˆζI)ηε,[1nε=1(1(εˆϖI)q)ηε]1q),(nε=1(εˆζF)ηε,[1nε=1(1(εˆϖF)q)ηε]1q),q1. (19)

    Proof. This theorem can be proven using mathematical induction as follows.

    (1) Take n=2. Then, since

    η1Γ1= ((1(1 ( 1ˆζT)q)η1)1q,( 1ˆϖT)η1 ),(( 1ˆζI)η1,(1(1 ( 1ˆϖI)q)η1)1q),(( 1ˆζF)η1,(1(1 ( 1ˆϖF)q)η1)1q),

    and

    η2Γ2= ((1(1 ( 2ˆζT)q)η2)1q,( 2ˆϖT)η2 ),(( 2ˆζI)η2,(1(1 ( 2ˆϖI)q)η2)1q),(( 2ˆζF)η2,(1(1 ( 2ˆϖF)q)η2)1q),

    we have,

    η1Γ1η2Γ2=< ((1(1 ( 1ˆζT)q)η1+1(1 ( 2ˆζT)q)η2[1(1 ( 1ˆζT)q)η1][1(1 ( 2ˆζT)q)η2])1q, ( 1ˆϖT)η1( 2ˆϖT)η2), (( 1ˆζI)η1( 2ˆζI)η2, (1(1 ( 1ˆϖI)q)η1 +1(1 ( 2ˆϖI)q)η2[1(1 ( 1ˆϖI)q)η1][1(1 ( 2ˆϖI)q)η2])1q), (( 1ˆζF)η1( 2ˆζF)η2, (1(1 ( 1ˆϖF)q)η1+1(1 ( 2ˆϖF)q)η2[1(1 ( 1ˆϖF)q)η1][1(1 ( 2ˆϖF)q)η2])1q)>, =< ([1(1( 1ˆζT)q )η1 (1( 2ˆζT)q )η2]1q, ( 1ˆϖT)η1 ( 2ˆϖT )η2 ),( ( 1ˆζI)η1 ( 2ˆζI )η2, [1(1( 1ˆϖI)q )η1 (1( 2ˆϖI )q )η2]1q ),( ( 1ˆζF)η1 ( 2ˆζF )η2, [1(1( 1ˆϖF )q)η1 (1( 2ˆϖF )q )η2]1q ) >,

    =([12ε=1(1(εˆζT)q)ηε]1q,2ε=1(εˆϖT)ηε),(2ε=1(εˆζI)ηε,[12ε=1(1(εˆϖI)q)ηε]1q),(2ε=1(εˆζF)ηε,[12ε=1(1(εˆϖF)q)ηε]1q).

    This satisfies Eq (19).

    (2) If Eq (19) is satisfied while ε=n, then qROFVNWA(Γ1,Γ2,...,Γn)

    =([1nε=1(1(εˆζT)q)ηε]1q,nε=1(εˆϖT)ηε),(nε=1(εˆζI)ηε,[1nε=1(1(εˆϖI)q)ηε]1q),(nε=1(εˆζF)ηε,[1nε=1(1(εˆϖF)q)ηε]1q),q1.

    Suppose ε=n+1. Then, based on the algebraic operations of the q-ROFVNNs, we have qROFVNWA(Γ1,Γ2,...,Γn+1)=qROFVNWA(Γ1,Γ2,...,Γn)ηn+1Γn+1,

    =([1nε=1(1(εˆζT)q)ηε]1q,nε=1(εˆϖT)ηε),(nε=1(εˆζI)ηε,[1nε=1(1(εˆϖI)q)ηε]1q),(nε=1(εˆζF)ηε,[1nε=1(1(εˆϖF)q)ηε]1q) ((1(1 ( n+1ˆζT)q)ηn+1)1q,( n+1ˆϖT)ηn+1 ),(( n+1ˆζI)ηn+1,(1(1 ( n+1ˆϖI)q)ηn+1)1q),(( n+1ˆζF)ηn+1,(1(1 ( n+1ˆϖF)q)ηn+1)1q),,
    =(([1nε=1(1(εˆζT)q)ηε]+[1(1 ( n+1ˆζT)q)ηn+1][1nε=1(1(εˆζT)q)ηε] [1(1 ( n+1ˆζT)q)ηn+1])1q, (nε=1(εˆϖT)ηε)( n+1ˆϖT)ηn+1 ),((nε=1(εˆζI)ηε)( n+1ˆζI)ηn+1,([1nε=1(1(εˆϖI)q)ηε]+[1(1 ( n+1ˆϖI)q)ηn+1][1nε=1(1(εˆϖI)q)ηε] [1(1 ( n+1ˆϖI)q)ηn+1])1q),((nε=1(εˆζF)ηε)( n+1ˆζF)ηn+1,([1nε=1(1(εˆϖF)q)ηε]+[1(1 ( n+1ˆϖF)q)ηn+1][1nε=1(1(εˆϖF)q)ηε] [1(1 ( n+1ˆϖF)q)ηn+1])1q),
    =([1nε=1(1(εˆζT)q)ηε(1(n+1ˆζT)q)ηn+1]1q,n+1ε=1(εˆϖT)ηε),(n+1ε=1(εˆζI)ηε, [1nε=1(1(εˆϖI)q)ηε(1(n+1ˆϖI)q)ηn+1]1q), (n+1ε=1(εˆζF)ηε, [1nε=1(1(εˆϖF)q)ηε(1(n+1ˆϖF)q)ηn+1]1q),
    =([1n+1ε=1(1(εˆζT)q)ηε]1q,n+1ε=1(εˆϖT)ηε),(n+1ε=1(εˆζI)ηε,[1n+1ε=1(1(εˆϖI)q)ηε]1q),(n+1ε=1(εˆζF)ηε,[1n+1ε=1(1(εˆϖF)q)ηε]1q),

    ε=1,2,...,n+1. This proves that Eq (5) is satisfied for ε=n+1. According to (1) and (2), Eq (19) holds for any ε. This completes the proof.

    Proposition 4.3. Idempotent Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a collection of q-ROFVNNs. If Γε=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF),ε=1,...,n, then qROFVNWA(Γ1,Γ2,...,Γn)=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF).

    Proof. Γε=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF),ε=1,...,n. Then, based on Theorem 4.2,

    qROFVNWA(Γ1,Γ2,...,Γn)=

    ([1nε=1(1(εˆζT)q)ηε]1q,nε=1(εˆϖT)ηε),(nε=1(εˆζI)ηε,[1nε=1(1(εˆϖI)q)ηε]1q),(nε=1(εˆζF)ηε,[1nε=1(1(εˆϖF)q)ηε]1q),
    =([1(1(ˆζT)q)nε=1ηε]1q,(ˆϖT)nε=1ηε),((ˆζI)nε=1ηε,[1(1(ˆϖI)q)nε=1ηε]1q),((ˆζF)nε=1ηε,[1(1(ˆϖF)q)nε=1ηε]1q),
    =([1(1(ˆζT)q)]1q,(ˆϖT)),((ˆζI),[1(1(ˆϖI)q)]1q),((ˆζF),[1(1(ˆϖF)q)]1q),
    =( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF)=Γ.

    Proposition 4.4. Boundedness Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a collection of q-ROFVNNs. If Γ=( ˆζT, ˆϖ+T),( ˆζ+I, ˆϖI),( ˆζ+F, ˆϖF) and Γ+=( ˆζ+T, ˆϖT),( ˆζI,ˆϖ+I),( ˆζF, ˆϖ+F), where, ˆζT=minε{εˆζT},ˆζ+T=maxε{εˆζT}, ˆζI=minε{εˆζI},ˆζ+I=maxε{εˆζI},ˆζF=minε{εˆζF}, ˆζ+F=maxε{εˆζF},ˆϖT=minε{εˆϖT}, ˆϖ+T=maxε{εˆϖT}, ˆϖI=minε{εˆϖI},ˆϖ+I=maxε{εˆϖI}, ˆϖF=minε{εˆϖF}, ˆϖ+F=maxε{εˆϖF}, then ΓqROFVNWA(Γ1,Γ2,...,Γn)Γ+.

    Proof. Since ˆζT εˆζTˆζ+T, for q1, we obtain

    (ˆζT)q (εˆζT)q(ˆζ+T)q 1-(ˆζT)q 1(εˆζT)q1(ˆζ+T)q (1-(ˆζT)q)ηε ( 1(εˆζT)q)ηε(1-(ˆζ+T)q)ηεnε=1(1-(ˆζT)q)ηε nε=1( 1(εˆζT)q)ηεnε=1(1-(ˆζ+T)q)ηε1nε=1(1(ˆζT)q)ηε 1nε=1( 1-(εˆζT)q)ηε1nε=1(1(ˆζ+T)q)ηε[1-nε=1(1(ˆζT)q)ηε]1q [1nε=1( 1-(εˆζT)q)ηε]1q[1-nε=1(1(ˆζ+T)q)ηε]1q, since, [1nε=1(1(ˆζT)q)ηε]1q=ˆζT and [1nε=1(1(ˆζ+T)q)ηε]1q=ˆζ+T.

    Then, ˆζT [1nε=1( 1(εˆζT)q)ηε]1qˆζ+T. Similarly, since ˆϖI εˆϖIˆϖ+I, and ˆϖF εˆϖFˆϖ+F, we obtain, ˆϖI [1nε=1( 1(εˆϖI)q)ηε]1qˆϖ+I and ˆϖF [1nε=1( 1(εˆϖF)q)ηε]1qˆϖ+F.

    Now, since ˆϖT εˆϖTˆϖ+T(ˆϖT)ηε ( εˆϖT)ηε( ˆϖ+T)ηε nε=1(ˆϖT)ηεnε=1( εˆϖT)ηεnε=1( ˆϖ+T)ηε, and nε=1(ˆϖT)ηε=ˆϖT and nε=1( ˆϖ+T)ηε=ˆϖ+T. Then, ˆϖTnε=1( εˆϖT)ηεˆϖ+T.

    In the same manner, as ˆζI εˆζIˆζ+I and ˆζF εˆζFˆζ+F, we obtain ˆζInε=1( εˆζI)ηεˆζ+I, and ˆζFnε=1( εˆζF)ηεˆζ+F.

    Now, let qROFVNWA(Γ1,Γ2,...,Γn)=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF). Then,

    Π(Γ)=13[[(ˆζT)q(ˆϖT)q][(ˆζI)q(ˆϖI)q][(ˆζF)q(ˆϖF)q]]13[[(ˆζT)q-(ˆϖ+T)q][(ˆζ+I)q(ˆϖI)q][(ˆζ+F)q(ˆϖF)q]]=Π(Γ), and

    Π(Γ)=13[[(ˆζT)q(ˆϖT)q][(ˆζI)q(ˆϖI)q][(ˆζF)q-(ˆϖF)q]]13[[(ˆζ+T)q(ˆϖT)q][(ˆζI)q(ˆϖ+I)q][(ˆζF)q(ˆϖ+F)q]]=Π(Γ+).

    This implies ΓqROFVNWA(Γ1,Γ2,...,Γn)Γ+.

    Proposition 4.5. Monotonicity Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} and Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be two collections of q-ROFVNNs. If εˆζTεˆζT, εˆϖTεˆϖT, εˆζIεˆζI, εˆϖIεˆϖI, εˆζFεˆζF and εˆϖFεˆϖF, ε=1,2,...,n, then, qROFVNWA(Γ1,Γ2,...,Γn)qROFVNWA(Γ1,Γ2,...,Γn).

    Proof. Since εˆζTεˆζT, for q1, we obtain

    (εˆζT)q(εˆζT)q 1(εˆζT)q1(εˆζT)q ( 1-(εˆζT)q)ηε(1(εˆζT)q)ηεnε=1( 1-(εˆζT)q)ηεnε=1(1(εˆζT)q)ηε 1nε=1( 1-(εˆζT)q)ηε1nε=1(1(εˆζT)q)ηε[1nε=1( 1-(εˆζT)q)ηε]1q[1nε=1(1-(εˆζT)q)ηε]1q. Similarly, since εˆϖIεˆϖI, and εˆϖFεˆϖF, we obtain

    [1nε=1( 1-(εˆϖI)q)ηε]1q[1nε=1(1-(εˆϖI)q)ηε]1q, and [1nε=1( 1(εˆϖF)q)ηε]1q[1nε=1(1(εˆϖF)q)ηε]1q.

    Now, εˆϖT εˆϖT(εˆϖT)ηε ( εˆϖT)ηε nε=1(εˆϖT)ηεnε=1( εˆϖT)ηε.

    In the same manner, as εˆζI εˆζI and εˆζF εˆζF, we obtain nε=1(εˆζI)ηεnε=1( εˆζI)ηε and nε=1(εˆζF)ηεnε=1( εˆζF)ηε.

    Now, let qROFVNWA(Γ1,Γ2,...,Γn)=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF) and

    qROFVNWA(Γ1,Γ2,...,Γn)=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF). Then,

    Π(Γ)=13[[(ˆζT)q(ˆϖT)q][(ˆζI)q(ˆϖI)q][(ˆζF)q(ˆϖF)q]]13[[(ˆζT)q(ˆϖT)q]- [(ˆζI)q(ˆϖI)q][(ˆζF)q(ˆϖF)q]]=Π(Γ).

    This implies qROFVNWA(Γ1,Γ2,...,Γn)qROFVNWA(Γ1,Γ2,...,Γn).

    In this part the q-ROFVNWG operator and its properties are presented.

    Definition 4.6. Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a set of q-ROFVNNs. The q-ROFVNWG operator is characterized by the transformation qROFVNWG:qROFVNN(ˆΔ)qROFVNN(ˆΔ) and defined as

    qROFVNWG(Γ1,Γ2,...,Γn)=Γη11Γη22...Γηnn,

    where ηεˆ is the weight of Γε, ε=1,...,n, and nε=1ηε=1.

    Theorem 4.7. Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a set of q-ROFVNNs and η=(η1,η2,...ηn) be the weight vector of Γε. Then,

    qROFVNWG(Γ1,Γ2,...,Γn)=(nε=1(εˆζT)ηε,[1nε=1(1(εˆϖT)q)ηε]1q),([1nε=1(1(εˆζI)q)ηε]1q,nε=1(εˆϖI)ηε),([1nε=1(1(εˆζF)q)ηε]1q,nε=1(εˆϖF)ηε),q1. (20)

    Proof. Proof of this theorem is similar to the proof of Theorem 4.2.

    The q-ROFVNWG operator has the following properties, which are stated without proof, as the proof is similar to that of the q-ROFVNWA operator.

    Proposition 4.8. Idempotent Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a collection of q-ROFVNNs. If Γε=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF),ε=1,...,n, then, qROFVNWG(Γ1,Γ2,...,Γn)=Γ=( ˆζT, ˆϖT),( ˆζI, ˆϖI),( ˆζF, ˆϖF).

    Proposition 4.9. Boundedness Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} be a collection of q-ROFVNNs. If Γ=( ˆζT, ˆϖ+T),( ˆζ+I, ˆϖI),( ˆζ+F,  ˆϖF) and Γ+=( ˆζ+T, ˆϖT),( ˆζI,ˆϖ+I),( ˆζF, ˆϖ+F), where ˆζT=minε{εˆζT},ˆζ+T=maxε{εˆζT}, ˆζI=minε{εˆζI},ˆζ+I=maxε{εˆζI}, ˆζF=minε{εˆζF},ˆζ+F=maxε{εˆζF}, ˆϖT=minε{εˆϖT},ˆϖ+T=maxε{εˆϖT}, ˆϖI=minε{εˆϖI},ˆϖ+I=maxε{εˆϖI}, ˆϖF=minε{εˆϖF},ˆϖ+F=maxε{εˆϖF}, then, ΓqROFVNWG(Γ1,Γ2,...,Γn)Γ+.

    Proposition 4.10. Monotonicity Property: Let Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI),( εˆζF, εˆϖF):ε=1,...,n} and Γε={( εˆζT, εˆϖT),( εˆζI, εˆϖI), ( εˆζF, εˆϖF):ε=1,...,n} be two collections of q-ROFVNNs. If εˆζTεˆζT, εˆϖTεˆϖT,  εˆζIεˆζI, εˆϖIεˆϖI, εˆζFεˆζF and εˆϖFεˆϖF, ε=1,2,...,n, then, qROFVNWG(Γ1,Γ2,...,Γn)qROFVNWG(Γ1,Γ2,...,Γn).

    This section emphasizes the applicability and materiality of the q-ROFVN operators when making a decision. To verify this, we pose a MCDM problem, where the evaluation outcome is presented in terms of q-ROFVNNs. We utilize the q-ROFVNWA and q-ROFVNWG operators to solve the MCDM problem. For this purpose, we assume that the alternatives \mathfrak{R}_{i = 1, 2, ..., n} can be deduced from the DMs with the attributes \mathfrak{S}_{j = 1, 2, ..., m} that have the weights \eta_{j = 1, 2, ..., m} with the condition \eta_{j} \in \hat{\blacksquare} and \sum\limits_{j = 1}^{m} \eta_{j} = 1, \forall j = 1, 2, ..., m . Experts are invited to evaluate q-ROFVN data of each attribute for the selection of the optimal candidate. In this setting, to choose the optimal candidate, we propose the following algorithm. (see Algorithm 1)

    = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

    Algorithm 1:

    (1) The evaluated attributes for each alternative are delivered in the form of q-ROFVNNs as a matrix called the decision matrix.

    (2) The obtained decision matrix, which has two types of attributes, is normalized to keep consistency of the attributes. For this, we use the following equation:

    \begin{equation} \Gamma_{\varepsilon} = \left\{ \begin{array}{rcl} & \big < \big ( \ ^{\varepsilon}\hat{\zeta}_{ \mathbb{T}}, ^{\varepsilon}\hat{\varpi}_{ \mathbb{T}} \big ), \big ( \ ^{\varepsilon}\hat{\zeta}_{\mathbb{I}}, ^{\varepsilon} \hat{\varpi}_{\mathbb{I}} \big ), \big ( \ ^{\varepsilon} \hat{\zeta}_{ \mathbb{F}}, ^{\varepsilon} \hat{\varpi}_{ \mathbb{F}} \big ) \big > & \mbox{ for benefit attributes} \\ &\big < \big ( \ ^{\varepsilon} \hat{\zeta}_{ \mathbb{F}}, ^{\varepsilon} \hat{\varpi}_{ \mathbb{F}} \big ), \big ( \ ^{\varepsilon}\hat{\varpi}_{\mathbb{I}}, ^{\varepsilon} \hat{\zeta}_{\mathbb{I}} \big ), \big ( \ ^{\varepsilon}\hat{\zeta}_{ \mathbb{T}}, ^{\varepsilon}\hat{\varpi}_{ \mathbb{T}} \big ) \big > & \mbox{ for cost attributes} \end{array}\right. \end{equation} (21)

    (3) Using q-ROFVNWA or q-ROFVNWG operators, the multiple attribute values of each candidate amount to a single value symbolized as \mathfrak{L}_{i = 1, 2, ..., n} .

    (4) SF of each candidate is computed using Definition 3.7.

    (5) The candidate which has the highest score value is considered the optimal candidate.

    = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =

    Figure 1 exemplifies the intricate procedure of the groundbreaking and innovative method put forth in this research.

    Figure 1.  Illustration of the procedural workflow for the proposed method.

    In this part, we employ the above algorithm to solve the following decision making problem:

    Bridges in cities are vital for enhancing connectivity, easing traffic congestion, supporting economic growth, improving accessibility, and adding aesthetic value to urban landscapes. However, when it comes to building bridges, finding the most suitable construction contractor can be challenging due to their claims of offering affordable and dependable packages. In this proposed model, our focus is on selecting a contractor specifically for building bridges in urban areas. We consider various objectives, such as \mathfrak{S}_{1} : Bridge design and engineering expertise, \mathfrak{S}_{2} : Adherence to quality standards, \mathfrak{S}_{3} : Technical competence, \mathfrak{S}_{4} : Cost competitiveness, and \mathfrak{S}_{5} : Safety measures. For instance, let us consider a scenario where a construction owner has four contractors \mathfrak{R}_{i = 1, 2, 3, 4} available to complete a project. The construction owner aims to evaluate these contractors based on the aforementioned attributes, assigning different levels of importance or weights to each attribute. Suppose the weights for the attributes are 0.2 for bridge design and engineering expertise, 0.1 for adherence to quality standards, 0.1 for technical competence, 0.3 for cost competitiveness, and 0.3 for safety measures. In this case study the qualities of the alternatives \mathfrak{R}_{i} with respect to attributes \mathfrak{S}_{j} are expressed by q-ROFVNNs with q = 3 . Subsequently, we will use the proposed algorithm to choose the best contractor for the bridge construction project as discussed below.

    Step 1. The decision makers evaluated each alternative concerning its attributes using q-ROFVN values and assembled the below decision matrix as in Table 1.

    Table 1.  The original decision matrix.
    \mathfrak{R}_{1} \mathfrak{R}_{2}
    \mathfrak{S}_{1} \big \langle (0.9~, ~0.3)~, ~(0.6~, ~0.9)~, (~0.5~, ~0.7) \big \rangle \big \langle (0.9~, ~0.6), (0.5~, ~0.7), (0.6 ~, ~0.8) \big \rangle
    \mathfrak{S}_{2} \big \langle (0.6~, ~0.1)~, ~(0.5~, ~0.9)~, (~0.8 ~, ~0.7) \big \rangle \big \langle (0.8~, ~0.5), (0.4~, ~0.8), (~0.5 ~, ~0.7) \big \rangle
    \mathfrak{S}_{3} \big \langle (0.7~, ~0.3)~, ~(0.3~, ~0.7)~, (~0.1 ~, ~0.4) \big \rangle \big \langle (0.6~, ~0.8), (0.3~, 0.9), (~0.7 ~, ~0.8) \big \rangle
    \mathfrak{S}_{4} \big \langle (0.5~, ~0.3)~, ~(0.2~, ~0.5)~, (~0.8 ~, ~0.7) \big \rangle \big \langle (0.6~, ~0.7), (0.8~, ~0.2), (~0.7, ~0.4) \big \rangle
    \mathfrak{S}_{5} \big \langle (0.5~, ~0.3)~, ~(0.8~, ~0.7)~, (~0.6 ~, ~0.7) \big \rangle \big \langle (0.8~, ~0.7), ~(0.6~, ~0, 8), (~0.6, ~0.9) \big \rangle
    \mathfrak{R}_{3} \mathfrak{R}_{4}
    \mathfrak{S}_{1} \big \langle (0.5~, ~0.1), ~(0.8~, ~0.5), (~0.5, ~0.4) \big \rangle \big \langle (0.6~, ~0.2), (0.9~, ~0.6), (0.5~, ~0.5) \big \rangle
    \mathfrak{S}_{2} \big \langle (0.8~, ~0.6), ~(0.6~, ~0.8), ~(0.4 ~, ~0.7) \big \rangle \big \langle (0.8~, 0.7), (0.5~, 0.3), (~0.2, ~0.7) \big \rangle
    \mathfrak{S}_{3} \big \langle (0.7~, ~0.2), ~(0.3~, ~0.5), (~0.7 ~, ~0.1) \big \rangle \big \langle (0.5~, ~0.6), (0.7~, ~0.9), (~0.1, ~0.2) \big \rangle
    \mathfrak{S}_{4} \big \langle (0.6~, ~0.5), ~(0.8~, ~0.7), (~0.2, ~0.4) \big \rangle \big \langle (0.7~, ~0.8), (0.2~, ~0.9), ~(~0.5, ~0.7) \big \rangle
    \mathfrak{S}_{5} \big \langle (0.5~, ~0.1), ~(0.7~, 0.8)~, (~0.5 ~, 0.6) \big \rangle \big \langle (0.8~, ~0.2), ~(0.7~, ~0.8), ~(~0.9, ~0.1) \big \rangle

     | Show Table
    DownLoad: CSV

    Step 2. We normalize the original decision matrix by taking the complement of the cost attribute, which is \mathfrak{S}_{4} in our case study. Table 2 portrays the normalized decision matrix.

    Table 2.  The normalized decision matrix.
    \mathfrak{R}_{1} \mathfrak{R}_{2}
    \mathfrak{S}_{1} \big \langle (0.9~, ~0.3)~, ~(0.6~, ~0.9)~, (~0.5~, ~0.7) \big \rangle \big \langle (0.9~, ~0.6), (0.5~, ~0.7), (0.6 ~, ~0.8) \big \rangle
    \mathfrak{S}_{2} \big \langle (0.6~, ~0.1)~, ~(0.5~, ~0.9)~, (~0.8 ~, ~0.7) \big \rangle \big \langle (0.8~, ~0.5), (0.4~, ~0.8), (~0.5 ~, ~0.7) \big \rangle
    \mathfrak{S}_{3} \big \langle (0.7~, ~0.3)~, ~(0.3~, ~0.7)~, (~0.1 ~, ~0.4) \big \rangle \big \langle (0.6~, ~0.8), (0.3~, 0.9), (~0.7 ~, ~0.8) \big \rangle
    \mathfrak{S}_{4} \big \langle (0.8~, ~0.7)~, ~(0.5~, ~0.2)~, (~0.5 ~, ~0.3) \big \rangle \big \langle (0.7~, ~0.4), (0.2~, ~0.8), (~0.6, ~0.7) \big \rangle
    \mathfrak{S}_{5} \big \langle (0.5~, ~0.3)~, ~(0.8~, ~0.7)~, (~0.6 ~, ~0.7) \big \rangle \big \langle (0.8~, ~0.7), ~(0.6~, ~0, 8), (~0.6, ~0.9) \big \rangle
    \mathfrak{R}_{3} \mathfrak{R}_{4}
    \mathfrak{S}_{1} \big \langle (0.5~, ~0.1), ~(0.8~, ~0.5), (~0.5, ~0.4) \big \rangle \big \langle (0.6~, ~0.2), (0.9~, ~0.6), (0.5~, ~0.5) \big \rangle
    \mathfrak{S}_{2} \big \langle (0.8~, ~0.6), ~(0.6~, ~0.8), ~(0.4 ~, ~0.7) \big \rangle \big \langle (0.8~, 0.7), (0.5~, 0.3), (~0.2, ~0.7) \big \rangle
    \mathfrak{S}_{3} \big \langle (0.7~, ~0.2), ~(0.3~, ~0.5), (~0.7 ~, ~0.1) \big \rangle \big \langle (0.5~, ~0.6), (0.7~, ~0.9), (~0.1, ~0.2) \big \rangle
    \mathfrak{S}_{4} \big \langle (0.2~, ~0.4), ~(0.7~, ~0.8), (~0.6, ~0.5) \big \rangle \big \langle (0.5~, ~0.7), (0.9~, ~0.2), ~(~0.7, ~0.8) \big \rangle
    \mathfrak{S}_{5} \big \langle (0.5~, ~0.1), ~(0.7~, 0.8)~, (~0.5 ~, 0.6) \big \rangle \big \langle (0.8~, ~0.2), ~(0.7~, ~0.8), ~(~0.9, ~0.1) \big \rangle

     | Show Table
    DownLoad: CSV

    Step 3. In this step we use Eq (19) to find the q-ROFVNWA operator for each alternative. The resulting values are given below.

    \mathfrak{L}_{1} = \big < \big (0.7615, 0.3466 \big), \big (0.5674, 0.7548 \big), \big (0.4712, 0.6164 \big) \big > ,

    \mathfrak{L}_{2} = \big < \big (0.7951, 0.5623 \big), \big (0.3728, 0.7998 \big), \big (0.5983, 0.814 \big) \big > ,

    \mathfrak{L}_{3} = \big < \big (0.5509, 0.1943 \big), \big (0.6504, 0.748 \big), \big (0.5341, 0.5371 \big) \big > ,

    and \mathfrak{L}_{4} = \big < \big (0.6856, 0.3684 \big), \big (0.7675, 0.6906 \big), \big (0.5125, 0.6283 \big) \big > .

    Step 4. The score value of each alternative is calculated. We obtained \Pi(\mathfrak{L}_{1}) = 0.259, \Pi(\mathfrak{L}_{2}) = 0.37, \Pi(\mathfrak{L}_{3}) = 0.1019 and \Pi(\mathfrak{L}_{4}) = 0.0877 .

    Step 5. From Step 4, the ranking results are \mathfrak{R}_{2} \geq \mathfrak{R}_{1} \geq \mathfrak{R}_{3} \geq \mathfrak{R}_{4}. The q-ROFVNWG operator can be used in Step 3. The results are given below.

    \mathfrak{L}_{1} = \big < \big (0.682, 0.5103 \big), \big (0.6494, 0.5183 \big), \big (0.5756, 0.5133 \big) \big > ,

    \mathfrak{L}_{2} = \big < \big (0.7646, 0.6248 \big), \big (0.4725, 0.7881 \big), \big (0.6048, 0.7857 \big) \big > ,

    \mathfrak{L}_{3} = \big < \big (0.4117, 0.3543 \big), \big (0.7011, 0.6948 \big), \big (0.5558, 0.4447 \big) \big > , and

    \mathfrak{L}_{4} = \big < \big (0.6258, 0.5628 \big), \big (0.8271, 0.4571 \big), \big (0.7491, 0.3352 \big) \big > .

    Then, Step 4 is applied to find the score value of each alternative. We obtain \Pi(\mathfrak{L}_{1}) = -0.0019, \Pi(\mathfrak{L}_{2}) = 0.2836, \Pi(\mathfrak{L}_{3}) = -0.0226 and \Pi(\mathfrak{L}_{4}) = -0.2621 .

    According to Step 4, the ranking results are \mathfrak{R}_{2} \geq \mathfrak{R}_{1} \geq \mathfrak{R}_{3} \geq \mathfrak{R}_{4}. We can see that the ranking results are the same for both proposed operators.

    This section encompasses three parts. In part 1, we discuss the stability of the proposed operators while taking different q values. Part 2 presents the performances of the proposed q-ROFVNWA and q-ROFVNWG operators by using different types of SFs. Comparison of the proposed method with existing methods is provided in part 3.

    In this part, we examine the stability and reliability of derived approaches by changing the values of q . Here, we check q-ROFVNWA and q-ROFVNWG operators along with SF and see the ranking results. Tables 3 and 4 exhibit the ranking positions of the alternatives according to parameter q .

    Table 3.  Ranking of the q-ROFVNWA operator with the values of the parameter q.
    q SF Order of alternatives
    q= 3 \Pi(\mathfrak{L}_{1})= 0.259, \Pi(\mathfrak{L}_{2})= 0.37, \Pi(\mathfrak{L}_{3})= 0.1019, \Pi(\mathfrak{L}_{4})= 0.0877 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q= 5 \Pi(\mathfrak{L}_{1})= 0.1974, \Pi(\mathfrak{L}_{2})= 0.2972, \Pi(\mathfrak{L}_{3})= 0.0713, \Pi(\mathfrak{L}_{4})= 0.066 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q= 7 \Pi(\mathfrak{L}_{1})= 0.1413, \Pi(\mathfrak{L}_{2})= 0.2185, \Pi(\mathfrak{L}_{3})= 0.0491, \Pi(\mathfrak{L}_{4})= 0.0467 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q= 10 \Pi(\mathfrak{L}_{1})= 0.0867, \Pi(\mathfrak{L}_{2})= 0.134, \Pi(\mathfrak{L}_{3})= 0.0269, \Pi(\mathfrak{L}_{4})= 0.0285 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{4} > \mathfrak{R}_{3}
    q= 13 \Pi(\mathfrak{L}_{1})= 0.0556, \Pi(\mathfrak{L}_{2})= 0.0836, \Pi(\mathfrak{L}_{3})= 0.0143, \Pi(\mathfrak{L}_{4})= 0.0179 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{4} > \mathfrak{R}_{3}
    q= 15 \Pi(\mathfrak{L}_{1})= 0.0423, \Pi(\mathfrak{L}_{2})= 0.0619, \Pi(\mathfrak{L}_{3})= 0.0093, \Pi(\mathfrak{L}_{4})= 0.0133 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{4} > \mathfrak{R}_{3}
    q= 20 \Pi(\mathfrak{L}_{1})= 0.0227, \Pi(\mathfrak{L}_{2})= 0.031, \Pi(\mathfrak{L}_{3})= 0.0031, \Pi(\mathfrak{L}_{4})= 0.0065 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{4} > \mathfrak{R}_{3}
    q= 40 \Pi(\mathfrak{L}_{1})= 0.0025, \ \ \ \ \Pi(\mathfrak{L}_{2})= 0.003, \Pi(\mathfrak{L}_{3})= 0, \Pi(\mathfrak{L}_{4})= 0.0005 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{4} > \mathfrak{R}_{3}

     | Show Table
    DownLoad: CSV
    Table 4.  Ranking of the q-ROFVNWG operator with the values of the parameter q.
    q SF Order of alternatives
    q= 3 \Pi(\mathfrak{L}_{1})= -0.0019, \Pi(\mathfrak{L}_{2})= 0.2836, \Pi(\mathfrak{L}_{3})= -0.0226, \Pi(\mathfrak{L}_{4})= -0.2621 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q= 5 \Pi(\mathfrak{L}_{1})= -0.0163, \Pi(\mathfrak{L}_{2})= 0.2133, \Pi(\mathfrak{L}_{3})= -0.019, \Pi(\mathfrak{L}_{4})= -0.2155 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q= 7 \Pi(\mathfrak{L}_{1})= -0.0164, \Pi(\mathfrak{L}_{2})= 0.1433, \Pi(\mathfrak{L}_{3})= -0.0124, \Pi(\mathfrak{L}_{4})= -0.1655 \mathfrak{R}_{2} > \mathfrak{R}_{3} > \mathfrak{R}_{1} > \mathfrak{R}_{4}
    q= 10 \Pi(\mathfrak{L}_{1})= -0.0109, \Pi(\mathfrak{L}_{2})= 0.0732, \Pi(\mathfrak{L}_{3})= -0.0063, \Pi(\mathfrak{L}_{4})= -0.111 \mathfrak{R}_{2} > \mathfrak{R}_{3} > \mathfrak{R}_{1} > \mathfrak{R}_{4}
    q= 13 \Pi(\mathfrak{L}_{1})= -0.0063, \Pi(\mathfrak{L}_{2})= 0.036, \Pi(\mathfrak{L}_{3})= -0.0033, \Pi(\mathfrak{L}_{4})= -0.0761 \mathfrak{R}_{2} > \mathfrak{R}_{3} > \mathfrak{R}_{1} > \mathfrak{R}_{4}
    q= 15 \Pi(\mathfrak{L}_{1})= -0.0042, \Pi(\mathfrak{L}_{2})= 0.0222, \Pi(\mathfrak{L}_{3})= -0.0022, \Pi(\mathfrak{L}_{4})= -0.06 \mathfrak{R}_{2} > \mathfrak{R}_{3} > \mathfrak{R}_{1} > \mathfrak{R}_{4}
    q= 20 \Pi(\mathfrak{L}_{1})= -0.0015, \Pi(\mathfrak{L}_{2})= 0.0066, \Pi(\mathfrak{L}_{3})= -0.0007, \Pi(\mathfrak{L}_{4})= -0.034 \mathfrak{R}_{2} > \mathfrak{R}_{3} > \mathfrak{R}_{1} > \mathfrak{R}_{4}
    q= 40 \Pi(\mathfrak{L}_{1})= 0, \ \ \ \ \ \ \ \ \ \ \ \Pi(\mathfrak{L}_{2})= 0, \ \ \ \ \ \ \ \ \ \ \Pi(\mathfrak{L}_{3})= 0, \ \ \ \ \ \ \ \ \ \ \ \ \ \Pi(\mathfrak{L}_{4})= -0.0039 \mathfrak{R}_{2} = \mathfrak{R}_{1} =\mathfrak{R}_{3} > \mathfrak{R}_{4}

     | Show Table
    DownLoad: CSV

    Tables 3 and 4 provide a comprehensive overview of the ranking results obtained at different values of q . Our analysis encompasses a wide range of q values between 3 and 40, revealing a consistent and robust optimal solution throughout this entire range. This remarkable stability serves as a testament to the reliability and effectiveness of the proposed method.

    Upon closer examination of Table 3, it is evident that \mathfrak{R}{2} emerges as the dominant alternative, closely followed by \mathfrak{R}{1} . Meanwhile, \mathfrak{R}{3} lags behind these alternatives and switches roles with \mathfrak{R}{4} . Notably, a clear inverse relationship is observed between the values of q and the corresponding scores. As q increases, the scores decrease, eventually converging towards zero. In Table 4, we observe that the optimal solution remains consistent with \mathfrak{R}{2} when using the q-ROFVNWG operator. However, it is worth noting that as the values of q increase, the score of \mathfrak{R}{2} decreases, while the scores of the other alternatives increase. Ultimately, all alternative scores converge to zero. It is to be noted that if we obtain the same score value of two alternatives, we refer to the accuracy value, Definition 3.8. Figures 2 and 3 show the tendency of the ranking of the alternatives produced by the q-ROFVNWA and q-ROFVNWG operators as discussed in Tables 3 and 4.

    Figure 2.  Accuracy of the proposed q-ROFVNWA operator with different q values.
    Figure 3.  Accuracy of the proposed q-ROFVNWG operator with different q values.

    In Section 5.1, we utilized the q-ROFVNWA and q-ROFVNWG operators in conjunction with SF to address the decision making problem. In this part, we employ the same operators with QSF to solve the same decision-making problem mentioned earlier. By employing QSF with both the q-ROFVNWA and q-ROFVNWG operators, we obtained the subsequent outcomes.

    For the q-ROFVNWA operator, we get \Omega(\mathfrak{L}_{1}) = 0.1296, \Omega(\mathfrak{L}_{2}) = 0.2417, \Omega(\mathfrak{L}_{3}) = 0.0427 and \Omega(\mathfrak{L}_{4}) = 0.0163 . Thus, the ranking results are \mathfrak{R}_{2} \geq \mathfrak{R}_{1} \geq \mathfrak{R}_{3} \geq \mathfrak{R}_{4}.

    For the q-ROFVNWG operator, we get \Omega(\mathfrak{L}_{1}) = 0.0031, \Omega(\mathfrak{L}_{2}) = 0.185, \Omega(\mathfrak{L}_{3}) = -0.0084 and \Omega(\mathfrak{L}_{4}) = -0.1527 . Thus, the ranking results are \mathfrak{R}_{2} \geq \mathfrak{R}_{1} \geq \mathfrak{R}_{3} \geq \mathfrak{R}_{4}.

    Table 5 summarizes the obtained results employing the proposed operators and SFs.

    Table 5.  Performances of the proposed operators and SFs.
    Proposed Operators Score Values Order of alternatives
    q-ROFVNWA (SF) \Pi(\mathfrak{L}_{1})= 0.259, \Pi(\mathfrak{L}_{2})= 0.37, \Pi(\mathfrak{L}_{3})= 0.1019, \Pi(\mathfrak{L}_{4})= 0.0877 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q-ROFVNWA (QSF) \Omega(\mathfrak{L}_{1})= 0.1296, \Omega(\mathfrak{L}_{2})= 0.2417, \Omega(\mathfrak{L}_{3})= 0.0427, \Omega(\mathfrak{L}_{4})= 0.0163 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q-ROFVNWG (SF) \Pi(\mathfrak{L}_{1})= -0.0019, \Pi(\mathfrak{L}_{2})= 0.2836, \Pi(\mathfrak{L}_{3})= -0.0226, \Pi(\mathfrak{L}_{4})= -0.2621 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}
    q-ROFVNWG (QSF) \Omega(\mathfrak{L}_{1})= 0.0031, \Omega(\mathfrak{L}_{2})= 0.185, \Omega(\mathfrak{L}_{3})= -0.0084, \Omega(\mathfrak{L}_{4})= -0.1527 \mathfrak{R}_{2} > \mathfrak{R}_{1} > \mathfrak{R}_{3} > \mathfrak{R}_{4}

     | Show Table
    DownLoad: CSV

    Table 5 clearly shows that the ranking results are exactly the same for all the proposed models, which reveals the consistency and accuracy of measures. Figure 4 illustrates the performance of the proposed operators and SFs, as presented in Table 5.

    Figure 4.  A visual depiction of the information presented in Table 5.

    In this section, we will compare the proposed method with other commonly used approaches and discuss their strengths and weaknesses to determine the effectiveness of the presented method.

    Besides the q-ROFVN model, there are also some other models proposed in the literature to address the MCDM problems. Among them, we present for their relevance in this comparison, the IFS [7], PyFS [11], q-ROFS [22], SNS [38], IFVNS [53] and PyFVNS [61]. In what follows, let us give some comparison analysis over these variant models. In order to conduct the comparison, we try to apply the above mentioned models to the same data presented in Section 5.1. In this comparison \upsilon, \xi, \gamma refer to MF, IMF and NMF degrees, respectively.

    First, IFS is characterized by \upsilon and \gamma , where \upsilon + \gamma \leq 1 . The AOs of this model are proposed under this condition. In circumstances where \upsilon + \gamma > 1 , these AOs fail to give the requested outcomes in such situation. Moreover, this model is not prepared to handle the indeterminate situations. Thus, it can not be applied to solve the DM problem in Section 5.1.

    Second, PyFS came to enlarge the space of IFS, although in a limited fashion, with the condition \upsilon^{2} + \gamma^{2} \leq 1 . For example, if we pick the value (6, 9) from Table 2, according to this condition 6^{2}+ 9^{2} = 0.36+0.81 = 1.17 > 1. Thus, such model can not handle the DM problem at hand.

    Third, q-ROFS replaces the conditions of IFS and PyFS with the constraint \upsilon^{q} + \gamma^{q} \leq 1, \ q \geq 1 . Obviously, the q-ROFS can express efficiently such kinds of data, i.e., 6^{3}+ 9^{3} = 0.216+0.729 = 0.945 < 1 \ (q = 3). However, q-ROFS ignores indeterminacy circumstances, which makes it unable to be a descriptor of the data given in Table 2.

    Fourth, SNS has three components, \upsilon , \xi and \gamma , for MF, IMF and NMF degrees, respectively. Each component is represented by a single value, while the q-ROFVNS is constructed by considering q-ROF values instead of single values for the MF, IMF and NMF degrees. It can be seen that the SVNS cannot model the data presented in Table 2, as its memberships are unable to express two dimensional data. However, the structure of q-ROFVNS provides the ability to describe these data, as its memberships are two-dimensional.

    Fifth, IFVNS serves as a generalized form of SNS, incorporating three membership functions, namely, \upsilon , \xi and \gamma , each encompassing an IF value subject to the condition \upsilon + \gamma \leq 1 . While IFVNS shares the same construction as q-ROFVNS, it imposes different conditions. However, the limitations of IFVNS become apparent when confronted with certain data, as exemplified in Table 2. Notably, data such as < (0.8\; , \; 0.7)\; , \; (0.5\; , \; 0.2)\; , (0.5 \; , \; 0.3) > cannot be effectively represented by IFVNS, as the condition \upsilon + \gamma \leq 1 is violated in the case of (0.8, 0.7) . Conversely, q-ROFVNS exhibits exceptional flexibility, effortlessly accommodating such data within its adaptable conditions.

    Finally, PyFVNS emerged as a pivotal expansion of the IFVNS domain with the condition (\upsilon)^{2} + (\gamma)^{2} \leq 1 for each of its MFs. This revised condition significantly broadens the scope of data that can be effectively accommodated, surpassing the limitations of IFVNS. For instance, when considering the data set < (0.7, 0.4), (0.2, 0.8), (0.6, 0.7) > from Table 2, it becomes evident that IFVNS fails to capture the essence of such data. Conversely, PyFVNS effortlessly represents this type of data. However, in our case study, there exist some data that cannot be adequately described by PyFVNS, such as the data set < (0.8, 0.7), (0.6, 0.8), (0.6, 0.9) > . This necessity led to the exploration of a new model, namely, q-ROFVNS, specifically designed to handle such data. In q-ROFVNS, each membership function consists of q-ROF value with the condition (\upsilon)^{q} + (\gamma)^{q} \leq 1 , where q \geq 1 . Notably, q-ROFVNS proves to be more comprehensive, encompassing IFS and PyFS as special cases (when q = 1 and q = 2, respectively). To effectively represent the value < (0.8, 0.7), (0.6, 0.8), (0.6, 0.9) > using q-ROFVNS, the parameter q is increased to q = 3. It is important to note that as the rung q increases, the acceptable orthopair space expands, allowing for a greater number of orthopairs to satisfy the bounding constraint. Consequently, q-ROFVNS enables the expression of a wider range of fuzzy information. In essence, the flexibility of q-ROFVNS lies in dynamically adjusting the value of parameter q to determine the range of information expression. This flexibility renders q-ROFVNS more suitable for effectively describing uncertain information. Table 6 compares current models based on suitable criteria, including the existence of three membership degrees, representation as 2D information in each degree, existence of constraints on 2D information in each degree, degree of flexibility of the constraints, and ranking values.

    Table 6.  Comparative analysis of current models based on relevant criteria.
    Method Existence of three membership degrees Representation as 2D information in each degree Existence of constraints on 2D information in each degree Degree of flexibility of the constraints Ranking values
    IFS [7] x x Non-applicable Non-applicable Non-computable
    PyFS [11] x x Non-applicable Non-applicable Non-computable
    q-ROFS [22] x x Non-applicable Non-applicable Non-computable
    SNS [38] \checkmark x Non-applicable Non-applicable Non-computable
    IFVNS [53] \checkmark \checkmark \checkmark Low Non-computable
    PyFVNS [61] \checkmark \checkmark \checkmark Mid Non-computable
    The proposed method \checkmark \checkmark \checkmark High Algorithmic

     | Show Table
    DownLoad: CSV

    This manuscript provides a thorough and comprehensive analysis of the proposed theory of q-ROFVNS, showcasing its remarkable capacity to encompass and generalize prevailing methodologies. q-ROFVNS stands as a profound advancement, enabling a more precise representation of indeterminate information and facilitating the simulation of intricate decision-making scenarios through the strategic incorporation of the novel q-ROFS model in the construction of SNS. The manuscript expounds upon the formal definition of q-ROFVNS, accompanied by the development of operational laws and a comprehensive delineation of diverse aggregation operators within the q-ROFVN environment. Rigorous verification of the properties inherent to these operators is undertaken. Moreover, an innovative MADM methodology is meticulously devised, hinging on the proposed operators and the adept utilization of SFs. A numerical application is conducted to rank various construction contractors, utilizing q-ROFVNNs to assess their performance across different features. Subsequently, q-ROFVNWA and q-ROFVNWG operators are applied to aggregate attribute values, while SF is employed to derive ranking results. A rigorous examination of the robustness and dependability of the proposed q-ROFVNWA and q-ROFVNWG operators and SF methodologies is conducted by systematically varying the values of q . Remarkably, we observed that the optimal solution remained unaltered throughout these variations, thereby unequivocally affirming the unwavering stability and resilience of the proposed techniques. We also examined the proposed QSF. To evaluate its efficacy, we tackled the same numerical application that was previously addressed using the q-ROFVNWA and q-ROFVNWG operators and SF methodologies. We discovered that the ranking outcomes obtained from all the proposed models were wholly identical. This remarkable consistency unequivocally attests to the unwavering accuracy and precision exhibited by these measures. Furthermore, this manuscript facilitated a comparative examination of the proposed models in relation to the existing models, employing a detailed and insightful discussion to elucidate and interpret the findings. In this research, we strive to tackle more complex decision making problems. However, it is important to acknowledge the limitations of our proposed work. We have solely considered the evaluation information provided by q-ROFVNS, whereas in practical decision problems, decision makers have the ability to employ hybrid evaluation methods that incorporate features of bipolar fuzzy hypersoft sets [62], T-spherical fuzzy sets [63], hesitant q-rung orthopair fuzzy sets [64], and interval-valued neutrosophic sets[65]. These hybrid methods can effectively capture the vagueness and uncertainties present in complex data. Furthermore, our study has focused exclusively on two aggregation operators, namely, the q-ROFVNWA and q-ROFVNWG operators. To broaden the scope of our research, future investigations should explore other generalizations of q-ROFVNS such as q-rung orthopair bipolar neutrosophic sets, T-spherical fuzzy valued neutrosophic sets, hesitant q-rung orthopair neutrosophic sets and interval-valued q-ROFVNS. Additionally, the proposed operators could be extended to incorporate Heronian mean, Yager's ordered weighted averaging, Hamacher product, Einstein product, Choquet average and Dombi's aggregation operators.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    We would like to acknowledge the Ministry of Higher Education Malaysia for their sponsorship of the Fundamental Research Grant Scheme (Project Code: FRGS/1/2023/STG06/UITM/02/5). This financial support has been crucial in advancing our research efforts, and we are grateful for their assistance.

    This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. GRANT5305].

    Authors declare no conflicts of interest.



    [1] L. A. Zadeh, Fuzzy sets, Inform. Contr., 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
    [2] S. Sniazhko, Uncertainty in decision-making: A review of the international business literature, Cogent Bus. Manag., 6 (2019), 1650692. https://doi.org/10.1080/23311975.2019.1650692 doi: 10.1080/23311975.2019.1650692
    [3] L. S. Jin, Uncertain probability, regular probability interval and relative proximity, Fuzzy Set. Syst., 467 (2023), 108579. https://doi.org/10.1016/j.fss.2023.108579 doi: 10.1016/j.fss.2023.108579
    [4] B. Bishesh, Fuzzy decision making, In: Fuzzy computing in data science, John Wiley & Sons, Ltd, 2022, 33–75. https://doi.org/10.1002/9781394156887
    [5] M. Pouyakian, A. Khatabakhsh, M. Yazdi, E. Zarei, Optimizing the allocation of risk control measures using fuzzy MCDM approach: Review and application, In: Linguistic methods under fuzzy information in system safety and reliability analysis, Springer, Cham, 414 (2022), 53–89. https://doi.org/10.1007/978-3-030-93352-4_4
    [6] H. Li, M. Yazdi, Developing failure modes and effect analysis on offshore wind turbines using two-stage optimization probabilistic linguistic preference relations, In: Advanced decision-making methods and applications in system safety and reliability problems, Studies in Systems, Decision and Control, Springer, Cham, 211 (2022), 47–68. https://doi.org/10.1007/978-3-031-07430-1_4
    [7] K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set. Syst., 20 (1986), 87–96.
    [8] M. Gulzar, M. H. Mateen, D. Alghazzawi, N. Kausar, A novel applications of complex intuitionistic fuzzy sets in group theory, IEEE Access, 8 (2020), 196075–196085. https://doi.org/10.1109/ACCESS.2020.3034626 doi: 10.1109/ACCESS.2020.3034626
    [9] J. C. R. Alcantud, A. Z. Khameneh, A. Kilicman, Aggregation of infinite chains of intuitionistic fuzzy sets and their application to choices with temporal intuitionistic fuzzy information, Inform. Sciences, 514 (2020), 106–117. https://doi.org/10.1016/j.ins.2019.12.008 doi: 10.1016/j.ins.2019.12.008
    [10] A. U. Rahman, M. R. Ahmad, M. Saeed, M. Ahsan, M. Arshad, M. Ihsan, A study on fundamentals of refined intuitionistic fuzzy set with some properties, J. Fuzzy Ext. Appl., 1 (2020), 279–292. https://doi.org/10.22105/jfea.2020.261946.1067 doi: 10.22105/jfea.2020.261946.1067
    [11] R. R. Yager, Pythagorean fuzzy subsets, IEEE, 2013, 57–61. https://doi.org/10.1109/IFSA-NAFIPS.2013.6608375 doi: 10.1109/IFSA-NAFIPS.2013.6608375
    [12] D. Q. Li, W. Y. Zeng, Distance measure of Pythagorean fuzzy sets, Int. J. Intell. Syst., 33 (2018), 348–361. https://doi.org/10.1002/int.21934 doi: 10.1002/int.21934
    [13] G. W. Wei, Y. Wei, Similarity measures of Pythagorean fuzzy sets based on the cosine function and their applications, Int. J. Intell. Syst., 33 (2018), 634–652. https://doi.org/10.1002/int.21965 doi: 10.1002/int.21965
    [14] F. Y. Xiao, W. P. Ding, Divergence measure of Pythagorean fuzzy sets and its application in medical diagnosis, Appl. Soft Comput., 79 (2019), 254–267. https://doi.org/10.1016/j.asoc.2019.03.043 doi: 10.1016/j.asoc.2019.03.043
    [15] N. X. Thao, F. Smarandache, A new fuzzy entropy on Pythagorean fuzzy sets, J. Intell. Fuzzy Syst., 37 (2019), 1065–1074. https://doi.org/10.3233/JIFS-182540 doi: 10.3233/JIFS-182540
    [16] X. Z. Gao, Y. Deng, Generating method of Pythagorean fuzzy sets from the negation of probability, Eng. Appl. Artif. Intel., 105 (2021), 104403. https://doi.org/10.1016/j.engappai.2021.104403 doi: 10.1016/j.engappai.2021.104403
    [17] A. Hussain, K. Ullah, M. N. Alshahrani, M. S. Yang, D. Pamucar, Novel Aczel-Alsina operators for Pythagorean fuzzy sets with application in multi-attribute decision making, Symmetry, 14 (2022), 940. https://doi.org/10.3390/sym14050940 doi: 10.3390/sym14050940
    [18] K. Ullah, T. Mahmood, Z. Ali, N. Jan, On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition, Complex Intell. Syst., 6 (2020), 15–27. https://doi.org/10.1007/s40747-019-0103-6 doi: 10.1007/s40747-019-0103-6
    [19] Z. Wang, F. Y. Xiao, Z. H. Cao, Uncertainty measurements for Pythagorean fuzzy set and their applications in multiple-criteria decision making, Soft Comput., 26 (2022), 9937–9952. https://doi.org/10.1007/s00500-022-07361-9 doi: 10.1007/s00500-022-07361-9
    [20] T. M. Athira, S. J. John, H. Garg, A novel entropy measure of Pythagorean fuzzy soft sets, AIMS Math., 5 (2020), 1050–1061. https://doi.org/10.3934/math.20200073 doi: 10.3934/math.20200073
    [21] M. Rasheed, E. Tag-Eldin, N. A. Ghamry, M. A. Hashmi, M. Kamran, U. Rana, Decision-making algorithm based on Pythagorean fuzzy environment with probabilistic hesitant fuzzy set and Choquet integral, AIMS Math., 8 (2023), 12422–12455. https://doi.org/10.3934/math.2023624 doi: 10.3934/math.2023624
    [22] R. R. Yager, Generalized orthopair fuzzy sets, IEEE T. Fuzzy Syst., 25 (2016), 1222–1230. https://doi.org/10.1109/TFUZZ.2016.2604005 doi: 10.1109/TFUZZ.2016.2604005
    [23] P. D. Liu, P. Wang, Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making, Int. J. Intell. Syst., 33 (2017), 259–280. https://doi.org/10.1002/int.21927 doi: 10.1002/int.21927
    [24] P. D. Liu, P. Wang, Multiple-attribute decision-making based on archimedean bonferroni operators of q-rung orthopair fuzzy numbers, IEEE T. Fuzzy Syst., 27 (2018), 834–848. https://doi.org/10.1109/TFUZZ.2018.2826452 doi: 10.1109/TFUZZ.2018.2826452
    [25] P. Wang, J. Wang, G. W. Wei, C. Wei, Similarity measures of q-rung orthopair fuzzy sets based on cosine function and their applications, Mathematics, 7 (2019), 340. https://doi.org/10.3390/math7040340 doi: 10.3390/math7040340
    [26] D. H. Liu, X. H. Chen, D. Peng, Some cosine similarity measures and distance measures between q‐rung orthopair fuzzy sets, Int. J. Intell. Syst., 34 (2019), 1572–1587. https://doi.org/10.1002/int.22108 doi: 10.1002/int.22108
    [27] C. Dhankhar, A. K. Yadav, K. Kumar, A ranking method for q-rung orthopair fuzzy set based on possibility degree measure, Soft Comput. Theor. Appl., 425 (2022), 15–24. https://doi.org/10.1007/978-981-19-0707-4_2 doi: 10.1007/978-981-19-0707-4_2
    [28] M. Deveci, D. Pamucar, I. Gokasar, M. Köppen, B. B. Gupta, Personal mobility in metaverse with autonomous vehicles using Q-rung orthopair fuzzy sets based OPA-RAFSI model, IEEE T. Intell. Transp., 24 (2022), 15642–15651. https://doi.org/10.1109/TITS.2022.3186294 doi: 10.1109/TITS.2022.3186294
    [29] M. W. Lin, X. M. Li, L. Y. Chen, Linguistic q-rung orthopair fuzzy sets and their interactional partitioned Heronian mean aggregation operators, Int. J. Intell. Syst., 35 (2020), 217–249. https://doi.org/10.1002/int.22136 doi: 10.1002/int.22136
    [30] H. X. Li, S. Y. Yin, Y. Yang, Some preference relations based on q‐rung orthopair fuzzy sets, Int. J. Intell. Syst., 34 (2019), 2920–2936. https://doi.org/10.1002/int.22178 doi: 10.1002/int.22178
    [31] X. D. Peng, J. G. Dai, H. Garg, Exponential operation and aggregation operator for q‐rung orthopair fuzzy set and their decision‐making method with a new score function, Int. J. Intell. Syst., 33 (2018), 2255–2282. https://doi.org/10.1002/int.22028 doi: 10.1002/int.22028
    [32] M. Deveci, D. Pamucar, U. Cali, E. Kantar, K. Kölle, J. O. Tande, Hybrid q-rung orthopair fuzzy sets based cocoso model for floating offshore wind farm site selection in Norway, CSEE J. Power Energy Syst., 8 (2022), 1261–1280. https://doi.org/10.17775/CSEEJPES.2021.07700 doi: 10.17775/CSEEJPES.2021.07700
    [33] M. Deveci, I. Gokasar, P. R. Brito-Parada, A comprehensive model for socially responsible rehabilitation of mining sites using Q-rung orthopair fuzzy sets and combinative distance-based assessment, Expert Syst. Appl., 200 (2022), 117155. https://doi.org/10.1016/j.eswa.2022.117155 doi: 10.1016/j.eswa.2022.117155
    [34] K. Alnefaie, Q. Xin, A. Almutlg, E. S. A. Abo-Tabl, M. H. Mateen, A novel framework of q-Rung orthopair fuzzy sets in field, Symmetry, 15 (2022), 114. https://doi.org/10.3390/sym15010114 doi: 10.3390/sym15010114
    [35] A. Habib, M. Akram, A. Farooq, q-Rung orthopair fuzzy competition graphs with application in the soil ecosystem, Mathematics, 7 (2019), 91. https://doi.org/10.3390/math7010091 doi: 10.3390/math7010091
    [36] H. Garg, J. Gwak, T. Mahmood, Z. Ali, Power aggregation operators and VIKOR methods for complex q-Rung orthopair fuzzy sets and their applications, Mathematics, 8 (2020), 538. https://doi.org/10.3390/math8040538 doi: 10.3390/math8040538
    [37] F. Smarandache, Neutrosophy: Neutrosophic probability, set, and logic: Analytic synthesis & synthetic analysis, Rehoboth, NM: American Research Press, 1998.
    [38] J. Ye, A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets, J. Intell. Fuzzy Syst., 26 (2014), 2459–2466. https://doi.org/10.3233/IFS-130916 doi: 10.3233/IFS-130916
    [39] A. R. Mishra, P. Rani, R. S. Prajapati, Multi-criteria weighted aggregated sum product assessment method for sustainable biomass crop selection problem using single-valued neutrosophic sets, Appl. Soft Comput., 113 (2021), 108038. https://doi.org/10.1016/j.asoc.2021.108038 doi: 10.1016/j.asoc.2021.108038
    [40] M. Ali, F. Smarandache, Complex neutrosophic set, Neural Comput. Appl., 28 (2017), 1817–1834. https://doi.org/10.1007/s00521-015-2154-y doi: 10.1007/s00521-015-2154-y
    [41] A. Al-Quran, A. Ahmad, F. Al-Sharqi, A. Lutfi, Q-complex neutrosophic set, Int. J. Neutrosophic Sci., 20 (2023), 8–19. https://doi.org/10.54216/IJNS.200201 doi: 10.54216/IJNS.200201
    [42] A. Al-Quran, N. Hassan, S. Alkhazaleh, Fuzzy parameterized complex neutrosophic soft expert set for decision under uncertainty, Symmetry, 11 (2019), 382. https://doi.org/10.3390/sym11030382 doi: 10.3390/sym11030382
    [43] F. Al-Sharqi, A. G. Ahmad, A. Al-Quran, Fuzzy parameterized-interval complex neutrosophic soft sets and their applications under uncertainty, J. Intell. Fuzzy Syst., 44 (2023), 1453–1477. https://doi.org/10.3233/JIFS-221579 doi: 10.3233/JIFS-221579
    [44] D. Karabašević, D. Stanujkić, E. K. Zavadskas, P. Stanimirović, G. Popović, A. Ulutaş, et al., A novel extension of the TOPSIS method adapted for the use of single-valued neutrosophic sets and hamming distance for E-commerce development strategies selection, Symmetry, 12 (2020), 1263. https://doi.org/10.3390/sym12081263 doi: 10.3390/sym12081263
    [45] M. Abdel-Basset, A. Gamal, G. Manogaran, L. H. Son, H. V. Long, A novel group decision making model based on neutrosophic sets for heart disease diagnosis, Multimed. Tools Appl., 79 (2020), 9977–10002. https://doi.org/10.1007/s11042-019-07742-7 doi: 10.1007/s11042-019-07742-7
    [46] C. Jana, M. Pal, A robust single-valued neutrosophic soft aggregation operators in multi-criteria decision making, Symmetry, 11 (2019), 110. https://doi.org/10.3390/sym11010110 doi: 10.3390/sym11010110
    [47] P. Ji, J. Q. Wang, H. Y. Zhang, Frank prioritized Bonferroni mean operator with single-valued neutrosophic sets and its application in selecting third-party logistics providers, Neural Comput. Appl., 30 (2018), 799–823. https://doi.org/10.1007/s00521-016-2660-6 doi: 10.1007/s00521-016-2660-6
    [48] D. S. Xu, C. Wei, G. W. Wei, TODIM method for single-valued neutrosophic multiple attribute decision making, Information, 8 (2017), 125. https://doi.org/10.3390/info8040125 doi: 10.3390/info8040125
    [49] K. L. Hu, L. P. Zhao, S. Feng, S. D. Zhang, Q. W. Zhou, X. Z. Gao, et al., Colorectal polyp region extraction using saliency detection network with neutrosophic enhancement, Comput. Biol. Med., 147 (2022), 105760. https://doi.org/10.1016/j.compbiomed.2022.105760 doi: 10.1016/j.compbiomed.2022.105760
    [50] J. Ye, Trapezoidal neutrosophic set and its application to multiple attribute decision-making, Neural Comput. Appl., 26 (2015), 1157–1166. https://doi.org/10.1007/s00521-014-1787-6 doi: 10.1007/s00521-014-1787-6
    [51] G. Kaur, H. Garg, A new method for image processing using generalized linguistic neutrosophic cubic aggregation operator, Complex Intell. Syst., 8 (2022), 4911–4937. https://doi.org/10.1007/s40747-022-00718-5 doi: 10.1007/s40747-022-00718-5
    [52] C. Jana, M. Pal, F. Karaaslan, J. Q. Wang, Trapezoidal neutrosophic aggregation operators and their application to the multi-attribute decision-making process, Sci. Iran., 27 (2020), 1655–1673. https://doi.org/10.24200/sci.2018.51136.2024 doi: 10.24200/sci.2018.51136.2024
    [53] M. Bhowmik, M. Pal, Intuitionistic neutrosophic set, J. Inform. Comput. Sci., 4 (2009), 142–152.
    [54] M. Unver, E. Turkarslan, N. Celik, M. Olgun, J. Ye, Intuitionistic fuzzy-valued neutrosophic multi-sets and numerical applications to classification, Complex Intell. Syst., 8 (2022), 1703–1721. https://doi.org/10.1007/s40747-021-00621-5 doi: 10.1007/s40747-021-00621-5
    [55] M. Palanikumar, K. Arulmozhi, C. Jana, Multiple attribute decision-making approach for Pythagorean neutrosophic normal interval-valued fuzzy aggregation operators, Comput. Appl. Math., 41 (2022), 90. https://doi.org/10.1007/s40314-022-01791-9 doi: 10.1007/s40314-022-01791-9
    [56] P. Chellamani, D. Ajay, Pythagorean neutrosophic Dombi fuzzy graphs with an application to MCDM, Neutrosophic Sets Sy., 47 (2021), 411–431. https://doi.org/10.5281/zenodo.5775162 doi: 10.5281/zenodo.5775162
    [57] D. Ajay, P. Chellamani, Pythagorean neutrosophic soft sets and their application to decision-making scenario, In: Intelligent and fuzzy techniques for emerging conditions and digital transformation: Proceedings of the INFUS 2021 Conference, Springer International Publishing, 2 (2021), 552–560.
    [58] M. Palanikumar, K. Arulmozhi, MCGDM based on TOPSIS and VIKOR using Pythagorean neutrosophic soft with aggregation operators, Neutrosophic Sets Sy., 51 (2022), 538–555. https://doi.org/10.5281/zenodo.7135376 doi: 10.5281/zenodo.7135376
    [59] J. Rajan, M. Krishnaswamy, Similarity measures of Pythagorean neutrosophic sets with dependent neutrosophic components between T and F, J. New Theory, 33 (2020), 85–94.
    [60] A. Siraj, T. Fatima, D. Afzal, K. Naeem, F. Karaaslan, Pythagorean m-polar fuzzy neutrosophic topology with applications, Neutrosophic Sets Sy., 48 (2022), 251–290. https://doi.org/10.5281/zenodo.6041514 doi: 10.5281/zenodo.6041514
    [61] M. C. Bozyigit, M. Olgun, F. Smarandache, M. Unver, A new type of neutrosophic set in Pythagorean fuzzy environment and applications to multi-criteria decision making, Int. J. Neutrosophic Sci., 20 (2023), 107–134. https://doi.org/10.54216/IJNS.200208 doi: 10.54216/IJNS.200208
    [62] A. Al-Quran, F. Al-Sharqi, K. Ullah, M. U. Romdhini, M. Balti, M. Alomair, Bipolar fuzzy hypersoft set and its application in decision making, Int. J. Neutrosophic Sci., 20 (2023), 65–77. https://doi.org/10.54216/IJNS.200405 doi: 10.54216/IJNS.200405
    [63] A. Sarkar, T. Senapati, L. S. Jin, R. Mesiar, A. Biswas, R. R. Yager, Sugeno-Weber triangular norm-based aggregation operators under T-spherical fuzzy hypersoft context, Inform. Sci., 645 (2023), 119305. https://doi.org/10.1016/j.ins.2023.119305 doi: 10.1016/j.ins.2023.119305
    [64] A. Sarkar, S. Moslem, D. Esztergár-Kiss, M. Akram, L. S. Jin, T. Senapati, A hybrid approach based on dual hesitant q-rung orthopair fuzzy Frank power partitioned Heronian mean aggregation operators for estimating sustainable urban transport solutions, Eng. Appl. Artif. Intel., 124 (2023), 106505. https://doi.org/10.1016/j.engappai.2023.106505 doi: 10.1016/j.engappai.2023.106505
    [65] F. Al-Sharqi, A. Al-Quran, A. G. Ahmad, S. Broumi, Interval-valued complex neutrosophic soft set and its applications in decision-making, Neutrosophic Sets Sy., 40 (2021), 149–168.
  • This article has been cited by:

    1. S. Santhoshkumar, J. Aldring, D. Ajay, 2024, Chapter 83, 978-3-031-67191-3, 744, 10.1007/978-3-031-67192-0_83
    2. Zeeshan Saleem Mufti, Ali Tabraiz, Muhammad Farhan Hanif, , Molecular insights into Tetracene through fuzzy topological indices in chemical graph theory, 2025, 0366-6352, 10.1007/s11696-025-03979-9
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1514) PDF downloads(105) Cited by(2)

Figures and Tables

Figures(4)  /  Tables(6)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog