Next Article in Journal
An Artificial Neural Network Approach for Solving Space Fractional Differential Equations
Previous Article in Journal
Two Generic Convergence Results for Infinite Products of Generalized Nonexpansive Mappings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis and Applications of Bonferroni Mean Operators and TOPSIS Method in Complete Cubic Intuitionistic Complex Fuzzy Information Systems

1
Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad 44000, Pakistan
2
Department of Mathematics and Computer Science, Chulalongkorn University, Bangkok 10330, Thailand
3
Division of Computational Science, Faculty of Science, Prince of Songkla University, Songkhla 90110, Thailand
*
Authors to whom correspondence should be addressed.
Symmetry 2022, 14(3), 533; https://doi.org/10.3390/sym14030533
Submission received: 18 February 2022 / Revised: 2 March 2022 / Accepted: 3 March 2022 / Published: 5 March 2022

Abstract

:
This article manages vagueness, asymmetric data, and risk demonstrated in awkward information. The ambiguity is handled with the help of possibility and strategic decision-making theory. A MADM (multi-attribute decision-making) tool, the sub-part of the strategic decision theory, plays an important role in the circumstances of fuzzy data. The major influence of this analysis is to initiate the mathematical ideology of cubic intuitionistic complex fuzzy (CICF) information and its well-known properties such as algebraic laws, score values, and accuracy values. It is also to determine various inequalities for finding the relation between any two CICF numbers (CICFNs). Further, we know that the Bonferroni mean (BM) operator is more generalized than the simple averaging/geometric aggregation operators due to parameters involved in the mathematical form of BM operators. Keeping the supremacy and consistency of BM operators, the idea of CICF Bonferroni mean (CICFBM) and CICF weighted BM (CICFWBM) operators are diagnosed. We try to describe their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases. Further, we investigate three different sorts of decision-making procedures such as MADM tool, TOPSIS (Technique for order of preference by similarity to ideal solution) method using similarity measures, and TOPSIS method using aggregation operators to enhance the quality of the decision-making process. This analysis expressed how to make decisions when there is asymmetric data about companies. Finally, we compute the comparative analysis of the diagnostic approaches with various existing theories to demonstrate the feasibility and flexibility of the exposed work to try to illustrate with the help of geometrical expressions.

1. Introduction

MADM analysis is a tool for making options when there are massive awkward dilemmas involving various criteria. It is also used when there are many experts or parties who may be impacted by the outcomes of the options. They are the subparts of the decision-making strategy of operation research that deeply evaluates various conflicting criteria in decision-making. A certain decision-making procedure has been unsuccessful using crisp sets due to their structure because they have only two possibilities such as “0” or “1.” All scholars have tried to find the beneficial optimal procedure from the family of alternatives for crisp sets, which have lost a lot of information during decision-making procedures. Hence, achieving a beneficial decision is an enormously problematic task for individuals. Hence, the mathematical and theoretical concept of fuzzy set [1] was offered to compute MADM regards in complexity and ambiguity, employing the truth grade (TG) to demonstrate the level of a term involving an FS. MADM tools, a procedure for deciding between the considered alternatives that are provided by many attributes, are important for enhancing decision-making in a large space from proficient to organizational to political. This instruction manual recommends social scholars an encapsulated view of the MADM technique, its advantages, efficiencies, and the technique for evaluating MADM dilemmas. To enhance accuracy and effectiveness in the data shown of demonstration criteria and feasibility of strategic decision-making results, scholars have diagnosed techniques using distinct extensions of FSs for different application frameworks, including the application of soft sets [2], N-soft sets [3], fuzzy soft sets [4], fuzzy N-soft sets [5], bipolar soft sets [6], and the decision-making process [7,8].
The above-cited theory has received much attention from different scholars, but there are various dilemmas in FS for managing awkward information. As such, the dominant theory of intuitionistic FS (IFS) that began by Atanassov [9] included two parts of functions, called TG and falsity grade (FG). In IFS, the value of the sum of the duplet classes lies between unit intervals. To enhance accuracy and effectiveness in the data shown of demonstration criteria and feasibility of strategic decision-making results, scholars have diagnosed techniques using distinct extensions of IFSs for different application frameworks. This includes the concept of t-norm and t-conorm by Xu and Yager [10] who diagnosed the theory of geometric operators using IFSs. Further, Zhao et al. [11] enhanced the aggregation operator to diagnose the generalized aggregation operators using IFS and described their application, where the simple aggregation operator for IFS was exposed by Xu [12]. To demonstrate the closeness among any number of attributes is very challenging for decision-makers. To resolve these issues, certain scholars have diagnosed different sorts of measures based on IFS, proposed by Dengfeng and Chuntian [13], Hung and Yang [14], and Liang and Shi [15]. The hybrid operators also play an important role in the environment of fuzzy set theory. To this, we also revised various prevailing theories such as Bonferroni mean operators for IFSs [16], geometric Heronian mean operators for IFSs [17], and simple Heronian mean operators for IFSs [18]. Further, the fundamental theory of interval-valued IFS was diagnosed by Atanassov [19]. It contains simple two grades in the shape of intervals whose upper parts of the duplet should lie in the unit interval. Additionally, Kaur and Garg [20] combined the theory of IFS and interval-valued IFS to propose the novel concept of cubic IFS. Moreover, aggregation operators using cubic IFS were diagnosed by Kaur and Garg [21].
From the above-cited theory, it is noted that the strategic MADM tool, pattern recognition, clustering algorithm, and computer networking have been diagnosed for FS, IFS, CIFS, and cubic IFS. These theories are incompetent to manage time-periodic dilemmas and two-dimension data simultaneously in a single set. Therefore, Ramot et al. [22] diagnosed complex FS (CFS) theory, addressed by TG, whose real and unreal parts are constructed in the shape of intervals. Further, many discussions were diagnosed based on CFS in the environment of aggregation operators [23], using similarity measures [24], methods [25], and decision-making scenarios [26]. Further, in various dilemmas, the theory of CFS has been neglected for managing awkward information such as in the shape of yes or no. As such the dominant theory of complex IFS (CIFS) was begun by Alkouri and Salleh [27]. The obtained value from the characteristic, the sum of the real part (also for the imaginary part) of the duplet is less than or equal to 1, of CIFS should lie between unit intervals. To enhance accuracy and effectiveness in the data shown of demonstration criteria and feasibility of strategic decision-making results, scholars have diagnosed techniques using distinct extensions of CIFSs for different application frameworks, including the novel concept of the complex intuitionistic fuzzy soft set that was diagnosed by Ali et al. [28]. Further, the fundamental theory of complex intuitionistic fuzzy relation was diagnosed by Jan et al. [29]. Yet many complications are working in the availability of the above-cited work. For this, the novel theory of complex interval-valued IFS (CIVIFS) was diagnosed by Garg and Rani [30].
The notion of CICF settings and BM operators are massively closely linked to the idea of symmetry. Under the symmetry, we can talk about the mixture of both theories. The TOPSIS tool is also very valuable for computing the beneficial option using various similarity measures or aggregation operators. Various diagnoses are described, for instance, the TOPSIS technique based on FS was diagnosed by Chen [31]. The Analytic Hierarchy Process (AHP) and TOPSIS technique for FS were also investigated by Junior et al. [32]. Further, Shen et al. [33] utilized the novel concept of the TOPSIS tool in the environment of IF settings and described its application in the region of MADM techniques. Li [34] improved the quality of the TOPSIS tool and utilized it in the region of interval-valued IFSs. Finally, Garg and Kaur [35] diagnosed the extended form of the TOPSIS tool using cubic IFSs and described their application in the environment of decision-making strategy. Yet, no one combined the theory of CIFS, and complex interval-valued IFS was to propose the theory of CICF setting and their important laws. The major contribution of this analysis is to analyze the novel theory of CICF setting and their laws to improve the quality of the research work. The proposed work in this analysis is described here.
  • To initiate the mathematical ideology of CICF information and their well-known properties such as algebraic laws, score values, and accuracy values and to determine various inequalities for finding the order between any two CICFNs.
  • To diagnose the idea of CICFBM, CICFWBM operators are diagnosed and trying to describe their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases.
  • To explore the TOPSIS tool, which is also very valuable for computing the beneficial option using various similarity measures or aggregation operators.
  • To investigate three different sorts of decision-making procedures such as MADM tool, TOPSIS method using similarity measures, and TOPSIS method using aggregation operators to enhance the quality of the decision-making process.
  • To compute the comparative analysis of the diagnostic approaches with various existing theories to demonstrate the feasibility and flexibility of the exposed work and try to illustrate this with the help of geometrical expressions.
The proposed analysis is organized in the shape: In Section 2, we recall the mathematical ideology of CIFS, CIVIFS, and their well-known properties such as algebraic laws, score values, accuracy values. We determined various inequalities for finding the order between any two CIFS and CIVIFSs. Further, we recall the mathematical ideology of the BM operator. In Section 3, we initiate the mathematical ideology of CICF information and their well-known properties such as algebraic laws, score values, and accuracy values. We determined various inequalities for finding the order between any two CICFNs. In Section 4, we know that the BM operator is more generalized than the simple averaging/geometric aggregation operators, due to the parameters involved in the mathematical form of BM operators. Keeping the supremacy and consistency of BM operators, the idea of CICFBM and CICFWBM operators are diagnosed. We try to describe their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases. In Section 5, we investigate three different sorts of decision-making procedures such as the MADM tool, TOPSIS method using similarity measures, and TOPSIS method using aggregation operators to enhance the quality of the decision-making process. In Section 6, we compute the comparative analysis of the diagnostic approaches with various existing theories to demonstrate the feasibility and flexibility of the exposed work. We try to illustrate with the help of geometrical expressions. Section 7 describes the concluding remarks.

2. Preliminaries

