Next Article in Journal / Special Issue
A Theoretical Development of Cubic Pythagorean Fuzzy Soft Set with Its Application in Multi-Attribute Decision Making
Previous Article in Journal
Big Data Clustering Using Chemical Reaction Optimization Technique: A Computational Symmetry Paradigm for Location-Aware Decision Support in Geospatial Query Processing
Previous Article in Special Issue
Gas Cooled Graphite Moderated and Pressurized Water Reactor the Optimal Choice for Nuclear Power Plants Based on a New Group Decision-Making Technique
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Confidence Levels Complex q-Rung Orthopair Fuzzy Aggregation Operators and Its Application in Decision Making Problem

1
Department of Mathematics, Abdul Wali Khan University Mardan, Mardan 23200, Pakistan
2
Department of Mathematics, Deanship of Applied Sciences, Umm Al-Qura University, Makkah 24231, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(12), 2638; https://doi.org/10.3390/sym14122638
Submission received: 21 November 2022 / Revised: 2 December 2022 / Accepted: 6 December 2022 / Published: 13 December 2022
(This article belongs to the Special Issue Recent Advances in Fuzzy Optimization Methods and Models)

Abstract

:
The theory investigated in this analysis is substantially more suitable for evaluating the dilemmas in real life to manage complicated, risk-illustrating, and asymmetric information. The complex Pythagorean fuzzy set is expanded upon by the complex q-rung orthopair fuzzy set (Cq-ROFS). They stand out by having a qth power of the real part of the complex-valued membership degree and a qth power of the real part and imaginary part of the complex-valued non-membership degree that is equal to or less than 1. We define the comparison method for two complex q-rung orthopair fuzzy numbers as well as the score and accuracy functions (Cq-ROFNs). Some averaging and geometric aggregation operators are examined using the Cq-ROFSs operational rules. Additionally, their main characteristics have been fully illustrated. Based on the suggested operators, we give a novel approach to solve the multi-attribute group decision-making issues that arise in environmental contexts. Making the best choice when there are asymmetric types of information offered by different specialists is the major goal of this work. Finally, we used real data to choose an ideal extinguisher from a variety of options in order to show the effectiveness of our decision-making technique. The effectiveness of the experimental outcomes compared to earlier research efforts is then shown by comparing them to other methods.

1. Introduction

In 1965 , Zadeh [1] defined the theory of fuzzy set (FS). A fuzzy set is a fantastic achievement with several applications in numerous industries. A fuzzy set is centered on the characteristic function whose membership degree (MD) is expressed by σ for every element of universal set X on the [ 0 , 1 ] . A relative fundamental uncertain information in preference and uncertain involved information fusion were defined by Jin et al. [2]. In group decision-making given basic uncertain information, Li et al. [3] presented some extensive rules-based and preferences-induced weights allocation. An intuitionistic fuzzy set (IFS) [4] has two functions, MD and non-membership degree (NMD), for every element of universal set X, on the closed interval [ 0 , 1 ] . Further, the total of μ and υ , or sum μ , υ [ 0 , 1 ] , belongs to this range. The intuitionistic fuzzy set is aware that values should not be permitted to exist apart from their attributes. Yager [5,6] established the Pythagorean fuzzy set (PFS) definition for this restriction by broadening the IFS domain. Additionally, a Pythagorean fuzzy set has two functions, MD and NMD, which represented by μ and υ for each number on the closed interval [ 0 , 1 ] . Because Pythagorean fuzzy set has a wider domain than the intuitionistic fuzzy set, it is the generalized version of the intuitionistic fuzzy set. For additional information on the IFS and Pythagorean fuzzy set see (Asiain et al. [7], Li [8], and Peng and Yang [9], Garg [10], Lu et al. [11]).
There are still some problems that IFSs and PFSs are unable to resolve, against the fact that IFSs and PFSs can precisely characterize the confusing data. For instance, the criterion of Pythagorean fuzzy numbers, such as 0.7 + 0.9 = 1.6 > 1 , is met when the expert chooses 0.7 for MD and 0.9 for NMD. In order to deal with complex and ambiguous information, Yager [12] developed the idea of q-rung orthopair fuzzy set (q-ROFS), which is more effective and general than the intuitionistic fuzzy set and Pythagorean fuzzy set. To calculate the assessment details, Liu and Wang [13] proposed q-ROF aggregation operators. The q-ROF Bonferroni mean q-ROFS setting operators have been studied by Liu et al. [14]. Riaz et al. [15] developed some q-ROF hybrid aggregation operators and TOPSIS method for multi-attribute decision making (MADM). Riaz et al. [16] studied a robust q-ROF Einstein prioritized aggregation operators (AOs) with application towards multi-attribute group decision making (MAGDM). The AOs for q-ROFS are defined by Peng et al. [17], and additional q-ROFS research was presented in [18,19,20,21,22,23,24].
It should be kept in mind that other researchers have combined fuzzy sets and complex numbers, including Buckly [25], Zhang et al. [26], and Nguyen et al. [27]. The complex fuzzy sets (CFSs) paradigm, which is a generalization of FSs, was also described by Ramot et al. [28]. This definition is somewhat distinct from earlier research in that it broadened the range of membership function of the unit circle in the complex plane. The CFS is denoted by a complex valued function, for example μ A ( z ) = κ A ( z ) e 2 π i κ A ( z ) and satisfied the condition: 0 κ A ( z ) + κ A ( z ) 1 . The difference between complex fuzzy sets and fuzzy sets is that complex fuzzy sets range is stretched out in a sophisticated plan to a unit disc rather than being restricted to [ 0 , 1 ] . The information in the CFSs has drawn more focus in the fuzzy set theory. The time series forecasting utilizing the complex fuzzy logic and a thorough examination of CFSs has been proposed by Yazdanbakhsh and Dick [29]. Recently, complex fuzzy geometric aggregation operators were defined by Bi et al. [30]. The CFS has been widely used to solve issues in decision making (DM) and other domains because of its advantages and qualities [31]. Since then, fuzzy sets and complex fuzzy sets can define only the MD and their complex-valued degree, and cannot express NMD and complex-valued degree. Alkouri et al. [32] defined the structure of CIFSs that is represented by MD and NMD. Ma et al. [33] developed the idea of complex fuzzy set for resolving issues with several periodic factors. Dick et al. [34] studied a number of CFSs. Hu et al. [35] evaluated the consistency of CFS operations and proposed some new procedures for the complex fuzzy set. Greenfield et al. [36] proposed a fresh definition of a complex interval-valued fuzzy set, which unquestionably advanced the idea of complex fuzzy sets and broadened the interval-valued fuzzy set concept.
After all, some theories, such as fuzzy set, intuitionistic fuzzy set, complex fuzzy set, and complex interval-valued fuzzy set, are frequently employed to treat data imprecision. Singh et al. [37] constructed interval valued lattices for CFS and their granular decomposition. The notion of a complex fuzzy soft set and entropy measure were first suggested and examined by Selvachandran et al. [38] in their study. Selvachandran et al. [39] offered a number of CFS similarity tests, and their properties in pattern recognition were researched. Quek and Selvachandran investigated group-associated CIFS algebraic structures in [40], while [41] discussed the uses of CFS in e-commerce. Complex fuzzy lattice and complex fuzzy interval-valued soft set concepts are covered in [42,43], respectively. New generalized Bonferroni mean (BM) operators, as well as robust average/geometric aggregation operators, were created for CIFS by Garg and Rani [44,45]. By combining competition graphs with CPFSs, Akram and Aqsa [46] developed the new idea of CPF competition graphs. Garg et al. [47] studied the unique technique of Cq-ROFS as a combination of q-ROFS to deal with difficult and complex information in real life problems. The Cq-ROFS requirement states that the sum of the q-powers of the real part (imaginary) part of the MD and NMD shall not exceed one from the unit interval.
The theory of confidence level among the Cq-ROFS is presented in this paper, maintaining the advantages of this hybrid concept and emphasizing the importance of aggregation operators. To fuse various kinds of data, several averaging and geometric aggregation operators based on confidence levels complex q-rung orthopair are provided. The discussion of some fundamental features continues. These operators are able to more clearly explain the real-world problems. We provide details about these operators’ fundamental characteristics. We also define a multi-criteria group decision-making (MCGDM) approach based on the CCq-ROFS operators. An illustrative example is used to demonstrate the strategy’s practicality and effectiveness.
The rest of the paper is organized as follows. We provide a brief summary of the definitions of CFSs, CIFS, and CPFSs, in Section 2. In Section 3, we define Cq-ROFSs and suggest a few straightforward operational laws for CCq-ROFNs, and on the basis of these stated operational rules, a few series of averaging and geometric aggregation operators was built. An algorithm using the defined operators and CCq-ROFS information about MCGDM problem is discussed in Section 4. In Section 5, we describe an illustrative case to demonstrate the functioning of the proposed method and contrast its outcomes with some of the existing outcomes of the approaches, In Section 6, we summarize this study.

2. Preliminaries

