Next Article in Journal
Temperature Time Series Prediction Model Based on Time Series Decomposition and Bi-LSTM Network
Next Article in Special Issue
Industrial and Management Applications of Type-2 Multi-Attribute Decision-Making Techniques Extended with Type-2 Fuzzy Sets from 2013 to 2022
Previous Article in Journal
Review of Quaternion-Based Color Image Processing Methods
Previous Article in Special Issue
Sustainable Supplier Selection and Order Allocation Using an Integrated ROG-Based Type-2 Fuzzy Decision-Making Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Frank Prioritized Aggregation Operators and WASPAS Method Based on Complex Intuitionistic Fuzzy Sets and Their Application in Multi-Attribute Decision-Making

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

Abstract

:
Complex intuitionistic fuzzy (CIF) information covers the degree of membership and the degree of non-membership in the form of polar coordinates with a valuable and dominant characteristic where the sum of the real parts (the same rule for the imaginary parts) of the pair must be contained in the unit interval. In this paper, we first derive the Frank operational laws for CIF information and then examine the prioritized aggregation operators based on Frank operational laws for managing the theory of CIF information. These are the CIF Frank prioritized averaging (CIFFPA) operator, the CIF Frank prioritized ordered averaging (CIFFPOA) operator, the CIF Frank prioritized geometric (CIFFPG) operator, and the CIF Frank prioritized ordered geometric (CIFFPOG) operator with properties of idempotency, monotonicity, and boundedness. Furthermore, we derive the WASPAS (weighted aggregates sum product assessment) under the consideration or presence of the CIF information and try to justify it with the help of a suitable example. Additionally, we illustrate some numerical examples in the presence of the MADM (multi-attribute decision-making) procedures for evaluating the comparison between the proposed operators with some well-known existing operators to show the validity and worth of the proposed approaches.

1. Introduction

Multi-attribute decision-making (MADM) procedures are some of the finest or best techniques for evaluating the valuable and dominant preference from the set of feasible ones under the consideration of the available data. Traditionally, the MADM problem is a part of the decision-making procedure which often needs experts to provide evaluation data about the attributes and the alternatives with fuzzy sets (FSs) [1] in which FSs have been applied in different fields [2,3,4]. Various attempts have been derived by the distinct individuals in proceeding the data values using different extensions such as hesitant soft fuzzy rough sets [5], and fuzzy Mandelbrot sets [6]. Furthermore, intuitionistic FSs (IFSs) are also one of the most valuable and dominant extensions of FSs which was performed by Atanassov [7]. IFSs cover the degree of membership and the degree of non-membership of a given element to the set of discourse with the characteristic in which the sum of the pair must be contained in the unit interval. FSs are the particular cases of IFSs if we remove the degree of non-membership with its applications [8,9,10]. Furthermore, the utilization of the second term in the grade of truth is very awkward, and so, in many situations, we may face a problem with two-dimensional information, where FSs and IFSs deal only with one-dimensional information. Therefore, Ramot, et al. [11] successfully utilized the second term in the grade of truth and gave their name in the form of complex FS (CFS), where the truth grade in CFS is computed in the form of complex numbers whose real and unreal (imaginary) parts are covered in the unit interval. Various attempts have been performed by various individuals using systems such as the Mamdani complex fuzzy inference system [12]. Additionally, Alkouri and Salleh [13] exposed the new theory of complex IFS (CIFS) with its applications [14], which is the modified version of the three different types of ideas such as FSs, IFSs, and CFSs.
Frank t-norm and t-conorm are used for computing any type of aggregation operators (AOs) which was derived by Frank [15] in 1979. Frank norms have a lot of benefits because the simple algebraic and Lukasiewicz’s t-norm and t-conorm [16] are the special cases of Frank t-norm and t-conorm. Furthermore, the idea of prioritizing AOs for the first time was given by Yager [17], and then Yu and Xu [18] who considered prioritized intuitionistic fuzzy AOs. These AOs were computed based on algebraic operational laws. Moreover, the main idea of the weighted aggregated sum product assessment (WASPAS) technique was given by Zavadskas, et al. [19,20] with its applications [21,22], which is the generalization of two different techniques such as weighted sum assessment (WSA) and weighted product assessment (WPS). The WASPAS technique is very strong and valuable because this is the modified version of many techniques and many individuals have utilized it in numerous fields such as the computer sciences, pure mathematics, engineering sciences, artificial intelligence, and decision-making.
The theory of FSs, IFSs, CFSs, and CIFSs has gained a lot of attention from different fuzzy researchers because these structures are very beneficial and valuable for depicting awkward and unreliable information very easily. Various attempts have been derived by distinct individuals in proceeding with the data values using different extensions such as AOs for IFSs [23] and geometric AOs for IFSs [24]. Furthermore, the Frank power AOs based on IFSs [25] are also a combination of the Frank and power AOs which is a very awkward and complicated task. The complex fuzzy credibility of Frank AOs was derived by Yahya, et al. [26]. Under the consideration of hesitant fuzzy information, the theory of Frank AOs was invented by Qin, et al. [27]. In the presence of the dual hesitant set theory, the major theory of Frank AOs was evaluated by Tang, et al. [28]. The prioritized AOs for trapezoidal IFS were derived by Ye [29], and the simple prioritized AOs for IFS were evaluated by Yu and Xu [18]. Ali, et al. [30] derived the idea of prioritized AOs for CIF soft information with their application in decision-making procedures. Yu [31] examined the theory of generalized prioritized AOs for intuitionistic fuzzy environments, and Lin, et al. [32] derived the fuzzy number intuitionistic fuzzy prioritized AOs and their application in decision-making procedures. Furthermore, Garg and Rani [33] exposed the averaging operators for CIFSs. Garg and Rani [34] evaluated the geometric operators for CIFSs, and Mahmood, et al. [35] examined the Aczel–Alsina AOs for CIFSs. Sarfraz, et al. [36] examined the prioritized AOs for IFSs with IF-prioritized Aczel–Alsina averaging. Poryazov, et al. [37] applied AOs for IFSs to the estimation of service compositions in telecommunication systems. Dai [38] derived linguistic complex fuzzy sets with their properties.
Frank and prioritized AOs based on IFSs were derived by different researchers, however, the theory of Frank and prioritized AOs based on CIFSs has not yet been evaluated by researchers in the literature. The investigation of Frank and prioritized AOs based on CIFSs is a very challenging task. In this analysis, we have accepted this task and not only derive the theory of Frank and prioritized AOs based on CIFSs but also derive the combination of Frank and prioritized AOs based on CIFSs, where the simple Frank and prioritized AOs are the special case of the derived theory. Furthermore, we also invent the theory of WASPAS for CIFSs. Inspired by the above discussion, the major investigations of this analysis are listed below:
  • To discover Frank operational laws for managing the theory of CIF information;
  • To derive the CIF Frank prioritized averaging (CIFFPA) operator, the CIF Frank prioritized ordered averaging (CIFFPOA) operator, the CIF Frank prioritized geometric (CIFFPG) operator, and the CIF Frank prioritized ordered geometric (CIFFPOG) operator with their properties;
  • To expose the idea of the weighted aggregates sum product assessment (WASPAS) procedure under the consideration or presence of the CIF information and try to simplify it with the help of a suitable example;
  • To demonstrate an example in the presence of the MADM procedures for evaluating the comparison between the proposed operators with some well-known existing operators to show the validity and worth of the discovered approaches.