In this analysis, we recall the mathematical ideology of CIFS, CIVIFS, and their well-known properties such as algebraic laws, score values, and accuracy values. We determined various inequalities for finding the order between any two CIFS and CIVIFSs. Further, we recall the mathematical ideology of the BM operator. Movingforward, the term X U ˜ , is used for universal sets.
Definition 1
([27]). A CIFS  = is diagnosed by:
= = { ( = = ( x E ˜ ) , N = = ( x E ˜ ) ) : x E ˜ X U ˜ }
where = = ( x E ˜ ) = R = = e i 2 π ( I = = ) and N = = ( x E ˜ ) = N R = = e i 2 π ( N I = = ) , stated the TD and FD with 0 R = = ( x E ˜ ) + N R = = ( x E ˜ ) 1 and 0 I = = ( x E ˜ ) + N I = = ( x E ˜ ) 1 . The expression = = ( x E ˜ ) = R = = ( x E ˜ ) e i 2 π ( I = = ( x E ˜ ) ) = ( 1 ( R = = ( x E ˜ ) + N R = = ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = ( x E ˜ ) + N I = = ( x E ˜ ) ) ) , called neutral grade. The complex intuitionistic fuzzy number (CIFN) is diagnosed by: τ = = ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) , τ = 1 , 2 , , Ω .
Definition 2
[27]. By considering any two CIFNs  τ = = ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) , τ = 1 , 2 , then
1 = 2 = = ( ( R 1 = = + R 2 = = R 1 = = R 2 = = ) e i 2 π ( I 1 = = + I 2 = = I 1 = = I 2 = = ) , ( N R 1 = = N R 2 = = ) e i 2 π ( N I 1 = = N I 2 = = ) )    
1 = 2 = = ( ( R 1 = = R 2 = = ) e i 2 π ( I 1 = = I 2 = = ) , ( N R 1 = = + N R 2 = = N R 1 = = N R 2 = = ) e i 2 π ( N I 1 = = + N I 2 = = N I 1 = = N I 2 = = ) )        
ψ S = 1 = = ( 1 ( 1 R 1 = = ) ψ S = e i 2 π ( 1 ( 1 I 1 = = ) ψ S = ) , N R 1 = = ψ S = e i 2 π ( N I 1 = = ψ S = ) )
1 = ψ S = = ( R 1 = = ψ S = e i 2 π ( I 1 = = ψ S = ) , 1 ( 1 N R 1 = = ) ψ S = e i 2 π ( 1 ( 1 N I 1 = = ) ψ S = ) )
Definition 3
([27]). By considering any CIFNs  τ = = ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) , τ = 1 , then the SV and AV are diagnosed by:
S S V = ( 1 = ) = 1 2 ( R 1 = = + I 1 = = N R 1 = = N I 1 = = ) , S S V = ( 1 = ) [ 1 , 1 ]
A V = ( 1 = ) = 1 2 ( R 1 = = + I 1 = = + N R 1 = = + N I 1 = = ) , A V = ( 1 = ) [ 0 , 1 ]  
Definition 4
([27]). By considering any CIFNs  τ = = ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) , τ = 1 , 2 , then
1. 
When S S V = ( 1 = ) > S S V = ( 2 = ) 1 = > 2 = ;
2. 
When S S V = ( 1 = ) < S S V = ( 2 = ) 1 = < 2 = ;
3. 
When S S V = ( 1 = ) = S S V = ( 2 = ) ;
(i) 
When A V = ( 1 = ) > A V = ( 2 = ) 1 = > 2 = ;
(ii) 
When A V = ( 1 = ) < A V = ( 2 = ) 1 = < 2 = ;
(iii) 
When A V = ( 1 = ) = A V = ( 2 = ) 1 = = 2 = .
Definition 5
([30]). A CIVIFS  =  is diagnosed by:
= = { ( = = ( x E ˜ ) , N = = ( x E ˜ ) ) : x E ˜ X U ˜ }
where = = ( x E ˜ ) = [ R = = L ( x E ˜ ) , R = = U ( x E ˜ ) ] e i 2 π ( [ I = = L ( x E ˜ ) , I = = U ( x E ˜ ) ] ) and N = = ( x E ˜ ) = [ N R = = L ( x E ˜ ) , N R = = U ( x E ˜ ) ] e i 2 π ( [ N I = = L ( x E ˜ ) , N I = = U ( x E ˜ ) ] ) , stated the IVTD, IVFD with 0 R = = U ( x E ˜ ) + N R = = U ( x E ˜ ) 1 and 0 I = = U ( x E ˜ ) + N I = = U ( x E ˜ ) 1 . The expression R = = U ( x E ˜ ) e i 2 π ( I = = U ( x E ˜ ) ) = ( 1 ( R = = U ( x E ˜ ) + N R = = U ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = U ( x E ˜ ) + N I = = U ( x E ˜ ) ) ) ,   R = = L ( x E ˜ ) e i 2 π ( I = = L ( x E ˜ ) ) = ( 1 ( R = = L ( x E ˜ ) + N R = = L ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = L ( x E ˜ ) + N I = = L ( x E ˜ ) ) ) , called neutral grade. The complex interval-valued intuitionistic fuzzy number (CIVIFN) is diagnosed by: τ = = ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) , τ = 1 , 2 , , Ω .
Definition 6
[30]. By considering any two CIVIFNs  τ = = ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) , τ = 1 , 2 , then
1 = 2 = = ( [ R 1 = = L + R 2 = = L R 1 = = L R 2 = = L , R 1 = = U + R 2 = = U R 1 = = U R 2 = = U ]   e i 2 π ( [ I 1 = = L + I 2 = = L I 1 = = L I 2 = = L , I 1 = = U + I 2 = = U I 1 = = U I 2 = = U ] ) , [ N R 1 = = L N R 2 = = L , N R 1 = = U N R 2 = = U ] e i 2 π ( [ N I 1 = = L N I 2 = = L , N I 1 = = U N I 2 = = U ] ) )
1 = 2 = = ( [ R 1 = = L R 2 = = L , R 1 = = U R 2 = = U ]   e i 2 π ( [ I 1 = = L I 2 = = L , I 1 = = U I 2 = = U ] ) , [ N R 1 = = L + N R 2 = = L N R 1 = = L N R 2 = = L , N R 1 = = U + N R 2 = = U N R 1 = = U N R 2 = = U ]   e i 2 π ( [ N I 1 = = L + N I 2 = = L N I 1 = = L N I 2 = = L , N I 1 = = U + N I 2 = = U N I 1 = = U N I 2 = = U ] ) )
ψ S = 1 = = ( [ 1 ( 1 R 1 = = L ) ψ S = , 1 ( 1 R 1 = = U ) ψ S = ] e i 2 π ( [ 1 ( 1 I 1 = = L ) ψ S = , 1 ( 1 I 1 = = U ) ψ S = ] ) , [ N R 1 = = L ψ S = , N R 1 = = U ψ S = ] e i 2 π ( [ N I 1 = = L ψ S = , N I 1 = = U ψ S = ] ) )
1 = ψ S = = ( [ R 1 = = L ψ S = , R 1 = = U ψ S = ] e i 2 π ( [ I 1 = = L ψ S = , I 1 = = U ψ S = ] ) , [ 1 ( 1 N R 1 = = L ) ψ S = , 1 ( 1 N R 1 = = U ) ψ S = ] e i 2 π ( [ 1 ( 1 N I 1 = = L ) ψ S = , 1 ( 1 N I 1 = = U ) ψ S = ] ) )
Definition 7
([30]). By considering any CIVIFNs  τ = = ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) , τ = 1 , then the SV and AV are diagnosed by:
S S V = ( 1 = ) = 1 4 ( R 1 = = U + R 1 = = L + I 1 = = U + I 1 = = L N R 1 = = U N R 1 = = L N I 1 = = U N I 1 = = L ) , S S V = ( 1 = ) [ 1 , 1 ]    
A V = ( 1 = ) = 1 4 ( R 1 = = U + R 1 = = L + I 1 = = U + I 1 = = L + N R 1 = = U + N R 1 = = L + N I 1 = = U + N I 1 = = L ) , A V = ( 1 = ) [ 0 , 1 ]  
Definition 8
([30]). By considering any CIVIFNs  τ = = ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) , τ = 1 , 2 , then
1. 
When S S V = ( 1 = ) > S S V = ( 2 = ) 1 = > 2 = ;
2. 
When S S V = ( 1 = ) < S S V = ( 2 = ) 1 = < 2 = ;
3. 
When S S V = ( 1 = ) = S S V = ( 2 = ) ;
i 
When A V = ( 1 = ) > A V = ( 2 = ) 1 = > 2 = ;
ii 
When A V = ( 1 = ) < A V = ( 2 = ) 1 = < 2 = ;
iii 
When A V = ( 1 = ) = A V = ( 2 = ) 1 = = 2 = .
Definition 9
([36]). By considering any positive term  1 = , 2 = , , Ω =  with  μ , ψ 0  then the BM operator is diagnosed by:
B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ζ = μ τ = ψ ) 1 μ + ψ

3. Cubic Intuitionistic Complex Fuzzy Sets