In this section, we show other concepts and provide a brief literature review of earlier ideas including CFS, CIFS, CPFS, and Cq-ROFSs.
Complex fuzzy set
It was Buckley [25] who first proposed this idea, and it has since grown to be a hot area of study in fuzzy set theory. Complex numbers and fuzzy sets are absolutely relevant to the complex fuzzy number, but in a quite different way from the way that is covered in this article. The diversity of values that the membership function of the complex fuzzy set may achieve is what makes it novel. This range is expanded to the complex plane’s unit circle rather than being constrained to the range [ 0 , 1 ] , as is the case with a typical fuzzy membership function. A mathematical framework for expressing membership in a set in terms of a complex number is thus provided by the complex fuzzy set.
Definition 1 
([28]). A CFS C on a universal set X ϕ is defined as C = z , μ C ( z ) | z X , where μ C : X { z : z C , z 1 } and μ C ( z ) = a + i b = κ C ( z ) · e 2 π i C ( z ) . Here, κ C ( z ) = a 2 + b 2 R and κ C ( z ) , C ( z ) 0 , 1 , where i = 1 .
Complex intuitionistic fuzzy set
Alkouri and Salleh [32] presented the idea of the complex intuitionistic fuzzy set, which is generalized from the ground-breaking idea of a complex fuzzy set by including the non-membership term in the definition of CFS. Instead of [0, 1] as in the conventional intuitionistic fuzzy functions, the ranges of values for both membership and non-membership functions are extended to the unit circle in the complex plane.
Definition 2 
([31]). A CIFS I on a universal set X ϕ is defined as I = z , μ I ( z ) , υ I ( z ) | z X , where μ I : X { z 1 : z 1 I , z 1 1 } , υ i : X { z 2 : z 2 I , z 2 1 } , such as μ I ( z ) = z 1 = a 1 + i b 1 and υ I ( z ) = z 2 = a 2 + i b 2 with 0 z 1 + z 2 1 or μ I ( z ) = κ I ( z ) · e 2 π i κ I ( z ) and υ i ( z ) = ξ I ( z ) · e 2 π i ξ I ( z ) satisfy the condition; 0 κ I ( z ) + ξ I ( z ) 1 and 0 κ I ( z ) + ξ I ( z ) 1 . The term H I ( z ) = R · e 2 π i R , such as R = 1 ( z 1 + z 2 ) and R ( z ) = 1 κ I ( z ) + ξ I ( z ) is considered as a hesitancy degree of z . Furthermore, I = κ · e 2 π i κ , ξ · e 2 π i ξ is called complex intuitionistic fuzzy number.
Complex Pythagorean fuzzy set
Ullah et al. [46] presented the idea of the complex Pythagorean fuzzy set. The Pythagorean fuzzy set extension known as complex Pythagorean fuzzy set is utilized to manage degrees whose ranges are expanded from real to complex subset with unit disc. The limitations of CIFS are addressed by the complex Pythagorean fuzzy set (CPFS), which has relatively liberal amplitude and phase term constraints. Due to its propensity to handle two-dimensional ambiguous information effectively, the phase term of the CPFS is crucial and gives it the upper hand over all other models.
Definition 3 
([46]). A CPFS P on a universal set X ϕ is defined as P = z , μ P ( z ) , υ P ( z ) | z X , where μ P : X { z 1 : z 1 P , z 1 1 } , υ P : X { z 2 : z 2 P , z 2 1 } such as μ P ( z ) = z 1 = a 1 + i b 1 and υ P ( z ) = z 2 = a 2 + i b 2 with 0 z 1 2 + z 2 2 1 or μ P ( z ) = κ P ( z ) · e 2 π i κ P ( z ) and υ P ( z ) = ξ P ( z ) · e 2 π i ξ P ( z ) satisfy the condition, 0 κ P 2 ( z ) + ξ P 2 ( z ) 1 and 0 κ P ( z ) 2 + ξ P ( z ) 2 1 . The term H P ( z ) = R · e 2 π i R , such as R = 1 ( κ P 2 ( z ) + ξ P 2 ( z ) ) and R ( z ) = 1 κ P ( z ) 2 + ξ P ( z ) 2 is the hesitancy degree of z . Furthermore, P = κ · e 2 π i κ , ξ · e 2 π i ξ is called complex Pythagorean fuzzy number.

3. Complex q-Rung Orthopair Fuzzy Aggregation Operators

This section introduces complex q-rung orthopair fuzzy set and its fundamental operating laws and AOs for complex q-rung orthopair fuzzy numbers.
Complex q-rung orthopair fuzzy set
Liu [48] was the first to present the idea of the complicated q-rung orthopair fuzzy set. The complex intuitionistic fuzzy sets and the complex Pythagorean fuzzy sets cannot compare to the Cq-ROFS in terms of their ability to communicate ambiguous information. Their distinguishing feature is that the space of uncertain information they can describe is larger because the sum of the qth powers of the real part (or imaginary part, in the case of complex-valued membership degrees), and the qth powers of the real part (or imaginary part, in the case of complex-valued non-membership degrees, is equal to or less than 1.
Definition 4 
([48]). A Cq-ROFS S on a universal set X ϕ is of the shape S = { z , μ S ( z ) , υ S ( z ) | z X } , where μ S : X { z 1 : z 1 S , z 1 1 } , and υ S : X { z 2 : z 2 S , z 2 1 } , such as μ S ( z ) = z 1 = a 1 + i b 1 and υ S ( z ) = z 2 = a 2 + i b 2 , with 0 z 1 q + z 2 q 1 or μ S ( z ) = κ S ( z ) · e 2 π i κ S ( z ) and υ S ( z ) = ξ S ( z ) · e 2 π i ξ S ( z ) satisfy the conditions; 0 κ S q ( z ) + ξ S q ( z ) 1 and 0 κ S ( z ) q + ξ S ( z ) q 1 . The term H S ( z ) = R · e 2 π i R , such as R = 1 κ S q ( z ) ξ S q ( z ) q and R ( z ) = 1 κ S ( z ) q + ξ S ( z ) q q is the hesitancy degree of z . Furthermore, S = κ · e 2 π i κ , ξ · e 2 π i ξ is referred as complex q-rung orthopair fuzzy number.
Definition 5 
([48]). For a Cq-ROFN = κ , κ , ( ξ , ξ ) , the score function is defined as,
S c o * = 1 2 κ q ξ q + κ q ξ q ,
and accuracy function,
H c o * = 1 2 κ q + ξ q + κ q + ξ q ,
where S c o * [ 2 , 2 ] and H c o * [ 0 , 2 ] .
Definition 6 
([48]). The two Cq-ROFNs 1 and 2 satisfy the subsequent comparison conditions:
  • If S c o * 1 > S c o * 2 , then 1 > 2 .
  • If S c o * 1 = S c o * 2 , then 1 = 2 .
    (a).
    If H c o * 1 > H c o * 2 , then 1 > 2 .
    (b).
    If H c o * 1 = H c o * 2 , then 1 = 2 .
Definition 7. 
Let 1 = κ 1 , κ 1 , ξ 1 , ξ 1 and
2 = κ 2 , κ 2 , ξ 2 , ξ 2 are the two Cq-ROFNs. Then, their distance measure is defined as,
d ( 1 , 2 ) = 1 4 κ 1 q κ 2 q + ξ 1 q ξ 2 q + 1 2 π κ 1 q κ 2 q + ξ 1 q ξ 2 q .

Operational Laws on Complex q-Rung Orthopair Fuzzy Numbers

Definition 8 
([48]). For two Cq-ROFNs 1 = κ 1 , κ 1 , ξ 1 , ξ 1 and
2 = κ 2 , κ 2 , ξ 2 , ξ 2 and λ (positive real number). Then, the basic operation laws are defined as,
  • 1 2 = 1 i = 1 2 1 κ i q , 2 π 1 i = 1 2 1 κ i q 2 π q , i = 1 2 ξ i , 2 π i = 1 2 ξ i 2 π .
  • 1 2 = i = 1 2 κ i , 2 π i = 1 2 κ i 2 π , 1 i = 1 2 1 ξ i q , 2 π 1 i = 1 2 1 ξ i q 2 π q .
  • λ 1 = 1 1 κ 1 q λ , 2 π 1 1 κ 1 q 2 π λ q , ξ 1 λ , 2 π ξ 1 2 π λ .
  • 1 λ = κ 1 λ , 2 π κ 1 2 π λ , 1 1 ξ 1 q λ , 2 π 1 1 ξ 1 q 2 π λ q .

Aggregation Operators on Complex q-Rung Orthopair Fuzzy Numbers

Definition 9 
([48]). Let a set of Cq-ROFNs are i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) . Then, the aggregated value collected by utilizing the Cq-ROFA operator is still a Cq-ROFN and is given as,
C q R O F W A 1 , d o t s , n = 1 i = 1 n 1 κ i q w i , 2 π 1 i = 1 n 1 κ i q 2 π w i q , i = 1 n ξ i w i , 2 π i = 1 n ξ i 2 π w i ,
the weight vector of Cq-ROFNs are w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 .
Definition 10 
([48]). Let a set of Cq-ROFNs be i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) . Then, the aggregated value collected by utilizing the Cq-ROFG operator is still a Cq-ROFN and is given as,
C q R O F W G 1 , , n = i = 1 n κ i w i , 2 π i = 1 n κ i 2 π w i 1 i = 1 n 1 ξ i q w i , 2 π 1 i = 1 n 1 ξ i q 2 π w i q ,
the weight vector of Cq-ROFNs are w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 .

4. Complex q-Rung Orthopair Fuzzy Operator with Confidence Levels

In general, not all current concepts include the confidence levels of experts regarding their familiarity and grasp of the evaluated alternatives in the fusion of Cq-ROFNs. Integrating expert confidence levels with the options evaluated results in the proposal of a set of confidence complex q-rung orthopair fuzzy average and geometric aggregation operators.

4.1. Confidence Complex q-Rung Orthopair Fuzzy Averaging Operator

