Skip to main content
Computational Intelligence and Neuroscience logoLink to Computational Intelligence and Neuroscience
. 2022 Sep 30;2022:9984314. doi: 10.1155/2022/9984314

N-Cubic q-Rung Orthopair Fuzzy Sets: Analysis of the Use of Mobile App in the Education Sector

Joseph David Madasi 1, Salma Khan 2, Nasreen Kausar 3, Dragan Pamucar 4, Muhammad Gulistan 2, Ben Sorowen 5,
PMCID: PMC9546655  PMID: 36210971

Abstract

This study analyzes the description to examine the results of a new study and create the technique and also demonstrate the effectiveness of this technique. In this ever-changing world, students are increasingly encouraged to use mobile phones primarily to learn for educational purposes. The learning process is continuous and the goal has now been achieved. It has been replaced by online learning. Due to mobile phones as well as the many feature-oriented applications, students can study at their own place and use the application to spend their time understanding, because everything is accessible with a single click. To carry on the study we applied mobile applications for online education system. Now, because the traditional method is taken into consideration, it is normal to carry a bag full of books and copies and immerse yourself in the tradition of learning to write. However, it has been found that not all students learn when he takes notes. Therefore, we must make sure that the student focuses only on one thing at a time. To continue the research, we apply the N-cubic structure to q-rung orthopair fuzzy sets in multi-attribute group decision-making problems. This structure solves the problems of multi-attribute group decision-making techniques more generally.

1. Introduction

Decision-making is an empathic process that allows the selection of alternatives from a set of possible attributes. In decision-making problems the data were ambiguous and uncertain and the representation of data is no longer in real number. For this purpose many researchers developed different theories to handle such type of data. Among these researchers, Zadeh [1] developed the theme of fuzzy set (FS) theory that could determine uncertainty and vagueness in classic sets which are based on only two values logic 0 and 1. In 1975, Zadeh [24] further expanded his ideas to interval-valued fuzzy sets (IVFS). Atanassov [5, 6] later came up with the idea that using intuitionistic fuzzy sets (IFS) to assist with the significance of the membership value as well as the nonmembership value. Wang et al. [7] defined some interval-valued intuitionistic fuzzy aggregation operators with basic operations and properties. Intuitionistic fuzzy set was generalized to the Pythagorean fuzzy set (PFS) [8] which described the value of membership and nonmembership with the condition that the square sum is less or equal to 1. PFS was generalized to q-rung orthopair fuzzy set [9]. In 2018 Ali [10] defined a new type of q-rung orthopair fuzzy sets where the domain of the function defining a q-ROF set is the region made up of orbits. To deal with the decision information, Liu and Wang [11] proposed the q-rung orthopair fuzzy weighted averaging operator and the q-rung orthopair fuzzy weighted geometric operator. Wei et al. [12] presented q-rung orthopair fuzzy Maclaurin symmetric mean operators and their applications to potential evaluation of emerging technology commercialization. Many researchers [13, 14] used the different versions of q-rung orthopair fuzzy sets in different field such as q-rung orthopair fuzzy soft sets, q-rung orthopair fuzzy hypersoft sets, and their operators. In 2012, Jun et al. [15] combined FS and IVFS and developed the theme of cubic set. In decision-making theory aggregation operators is an important component. The conflicting criteria are included in the multi-attribute decision-making (MADM) task, and the conflicting criteria are aggregated to solve the problem [13, 16]. Most aggregation operators treat criteria on an individual basis; they do not take into account how criteria interact with each other or with common criteria. Kaur and Garg [17, 18] developed cubic intuitionistic fuzzy aggregation operators, which includes two components at the same time. One component provides the degree of membership in the form of an interval value for cubic intuitionistic fuzzy numbers (CIFNs), as well as the second component, gives the degree of nonmembership in the form of fuzzy values. Abbas et al. [19] have described a modified version in CIFS that is known informally as cubic Pythagorean fuzzy sets (CPFS). Zang et al. [20] generalized CPFS into cubic q-rung orthopair fuzzy sets (CqROFSs). This allows decision-makers to explain their ideas better in the context of a fuzzy environment. In 2009, Jun et al. [21] defined negative-valued functions as well as the N-structure. This paper is on BCK/BCI algebra as well as subtraction algebra. Rashid et al. [22] used the concept of the N-structure and developed the theme of N-cubic sets, aggregate operators, and other concepts related to it. In 2020, Petrovic and Kankaras [23] developed a hybridized IT2FS-DEMATEL-AHP-TOPSIS multicriteria decision-making approach for the selection and evaluation of criteria for determination of air traffic control radar position. Agarwal et al. [24] discussed the development of management tools and techniques in decision-making for policy makers which are based on scientific evidence. Ali et al. [25] developed Einstein geometric aggregation operators using complex interval-valued pythagorean fuzzy set with application in green supplier chain management. We are currently employing the N-structure concept for q-ROFSs. The Cq-ROFS is a database that describes IVqROFS and q-ROFS in a way that is related to uncertainty in the information. In order to demonstrate how this structure might be used in decision-making, we shall examine issues relating to the N-structure of cubic q-rung orthopair fuzzy sets in this article. Although this study can manage decision-making more efficiently than fuzzy sets, using it manually is not simple. Therefore, we must create computer programming in order to overcome these constraints. By merging the N-structure with cubic q-ROF sets, this structure more specifically overcame the uncertainty issues. N-cubic q-rung orthopair fuzzy sets can effectively capture expert evaluation data and minimize fuzziness in decision-making outcomes.

2. Materials and Methods

In this section we recall some basic materials and methods.

Definition 1 (see [6]). —

Let G^∅ be universal set, then q-ROFS H^ be defined as

H^=g^,H^g^,ΩH^g^|g^G^, (1)

where H^r´ and ΩH^r´ are a mapping from G^ to [0,1], also satisfy the condition as

0H^1,0ΩH^1, (2)

and

0H^g^q1,0ΩH^g^q1, (3)

where q ≥ 1 for all g^G^ and represent the membership degree and the nonmembership degree to set H^.

Definition 2 (see [6]). —

Let G^∅ be universal set, then (IVq-ROFS) H^ be defined as

H^=g^,H^g^,ΩH^g^|g^G^, (4)

where H^g^ and ΩH^g^ are a mapping from G^ to [0,1],

Pg^=H^Lg^,H^Ug^, (5)

and

ΩH^g^=ΩH^Lg^,ΩH^Ug^, (6)

also satisfy the condition as

0H^1,0ΩH^1, (7)

and

0H^Ug^q1,0ΩH^Ug^q1, (8)