In this analysis, we initiate the mathematical ideology of CICF information and their well-known properties such as algebraic laws, score values, and accuracy values. We determined various inequalities for finding the order between any two CICFNs.
Definition 10.
A CICFS  =  is diagnosed by:
= = { ( ( = = ( x E ˜ ) , N = = ( x E ˜ ) ) , ( = = ( x E ˜ ) , N = = ( x E ˜ ) ) ) : x E ˜ X U ˜ }
where  = = * ( x E ˜ ) = [ R = = L ( x E ˜ ) , R = = U ( x E ˜ ) ] e i 2 π ( [ I = = L ( x E ˜ ) , I = = U ( x E ˜ ) ] ) , N = = * ( x E ˜ ) = [ N R = = L ( x E ˜ ) , N R = = U ( x E ˜ ) ] e i 2 π ( [ N I = = L ( x E ˜ ) , N I = = U ( x E ˜ ) ] ) , = = ( x E ˜ ) = R = = e i 2 π ( I = = ) and N = = ( x E ˜ ) = N R = = e i 2 π ( N I = = ) , stated the IVTD, IVFD, TD, and FD with 0 R = = U ( x E ˜ ) + N R = = U ( x E ˜ ) 1 , 0 R = = ( x E ˜ ) + N R = = ( x E ˜ ) 1 and 0 I = = U ( x E ˜ ) + N I = = U ( x E ˜ ) 1 , 0 I = = ( x E ˜ ) + N I = = ( x E ˜ ) 1 . The expression R = = U ( x E ˜ ) e i 2 π ( I = = U ( x E ˜ ) ) = ( 1 ( R = = U ( x E ˜ ) + N R = = U ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = U ( x E ˜ ) + N I = = U ( x E ˜ ) ) ) , R = = L ( x E ˜ ) e i 2 π ( I = = L ( x E ˜ ) ) = ( 1 ( R = = L ( x E ˜ ) + N R = = L ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = L ( x E ˜ ) + N I = = L ( x E ˜ ) ) ) , = = ( x E ˜ ) = R = = ( x E ˜ ) e i 2 π ( I = = ( x E ˜ ) ) = ( 1 ( R = = ( x E ˜ ) + N R = = ( x E ˜ ) ) ) e i 2 π ( 1 ( I = = ( x E ˜ ) + N I = = ( x E ˜ ) ) ) , called neutral grade. The cubic intuitionistic complex fuzzy number (CICFN) is diagnosed by: τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , 2 , , Ω .
Definition 11.
By considering any two CICFNs  τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , 2 , then
1 = 2 = = ( ( [ R 1 = = L + R 2 = = L R 1 = = L R 2 = = L , R 1 = = U + R 2 = = U R 1 = = U R 2 = = U ]   e i 2 π ( [ I 1 = = L + I 2 = = L I 1 = = L I 2 = = L , I 1 = = U + I 2 = = U I 1 = = U I 2 = = U ] ) , [ N R 1 = = L N R 2 = = L , N R 1 = = U N R 2 = = U ] e i 2 π ( [ N I 1 = = L N I 2 = = L , N I 1 = = U N I 2 = = U ] ) ) , ( R 1 = = R 2 = = ) e i 2 π ( I 1 = = I 2 = = ) , ( N R 1 = = + N R 2 = = N R 1 = = N R 2 = = ) e i 2 π ( N I 1 = = + N I 2 = = N I 1 = = N I 2 = = ) )
1 = 2 = = ( ( [ R 1 = = L R 2 = = L , R 1 = = U R 2 = = U ] e i 2 π ( [ I 1 = = L I 2 = = L , I 1 = = U I 2 = = U ] ) , [ N R 1 = = L + N R 2 = = L N R 1 = = L N R 2 = = L , N R 1 = = U + N R 2 = = U N R 1 = = U N R 2 = = U ]   e i 2 π ( [ N I 1 = = L + N I 2 = = L N I 1 = = L N I 2 = = L , N I 1 = = U + N I 2 = = U N I 1 = = U N I 2 = = U ] ) ) , ( ( R 1 = = + R 2 = = R 1 = = R 2 = = ) e i 2 π ( I 1 = = + I 2 = = I 1 = = I 2 = = ) , ( N R 1 = = N R 2 = = ) e i 2 π ( N I 1 = = N I 2 = = ) ) )
ψ S = 1 = = ( ( [ 1 ( 1 R 1 = = L ) ψ S = , 1 ( 1 R 1 = = U ) ψ S = ] e i 2 π ( [ 1 ( 1 I 1 = = L ) ψ S = , 1 ( 1 I 1 = = U ) ψ S = ] ) , ( [ N R 1 = = L ψ S = , N R 1 = = U ψ S = ] e i 2 π ( [ N I 1 = = L ψ S = , N I 1 = = U ψ S = ] ) ) ) , ( R 1 = = ψ S = e i 2 π ( I 1 = = ψ S = ) , 1 ( 1 N R 1 = = ) ψ S = e i 2 π ( 1 ( 1 N I 1 = = ) ψ S = ) ) )
1 = ψ S = = ( ( [ R 1 = = L ψ S = , R 1 = = U ψ S = ] e i 2 π ( [ I 1 = = L ψ S = , I 1 = = U ψ S = ] ) , [ 1 ( 1 N R 1 = = L ) ψ S = , 1 ( 1 N R 1 = = U ) ψ S = ] e i 2 π ( [ 1 ( 1 N I 1 = = L ) ψ S = , 1 ( 1 N I 1 = = U ) ψ S = ] ) ) , ( 1 ( 1 R 1 = = ) ψ S = e i 2 π ( 1 ( 1 I 1 = = ) ψ S = ) , N R 1 = = ψ S = e i 2 π ( N I 1 = = ψ S = ) ) )
Definition 12.
By considering any CICFNs  τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , then the SV and AV are diagnosed by:
S S V = ( 1 = ) = 1 2 | 1 4 ( R 1 = = U + R 1 = = L + I 1 = = U + I 1 = = L N R 1 = = U N R 1 = = L N I 1 = = U N I 1 = = L ) + 1 2 ( R 1 = = + I 1 = = N R 1 = = N I 1 = = ) | , S S V = ( 1 = ) [ 1 , 1 ]
A V = ( 1 = ) = 1 2 | 1 4 ( R 1 = = U + R 1 = = L + I 1 = = U + I 1 = = L + N R 1 = = U + N R 1 = = L + N I 1 = = U + N I 1 = = L ) + 1 2 ( R 1 = = + I 1 = = + N R 1 = = + N I 1 = = ) | , A V = ( 1 = ) [ 0 , 1 ]        
Definition 13.
By considering any CICFNs  τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , 2 , then
1. 
When S S V = ( 1 = ) > S S V = ( 2 = ) 1 = > 2 = ;
2. 
When S S V = ( 1 = ) < S S V = ( 2 = ) 1 = < 2 = ;
3. 
When S S V = ( 1 = ) = S S V = ( 2 = ) ;
(i) 
When A V = ( 1 = ) > A V = ( 2 = ) 1 = > 2 = ;
(ii) 
When A V = ( 1 = ) < A V = ( 2 = ) 1 = < 2 = ;
(iii) 
When A V = ( 1 = ) = A V = ( 2 = ) 1 = = 2 = .

4. BM Operators for Cubic Intuitionistic Complex Fuzzy Sets