Definition 11. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i is the confidence levels of i . Then, a confidence complex q-rung orthopair fuzzy weighted average (CCq-ROFWA) aggregation operator is a function C C q R O F A : Ω n Ω is defined by
C C q R O F W A 1 , I 1 , , n , I n = i = 1 n w i I i i , = w 1 I 1 1 w 2 I 2 2 w n I n n
where the weight vector of Cq-ROFNs are w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 .
Theorem 1. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i be the confidence levels of i with 0 I i 1 , the corresponding weight vector w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 . Then, the aggregated value obtain by utilizing CCq-ROFWA operator is again a Cq-ROFN and given as,
C C q R O F W A 1 , I 1 , , n , I n = 1 i = 1 n 1 κ i q I i w i , 2 π 1 i = 1 n 1 κ i q 2 π I i w i q , i = 1 n ξ i I i w i , 2 π i = 1 n ξ i 2 π I i w i
Proof. 
We prove that Equation (7) holds by using mathematical induction principle. For each i , i is a Cq-ROFN and i > 0 , therefore, w i I i i is again Cq-ROFN. Utilizing mathematical induction on n , we obtain
(1). For n = 2 , we have
C C q R O F W A 1 , I 1 , 2 , I 2 = w 1 I 1 1 w 2 2 , I 2 .
We have,
w 1 I 1 1 = 1 1 κ 1 q I 1 w 1 , 2 π 1 1 κ 1 q 2 π I 1 w 1 q , ξ 1 I 1 w 1 , 2 π ξ 1 2 π I 1 w 1
and
I 2 w 2 2 = 1 1 κ 2 q I 2 w 2 , 2 π 1 1 κ 2 q 2 π I 2 w 2 q , ξ 2 I 2 w 2 , 2 π ξ 2 2 π I 2 w 2
Thus, by applying the Cq-ROFNs addition law, we have
C C q R O F W A 1 , I 1 , 2 , I 2 = 1 1 κ 1 q I 1 w 1 , 2 π 1 1 κ 1 q 2 π I 1 w 1 q , ξ 1 I 1 w 1 , 2 π ξ 1 2 π I 1 w 1
1 1 κ 2 q I 2 w 2 , 2 π 1 1 κ 2 q 2 π I 2 w 2 q , ξ 2 I 2 w 2 , 2 π ξ 2 2 π I 2 w 2
= 1 i = 1 2 1 κ i q I i w i , 2 π 1 i = 1 2 1 κ i q 2 π I i w i q , i = 1 2 ξ i I i w i , 2 π i = 1 2 ξ i 2 π I i w i
Thus, the result holds for n = 2
(2). Suppose that Equation (7) is true for n = κ , then
C C q R O F W A 1 , I 1 , , κ , I κ = 1 i = 1 κ 1 κ i q I i w i , 2 π 1 i = 1 κ 1 κ i q 2 π I i w i q , i = 1 κ ξ i I i w i , 2 π i = 1 κ ξ i 2 π I i w i
Then, for n = κ + 1 , we obtain
C C q R O F W A 1 , I 1 , , κ , I κ , κ + 1 , I κ + 1 = C C q R O F W A w 1 I 1 1 , , w κ I κ κ w κ + 1 I κ + 1 κ + 1 = 1 i = 1 κ 1 κ i q I i w i , 2 π 1 i = 1 κ 1 κ i q 2 π I i w i q , i = 1 κ ξ i I i w i , 2 π i = 1 κ ξ i 2 π I i w i
1 1 κ κ + 1 q I κ + 1 w κ + 1 , 2 π 1 1 κ κ + 1 q 2 π I κ + 1 w κ + 1 q , ξ κ + 1 I κ + 1 w κ + 1 , 2 π ξ κ + 1 2 π I κ + 1 w κ + 1
= 1 i = 1 κ + 1 1 κ i q I i w i , 2 π 1 i = 1 κ + 1 1 κ i q 2 π I i w i q , i = 1 κ + 1 ξ i I I w i , 2 π i = 1 κ + 1 ξ i 2 π I i w i
Hence, Equation (7) is true for all value of n .
Using Theorem (1), the Cq-ROFA operator satisfies some of the properties described below.
Property 1 (Idempotency). 
Let 0 = κ 0 , κ 0 , ξ 0 , ξ 0 i = 1 , , n be the set of Cq-ROFNs, and I 0 is the confidence levels of 0 , and if i , I i = 0 , I 0 ( i = 1 , , n ) . Then,
C C q R O F W A ( 1 , I 1 , , n , I n ) = 0 , I 0
Proof. 
Let 0 , I 0 and n , I n be the CCq-ROFNs, such that i = 0 for all i , which implies that κ i = κ 0 , ξ i = ξ 0 , κ i = κ 0 , ξ i = ξ 0 and I i = I 0 for all i . Then, using Definition of w i , we have i = 1 n w i = 1 . So, by the Theorem (1), we obtain
C C q R O F W A ( 1 , I 1 , , n , I n ) = 1 i = 1 n 1 κ 0 q I w i , 2 π 1 i = 1 n 1 κ 0 q 2 π I w i q , i = 1 n ξ 0 I w i , 2 π i = 1 n ξ 0 2 π I w i = 1 1 κ 0 q I i = 1 n w i , 2 π 1 1 κ 0 q 2 π I i = 1 n w i q , ξ 0 I i = 1 n w i , 2 π ξ 0 2 π I i = 1 n w i
= 1 1 κ 0 q I , 2 π 1 1 κ 0 q 2 π I q , ξ 0 I , 2 π ξ 0 2 π I = 0 , I 0
Property 2 (Boundedness). 
Let i = κ i , κ i , ξ i , ξ i i = 1 , , n be the set of Cq-ROFNs, and I i is the confidence levels of i , where = { min i κ i , min i κ i , max i ξ i , max i ξ i } and
+ = max i κ i , max i κ i , min i ξ i , min i ξ i . Then,
C C q R O F W A ( 1 , I 1 , , n , I n ) + .
Proof. 
Take , I C C q R O F W A ( 1 , I 1 , , n , I n ) , then by the Theorem (1), for a Cq-ROFN i , we have
min i κ i κ i max i κ i 1 max i κ i 1 κ i 1 min i κ i 1 max i κ i w i 1 i w i 1 min i κ i I i w i i = 1 n 1 max i κ i I i w i i = 1 n 1 κ i I i w i i = 1 n 1 min i κ i I i w i 1 max i κ i I i i = 1 n w i i = 1 n 1 κ i w i 1 min i κ i i = 1 n w i 1 max i κ i i = 1 n 1 κ i I i w i 1 min i κ i min i κ i 1 i = 1 n 1 κ i I i w i max i κ i min i κ i κ max i κ i .
Further,
min i ξ i ξ i max i ξ i min i ξ i I i w i ξ i w i max i ξ i I i w i i = 1 n min i ξ i I i w i i = 1 n ξ i w i i = 1 n max i ξ i I i w i min i ξ i i = 1 n I i w i i = 1 n ξ i I i w i max i ξ i i = 1 n I i w i min i ξ i i = 1 n ξ i I i w i max i ξ i min i ξ i ξ max i ξ i .
Similarly, we can obtain min i κ i κ max i κ i , and min i ξ i ξ max i ξ i . Now, by using Definition (5), we obtain
S c o * = 1 2 κ q ξ q + κ q ξ q max i κ i min i ξ i + 1 2 max i κ i min i ξ i = S c *
S c o * = 1 2 κ q ξ q + κ q ξ q min i κ i max i ξ i + 1 2 min i κ i max i ξ i = S c o * +
Thus, S c o * S c o * S c o * + , hence by the ranking order, we obtain
C C q R O F W A ( 1 , I 1 , , n , I n ) + .
Property 3 (Monotonicity). 
Let i * = κ i * , κ i * , ξ i * , ξ i * i = 1 , , n be the set of Cq-ROFNs, if 1 * , , n * are the permutation of 1 , , n , such that κ i κ i * , κ i κ i * , ξ i ξ i * and ξ i ξ i * . Then,
C C q R O F W A ( 1 , I 1 , , n , I n ) C C q R O F W A 1 * , I 1 , , n * , I n .
Proof. 
Since, its given that κ i κ i * , κ i κ i * , ξ i ξ i * and ξ i ξ i * for all i , then
1 κ i * 1 κ i i = 1 n 1 κ i * q I i w i i = 1 n 1 κ i q I i w i 1 i = 1 n 1 κ i q I i w i q 1 i = 1 n 1 κ i * q I i w i q
Similarly, we can show that κ i κ i * , ξ i ξ i * and ξ i ξ i * .
Thus,
1 i = 1 n 1 κ i q I i w i , 2 π 1 i = 1 n 1 κ i q 2 π I i w i q , i = 1 n ξ i I i w i , 2 π i = 1 n ξ i 2 π I i w i 1 i = 1 n 1 κ i * q I i w i , 2 π 1 i = 1 n 1 κ i * q 2 π I i w i q , i = 1 n ξ i * I i w i , 2 π i = 1 n ξ i * 2 π I i w i
If C C q R O F W A ( 1 , I 1 , , n , I n ) = Ψ and C C q R O F W A 1 * , I 1 , , n * , I n = Ψ * , then by using score function S ( Ψ ) S ( Ψ * ) , we obtain
C C q R O F W A ( 1 , I 1 , , n , I n ) C C q R O F W A 1 * , I 1 , , n * , I n .

4.2. Confidence Complex q-Rung Orthopair Fuzzy Ordered Weighted Average Operator