where q ≥ 1 for all g^G^ and represent the membership degree and the nonmembership degree to set H^.

Definition 3 (see [10]). —

Let X be the collection of some elements. A cubic-q-rung orthopair fuzzy set is represented as C={〈x, H(x), ϑ(x)|x ∈ X〉}, where H(x) is an Interval-valued-q-rung orthopair fuzzy set and ϑ(x) is a q-rung orthopair fuzzy set. Here H(x)={[℧L, ℧U][ΩL, ΩU]} such that 0 ≤ (℧U)q+(ΩU)q ≤ 1 and ϑ(x)=(℧, Ω) with 0 ≤ ℧qq ≤ 1 where q ≥ 1. It can be described as C=〈H, ϑ〉, where H={[℧L, ℧U][ΩL, ΩU]} and ϑ(x)=(℧, Ω) and it is known as the cubic-q-rung orthopair fuzzy set number.

3. N-Cubic q-Rung Orthopair Fuzzy Set and Hamy Mean Operators

This part develops the Nq-ROFS and NIVq-ROFS structures and introduces the innovative NCq-ROFS structure. The NCq-ROFS's accuracy and score functions are defined. Both N-cubic q-rung orthopair fuzzy Hamy mean operator and N-cubic q-rung orthopair fuzzy power Hamy mean operator, as well as their characteristics and weighted forms, are covered in this section.

Definition 4 . —

Let X be the collection of some elements. A Nq-ROFS define asNQRO={〈x, FNQRO(x), HNQRO(x)〉 : x ∈ X} such that 112q˘+1FNQRO2q˘+HNQRO2q˘0, where FNQRO(x) : X⟶[−1,0] and HNQRO(x) : X⟶[−1,0].

Definition 5 . —

A NIVq-ROFS in a ϕ ≠ X is define as

NIVQRO=x,˜NIVQROx=NIVQROL,NIVQROU,Ω˜NIVQROx=ΩNIVQROL,ΩNIVQROU:xx, (9)

with the condition

112q˘+1NCQROU2q˘+ΩNCQROU2q˘0, (10)

where [℧NIV−QROL, ℧NIV−QROU] : X⟶[−1,0] and [ΩNIV−QROL, ΩNIV−QROU] : X⟶[−1,0].

Definition 6 . —

An NCq-ROFS in a ϕ ≠ X is define by the structure NCQRO = {〈x, ΓNCQRO(x), ϜNCQRO(x)〉 : x ∈ X}, where ΓNCQRO=x,˜NCQROx,Ω˜NCQROx:xX is an N−IVQROFS and ϜNCQRO = {〈x, FNCQRO(x), HNCQRO(x)〉 : x ∈ X} is an N−QROFS. Here ΓNCQRO = {[℧NCQROL, ℧NCQROU], [ΩNCQROL, ΩNCQROU]} : X⟶D[−1,0] with the condition that112q˘+1NCQROU2q˘+ΩNCQROU2q˘0 and ϜNCQRO = {FNCQRO, HNCQRO} : X⟶[−1,0] with the condition112q˘+1FNCQRO2q˘+HNCQRO2q˘0. For simplicity it is denoted by NCQRO = 〈ΓNCQRO, ϜNCQRO〉.

Definition 7 . —

An NCq-ROF set NCQRO = 〈ΓNCQRO, ϜNCQRO〉 in ϕ ≠ X is called internal NCq-ROF set if FNCQRO ∈ [℧NCQROL, ℧NCQROU] and HNCQRO ∈ [ΩNCQROL, ΩNCQROU] for all x ∈ X, otherwise we called it an external NCq-ROF set.

Definition 8 . —

The score functions under R-order of NCq-ROFNs

NiCQRO=NiCQROL,NiCQROU,ΩNiCQROL,ΩNiCQROU,FNiCQRO,HNiCQRO, (11)

is define as

SNiCQRO=112q˘+12141+NiCQROL2q˘ΩNiCQROL2q˘+1+NiCQROU2q˘ΩNiCQROU2q˘+FNiCQRO2q˘HNiCQRO2q˘, (12)

now for P-order, we get

SNiCQRO=112q˘+12141+NiCQROL2q˘ΩNiCQROL2q˘+1+NiCQROU2q˘ΩNiCQROU2q˘+FNiCQRO2q˘HNiCQRO2q˘, (13)

and accuracy function is defined as

HNiCQRO=112q˘+1212NiCQROL2q˘+NiCQROU2q˘+ΩNiCQROL2q˘+ΩNiCQROU2q˘+FNiCQRO2q˘+HNiCQRO2q˘, (14)

with the condition that

1SNiCQRO1,0HNiCQRO1. (15)

Definition 9 . —

The comparison rule for two NCq-ROFNs

N1CQRO=N1CQROL,N1CQROU,ΩN1CQROL,ΩN1CQROU,FN1CQRO,HN1CQRO, (16)

and

N2CQRO=N2CQROL,N2CQROU,ΩN2CQROL,ΩN2CQROU,FN2CQRO,HN2CQRO, (17)

are defined as

(1) If S(N1CQRO)≻S(N2CQRO), then N1CQRO≻N2CQRO. (2) If S(N1CQRO)=S(N2CQRO)(a)H(N1CQRO)≻H(N2CQRO), then N1CQRO≻N2CQRO(b)H(N1CQRO)=H(N2CQRO), then N1CQRO ~ N2CQRO, where ″∼″ represent the “equivalent to.

Example 1 . —

Assuming that N1CQRO={([−.7, −.2], [−.2, −.1]), (−.3, −.5)} andN2CQRO={([−.5, −.4], [−.4, −.3]), (−.2, −.7)} are two NCq-ROFNs, the score function under R-order r are defined as

SNiCQRO=112q˘+12141+NiCQROL2q˘ΩNiCQROL2q˘+1+NiCQROU2q˘ΩNiCQROU2q˘+FNiCQRO2q˘HNiCQRO2q˘,SN1CQRO=112q˘+12141+.72q˘.22q˘+1+.22q˘.12q˘+.32q˘.52q˘,SN1CQRO=1123+12141+.723.223+1+.223.123+.323.523,SN1CQRO=1172141+.76.26+1+.26.16+.36.56,SN1CQRO=12141.117585+1.000063+0.0007290.15625,SN1CQRO=12142.117648+.155521,SN1CQRO=120.529412.155521,SN1CQRO=120.3744202,SN1CQRO=.1872101. (18)

For