We know that the BM operator is more generalized than the simple averaging/geometric aggregation operators due to parameters involved in the mathematical form of BM operators. Keeping the supremacy and consistency of BM operators, the idea of CICFBM and CICFWBM operators are diagnosed. We try to describe their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases.
Definition 14.
By considering any collection of CICFNs  τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , 2 , , Ω , then the mapping  I F B M μ , ψ : Ω  is defined by:
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( ζ = μ τ = ψ ) ) 1 μ + ψ
Represented the CICFBM operator for μ , ψ 0 .
Theorem 1.
Evaluating the Equation (23) based on Definition 7, we interrogate
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] e i 2 π ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] ) , [ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] e i 2 π ( [ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] ) ) , ( 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ e i 2 π ( 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ e i 2 π ( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ) )
Proof of Theorem 1 is given in Appendix A.
Further, we described their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases.
Property 1.
If  τ = = = = ( ( [ R = = L , R = = U ] e i 2 π ( [ I = = L , I = = U ] ) , [ N R = = L , N R = = U ] e i 2 π ( [ N I = = L , N I = = U ] ) ) ,   ( R = = e i 2 π ( I = = ) , N R = = e i 2 π ( N I = = ) ) ) , then
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = =
Proof of Property 1 is given in Appendix B.
Property 2.
If  τ = τ = , that is R = τ = L R = τ = L , R = τ = U R = τ = U , I = τ = L I = τ = L , I = τ = U I = τ = U , N R τ = = L N R τ = = L , N R τ = = U N R τ = = U  and  N I τ = = L N I τ = = L , N I τ = = U N I τ = = U  with  R = τ = R = τ = , I = τ = I = τ = , N R τ = = N R τ = = , N I τ = = N I τ = =  , then
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) I F B M μ , ψ ( 1 = , 2 = , , Ω = )
Proof of Property 2 is given in Appendix C.
Property 3.
If  τ = = ( ( [ min τ R τ = = L , min τ R τ = = U ] e i 2 π ( [ min τ I τ = = L , min τ I τ = = U ] ) , [ max τ N R τ = = L , max τ N R τ = = U ] e i 2 π ( [ max τ N I τ = = L , max τ N I τ = = U ] ) ) , ( min τ R τ = = e i 2 π ( min τ I τ = = ) , max τ N R τ = = e i 2 π ( max τ N I τ = = ) ) )  and  τ = + = ( ( [ max τ R τ = = L , max τ R τ = = U ] e i 2 π ( [ max τ I τ = = L , max τ I τ = = U ] ) , [ min τ N R τ = = L , min τ N R τ = = U ] e i 2 π ( [ min τ N I τ = = L , min τ N I τ = = U ] ) ) , ( max τ R τ = = e i 2 π ( max τ I τ = = ) , min τ N R τ = = e i 2 π ( min τ N I τ = = ) ) ) , then
τ = I F B M μ , ψ ( 1 = , 2 = , , Ω = ) τ = +
Proof of Property 3 is given in Appendix D.
Definition 15.
By considering any collection of CICFNs  τ = = ( ( [ R τ = = L , R τ = = U ] e i 2 π ( [ I τ = = L , I τ = = U ] ) , [ N R τ = = L , N R τ = = U ] e i 2 π ( [ N I τ = = L , N I τ = = U ] ) ) ,   ( R τ = = e i 2 π ( I τ = = ) , N R τ = = e i 2 π ( N I τ = = ) ) ) , τ = 1 , 2 , , Ω , then the mapping  I F W B M μ , ψ : Ω  is defined by:
I F W B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( ( Ξ ζ ζ = ) μ ( Ξ τ τ = ) ψ ) ) 1 μ + ψ
Represented the CICFWBM operator for μ , ψ 0 , where Ξ1, Ξ2, …, Ξζ expressed th weight vector with ζ = 1 Ω Ξ ζ = 1 .
Theorem 2.
Evaluating the Equation (28) based on Definition 7, we interrogate
I F W B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( ( [ R = L , R = U ] e i 2 π ( [ I = L , I = U ] ) , [ N R = L , N R = U ] e i 2 π ( [ N I = L , N I = U ] ) ) , ( R = e i 2 π ( I = ) , N R = e i 2 π ( N I = ) ) )
R = L = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 R ζ = = L ) Ξ ζ ) μ ( 1 ( 1 R τ = = L ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
R = U = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 R ζ = = U ) Ξ ζ ) μ ( 1 ( 1 R τ = = U ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
I = L = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 I ζ = = L ) Ξ ζ ) μ ( 1 ( 1 I τ = = L ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
I = U = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 I ζ = = U ) Ξ ζ ) μ ( 1 ( 1 I τ = = U ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N R = L = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L Ξ ζ ) μ ( 1 N R τ = = L Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N R = U = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U Ξ ζ ) μ ( 1 N R τ = = U Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N I = L = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L Ξ ζ ) μ ( 1 N I τ = = L Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N I = U = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U Ξ ζ ) μ ( 1 N I τ = = U Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
R = = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = Ξ ζ ) μ ( 1 R τ = = Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
I = = 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = Ξ ζ ) μ ( 1 I τ = = Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N R = = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 N R ζ = = ) Ξ ζ ) μ ( 1 ( 1 N R τ = = ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
N I = = ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 ( 1 N I ζ = = ) Ξ ζ ) μ ( 1 ( 1 N I τ = = ) Ξ τ ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
Proof. 
Trivial. □

5. Applications

We know that the procedure of the MADM technique has several implementations in the field of fuzzy sets theory. However, one of the main and major troubles in the MADM technique is demonstrating evaluations that individuals will use but that does not submerge the essentialness of difficult compromise questions. There are massive various techniques aimed at solving the MADM tool. The major theme of this analysis is to develop a new tool, called the TOPSIS technique instead of the MADM technique. The TOPSIS tool is also very valuable for computing the beneficial option using various similarity measures or aggregation operators. Then, we investigate three different decision-making procedures such as MADM (multi-attribute decision-making) tool, TOPSIS method using similarity measures, and TOPSIS method using aggregation operators to enhance the quality of the decision-making process. Finally, we compute the comparative analysis of the diagnosticapproaches with various existing theories to demonstrate the feasibility and flexibility of the exposed work. We try to illustrate this with the help of geometrical expressions.

5.1. TOPSIS Method-1

The major theme of this method is to diagnose new techniques for finding the best optimal option from the group of options. The main stages of the TOPSIS technique are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 .
Stage 2: Using the available information, we compute the positive and native ideal solutions based on Equations (30) and (31), such that
= + = ( ( [ m a x R τ = = L , m a x R τ = = U ] e i 2 π ( [ m a x I τ = = L , m a x I τ = = U ] ) , [ m i Ω N R τ = = L , m i Ω N R τ = = U ] e i 2 π ( [ m i Ω N I τ = = L , m i Ω N I τ = = U ] ) ) , ( m a x R τ = = e i 2 π ( m a x I τ = = ) , m i Ω N R τ = = e i 2 π ( m i Ω N I τ = = ) ) )
And
= = ( ( [ m i Ω R τ = = L , m i Ω R τ = = U ] e i 2 π ( [ m i Ω I τ = = L , m i Ω I τ = = U ] ) , [ m a x N R τ = = L , m a x N R τ = = U ] e i 2 π ( [ m a x N I τ = = L , m a x N I τ = = U ] ) ) , ( m i Ω R τ = = e i 2 π ( m i Ω I τ = = ) , m a x N R τ = = e i 2 π ( m a x N I τ = = ) ) )
Stage 3: Further, using the positive and negative ideal solution, we determine the discrimination degree using Equations (32) and (33), such that
D ( ζ = , = + ) = 1 6 | Z 1 + Z 2 + Z 3 + Z 4 + Z 5 + Z 6 |
Z 1 = τ = 1 Ω Ξ τ ( R τ = = L ln ( 2 R τ = = L R τ = = L + R τ = = L + ) + N R τ = = L ln ( 2 N R τ = = L N R τ = = L + N R τ = = L + ) ) , Z 2 = τ = 1 Ω Ξ τ ( R τ = = U ln ( 2 R τ = = U R τ = = U + R τ = = U + ) + N R τ = = U ln ( 2 N R τ = = U N R τ = = U + N R τ = = U + ) ) , Z 3 = τ = 1 Ω Ξ τ ( I τ = = L ln ( 2 I τ = = L I τ = = L + I τ = = L + ) + N I τ = = L ln ( 2 N I τ = = L N I τ = = L + N I τ = = L + ) ) , Z 4 = τ = 1 Ω Ξ τ ( I τ = = U ln ( 2 I τ = = U I τ = = U + I τ = = U + ) + N I τ = = U ln ( 2 N I τ = = U N I τ = = U + N I τ = = U + ) ) , Z 5 = τ = 1 Ω Ξ τ ( R τ = = ln ( 2 R τ = = R τ = = + R τ = = + ) + N R τ = = ln ( 2 N R τ = = N R τ = = + N R τ = = + ) ) , Z 6 = τ = 1 Ω Ξ τ ( I τ = = ln ( 2 I τ = = I τ = = + I τ = = + ) + N I τ = = ln ( 2 N I τ = = N I τ = = + N I τ = = + ) )
D ( ζ = , = ) = 1 6 | y 1 + y 2 + y 3 + y 4 + y 5 + y 6 |    
y 1 = τ = 1 Ω Ξ τ ( R τ = = L ln ( 2 R τ = = L R τ = = L + R τ = = L ) + N R τ = = L ln ( 2 N R τ = = L N R τ = = L + N R τ = = L ) ) , y 2 = τ = 1 Ω Ξ τ ( R τ = = U ln ( 2 R τ = = U R τ = = U + R τ = = U ) + N R τ = = U ln ( 2 N R τ = = U N R τ = = U + N R τ = = U ) ) , y 3 = τ = 1 Ω Ξ τ ( I τ = = L ln ( 2 I τ = = L I τ = = L + I τ = = L ) + N I τ = = L ln ( 2 N I τ = = L N I τ = = L + N I τ = = L ) ) , y 4 = τ = 1 Ω Ξ τ ( I τ = = U ln ( 2 I τ = = U I τ = = U + I τ = = U ) + N I τ = = U ln ( 2 N I τ = = U N I τ = = U + N I τ = = U ) ) , y 5 = τ = 1 Ω Ξ τ ( R τ = = ln ( 2 R τ = = R τ = = + R τ = = ) + N R τ = = ln ( 2 N R τ = = N R τ = = + N R τ = = ) ) , y 6 = τ = 1 Ω Ξ τ ( I τ = = ln ( 2 I τ = = I τ = = + I τ = = ) + N I τ = = ln ( 2 N I τ = = N I τ = = + N I τ = = ) )
Stage 4: Finally, we determine the closeness coefficient of each alternative, using the values of discrimination, mentioned in Equations (32) and (33) with help of Equation (34), such that
ζ = D ( ζ = , = + ) D ( ζ = , = + ) + D ( ζ = , = )
Stage 5: Using the values of closeness coefficient, we determine the final ranking values to explore the beneficial option from the family of alternatives.

5.2. TOPSIS Method-2

The major theme of this method is to diagnose new techniques for finding the best optimal option from the group of options. The main stages of the TOPSIS technique based on the operator are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 .
Stage 2: Using the available information, we compute the positive and native ideal solutions based on Equations (35) and (36), such that
= + = ( ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) , ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) , , ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) )
And
= = ( ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) , ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) , , ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) )
Stage 3: Further, using the positive and negative ideal solution, we determine the discrimination degree using the Equations (37) and (38), such that
D ( ζ = , = + ) = 1 6 | Z 1 + Z 2 + Z 3 + Z 4 + Z 5 + Z 6 |
Z 1 = τ = 1 Ω Ξ τ ( R τ = = L ln ( 2 R τ = = L R τ = = L + R τ = = L + ) + N R τ = = L ln ( 2 N R τ = = L N R τ = = L + N R τ = = L + ) ) , Z 2 = τ = 1 Ω Ξ τ ( R τ = = U ln ( 2 R τ = = U R τ = = U + R τ = = U + ) + N R τ = = U ln ( 2 N R τ = = U N R τ = = U + N R τ = = U + ) ) , Z 3 = τ = 1 Ω Ξ τ ( I τ = = L ln ( 2 I τ = = L I τ = = L + I τ = = L + ) + N I τ = = L ln ( 2 N I τ = = L N I τ = = L + N I τ = = L + ) ) , Z 4 = τ = 1 Ω Ξ τ ( I τ = = U ln ( 2 I τ = = U I τ = = U + I τ = = U + ) + N I τ = = U ln ( 2 N I τ = = U N I τ = = U + N I τ = = U + ) ) , Z 5 = τ = 1 Ω Ξ τ ( R τ = = ln ( 2 R τ = = R τ = = + R τ = = + ) + N R τ = = ln ( 2 N R τ = = N R τ = = + N R τ = = + ) ) , Z 6 = τ = 1 Ω Ξ τ ( I τ = = ln ( 2 I τ = = I τ = = + I τ = = + ) + N I τ = = ln ( 2 N I τ = = N I τ = = + N I τ = = + ) )
D ( ζ = , = ) = 1 6 | y 1 + y 2 + y 3 + y 4 + y 5 + y 6 |
y 1 = τ = 1 Ω Ξ τ ( R τ = = L ln ( 2 R τ = = L R τ = = L + R τ = = L ) + N R τ = = L ln ( 2 N R τ = = L N R τ = = L + N R τ = = L ) ) , y 2 = τ = 1 Ω Ξ τ ( R τ = = U ln ( 2 R τ = = U R τ = = U + R τ = = U ) + N R τ = = U ln ( 2 N R τ = = U N R τ = = U + N R τ = = U ) ) , y 3 = τ = 1 Ω Ξ τ ( I τ = = L ln ( 2 I τ = = L I τ = = L + I τ = = L ) + N I τ = = L ln ( 2 N I τ = = L N I τ = = L + N I τ = = L ) ) , y 4 = τ = 1 Ω Ξ τ ( I τ = = U ln ( 2 I τ = = U I τ = = U + I τ = = U ) + N I τ = = U ln ( 2 N I τ = = U N I τ = = U + N I τ = = U ) ) , y 5 = τ = 1 Ω Ξ τ ( R τ = = ln ( 2 R τ = = R τ = = + R τ = = ) + N R τ = = ln ( 2 N R τ = = N R τ = = + N R τ = = ) ) , y 6 = τ = 1 Ω Ξ τ ( I τ = = ln ( 2 I τ = = I τ = = + I τ = = ) + N I τ = = ln ( 2 N I τ = = N I τ = = + N I τ = = ) )
Stage 4: Finally, we determine the closeness coefficient of each alternative, using the values of discrimination, mentioned in Equations (37) and (38) with help of Equation (39), such that
ζ = D ( ζ = , = + ) D ( ζ = , = + ) + D ( ζ = , = )
Stage 5: Using the values of closeness coefficient, we determine the final ranking values to explore the beneficial option from the family of alternatives.

5.3. MADM Techniques

MADM technique plays a very useful role in the circumstances of FS theory. The major theme of this method is to diagnose a new technique for finding the best optimal option from the group of options. The main stages of the MADM technique based on the operator are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 .
Stage 2: Using Equations (24) and (29), we aggregate the suggested information.
Stage 3: Using Equation (21), we find the SV of the accumulated values.
Stage 4: Using the demonstrated SVs, we described the ranking results to find the best option.

5.4. Illustrated Example