In this subsection, the defined weighted averaging aggregation operator has been extended to its ordered weighted averaging operator.
Definition 12. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i is the confidence levels of i withe 0 I i 1 , and corresponding weight vector w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 . Then, a confidence complex q-rung orthopair fuzzy ordered weighted average (CCq-ROFOWA) operator is a function C C q R O F O W A : Ω n Ω defined as follows:
C C q R O F O W A 1 , I 1 , n , I n = w 1 σ ( 1 ) , I σ ( 1 ) w n σ ( n ) , I σ ( n ) ,
where Ω denote the set of Cq-ROFNs and σ ( 1 ) , , σ ( n ) are the permutation of ( 1 , , n ) satisfies that σ ( i 1 ) σ ( i ) for i = 2 , , n .
Theorem 2. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i is the confidence levels of i withe 0 I i 1 . Then, aggregated value obtain by using the CCq-ROFOWA operator is again a Cq-ROFN as,
C C q R O F O W A 1 , I 1 , n , I n = 1 i = 1 n 1 κ σ i q I σ i w i , 2 π 1 i = 1 n 1 κ σ i q 2 π I σ i w i q , i = 1 n ξ σ i I σ i w i , 2 π i = 1 n ξ σ i 2 π I σ i w i .
Proof. 
The proof is similar to the Theorem (1) □
Similar to the CCq-ROFWA operator, the same property is also satisfied by the CCq-ROFOWA operator, but these properties were introduced without proof here.
Property 1 (Idempotency). 
Let 0 = κ 0 , κ 0 , ξ 0 , ξ 0 i = 1 , , n be the set of Cq-ROFNs, and I 0 is the confidence levels of 0 , and if i , I i = 0 , I 0 for all i = 1 , , n . Then,
C C q R O F O W A ( 1 , I 1 , , n , I n ) = 0 , I 0
Property 2 (Boundedness). 
Let i = κ i , κ i , ξ i , ξ i i = 1 , , n be the set of Cq-ROFNs, and I i is the confidence levels of i , where
= min i κ i , min i κ i , max i ξ i , max i ξ i and
+ = max i κ i , max i κ i , min i ξ i , min i ξ i . Then,
C C q R O F O W A ( 1 , I 1 , , n , I n ) + .
Property 3 (Monotonicity). 
Let i * = κ i * , κ i * , ξ i * , ξ i * i = 1 , , n be the set of Cq-ROFNs, if 1 * , , n * are the permutation of 1 , , n , such as κ i κ i * , κ i κ i * , ξ i ξ i * and ξ i ξ i * . Then,
C C q R O F O W A ( 1 , I 1 , , n , I n ) C C q R O F O W A 1 * , I 1 , , n * , I n .

4.3. Confidence Complex q-Rung Orthopair Fuzzy Geometric Operator

The aggregation operators discussed above are expanded to geometric aggregation operators with Cq-ROFNs and confidence level information throughout this part.
Definition 13. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i be the confidence levels of i withe 0 I i 1 . Then, a confidence complex q-rung orthopair fuzzy weighted geometric (Cq-ROFWG) operator is a function C C q R O F W G : Ω n Ω is defined by
C C q R O F W G ( 1 , I 1 , , n , I n ) = i = 1 n i I i w 1 = 1 I 1 w 1 2 I 2 w 2 n I n w n
where the weight vector of Cq-ROFNs are w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 .
Theorem 3. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i be the confidence levels of i withe 0 I i 1 . Then, the aggregated value are obtain by using CCq-ROFWG operator is again a Cq-ROFN as,
C C q R O F W G ( 1 , I 1 , , n , I n ) = i = 1 n κ i I i w i , 2 π i = 1 n κ i 2 π I i w i , 1 i = 1 n 1 ξ i q I i w i , 2 π 1 i = 1 n 1 ξ i q 2 π I i w i q .
Proof. 
We prove that Equation (17) holds by using mathematical induction. For each i , i is a Cq-ROFN and i > 0 , therefore, we have w i I i i is again Cq-ROFN. Utilizing mathematical induction principle.
(1). For n = 2 , we obtain
C C q R O F W G 1 , I 1 , 2 , I 2 = 1 I 1 w 1 2 I 2 w 2 .
Using operational law, we have
1 I 1 w 1 = κ 1 I 1 w 1 , 2 π κ 1 2 π I 1 w 1 1 1 ξ 1 q I 1 w 1 , 2 π 1 1 ξ 1 q 2 π I 1 w 1 q
and
w 2 2 = κ 2 w 2 , 2 π κ 2 2 π w 2 , 1 1 ξ 2 q w 2 , 2 π 1 1 ξ 2 q 2 π w 2 q
Consequently, we obtain using the Cq-ROFNs addition law
1 I 1 w 1 2 I 2 w 2 = κ 1 I 1 w 1 , 2 π κ 1 2 π I 1 w 1 , 1 1 ξ 1 q I 1 w 1 , 2 π 1 1 ξ 1 q 2 π I 1 w 1 q κ 2 I 2 w 2 , 2 π κ 2 2 π I 2 w 2 , 1 1 ξ 2 q I 2 w 2 , 2 π 1 1 ξ 2 q 2 π I 2 w 2 q = i = 1 2 κ i I i w i , 2 π i = 1 2 κ i 2 π I i w i , 1 i = 1 2 1 ξ i q I i w i , 2 π 1 i = 1 2 1 ξ i q 2 π I i w i q
Thus, the result is hold for n = 2 .
(2). Let Equation (17) be true for n = κ , then
C C q R O F W G 1 , I 1 , , κ , I κ = C C q R O F W G 1 I 1 w 1 2 I 2 w 2 κ I κ w κ = i = 1 κ κ i I i w i , 2 π i = 1 κ κ i 2 π I i w i , 1 i = 1 κ 1 ξ i q I i w i , 2 π 1 i = 1 κ 1 ξ i q 2 π I i w i q
Then, n = κ + 1 , we obtain
C C q R O F W G 1 , I 1 , , κ + 1 , I κ + 1 = C C q R O F W G 1 , I 1 , , κ , I κ C C q R O F W G κ + 1 , I κ + 1 = i = 1 κ κ i I i w i , 2 π i = 1 κ κ i 2 π I i w i , 1 i = 1 κ 1 ξ i q I i w i , 2 π 1 i = 1 κ 1 ξ i q 2 π I i w i q , κ κ + 1 w κ + 1 , 2 π κ κ + 1 2 π I i w κ + 1 , 1 1 ξ κ + 1 q I i w κ + 1 , 2 π 1 1 ξ κ + 1 q 2 π I i w κ + 1 q = i = 1 κ + 1 κ i I i w i , 2 π i = 1 κ + 1 κ i 2 π I i w i , 1 i = 1 κ + 1 1 ξ i q I i w i , 2 π 1 i = 1 κ + 1 1 ξ i q 2 π I i w i q
Thus, Equation (17) is true for all values of n .
The Cq-ROFWPG operator also satisfies the following qualities, which are listed below but without justification.
Property 1 (Idempotency). 
Let 0 = κ 0 , κ 0 , ξ 0 , ξ 0 i = 1 , , n be the set of Cq-ROFNs, and I 0 is the confidence levels of 0 , and if i , I i = 0 , I 0 ( i = 1 , , n ) . Then,
C C q R O F W G ( 1 , I 1 , , n , I n ) = 0 , I 0
Property 2 (Boundedness). 
Let i = κ i , κ i , ξ i , ξ i i = 1 , , n be the set of Cq-ROFNs, and I i is the confidence levels of i , where
= min i κ i , min i κ i , max i ξ i , max i ξ i and
+ = max i κ i , max i κ i , min i ξ i , min i ξ i . Then,
_ C C q R O F W G ( 1 , I 1 , , n , I n ) + .
Property 3 (Monotonicity). 
Let i * = κ i * , κ i * , ξ i * , ξ i * i = 1 , , n be the set of Cq-ROFNs, if 1 * , , n * are the permutation of 1 , , n , such that κ i κ i * , κ i κ i * , ξ i ξ i * and ξ i ξ i * . Then,
C C q R O F W G ( 1 , I 1 , , n , I n ) C C q R O F W G 1 * , I 1 , , n * , I n .

4.4. Confidence Complex q-Rung Orthopair Fuzzy Ordered Weighted Geometric Operator

The existing weighted geometric aggregation operator was expanded to include their ordered weighted AOs in this section.
Definition 14. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i is the confidence levels of i withe 0 I i 1 , and corresponding weight vector w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 . Then, a confidence complex q-rung orthopair fuzzy ordered weighted geometric (CCq-ROFOWG) operator is a function C C q R O F O W G : Ω n Ω defined by
C C q R O F O W G ( 1 , I 1 , , n , I n ) = i = 1 n σ i I σ i w 1 = σ 1 I σ 1 w 1 σ 2 I σ 2 w 2 σ n I σ n w n
where Ω denoted the set of Cq-ROFNs and σ ( 1 ) , , σ ( n ) are the permutation of ( 1 , , n ) satisfies that σ ( i 1 ) σ ( i ) for i = 2 , , n .
Theorem 4. 
Let i = κ i , κ i , ξ i , ξ i ( i = 1 , , n ) be the set of Cq-ROFNs and I i is the confidence levels of i withe 0 I i 1 . Then, the aggregated value obtained by using CCq-ROFOWG operator is again a Cq-ROFN as,
C C q R O F O W G ( 1 , I 1 , , n , I n ) = i = 1 n κ σ i I σ i w i , 2 π i = 1 n κ σ i 2 π I σ i w i , 1 i = 1 n 1 ξ σ i q I σ i w i , 2 π 1 i = 1 n 1 ξ σ i q 2 π I σ i w i q .
Proof. 
Proof is similar to Theorem (3). □
The CCq-ROFWG operator also fulfills some properties, such as the properties of CCq-ROFWG operator, which are as follows:
Property 1 (Idempotency). 
Let 0 = κ 0 , κ 0 , ξ 0 , ξ 0 i = 1 , , n be the set of Cq-ROFNs, and I 0 be the confidence levels of 0 , and if i , I i = 0 , I 0 ( i = 1 , , n ) . Then,
C C q R O F O W G ( 1 , I 1 , , n , I n ) = 0 , I 0
Property 2 (Boundedness). 
Let i = κ i , κ i , ξ i , ξ i i = 1 , , n be the set of Cq-ROFNs, and I i be the confidence levels of i , where
= min i κ i , min i κ i , max i ξ i , max i ξ i and
+ = max i κ i , max i κ i , min i ξ i , min i ξ i . Then,
_ C C q R O F O W G ( 1 , I 1 , , n , I n ) + .
Property 3 (Monotonicity). 
Let i * = κ i * , κ i * , ξ i * , ξ i * i = 1 , , n be the set of Cq-ROFNs, if 1 * , , n * are the permutation of 1 , , n , such as κ i κ i * , κ i κ i * , ξ i ξ i * and ξ i ξ i * . Then,
C C q R O F O W G ( 1 , I 1 , , n , I n ) C C q R O F O W G 1 * , I 1 , , n * , I n .