This article is arranged in the form as follows: in Section 2, we review the different types of norms, CIFS, and the WASPAS technique; in Section 3, we examine Frank operational laws, CIFFPA operator, CIFFPOA operator, CIFFPG operator, and CIFFPOG operator, and their properties of idempotency, monotonicity, and boundedness; in Section 4, we derive the WASPAS for CIF information and try to justify it with the help of a suitable example; and in Section 5, we illustrate some examples in the presence of the MADM procedures for evaluating CIF information. Furthermore, the comparisons between the proposed operators and some well-known existing operators, such as Xu [23], Xu and Yager [24], Yahya, et al. [26], Yu [31], Lin, et al. [32], Garg and Rani [33], Garg and Rani [34], and Mahmood, et al. [35], are used to show the validity and worth of the discovered approaches and are discussed in Section 6. The final concluding information is shown in Section 7.

2. Preliminaries

In this section, we describe the prevailing theory of Frank norms, algebraic norms, and Lukasiewicz’s norms for positive numbers. Furthermore, we also explain the idea of the WASPAS method [19,20] for classical set theory. Moreover, the idea of CIFSs and their related work are also a part of this study. For a clear presentation, the meaning of the symbols used in this paper is shown in Table 1.

2.1. WASPAS Method for Classical Set Theory

The major influence of this section is to recall the theory of the WASPAS procedure for classical information. The main procedure of the WASPAS method contains various valuable and dominant steps. Before evaluating the normalization, we arrange a collection of classical data which may be of a benefit type or cost type. If the data are of a benefit type, then good, otherwise, using the below theory, we normalize the information, such as:
H B = H B ~ max H H B ~ f o r   b e n e f i t min H H B ~ H B ~ f o r   c o s t .
After performing the above evaluation, we calculate the WSA and WPA, such as:
T H W S A = B = 1 d W B H B ~ ;
T H W P A = B = 1 d H B ~ W B .
Using the data in Equations (2) and (3), we calculate the aggregated measure based on convex theory, such as:
T H = ° F T H W S A + 1 ° F T H W P A , ° F 0,1 .
Before ranking the alternatives, we discuss the special cases of the WASPAS technique such as: When ° F = 1 , we obtain the data in Equation (2):
  • When ° F = 1 , we obtain the data in Equation (2);
  • When ° F = 0 , we obtain the data in Equation (3).
Finally, we derive the ranking result for examining the best one from the family of finite preferences.

2.2. Existing Ideas

Definition 1 
([15]). For any two positive numbers and * , we have the theory of Frank t-norm and t-conorm, such that:
Y , * = log 1 + 1 * 1 1 , 1 , + .
Y * , * = 1 log 1 + 1 1 1 * 1 1 , 1 , +
Definition 2 
([1]). For any two positive numbers and * , we have the theory of algebraic t-norm and t-conorm if we put the value of 1 in Equations (5) and (6), such that:
Y ,     =     * .
Y     , * = +     * * .
Definition 3 
([16]). For any two positive numbers and * , we have the theory of Lukasiewicz t-norm and t-conorm if we put the value of + in Equations (5) and (6), such that:
Y , * = max 0 , + * 1 .
Y * , * = min + * , 1
Definition 4 
([13]). A numerical or mathematical equation:
Ι T = = 𝓊 r p x , 𝓊 i p x , 𝓋 r p x , 𝓋 i p x : x X
Stated the CIFS with a truth grade 𝓊 r p x , 𝓊 i p x and falsity grade 𝓋 r p x , 𝓋 i p x must be implementing the following rules, such that 0 𝓊 r p x + 𝓋 r p x 1 and 0 𝓊 i p x + 𝓋 i p x 1 . The notion of neutral grade is stated by: r x = r r p x , r i p x = 1 𝓊 r p x + 𝓋 r p x , 1 𝓊 i p x + 𝓋 i p x and the representation of the CIF values (CIFVs) is the following: Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p , H = 1,2 , , . As noted in the presence of the above information, we recall the idea of score and accuracy function, such as:
V s Ι T = H = 1 2 𝓊 H r p 𝓋 H r p + 𝓊 H i p 𝓋 H i p 1,1 .
V a Ι T = H = 1 2 𝓊 H r p + 𝓋 H r p + 𝓊 H i p + 𝓋 H i p 0,1
To differentiate the above information, we recall some valuable characteristics: if V s Ι T = 1 > V s Ι T = 2 Ι T = 1 > Ι T = 2 ; If V s Ι T = 1 < V s Ι T = 2 Ι T = 1 < Ι T = 2 ; If V s Ι T = 1 = V s Ι T = 2 If V a Ι T = 1 > V a Ι T = 2 Ι T = 1 > Ι T = 2 ; If V a Ι T = 1 < V a Ι T = 2 Ι T = 1 < Ι T = 2 .

3. CIF Frank Prioritized Aggregation Operators

In this section, we propose the idea of Frank operational laws for CIF information. Furthermore, we examine the theory of the CIFFPA operator, the CIFFPOA operator, the CIFFPG operator, and the CIFFPOG operator, and their properties (idempotency, monotonicity, and boundedness). From now on, we will be using the CIFVs Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p , H = 1,2 , , for constructing any ideas.
Definition 5. 
The mathematical form of Frank operational laws is stated as follows: for 1 , +
,
Ι T = 1 Ι T = 2 = 1 log 1 + 1 𝓊 1 r p 1 1 𝓊 2 r p 1 1 , 1 log 1 + 1 𝓊 1 i p 1 1 𝓊 2 i p 1 1 , log 1 + 𝓋 1 r p 1 𝓋 2 r p 1 1 , log 1 + 𝓋 1 i p 1 𝓋 2 i p 1 1 .
Ι T = 1 Ι T = 2 = log 1 + 𝓊 1 r p 1 𝓊 2 r p 1 1 , log 1 + 𝓊 1 i p 1 𝓊 2 i p 1 1 , 1 log 1 + 1 𝓋 1 r p 1 1 𝓋 2 r p 1 1 , 1 log 1 + 1 𝓋 1 i p 1 1 𝓋 2 i p 1 1
P Ι T = 1 = 1 log 1 + 1 𝓊 1 r p 1 P 1 P 1 , 1 log 1 + 1 𝓊 1 i p 1 P 1 P 1 , log 1 + 𝓋 1 r p 1 P 1 P 1 , log 1 + 𝓋 1 i p 1 P 1 P 1 .
Ι T = 1 P = log 1 + 𝓊 1 r p 1 P 1 P 1 , log 1 + 𝓊 1 i p 1 P 1 P 1 , 1 log 1 + 1 𝓋 1 r p 1 P 1 P 1 , 1 log 1 + 1 𝓋 1 i p 1 P 1 P 1 .
Definition 6. 
The mathematical form of the CIFFPA operator is shown below:
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = = = 1 H = 1 = H Ι T = 1 = 2 H = 1 = H Ι T = 2 = H = 1 = H Ι T = = H = 1 = H H = 1 = H Ι T = H .
With the values of = 1 = 1 and = H = B = 1 H 1 V s Ι T = B .
Theorem 1. 
With the help of the data in Equation (18), we show that the aggregated value of Equation (18) will again be in the form of CIFV, such as:
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = = 1 log 1 + H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 .
Proof. 
The procedure of Mathematical Induction is used in this proof as follows: if = 2 , then we obtain
= 1 H = 1 = H Ι T = 1 = 1 log 1 + 1 𝓊 1 r p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , 1 log 1 + 1 𝓊 1 i p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , log 1 + 𝓋 1 r p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , log 1 + 𝓋 1 i p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 = 2 H = 1 = H Ι T = 2 = 1 log 1 + 1 𝓊 2 r p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , 1 log 1 + 1 𝓊 2 i p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , log 1 + 𝓋 2 r p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , log 1 + 𝓋 2 i p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1
Thus,
= 1 H = 1 = H Ι T = 1 = 2 H = 1 = H Ι T = 2 = 1 log 1 + 1 𝓊 1 r p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , 1 log 1 + 1 𝓊 1 i p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , log 1 + 𝓋 1 r p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 , log 1 + 𝓋 1 i p 1 = 1 H = 1 = H 1 = 1 H = 1 = H 1 1 log 1 + 1 𝓊 2 r p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , 1 log 1 + 1 𝓊 2 i p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , log 1 + 𝓋 2 r p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 , log 1 + 𝓋 2 i p 1 = 2 H = 1 = H 1 = 2 H = 1 = H 1 = 1 log 1 + H = 1 2 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 2 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 2 𝓋 1 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 2 𝓋 1 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
We obtain the correct theory. Furthermore, we assume that we also obtain the correct theory for = B , such that:
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = B = 1 log 1 + H = 1 B 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 B 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B 𝓋 1 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B 𝓋 1 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
Furthermore, we prove it for = B + 1 , such as:
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = B + 1 = = 1 H = 1 = H Ι T = 1 = 2 H = 1 = H Ι T = 2 = B H = 1 = H Ι T = B = B + 1 H = 1 = H Ι T = B + 1 = H = 1 B = H H = 1 = H Ι T = H = B + 1 H = 1 B + 1 = H Ι T = B + 1 = 1 log 1 + H = 1 B 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 B 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B 𝓋 1 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B 𝓋 1 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 1 log 1 + 1 𝓊 B + 1 r p 1 = B + 1 H = 1 B + 1 = H 1 = B + 1 H = 1 B + 1 = H 1 , 1 log 1 + 1 𝓊 B + 1 i p 1 = B + 1 H = 1 B + 1 = H 1 = B + 1 H = 1 B + 1 = H 1 , log 1 + 𝓋 B + 1 r p 1 = B + 1 H = 1 B + 1 = H 1 = B + 1 H = 1 B + 1 = H 1 , log 1 + 𝓋 B + 1 i p 1 = B + 1 H = 1 B + 1 = H 1 = B + 1 H = 1 B + 1 = H 1 = 1 log 1 + H = 1 B + 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 B + 1 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B + 1 𝓋 1 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 B + 1 𝓋 1 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
This proves the theorem. □
Proposition 1 (Idempotency). 
If we use Ι T = H = Ι T = = 𝓊 r p , 𝓊 i p , 𝓋 r p , 𝓋 i p , then
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = .
Proof. 
Let
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = = 1 log 1 + H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 = 1 log 1 + H = 1 1 𝓊 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓊 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 = 1 log 1 + 1 𝓊 r p 1 H = 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + 1 𝓊 i p 1 H = 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + 𝓋 r p 1 H = 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + 𝓋 i p 1 H = 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 = 1 log 1 + 1 𝓊 r p 1 1 1 1 , 1 log 1 + 1 𝓊 i p 1 1 1 1 , log 1 + 𝓋 r p 1 1 1 1 , log 1 + 𝓋 i p 1 1 1 1 , H = 1 = H H = 1 = H = 1 = 1 log 1 + 1 𝓊 r p 1 , 1 log 1 + 1 𝓊 i p 1 , log 1 + 𝓋 r p 1 , log 1 + 𝓋 i p 1 = 1 log 1 𝓊 r p , 1 log 1 𝓊 i p , log 𝓋 r p , log 𝓋 i p = 1 1 𝓊 r p , 1 1 𝓊 i p , 𝓋 r p , 𝓋 i p = 𝓊 r p , 𝓊 i p , 𝓋 r p , 𝓋 i p = Ι T = .
This proves the proposition. □
Proposition 2 (Monotonicity). 
If  Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p Ι T = H * = 𝓊 H r p * , 𝓊 H i p * , 𝓋 H r p * , 𝓋 H i p * , then
C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = C I F F P A Ι T = 1 * , Ι T = 2 * , , Ι T = *
Proof. 
Consider Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p Ι T = H * = 𝓊 H r p * , 𝓊 H i p * , 𝓋 H r p * , 𝓋 H i p *
. Notice that 𝓊 H r p 𝓊 H r p * , 𝓊 H i p 𝓊 H i p * and 𝓋 H r p 𝓋 H r p * , 𝓋 H i p 𝓋 H i p * , then we have 𝓊 H r p 𝓊 H r p * 1 𝓊 H r p 1 𝓊 H r p * 1 𝓊 H r p 1 𝓊 H r p * 1 𝓊 H r p 1 1 𝓊 H r p * 1 1 𝓊 H r p 1 = H H = 1 = H 1 𝓊 H r p * 1 = H H = 1 = H H = 1 1 𝓊 H r p 1 = H H = 1 = H H = 1 1 𝓊 H r p * 1 = H H = 1 = H   H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 H = 1 1 𝓊 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1   log 1 + H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 log 1 + H = 1 1 𝓊 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1   1 log 1 + H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 1 log 1 + H = 1 1 𝓊 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 .
In the same way, we find the unreal part, such as:
1 log 1 + H = 1 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 1 log 1 + H = 1 1 𝓊 H i p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
Furthermore, we have 𝓋 H r p 𝓋 H r p * 𝓋 H r p 𝓋 H r p * 𝓋 H r p 1 𝓋 H r p * 1 𝓋 H r p 1 = H H = 1 = H 𝓋 H r p * 1 = H H = 1 = H   H = 1 𝓋 H r p 1 = H H = 1 = H H = 1 𝓋 H r p * 1 = H H = 1 = H   H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 H = 1 𝓋 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1   1 + H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 1 + H = 1 𝓋 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1   log 1 + H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 log 1 + H = 1 𝓋 H r p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 .
In the same way, we find the unreal part, such as: log 1 + H = 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 log 1 + H = 1 𝓋 H i p * 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 . Then, with the presence of the score function and accuracy function, we can easily obtain our required result with C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = C I F F P A Ι T = 1 * , Ι T = 2 * , , Ι T = * . This proves the proposition. □
Proposition 3 (Boundedness). 
If  Ι T = H = min H 𝓊 H r p , min H 𝓊 H i p , max H 𝓋 H r p , max H 𝓋 H i p and Ι T = H + = max H 𝓊 H r p , max H 𝓊 H i p , min H 𝓋 H r p , min H 𝓋 H i p , then we have
Ι T = H C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = Ι T = H + .
Proof. 
Using Propositions 1 and 2, we have C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = C I F F P A Ι T = 1 + , Ι T = 2 + , , Ι T = + = Ι T = H + and C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = H . Then, Ι T = H C I F F P A Ι T = 1 , Ι T = 2 , , Ι T = Ι T = H + .
Definition 7. 
The mathematical form of the CIFFPOA operator is shown below:
C I F F P O A Ι T = 1 , Ι T = 2 , , Ι T = = = 1 H = 1 = H Ι T = o 1 = 2 H = 1 = H Ι T = o 2 = H = 1 = H Ι T = o = H = 1 = H H = 1 = H Ι T = o H .
With the values of = 1 = 1 and = H = B = 1 H 1 V s Ι T = B and o H o H 1 .
Theorem 2. 
With the help of the data in Equation (23), we expose that the aggregated value of Equation (23) will again be in the form of CIFV, such as:
C I F F P O A Ι T = 1 , Ι T = 2 , , Ι T = = 1 log 1 + H = 1 1 𝓊 o H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓊 o H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 o H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 o H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 .
Proposition 4 (Idempotency) 
If we use  Ι T = H = Ι T = = 𝓊 r p , 𝓊 i p , 𝓋 r p , 𝓋 i p
, then
C I F F P O A Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = .
Proposition 5 (Monotonicity). 
If  Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p Ι T = H * = 𝓊 H r p * , 𝓊 H i p * , 𝓋 H r p * , 𝓋 H i p *
, then
C I F F P O A Ι T = 1 , Ι T = 2 , , Ι T = C I F F P O A Ι T = 1 * , Ι T = 2 * , , Ι T = * .
Proposition 6 (Boundedness). 
If  Ι T = H = min H 𝓊 H r p , min H 𝓊 H i p , max H 𝓋 H r p , max H 𝓋 H i p and Ι T = H + = max H 𝓊 H r p , max H 𝓊 H i p , min H 𝓋 H r p , min H 𝓋 H i p , then we have
C Ι T = H C I F F P O A Ι T = 1 , Ι T = 2 , , Ι T = Ι T = H +
Definition 8. 
The mathematical form of the CIFFPG operator is shown below:
C I F F P G Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = 1 = 1 H = 1 = H Ι T = 2 = 2 H = 1 = H Ι T = = H = 1 = H = H = 1 Ι T = H = H H = 1 = H
With the values of = 1 = 1 and = H = B = 1 H 1 V s Ι T = B .
Theorem 3. 
With the help of the data in Equation (28), we expose that the aggregated value of Equation (28) will again be in the form of CIFV, such as:
C I F F P G Ι T = 1 , Ι T = 2 , , Ι T = = log 1 + H = 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
Proposition 7 (Idempotency). 
If we use Ι T = H = Ι T = = 𝓊 r p , 𝓊 i p , 𝓋 r p , 𝓋 i p
, then
C I F F P G Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = .
Proposition 8 (Monotonicity). 
If Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p Ι T = H * = 𝓊 H r p * , 𝓊 H i p * , 𝓋 H r p * , 𝓋 H i p *
, then
C I F F P G Ι T = 1 , Ι T = 2 , , Ι T = C I F F P G Ι T = 1 * , Ι T = 2 * , , Ι T = * .
Proposition 9 (Boundedness). 
If Ι T = H = min H 𝓊 H r p , min H 𝓊 H i p , max H 𝓋 H r p , max H 𝓋 H i p and Ι T = H + = max H 𝓊 H r p , max H 𝓊 H i p , min H 𝓋 H r p , min H 𝓋 H i p , then we have
Ι T = H C I F F P G Ι T = 1 , Ι T = 2 , , Ι T = Ι T = H + .
Definition 9. 
The mathematical form of the CIFFPOG operator is shown below:
C I F F P O G Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = o 1 = 1 H = 1 = H Ι T = o 2 = 2 H = 1 = H Ι T = o = H = 1 = H = H = 1 Ι T = o H = H H = 1 = H
With the values of = 1 = 1 and = H = B = 1 H 1 V s Ι T = B and o H o H 1 .
Theorem 4. 
With the help of the data in Equation (33), we expose that the aggregated value of Equation (33) will again be in the form of CIFV, such as:
C I F F P O G Ι T = 1 , Ι T = 2 , , Ι T = = log 1 + H = 1 𝓊 o H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓊 o H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 o H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 o H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
Proposition 10 (Idempotency). 
If we use Ι T = H = Ι T = = 𝓊 r p , 𝓊 i p , 𝓋 r p , 𝓋 i p
, then
C I F F P O G Ι T = 1 , Ι T = 2 , , Ι T = = Ι T = .
Proposition 11 (Monotonicity). 
If Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p Ι T = H * = 𝓊 H r p * , 𝓊 H i p * , 𝓋 H r p * , 𝓋 H i p *
, then
C I F F P O G Ι T = 1 , Ι T = 2 , , Ι T = C I F F P O G Ι T = 1 * , Ι T = 2 * , , Ι T = * .
Proposition 12 (Boundedness). 
If Ι T = H = min H 𝓊 H r p , min H 𝓊 H i p , max H 𝓋 H r p , max H 𝓋 H i p and Ι T = H + = max H 𝓊 H r p , max H 𝓊 H i p , min H 𝓋 H r p , min H 𝓋 H i p , then we have
Ι T = H C I F F P O G Ι T = 1 , Ι T = 2 , , Ι T = Ι T = H + .

4. CIF WASPAS Procedures

The main point of this section is to extend the theory of the WASPAS procedure to CIF information. The procedures of the WASPAS method contain various valuable and dominant steps. Before evaluating the normalization, we arrange a collection of CIF data which may be of a benefit type or cost type. If the data are of a benefit type, then good, otherwise, using the below theory, we normalize the information, such as:
Ι T = 0 , H = max H 𝓊 i H r p , max H 𝓊 i H i p , min H 𝓋 i H r p , min H 𝓋 i H i p , i , H = 1,2 , , ,
Ι T = H = 𝓊 i H r p , 𝓊 i H i p , 𝓋 i H r p , 𝓋 i H i p = 0 o t h e r w i s e 𝓊 i H r p 1 + 𝓊 0 , H r p , 𝓊 i H i p 1 + 𝓊 0 , H i p i f   𝓊 i H r p 𝓊 0 , H r p , 𝓊 i H i p 𝓊 0 , H i p 𝓋 i H r p 1 + 𝓋 0 , H r p , 𝓋 i H i p 1 + 𝓋 0 , H i p f o r   f a l s i t y   g r a d e   ( r e a l   a d   u r e a l   p a r t s )
After performing the above evaluation, we calculate the WSA and WPA with the help of derived theory, such as:
T H W S A = C I F F P A Ι T = 1 , Ι T = 2 , , Ι T =                              = 1 log 1 + H = 1 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
T H W P A = C I F F P G Ι T = 1 , Ι T = 2 , , Ι T =                              = log 1 + H = 1 𝓊 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , log 1 + H = 1 𝓊 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 H r p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1 , 1 log 1 + H = 1 1 𝓋 H i p 1 = H H = 1 = H 1 H = 1 = H H = 1 = H 1
where, = 1 = 1 and = H = B = 1 H 1 V s Ι T = B .
Using the data in Equations (40) and (41), we calculate the aggregated measure based on convex theory, such as:
T H = ° F V s T H W S A + 1 ° F V s T H W P A , ° F 0,1
Before ranking the alternatives, we discuss the special cases of the WASPAS technique based on CIF information such as:
  • When ° F = 1 , we obtain the data in Equation (40);
  • When ° F = 0 , we obtain the data in Equation (41).
In last, we derive the ranking result for examining the best one from the family of finite preferences. Furthermore, we justify the supremacy and worth of the derived theory with the help of some suitable examples, such as:
Ι T = H = 0.4,0.2 , 0.1,0.2 0.5,0.4 , 0.2,0.3 0.6,0.5 , 0.2,0.3 0.7,0.8 , 0.1,0.1 0.4,0.2 , 0.1,0.2 0.1,0.4 , 0.2,0.3 0.6,0.5 , 0.2,0.3 0.7,0.8 , 0.1,0.1 0.4,0.2 , 0.1,0.2 0.5,0.4 , 0.2,0.3 0.2,0.5 , 0.2,0.3 0.7,0.8 , 0.1,0.1 0.1,0.2 , 0.1,0.2 0.5,0.4 , 0.2,0.3 0.6,0.5 , 0.2,0.3 0.7,0.8 , 0.1,0.1
Then, we find the positive ideal, such as:
Ι T = 0 , H = 0.7,0.8 , 0.1,0.1 , 0.7,0.8 , 0.1,0.1 , 0.7,0.8 , 0.1,0.1 , 0.7,0.8 , 0.1,0.1
With the help of the Ι T = 0 , H and the information in Ι T = H , we obtain the below theory, such as:
Ι T = H = 0.2352,0.1111 , 0.0909,0.1818 0.2941,0.2222 , 0.1818,0.2727 0.3529,0.2777 , 0.1818,0.2727 0.4117,0.4444 , 0.0909,0.0909 0.2353,0.1111 , 0.0909,0.1818 0.0588,0.2222 , 0.1818,0.2727 0.3529,0.2778 , 0.1818,0.2727 0.4118,0.4444 , 0.0909,0.0909 0.2353,0.1111 , 0.0909,0.1818 0.2941,0.2222 , 0.1818,0.2727 0.1176,0.2778 , 0.1818,0.2727 0.4118,0.4444 , 0.0909,0.0909 0.0588,0.1111 , 0.0909,0.2727 0.2941,0.2222 , 0.1818,0.2727 0.3529,0.2778 , 0.1818,0.2727 0.4118,0.4444 , 0.0909,0.0909
After performing the above evaluation, we calculate the WSA and WPA with the help of derived theory, such as: T 1 W S A = 0.2375,0.1154 , 0.0933,0.1846 ,   T 2 W S A = 0.229,0.1146 , 0.0933,0.1846 ,   T 3 W S A = 0.2373,0.1154 , 0.0933,0.1846 ,   T 4 W S A = 0.0456,0.1055 , 0.0866,0.1764 , and T 1 W P A = 0.2373,0.1140 , 0.0944,0.1853 ,   T 2 W P A = 0.2241,0.1136 , 0.0944,0.1849 ,   T 3 W P A = 0.2373,0.1141 , 0.0944,0.1853 ,   T 4 W P A = 0.0532,0.1058 , 0.0865,0.1778 . Using the data in Equations (40) and (41) with = 0.2 , we calculate the aggregated measure based on convex theory, such as: T 1 = 0.03621 , T 2 = 0.0302 , T 3 = 0.036 , T 4 = 0.053 . According to the score values of the four alternatives, the ranking results is with T 1 > T 3 > T 2 > T 4 . Thus, the best optimal is T 1 according to the score values of alternatives.

5. Application in MADM Method

The MADM technique is the valuable and dominant part of the decision-making procedure. The main theme of this section is to utilize the theory of the MADM technique based on the presented information for CIF set theory. To examine the above problem, we collect the finite family of alternatives Ι T = 1 , Ι T = 2 , Ι T = 3 , Ι T = 4 , , Ι T = and their attributes Ι T = a 1 , Ι T = a 2 , Ι T = a 3 , Ι T = a 4 , Ι T = a . Based on the above alternatives and their attributes, we compute the matrix of information whose term is computed in the form of CIF values such that the CIFS with a truth grade 𝓊 r p x , 𝓊 i p x and falsity grade 𝓋 r p x , 𝓋 i p x must be implementing the following rule: 0 𝓊 r p x + 𝓋 r p x 1 and 0 𝓊 i p x + 𝓋 i p x 1 . The notion of neutral grade is stated by r x = r r p x , r i p x = 1 𝓊 r p x + 𝓋 r p x , 1 𝓊 i p x + 𝓋 i p x and the representation of the CIFVs is with Ι T = H = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p , H = 1,2 , , . Furthermore, to proceed with the above information, we compute a technique of decision-making, whose major steps are shown below:
  • Step 1: Before evaluating the normalization, we arrange a collection of CIF data which may be of a benefit type or cost type. If the data are of a benefit type, then good, otherwise, using the below theory, we normalize the information, such as:
C = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p f o r   b e n e f i t 𝓋 H r p , 𝓋 H i p , 𝓊 H r p , 𝓊 H i p f o r   c o s t .
  • Step 2: After performing the above evaluation, we calculate the CIFFPA operator and CIFFPG operator with the help of the derived theory.
  • Step 3: Evaluate the score or accuracy values of the aggregated information.
  • Step 4: Examine the ranking values in the presence of the score information.
In the last, we aim to show the supremacy and worth of the above procedure with the help of illustrating some numerical examples.
Illustrative Example: An investment enterprise wants to invest in an enterprise to increase or grow its income. There are five potential enterprises as alternatives, which are Ι T = 1 , Ι T = 2 , Ι T = 3 , Ι T = 4 and Ι T = 5 . Four attributes are employed to resolve the problem in order to find the best preference from our five alternatives, including Ι T = a 1 : growth analysis, Ι T = a 2 : social-political impact, Ι T = a 3 : environmental impact, and Ι T = a 4 : development of society. Furthermore, to proceed with the above information, we compute a technique of decision-making, whose major steps are shown below:
Step 1: Before evaluating the normalization, we arrange a collection of CIF data in the form of Table 1, which may be of a benefit type or cost type. If the data are of a benefit type, then good, otherwise, using the below theory, we normalize the information, such as:
C = 𝓊 H r p , 𝓊 H i p , 𝓋 H r p , 𝓋 H i p f o r   b e n e f i t 𝓋 H r p , 𝓋 H i p , 𝓊 H r p , 𝓊 H i p f o r   c o s t .
However, the data in Table 2 is not required to be normalized.
Step 2: After performing the above evaluation, we calculate the CIFFPA operator and CIFFPG operator with the help of the derived theory, and see Table 3.
Step 3: Evaluate the score or accuracy values of aggregated information, and see Table 4.
Step 4: Examine the ranking values of the score information, and see Table 5.
The valuable and best preference is 𝚰 𝕿 = 5 , according to the theory of CIFFPA and CIFFPG operators. Furthermore, by excluding the phase term, we have checked the stability and supremacy of the derived information. Thus, we remove the phase information from the data in Table 2 in which their score values are shown in Table 6.
Furthermore, we examine the ranking values of the score information, and see Table 7.
The valuable and best preference is 𝚰 𝕿 = 5 according to the theory of the CIFFPA operator. Furthermore, the best preference is 𝚰 𝕿 = 4 according to the theory of the CIFFPG operator. Additionally, we find the comparisons between the proposed and existing data with the help of data in Table 2.

6. Comparative Analysis

In this section, we select some existing operators based on various prevailing ideas. We then try to compare their obtained results with the obtained results of our proposed works. The comparative analysis is one of the most effective and dominant techniques because without comparison we fail to show the supremacy and validity of the derived theory. For this, we consider different types of information, such as aggregation operators (AOs) for IFSs [23], geometric AOs for IFSs [24], the complex fuzzy credibility Frank AOs [26]. Additionally, Yu [31] examined the theory of generalized prioritized AOs for intuitionistic fuzzy environments, and Lin, et al. [32] derived the fuzzy number intuitionistic fuzzy prioritized AOs and their application in decision-making procedures. Furthermore, Garg and Rani [33] exposed the averaging operators for CIFSs. Garg and Rani [34] evaluated the geometric operators for CIFSs, and Mahmood, et al. [35] examined the Aczel–Alsina aggregation operators for CIFSs. Using data in Table 2, the comparison information is listed in Table 8.
The valuable and best preference is 𝚰 𝕿 = 5 , according to the theory of CIFFPA, CIFFPG operators, Garg and Rani [33,34], and Mahmood, et al. [35]. However, the theory of AOs for IFSs [23], geometric AOs for IFSs [24], the complex fuzzy credibility of Frank AOs [26], and Yu [31] examined the theory of generalized prioritized AOs for intuitionistic fuzzy environments with the limitation that fails to evaluate it. Similarly, Lin, et al. [35] derive the fuzzy number intuitionistic fuzzy prioritized AOs and their application in decision-making procedures also with the limitation and restriction, because they fail to evaluate it. It is possible if we use the data in Table 2, however, without phase information, then the comparison information is listed in Table 9.
The valuable and best preference is 𝚰 𝕿 = 5 according to the theory of the CIFFPA operator, Xu [23], Xu and Yager [24], Yu [31], Lin, et al. [32], Garg and Rani [33,34], and Mahmood, et al. [35]. However, the most valuable and best preference is 𝚰 𝕿 = 4 according to the theory of the CIFFPG operator. However, the complex fuzzy credibility Frank AOs [26] have limitations and restrictions, and because it failed to evaluate it. Therefore, the proposed work is effective and valid for evaluating most of the CIFS information.

7. Conclusions

The idea of CIFS is the modified version of the complex fuzzy set theory, which covered the grade of truth and falsity in the form of polar coordinates. Furthermore, the theory of Frank and prioritized aggregation operators is also very famous and valuable because they are the modified version of the simple averaging and geometric aggregation operators. Motivated by the above information, in this manuscript, we examined the following ideas:
  • We evaluated the Frank operational laws for the theory of CIF information;
  • We examined the theory of the CIFFPA, CIFFPOA, CIFFPG, and CIFFPOG operators, and their properties of idempotency, monotonicity, and boundedness;
  • We derived the WASPAS under the presence of the CIFFPA and CIFFPG operators;
  • We demonstrated the MADM procedures based on the invented theory for CIF information;
  • We compared the derived theory with various existing information to show the validity and worth of the discovered approaches.
In the future, we aim to develop new aggregation operators based on Frank operational laws and then we aim to employ them in the field of game theory, neural networks, clustering, pattern recognition, and decision-making to enhance the worth of the derived information.

Author Contributions

Conceptualization, Z.A. and T.M.; methodology, Z.A. 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.; writing—original draft preparation, Z.A. and T.M.; writing—review and editing, M.-S.Y.; visualization, Z.A. and T.M.; 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 work was supported in part by the National Science and Technology Council, 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]
  2. Chang-Chien, S.J.; Hung, W.L.; Yang, M.S. On mean shift-based clustering for circular data. Soft Comput. 2012, 16, 1043–1060. [Google Scholar] [CrossRef]
  3. Chaomurilige, C.; Yu, J.; Yang, M.S. Deterministic annealing Gustafson-Kessel fuzzy clustering algorithm. Inf. Sci. 2017, 417, 435–453. [Google Scholar] [CrossRef]
  4. Chen, J.; Lin, Y.; Mi, J.; Li, S.; Ding, W. A spectral feature selection approach with kernelized fuzzy rough sets. IEEE Trans. Fuzzy Syst. 2022, 30, 2886–2901. [Google Scholar] [CrossRef]
  5. Xie, T.; Gong, Z. A hesitant soft fuzzy rough set and its applications. IEEE Access 2019, 7, 167766–167783. [Google Scholar] [CrossRef]
  6. Mahmood, T.; Ali, Z. Fuzzy superior mandelbrot sets. Soft Comput. 2022, 26, 9011–9020. [Google Scholar] [CrossRef]
  7. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  8. Hwang, C.M.; Yang, M.S. New construction for similarity measures between intuitionistic fuzzy sets based on lower, upper and middle fuzzy sets. Int. J. Fuzzy Syst. 2013, 15, 359–366. [Google Scholar]
  9. Yang, M.S.; Hussian, Z.; Ali, M. Belief and plausibility measures on intuitionistic fuzzy sets with construction of belief-plausibility TOPSIS. Complexity 2020, 2020, 7849686. [Google Scholar] [CrossRef]
  10. Kaushal, M.; Lohani, Q.M.D. Intuitionistic fuzzy c-ordered means clustering algorithm. IEEE Access 2022, 10, 26271–26281. [Google Scholar] [CrossRef]
  11. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  12. Selvachandran, G.; Quek, S.G.; Lan, L.T.H.; Son, L.H.; Giang, N.L.; Ding, W.; Abdel-Basset, M.; de Albuquerque, V.H.C. A new design of Mamdani complex fuzzy inference system for multiattribute decision making problems. IEEE Trans. Fuzzy Syst. 2021, 29, 716–730. [Google Scholar] [CrossRef]
  13. 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]
  14. Gulzar, M.; Mateen, M.H.; Alghazzawi, D.; Kausar, N. A novel applications of complex intuitionistic fuzzy sets in group theory. IEEE Access 2020, 8, 196075–196085. [Google Scholar] [CrossRef]
  15. Frank, M.J. On the simultaneous associativity of F(x,y) and x + y − F(x, y). Aequ. Math. 1979, 19, 194–226. [Google Scholar] [CrossRef]
  16. Łukasiewicz, J. O logice trójwartościowej. In Ruch Filozoficzny 5; English translation: On three-valued, logic; Borkowski, L., Ed.; Selected works by Jan Łukasiewicz: North-Holland, The Amsterdam, 1970; pp. 170–171, 87–88. [Google Scholar]
  17. Yager, R.R. Prioritized aggregation operators. Int. J. Approx. Reason. 2008, 48, 263–274. [Google Scholar] [CrossRef]
  18. Yu, X.; Xu, Z. Prioritized intuitionistic fuzzy aggregation operators. Inf. Fusion 2013, 14, 108–116. [Google Scholar] [CrossRef]
  19. Zavadskas, E.K.; Turskis, Z.; Antucheviciene, J.; Zakarevicius, A. Optimization of weighted aggregated sum product assessment. Elektron. Ir Elektrotechnika 2012, 122, 3–6. [Google Scholar] [CrossRef]
  20. Zavadskas, E.K.; Antucheviciene, J.; Šaparauskas, J.; Turskis, Z. Multi-criteria assessment of facades’ alternatives: Peculiarities of ranking methodology. Procedia Eng. 2013, 57, 107–112. [Google Scholar] [CrossRef]
  21. Mishra, A.R.; Rani, P.; Prajapati, R.S. Multi-criteria weighted aggregated sum product assessment method for sustainable biomass crop selection problem using single-valued neutrosophic sets. Appl. Soft Comput. 2021, 113, 108038. [Google Scholar] [CrossRef]
  22. Debnath, B.; Bari, A.B.M.M.; Haq, M.M.; Pacheco, D.A.D.J.; Khan, M.A. An integrated stepwise weight assessment ratio analysis and weighted aggregated sum product assessment framework for sustainable supplier selection in the healthcare supply chains. Supply Chain. Anal. 2023, 1, 100001. [Google Scholar] [CrossRef]
  23. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  24. 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]
  25. Zhang, X.; Liu, P.; Wang, Y. Multiple attribute group decision making methods based on intuitionistic fuzzy Frank power aggregation operators. J. Intell. Fuzzy Syst. 2015, 29, 2235–2246. [Google Scholar] [CrossRef]
  26. Yahya, M.; Abdullah, S.; Almagrabi, A.O.; Botmart, T. Analysis of S-box based on image encryption application using complex fuzzy credibility Frank aggregation operators. IEEE Access 2022, 10, 88858–88871. [Google Scholar] [CrossRef]
  27. Qin, J.; Liu, X.; Pedrycz, W. Frank aggregation operators and their application to hesitant fuzzy multiple attribute decision making. Appl. Soft Comput. 2016, 41, 428–452. [Google Scholar]
  28. Tang, X.; Yang, S.; Pedrycz, W. Multiple attribute decision-making approach based on dual hesitant fuzzy Frank aggregation operators. Appl. Soft Comput. 2018, 68, 525–547. [Google Scholar]
  29. Ye, J. Prioritized aggregation operators of trapezoidal intuitionistic fuzzy sets and their application to multicriteria decision-making. Neural Comput. Appl. 2014, 25, 1447–1454. [Google Scholar] [CrossRef]
  30. 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]
  31. Yu, D. Multi-Criteria Decision Making Based on Generalized Prioritized Aggregation Operators under Intuitionistic Fuzzy Environment. Int. J. Fuzzy Syst. 2013, 15, 47–54. [Google Scholar]
  32. Lin, R.; Zhao, X.; Wei, G. Fuzzy number intuitionistic fuzzy prioritized operators and their application to multiple attribute decision making. J. Intell. Fuzzy Syst. 2013, 24, 879–888. [Google Scholar] [CrossRef]
  33. Garg, H.; Rani, D. Some generalized complex intuitionistic fuzzy aggregation operators and their application to multicriteria decision-making process. Arab. J. Sci. Eng. 2019, 44, 2679–2698. [Google Scholar] [CrossRef]
  34. Garg, H.; Rani, D. Generalized geometric aggregation operators based on t-norm operations for complex intuitionistic fuzzy sets and their application to decision-making. Cogn. Comput. 2020, 12, 679–698. [Google Scholar] [CrossRef]
  35. Mahmood, T.; Ali, Z.; Baupradist, S.; Chinram, R. Complex intuitionistic fuzzy Aczel-Alsina aggregation operators and their application in multi-attribute decision-making. Symmetry 2022, 14, 2255. [Google Scholar] [CrossRef]
  36. 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]
  37. Poryazov, S.; Andonov, V.; Saranova, E.; Atanassov, K. Two approaches to the traffic quality intuitionistic fuzzy estimation of service compositions. Mathematics 2022, 10, 4439. [Google Scholar] [CrossRef]
  38. Dai, S. Linguistic complex fuzzy sets. Axioms 2023, 12, 328. [Google Scholar] [CrossRef]
Table 1. Meanings of different symbols used in the paper.
Table 1. Meanings of different symbols used in the paper.
SymbolsMeaningsSymbolsMeaningsSymbolsMeanings
𝓾 r p x Real part of membership grade 𝓾 r p x Real part of the non-membership grade X Universal set
𝓾 i p x Imaginary part of membership grade 𝓋 i p x Imaginary part of the non-membership grade x Element of the universal set
r r p x Real part of the refusal grade r i p x Imaginary part of refusal grade r x Refusal grade
𝚰 𝕿 = Complex intuitionistic fuzzy set Ι T = H Complex intuitionistic fuzzy value V s Ι T = H Score value
V a ( 𝚰 𝕿 = 𝕳 ) Accuracy value W B Weighted vector ° F 0 Scaler
𝖄 , * t-norm 𝔜 * , * t-conorm 1 , + Scaler
Table 2. Original CIF information matrix.
Table 2. Original CIF information matrix.
𝚰 𝕿 = a 1 𝚰 𝕿 = a 2 𝚰 𝕿 = a 3 𝚰 𝕿 = a 4
𝚰 𝕿 = 1 0.4 , 0.3 , 0.1 , 0.3 0.41 , 0.31 , 0.11 , 0.31 0.42 , 0.32 , 0.12 , 0.32 0.43 , 0.33 , 0.13 , 0.33
𝚰 𝕿 = 2 0.6 , 0.7 , 0.2 , 0.1 0.61 , 0.71 , 0.21 , 0.11 0.62 , 0.72 , 0.22 , 0.12 0.63 , 0.73 , 0.23 , 0.13
𝚰 𝕿 = 3 0.3 , 0.2 , 0.3 , 0.4 0.31 , 0.21 , 0.31 , 0.41 0.32 , 0.22 , 0.32 , 0.42 0.33 , 0.23 , 0.33 , 0.43
𝚰 𝕿 = 4 0.7 , 0.4 , 0.2 , 0.3 0.71 , 0.41 , 0.21 , 0.31 0.72 , 0.42 , 0.22 , 0.32 0.73 , 0.43 , 0.23 , 0.33
𝚰 𝕿 = 5 0.7 , 0.7 , 0.1 , 0.1 0.71 , 0.71 , 0.11 , 0.11 0.72 , 0.72 , 0.12 , 0.12 0.73 , 0.73 , 0.13 , 0.13
Table 3. Aggregated values.
Table 3. Aggregated values.
C I F F P A C I F F P G
𝚰 𝕿 = 1 0.4084 , 0.3071 , 0.0969 , 0.2941 0.3941 , 0.2941 , 0.1039 , 0.3071
𝚰 𝕿 = 2 0.7369 , 0.8279 , 0.108 , 0.043 0.4986 , 0.6188 , 0.2794 , 0.1486
𝚰 𝕿 = 3 0.3007 , 0.2007 , 0.3002 , 0.1003 0.3002 , 0.2003 , 0.3007 , 0.1006
𝚰 𝕿 = 4 0.7448 , 0.4393 , 0.1694 , 0.2647 0.6776 , 0.364 , 0.2249 , 0.3329
𝚰 𝕿 = 5 0.8753 , 0.8753 , 0.0258 , 0.0258 0.5741 , 0.5741 , 0.1738 , 0.1738
Table 4. Score values.
Table 4. Score values.
C I F F P A C I F F P G
𝚰 𝕿 = 1 0.1623 0.1386
𝚰 𝕿 = 2 0.7069 0.3447
𝚰 𝕿 = 3 0.0504 0.0496
𝚰 𝕿 = 4 0.375 0.2419
𝚰 𝕿 = 5 0.8495 0.4003
Table 5. Ranking information.
Table 5. Ranking information.
Methods R a n k i n g   R e s u l t s
C I F F P A 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
C I F F P G 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Table 6. Score values (without phase term).
Table 6. Score values (without phase term).
C I F F P A C I F F P G
𝚰 𝕿 = 1 0.1558 0.1451
𝚰 𝕿 = 2 0.3144 0.1096
𝚰 𝕿 = 3 0.0002 0.00002
𝚰 𝕿 = 4 0.2877 0.2263
𝚰 𝕿 = 5 0.4247 0.2001
Table 7. Ranking information.
Table 7. Ranking information.
Methods R a n k i n g   R e s u l t s
C I F F P A 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
C I F F P G 𝚰 𝕿 = 4 > 𝚰 𝕿 = 5 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 3
Table 8. Comparative analysis.
Table 8. Comparative analysis.
MethodsScore InformationRanking Information
Xu [23] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Xu and Yager [24] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Yahya, et al. [26] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Yu [31] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Lin, et al. [32] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Garg and Rani [33]0.1506, 0.5008, 0.0506, 0.3005, 0.6010 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Garg and Rani [34]0.1497, 0.4998, 0.0496, 0.2997, 0.5998 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Mahmood, et al. [35]0.1506, 0.5007, 0.0505, 0.3005, 0.6009 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
CIFFPA 0.1623 , 0.7069 , 0.0504 , 0.375 , 0.8495 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
CIFFPG 0.1386 , 0.3447 , 0.0496 , 0.2419 , 0.4003 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Table 9. Comparative analysis (without phase terms).
Table 9. Comparative analysis (without phase terms).
MethodsScore InformationRanking Information
Xu [23] 0.1504 , 0.5005 , 0.0504 , 0.3003 , 0.6006 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Xu and Yager [24] 0.1498 , 0.4999 , 0.0497 , 0.2998 , 0.5999 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Yahya, et al. [26] * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Yu [31] 0.1614 , 0.6901 , 0.0504 , 0.3687 , 0.8319 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Lin, et al. [32] 0.1394 , 0.3526 , 0.0496 , 0.2452 , 0.4097 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Garg and Rani [33]0.1502, 0.2002, 0.0001, 0.2502, 0.3003 𝚰 𝕿 = 5 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Garg and Rani [34]0.1499, 0.1999, 0.0001, 0.2499, 0.2999 𝚰 𝕿 = 5 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
Mahmood, et al. [35]0.1502, 0.2001, 0.00009, 0.2502, 0.3003 𝚰 𝕿 = 5 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
CIFFPA 0.1558 , 0.3144 , 0.0002 , 0.2877 , 0.4247 𝚰 𝕿 = 5 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 4 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 3
CIFFPG 0.1451 , 0.1096 , 0.00002 , 0.2263 , 0.2001 𝚰 𝕿 = 4 > 𝚰 𝕿 = 5 > 𝚰 𝕿 = 1 > 𝚰 𝕿 = 2 > 𝚰 𝕿 = 3
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. Frank Prioritized Aggregation Operators and WASPAS Method Based on Complex Intuitionistic Fuzzy Sets and Their Application in Multi-Attribute Decision-Making. Mathematics 2023, 11, 2058. https://doi.org/10.3390/math11092058

AMA Style

Ali Z, Mahmood T, Yang M-S. Frank Prioritized Aggregation Operators and WASPAS Method Based on Complex Intuitionistic Fuzzy Sets and Their Application in Multi-Attribute Decision-Making. Mathematics. 2023; 11(9):2058. https://doi.org/10.3390/math11092058

Chicago/Turabian Style

Ali, Zeeshan, Tahir Mahmood, and Miin-Shen Yang. 2023. "Frank Prioritized Aggregation Operators and WASPAS Method Based on Complex Intuitionistic Fuzzy Sets and Their Application in Multi-Attribute Decision-Making" Mathematics 11, no. 9: 2058. https://doi.org/10.3390/math11092058

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