SN2CQRO.SNiCQRO=112q˘+12141+NiCQROL2q˘ΩNiCQROL2q˘+1+NiCQROU2q˘ΩNiCQROU2q˘+FNiCQRO2q˘HNiCQRO2q˘,SN2CQRO=112q˘+12141+.52q˘.42q˘+1+.42q˘.32q˘+.22q˘.72q˘, (19)

where q = 3, then we get

SN2CQRO=1123+12141+.523.423+1+.423.323+.223.723,SN2CQRO=1172141+.56.46+1+.46.36+.26.76,SN2CQRO=12141.011529+1.003367+0.0000640.117649,SN2CQRO=12142.014896+0/117585,SN2CQRO=120.5037240117585,SN2CQRO=120.386139,SN2CQRO=.1930696. (20)

Now,

.1872101.1930696SN1CQROSN2CQRON1CQRON2CQRO (21)

Definition 10 . —

Considering the collection of NCq-ROFS to be Nλ(λ=1,2,…n), j ≥ 0, k ≥ 0, if

NCqROFHMj,kN1,N2,,Nn=2nn+1λ=1ns=1nNλjNsj1/j+k. (22)

It is then referred to as an NCq-ROFHM operator.

Theorem 1 . —

Assuming that j ≥ 0, k ≥ 0 and j+k ≥ 0, Nλ=(ΓNλ, ϜNλ)(λ=1,2,…n) are a set of NCq-ROFNs, the results of solving equation (22) are also NCq-ROFSs.

NCqROFHMλ1,λ2,λn=12q˘+11NλLjNSLk2q˘2/nn+11/2q˘j+k,12q˘+11NλUjNSUk2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=1n1ΩNλL2q˘j1ΩNsL2q˘k2/nn+11/j+k1/2q,12q˘+111Πλ=1nΠs=1n1ΩNλU2q˘j1ΩNsU2q˘k2/nn+11/j+k1/2q,12q˘+11NλjNSk2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=1n1ΩNλ2q˘1ΩNs2q˘k2/nn+11/j+k1/2q,. (23)

(Idempotency) Consider Nλ=N(ANλ, BNS)(λ=1,2,…n) be a collection of NCq-ROFNS, if allNλ are identical, that is Nλ=N=(ANλ, BNS) for all λ, then NCq-ROFHMj,k (N1, N2, Nn)=N.

Proof As, Nλ=N, ∀λ we have

NCqROFHMj,kN1,N2,..,Nn=2nn+1λ=1ns=λnNλjNsk1/j+k=Nj+k1/j+k=N. (24)

(Monotonicity):Let αλ, βλ(λ=1,2, ..n) represent the two NCq-ROFN families, if αλβλλ=1,2,…, n then

NCqROFHMj,kα1,α2,,αnNCqROFHMj,kβ1,β2,βn. (25)

Proof —

Since, αλβλ and αsβs for λ=1,2, ..n and s=i, i+1,…, n, we have

αλjαskβλjβsk. (26)

then

2nn+1λ=1ns=λnαλjαsk2nn+1λ=1ns=λnβλjβsk, (27)

so,

2nn+1λ=1ns=λnαλjαsk1/j+k2nn+1λ=1ns=λnβλjβsk1/j+k. (28)

And,

NCqROFHMj,kα1,α2,,αnNCqROFHMj,kβ1,β2,,βn. (29)

(Boundedness). Between the max and min operators is the NCq-ROFHM operator.

minN1,N2,,NnNCqROFHMj,kN1,N2,,NnmaxN1,N2,,Nn. (30)

Proof —

Let c=min(N1, N2,…, Nn), d=max(N1, N2,…, Nn).

Using the aforementioned theorem, we obtain

NCqROFHMj,kc,c,cNqQROFHMj,kN1,N2,,NnNCqROFHMj,kd,d,,d. (31)

And,

minN1,N2,,NnNCqROFHMj,kN1,N2,,NnmaxN1,N2,,Nn. (32)

Case 1 . —

The assertion that the recommended NCq-ROFHM operator transforms into the NCq-ROF basic HM operator if j = k=(1/2).

NCqROFHM1/21/2N1,N2,,Nn=12q˘+11Πλ=1nΠs=λn1NλLNSL2q˘2/nn+11/2q˘,12q˘+11Πλ=1nΠs=λn1NλUNSU2q˘2/nn+11/2q˘,12q˘+1Πλ=1nΠs=λn11ΩNλL2q˘1ΩNλL2q˘2/nn+11/2q˘,12q˘+1Πλ=1nΠs=λn11ΩNλU2q˘1ΩNλU2q˘2/nn+11/2q˘,,12q˘+11Πλ=1nΠs=λn1NλNS2q˘2/nn+11/2q˘,12q˘+1Πλ=1nΠs=λn11ΩNλ2q˘1ΩNs2q˘2/nn+11/2q˘. (33)

Case 2 . —

If j=k=1 then (14) change into

NCQROFHM1,1N1,N2,,Nn=12q˘+11Πλ=1nΠs=λn1NλLNSL2q˘2/nn+11/4q˘,12q˘+11Πλ=1nΠs=λn1NλUNSU2q˘2/nn+11/4q˘,12q˘+111Πλ=1nΠs=λn11ΩNλL2q˘1ΩNsL2q˘2/nn+11/21/2q˘12q˘+111Πλ=1nΠs=λn11ΩNλU2q˘1ΩNsU2q˘2/nn+11/21/2q˘,12q˘+11Πλ=1nΠs=λn1NλNS2q˘2/nn+11/2q˘,12q˘+111Πλ=1nΠs=λn11ΩNλ2q˘1ΩNs2q˘2/nn+11/21/2q˘. (34)

This means that it is also referred to as the N-cubic Q-rung orthopair fuzzy generalized interconnected square mean.

Case 3 . —

If j⟶0, (34) is reduced to

limj0NCQROFHMj,kN1,N2,,Nn=1nλ=1nNλj1/j=12q˘+11Πλ=1n1NλLk2q˘1/n1/j+k,12q˘+11Πλ=1n1NλUk2q˘1/n1/j+k,12q˘+111Πλ=1n11ΩNλL2q˘k1/n1/k1/2q˘,12q˘+111Πλ=1n11ΩNλU2q˘k1/n1/k1/2q˘,12q˘+11Πλ=1n1Nλk2q˘1/n1/j+k,12q˘+111Πλ=1n11ΩNλ2q˘k1/n1/k1/2q˘. (35)

It is sometimes referred to as the N-cubic q-rung s fuzzy generalized mean.

Case 4 . —

If j=1 and k⟶0, (27) becomes an N-cubic q-rung orthopair fuzzy average mean.