5. MCGDM Approach Using Complex q-Rung Orthopair Fuzzy AOs

This section develops a MCGDM algorithm using the CCq-ROFS data and the defined operators.
Consider a DM problem with the n criteria C 1 , , C n are used to evaluate the m alternatives A 1 , , A m . Lets say we have p experts E = E 1 , , E p , who assessed the various alternatives according to their various criteria. With the help of the Cq-ROFN information, each expert assesses each alternative and gives the Cq-ROFNs their rating values as, i j κ = κ i j κ , κ i j κ , ξ i j κ , ξ i j κ , where ( κ = 1 , , p ; i = 1 , , m ) and ( j = 1 , , n ) , 0 κ i j κ + ξ i j κ 1 and 0 κ i j κ + ξ i j κ 2 π . The experts additionally indicate the degrees to which they are familiar with the options considered and assign the confidence levels I i j κ 0 I i j κ 1 in order to incorporate the idea of confidence levels. Assume also that the criteria weights are w = w 1 , , w n T , such as w i > 0 and i = 1 n w i = 1 . The defined operators are then utilized along with the subsequent steps to determine the most desirable alternatives:
Step 1. Develop a complex q-rung orthopair fuzzy decision matrix together with their level of confidence R κ = i j κ , I i j κ m × n , with each alternative’s rating value provided by the expert R κ ( κ = 1 , , p ) .
R κ = C 1 C 2 . . . C n A 1 11 κ , I 11 κ 12 κ , I 12 κ . . . 1 n κ , I 1 n κ A 2 21 κ , I 21 κ 22 κ , I 22 κ 2 n κ , I 2 n κ . . . . . . . . . . . . A m m 1 κ , I m 1 κ m 2 κ , I m 2 κ . . . m n κ , I m n κ
Step 2a. Aggregate the rating values of each expert E κ ( κ = 1 , , p ) into the collective confidence levels Cq-ROF decision matrix R = Ξ i j , where Ξ i j = κ i j , κ i j , ξ i j , ξ i j , I i j by using a CCq-ROFWA operator as follows:
C C q R O F W A 1 , I 1 . . . , n , I n = 1 i = 1 n 1 κ i q I i w i , 2 π 1 i = 1 n 1 κ i q 2 π I i w i q , i = 1 n ξ i I i w i , 2 π i = 1 n ξ i 2 π I i w i ,
Step 2b. Aggregate the values of each expert E κ ( κ = 1 , , p ) into the collective confidence levels Cq-ROF decision matrix R = Ξ i j , where Ξ i j = κ i j , κ i j , ξ i j , ξ i j , I i j by using a CCq-ROFWG operator as follows:
C C q R O F W G ( 1 , I 1 , , n , I n ) = i = 1 n κ i I i w i , 2 π i = 1 n κ i 2 π I i w i , 1 i = 1 n 1 ξ i q I i w i , 2 π 1 i = 1 n 1 ξ i q 2 π I i w i q .
Step 3a. Aggregate the total values R = Ξ i j of the alternative A i ( i = 1 , , m ) in the form of Ξ i = κ i , κ i , ξ i , ξ i using Equation (5).
C q R O F W A 1 , , n = 1 i = 1 n 1 κ i q w i , 2 π 1 i = 1 n 1 κ i q 2 π w i q , i = 1 n ξ i w i , 2 π i = 1 n ξ i 2 π w i
Step 3b. Aggregate the total values R = Ξ i j of the alternative A i ( i = 1 , , m ) in the form of Ξ i = κ i , κ i , ξ i , ξ i using Equation (10).
Ξ i = C q R O F W G Ξ i 1 , , Ξ i n = j = 1 n κ i j w j , 2 π i = 1 n κ i j 2 π w i , 1 j = 1 n 1 ξ i j q w j , 2 π 1 j = 1 n 1 ξ i j q 2 π w j q
Step 4. Find the score value for Ξ i = κ i , κ i , ξ i , ξ i ( i = 1 , , m ) by utilizing the following equation:
S c o * = 1 2 κ q ξ q + κ q ξ q .
Step 5. Select the most suitable alternative, based on score values.

6. Example

In this evaluation, we find the best and the biggest fire extinguishers by using the proposed operators defined based on the Cq-ROF information. The optimal fire extinguisher according to some criteria explained below.
For this, we have considered four types of fire extinguishers, which are represented in the shape of alternatives, whose brief information is of the form: A 1 : Amerex B402, A 2 : First, alert EZ fire spray, A 3 : First alert standard, and A 4 : Amerax B260. For this, we used the following information as a criterion, represented by: C 1 : Best of reliability, C 2 : Best of portability, C 3 : Budget pick, and C 4 : Best for a kitchen fire. To find the best decision, we used the criteria weights ψ = ( 0.14 , 0.26 , 0.27 , 0.33 ) T . Then, we computed the procedure of DM, which is used to examine the beneficial decision from the collection of decisions. We have three experts E 1 , E 2 , E 3 with weight vector ϖ = ( 0.4 , 0.3 , 0.3 ) T and give their assessment in the form of κ i j κ , κ i j κ , ξ i j κ , ξ i j κ , I i j κ , the corresponding information are given in Table 1, Table 2 and Table 3, respectively.
Further, to deal with this MCGDM problem, we can use the developed approach to perform the risk assessment of these projects, and the steps of the presented method is demonstrated as follows:
Step 1. The decision matrix is illustrated in Table 1, Table 2 and Table 3, respectively. Three experts evaluated alternatives within the context of the Cq-ROFN and I i is the confidence levels of i with 0 I i 1 .
Step 2a. The different assessments of the experts i j κ ( κ = 1 , , 3 ) are aggregated into Ξ i j ( i = 1 , , 4 ; j = 1 , , 4 ) , using the CCq-ROFOWA operator. The obtained values are given in Table 4 (we take q = 3 ).
Step 2b. If we used the CCq-ROFOWG operator to aggregate the different assessments of the experts, i j κ ( κ = 1 , , 3 ) are aggregated into Ξ i j ( i = 1 , , 4 ; j = 1 , , 4 ) . Then, the obtained values are given Table 5 (we take q = 3 ).
Step 3a. Now, we utilized the Cq-ROFWA operator to aggregate the different values Ξ i j ( j = 1 , , 4 ) , and Table 4, with the weight vector ψ = ( 0.14 , 0.26 , 0.27 , 0.33 ) , (we take q = 3 ). The cumulative values of alternatives A i ( i = 1 , , 4 ) are:
A 1 = 0.452 , 2 π ( 0.237 ) , 0.344 , 2 π ( 0.292 ) A 2 = 0.364 , 2 π ( 0.431 ) , 0.426 , 2 π ( 0.354 ) A 3 = 0.299 , 2 π ( 0.536 ) , 0.273 , 2 π ( 0.415 ) A 4 = 0.332 , 2 π ( 0.249 ) , 0.384 , 2 π ( 0.547 )
Step 3b. If we utilized the Cq-ROFWG operator to aggregate the different values Ξ i j ( j = 1 , , 4 ) and Table 5, with the weight vector ψ = ( 0.14 , 0.26 , 0.27 , 0.33 ) , (we take q = 3 ). The cumulative values of alternatives A i ( i = 1 , , 4 ) are:
A 1 = 0.632 , 2 π ( 0.239 ) , 0.326 , 2 π ( 0.435 ) A 2 = 0.327 , 2 π ( 0.424 ) , 0.221 , 2 π ( 0.373 ) A 3 = 0.483 , 2 π ( 0.213 ) , 0.436 , 2 π ( 0.325 ) A 4 = 0.369 , 2 π ( 0.542 ) , 0.307 , 2 π ( 0.389 )
Step 4. The scores of the alternative A i ( i = 1 , , 4 ) for alternatives Ξ i ( i = 1 , , 4 ) as follows:
S c o * ( A 1 ) = 0.674 , S c o * ( A 2 ) = 0.699 , S c o * ( A 3 ) = 0.653 , S c o * ( A 4 ) = 0.739 .
On the other hand, the score value of the alternative A i ( i = 1 , , 4 ) , based on step 3b as:
S c o * ( A 1 ) = 0.641 , S c o * ( A 2 ) = 0.686 , S c o * ( A 3 ) = 0.627 , S c o * ( A 4 ) = 0.716 .
Step 5. Using score values, ranking of the alternatives A i ( i = 1 , , 4 ) is given in Table 6.

6.1. Sensitivity Analysis

With the flexibility and sensitivity of the parameter q, the suggested CCq-ROFWA operator and CCq-ROFWG operator were used to conducted an analysis to look at the variation in the scores and ranks of alternatives. The relevant findings are summarized in Table 7 and Table 8. These two tables make it abundantly evident that distinct score values are discovered for the CCq-ROFWA and CCq-ROFWA operators that correspond to various values of the parameter q . The rankings of the mentioned options that correspond to the various q values taken into account were unaffected by these variations in the score values. Additionally, the score value of the alternatives are relatively high when q is relatively small, that is, between 1 and 25 , and the scores decrease as q increases. Decision-makers therefore adopt a more optimistic stance when q is between 1 and 25, and when q is large, the pessimistic character of experts is evident. In general, experts may set q’s value differently depending on their needs.
As a result, A 4 is the best option; it is the best alternative.

6.2. Validity Test

Uncertain outcomes are a result of the fact that, when applied to the same DM problem, several MCGDM methods provide a different assessment (ranking), in order to assess the validity and reliability of the MCGDM method. In Figure 1, we show the ranking of the alternatives graphically.
In Figure 2, we show the ranking of the alternatives graphically.
Test criteria 1: The MCGDM method works well when the best alternative is kept as the default and the non-optimal alternative is changed to a worse alternative without altering the relative importance of any decision attribute.
Test criteria 2: Transitive qualities should be followed by an effective MCGDM strategy.
Test criteria 3: When the MCGDM problem is divided into smaller problems and these smaller problems are subjected to the proposed MCGDM approach for the ranking of alternatives, the MCGDM approach is effective. The cumulative rating of the options maintains consistency with the ranking of the original problem.
The following criteria were used to evaluate the obtained solution’s validity.