To describe the above-cited work, we demonstrate it with the below practical example: Suppose a tycoon agrees to buy a novel strategy for his enterprise from an expert maker X . The expert maker gives data on five models of strategy = 1 , = 2 , = 3 , = 4 and = 5 with distinct production dates for each model. The tycoon agrees to suggest four criteria namely G 1 Consistency, G 2 Comforts, G 3 Productivity of strategy, and G 4 Feasibility. Conferring to the variations on the fabrication date for a similar type of strategy, these changes also affect the model. The major analysis of this application is to find the best mechanism strategy in the availability of the different criteria. For this, experts give their opinion in the form of weight vector: 0.3, 0.3, 0.3, and 0.1 for four different criteria. Then, we compute the best option using the diagnostic approaches to demonstrate the feasibility and flexibility of the exposed work and to try to illustrate it with the help of geometrical expressions.

5.4.1. TOPSIS Method-1

The major theme of this method is to diagnose new techniques for finding the best optimal option from the group of options. The main stages of the TOPSIS technique are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 , described in Table 1.
Stage 2: Using the available information in Table 1, we compute the positive and native ideal solutions based on Equations (30) and (31), described in Table 2.
Stage 3: Further, using the positive and negative ideal solutions, we determine the discrimination degree using Equations (32) and (33), such that
D ( 1 = , = + ) = 0.04575 , D ( 2 = , = + ) = 0.01289 , D ( 3 = , = + ) = 0.01391 , D ( 4 = , = + ) = 0.03158 , D ( 5 = , = + ) = 0.01331
D ( 1 = , = ) = 0.0006 , D ( 2 = , = ) = 0.04086 , D ( 3 = , = ) = 0.07144 , D ( 4 = , = ) = 0.00335 , D ( 5 = , = + ) = 0.02939
Stage 4: Finally, we determine the closeness coefficient of each alternative, using the values of discrimination, mentioned in Equations (32) and (33) with help of Equation (34), such that
1 = 0.98705 , 2 = 0.23979 , 3 = 0.163 , 4 = 0.90399 , 5 = 0.31173
Stage 5: Using the values of closeness coefficient, we determine the final ranking values to explore the beneficial option from the family of alternatives, stated here,
1 4 5 2 3
Using the TOPSIS-Method-1, we get the best optimal option as a 1 . Further, we describe the TOPSIS-Method-2, which is explained below.

5.4.2. TOPSIS Method-2

The major theme of this method is to diagnose new techniques for finding the best optimal option from the group of options. The main stages of the TOPSIS technique based on the operator are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 , described in Table 1.
Stage 2: Using the available information, we compute the positive and native ideal solutions based on Equations (35) and (36), such that
= + = ( ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) , ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) , ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) , ( ( [ 1 , 1 ] e i 2 π ( [ 1 , 1 ] ) , [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) ) , ( 1 e i 2 π ( 1 ) , 0 e i 2 π ( 0 ) ) ) )
And
= = ( ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) , ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) , ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) , ( ( [ 0 , 0 ] e i 2 π ( [ 0 , 0 ] ) , [ 1 , 1 ]   e i 2 π [ 1 , 1 ] ) , ( 0 e i 2 π ( 0 ) , 1 e i 2 π ( 1 ) ) ) )
Stage 3: Further, using the positive and negative ideal solutions, we determine the discrimination degree using the Equations (37) and (38), such that
D ( 1 = , = + ) = 0.03665 , D ( 2 = , = + ) = 0.04466 , D ( 3 = , = + ) = 0.16631 , D ( 4 = , = + ) = 0.02383 , D ( 5 = , = + ) = 0.08986
D ( 1 = , = ) = 0.00127 , D ( 2 = , = ) = 0.01871 , D ( 3 = , = ) = 0.25431 , D ( 4 = , = ) = 0.05181 , D ( 5 = , = ) = 0.12749
Stage 4: Finally, we determine the closeness coefficient of each alternative, using the values of discrimination, mentioned in Equations (37) and (38) with help of Equation (39), such that
1 = 0.96644 , 2 = 0.70471 , 3 = 0.39539 , 4 = 0.31509 , 5 = 0.41344
Stage 5: Using the values of closeness coefficient, we determine the final ranking values to explore the beneficial option from the family of alternatives, stated here,
1 2 5 3 4
Using the TOPSIS-Method-2, we get the optimal option as a 1 . Further, we describe the procedure of the MADM tool, which is explained below.

5.4.3. MADM Techniques

MADM technique plays a very useful role in the circumstances of FS theory. The major theme of this method is to diagnose a new technique for finding the optimal option from the group of options. The main stages of the MADM technique based on the operator are diagnosed below.
Stage 1: In the consideration of CICF information, we develop a matrix that includes alternatives = 1 , = 2 , , = m and their attributes G 1 , G 2 , , G Ω with weight vector Ξ 1 , Ξ 2 , , Ξ ζ expressed the weight vector with ζ = 1 Ω Ξ ζ = 1 , described in Table 1.
Stage 2: Using Equations (24) and (29), we aggregate the suggested information, described in Table 3 for μ = ψ = 1 .
Stage 3: Using Equation (21), we find the SV of the accumulated values, stated in Table 4.
Stage 4: Using the demonstrated SVs, we described the ranking results to find the best option, described in Table 5.
It is clear from Table 5, we obtain the same ranking results under the consideration of two different concepts, the beneficial optimal option is 3 .

5.5. Influence of Parameters

The variation of the complete score values, with the help of parameters μ and ψ , is analyzed so that the diagnosed operators are massively powerful. Despite this, we will try to find the dominancy of the diagnosed operators. Using the information in Table 1, the influence of parameters μ and ψ , are illustrated in Table 6. We fixed the value of one parameter μ = 1 , and tried to change the value of ψ to check the variations of the parameters, described in Table 6.
Using the information in Table 1, the influence of parameters μ and ψ , is illustrated in Table 7. We fixed the value of one parameter ψ = 1 , and tried to change the value of μ to check the variations of the parameters, described in Table 7.
Table 6 and Table 7 contain almost the same results because both operators provided different ranking results. The beneficial optimal option is 3 , and for some values, we obtain the value of diagnosed operators in the shape: 5 . After checking the influence of parameters, we enhance the quality of the diagnosed operators with the help of comparative analysis, described below.

6. Comparative Analysis

We know that without comparing diagnosed work there is no worth in the environment of qualitative research work. The major theme of this analysis is to demonstrate the key factor of the proposed approaches with the help of comparative analysis. For this, we suggest some prevailing theories whose information is described here: aggregation operators for cubic IFS, diagnosed by Kaur and Garg [20]; generalized aggregation operators for cubic IFS, also diagnosed by Kaur and Garg [21]; and aggregation operators for complex interval-valued IFS, diagnosed by Garg and Rani [30] with proposed techniques. Using data in Table 1, the comparative analysis is described below.
  • We suggest that the aggregation operators based on cubic IFS, diagnosed by Kaur and Garg [20], have a lot of deficiencies due to its structure. This is because the mathematical form of cubic IFS manages only one-dimensional information which affected the result and was a major reason for losing information during the decision-making process. For this, we diagnosed the novel theory of CICF settings and their BM operators, which was more powerful and massively dominant as compared to the work of Kaur and Garg [20].
  • We suggest that the generalized aggregation operators based on cubic IFS, diagnosed by Kaur and Garg [21], have a lot of deficiencies due to its structure. This is because the mathematical form of cubic IFS manages only one-dimensional information which affected the result and was a major reason for losing information during the decision-making process. For this, we diagnosed the novel theory of CICF settings and their BM operators, which is more powerful and massively dominant as compared to the work of Kaur and Garg [21].
  • We suggest that the aggregation operators based on complex interval-valued IFS, diagnosed by Garg and Rani [30], have a lot of deficiencies due to its structure. This is because the mathematical form of complex interval-valued IFS has managed two-dimensional information, but the rule of complex interval-valued IFS is very weak. Similarly, the sum of the real part (imaginary part) of the duplet is limited to the unit interval, which has affected the result and was a major reason for losing information during the decision-making process. For this, we diagnosed the novel theory of CICF settings and their BM operators, which is more powerful and massively dominant as compared to the work of Garg and Rani [30].
Therefore, our diagnosed work has massive application in the region of computer science, engineering science, networking systems, and pattern recognition. In the future, we will employ it in the environment of the above-cited work.

7. Conclusions

In this analysis, we initiate the mathematical ideology of CICF information and their well-known properties like algebraic laws, score values, and accuracy values. We determined various inequalities for finding the order between any two CICFNs. Further, we know that the BM operator is more generalized than the simple averaging/geometric aggregation operators due to the parameters involved in the mathematical form of BM operators. Keeping the supremacy and consistency of BM operators, the idea of CICFBM and CICFWBM operators are diagnosed. We try to describe their well-known results and properties such as idempotency, monotonicity, commutativity, and boundedness with various specific cases. Similarly, the TOPSIS tool is also very valuable for computing the beneficial option using various similarity measures or aggregation operators. Then, we investigate three different sorts of decision-making procedures such as the MADM tool, the TOPSIS method using similarity measures, and the TOPSIS method using aggregation operators to enhance the quality of the decision-making process. Finally, we compute the comparative analysis of the diagnostic approaches with various existing theories to demonstrate the feasibility and flexibility of the exposed work. We try to illustrate this with the help of geometrical expressions.
In the future, we will revise various old theories and try to diagnose new theories such as cubic q-rung orthopair complex fuzzy sets and cubic T-spherical complex fuzzy sets, using the existing theories such as complex q-rung orthopair fuzzy sets [37], complex spherical fuzzy sets [38], T-spherical fuzzy sets [39], linear Diophantine fuzzy sets [40,41], and decision-making [42,43].

Author Contributions

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

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data used in this manuscript are hypothetical and anyone can use it without prior permission of the corresponding authors by just citing this article.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Proof of Theorem 1.
Suggested Definition 7, we have
ζ = μ = ( ( [ R ζ = = L μ , R ζ = = U μ ] e i 2 π ( [ I ζ = = L μ , I ζ = = U μ ] ) , [ 1 ( 1 N R ζ = = L ) μ , 1 ( 1 N R ζ = = U ) μ ] e i 2 π ( [ 1 ( 1 N I ζ = = L ) μ , 1 ( 1 N I ζ = = U ) μ ] ) ) , ( 1 ( 1 R ζ = = ) μ e i 2 π ( 1 ( 1 I ζ = = ) μ ) , N R ζ = = μ e i 2 π ( N I ζ = = μ ) ) )
τ = ψ = ( ( [ R τ = = L ψ , R τ = = U ψ ] e i 2 π ( [ I τ = = L ψ , I τ = = U ψ ] ) , [ 1 ( 1 N R ζ = = L ) ψ , 1 ( 1 N R ζ = = U ) ψ ] e i 2 π ( [ 1 ( 1 N I ζ = = L ) ψ , 1 ( 1 N I ζ = = U ) ψ ] ) ) , ( 1 ( 1 R ζ = = ) ψ e i 2 π ( 1 ( 1 I ζ = = ) ψ ) , N R ζ = = ψ e i 2 π ( N I ζ = = ψ ) ) )
Then,
ζ = μ τ = ψ = ( ( [ R ζ = = L μ R τ = = L ψ , R ζ = = U μ R τ = = U ψ ] e i 2 π ( [ I ζ = = L μ I τ = = L ψ , I ζ = = U μ I τ = = U ψ ] ) , [ ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) , ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) ] e i 2 π ( [ ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) , ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) ] ) ) , ( ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) e i 2 π ( ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) ) , N R ζ = = μ N R τ = = ψ e i 2 π ( N I ζ = = μ N I τ = = ψ ) ) )
Further,
ζ , τ = 1 ζ τ Ω ( ζ = μ τ = ψ ) = ( ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) ) ] e i 2 π ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) ) ] ) , [ ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) , ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) ] e i 2 π ( [ ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) , ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) ] ) ) , ( ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) e i 2 π ( ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) ) e i 2 π ( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) ) ) )
1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( ζ = μ τ = ψ ) = ( ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) 1 Ω ( Ω 1 ) ) ] e i 2 π ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) 1 Ω ( Ω 1 ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) 1 Ω ( Ω 1 ) ) ] ) , [ ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) , ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) 1 Ω ( Ω 1 ) ] e i 2 π ( [ ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) 1 Ω ( Ω 1 ) , ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) 1 Ω ( Ω 1 ) ] ) ) , ( ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) 1 Ω ( Ω 1 ) e i 2 π ( ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) 1 Ω ( Ω 1 ) ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) 1 Ω ( Ω 1 ) ) e i 2 π ( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) 1 Ω ( Ω 1 ) ) ) )
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( ζ = μ τ = ψ ) ) 1 μ + ψ = ( ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] e i 2 π ( [ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] ) , [ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] e i 2 π ( [ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ , 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ] ) ) , ( 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ e i 2 π ( 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ) , ( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ e i 2 π ( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ) )

Appendix B

Proof of Property 1.
We suggest that τ = = = , then using Equation (24), we interrogate
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( ζ = μ τ = ψ ) ) 1 μ + ψ = ( 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( = μ = ψ ) ) 1 μ + ψ = ( = μ = ψ ) 1 μ + ψ = ( = μ + ψ ) 1 μ + ψ = = .

Appendix C

Proof of Property 2.
By suggested information, if τ = τ = , that is R = τ = L R = τ = L , R = τ = U R = τ = U , I = τ = L I = τ = L , I = τ = U I = τ = U , N R τ = = L N R τ = = L , N R τ = = U N R τ = = U and N I τ = = L N I τ = = L , N I τ = = U N I τ = = U then
R ζ = = L μ R τ = = L ψ R ζ = = L μ R τ = = L ψ 1 R ζ = = L μ R τ = = L ψ 1 R ζ = = L μ R τ = = L ψ
( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 )
ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 )
1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 )
( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = L μ R τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
Similarly, we get
( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 R ζ = = U μ R τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = L μ I τ = = L ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 I ζ = = U μ I τ = = U ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
And also, for simply FG, we have
( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 N R ζ = = μ N R τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
And
( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 N I ζ = = μ N I τ = = ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
Further,
( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ
( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ )
ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 )
1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 )
( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = L ) μ ( 1 N R τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
Similarly, we get
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N R ζ = = U ) μ ( 1 N R τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = L ) μ ( 1 N I τ = = L ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 N I ζ = = U ) μ ( 1 N I τ = = U ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
and
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 R ζ = = ) μ ( 1 R τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ 1 ( 1 ζ , τ = 1 ζ τ Ω ( 1 ( 1 I ζ = = ) μ ( 1 I τ = = ) ψ ) 1 Ω ( Ω 1 ) ) 1 μ + ψ
Then, by using the information given in Equations (21) and (22), we get
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) I F B M μ , ψ ( 1 = , 2 = , , Ω = ) .

Appendix D

Proof of Property 3.
Using Property 1 and Property 2, we know that
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) I F B M μ , ψ ( 1 = , 2 = , , Ω = ) = τ =
I F B M μ , ψ ( 1 = , 2 = , , Ω = ) I F B M μ , ψ ( 1 = + , 2 = + , , Ω = + ) = τ = +
Then, we get
τ = I F B M μ , ψ ( 1 = , 2 = , , Ω = ) τ = + .

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Maji, P.K.; Roy, A.R.; Biswas, R. An application of soft sets in a decision-making problem. Comput. Math. Appl. 2002, 44, 1077–1083. [Google Scholar] [CrossRef] [Green Version]
  3. Fatimah, F.; Rosadi, D.; Hakim, R.B.; Alcantud, J.C.R. N-soft sets and their decision making algorithms. Soft Comput. 2018, 22, 3829–3842. [Google Scholar] [CrossRef]
  4. Ali, M.I. A note on soft sets, rough soft sets and fuzzy soft sets. Appl. Soft Comput. 2011, 11, 3329–3332. [Google Scholar]
  5. Akram, M.; Adeel, A.; Alcantud, J.C.R. Fuzzy N-soft sets: A novel model with applications. J. Intell. Fuzzy Syst. 2018, 35, 4757–4771. [Google Scholar] [CrossRef]
  6. Mahmood, T. A novel approach towards bipolar soft sets and their applications. J. Math. 2020, 2020, 4690808. [Google Scholar] [CrossRef]
  7. Ibrahim, H.Z.; Al-Shami, T.M.; Elbarbary, O.G. (3, 2)-Fuzzy Sets and Their Applications to Topology and Optimal Choices. Comput. Intell. Neurosci. 2021, 2021, 1272266. [Google Scholar] [CrossRef]
  8. Al-Shami, T.M. Bipolar soft sets: Relations between them and ordinary points and their applications. Complexity 2021, 2021, 6621854. [Google Scholar] [CrossRef]
  9. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  10. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  11. Zhao, H.; Xu, Z.; Ni, M.; Liu, S. Generalized aggregation operators for intuitionistic fuzzy sets. Int. J. Intell. Syst. 2010, 25, 1–30. [Google Scholar] [CrossRef]
  12. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  13. Dengfeng, L.; Chuntian, C. New similarity measures of intuitionistic fuzzy sets and application to pattern recognitions. Pattern Recognit. Lett. 2002, 23, 221–225. [Google Scholar] [CrossRef]
  14. Hung, W.L.; Yang, M.S. Similarity measures of intuitionistic fuzzy sets based on Hausdorff distance. Pattern Recognit. Lett. 2004, 25, 1603–1611. [Google Scholar] [CrossRef]
  15. Liang, Z.; Shi, P. Similarity measures on intuitionistic fuzzy sets. Pattern Recognit. Lett. 2003, 24, 2687–2693. [Google Scholar] [CrossRef]
  16. Xu, Z.; Yager, R.R. Intuitionistic fuzzy Bonferroni means. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 2010, 41, 568–578. [Google Scholar]
  17. Yu, D. Intuitionistic fuzzy geometric Heronian mean aggregation operators. Appl. Soft Comput 2013, 13, 1235–1246. [Google Scholar] [CrossRef]
  18. Liu, P.; Chen, S.M. Group decision making based on Heronian aggregation operators of intuitionistic fuzzy numbers. IEEE Trans. Cybern. 2016, 47, 2514–2530. [Google Scholar] [CrossRef]
  19. Atanassov, K.T. Interval valued intuitionistic fuzzy sets. Intuit. Fuzzy Sets Phys. Heidelb. 1999, 2, 139–177. [Google Scholar]
  20. Kaur, G.; Garg, H. Cubic intuitionistic fuzzy aggregation operators. Int. J. Uncertain. Quantif. 2018, 8, 405–427. [Google Scholar] [CrossRef]
  21. Kaur, G.; Garg, H. Generalized cubic intuitionistic fuzzy aggregation operators using t-norm operations and their applications to group decision-making process. Arab. J. Sci. Eng. 2019, 44, 2775–2794. [Google Scholar] [CrossRef]
  22. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  23. Bi, L.; Dai, S.; Hu, B.; Li, S. Complex fuzzy arithmetic aggregation operators. J. Intell. Fuzzy Syst. 2019, 36, 2765–2771. [Google Scholar] [CrossRef]
  24. Liu, P.; Ali, Z.; Mahmood, T. The distance measures and cross-entropy based on complex fuzzy sets and their application in decision making. J. Intell. Fuzzy Syst. 2020, 39, 3351–3374. [Google Scholar] [CrossRef]
  25. Karakose, M.; Yaman, O. Complex fuzzy system based predictive maintenance approach in railways. IEEE Trans. Ind. Inform. 2020, 16, 6023–6032. [Google Scholar] [CrossRef]
  26. Mahmood, T.; Ali, Z. A novel complex fuzzy N-soft sets and their decision-making algorithm. Complex. Intell. Syst. 2021, 7, 2255–2280. [Google Scholar] [CrossRef]
  27. Alkouri, A.M.D.J.S.; Salleh, A.R. Complex intuitionistic fuzzy sets. AIP Conf. Proc. Am. Inst. Phys. 2012, 1482, 464–470. [Google Scholar]
  28. Ali, Z.; Mahmood, T.; Aslam, M.; Chinram, R. Another view of complex intuitionistic fuzzy soft sets based on prioritized aggregation operators and their applications to multiattribute decision making. Mathematics 2021, 9, 1922. [Google Scholar] [CrossRef]
  29. Jan, N.; Nasir, A.; Alhilal, M.S.; Khan, S.U.; Pamucar, D.; Alothaim, A. Investigation of Cyber-Security and Cyber-Crimes in Oil and Gas Sectors Using the Innovative Structures of Complex Intuitionistic Fuzzy Relations. Entropy 2021, 23, 1112. [Google Scholar] [CrossRef]
  30. Garg, H.; Rani, D. Complex interval-valued intuitionistic fuzzy sets and their aggregation operators. Fundam. Inform. 2019, 164, 61–101. [Google Scholar] [CrossRef]
  31. Chen, C.T. Extensions of the TOPSIS for group decision-making under fuzzy environment. Fuzzy Sets Syst. 2000, 114, 1–9. [Google Scholar] [CrossRef]
  32. Junior, F.R.L.; Osiro, L.; Carpinetti, L.C.R. A comparison between Fuzzy AHP and Fuzzy TOPSIS methods to supplier selection. Appl. Soft Comput. 2014, 21, 194–209. [Google Scholar] [CrossRef]
  33. Shen, F.; Ma, X.; Li, Z.; Xu, Z.; Cai, D. An extended intuitionistic fuzzy TOPSIS method based on a new distance measure with an application to credit risk evaluation. Inform. Sci. 2018, 428, 105–119. [Google Scholar] [CrossRef]
  34. Li, D.F. TOPSIS-based nonlinear-programming methodology for multiattribute decision making with interval-valued intuitionistic fuzzy sets. IEEE Trans. Fuzzy Syst. 2010, 18, 299–311. [Google Scholar] [CrossRef]
  35. Garg, H.; Kaur, G. Extended TOPSIS method for multi-criteria group decision-making problems under cubic intuitionistic fuzzy environment. Sci. Iran. 2020, 27, 396–410. [Google Scholar] [CrossRef] [Green Version]
  36. Bonferroni, C. Sulle medie multiple di potenze. Boll. Dell’unione Mat. Ital. 1950, 5, 267–270. [Google Scholar]
  37. Ali, Z.; Mahmood, T. Maclaurin symmetric mean operators and their applications in the environment of complex q-rung orthopair fuzzy sets. Computat. Appl. Math. 2020, 39, 1–27. [Google Scholar] [CrossRef]
  38. Ali, Z.; Mahmood, T.; Yang, M.S. TOPSIS method based on complex spherical fuzzy sets with Bonferroni mean operators. Mathematics 2020, 8, 1739. [Google Scholar] [CrossRef]
  39. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  40. 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]
  41. Riaz, M.; Hashmi, M.R.; Pamucar, D.; Chu, Y.M. Spherical linear Diophantine fuzzy sets with modeling uncertainties in MCDM. Comput. Modeling Eng. Sci. 2021, 126, 1125–1164. [Google Scholar] [CrossRef]
  42. Pamucar, D. Normalized weighted geometric Dombi Bonferroni mean operator with interval grey numbers: Application in multicriteria decision making. Rep. Mech. Eng. 2020, 1, 44–52. [Google Scholar] [CrossRef]
  43. Vesković, S.; Stević, Ž.; Nunić, Z.; Milinković, S.; Mladenović, D. A novel integrated large-scale group MCDM model under fuzzy environment for selection of reach stacker in a container terminal. Appl. Intell. 2022, 1–25. [Google Scholar] [CrossRef]
Table 1. The decision matrix includes the CICF information.
Table 1. The decision matrix includes the CICF information.
G 1 G 2
C = 1 ( ( [ 0.2 , 0.3 ] e i 2 π ( [ 0.1 , 0.2 ] ) , [ 0.4 , 0.5 ] e i 2 π ( [ 0.3 , 0.4 ] ) ) ,   ( 0.4 e i 2 π ( 0.3 ) , 0.2 e i 2 π ( 0.3 ) ) ) ( ( [ 0.21 , 0.31 ] e i 2 π ( [ 0.11 , 0.21 ] ) , [ 0.41 , 0.51 ] e i 2 π ( [ 0.31 , 0.41 ] ) ) ,   ( 0.41 e i 2 π ( 0.31 ) , 0.21 e i 2 π ( 0.31 ) ) )
C = 2 ( ( [ 0.4 , 0.5 ] e i 2 π ( [ 0.2 , 0.3 ] ) , [ 0.2 , 0.3 ] e i 2 π ( [ 0.3 , 0.4 ] ) ) ,   ( 0.5 e i 2 π ( 0.3 ) , 0.3 e i 2 π ( 0.4 ) ) ) ( ( [ 0.41 , 0.51 ] e i 2 π ( [ 0.21 , 0.31 ] ) , [ 0.21 , 0.31 ] e i 2 π ( [ 0.31 , 0.41 ] ) ) ,   ( 0.51 e i 2 π ( 0.31 ) , 0.31 e i 2 π ( 0.41 ) ) )
C = 3 ( ( [ 0.5 , 0.7 ] e i 2 π ( [ 0.4 , 0.5 ] ) , [ 0.1 , 0.2 ] e i 2 π ( [ 0.2 , 0.3 ] ) ) ,   ( 0.7 e i 2 π ( 0.1 ) , 0.1 e i 2 π ( 0.4 ) ) ) ( ( [ 0.51 , 0.71 ] e i 2 π ( [ 0.41 , 0.51 ] ) , [ 0.11 , 0.21 ] e i 2 π ( [ 0.21 , 0.31 ] ) ) ,   ( 0.71 e i 2 π ( 0.11 ) , 0.11 e i 2 π ( 0.41 ) ) )
C = 4 ( ( [ 0.1 , 0.3 ] e i 2 π ( [ 0.2 , 0.5 ] ) , [ 0.2 , 0.3 ] e i 2 π ( [ 0.2 , 0.3 ] ) ) ,   ( 0.6 e i 2 π ( 0.2 ) , 0.2 e i 2 π ( 0.5 ) ) ) ( ( [ 0.11 , 0.31 ] e i 2 π ( [ 0.21 , 0.51 ] ) , [ 0.21 , 0.31 ] e i 2 π ( [ 0.21 , 0.31 ] ) ) ,   ( 0.61 e i 2 π ( 0.21 ) , 0.21 e i 2 π ( 0.51 ) ) )
C = 5 ( ( [ 0.4 , 0.6 ] e i 2 π ( [ 0.2 , 0.3 ] ) , [ 0.1 , 0.2 ] e i 2 π ( [ 0.3 , 0.4 ] ) ) ,   ( 0.5 e i 2 π ( 0.5 ) , 0.3 e i 2 π ( 0.2 ) ) ) ( ( [ 0.41 , 0.61 ] e i 2 π ( [ 0.21 , 0.31 ] ) , [ 0.11 , 0.21 ] e i 2 π ( [ 0.31 , 0.41 ] ) ) ,   ( 0.51 e i 2 π ( 0.51 ) , 0.31 e i 2 π ( 0.21 ) ) )
G 3 G 4
C = 1 ( ( [ 0.22 , 0.32 ] e i 2 π ( [ 0.12 , 0.22 ] ) , [ 0.42 , 0.52 ] e i 2 π ( [ 0.32 , 0.42 ] ) ) ,   ( 0.42 e i 2 π ( 0.32 ) , 0.22 e i 2 π ( 0.32 ) ) ) ( ( [ 0.23 , 0.33 ] e i 2 π ( [ 0.13 , 0.23 ] ) , [ 0.43 , 0.53 ] e i 2 π ( [ 0.33 , 0.43 ] ) ) ,   ( 0.43 e i 2 π ( 0.33 ) , 0.23 e i 2 π ( 0.33 ) ) )
C = 2 ( ( [ 0.42 , 0.52 ] e i 2 π ( [ 0.22 , 0.32 ] ) , [ 0.22 , 0.32 ] e i 2 π ( [ 0.32 , 0.42 ] ) ) ,   ( 0.52 e i 2 π ( 0.32 ) , 0.32 e i 2 π ( 0.42 ) ) ) ( ( [ 0.43 , 0.53 ] e i 2 π ( [ 0.23 , 0.33 ] ) , [ 0.23 , 0.33 ] e i 2 π ( [ 0.33 , 0.43 ] ) ) ,   ( 0.53 e i 2 π ( 0.33 ) , 0.33 e i 2 π ( 0.43 ) ) )
C = 3 ( ( [ 0.52 , 0.72 ] e i 2 π ( [ 0.42 , 0.52 ] ) , [ 0.12 , 0.22 ] e i 2 π ( [ 0.22 , 0.32 ] ) ) ,   ( 0.72 e i 2 π ( 0.12 ) , 0.12 e i 2 π ( 0.42 ) ) ) ( ( [ 0.53 , 0.73 ] e i 2 π ( [ 0.43 , 0.53 ] ) , [ 0.13 , 0.23 ] e i 2 π ( [ 0.23 , 0.33 ] ) ) ,   ( 0.73 e i 2 π ( 0.13 ) , 0.13 e i 2 π ( 0.43 ) ) )
C = 4 ( ( [ 0.12 , 0.32 ] e i 2 π ( [ 0.22 , 0.52 ] ) , [ 0.22 , 0.32 ] e i 2 π ( [ 0.22 , 0.32 ] ) ) ,   ( 0.62 e i 2 π ( 0.22 ) , 0.22 e i 2 π ( 0.52 ) ) ) ( ( [ 0.13 , 0.33 ] e i 2 π ( [ 0.23 , 0.53 ] ) , [ 0.23 , 0.33 ] e i 2 π ( [ 0.23 , 0.33 ] ) ) ,   ( 0.63 e i 2 π ( 0.23 ) , 0.23 e i 2 π ( 0.53 ) ) )
C = 5 ( ( [ 0.42 , 0.62 ] e i 2 π ( [ 0.22 , 0.32 ] ) , [ 0.12 , 0.22 ] e i 2 π ( [ 0.32 , 0.42 ] ) ) ,   ( 0.52 e i 2 π ( 0.52 ) , 0.32 e i 2 π ( 0.22 ) ) ) ( ( [ 0.43 , 0.63 ] e i 2 π ( [ 0.23 , 0.33 ] ) , [ 0.13 , 0.23 ] e i 2 π ( [ 0.33 , 0.43 ] ) ) ,   ( 0.53 e i 2 π ( 0.53 ) , 0.33 e i 2 π ( 0.23 ) ) )
Table 2. Includes positive and negative ideal solutions.
Table 2. Includes positive and negative ideal solutions.
Positive Ideal SolutionNegative Ideal Solution
G 1 ( ( [ 0.5 , 0.7 ] e i 2 π ( [ 0.4 , 0.5 ] ) , [ 0.1 , 0.2 ] e i 2 π ( [ 0.2 , 0.3 ] ) ) ,   ( 0.7 e i 2 π ( 0.5 ) , 0.1 e i 2 π ( 0.2 ) ) ) ( ( [ 0.1 , 0.3 ] e i 2 π ( [ 0.1 , 0.2 ] ) , [ 0.4 , 0.5 ] e i 2 π ( [ 0.3 , 0.4 ] ) ) ,   ( 0.4 e i 2 π ( 0.1 ) , 0.3 e i 2 π ( 0.5 ) ) )
G 2 ( ( [ 0.51 , 0.71 ] e i 2 π ( [ 0.41 , 0.51 ] ) , [ 0.11 , 0.21 ] e i 2 π ( [ 0.21 , 0.31 ] ) ) ,   ( 0.71 e i 2 π ( 0.51 ) , 0.11 e i 2 π ( 0.21 ) ) ) ( ( [ 0.11 , 0.31 ] e i 2 π ( [ 0.11 , 0.21 ] ) , [ 0.41 , 0.51 ] e i 2 π ( [ 0.31 , 0.41 ] ) ) ,   ( 0.41 e i 2 π ( 0.11 ) , 0.31 e i 2 π ( 0.51 ) ) )
G 3 ( ( [ 0.52 , 0.72 ] e i 2 π ( [ 0.42 , 0.52 ] ) , [ 0.12 , 0.22 ] e i 2 π ( [ 0.22 , 0.32 ] ) ) ,   ( 0.72 e i 2 π ( 0.52 ) , 0.12 e i 2 π ( 0.22 ) ) ) ( ( [ 0.12 , 0.32 ] e i 2 π ( [ 0.12 , 0.22 ] ) , [ 0.42 , 0.52 ] e i 2 π ( [ 0.32 , 0.42 ] ) ) ,   ( 0.42 e i 2 π ( 0.12 ) , 0.32 e i 2 π ( 0.52 ) ) )
G 4 ( ( [ 0.53 , 0.73 ] e i 2 π ( [ 0.43 , 0.53 ] ) , [ 0.13 , 0.23 ] e i 2 π ( [ 0.23 , 0.33 ] ) ) ,   ( 0.73 e i 2 π ( 0.53 ) , 0.13 e i 2 π ( 0.23 ) ) ) ( ( [ 0.13 , 0.33 ] e i 2 π ( [ 0.13 , 0.23 ] ) , [ 0.43 , 0.53 ] e i 2 π ( [ 0.33 , 0.43 ] ) ) ,   ( 0.43 e i 2 π ( 0.13 ) , 0.33 e i 2 π ( 0.53 ) ) )
Table 3. Aggregated values are expressed in this matrix.
Table 3. Aggregated values are expressed in this matrix.
CICFBM   Operator CICFWBM   Operator
C = 1 ( ( [ 0.1528 , 0.2255 ] e i 2 π ( [ 0.0813 , 0.1528 ] ) , [ 0.5653 , 0.6457 ] e i 2 π ( [ 0.4789 , 0.5653 ] ) ) ,   ( 0.5653 e i 2 π ( 0.4789 ) , 0.1528 e i 2 π ( 0.2255 ) ) ) ( ( [ 0.04009 , 0.06179 ] e i 2 π ( [ 0.02033 , 0.04009 ] ) , [ 0.8629 , 0.8938 ] e i 2 π ( [ 0.8256 , 0.8629 ] ) ) ,   ( 0.8629 e i 2 π ( 0.8256 ) , 0.04009 e i 2 π ( 0.06179 ) ) )
C = 2 ( ( [ 0.30028 , 0.3778 ] e i 2 π ( [ 0.1528 , 0.2255 ] ) , [ 0.3831 , 0.4789 ] e i 2 π ( [ 0.4789 , 0.5653 ] ) ) ,   ( 0.6457 e i 2 π ( 0.4789 ) , 0.06179 e i 2 π ( 0.08601 ) ) ) ( ( [ 0.08601 , 0.11358 ] e i 2 π ( [ 0.04009 , 0.06179 ] ) , [ 0.7775 , 0.8256 ] e i 2 π ( [ 0.8256 , 0.8629 ] ) ) ,   ( 0.8938 e i 2 π ( 0.8256 ) , 0.06179 e i 2 π ( 0.08601 ) ) )
C = 3 ( ( [ 0.3778 , 0.5485 ] e i 2 π ( [ 0.30028 , 0.3778 ] ) , [ 0.2687 , 0.3830 ] e i 2 π ( [ 0.3830 , 0.4789 ] ) ) ,   ( 0.7964 e i 2 π ( 0.2687 ) , 0.08133 e i 2 π ( 0.30028 ) ) ) ( ( [ 0.1135 , 0.1854 ] e i 2 π ( [ 0.0860 , 0.1135 ] ) , [ 0.7061 , 0.7775 ] e i 2 π ( [ 0.7775 , 0.9256 ] ) ) ,   ( 0.9439 e i 2 π ( 0.7061 ) , 0.02033 e i 2 π ( 0.08601 ) ) )
C = 4 ( ( [ 0.08133 , 0.2255 ] e i 2 π ( [ 0.1528 , 0.3778 ] ) , [ 0.3830 , 0.4789 ] e i 2 π ( [ 0.3830 , 0.4789 ] ) ) ,   ( 0.7223 e i 2 π ( 0.3830 ) , 0.1528 e i 2 π ( 0.3778 ) ) ) ( ( [ 0.02033 , 0.06179 ] e i 2 π ( [ 0.04009 , 0.1135 ] ) , [ 0.7775 , 0.8256 ] e i 2 π ( [ 0.7775 , 0.8256 ] ) ) ,   ( 0.9204 e i 2 π ( 0.7775 ) , 0.04009 e i 2 π ( 0.1135 ) ) )
C = 5 ( ( [ 0.30028 , 0.4598 ] e i 2 π ( [ 0.1528 , 0.2255 ] ) , [ 0.2687 , 0.3830 ] e i 2 π ( [ 0.4789 , 0.5653 ] ) ) ,   ( 0.6457 e i 2 π ( 0.6457 ) , 0.2255 e i 2 π ( 0.1528 ) ) ) ( ( [ 0.0860 , 0.1458 ] e i 2 π ( [ 0.0400 , 0.06179 ] ) , [ 0.7061 , 0.7775 ] e i 2 π ( [ 0.8256 , 0.8629 ] ) ) ,   ( 0.8938 e i 2 π ( 0.8938 ) , 0.06179 e i 2 π ( 0.04009 ) ) )
Table 4. SVs included in this matrix.
Table 4. SVs included in this matrix.
Score Values CICFBM   Operator CICFWBM   Operator
C = 1 0.038880.01371
C = 2 0.043510.01913
C = 3 0.182230.06241
C = 4 0.032880.01475
C = 5 0.158580.06664
Table 5. Ranking values are shown in this matrix.
Table 5. Ranking values are shown in this matrix.
MethodsRanking Values
CICFBM operator 3 5 2 1 4
CICFWBM operator 3 5 2 4 1
Table 6. Includes influence of parameter for μ = 1 .
Table 6. Includes influence of parameter for μ = 1 .
MethodsScore ValuesRanking Values
ψ = 1 0.03888 ,   0.04351 ,   0.18223 ,   0.03288 ,   0.15858 3 5 2 1 4
0.01371 ,   0.01913 ,   0.06241 ,   0.01475 ,   0.06664 3 5 2 4 1
ψ = 3 0.04295 ,   0.04463 ,   0.2022 ,   0.03336 ,   0.16646 3 5 2 1 4
0.01691 ,   0.02316 ,   0.0775 ,   0.0179 ,   0.07069 3 5 2 4 1
ψ = 5 0.04479 ,   0.04556 ,   0.2116 ,   0.0340 ,   0.1708 3 5 2 1 4
0.01864 ,   0.02546 ,   0.08559 ,   0.01969 ,   0.08863 5 3 2 4 1
ψ = 7 0.04584 ,   0.0463 ,   0.2171 ,   0.03468 ,   0.1738 3 5 2 1 4
0.01963 ,   0.0268 ,   0.09019 ,   0.02073 ,   0.09328 5 3 2 4 1
ψ = 10 0.04677 ,   0.0471 ,   0.22207 ,   0.03536 ,   0.1766 3 5 2 1 4
0.02443 ,   0.02797 ,   0.10204 ,   0.0177 ,   0.09735 3 5 2 4 1
Table 7. Includes the influence of parameter for ψ = 1 .
Table 7. Includes the influence of parameter for ψ = 1 .
MethodsScore ValuesRanking Values
μ = 1 0.03888 ,   0.04351 ,   0.18223 ,   0.03288 ,   0.15858 3 5 2 1 4
0.01371 ,   0.01913 ,   0.06241 ,   0.01475 ,   0.06664 3 5 2 4 1
μ = 3 0.04294 ,   0.0447 ,   0.20209 ,   0.03345 ,   0.16665 3 5 2 1 4
0.01731 ,   0.02382 ,   0.07913 ,   0.01849 ,   0.08292 5 3 2 4 1
μ = 5 0.04472 ,   0.04561 ,   0.21139 ,   0.03414 ,   0.17099 3 5 2 1 4
0.01899 ,   0.02612 ,   0.08689 ,   0.02032 ,   0.09082 5 3 2 4 1
μ = 7 0.04573 ,   0.04633 ,   0.2167 ,   0.0347 ,   0.1738 3 5 2 1 4
0.01992 ,   0.02741 ,   0.0911 ,   0.0213 ,   0.0953 5 3 2 4 1
μ = 10 0.04661 ,   0.04711 ,   0.2214 ,   0.0354 ,   0.1765 3 5 2 1 4
0.0246 ,   0.02854 ,   0.1026 ,   0.01834 ,   0.0992 3 5 2 4 1
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Mahmood, T.; Ali, Z.; Baupradist, S.; Chinram, R. Analysis and Applications of Bonferroni Mean Operators and TOPSIS Method in Complete Cubic Intuitionistic Complex Fuzzy Information Systems. Symmetry 2022, 14, 533. https://doi.org/10.3390/sym14030533

AMA Style

Mahmood T, Ali Z, Baupradist S, Chinram R. Analysis and Applications of Bonferroni Mean Operators and TOPSIS Method in Complete Cubic Intuitionistic Complex Fuzzy Information Systems. Symmetry. 2022; 14(3):533. https://doi.org/10.3390/sym14030533

Chicago/Turabian Style

Mahmood, Tahir, Zeeshan Ali, Samruam Baupradist, and Ronnason Chinram. 2022. "Analysis and Applications of Bonferroni Mean Operators and TOPSIS Method in Complete Cubic Intuitionistic Complex Fuzzy Information Systems" Symmetry 14, no. 3: 533. https://doi.org/10.3390/sym14030533

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