limk0NCQROFHMj,kN1,N2,,Nn=1nλ=1nNλ=12q˘+11λ=1n1NλL2q˘2/n1/2q,12q˘+11λ=1n1NλU2q˘2/n1/2q,12q˘+111λ=1n11ΩNλL2q˘1/n1/2q,12q˘+111λ=1n11ΩNλU2q˘1/n1/2q,12q˘+11λ=1n1Nλ2q˘1/n12q˘,12q˘+111λ=1n11ΩNλ2q˘1/n1/2q. (36)

Case 5 . —

If j⟶0, k⟶0, then the existing NCq-ROFHM change into

limj0NqQROFHMj,0N1,N2,,Nn=limk01nλ=1nNλj1/k=λ=1nNλ1/n. (37)

Note that we can get a variety of orthopair fuzzy sets by varying the value of the parameter q. As an illustration, the N-cubic Pythagorean fuzzy set is renovated by NCq-ROFHM if j = 1 and k = 1. In MADM situations, different characteristics typically have significant advantages. Thus, it appears that the NCq-ROFHM operator is indifferent with this characteristic. The weighted version of the NCq-ROFHM operator is defined as follows to address this issue:

Definition 11 . —

In this case, Nλ=(ANλ, BNλ)(λ=1,2,…, n) be the NCq-ROFN family, the weight vector of NCq-ROFNs is indicated by j ≥ 0, k ≥ 0, j+k ≥ 0, and w=(w1, w2,…, wn) for all wλ ∈ [0,1] and ∑λ=1nw=1.Then NCq-ROFWHM: [−1,0]n⟶[−1,0] such that

NCqROFWHMwj,kN1,N2,,Nn=2nn+1λ=1ns=1nwλNλjwsNsk1/j+k. (38)

Theorem 2 . —

Let Nλ=(ANλ, BNλ)(λ=1,2,…, n) be the collection of NCq-ROFNs, j ≥ 0, k ≥ 0 and j+k ≥ 0, and w=(w1, w2,…, wn) represents the weight vector of NCq-ROFNs, wλ ∈ [0,1] and ∑λ=1nw=1. Then, NCq-ROFNs are also included in the resulting equation (38) as

NCqROFWHMwj,kN1,N2,,Nn=12q˘+11Πλ=1nΠs=λn1NλL2q˘2/nn+11/2q˘j+k,12q˘+11Πλ=1nΠs=λn1NλU2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=λnΩNλL4q/nn+11/j+k1/2q˘,12q˘+111Πλ=1nΠs=λnΩNλU4q/nn+11/j+k1/2q˘,12q˘+11Πλ=1nΠs=λn1Nλ2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=λnΩNλ4q/nn+11/j+k1/2q˘. (39)

where

λL,λU=12q˘+111λL2q˘wλj/2q˘11sL2q˘wsk/2q˘,12q˘+111λU2q˘wλj/2q˘11sU2q˘wsk/2q˘,ΩλL,ΩλU=12q˘+111ΩλL2q˘wλj1ΩsL2q˘wsk1/2q˘,12q˘+111ΩλU2q˘wλj1ΩsU2q˘wsk1/2q˘,λ=12q˘+111λ2q˘wλj/2q˘11s2q˘wsk/2q˘,Ωλ=12q˘+111Ωλ2q˘wλj1Ωs2q˘wsk1/2q˘. (40)

The relationship between the structure of the two attributes can be established through the HM operator. Each attribute is linked with other attributes of the HM operator. However, when it comes to decision-making issues, this condition is often not being met. To prevent the separation of characteristics we can use different partitions to solve decision-making problems because we remember the structure of attribute relationships. There is no link between attributes. When they are divided by two partitions, the same attributes present in partitions have a connection to each other. With the typical HM operator, the partitions do not solve these kinds of issues so we now provide the N-cubic q-rung orthopair fuzzy power Hamy mean operator with the ability to let us know the issue. The condition given above can be mathematically explained as: Let Nλ=(ANλ, BNλ)(λ=1,2, ..n) be a collection of NCq-ROFNs, distributed into “g” different partitions FF1,F2,….,Fg with FiFı˜ and ∪i=1gFi={Ni}Fi={Ni1, Ni2,…Ni|Fi|}, where |Fi| denotes the cardinality of partitions Fi and ∑i=1g|Fi|=n. By using above information, NCQ-ROFPHM operator is defined as

Definition 12 . —

Let Nλ=(ANλ, BNλ)(λ=1,2, ..n) be a family of NCq-ROFNs,

j ≥ 0, k ≥ 0 and j+k ≥ 0. Then NCq-ROFPHM [−1,0]n⟶[−1,0] and

NCqROFPHMj,kN1,N2,,Nn=1gi=1g2FiFi+1λ=1Fis=λFiNiλjNisk1/j+k. (41)

Theorem 3 . —

Let Nλ=(ANλ, BNλ)(λ=1,2, ..n) be a family of NCq-ROFNs, j ≥ 0, k ≥ 0 and j+k ≥ 0, then equation (41) is used to generate a consequent equation that is likewise an NCq-ROFN, as shown by

NCqROFPHMj,kN1,N2,,Nn=12q˘+11Πi=1g111iL2q˘2/FiFi+11/j+k1/g1/2q˘,12q˘+11Πi=1g111iU2q˘2/FiFi+11/j+k1/g1/2q˘,12q˘+1Πi=1g11ΩiL4q/FiFi+11/j+k1/qg,12q˘+1Πi=1g11ΩiL4q/FiFi+11/j+k1/qg,12q˘+11Πi=1g111i2q˘2/FiFi+11/j+k1/g1/2q˘,12q˘+1Πi=1g11Ωi4q/FiFi+11/j+k1/qg, (42)

Where

iL=12q˘+11Πλ=1FiΠs=λFi1ANiλjBNiskq1/q˘,iU=12q˘+11Πλ=1FiΠs=λFi1ANiλjBNiskq1/q˘,ΩiL=12q˘+1Πλ=1FiΠs=λFi11BNiλ2q˘j1BNis2q˘k1/2q˘,ΩiU=12q˘+1Πλ=1FiΠs=λFi11BNiλ2q˘j1BNis2q˘k1/2q˘,i=12q˘+11Πλ=1FiΠs=λFi1ANiλjBNisk2q˘1/2q˘,Ωi=12q˘+1Πλ=1FiΠs=λFi11BNiλ2q˘j1BNis2q˘k1/2q˘. (43)

Theorem 4 . —

Let j ≥ 0, k ≥ 0 j+k ≥ 0,

Nλ=ANλ,BNλλ=1,2,,n. (44)