6.3. Validity Check with Criteria 1

In order to assess the viability of the established technique using criteria 1, the worst alternative A 4 / is substituted for the non-optimal alternative A 4 / for each expert in the original decision matrix, and the rating values are provided in Table 9.
Utilizing the CCq-ROFOWA operator in step 2 and the Cq-ROFWA operator in step 3 on transferring alternative, we obtain the score values of the alternatives, such as S c o * ( A 1 ) = 0.454 , S c o * ( A 2 ) = 0.561 ,   S c o * ( A 3 ) = 0.363 , S c o * ( A 4 ) = 0.645 . As a result, A 4 is ranked as the best alternative in the final ranking of the options, and the proposed method meets test criterion 1.

6.4. Validity Check with Criteria 2 and 3

We split the initial DM problem into smaller decision making problems A 1 , A 2 , A 3 , A 2 , A 3 , A 4 and A 1 , A 3 , A 4 using these possibilities in order to test the developed MCGDM method using the criteria 2 and 3. When we use the provided MCGDM approach to solve these subproblems, the rating of the alternatives will be as A 2 > A 1 > A 3 , A 4 > A 2 > A 3 and A 4 > A 1 > A 3 . We achieve the ultimate ranking order as A 4 > A 2 > A 1 > A 3 by adding a ranking of alternatives to the smaller problems. This shows a transitive property and is equivalent to a non-decomposed problem. As a result, the criteria 2 and criteria 3 have same best alternative as the defined MCGDM approach. In Table 10, we show different method their score values and ranking.

6.5. Comparative Analysis

This section compares the output of the specified MCGDM method with a few of the existing approaches, such as CPFS and Cq-ROFS. To perform this, first the experts’ priorities are converted into CPFS and Cq-ROFS by setting the phase terms to zero. We utilized the available techniques based on this setting; the outcomes are as follows:
In Figure 3, we show the ranking of the alternatives graphically.

7. Conclusions

In this work, an effort has been made to propose different types of aggregation operators regarding the Cq-ROFSs to assist in decision-making. The range of positive degree and negative degree is extended from the real number to the complex number with the unit disc in a variety of current aggregation operators that have previously been proposed to Cq-ROFSs. The defined CCq-ROF aggregation operators are based on the assumption that the experts are unquestionably knowledgeable about object evaluation, i.e., that all experts are given the same amount of confidence to evaluate the various alternatives. Such a circumstance has partially been realized in the simulation of real-world issues. A number of confidence level averaging and confidence levels geometric aggregation operators are proposed in this paper. We describe certain features of these operators while keeping in mind these considerations and the specifics of the Cq-ROFSs. These operators are also used in a decision-making algorithm to demonstrate how the stated operators may more effectively explain real-world situations when employing expert confidence levels during evaluation. By contrasting the specified technique with other existing methods, a numerical example of fire extinguisher selection is provided to illustrate the efficacy and use of the defined method.
In the future, we will extend this approach for complex vague soft sets [38], q-ROF power Maclaurin symmetric mean operators [23], linear Diophantine fuzzy sets [49,50,51], spherical Diophantine fuzzy sets [52], Fractional orthotriple fuzzy rough set [53], and similarity measures for FOFSs using cosine and cotangent functions [54].

Author Contributions

Conceptualization, M.Q.; software, M.Q.; validation, N.K.; writing—original draft preparation, M.Q.; writing—review and editing, N.K.; project administration, M.N.; funding acquisition, M.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Deanship of Scientific Research at Umm Al-Qura University grant number 22UQU4310396DSR39.

Data Availability Statement

Not applicable.

Acknowledgments

Authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work under grant code 22UQU4310396DSR39.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Jin, L.S.; Xu, Y.Q.; Chen, Z.S.; Mesiar, R.; Yager, R.R. Relative Basic Uncertain Information in Preference and Uncertain Involved Information Fusion. Int. J. Comput. Intell. 2022, 15, 1–7. [Google Scholar] [CrossRef]
  3. Li, G.; Yager, R.R.; Zhang, X.; Mesiar, R.; Bustince, H.; Jin, L. Comprehensive Rules-Based and Preferences Induced Weights Allocation in Group Decision-Making with BUI. Int. J. Comput. Syst. 2022, 15, 1–8. [Google Scholar] [CrossRef]
  4. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  6. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  7. Asiain, M.J.; Bustince, H.; Mesiar, R.; Kolesarova, A.; Takac, Z. Negations with respect to admissible orders in the interval-valued fuzzy set theory. IEEE Trans. Fuzzy Syst. 2017, 26, 556–568. [Google Scholar] [CrossRef]
  8. Li, H. 3D distances of intuitionistic fuzzy sets based on hesitating index. In Proceedings of the 2018 Chinese Control And Decision Conference (CCDC), Shenyang, China, 9–11 June 2018; pp. 2514–2518. [Google Scholar]
  9. Peng, X.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  10. Garg, H. A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making. Int. J. Intell. Syst. 2016, 31, 886–920. [Google Scholar] [CrossRef]
  11. Wei, G.; Lu, M. Pythagorean Hesitant Fuzzy Hamacher Aggregation Operators in Multiple-Attribute Decision Making. J. Intell. Syst. 2017, 28, 759–776. [Google Scholar] [CrossRef]
  12. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  13. Liu, P.; Wang, P. Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  14. Liu, P.; Liu, J. Some q-rung orthopair fuzzy Bonferroni mean operators and their application to multi-attribute group decision making. Int. J. Intell. Syst. 2018, 33, 315–347. [Google Scholar] [CrossRef]
  15. Riaz, M.; Farid, H.M.A.; Karaaslan, F.; Hashmi, M.R. Some q-rung orthopair fuzzy hybrid aggregation operators and TOPSIS method for multi-attribute decision-making. J. Intell. Fuzzy Syst. 2020, 39, 1227–1241. [Google Scholar] [CrossRef]
  16. Riaz, M.; Athar Farid, H.M.; Kalsoom, H.; Pamučar, D.; Chu, Y.M. A robust q-rung orthopair fuzzy Einstein prioritized aggregation operators with application towards MCGDM. Symmetry 2020, 12, 1058. [Google Scholar] [CrossRef]
  17. Peng, X.; Dai, J.; Garg, H. 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. 2018, 33, 2255–2282. [Google Scholar] [CrossRef]
  18. Wei, G.; Gao, H.; Wei, Y. Some q-rung orthopair fuzzy Heronian mean operators in multiple attribute decision making. Int. J. Intell. Syst. 2018, 33, 1426–1458. [Google Scholar] [CrossRef]
  19. Liu, P.; Wang, P. Multiple-attribute decision-making based on Archimedean Bonferroni Operators of q-rung orthopair fuzzy numbers. IEEE Trans. Fuzzy Syst. 2018, 27, 834–848. [Google Scholar] [CrossRef]
  20. Liu, Z.; Liu, P.; Liang, X. Multiple attribute decision-making method for dealing with heterogeneous relationship among attributes and unknown attribute weight information under q-rung orthopair fuzzy environment. Int. J. Intell. Syst. 2018, 33, 1900–1928. [Google Scholar] [CrossRef]
  21. Du, W.S. Minkowski-type distance measures for generalized orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 802–817. [Google Scholar] [CrossRef]
  22. Ali, M.I. Another view on q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 2139–2153. [Google Scholar] [CrossRef]
  23. Liu, P.; Chen, S.M.; Wang, P. Multiple-attribute group decision-making based on q-rung orthopair fuzzy power maclaurin symmetric mean operators. IEEE Trans. Syst. Man Cybern. Syst. 2018, 50, 3741–3756. [Google Scholar] [CrossRef]
  24. Yager, R.R.; Alajlan, N.; Bazi, Y. Aspects of generalized orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 2154–2174. [Google Scholar] [CrossRef]
  25. Buckley, J.J. Fuzzy complex numbers. Fuzzy Sets Syst. 1989, 33, 333–345. [Google Scholar] [CrossRef]
  26. Zhang, G.; Dillon, T.S.; Cai, K.Y.; Ma, J.; Lu, J. Operation properties and δ-equalities of complex fuzzy sets. Int. Approx. Reason. 2009, 50, 1227–1249. [Google Scholar] [CrossRef] [Green Version]
  27. Nguyen, H.T.; Kandel, A.; Kreinovich, V. Complex fuzzy sets: Towards new foundations. In Proceedings of the Ninth IEEE International Conference on Fuzzy Systems. FUZZ-IEEE, San Antonio, TX, USA, 7–10 May 2000; pp. 1045–1048. [Google Scholar]
  28. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  29. Yazdanbakhsh, O.; Dick, S. Time-series forecasting via complex fuzzy logic. In Frontiers of Higher Order Fuzzy Sets; Springer: New York, NY, USA, 2015; pp. 147–165. [Google Scholar]
  30. Bi, L.; Dai, S.; Hu, B. Complex fuzzy geometric aggregation operators. Symmetry 2018, 10, 251. [Google Scholar] [CrossRef] [Green Version]
  31. Chen, Z.; Aghakhani, S.; Man, J.; Dick, S. A neurofuzzy architecture employing complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2010, 19, 305–322. [Google Scholar] [CrossRef]
  32. Alkouri, A.M.D.J.S.; Salleh, A.R. September. Complex intuitionistic fuzzy sets. AIP Conf. Proc. 2012, 1482, 464–470. [Google Scholar]
  33. Ma, J.; Zhang, G.; Lu, J. A method for multiple periodic factor prediction problems using complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2011, 20, 32–45. [Google Scholar]
  34. Dick, S.; Yager, R.R.; Yazdanbakhsh, O. On Pythagorean and complex fuzzy set operations. IEEE Trans. Fuzzy Syst. 2015, 24, 1009–1021. [Google Scholar] [CrossRef]
  35. Hu, B.; Bi, L.; Dai, S.; Li, S. Distances of complex fuzzy sets and continuity of complex fuzzy operations. J. Intell. Fuzzy Syst. 2018, 35, 2247–2255. [Google Scholar] [CrossRef]
  36. Greenfield, S.; Chiclana, F.; Dick, S. Interval-valued complex fuzzy logic. In Proceedings of the 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Vancouver, BC, Canada, 24–29 July 2016; pp. 2014–2019. [Google Scholar]
  37. Singh, P.K.; Selvachandran, G.; Kumar, C.A. Interval-valued complex fuzzy concept lattice and its granular decomposition. In Recent Developments in Machine Learning and Data Analytics; Springer: Singapore, 2019; pp. 275–283. [Google Scholar]
  38. Selvachandran, G.; Garg, H.; Quek, S.G. Vague entropy measure for complex vague soft sets. Entropy 2018, 20, 403. [Google Scholar] [CrossRef] [PubMed]
  39. Selvachandran, G.; Garg, H.; Alaroud, M.H.; Salleh, A.R. Similarity measure of complex vague soft sets and its application to pattern recognition. Int. J. Fuzzy Syst. 2018, 20, 1901–1914. [Google Scholar] [CrossRef]
  40. Quek, S.G.; Selvachandran, G.; Davvaz, B.; Pal, M. The algebraic structures of complex intuitionistic fuzzy soft sets associated with groups and subgroups. Sci. Iran. 2019, 26, 1898–1912. [Google Scholar] [CrossRef] [Green Version]
  41. Feng, L.; Ma, J.; Wang, Y.; Yang, J. Comparison Study on Development Path for Small and Medium-Sized Enterprises e-Commerce Using Complex Fuzzy Sets. 2018, p. 716. Available online: https://ro.uow.edu.au/smartpapers/240/ (accessed on 20 November 2022).
  42. Singh, P.K. Complex fuzzy concept lattice. Neural Process. Lett. 2019, 49, 1511–1526. [Google Scholar] [CrossRef]
  43. Selvachandran, G.; Singh, P.K. Interval-valued complex fuzzy soft set and its application. Int. J. Uncertain. Quantif. 2018, 8, 101–117. [Google Scholar] [CrossRef]
  44. Garg, H.; Rani, D. New generalised Bonferroni mean aggregation operators of complex intuitionistic fuzzy information based on Archimedean t-norm and t-conorm. J. Exp. Theor. Artif. 2020, 32, 81–109. [Google Scholar] [CrossRef]
  45. Garg, H.; Rani, D. Robust Averaging-Geometric Aggregation Operators for Complex Intuitionistic Fuzzy Sets and Their Applications to MCDM Process. Arab. J. Sci. Eng. 2020, 45, 2017–2033. [Google Scholar] [CrossRef]
  46. Ullah, K.; Mahmood, T.; Ali, Z.; Jan, N. On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition. Complex Intell. Syst. 2020, 6, 15–27. [Google Scholar] [CrossRef] [Green Version]
  47. Garg, H.; Gwak, J.; Mahmood, T.; Ali, Z. Power aggregation operators and VIKOR methods for complex q-rung orthopair fuzzy sets and their applications. Mathematics 2020, 8, 538. [Google Scholar] [CrossRef] [Green Version]
  48. Liu, P.; Ali, Z.; Mahmood, T. A method to multi-attribute group decision-making problem with complex q-rung orthopair linguistic information based on heronian mean operators. Int. J. Comput. Syst. 2019, 12, 1465–1496. [Google Scholar] [CrossRef] [Green Version]
  49. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019, 37, 5417–5439. [Google Scholar] [CrossRef]
  50. Riaz, M.; Hashmi, M.R.; Kalsoom, H.; Pamucar, D.; Chu, Y.M. Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment. Symmetry 2020, 12, 1215. [Google Scholar] [CrossRef]
  51. Riaz, M.; Farid, H.M.A.; Aslam, M.; Pamucar, D.; Bozanić, D. Novel approach for third-party reverse logistic provider selection process under linear Diophantine fuzzy prioritized aggregation operators. Symmetry 2021, 13, 1152. [Google Scholar] [CrossRef]
  52. Hashmi, M.R.; Tehrim, S.T.; Riaz, M.; Pamucar, D.; Cirovic, G. Spherical linear diophantine fuzzy soft rough sets with multi-criteria decision making. Axioms 2021, 10, 185. [Google Scholar] [CrossRef]
  53. Qiyas, M.; Naeem, M.; Abdullah, S.; Khan, F.; Khan, N.; Garg, H. Fractional orthotriple fuzzy rough Hamacher aggregation operators and-their application on service quality of wireless network selection. Alex. Eng. J. 2022, 61, 10433–10452. [Google Scholar] [CrossRef]
  54. Naeem, M.; Qiyas, M.; Al-Shomrani, M.M.; Abdullah, S. Similarity Measures for Fractional Orthotriple Fuzzy Sets Using Cosine and Cotangent Functions and Their Application in Accident Emergency Response. Mathematics 2020, 8, 1653. [Google Scholar] [CrossRef]
