Next Article in Journal
On a Subfamily of q-Starlike Functions with Respect to m-Symmetric Points Associated with the q-Janowski Function
Previous Article in Journal
Nonlinear Wave Propagation for a Strain Wave Equation of a Flexible Rod with Finite Deformation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Aczel–Alsina Power Aggregation Operators for Complex Picture Fuzzy (CPF) Sets with Application in CPF Multi-Attribute Decision Making

1
KERMIT, Department of Mathematical Modeling, Statistics and Bioinformatics, Ghent University, Coupure Links 653, 9000 Ghent, Belgium
2
Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad 44000, Pakistan
3
Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li, Taoyuan 32023, Taiwan
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(3), 651; https://doi.org/10.3390/sym15030651
Submission received: 5 February 2023 / Revised: 25 February 2023 / Accepted: 3 March 2023 / Published: 5 March 2023

Abstract

:
Complex picture fuzzy sets are the updated version of the complex intuitionistic fuzzy sets. A complex picture fuzzy set covers three major grades such as membership, abstinence, and falsity with a prominent characteristic in which the sum of the triplet will be contained in the unit interval. In this scenario, we derive the power aggregation operators based on the Aczel–Alsina operational laws for managing the complex picture of fuzzy values. These complex picture fuzzy power aggregation operators are complex picture fuzzy Aczel–Alsina power averaging, complex picture fuzzy Aczel–Alsina weighted power averaging, complex picture fuzzy Aczel–Alsina power geometric, and complex picture fuzzy Aczel–Alsina weighted power geometric operators. We also investigate their theoretical properties. To justify these complex picture fuzzy power aggregation operators, we illustrate a procedure of a decision-making technique in the presence of complex picture fuzzy values and derive an algorithm to evaluate some multi-attribute decision-making problems. Finally, a practical example is examined to illustrate the decision-making procedure under the consideration of derived operators, and their performance is compared with that of various operators to show the supremacy and validity of the proposed approaches.

1. Introduction

For illustrating the valuable preference from the collection of preferences, the major idea of the multi-attribute decision-making (MADM) procedure is a great and dominant technique, which is the modified version of the simple decision-making scenario. In our daily-life problems, we evaluate or face different types of decision-making problems where our major or initial or first step is to learn how to make a valuable, excellent, or great decision. Usually, the expert brings classical information without evaluating the uncertainty and ambiguity in it. However, in sequence to treat the ambiguity in the information, a hypothesis such as fuzzy sets (FSs) [1] is one of the most effective and worthy ideas for describing the value of truth information whose range is in the unit interval. The FSs were widely applied in a diversity of ways, such as [2,3]. But here, a lot of individuals have raised the question of where the falsity of the information is. To accommodate the above problem, Atanassov [4] invented the theory of intuitionistic FSs (IFSs) as an effective idea that describes the value of truth and falsity information whose range is in a unit interval with the prominent characteristic  0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) 1 . The theory of IFSs is a generalized form of FSs, but IFSs also have their restrictions; for instance, during an election, experts have faced four types of problems such as yes, abstinence, no, and neutral or refusal, where the theory of IFSs has been neglected to cope with some problems [5]. Therefore, to accommodate the above problems, Cuong [6] invented the theory of picture FSs (PFSs) as a worthy idea that described the value of truth, abstinence, and falsity of information whose range is in a unit interval with a prominent characteristic  0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) 1 , where the dynamic distance measures were derived in [7].
The amplitude and phase terms are generally famous and valuable because in many situations we have used them. For instance, if we are taking any kind of software, then we need to give two types of information regarding each software such as the name and version of the software, where both are represented by the amplitude and phase terms. In the presence of FSs theory, we fail to cope with it; therefore, Ramot et al. [8] derived a new structure of complex FSs (CFSs), where the value of the truth grade in CFSs is computed in the form of polar coordinates. A systematic review of CFSs with various applications was given by Yazdanbakhsh and Dick [9]. To utilize the grade of falsity information in the structure of CFSs is a very complicated and awkward task for individuals. Therefore, Alkouri and Salleh [10] derived a new shape, called complex IFSs (CIFSs). In CIFSs, there are truth grades such as  M G w = = ( u g ˜ ) = M R = = ( u g ˜ ) e i 2 π ( M I = = ( u g ˜ ) )  and falsity grades such as  G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )  with a prominent characteristic, such as  0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) 1  and  0 M I = = ( u g ˜ ) + I = = ( u g ˜ ) 1 . The FSs, IFSs, and CFSs are special cases of the CIFSs. The theory of CIFSs is an extension of CFSs, but CIFSs also have their restrictions and limitations. Therefore, to accommodate the above problems, Akram et al. [11] invented the theory of complex picture FSs (CPFSs), which is an effective and worthy idea that describes the value of truth, abstinence, and falsity as stated by:  M G w = = ( u g ˜ ) = M R = = ( u g ˜ ) e i 2 π ( M I = = ( u g ˜ ) ) , G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )  and  G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )  with a dominant and well-known condition, such as  0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) 1  and  0 M I = = ( u g ˜ ) + I = = ( u g ˜ ) + I = = ( u g ˜ ) 1 .
The main structure of Aczel–Alsina t-norm and t-conorm was derived by Aczel and Alsina [12] in 1982. Further, the power aggregation operators (AOs) were evaluated by Yager [13] in 2001. Additionally, Aczel–Alsina AOs for IFSs were invented by Senapati et al. [14]. Aczel–Alsina geometric operators for IFSs were derived by Senapati et al. [15]. Aczel–Alsina prioritized AOs for IFS were considered by Sarfraz et al. [16]. Aczel–Alsina AOs for Pythagorean FSs were proposed by Hussain et al. [17], and Aczel–Alsina AOs for complex Pythagorean FSs were considered by Jin et al. [18]. Aczel–Alsina weighted AOs of neutrosophic Z-numbers were given by Ye et al. [19]. Aczel–Alsina averaging operators for picture FSs (PFSs) were derived by Senapati [20], and Aczel–Alsina geometric operators for PFSs were considered by Naeem et al. [21]. Power AOs for IFSs were derived by Xu [22]. Jiang et al. [23] demonstrated the power AOs based on entropy measures for IFSs, Rani and Garg [24] examined the power AOs for CIFSs, and Liu et al. [25] proposed the power AOs for CPFSs. Mahmood et al. [26] considered Aczel–Alsina AOs for bipolar CFSs. We mention that there is no research on power AOs for CPFSs based on Aczel–Alsina operational laws, and these should be our main focus in this paper.
It is known that the theory of FSs, IFSs, PFSs, CFSs, and CIFSs has a lot of applications in decision-making, pattern recognition, medical diagnosis, and cluster analysis. But in many situations, it may fail because of its limitations. Since the theory of CPFSs is more modified and valuable than that of FSs, IFSs, CFSs, and CIFSs, in which CPFSs cover three major grades of membership, abstinence, and falsity with a prominent characteristic such that the sum of the triplet will be contained in the unit interval. Additionally, the theory of Aczel–Alsina information and power AOs has a lot of advantages. This is because the theory of averaging and geometric AOs are the particular cases of the Aczel–Alsina information. Moreover, the algebraic t-norm and t-conorm are also special cases of the Aczel–Alsina operators. Furthermore, it is an important task to show how to develop the theory of power AOs based on Aczel–Alsina operational laws for CPFSs. Even though combining these ideas into one structure is a complicated task, if we can combine these ideas, then it will be beneficial for researchers. After all, with the help of this information, we can easily derive those required results of averaging, geometric, and power based on Aczel–Alsina AOs. In fact, these should be the special cases of our derived theory in Aczel–Alsina AOs for CPFSs. Thus, the contributions in this paper can be described as follows:
  • To explore the basic Aczel–Alsina operational law for complex picture fuzzy (CPF) values.
  • To derive the CPF Aczel–Alsina power averaging (CPFAAP-A), CPF Aczel–Alsina weighted power averaging (CPFAAWP-A), CPF Aczel–Alsina power geometric (CPFAAP-G), and CPF Aczel–Alsina weighted power geometric (CPFAAWP-G) operators.
  • To examine the three basic properties of the above operators, such as idempotency, monotonicity, and boundedness.
  • To justify the above problem, we illustrate a procedure of decision making in the presence of the CPF values (CPFVs) and derive an algorithm to evaluate the MADM problems. Furthermore, these can be extended to CPF Maclaurin symmetric mean and power generalized Maclaurin symmetric mean operators.
  • To illustrate a practical example of a decision-making procedure under the consideration of derived operators and compare their performance with various operators to show the supremacy and validity of the derived approaches.
The remainder of this paper is as follows. In Section 2, we review some prevailing or existing information such as CPFSs, power aggregation (P-A) operators, and some Aczel–Alsina operational laws. In Section 3, we derive the idea of CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators and discover their properties. To justify the above problem, in Section 4, we illustrate a procedure of a decision-making technique in the presence of CPFVs and derive an algorithm to evaluate the MADM problems. Finally, in Section 5, a numerical or practical example is examined to illustrate the decision-making procedure under the consideration of derived operators, and their performance is compared with various operators to show the supremacy and validity of the derived approaches. Some concluding analysis is stated in Section 6.

2. Preliminaries

In this section, we review some prevailing and existing information such as CPFS, P-A operator, and some Aczel–Alsina operational laws based on a universal set  X U ˜ .
Definition 1 ([11).
Using a fixed set  X U ˜ , we examine the idea of CPFS as
G w = = { ( M G w = = ( u g ˜ ) , G w = = ( u g ˜ ) , G w = = ( u g ˜ ) ) : u g ˜ X U ˜ }          
Here, we talk about the triplet such as truth, abstinence, and falsity which are stated by:   M G w = = ( u g ˜ ) = M R = = ( u g ˜ ) e i 2 π ( M I = = ( u g ˜ ) ) , G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )   and   G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )   with   0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) 1   and   0 M I = = ( u g ˜ ) + I = = ( u g ˜ ) + I = = ( u g ˜ ) 1 . Furthermore, the complicated structure   G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) ) = ( 1 ( M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) ) ) e i 2 π ( 1 ( M I = = ( u g ˜ ) + I = = ( u g ˜ ) + I = = ( u g ˜ ) ) ) is used as a neutral grade and   G w = = ( M R = = e i 2 π ( M I = = ) , R = = e i 2 π ( I = = ) , R = = e i 2 π ( I = = ) ) , = 1 , 2 , ,  states the CPF values (CPFVs).
Definition 2 ([13]).
By considering  G w = , = 1 , 2 , , , used as non-negative information, the P-A operator is defined as
A ( G w 1 = , G w 2 = , , G w = ) = = 1 ( 1 + V ( G w = ) ) G w = = 1 ( 1 + V ( G w = ) )      
Notice that   V ( G w = ) = s = 1 , s S u p ( G w = , G w s = ) states the relationship between   G w =   and   G w s =   with the following characteristics:
(1)
S u p ( G w = , G w s = ) [ 0 , 1 ] .
(2)
S u p ( G w = , G w s = ) = S u p ( G w s = , G w = ) .
(3)
S u p ( G w = , G w s = ) S u p ( G w k = , G w l = )  when  | G w = G w s = | | G w k = G w l = | .
Definition 3.
The existing form of Aczel–Alsina operational laws for any two CPFVs are defined as:
G w 1 = G w 2 = ( ( 1 e ( ( I O G ( 1 M R 1 = = ) ) U + ( I O G ( 1 M R 2 = = ) ) U ) 1 U )   e i 2 π ( 1 e ( ( I O G ( 1 M R 1 = = ) ) U + ( I O G ( 1 M R 2 = = ) ) U ) 1 U ) ,   ( e ( ( I O G ( R 1 = = ) ) U + ( I O G ( R 2 = = ) ) U ) 1 U ) e i 2 π ( e ( ( I O G ( I 1 = = ) ) U + ( I O G ( I 2 = = ) ) U ) 1 U ) , ( e ( ( I O G ( R 1 = = ) ) U + ( I O G ( R 2 = = ) ) U ) 1 U )   e i 2 π ( e ( ( I O G ( I 1 = = ) ) U + ( I O G ( I 2 = = ) ) U ) 1 U )   )
G w 1 = G w 2 = ( ( e ( ( I O G ( M R 1 = = ) ) U + ( I O G ( M R 2 = = ) ) U ) 1 U )   e i 2 π ( e ( ( I O G ( M I 1 = = ) ) U + ( I O G ( M I 2 = = ) ) U ) 1 U ) ,   ( 1 e ( ( I O G ( 1 R 1 = = ) ) U + ( I O G ( 1 R 2 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( ( I O G ( 1 R 1 = = ) ) U + ( I O G ( 1 R 2 = = ) ) U ) 1 U ) , ( 1 e ( ( I O G ( 1 R 1 = = ) ) U + ( I O G ( 1 R 2 = = ) ) U ) 1 U )   e i 2 π ( 1 e ( ( I O G ( 1 R 1 = = ) ) U + ( I O G ( 1 R 2 = = ) ) U ) 1 U )   )
O S = G w 1 = ( ( 1 e ( O S = ( I O G ( 1 M R 1 = = ) ) U ) 1 U )   e i 2 π ( 1 e ( O S = ( I O G ( 1 M I 1 = = ) ) U ) 1 U ) , ( e ( O S = ( I O G ( R 1 = = ) ) U ) 1 U ) e i 2 π ( e ( O S = ( I O G ( I 1 = = ) ) U ) 1 U ) , ( e ( O S = ( I O G ( R 1 = = ) ) U ) 1 U )   e i 2 π ( e ( O S = ( I O G ( I 1 = = ) ) U ) 1 U ) )
G w 1 = O S = ( ( e ( O S = ( I O G ( M R 1 = = ) ) U ) 1 U )   e i 2 π ( e ( O S = ( I O G ( M I 1 = = ) ) U ) 1 U ) , 1 ( e ( O S = ( I O G ( 1 R 1 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( O S = ( I O G ( 1 I 1 = = ) ) U ) 1 U ) , ( 1 e ( O S = ( I O G ( 1 R 1 = = ) ) U ) 1 U )   e i 2 π ( 1 e ( O S = ( I O G ( 1 I 1 = = ) ) U ) 1 U )   )
Definition 4 ([11]).
The existing form of score and accuracy function for any two CPFVs are stated below:
Y S V = ( G w 1 = ) = 1 3 ( M R 1 = = + M I 1 = = R 1 = = I 1 = = R 1 = = I 1 = = ) , Y S V = ( G w 1 = ) [ 1 , 1 ]
Y A V = ( G w 1 = ) = 1 3 ( M R 1 = = + M I 1 = = _ + R 1 = = + I 1 = = + R 1 = = + I 1 = = ) , Y A V = ( G w 1 = ) [ 0 , 1 ]  
Here, we describe some characteristics of the above information such as
  • If  Y S V = ( G w 1 = ) > Y S V = ( G w 2 = ) G w 1 = > G w 2 = ;
  • If  Y S V = ( G w 1 = ) < Y S V = ( G w 2 = ) G w 1 = < G w 2 = ;
  • If  Y S V = ( G w 1 = ) = Y S V = ( G w 2 = ) ;
    (i)
    If  Y A V = ( G w 1 = ) > Y A V = ( G w 2 = ) G w 1 = > G w 2 = ;
    (ii)
    If  Y A V = ( G w 1 = ) < Y A V = ( G w 2 = ) G w 1 = < G w 2 = ;
    (iii)
    If  Y A V = ( G w 1 = ) = Y A V = ( G w 2 = ) G w 1 = = G w 2 = .
Theorem 1.
The existing form of the well-known results/properties for any two CPFVs are stated as follows:
  • G w 1 = G w 2 = = G w 2 = G w 1 = ;
  • G w 1 = G w 2 = = G w 2 = G w 1 = ;
  • O S = ( G w 1 = G w 2 = ) = O S = G w 1 = O S = G w 2 = ;
  • ( O S 1 = + O S 1 = ) G w 1 = = O S 1 = G w 1 = O S 2 = G w 1 = ;
  • ( G w 1 = G w 2 = ) O S = = G w 1 = O S = G w 2 = O S = ;
  • G w 1 = O S 1 = G w 1 = O S 1 = = G w 1 = O S 1 = + O S 2 = .

3. The Proposed Aczel-Alsina Power AOs for CPFVs

In this section, we derive some power AOs based on Aczel–Alsina operational laws for managing the CPF values (CPFVs). These are CPF Aczel–Alsina power averaging (CPFAAP-A), CPF Aczel–Alsina weighted power averaging (CPFAAWP-A), CPF Aczel–Alsina power geometric (CPFAAP-G), and CPF Aczel–Alsina weighted power geometric (CPFAAWP-G) operators. We then give some properties of them.
Definition 5.
The computational form of the CPFAAP-A operator is defined as:
C P F A A P A ( G w 1 = , G w 2 = , , G w = ) = K 1 = G w 1 = K 2 = G w 2 = K = G w = = = 1 ( K = G w = )    
K = = P A ( G w 1 = , G w 2 = , , G w = ) = ( 1 + V ( G w = ) ) = 1 ( 1 + V ( G w = ) )
where  V ( G w = ) = s = 1 , s S u p ( G w = , G w s = ) S u p ( G w = , G w s = ) = 1 d ( G w = , G w s = ) . Further,  d ( G w = , G w s = ) = 1 6 ( | M R = = M R s = = | + | M I = = M I s = = | + | R = = R s = = | + | I = = I s = = | + | R = = R s = = | + | I = = I s = = | )  illustrates the distance measure. The information in Equations (9) and (10) can be seen as a generalization of Aczel–Alsina power averaging operators of FSs, IFSs, PFSs, CFSs, and CIFSs.
Theorem 2.
In the consideration of Equations (9) and (10), we prove that the finalized result of the above theory is again in the form of CPFVs with
C P F A A P A ( G w 1 = , G w 2 = , , G w = ) = ( ( 1 e ( = 1 K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = = ( I O G ( I = = ) ) U ) 1 U ) )
Proof. 
(Using Mathematical induction). For  = 2 , we have
K 1 = G w 1 = = ( ( 1 e ( K 1 = ( I O G ( 1 M R 1 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( K 1 = ( I O G ( 1 M I 1 = = ) ) U ) 1 U ) , ( e ( K 1 = ( I O G ( R 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K 1 = ( I O G ( I 1 = = ) ) U ) 1 U ) , ( e ( K 1 = ( I O G ( R 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K 1 = ( I O G ( I 1 = = ) ) U ) 1 U ) )
K 2 = G w 2 = = ( ( 1 e ( K 2 = ( I O G ( 1 M R 2 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( K 2 = ( I O G ( 1 M I 2 = = ) ) U ) 1 U ) , ( e ( K 2 = ( I O G ( R 2 = = ) ) U ) 1 U ) e i 2 π ( e ( K 2 = ( I O G ( I 2 = = ) ) U ) 1 U ) , ( e ( K 2 = ( I O G ( R 2 = = ) ) U ) 1 U ) e i 2 π ( e ( K 2 = ( I O G ( I 2 = = ) ) U ) 1 U ) )
Thus,  C P F A A P A ( G w 1 = , G w 2 = ) = K 1 = G w 1 = K 2 = G w 2 =
= ( ( 1 e ( K 1 = ( I O G ( 1 M R 1 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( K 1 = ( I O G ( 1 M I 1 = = ) ) U ) 1 U ) , ( e ( K 1 = ( I O G ( R 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K 1 = ( I O G ( I 1 = = ) ) U ) 1 U ) , ( e ( K 1 = ( I O G ( R 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K 1 = ( I O G ( I 1 = = ) ) U ) 1 U ) ) ( ( 1 e ( K 2 = ( I O G ( 1 M R 2 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( K 2 = ( I O G ( 1 M I 2 = = ) ) U ) 1 U ) , ( e ( K 2 = ( I O G ( R 2 = = ) ) U ) 1 U ) e i 2 π ( e ( K 2 = ( I O G ( I 2 = = ) ) U ) 1 U ) , ( e ( K 2 = ( I O G ( R 2 = = ) ) U ) 1 U ) e i 2 π ( e ( K 2 = ( I O G ( I 2 = = ) ) U ) 1 U ) ) = ( ( 1 e ( = 1 2 K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 2 K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , e ( = 1 2 K = ( I O G ( R = = ) ) U ) 1 U e i 2 π ( e ( = 1 2 K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 2 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 2 K = ( I O G ( I = = ) ) U ) 1 U ) )
Our assumption holds. Further, we try to assume that for  = k  is also hold. Then we have
C P F A A P A ( G w 1 = , G w 2 = , , G w k = ) = ( ( 1 e ( = 1 k K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 k K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( = 1 k K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 k K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 k K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 k K = = ( I O G ( I = = ) ) U ) 1 U ) )
For  = k + 1 , we have that
C P F A A P A ( G w 1 = , G w 2 = , , G w k + 1 = ) = = 1 k + 1 ( K = G w = ) = = 1 k ( K = G w = ) K k + 1 = G w k + 1 =
= ( ( 1 e ( = 1 k K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 k K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( = 1 k K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 k K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 k K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 k K = ( I O G ( I = = ) ) U ) 1 U ) ) ( ( 1 e ( K k + 1 = ( I O G ( 1 M R k + 1 = = ) ) U ) 1 U ) e i 2 π ( 1 e ( K k + 1 = ( I O G ( 1 M I k + 1 = = ) ) U ) 1 U ) , ( e ( K k + 1 = ( I O G ( R k + 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K k + 1 = ( I O G ( I k + 1 = = ) ) U ) 1 U ) , ( e ( K k + 1 = ( I O G ( R k + 1 = = ) ) U ) 1 U ) e i 2 π ( e ( K k + 1 = ( I O G ( I k + 1 = = ) ) U ) 1 U ) ) = ( ( 1 e ( = 1 k + 1 K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 k + 1 K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , e ( = 1 k + 1 K = ( I O G ( R = = ) ) U ) 1 U e i 2 π ( e ( = 1 k + 1 K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 k + 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 k + 1 K = ( I O G ( I = = ) ) U ) 1 U ) )
Our assumption holds for all positive information. □
Example 1.
To clarify the above problem with the help of practical information, we use some information in the form of CPFVs, such as  G w 1 = = ( 0.4 e i 2 π ( 0.3 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.1 ) ) , G w 2 = = ( 0.5 e i 2 π ( 0.4 ) , 0.3 e i 2 π ( 0.2 ) , 0.1 e i 2 π ( 0.1 ) ) , G w 3 = = ( 0.7 e i 2 π ( 0.8 ) , 0.1 e i 2 π ( 0.1 ) , 0.01 e i 2 π ( 0.01 ) )  and  U = 3 . Then,  d ( G w 1 = , G w 2 = ) = 0.06667 ; d ( G w 1 = , G w 3 = ) = 0.21333 ; d ( G w 2 = , G w 3 = ) = 0.18 ;   S u p ( G w 1 = , G w 2 = ) = 1 d ( G w 1 = , G w 2 = ) = 1 0.06667 = 0.93333 ;   S u p ( G w 1 = , G w 3 = ) = 0.78667 ; S u p ( G w 2 = , G w 3 = ) = 0.82 .  Thus, we have  V ( G w 1 = ) = s = 1 , s 1 S u p ( G w 1 = , G w s = ) = S u p ( G w 1 = , G w 2 = ) + S u p ( G w 1 = , G w 3 = ) = 1.72 ;   V ( G w 2 = ) = 1.7533 ;   V ( G w 3 = ) = 1.60667 ;   = 1 ( 1 + V ( G w = ) ) = 8.08 .  We the have  K 1 = = ( 1 + V ( G w 1 = ) ) = 1 3 ( 1 + V ( G w = ) ) = 1 + 1.72 8.08 = 0.33663 K 2 = = 0.34076 ; K 3 = = 0.32261 .  Thus, we get  C P F A A P A ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.3226 e i 2 π ( 0.38522 ) , 0.45549 e i 2 π ( 0.43987 ) , 0.23502 e i 2 π ( 0.22707 ) ) .
Proposition 1 (Idempotency).
If  G w = = G = , then
C P F A A P A ( G w 1 = , G w 2 = , , G w = ) = G =  
Proof. 
Notice that we have  G w = = G = = ( M R = = e i 2 π ( M I = = ) , R = = e i 2 π ( I = = ) , R = = e i 2 π ( I = = ) ) . Then
C P F A A P A ( G w 1 = , G w 2 = , , G w = ) = ( ( 1 e ( = 1 K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( I = = ) ) U ) 1 U ) ) = ( ( 1 e ( ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( ( I O G ( I = = ) ) U ) 1 U ) , ( e ( ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( ( I O G ( I = = ) ) U ) 1 U ) ) = ( ( 1 e I O G ( 1 M R = = ) ) e i 2 π ( 1 e I O G ( 1 M I = = ) ) , ( e I O G ( R = = ) ) e i 2 π ( e I O G ( I = = ) ) , ( e I O G ( R = = ) ) e i 2 π ( e I O G ( I = = ) ) ) = ( M R = = e i 2 π ( M I = = ) , R = = e i 2 π ( I = = ) , R = = e i 2 π ( I = = ) ) .
Our next concern is if the CPFAAP-A operator  C P F A A P A ( G w 1 = , G w 2 = , , G w = )  satisfies the property of monotonicity. That is, the statement “If  G w = G w = = ( M R = = e i 2 π ( M I = = ) , R = = e i 2 π ( I = = ) , R = = e i 2 π ( I = = ) ) , then  C P F A A P A ( G w 1 = , G w 2 = , , G w = ) C P F A A P A ( G w 1 = , G w 2 = , , G w = ) ” is true or not. Our answer is that the statement is not true, i.e., If  G w = G w = ,  then
C P F A A P A ( G w 1 = , G w 2 = , , G w = ) C P F A A P A ( G w 1 = , G w 2 = , , G w = )
Our counter-example is as follows: Consider the three major CPFVs with  G w 1 = = ( 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.2 ) ) , G w 2 = = ( 0.4 e i 2 π ( 0.4 ) , 0.4 e i 2 π ( 0.4 ) , 0.2 e i 2 π ( 0.2 ) ) , G w 3 = = ( 0.1 e i 2 π ( 0.1 ) , 0.89 e i 2 π ( 0.89 ) , 0.01 e i 2 π ( 0.01 ) )  and  G w 1 = = ( 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.2 ) ) , G w 2 = = ( 0.4 e i 2 π ( 0.4 ) , 0.4 e i 2 π ( 0.4 ) , 0.2 e i 2 π ( 0.2 ) ) , G w 3 = = ( 0.11 e i 2 π ( 0.11 ) , 0.11 e i 2 π ( 0.11 ) , 0.01 e i 2 π ( 0.01 ) )  with the help of  U = 3 , we have  d ( G w 1 = , G w 2 = ) = 0.13333 d ( G w 1 = , G w 3 = ) = 0.32667 ; d ( G w 2 = , G w 3 = ) = 0.32667 S u p ( G w 1 = , G w 2 = ) = 1 d ( G w 1 = , G w 2 = ) = 0.86667 S u p ( G w 1 = , G w 3 = ) = 0.67333 ; S u p ( G w 2 = , G w 3 = ) = 0.67333 . Thus, we have that  V ( G w 1 = ) = s = 1 , s 1 S u p ( G w 1 = , G w s = ) = S u p ( G w 1 = , G w 2 = ) + S u p ( G w 1 = , G w 3 = ) = 1.54 V ( G w 2 = ) = 1.54 ;   V ( G w 3 = ) = 1.34667 = 1 ( 1 + V ( G w = ) ) = 7.42667 . Therefore,  K 1 = = ( 1 + V ( G w 1 = ) ) = 1 3 ( 1 + V ( G w = ) ) = 1 + 1.54 7.42667 = 0.34201 K 2 = = 0.34201 ;   K 3 = = 0.31598 .  Then, we get  C P F A A P A ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.14763 e i 2 π ( 0.14763 ) , 0.59616 e i 2 π ( 0.59616 ) , 0.24578 e i 2 π ( 0.24587 ) ) . Further, in the same way, we derive the followings, such as  C P F A A P A ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.14599 e i 2 π ( 0.14559 ) , 0.47078 e i 2 π ( 0.47078 ) , 0.24192 e i 2 π ( 0.24192 ) ) . Then, it is clear that our required result is on hold. Hence,  C P F A A P A ( G w 1 = , G w 2 = , , G w = ) C P F A A P A ( G w 1 = , G w 2 = , , G w = ) . From this, we notice that the property of monotonicity cannot be satisfied under the consideration of the CPFAAP-A operator.
We next propose the CPFAAWP-A operator.
Definition 6.
The computational form of the CPFAAWP-A operator is given as follows:
  C P F A A W P A ( G w 1 = , G w 2 = , , G w = ) = K 1 = G w 1 = K 2 = G w 2 = K = G w = = = 1 ( K = G w = )
K = = W P A ( G w 1 = , G w 2 = , , G w = ) = Φ ( 1 + V ( G w = ) ) = 1 Φ ( 1 + V ( G w = ) )
Notice that  Φ [ 0 ,   1 ]  with  = 1 Φ = 1  names weight vectors.
Theorem 3. 
In the consideration of Equations (14) and (15), we prove that the finalized result of the above theory is again in the form of CPFV, such that
C P F A A W P A ( G w 1 = , G w 2 = , , G w = ) = ( ( 1 e ( = 1 K = ( I O G ( 1 M R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 M I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( I = = ) ) U ) 1 U ) , ( e ( = 1 K = ( I O G ( R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( I = = ) ) U ) 1 U ) )
Proof. 
The proof is similar as Theorem 2 by using the mathematical induction. □
Example 2.
To clarify Theorem 3 with the help of practical information To verify the above problem with the help of practical information, we decided to use some practical information in the form of CPFVs such as  G w 1 = = ( 0.4 e i 2 π ( 0.3 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.1 ) ) , G w 2 = = ( 0.5 e i 2 π ( 0.4 ) , 0.3 e i 2 π ( 0.2 ) , 0.1 e i 2 π ( 0.1 ) ) , G w 3 = = ( 0.7 e i 2 π ( 0.8 ) , 0.1 e i 2 π ( 0.1 ) , 0.01 e i 2 π ( 0.01 ) )  and  U = 3 . Then,  ( G w 1 = , G w 2 = ) = 0.06667 ; d ( G w 1 = , G w 3 = ) = 0.21333 ; d ( G w 2 = , G w 3 = ) = 0.18 ;   S u p ( G w 1 = , G w 2 = ) = 1 d ( G w 1 = , G w 2 = ) = 1 0.06667 = 0.93333 ;  S u p ( G w 1 = , G w 3 = ) = 0.78667 ; S u p ( G w 2 = , G w 3 = ) = 0.82 . Thus,  V ( G w 1 = ) = s = 1 , s 1 S u p ( G w 1 = , G w s = ) = S u p ( G w 1 = , G w 2 = ) + S u p ( G w 1 = , G w 3 = ) = 1.72 . Using the value of weight vectors 0.4, 0.4, and 0.2, we have  V ( G w 2 = ) = 1.7533 ;   V ( G w 3 = ) = 1.60667 ;  = 1 Φ ( 1 + V ( G w = ) ) = 2.710667 .  Thus,  K 1 = = Φ 1 ( 1 + V ( G w 1 = ) ) = 1 3 Φ = ( 1 + V ( G w = ) ) = 0.401377 ;   K 2 = = 0.406296 ; K 3 = = 0.192327 .  Then, we get  C P F A A W P A ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.281354 e i 2 π ( 0.296406 ) , 0.493241 e i 2 π ( 0.464818 ) , 0.309996 e i 2 π ( 0.284854 ) ) .
Proposition 2 (Idempotency).
If  G w = = G = , then
C P F A A W P A ( G w 1 = , G w 2 = , , G w = ) = G =  
Proof. 
It is similar as the proof of Proposition 1.  □
Similarly, the proposed CPFAAWP-A operator cannot satisfy the property of monotonicity. We next propose the CPFAAP-G operator.
Definition 7.
The computational form of the CPFAAP-G operator is defined as follows:
C P F A A P G ( G w 1 = , G w 2 = , , G w = ) = G w 1 = K 1 = G w 2 = K 2 = G w = K = = = 1 ( G w = K = )
K = = P A ( G w 1 = , G w 2 = , , G w = ) = ( 1 + V ( G w = ) ) G w = = 1 ( 1 + V ( G w = ) )          
Theorem 4.
In the consideration of Equations (18) and (19), we prove that the finalized result of the above theory is again in the form of CPFV with
C P F A A P G ( G w 1 = , G w 2 = , , G w = ) = ( ( e ( = 1 K = ( I O G ( M R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( M I = = ) ) U ) 1 U ) , ( 1 e ( = 1 K = ( I O G ( 1 R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 I = = ) ) U ) 1 U ) , ( 1 e ( = 1 K = ( I O G ( 1 R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 I = = ) ) U ) 1 U ) )
Proof. 
The proof is similar as Theorem 2 by using the mathematical induction.  □
Example 3.
To clarify Theorem 4 with the help of practical information, we decide to use some practical information in the form of CPFVs such as  G w 1 = = ( 0.4 e i 2 π ( 0.3 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.1 ) ) , G w 2 = = ( 0.5 e i 2 π ( 0.4 ) , 0.3 e i 2 π ( 0.2 ) , 0.1 e i 2 π ( 0.1 ) ) , G w 3 = = ( 0.7 e i 2 π ( 0.8 ) , 0.1 e i 2 π ( 0.1 ) , 0.01 e i 2 π ( 0.01 ) )  and  U = 3 . Then,  d ( G w 1 = , G w 2 = ) = 0.06667 ; d ( G w 1 = , G w 3 = ) = 0.21333 ; d ( G w 2 = , G w 3 = ) = 0.18 ;   S u p ( G w 1 = , G w 2 = ) = 1 d ( G w 1 = , G w 2 = ) = 1 0.06667 = 0.93333 ;   S u p ( G w 1 = , G w 3 = ) = 0.78667 ; S u p ( G w 2 = , G w 3 = ) = 0.82 . Thus,  V ( G w 1 = ) = s = 1 , s 1 S u p ( G w 1 = , G w s = ) = S u p ( G w 1 = , G w 2 = ) + S u p ( G w 1 = , G w 3 = ) = 1.72 ;  V ( G w 2 = ) = 1.7533 ;   V ( G w 3 = ) = 1.60667 ;   = 1 ( 1 + V ( G w = ) ) = 8.08 . We have  K 1 = = ( 1 + V ( G w 1 = ) ) = 1 3 ( 1 + V ( G w = ) ) = 1 + 1.72 8.08 = 0.33663 , and  K 2 = = 0.34076 ; K 3 = = 0.32261 .  Then, we get  C P F A A P G ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.72869 e i 2 π ( 0.66238 ) , 0.11046 e i 2 π ( 0.08287 ) , 0.06735 e i 2 π ( 0.03939 ) ) .
Proposition 3 (Idempotency).
If  G w = = G = , then
C P F A A P G ( G w 1 = , G w 2 = , , G w = ) = G =
Proof. 
It is similar as the proof of Proposition 1.  □
Similarly, the proposed CPFAAP-G operator cannot satisfy the property of monotonicity. We next propose the CPFAAWP-G operator.
Definition 8.
The computational form of the CPFAAWP-G operator is illustrated as:
  C I F A A W P G ( G w 1 = , G w 2 = , , G w = ) = G w 1 = K 1 = G w 2 = K 2 = G w = K = = = 1 ( G w = K = )
K = = W P A ( G w 1 = , G w 2 = , , G w = ) = Φ ( 1 + V ( G w = ) ) G w = = 1 Φ ( 1 + V ( G w = ) )
Theorem 5.
In the consideration of Equations (22) and (23), we prove that the finalized result of the above theory is again in the form of CPFV, such that
C P F A A W P G ( G w 1 = , G w 2 = , , G w = ) = ( ( e ( = 1 K = ( I O G ( M R = = ) ) U ) 1 U ) e i 2 π ( e ( = 1 K = ( I O G ( M I = = ) ) U ) 1 U ) , ( 1 e ( = 1 K = ( I O G ( 1 R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 I = = ) ) U ) 1 U ) , ( 1 e ( = 1 K = ( I O G ( 1 R = = ) ) U ) 1 U ) e i 2 π ( 1 e ( = 1 K = ( I O G ( 1 I = = ) ) U ) 1 U ) )
Proof. 
The proof is similar as Theorem 2 by using the mathematical induction.  □
Example 4.
To clarify Theorem 5 with the help of practical information, we use some practical information in the form of CPFVs such as  G w 1 = = ( 0.4 e i 2 π ( 0.3 ) , 0.2 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.1 ) ) , G w 2 = = ( 0.5 e i 2 π ( 0.4 ) , 0.3 e i 2 π ( 0.2 ) , 0.1 e i 2 π ( 0.1 ) ) , G w 3 = = ( 0.7 e i 2 π ( 0.8 ) , 0.1 e i 2 π ( 0.1 ) , 0.01 e i 2 π ( 0.01 ) )  and  U = 3 . Then,  ( G w 1 = , G w 2 = ) = 0.06667 ; d ( G w 1 = , G w 3 = ) = 0.21333 ; d ( G w 2 = , G w 3 = ) = 0.18 ;   S u p ( G w 1 = , G w 2 = ) = 1 d ( G w 1 = , G w 2 = ) = 1 0.06667 = 0.93333 ;  S u p ( G w 1 = , G w 3 = ) = 0.78667 ; S u p ( G w 2 = , G w 3 = ) = 0.82 . Thus,  V ( G w 1 = ) = s = 1 , s 1 S u p ( G w 1 = , G w s = ) = S u p ( G w 1 = , G w 2 = ) + S u p ( G w 1 = , G w 3 = ) = 1.72 . Using the value of weight vectors 0.4, 0.4, and 0.2, we have that  V ( G w 2 = ) = 1.7533 ;   V ( G w 3 = ) = 1.60667 ;  = 1 Φ ( 1 + V ( G w = ) ) = 2.710667 . We have  K 1 = = Φ 1 ( 1 + V ( G w 1 = ) ) = 1 3 Φ ( 1 + V ( G w = ) ) = 0.401377  and  K 2 = = 0.406296 ; K 3 = = 0.192327 .  Then, we get  C P F A A W P G ( G w 1 = , G w 2 = , G w 3 = ) = ( 0.723231 e i 2 π ( 0.657451 ) , 0.111293 e i 2 π ( 0.085498 ) , 0.065739 e i 2 π ( 0.040331 ) ) .
Proposition 4 (Idempotency):
If  G w = = G = , then
C P F A A W P G ( G w 1 = , G w 2 = , , G w = ) = G =
Proof. 
It is similar as the proof of Proposition 1.  □
Similarly, the proposed CPFAAWP-G operator cannot satisfy the property of monotonicity. Totally, the proposed CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators have the property of idempotency, but there is no property of monotonicity. In general, the properties of monotonicity and boundedness may be neglected for most AOs under the consideration of Aczel–Alsina operational laws. Overall, the advantages of the derived works can be listed as follows:
  • By setting the value of  G w = = ( u g ˜ ) = 0  in the invented theory, the invented theory will be reduced for CIFSs.
  • By setting the value of  G w = = ( u g ˜ ) = G w = = ( u g ˜ ) = 0  in the invented theory, the invented theory will be reduced for CFSs.
  • By setting the value of  M I = = ( u g ˜ ) = I = = ( u g ˜ ) = I = = ( u g ˜ ) = 0  in the invented theory, the invented theory will be reduced for PFSs.
  • By setting the value of  M I = = ( u g ˜ ) = I = = ( u g ˜ ) = R = = ( u g ˜ ) = I = = ( u g ˜ ) = 0  in the invented theory, the invented theory will be reduced for IFSs.
  • By setting the value of  M I = = ( u g ˜ ) = I = = ( u g ˜ ) = R = = ( u g ˜ ) = I = = ( u g ˜ ) = R = = ( u g ˜ ) = 0  in the invented theory, the invented theory will be reduced for FSs.
  • Furthermore, the Aczel–Alsina aggregation operators for FSs, IFSs, PFSs, CFSs, CIFSs, and CPFSs are the special cases of the proposed theory, when we remove the power aggregation operators.
  • The power aggregation operators for FSs, IFSs, PFSs, CFSs, CIFSs, and CPFSs are the special cases of the proposed theory, when we remove the Aczel–Alsina information.
  • The simple averaging and geometric aggregation operators for FSs, IFSs, PFSs, CFSs, CIFSs, and CPFSs are the special cases of the proposed theory, when we use the algebraic information instead of Aczel–Alsina and power aggregation operators.

4. Strategic CPF MADM Methods

In this section, we organize a MADM procedure based on our proposed AOs, such as CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators, to state the effectiveness and efficacy of the described theory. To resolve the above problem, we aim to compute a decision matrix whose values are in the form of CPF information. For this, we suggest the finite values of alternatives such as  G w = = { G w 1 = , G w 2 = , , G w m = }  concerning finite values of attributes with  G w = = { G w 1 = , G w 2 = , , G w = }  under the weighted information such as  K = = ( K = 1 , K = 2 , , K = ) T , = 1 K = = 1 , where the order of the attributes and weight vectors will be the same. Furthermore, here, we describe the values of the decision matrix that we talk about in the triplet, such as truth, abstinence, and falsity, which are stated by:  M G w = = ( u g ˜ ) = M R = = ( u g ˜ ) e i 2 π ( M I = = ( u g ˜ ) ) , G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )  and  G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) )  with  0 M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) 1  and  0 M I = = ( u g ˜ ) + I = = ( u g ˜ ) + I = = ( u g ˜ ) 1 . Furthermore, the complicated structure  G w = = ( u g ˜ ) = R = = ( u g ˜ ) e i 2 π ( I = = ( u g ˜ ) ) = ( 1 ( M R = = ( u g ˜ ) + R = = ( u g ˜ ) + R = = ( u g ˜ ) ) ) e i 2 π ( 1 ( M I = = ( u g ˜ ) + I = = ( u g ˜ ) + I = = ( u g ˜ ) ) )  is used as a neutral grade and  G w = = ( M R = = e i 2 π ( M I = = ) , R = = e i 2 π ( I = = ) , R = = e i 2 π ( I = = ) ) , = 1 , 2 , ,  states the CPF values (CPFVs). Finally, with the help of the below procedure, we aim to evaluate the above problems, as shown in Table 1.
We next demonstrate a real-life problem and try to solve it with the help of our derived theory.
Example 5.
Here, we expose a company that wants to buy different types of cars out of five different and valuable models with  G w = , = 1 , 2 , 3 , 4 , 5 , which are stated or used as alternatives, such as  G w 1 = : Motor cars,  G w 2 = : Bus cars,  G w 3 = : Ambulances cars,  G w 4 = : VIP cars,  G w 5 = : Small cars (other cars). To choose the best one, we take our decision under the presence of the following criteria with  G w 1 = : elasticity,  G w 2 = : consistency,  G w 3 = : rates, and  G w 4 = : protection. Therefore, with the help of the investigated operators, we aim to decide which one is the best and which one is not under the consideration of the following weight vectors such as  0.3 , 0.3 , 0.1 , 0.3  for four attributes in each alternative. Finally, with the help of the below procedure, we aim to evaluate the above problem according to Table 1.
Step 1: During the construction of every decision matrix (see Table 2), experts have faced two types of information such as cost and benefit. In this problem, if we have cost-type data, then normalize it, such as
Z D M = { ( M R k = = e i 2 π ( M I k = = ) , R = = e i 2 π ( I = = ) , R k = = e i 2 π ( I k = = ) ) B e n e f i t ( R k = = e i 2 π ( I k = = ) , R = = e i 2 π ( I = = ) , M R k = = e i 2 π ( M I k = = ) ) C o s t
However, if we have benefit-type data, then we should proceed with the procedure of decision-making application. But unfortunately, the data in Table 2 are in the form of benefits, so they did not require evaluation.
Step 2: To use the idea of CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators, we concentrate on aggregating the information matrix into a single set theory (see Table 3 and Table 4).
Using the power-weighted vectors in Table 3, we derive the data in Table 4.
Step 3: To use the idea of score and accuracy values, we focus on evaluating the single aggregated values into real-valued information, as shown in Table 5.
Step 4: To use the score values, we examine the ranking values for evaluating the finest preferences from the collection of finite preferences, as shown in Table 6.
Here, we get the best optimal as the  G w 3 = . Furthermore, to check the supremacy and worth of the derived operators, we remove the phase information from Table 2, and then we find the score values of the aggregated values, as shown in Table 7.
To use the score values, we examine the ranking values for evaluating the finest preferences from the collection of finite preferences, as shown in Table 8.
The finest optimal is  G w 3 = . Further, we also discuss the stability or influence of the proposed work with the help of parameters by using the CPF information matrix in Table 2 with phase information and without phase information, as shown in Table 9.
The finest optimal is  G w 3 =  according to the theory of all derived information. Similarly, we find the influence for values shown in Table 2 without phase information, as seen in Table 10.
The finest optimal is  G w 3 =  according to the theory of all derived information. Additionally, we compare the derived theory with various existing operators to show the worth and effectiveness of the invented information in the next section.

5. Comparative Analysis

In this section, under the consideration of the numerical or practical example that is examined to illustrate in the above section under the consideration of the derived operators, we compare their performance with various operators to show the supremacy and validity of the derived approaches. For comparing the derived theory, we select the following important operators for which Aczel–Alsina AOs for IFSs were invented by Senapati et al. [14]; Aczel–Alsina geometric operators for IFS were derived by Senapati et al. [15]; Aczel–Alsina prioritized AOs for IFS was discovered by Sarfraz et al. [16]; Aczel–Alsina averaging operators for PFS was derived by Senapati [19]; Aczel–Alsina geometric operators for PFS was derived by Naeem et al. [20]; Aczel–Alsina averaging/geometric operators for CIFS was invented by Mahmood et al. [21]; power AOs for IFS was derived by Xu [22]; Jiang et al. [23] demonstrated the power AOs based on entropy measures for IFSs; Rani and Garg [24] examined the power AOs for CIFS; and Liu et al. [25] proposed the power AOs for CPFSs. Then, in Table 11, we illustrate the comparison information for the CPF information matrix in Table 2 (with phase terms).
Again, we get the best optimal as  G w 3 =  according to the theory of Liu et al. [25] and our derived operators (four main operators). Furthermore, by excluding the phase information from Table 2, the comparison values are illustrated in Table 12.
Again, we get the best optimal as  G w 3 =  according to the theory of Senapati [19], Naeem et al. [20], Liu et al. [25], and our derived theory (four main operators). But the theory proposed by Senapati et al. [14], Senapati et al. [15], Sarfraz et al. [16], Mahmood et al. [21], Xu [22], Jiang et al. [23], and Rani and Garg [24] has failed. Totally, our proposed theory (four main operators) is actually more feasible for depicting awkward and unreliable information in real-life problems.

6. Conclusions

The theory of complex picture fuzzy (CPF) information is very valuable and dominant, because it is the extended version of fuzzy sets in which the extension covers the three major grades of membership, abstinence, and falsity with a prominent characteristic such that the sum of the triplet will be contained in the unit interval. On the other hand, the idea of averaging, geometric, Aczel–Alsina, and power aggregation operators is very helpful and beneficial for depicting unreliable and vague information in real-life problems. Thus, we proposed these novel works inspired by the above ideas in this paper. The major influences of the derived theory and methods are stated as follows:
  • We exposed the theory of Aczel–Alsina operational laws for the invented theory such as CPF information.
  • We derived the CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators and discover their properties, and then illustrated the procedure of the decision-making technique in the presence of the CPF values and derived an algorithm to evaluate the MADM problems.
  • We give an example to illustrate the decision-making procedure based on the derived CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators.
  • We compared the derived theory with the existing operators, which showed the supremacy and validity of our proposed approaches.
In the future, we will concentrate on developing some new ideas based on fuzzy sets, lattice-ordered fuzzy sets, and their generalizations. We should try to apply these in the areas of pattern recognition, green supplier selection, clustering, and multi-attribute decision-making problems to improve the quality of the proposed theory.

Author Contributions

Conceptualization, Z.A. and T.M.; methodology, Z.A., T.M. and M.-S.Y.; validation, Z.A. and T.M.; formal analysis, Z.A., T.M. and M.-S.Y.; investigation, Z.A., T.M. and M.-S.Y.; data curation, Z.A.; writing—original draft preparation, Z.A.; writing—review and editing, M.-S.Y.; visualization, T.M. and M.-S.Y.; supervision, T.M. and M.-S.Y.; funding acquisition, M.-S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded in part by the Ministry of Science and technology (MOST) of Taiwan under Grant MOST-111-2118-M-033-001-.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Chaomurilige, C.; Yu, J.; Yang, M.S. Analysis of parameter selection for Gustafson-Kessel fuzzy clustering using Jacobian matrix. IEEE Trans. Fuzzy Syst. 2015, 23, 2329–2342. [Google Scholar] [CrossRef]
  3. Lu, K.P.; Chang, S.T.; Yang, M.S. Change-point detection for shifts in control charts using fuzzy shift change-point algorithms. Comput. Ind. Eng. 2016, 93, 12–27. [Google Scholar] [CrossRef]
  4. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Saqlain, M.; Riaz, M.; Saleem, M.A.; Yang, M.S. Distance and similarity measures for neutrosophic hypersoft set (NHSS) with construction of NHSS-TOPSIS and applications. IEEE Access 2021, 9, 30803–30816. [Google Scholar] [CrossRef]
  6. Cuong, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  7. Zhao, R.; Luo, M.; Li, S. A dynamic distance measure of picture fuzzy sets and its application. Symmetry 2021, 13, 436. [Google Scholar] [CrossRef]
  8. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  9. Yazdanbakhsh, O.; Dick, S. A systematic review of complex fuzzy sets and logic. Fuzzy Sets Syst. 2018, 338, 1–22. [Google Scholar] [CrossRef]
  10. Alkouri, A.M.D.J.S.; Salleh, A.R. Complex intuitionistic fuzzy sets. In AIP Conference Proceedings; American Institute of Physics: College Park, MD, USA, 2012; Volume 1482, pp. 464–470. [Google Scholar]
  11. Akram, M.; Bashir, A.; Garg, H. Decision-making model under complex picture fuzzy Hamacher aggregation operators. Comput. Appl. Math. 2020, 39, 1–38. [Google Scholar] [CrossRef]
  12. Aczél, J.; Alsina, C. Characterizations of some classes of quasilinear functions with applications to triangular norms and to synthesizing judgements. Aequ. Math. 1982, 25, 313–315. [Google Scholar] [CrossRef]
  13. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern-Part A Syst. Hum. 2001, 31, 724–731. [Google Scholar] [CrossRef]
  14. Senapati, T.; Chen, G.; Yager, R.R. Aczel–Alsina aggregation operators and their application to intuitionistic fuzzy multiple attribute decision making. Int. J. Intell. Syst. 2022, 37, 1529–1551. [Google Scholar] [CrossRef]
  15. Senapati, T.; Chen, G.; Mesiar, R.; Yager, R.R. Intuitionistic fuzzy geometric aggregation operators in the framework of Aczel-Alsina triangular norms and their application to multiple attribute decision making. Expert Syst. Appl. 2023, 212, 118832. [Google Scholar] [CrossRef]
  16. Sarfraz, M.; Ullah, K.; Akram, M.; Pamucar, D.; Božanić, D. Prioritized aggregation operators for intuitionistic fuzzy information based on Aczel–Alsina T-norm and T-conorm and their applications in group decision-making. Symmetry 2022, 14, 2655. [Google Scholar] [CrossRef]
  17. Hussain, A.; Ullah, K.; Alshahrani, M.N.; Yang, M.S.; Pamucar, D. Novel Aczel-Alsina operators for Pythagorean fuzzy sets with application in multi-attribute decision making. Symmetry 2022, 14, 940. [Google Scholar] [CrossRef]
  18. Jin, H.; Hussain, A.; Ullah, K.; Javed, A. Novel complex Pythagorean fuzzy sets under Aczel–Alsina operators and their application in multi-attribute decision making. Symmetry 2023, 15, 68. [Google Scholar] [CrossRef]
  19. Ye, J.; Du, S.; Yong, R. Aczel–Alsina weighted aggregation operators of neutrosophic Z-numbers and their multiple attribute decision-making method. Int. J. Fuzzy Syst. 2022, 24, 2397–2410. [Google Scholar] [CrossRef]
  20. Senapati, T. Approaches to multi-attribute decision-making based on picture fuzzy Aczel–Alsina average aggregation operators. Comput. Appl. Math. 2022, 41, 40. [Google Scholar] [CrossRef]
  21. Naeem, M.; Khan, Y.; Ashraf, S.; Weera, W.; Batool, B. A novel picture fuzzy Aczel-Alsina geometric aggregation information: Application to determining the factors affecting mango crops. AIMS Math. 2022, 7, 12264–12288. [Google Scholar] [CrossRef]
  22. Xu, Z. Approaches to multiple attribute group decision making based on intuitionistic fuzzy power aggregation operators. Knowl.-Based Syst. 2011, 24, 749–760. [Google Scholar] [CrossRef]
  23. Jiang, W.; Wei, B.; Liu, X.; Li, X.; Zheng, H. Intuitionistic fuzzy power aggregation operator based on entropy and its application in decision making. Int. J. Intell. Syst. 2018, 33, 49–67. [Google Scholar] [CrossRef]
  24. Rani, D.; Garg, H. Complex intuitionistic fuzzy power aggregation operators and their applications in multicriteria decision-making. Expert Syst. 2018, 35, e12325. [Google Scholar] [CrossRef]
  25. Liu, P.; Akram, M.; Bashir, A. Extensions of power aggregation operators for decision making based on complex picture fuzzy knowledge. J. Intell. Fuzzy Syst. 2021, 40, 1107–1128. [Google Scholar] [CrossRef]
  26. Mahmood, T.; ur Rehman, U.; Ali, Z. Analysis and Application of Aczel-Alsina Aggregation operators Based on Bipolar Complex Fuzzy Information in Multiple Attribute Decision Making. Inf. Sci. 2023, 619, 817–833. [Google Scholar] [CrossRef]
Table 1. The procedure of decision-making application.
Table 1. The procedure of decision-making application.
Organized Algorithm for Evaluating the Decision-Making Problem
Notice that here we construct a decision-making procedure based on the proposed theory, whose main steps are stated below:
Step 1: During the construction of every decision matrix, experts have faced two types of information like cost and benefit. In this problem, if we have cost type of data, then normalize it, such as Equation (26)
But, if we have a benefit type of data, then proceed with the procedure of decision-making application.
Step 2: To use the idea of CPFAAP-A, CPFAAWP-A, CPFAAP-G, and CPFAAWP-G operators, we concentrate to aggregate the information matrix into a single set theory.
Step 3: To use the idea of score and accuracy values, we focus to more evaluate the single aggregated values into real-valued information.
Step 4: To use the score values, we examine the ranking values for evaluating the finest preferences from the collection of finite preferences.
Table 2. Complex picture fuzzy information matrix.
Table 2. Complex picture fuzzy information matrix.
Alternatives/Attributes G w 1 = G w 2 =
G w 1 = ( ( 0.5 , 0.4 ) , ( 0.3 , 0.2 ) , ( 0.1 , 0.1 ) )   ( ( 0.51 , 0.41 ) , ( 0.31 , 0.21 ) , ( 0.11 , 0.11 ) )
  G w 2 =   ( ( 0.4 , 0.3 ) , ( 0.4 , 0.2 ) , ( 0.1 , 0.3 ) )   ( ( 0.41 , 0.31 ) , ( 0.41 , 0.21 ) , ( 0.11 , 0.31 ) )
  G w 3 =   ( ( 0.6 , 0.7 ) , ( 0.2 , 0.1 ) , ( 0.1 , 0.1 ) )   ( ( 0.61 , 0.71 ) , ( 0.21 , 0.11 ) , ( 0.11 , 0.11 ) )
  G w 4 =   ( ( 0.3 , 0.2 ) , ( 0.2 , 0.1 ) , ( 0.2 , 0.4 ) )   ( ( 0.31 , 0.21 ) , ( 0.21 , 0.11 ) , ( 0.21 , 0.41 ) )
  G w 5 =   ( ( 0.1 , 0.2 ) , ( 0.1 , 0.2 ) , ( 0.1 , 0.1 ) )   ( ( 0.11 , 0.21 ) , ( 0.11 , 0.21 ) , ( 0.11 , 0.11 ) )
Alternatives/Attributes   G w 3 =   G w 4 =
  G w 1 =   ( ( 0.52 , 0.42 ) , ( 0.32 , 0.22 ) , ( 0.12 , 0.12 ) )   ( ( 0.53 , 0.43 ) , ( 0.33 , 0.23 ) , ( 0.13 , 0.13 ) )
  G w 2 =   ( ( 0.42 , 0.32 ) , ( 0.42 , 0.22 ) , ( 0.12 , 0.32 ) )   ( ( 0.43 , 0.33 ) , ( 0.43 , 0.23 ) , ( 0.13 , 0.33 ) )
  G w 3 =   ( ( 0.62 , 0.72 ) , ( 0.22 , 0.12 ) , ( 0.12 , 0.12 ) )   ( ( 0.63 , 0.73 ) , ( 0.23 , 0.13 ) , ( 0.13 , 0.13 ) )
  G w 4 =   ( ( 0.32 , 0.22 ) , ( 0.22 , 0.12 ) , ( 0.22 , 0.42 ) )   ( ( 0.33 , 0.23 ) , ( 0.23 , 0.13 ) , ( 0.23 , 0.43 ) )
  G w 5 =   ( ( 0.12 , 0.22 ) , ( 0.12 , 0.22 ) , ( 0.12 , 0.12 ) )   ( ( 0.13 , 0.23 ) , ( 0.13 , 0.23 ) , ( 0.13 , 0.13 ) )
Table 3. Covered data of power weight vectors.
Table 3. Covered data of power weight vectors.
G w 1 = G w 2 = G w 3 = G w 4 = G w 5 =
  K 1 = = 0.2494   K 1 = = 0.2494   K 1 = = 0.2494   K 1 = = 0.2494   K 1 = = 0.2494
  K 2 = = 0.2506   K 2 = = 0.2506   K 2 = = 0.2506   K 2 = = 0.2506   K 2 = = 0.2506
  K 3 = = 0.2506   K 3 = = 0.2506   K 3 = = 0.2506   K 3 = = 0.2506   K 3 = = 0.2506
  K 4 = = 0.2494   K 4 = = 0.2494   K 4 = = 0.2494   K 4 = = 0.2494   K 4 = = 0.2494
Table 4. Covered aggregated data.
Table 4. Covered aggregated data.
AlternativesCPFAAP-A OperatorCPFAAP-G Operator
  G w 1 =   ( ( 0.2699 , 0.2079 ) , ( 0.6052 , 0.5125 ) , ( 0.3897 , 0.3897 ) )   ( ( 0.7494 , 0.6823 ) , ( 0.1517 , 0.1 ) , ( 0.052 , 0.052 ) )
  G w 2 =   ( ( 0.2079 , 0.1517 ) , ( 0.6823 , 0.5125 ) , ( 0.3897 , 0.6052 ) )   ( ( 0.6823 , 0.6052 ) , ( 0.2079 , 0.1 ) , ( 0.052 , 0.1517 ) )
  G w 3 =   ( ( 0.3396 , 0.4206 ) , ( 0.5125 , 0.3897 ) , ( 0.3897 , 0.3897 ) )   ( ( 0.8095 , 0.8642 ) , ( 0.1 , 0.052 ) , ( 0.052 , 0.052 ) )
  G w 4 =   ( ( 0.1517 , 0.1 ) , ( 0.5125 , 0.3897 ) , ( 0.5125 , 0.6823 ) )   ( ( 0.6052 , 0.5125 ) , ( 0.1 , 0.052 ) , ( 0.1 , 0.2079 ) )
  G w 5 =   ( ( 0.052 , 0.1 ) , ( 0.3897 , 0.5125 ) , ( 0.3897 , 0.3897 ) )   ( ( 0.3897 , 0.5125 ) , ( 0.052 , 0.1 ) , ( 0.052 , 0.052 ) )
AlternativesCPFAAWP-A OperatorCPFAAWP-G Operator
  G w 1 =   ( ( 0.2692 , 0.2073 ) , ( 0.6043 , 0.5113 ) , ( 0.3881 , 0.3881 ) )   ( ( 0.7488 , 0.6815 ) , ( 0.1512 , 0.0995 ) , ( 0.0516 , 0.0516 ) )
  G w 2 =   ( ( 0.2073 , 0.1512 ) , ( 0.6815 , 0.5113 ) , ( 0.3881 , 0.6043 ) )   ( ( 0.6815 , 0.6043 ) , ( 0.2073 , 0.0995 ) , ( 0.0516 , 0.1512 ) )
  G w 3 =   ( ( 0.3389 , 0.4198 ) , ( 0.5113 , 0.3881 ) , ( 0.3881 , 0.3881 ) )   ( ( 0.8089 , 0.8637 ) , ( 0.0995 , 0.0516 ) , ( 0.0516 , 0.0516 ) )
  G w 4 =   ( ( 0.1512 , 0.0995 ) , ( 0.5113 , 0.3881 ) , ( 0.5113 , 0.6815 ) )   ( ( 0.6043 , 0.5113 ) , ( 0.0995 , 0.0516 ) , ( 0.0995 , 0.2073 ) )
  G w 5 =   ( ( 0.0516 , 0.0995 ) , ( 0.3881 , 0.5113 ) , ( 0.3881 , 0.3881 ) )   ( ( 0.3881 , 0.5113 ) , ( 0.0516 , 0.0995 ) , ( 0.0516 , 0.0516 ) )
Table 5. Covered score information.
Table 5. Covered score information.
AlternativesCPFAAP-A OperatorCPFAAP-G OperatorCPFAAWP-A OperatorCPFAAWP-G Operator
  G w 1 =   0.4731   0.3587   0.4717   0.3588
  G w 2 =   0.61   0.2586   0.6089   0.2587
  G w 3 =   0.3071   0.4726   0.3056   0.4728
  G w 4 =   0.6151   0.2193   0.6139   0.2192
  G w 5 =   0.5099   0.2154   0.5082   0.2151
Table 6. Covered ranking values.
Table 6. Covered ranking values.
CPFAAP-A Operator   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G Operator   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A Operator   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G Operator   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
Table 7. Covered score values (without phase terms).
Table 7. Covered score values (without phase terms).
AlternativesCPFAAP-A OperatorCPFAAP-G OperatorCPFAAWP-A OperatorCPFAAWP-G Operator
G w 1 = −0.36250.2729−0.36160.273
G w 2 = −0.43210.2112−0.43110.2113
G w 3 = −0.28130.3288−0.28030.3289
G w 4 = −0.43660.2026−0.43580.2026
G w 5 = −0.36370.1429−0.36230.1425
Table 8. Covered ranking values.
Table 8. Covered ranking values.
CPFAAP-A Operator G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G Operator G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A Operator G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G Operator G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
Table 9. Evaluation of parameters for different values (with phase data).
Table 9. Evaluation of parameters for different values (with phase data).
ParameteOperatoScore ValueRanking Value
U = 1 CPFAAP-A−0.4735, −0.6104, −0.3077, −0.6155, −0.5105   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.359, 0.259, 0.473, 0.2196, 0.2159   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4722, −0.6093, −0.3062, −0.6143, −0.5088   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3592,0.2591,0.4733,0.2196,0.2157   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
  U = 3 CPFAAP-A−0.4727, −0.6097, −0.3066, −0.6147, −0.5093   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.3583, 0.2583, 0.4722, 0.2189, 0.2149   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4712, −0.6085, −0.305, −0.6134, −0.5075   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3584, 0.2584, 0.4723, 0.2188, 0.2145   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
  U = 5 CPFAAP-A−0.4718, −0.609, −0.3056, −0.6139, −0.5082   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.3577, 0.2577, 0.4714, 0.2182, 0.2139   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4703, −0.6077, −0.3038, −0.6125, −0.5062   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3576, 0.2577, 0.4714, 0.218, 0.2133   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
  U = 7 CPFAAP-A−0.4709, −0.6082, −0.3045, −0.6131, −0.507   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.357, 0.2571, 0.4707, 0.2176, 0.213   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4693, −0.6069, −0.3027, −0.6117, −0.5049   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3568, 0.257, 0.4705, 0.2172, 0.2122   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
  U = 10 CPFAAP-A−0.4697, −0.6072, −0.303, −0.612, −0.5054   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.3561, 0.2563, 0.4696, 0.2166, 0.2116   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4679, −0.6057, −0.301, −0.6104, −0.5031   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3557, 0.2559, 0.4693, 0.2161, 0.2107   G w 3 = > G w 1 = > G w 2 = > G w 5 = > G 4 =
Table 10. Evaluation of parameters for different values (without phase data).
Table 10. Evaluation of parameters for different values (without phase data).
ParameteOperatoScore ValueRanking Value
  U = 1 CPFAAP-A−0.3628, −0.4324, −0.2816, −0.4369, −0.3642   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.2731, 0.2115, 0.329, 0.2028, 0.1433   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3619, −0.4315, −0.2807, −0.4361, −0.3629   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.2733, 0.2116, 0.3292, 0.2029, 0.143   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
U = 3 CPFAAP-A−0.3622, −0.4318, −0.2809, −0.4364, −0.3632   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.2726, 0.211, 0.3285, 0.2024, 0.1424   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3612, −0.4308, −0.2799, −0.4355, −0.3617   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.2727, 0.211, 0.3286, 0.2024, 0.142   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
U = 5 CPFAAP-A−0.3616, −0.4311, −0.2803, −0.4358, −0.3622   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.2721, 0.2105, 0.328, 0.2019, 0.1416   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3605, −0.4301, −0.2791, −0.4349, −0.3606   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.2721, 0.2105, 0.328, 0.2018, 0.1409   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
U = 7 CPFAAP-A−0.361, −0.4305, −0.2796, −0.4353, −0.3613   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.2716, 0.21, 0.3274, 0.2014, 0.1407 G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3598, −0.4294, −0.2783, −0.4343, −0.3595 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.2716, 0.2099, 0.3274, 0.2013, 0.14 G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
U = 10 CPFAAP-A−0.36, −0.4297, −0.2786, −0.4346, −0.3599 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.271, 0.2093, 0.3267, 0.2008, 0.1395 G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3588, −0.4285, −0.2772, −0.4334, −0.358 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.2708, 0.2091, 0.3265, 0.2005, 0.1386 G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
Table 11. Comparison information for data is in Table 2 (with phase terms).
Table 11. Comparison information for data is in Table 2 (with phase terms).
MethodScore ValueRanking Value
Senapati et al. [14] X X X X X X X X X X
Senapati et al. [15] X X X X X X X X X X
Sarfraz et al. [16] X X X X X X X X X X
Senapati [19] X X X X X X X X X X
Naeem et al. [20] X X X X X X X X X X
Mahmood et al. [21] X X X X X X X X X X
Xu [22] X X X X X X X X X X
Jiang et al. [23] X X X X X X X X X X
Rani and Garg [24] X X X X X X X X X X
Liu et al. [25]0.0573, −0.1095, 0.2574, −0.1429, −0.076 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-A−0.4731, −0.61, −0.3071, −0.6151, −0.5099 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.3587, 0.2586, 0.4726, 0.2193, 0.2154 G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.4717, −0.6089, −0.3056, −0.6139, −0.5082   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.3588, 0.2587, 0.4728, 0.2192, 0.2151   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
Table 12. Comparison information for data in Table 2 (without phase terms).
Table 12. Comparison information for data in Table 2 (without phase terms).
MethodsScore ValuesRanking Values
Senapati et al. [14] X X X X X   X X X X X
Senapati et al. [15] X X X X X X X X X X
Sarfraz et al. [16] X X X X X X X X X X
Senapati [19]−0.3588,−0.4285,−0.2772,−0.4334,−0.358   G w 3 = > G w 5 = > G w 1 = > G w 2 = > G w 4 =
Naeem et al. [20]−0.3588,−0.4285,−0.2772,−0.4334,−0.358   G w 3 = > G w 5 = > G w 1 = > G w 2 = > G w 4 =
Mahmood et al. [21]   X X X X X   X X X X X
Xu [22] X X X X X X X X X X
Jiang et al. [23] X X X X X X X X X X
Rani and Garg [24] X X X X X X X X X X
Liu et al. [25]0.0429, −0.0571, 0.143, −0.0572, −0.0569 G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-A−0.3625, −0.4321, −0.2813, −0.4366, −0.3637   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAP-G0.2729, 0.2112, 0.3288, 0.2026, 0.1429   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
CPFAAWP-A−0.3616, −0.4311, −0.2803, −0.4358, −0.3623   G w 3 = > G w 1 = > G w 5 = > G w 2 = > G w 4 =
CPFAAWP-G0.273, 0.2113, 0.3289, 0.2026, 0.1425   G w 3 = > G w 1 = > G w 2 = > G w 4 = > G w 5 =
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ali, Z.; Mahmood, T.; Yang, M.-S. Aczel–Alsina Power Aggregation Operators for Complex Picture Fuzzy (CPF) Sets with Application in CPF Multi-Attribute Decision Making. Symmetry 2023, 15, 651. https://doi.org/10.3390/sym15030651

AMA Style

Ali Z, Mahmood T, Yang M-S. Aczel–Alsina Power Aggregation Operators for Complex Picture Fuzzy (CPF) Sets with Application in CPF Multi-Attribute Decision Making. Symmetry. 2023; 15(3):651. https://doi.org/10.3390/sym15030651

Chicago/Turabian Style

Ali, Zeeshan, Tahir Mahmood, and Miin-Shen Yang. 2023. "Aczel–Alsina Power Aggregation Operators for Complex Picture Fuzzy (CPF) Sets with Application in CPF Multi-Attribute Decision Making" Symmetry 15, no. 3: 651. https://doi.org/10.3390/sym15030651

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