Be collection of NCq-ROFNs with g different subset Fλ(λ=1,2,…, n). Consequently, the NCq-ROFPHM operators have the following characteristics.

(Idempotency) If all Nλ are same that is, Nλ=N=(AN, BN)∀ λ then

NCqROFPHMj,kN1,N2,,Nn=N=AN,BN, (45)

Proof —

NCqROFPHMj,kN1,N2,,Nn=1gi=1g2FiFi+1λ=1Fis=λFiNiλjNisk1/j+k=1gi=1g2FiFi+1λ=1Fis=λFiNjNk1/j+k=1gi=1g2FiFi+1λ=1Fis=λFiNj+k1/j+k1gλ=1gN=N., (46)

(Monotonicity) Let Mλ=(AMλ, BMλ)(λ=1,2,…, n) be a set NCq-ROFNs having the same partitioned structure as Nλ=(ANλ, BNλ)(λ=1,2,…, n), AMλANλand BMλBNλ for all, then

NCqROFPHMj,kM1,M2,,Mn¨NCqROFPHMj,kN1,N2,,Nn¨. (47)

Proof —

Since, AMλANλand BMλBNλ for all λ using Definition 6, we can obtain, MλNλ for all, then AMjAMiskANjAisk and

12q˘+111BMiλ2q˘j1BMis2q˘k12q˘+111BNiλ2q˘j1BNis2q˘k. (48)

Further,

Mi=12q˘+11Πλ=1FiΠs=λFi1AMiλjBMisk2q˘1/2q12q˘+11Πλ=1FiΠs=λFi1ANiλjBNisk2q˘1/2q=Ni, (49)

and

ΩMi=12q˘+1Πλ=1FiΠs=λFi11BMiλ2q˘j1BMis2q˘k1/2q12q˘+1Πλ=1FiΠs=λFi11BNiλ2q˘j1BNis2q˘k1/2q=ΩNi. (50)

Thus,

12q˘+11Πi=1g111MiL2q˘2/FiFi+11/j+k1/g1/2q,12q˘+11Πi=1g111MiU2q˘2/FiFi+11/j+k1/g1/2q12q˘+11Πi=1g111NiL2q˘2/FiFi+11/j+k1/g1/2q,12q˘+11Πi=1g111NiU2q˘2/FiFi+11/j+k1/g1/2q, (51)

and

12q˘+1Πi=1g11ΩMiL4q/FiFi+11/j+k1/2qg,12q˘+1Πi=1g11ΩMiU4q/FiFi+11/j+k1/2qg12q˘+1Πi=1g11ΩNiL4q/FiFi+11/j+k1/2qg,12q˘+1Πi=1g11ΩNiU4q/FiFi+11/j+k1/2qg. (52)

Then we use (37), we get

NCqROFPHMj,kM1,M2,,MnNCqROFPHMj,kN1,N2,,Nn. (53)

(Boundedness) Let c = 〈maxλ(AN), minλ(BN)〉,d = 〈minλ(AN), maxλ(BN)〉,having a specific partition stricture Fλ(λ=1,2,…, n). Therefore,

cNCqROFPHMj,kN1,N2,,Nnd. (54)

Proof —

Since c = 〈maxλ(AN), minλ(BN)〉,d = 〈minλ(AN), maxλ(BN)〉,subsequently, based on the monotonicity, we have

NCqROFPHMj,kc,c,c=c, (55)

and

NCqROFPHMj,kd,d,,d=d. (56)

As a result,

cNCqROFPHMj,kN1,N2,,Nnd, (57)

thus proved. Various particular examples of the NCqROFPHM operator can be obtained by altering the number of partitions and various values of the parameters “j,k.” The NCqROFPHM operator renovate into usual NCqROFPHM if g=1 as follows:

NCqROFPHMj,kN1,N2,,Nn=2FiFi+1λ=1Fis=λFiN1λjN1sk1/j+k=2nn+1λ=1ns=λnNλjNsk1/j+k. (58)

By giving varied values to the parameters “j, k” and g=1, we can clearly obtain the situations covered in equations (33)–(37).

Definition 13 . —

Let Nλ=(ANλ, BNλ)(λ=1,2,…, n) be a set of NCq-ROFNs,

j ≥ 0, k ≥ 0 and j+k ≥ 0, and w=(w1, w2,…, wn) indicate the weight vector of NCq-ROFNs wλ ∈ [1,0] and ∑λ=1nw=1. Then NCq-ROFWPHM: [−1,0]n⟶[−1,0] such that

NCqROFWPHMwj,kN1,N2,,Nn=1gi=1g2FiFi+1λ=1Fis=λFiwiλNiλjwisNisk1/j+k. (59)

Theorem 5 . —

Let Nλ=(ANλ, BNλ)(λ=1,2,…, n) be a family of NCq-ROFNs where j ≥ 0, k ≥ 0and j+k ≥ 0, and w=(w1, w2,…, wn) represents the weight vector of NCq-ROFNs, ∑λ=1nw=1. Then we get resultant equation by using equation (59) that is also a NCq-ROFNs given by

NCqROFWPHMwj,kN1,N2,,Nn12q˘+11Πi=1g111iL2q˘2/FiFi+11/j+k1/g1/2q,12q˘+11Πi=1g111iU2q˘2/FiFi+11/j+k1/g1/2q,12q˘+1Πi=1g11ΩiL4q/FiFi+11/j+k1/qg,12q˘+1Πi=1g11ΩiL4q/FiFi+11/j+k1/qg,12q˘+11Πi=1g111iU2q˘2/FiFi+11/j+k1/g1/2q,12q˘+1Πi=1g11ΩiL4q/FiFi+11/j+k1/qg. (60)

where

iL=12q˘+11Πλ=1FiΠs=λFi111Niλ2q˘wiλj111Nis2q˘wisk1/2q,iU=12q˘+11Πλ=1FiΠs=λFi111Niλ2q˘wiλj111Nis2q˘wisk1/2q,ΩiL=12q˘+1Πλ=1FiΠs=λFi11Ωiλwiλ2qj1Ωiswit2qk1/2q,ΩiU=12q˘+1Πλ=1FiΠs=λFi11Ωiλwiλ2qj1Ωiswit2qk1/2q,i=12q˘+11Πλ=1FiΠs=λFi111Niλ2q˘wiλj111Nis2q˘wisk1/2q,Ωi=12q˘+1Πλ=1FiΠs=λFi11Ωiλwiλ2qj1Ωiswit2qk1/2q. (61)

4. Multi Attribute Group Decision-Making Method as an Application

In this section we will use NCq-ROFWHM and NCq-ROFWPHM operators to examine MAGDM problems, and to show their applicability with the help of NCq-ROFNs. Let A¨=A1,A2,,Am be a set of alternatives, C=C´1,C´2,,C´m and attributes with weight vector w = {w1,w2, …, wn}, where wı˜0,1 and ı˜=1nwı˜=1. Let =`1,`2,,`d be a group of experts with eight vector, ξ = {ξ1,ξ2, …, ξd}λ = where ξλ ∈ [0,1] and ∑λ=1dξλ = 1. Assume that the λth expert provides his opinion regarding the alternatives Ai = {1, 2, …, m} with regard to the qualities C´ı˜=1,2,,m as a NCq-ROFNs Niı˜λ=ANiı˜λ,BNiı˜λ.Using the expert's preference, an NCq-ROF decision matrix is created as Tλ=Niı˜λm×n. Consider that there are ‘g' divisions of the set F1, F2, F3,……, Fg and that there is a specified connection structure between the features while keeping in mind the natural relationship structure. There is no link between qualities from different partitions and those from the same partition. The established operators are then used to address these decision-making (DM) difficulties. Algorithm steps are provided by

  • Step 1: To normalize the decision matrix and obtain the benefit and cost-type data. Tˇ=N´iı˜λ=AN´iı˜λ,BN´iı˜λm×n converting the value of the cost-type attributes first to the value of the benefit-type attributes, and then
    N´iı˜λ=Niı˜λ for benefittype attribute ofı˜CNiı˜λcfor costtype attribute ofı˜C. (62)
  • where Niı˜λc=BNiı˜λ,ANiı˜λ.

  • Step 2: To aggregate all the normalized data. Tˇλ= (λ = 1,2,3,…, d) into a collective DM M=Viı˜m×n=AN´iı˜λ,BN´iı˜λm×n.
    Vij=NCqROFWHMξj,kN´iı˜1,N´iı˜2,N´iı˜3,,N´iı˜d12q˘+11Πλ=1nΠs=λn1NλL2q˘2/nn+11/2q˘j+k,12q˘+11Πλ=1nΠs=λn1NλU2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=λnΩNλL2q˘/nn+11/j+k1/2q12q˘+111Πλ=1nΠs=λnΩNλU2q˘/nn+11/j+k1/2q,12q˘+11Πλ=1nΠs=λn1Nλ2q˘2/nn+11/2q˘j+k,12q˘+111Πλ=1nΠs=λnΩNλ2q˘/nn+11/2j+k1/2q,, (63)
  • where
    λL,λU=12q˘+111λL2q˘Bλj/2q˘11sL2q˘Bsk/2q˘,12q˘+111λU2q˘Bλj/2q˘11sU2q˘Bsk/2q˘,,ΩλL,ΩλU=12q˘+111ΩλL2q˘Bλj1ΩsL2q˘Btkj/2q˘,12q˘+111ΩλU2q˘Bλj1ΩsU2q˘Btkj/2q˘,λL=12q˘+111λ2q˘Bλj/2q˘11s2q˘Bsk/2q˘,ΩλL=12q˘+111Ωλ2q˘Bλj1Ωs2q˘Btkj/2q˘. (64)
  • Step 3: Assume a division form among the attributes to arrive at the collective assessment values. Vi=AN´iı˜λ,BN´iı˜λi=1,2,3,m;ı˜=1,2,3,n of alternatives Ai.
    Vi=NCQROFWHPwj,kVi1Vi2,,Vin. (65)
  • Step 4: To find score values S^Vi of each alternative A(i = 1,2,3,…, m).

Example 2 . —

In this section we provide a brief overview of the outcomes of a brand-new technique and show its efficacy. Utilizing the full potential of mobile apps for online education, business administrators can check the effectiveness of these programs. Four possibilities have been suggested as possible options in the beginning stages. Moodle A1, LMS A2, Zoom A3, and NoonA4 are the four applications. There are four experts on the judgment board, [E1, E2, E3, E4] each with a different area of competence. Take into account that λ represents the different expert weights, or λ=(0.03,0.1,0.27,0.6). The five interconnected characteristics listed by the assessment committee are as follows: the app's download, data storage speeds, data loading speed in and battery use (C1an dC 2, C3 and C4, respectively). Assume represents different attribute weights, for example, w=(0.17,0.2,0.23,0.4). The two subsets of the five qualities are separated based on how they relate to one another fundamentally. F1={C1, C3, C5}, F1={C2, C4}. Data in the form of NCq-ROFNs must be submitted by experts for examination. The expert assessment statistics are displayed in Tables 14, and Ei=(i=1,2,3,4).

Table 1.

For NCq-ROFDM of Q1.

C 1 C 2 C 3 C 4 C 5
A 1 635461 735494 735494 965541 229597
A 2 857643 626561 856363 628663 724571
A 3 325596 657461 767498 865564 986571
A 4 428587 947566 876574 629554 756493

Table 2.

For NCq-ROFDM of Q2.

C 1 C 2 C 3 C 4 C 5
A 1 547572 763238 536468 433214 634281
A 2 325482 217694 754358 762163 215474
A 3 972161 972162 867385 657592 643265
A 4 536474 328564 655553 879554 423254

Table 3.

For NCq-ROFDM of Q3.

C 1 C 2 C 3 C 4 C 5
A 1 547572 763238 536468 433214 634281
A 2 325482 217694 754358 762163 215474
A 3 972161 972162 867385 657592 643265
A 4 536474 328564 655553 879554 423254

Table 4.

For NCq-ROFDM of Q4.

C 1 C 2 C 3 C 4 C 5
A 1 635461 735494 735494 965541 229597
A 2 857643 626561 856363 628663 724571
A 3 325596 657461 767498 865564 986571
A 4 428587 947566 876574 629554 756493
  •   Step 1: Given that C3 is a cost-type attribute, we can normalize the decision-making data using equation (62). The normalized data is displayed in Tables 58.

  •   Step 2: To obtain the entire decision matrix, use equation (63). M=U˜iı˜4×5=AU˜iı˜,BU˜iı˜4×5. Additionally, we set the parameters j = 1, k = 1, and q = 3 to be true. This MAGDM seeks to identify the best choice. The complete NCq-ROF decision matrix M is shown in Table 9.

  •   STEP 3: Use (23) to calculate all of the evaluation values for each option, then use Ai and U˜i to obtain the values for each alternative's Ai(i=1,2,3,4) collective evaluation.

  • U˜1=.0000754307,.0039453,.836279,.827616,.00345878,.865973, U˜2=.0000856423,.0054665,.839751,.829231,.00265612,.860356, U˜3=.0000346567,.0039675,.836134,.826964,.00467348,.863867, U˜4=.0000126569,.0067831,.830651,.825320,.00679601,.865328.

  •   STEP 4: We compute score values SU˜iof U˜i as follows: SU˜1=.57679527,SU˜2=.5976312,SU˜3=.56140327,SU˜4=0.5787565 as SU˜3>SU˜1>SU˜4>SU˜2.

Hence A3 > A1 > A4 > A2 and A3 is best alternative.The Influence of the parameter Values on the Ranking Results. In the following section, we will investigate how the parameters q, j, and k impact the findings of the alternatives. Put j=1, k=1 and q=3 in the previous computing technique for our convenience and without losing generality. From Table 10, it is clear that the ranking outcomes for the scenarios q=4,5,7,8 and A3 > A1 > A4 > A2 are identical. Thus the ranking outcomes are shown as in Figure 1, and finally, we can say that the other top options remain the same when the parameter's value changes.

Table 5.

For normalized NCq-ROFDM of Q1.

C 1 C 2 C 3 C 4 C 5
A 1 547572 763238 536468 433214 634281
A 2 325482 217694 754358 762163 215474
A 3 972161 972162 867385 657592 643265
A 4 536474 328564 655553 879554 423254

Table 6.

Of normalized NCq-ROFDM of Q2.

C 1 C 2 C 3 C 4 C 5
A 1 635461 735494 735494 965541 229597
A 2 857643 626561 856363 628663 724571
A 3 325596 657461 767498 865564 986571
A 4 428587 947566 876574 629554 756493

Table 7.

Of normalized NCq-ROFDM of Q3.

C 1 C 2 C 3 C 4 C 5
A 1 425371 874294 415426 534217 634263
A 2 642135 654394 426577 965328 214272
A 3 214396 543274 217538 657592 742165
A 4 536455 328564 534245 868554 522256

Table 8.

Of normalized NCq-ROFDM of Q4.

C 1 C 2 C 3 C 4 C 5
A 1 547572 763238 536468 433214 634281
A 2 325482 217694 754358 762163 215474
A 3 972161 972162 867385 657592 643265
A 4 536474 328564 655553 879554 423254

Table 9.

For collective NCq-ROFDM of M.

C 1 C 2 C 3 C 4 C 5
A 1 8823570100657722689063629437647078382 6775054408530945960287674816469176754 1563410569717804565057936709723048765 980032657461745276045512832719621549 786541004215967331898736481265343255
A 2 06373834207588546715429510764617032604 9764327854216432515443045816469176754 1563410569727804565057936709723048765 844501032167726235692963564317463246 854156064874905332170456567812462467
A 3 96319580327494761423218998348257343 049304394847768512126789346092566718 99860126653459985132192908723231168 304653086215374209174129444578235075 9461153864307535210642519878018521133
A 4 643012074213818596254591303785032105 88506873400246543194085256375019642 970547075908568652181623960782567149 974534375413568786293648851636166284 26301143665974624356891708643226138

Table 10.

Ranking result for various values of parameter q.

Q Score values Ranking results
q=4 S 1=−.5378, S2=−.5479, S3=−.5248, S4=−.5406 A`3>A1>A4>A2
q=5 S 1=−.5389, S2=−.5499, S3=−.5348, S4=−.5443 A`3>A1>A4>A2
q=7 S 1=−.5225, S2=−.5489, S3=−.5129, S4=−.5460 A`3>A1>A4>A2
q=8 S 1=−.5485, S2=−.5879, S3=−.5381, S4=−.5498 A`3>A1>A4>A2

Figure 1.

Figure 1

Ranking result for q = 4,5,7,8.

These are different from the results obtained for j=0 and k=1 having ranking results A4 > A1 > A2 > A3. As a result, it is possible to obtain varied ranking results by varying the values of the parameters j and k. If one parameter is fixed and the other is changed, the score and ranking results may change, as shown in Table 11. We can observe that the values of the parameters j and k affect the ranking outcomes, as shown in Figure 2.

Table 11.

Ranking result for different values of parameters j and k.

j And k Score values Ranking results
j=0, k=1 S1=−.5286, S2=−.5759, S3=−.5148, S4=−.5463 A3 > A1 > A4 > A2
j=3, k=1 S1=−.5409, S2=−.5592, S3=−.5948, S4=−.5873 A1 > A2 > A4 > A3
j=1, k=3 S1=−.5825, S2=−.4489, S3=−.5879, S4=−.5260 A2 > A4 > A1 > A3
j=0, k=5 S1=−.5695, S2=−.5779, S3=−.5235, S4=−.5983 A3 > A1 > A2 > A4
j=5, k=6 S1=−.5805, S2=−.5949, S3=−.5621, S4=−.5498 A4 > A3 > A1 > A2
j=7, k=1 S1=−.5951, S2=−.5765, S3=−.5743, S4=−.5885 A3 > A2 > A4 > A1
j=0, k=3 S1=−.5195, S2=−.5669, S3=−.5930, S4=−.5573 A1 > A4 > A2 > A3
j=1, k=0 S1=−.4585, S2=−.5379, S3=−.3981, S4=−.5198 A3 > A1 > A4 > A2
j=5, k=5 S1=−.5578, S2=−.5678, S3=−.5421, S4=−.5950 A3 > A1 > A2 > A4
j=6, k=4 S1=−.5085, S2=−.3459, S3=−.4081, S4=−.4985 A2 > A3 > A4 > A1

Figure 2.

Figure 2

Ranking result for various values of parameters j and k.

5. Conclusion

In this study, we focus on the structure of N-cubic q-rung orthopair fuzzy sets. The score function under R-order and the comparison rule for two N-cubic q-rung orthopair fuzzy sets also define some aggregation operators, i.e., N-cubic q-rung orthopair fuzzy Hamy mean operator, N-cubic q-rung orthopair fuzzy weighted Hamy mean operator, N-cubic q-rung orthopair fuzzy power Hamy mean operator, and N-cubic q-rung orthopair fuzzy power weighted Hamy mean operator. N-structure can enhance decision-making performance. The recently discovered N-cubic q-ROFSs, which combine NQ-ROFSs and NIVqRFSs into a single structure, allow decision-makers greater space to work on multi-attribute group decision-making problems. As a result of the debate, we have discussed specific instances of the operators and created a method for solving MAGDM problems using NCq-ROFNs. In this study we analyze the use of mobile app in the education sector. Further research, problem-solving, and decision-making are possible to solve, and other operators may be able to be created through this method. In future someone can apply the N-cubic q-rung orthopair fuzzy sets in different decision-making technique.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Authors' Contributions

All the authors contributed equally to the preparation of this manuscript.

References

  • 1.Zadeh L. A. Fuzzy sets. Information and Control . 1965;8(3):338–353. doi: 10.1016/s0019-9958(65)90241-x. [DOI] [Google Scholar]
  • 2.Zadeh L. A. Outline of a new approach to the analysis of complex system and decision processes interval-valued fuzzy sets. IEEE Transactions on Systems, Man, and Cybernetics . 1968;3 [Google Scholar]
  • 3.Turksen I. B., Bilgic T. Interval-valued strict preference with Zadeh triples. Fuzzy Sets and Systems . 1996;78(2):183–195. doi: 10.1016/0165-0114(95)00167-0. [DOI] [Google Scholar]
  • 4.Zadeh L. A. Learning Systems and Intelligent Robots . Boston, MA, USA: Springer; 1974. The concept of a linguistic variable and its application to approximatereasoning; pp. 1–10. [Google Scholar]
  • 5.Atanassov K. T. Intuitionistic fuzzy sets. Fuzzy Sets and Systems . 1986;20(1):87–96. doi: 10.1016/s0165-0114(86)80034-3. [DOI] [Google Scholar]
  • 6.Atanassov K. T. New operations defined over the intuitionistic fuzzy sets. Fuzzy Sets and Systems . 1994;61(2):137–142. doi: 10.1016/0165-0114(94)90229-1. [DOI] [Google Scholar]
  • 7.Wang W., Liu X., Qin Y. Interval-valued intuitionistic fuzzy aggregation operators. Journal of Systems Engineering and Electronics . 2012;23(4):574–580. doi: 10.1109/jsee.2012.00071. [DOI] [Google Scholar]
  • 8.Yager R. R. Pythagorean membership grades in multi criteria decision making. IEEE Transactions on Fuzzy Systems . 2014;22(4):958–965. doi: 10.1109/tfuzz.2013.2278989. [DOI] [Google Scholar]
  • 9.Yager R. R. Generalized orthopair fuzzy Sets. IEEE Transactions on Fuzzy Systems . 2017;25(5):1222–1230. doi: 10.1109/tfuzz.2016.2604005. [DOI] [Google Scholar]
  • 10.Ali M. I. Another view on q-rung orthopair fuzzy sets. International Journal of Intelligent Systems . 2018;33(11):2139–2153. doi: 10.1002/int.22007. [DOI] [Google Scholar]
  • 11.Liu P., Wang P. Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. International Journal of Intelligent Systems . 2018;33(2):259–280. doi: 10.1002/int.21927. [DOI] [Google Scholar]
  • 12.Wei G., Wei C., Wang J., Gao H., Wei Y. Some q-rung orthopair fuzzy Maclaurin symmetric mean operators and their applications to potential evaluation of emerging technology commercialization. International Journal of Intelligent Systems . 2019;34(1):50–81. doi: 10.1002/int.22042. [DOI] [Google Scholar]
  • 13.Hussain A., Ali M. I., Mahmood T., Munir M. q-Rung orthopair fuzzy soft average aggregation operators and their application in multicriteria decision-making. International Journal of Intelligent Systems . 2020;35(4):571–599. doi: 10.1002/int.22217. [DOI] [Google Scholar]
  • 14.Khan S. K., Gulistan M., Wahab H. A. Development of the structure of q-rung orthopair fuzzy hypersoft set with basic operations. Punjab University Journal of Mathematics . 2021;53(12):881–892. doi: 10.52280/pujm.2021.531204. [DOI] [Google Scholar]
  • 15.Jun Y. B., Kim C. S., Yang K. O. Cubic sets. Annals of Fuzzy Mathematics and Informatics . 2012;1:83–98. [Google Scholar]
  • 16.Garg H., Chen S. M. Multiattribute group decision making based on neutrality aggregation operators of q-rung orthopair fuzzy sets. Information Sciences . 2020;517:427–447. [Google Scholar]
  • 17.Kaur G., Garg H. Multi-attribute decision-making based on Bonferroni mean operators under cubic intuitionistic fuzzy set environment. Entropy . 2018;20(1):p. 65. doi: 10.3390/e20010065. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 18.kaur G., Garg H. Cubic intuitionistic fuzzy aggregation operators. International Journal for Uncertainty Quantification . 2018;8(5):405–427. doi: 10.1615/int.j.uncertaintyquantification.2018020471. [DOI] [Google Scholar]
  • 19.Abbas S. Z., Ali Khan M. S., Abdullah S., Sun H., Hussain F. Cubic Pythagorean fuzzy sets and their application to multi-attribute decision making with unknown weight information. Journal of Intelligent and Fuzzy Systems . 2019;37(1):1529–1544. doi: 10.3233/jifs-18382. [DOI] [Google Scholar]
  • 20.Zhang B., Mahmood T., Ahmmad J., Khan Q., Ali Z., Zeng S. Cubic q-rung orthopair fuzzy Heronian mean operators and their applications to multi-attribute group decision making. Mathematics . 2020;8(7):p. 1125. doi: 10.3390/math8071125. [DOI] [Google Scholar]
  • 21.Jun Y. B., Lee K. J., Song S. Z. N-Ideals of BCK/BCI–algebras. J.Chungcheong Math.Soc. . 2009;22:417–437. [Google Scholar]
  • 22.Rashid S., Gulistan M., Jun Y. B., Khan S., Kadry S. N-Cubic sets and aggregation operators. Journal of Intelligent and Fuzzy Systems . 2019;37(4):5009–5023. doi: 10.3233/jifs-182595. [DOI] [Google Scholar]
  • 23.Petrovic I., Kankaras M. A hybridized IT2FS-DEMATEL-AHP-TOPSIS multicriteria decision making approach: case study of selection and evaluation of criteria for determination of air traffic control radar position. Decision Making: Applications in Management and Engineering . 2020;3(1):134–152. doi: 10.31181/dmame2003134p. [DOI] [Google Scholar]
  • 24.Agarwal P., Nieto J. J., Ruzhansky M., Torres D. F., editors. Analysis of Infectious Disease Problems (Covid-19) and Their Global Impact . Singapore: Springer; 2021. [Google Scholar]
  • 25.Ali Z., Mahmood T., Ullah K., Khan Q. Einstein geometric aggregation operators using a novel complex interval-valued pythagorean fuzzy setting with application in green supplier chain management. Reports in Mechanical Engineering . 2021;2(1):105–134. doi: 10.31181/rme2001020105t. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

No data were used to support this study.


Articles from Computational Intelligence and Neuroscience are provided here courtesy of Wiley

RESOURCES