Figure 1. Ranking of alternatives using CCq-ROFWA operator.
Figure 1. Ranking of alternatives using CCq-ROFWA operator.
Symmetry 14 02638 g001
Figure 2. Ranking of alternatives using CCq-ROFWG operator.
Figure 2. Ranking of alternatives using CCq-ROFWG operator.
Symmetry 14 02638 g002
Figure 3. Ranking of alternatives using different methods.
Figure 3. Ranking of alternatives using different methods.
Symmetry 14 02638 g003
Table 1. Assessment of the alternatives given by expert E 1 .
Table 1. Assessment of the alternatives given by expert E 1 .
C 1 C 2
A 1 0.5 , 2 π ( 0.4 ) , 0.7 , 2 π ( 0.6 ) , 0.96 0.7 , 2 π ( 0.8 ) , 0.4 , 2 π ( 0.3 ) , 0.87
A 2 0.6 , 2 π ( 0.7 ) , 0.5 , 2 π ( 0.4 ) , 0.88 0.2 , 2 π ( 0.5 ) , 0.1 , 2 π ( 0.2 ) , 0.74
A 3 0.6 , 2 π ( 0.4 ) , 0.6 , 2 π ( 0.7 ) , 0.74 0.4 , 2 π ( 0.3 ) , 0.3 , 2 π ( 0.6 ) , 0.91
A 4 0.3 , 2 π ( 0.6 ) , 0.9 , 2 π ( 0.5 ) , 0.91 0.1 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.1 ) , 0.83
C 3 C 4
A 1 0.2 , 2 π ( 0.2 ) , 0.1 , 2 π ( 0.4 ) , 0.77 0.2 , 2 π ( 0.3 ) , 0.1 , 2 π ( 0.2 ) , 0.98
A 2 0.4 , 2 π ( 0.5 ) , 0.3 , 2 π ( 0.1 ) , 0.88 0.4 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.3 ) , 0.75
A 3 0.3 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.3 ) , 0.93 0.5 , 2 π ( 0.1 ) , 0.3 , 2 π ( 0.4 ) , 0.86
A 4 0.5 , 2 π ( 0.4 ) , 0.5 , 2 π ( 0.4 ) , 0.79 0.1 , 2 π ( 0.4 ) , 0.4 , 2 π ( 0.1 ) , 0.94
Table 2. Assessment of the alternatives given by expert E 2 .
Table 2. Assessment of the alternatives given by expert E 2 .
C 1 C 2
A 1 0.2 , 2 π ( 0.3 ) , 0.3 , 2 π ( 0.2 ) , 0.82 0.3 , 2 π ( 0.2 ) , 0.5 , 2 π ( 0.3 ) , 0.72
A 2 0.3 , 2 π ( 0.4 ) , 0.1 , 2 π ( 0.4 ) , 0.93 0.3 , 2 π ( 0.2 ) , 0.4 , 2 π ( 0.1 ) , 0.89
A 3 0.1 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.3 ) , 0.76 0.1 , 2 π ( 0.2 ) , 0.3 , 2 π ( 0.4 ) , 0.79
A 4 0.5 , 2 π ( 0.3 ) , 0.4 , 2 π ( 0.5 ) , 0.84 0.2 , 2 π ( 0.4 ) , 0.2 , 2 π ( 0.2 ) , 0.91
C 3 C 4
A 1 0.2 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.4 ) , 0.75 0.1 , 2 π ( 0.3 ) , 0.3 , 2 π ( 0.4 ) , 0.81
A 2 0.4 , 2 π ( 0.2 ) , 0.3 , 2 π ( 0.2 ) , 0.85 0.3 , 2 π ( 0.4 ) , 0.5 , 2 π ( 0.3 ) , 0.93
A 3 0.3 , 2 π ( 0.1 ) , 0.1 , 2 π ( 0.6 ) , 0.92 0.3 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.1 ) , 0.71
A 4 0.4 , 2 π ( 0.3 ) , 0.2 , 2 π ( 0.4 ) , 0.87 0.5 , 2 π ( 0.3 ) , 0.1 , 2 π ( 0.2 ) , 0.91
Table 3. Assessment of the alternatives given by expert E 3 .
Table 3. Assessment of the alternatives given by expert E 3 .
C 1 C 2
A 1 0.2 , 2 π ( 0.1 ) , 0.5 , 2 π ( 0.3 ) , 0.91 0.5 , 2 π ( 0.2 ) , 0.1 , 2 π ( 0.4 ) , 0.83
A 2 0.5 , 2 π ( 0.2 ) , 0.1 , 2 π ( 0.4 ) , 0.71 0.4 , 2 π ( 0.2 ) , 0.2 , 2 π ( 0.5 ) , 0.79
A 3 0.1 , 2 π ( 0.3 ) , 0.3 , 2 π ( 0.6 ) , 0.82 0.3 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.1 ) , 0.94
A 4 0.3 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.1 ) , 0.95 0.6 , 2 π ( 0.4 ) , 0.1 , 2 π ( 0.2 ) , 0.88
C 3 C 4
A 1 0.3 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.1 ) , 0.87 0.1 , 2 π ( 0.3 ) , 0.3 , 2 π ( 0.4 ) , 0.92
A 2 0.5 , 2 π ( 0.2 ) , 0.3 , 2 π ( 0.4 ) , 0.72 0.4 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.2 ) , 0.85
A 3 0.4 , 2 π ( 0.4 ) , 0.2 , 2 π ( 0.3 ) , 0.96 0.3 , 2 π ( 0.3 ) , 0.5 , 2 π ( 0.3 ) , 0.71
A 4 0.2 , 2 π ( 0.3 ) , 0.5 , 2 π ( 0.1 ) , 0.78 0.1 , 2 π ( 0.2 ) , 0.3 , 2 π ( 0.1 ) , 0.97
Table 4. Aggregated values by using CCq-ROFOWA operator.
Table 4. Aggregated values by using CCq-ROFOWA operator.
C 1 C 2
A 1 0.526 , 2 π ( 0.331 ) , 0.237 , 2 π ( 0.252 ) 0.231 , 2 π ( 0.313 ) , 0.328 , 2 π ( 0.247 )
A 2 0.422 , 2 π ( 0.441 ) , 0.137 , 2 π ( 0.131 ) 0.325 , 2 π ( 0.212 ) , 0.319 , 2 π ( 0.252 )
A 3 0.322 , 2 π ( 0.222 ) , 0.325 , 2 π ( 0.321 ) 0.412 , 2 π ( 0.549 ) , 0.474 , 2 π ( 0.311 )
A 4 0.349 , 2 π ( 0.191 ) , 0.232 , 2 π ( 0.311 ) 0.361 , 2 π ( 0.323 ) , 0.231 , 2 π ( 0.432 )
C 3 C 4
A 1 0.511 , 2 π ( 0.214 ) , 0.226 , 2 π ( 0.128 ) 0.322 , 2 π ( 0.318 ) , 0.391 , 2 π ( 0.297 )
A 2 0.376 , 2 π ( 0.231 ) , 0.212 , 2 π ( 0.228 ) 0.424 , 2 π ( 0.236 ) , 0.425 , 2 π ( 0.313 )
A 3 0.457 , 2 π ( 0.262 ) , 0.327 , 2 π ( 0.241 ) 0.501 , 2 π ( 0.335 ) , 0.224 , 2 π ( 0.232 )
A 4 0.332 , 2 π ( 0.132 ) , 0.219 , 2 π ( 0.233 ) 0.611 , 2 π ( 0.417 ) , 0.217 , 2 π ( 0.432 )
Table 5. Aggregated values by using CCq-ROFOWG operator.
Table 5. Aggregated values by using CCq-ROFOWG operator.
C 1 C 2
A 1 0.245 , 2 π ( 0.321 ) , 0.424 , 2 π ( 0.217 ) 0.423 , 2 π ( 0.225 ) , 0.329 , 2 π ( 0.374 )
A 2 0.482 , 2 π ( 0.344 ) , 0.321 , 2 π ( 0.137 ) 0.342 , 2 π ( 0.436 ) , 0.236 , 2 π ( 0.292 )
A 3 0.303 , 2 π ( 0.272 ) , 0.233 , 2 π ( 0.421 ) 0.275 , 2 π ( 0.323 ) , 0.433 , 2 π ( 0.236 )
A 4 0.223 , 2 π ( 0.131 ) , 0.611 , 2 π ( 0.533 ) 0.328 , 2 π ( 0.562 ) , 0.319 , 2 π ( 0.431 )
C 3 C 4
A 1 0.322 , 2 π ( 0.341 ) , 0.427 , 2 π ( 0.301 ) 0.412 , 2 π ( 0.214 ) , 0.302 , 2 π ( 0.521 )
A 2 0.121 , 2 π ( 0.132 ) , 0.232 , 2 π ( 0.188 ) 0.324 , 2 π ( 0.473 ) , 0.192 , 2 π ( 0.352 )
A 3 0.428 , 2 π ( 0.437 ) , 0.353 , 2 π ( 0.401 ) 0.272 , 2 π ( 0.340 ) , 0.235 , 2 π ( 0.249 )
A 4 0.543 , 2 π ( 0.251 ) , 0.289 , 2 π ( 0.322 ) 0.346 , 2 π ( 0.231 ) , 0.417 , 2 π ( 0.261 )
Table 6. Ranking order of alternatives using averaging and geometric operators.
Table 6. Ranking order of alternatives using averaging and geometric operators.
OperatorsRanking
Cq-ROFWA A 4 > A 2 > A 1 > A 3
Cq-ROFWG A 4 > A 2 > A 1 > A 3
Table 7. Ranking order of the alternatives using CCq-ROFWA operator and different values of the perimeter q.
Table 7. Ranking order of the alternatives using CCq-ROFWA operator and different values of the perimeter q.
qScore ValuesRanking
A 1 A 2 A 3 A 4
q = 1 0.791 0.838 0.775 0.863 A 4 > A 2 > A 1 > A 3
q = 2 0.742 0.761 0.734 0.816 A 4 > A 2 > A 1 > A 3
q = 3 0.674 0.699 0.653 0.739 A 4 > A 2 > A 1 > A 3
q = 4 0.586 0.615 0.572 0.640 A 4 > A 2 > A 1 > A 3
q = 5 0.541 0.553 0.539 0.583 A 4 > A 2 > A 1 > A 3
q = 15 0.203 0.248 0.193 0.275 A 4 > A 2 > A 2 > A 3
q = 25 0.117 0.134 0.115 0.143 A 4 > A 2 > A 1 > A 3
Table 8. Ranking of the alternatives using CCq-ROFWG operator for different values of perimeter q.
Table 8. Ranking of the alternatives using CCq-ROFWG operator for different values of perimeter q.
qScore ValuesRanking
A 1 A 2 A 3 A 4
q = 1 0.737 0.768 0.726 0.793 A 4 > A 2 > A 1 > A 3
q = 2 0.708 0.712 0.684 0.750 A 4 > A 2 > A 1 > A 3
q = 3 0.641 0.686 0.627 0.716 A 4 > A 2 > A 1 > A 3
q = 4 0.616 0.632 0.514 0.679 A 4 > A 2 > A 1 > A 3
q = 5 0.560 0.591 0.522 0.623 A 4 > A 2 > A 1 > A 3
q = 15 0.211 0.225 0.208 0.242 A 4 > A 2 > A 2 > A 3
q = 25 0.097 0.101 0.072 0.118 A 4 > A 2 > A 1 > A 3
Table 9. Transferred alternative A 4 / by each expert.
Table 9. Transferred alternative A 4 / by each expert.
C 1 C 2
E 1 0.4 , 2 π ( 0.4 ) , 0.3 , 2 π ( 0.2 ) , 0.47 0.5 , 2 π ( 0.3 ) , 0.6 , 2 π ( 0.7 ) , 0.74
E 2 0.6 , 2 π ( 0.5 ) , 0.4 , 2 π ( 0.7 ) , 0.92 0.6 , 2 π ( 0.8 ) , 0.4 , 2 π ( 0.5 ) , 0.81
E 3 0.5 , 2 π ( 0.3 ) , 0.6 , 2 π ( 0.8 ) , 0.82 0.8 , 2 π ( 0.7 ) , 0.5 , 2 π ( 0.4 ) , 0.95
C 3 C 4
E 1 0.6 , 2 π ( 0.4 ) , 0.6 , 2 π ( 0.7 ) , 0.83 0.5 , 2 π ( 0.4 ) , 0.6 , 2 π ( 0.5 ) , 0.63
E 2 0.4 , 2 π ( 0.8 ) , 0.4 , 2 π ( 0.5 ) , 0.71 0.6 , 2 π ( 0.5 ) , 0.5 , 2 π ( 0.6 ) , 0.75
E 3 0.7 , 2 π ( 0.5 ) , 0.7 , 2 π ( 0.3 ) , 0.87 0.7 , 2 π ( 0.6 ) , 0.8 , 2 π ( 0.4 ) , 0.97
Table 10. Existing methods and their ranking.
Table 10. Existing methods and their ranking.
ApproachScore ValuesRanking
A 1 A 2 A 3 A 4
Liu, P. and Liu, J [14] 0.825 0.781 0.736 0.869 A 4 > A 1 > A 2 > A 3
Liu et al. [23] 0.585 0.557 0.595 0.664 A 4 > A 3 > A 1 > A 2
Ullah et al. [46] 0.463 0.474 0.418 0.517 A 4 > A 2 > A 1 > A 3
Garg et al. [47] 0.175 0.221 0.192 0.268 A 4 > A 2 > A 3 > A 1
Liu et al. [48] 0.391 0.427 0.372 0.461 A 4 > A 2 > A 1 > A 3
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Qiyas, M.; Naeem, M.; Khan, N. Confidence Levels Complex q-Rung Orthopair Fuzzy Aggregation Operators and Its Application in Decision Making Problem. Symmetry 2022, 14, 2638. https://doi.org/10.3390/sym14122638

AMA Style

Qiyas M, Naeem M, Khan N. Confidence Levels Complex q-Rung Orthopair Fuzzy Aggregation Operators and Its Application in Decision Making Problem. Symmetry. 2022; 14(12):2638. https://doi.org/10.3390/sym14122638

Chicago/Turabian Style

Qiyas, Muhammad, Muhammad Naeem, and Neelam Khan. 2022. "Confidence Levels Complex q-Rung Orthopair Fuzzy Aggregation Operators and Its Application in Decision Making Problem" Symmetry 14, no. 12: 2638. https://doi.org/10.3390/sym14122638

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop