WASPAS method and Aczel-Alsina aggregation operators for managing complex interval-valued intuitionistic fuzzy information and their applications in decision-making

View article
PeerJ Computer Science

Introduction

MADM strategies aims to identify the best of a few relative other options or positioning choices as per their importance as far as the assessed objective. The techniques are utilized for choosing the most acceptable other option/arrangement, because there is no such option for which all rules’ esteems are awesome. MADM strategy is the sub-part of the decision-making technique that has been used in the region of discrete fields. However, it is massively difficult to apply the MADM technique to the phenomena of fuzzy sets rather than crisp sets. To achieve this idea in the real scenario, Zadeh (1965) explored the fuzzy set (FS), which only depends on the supporting grade (SG) MCC¯¯¯¯0,1.

In facilitating that sort of situation, FS suffers from an obvious deficiency for not describing the data in the shape of yes or no, not addressing expert opinion, namely, non-SG (NSG). To conquer this imperfection, Atanassov (1986) proposed the methodology of intuitionistic FS (IFS) with an SG and NSG. The well-known prominent of IFS is as followed: 0MR¯¯¯¯+NR¯¯¯1. Interval-valued (IV) data is mostly utilized to depict the ambiguity and problematic occurrences, like the difference in temperature, the vacillation of stock cost, and the scope of circulatory strain. Besides, the IV information might be gotten from various areas or sources. For this, the IV intuitionistic FS (IVIFS), was stated by Atanassov & Gargov (1989) with SG MR¯¯¯¯LxE˜,MR¯¯¯¯UxE˜ and NSG NR¯¯¯¯LxE˜,NR¯¯¯¯UxE˜ such that 0MR¯¯¯¯UxE˜+NR¯¯¯¯UxE˜1.

Based on above discussions, we have obtained the result that the prevailing theories neglect to manage two-domination data in the shape of SG and NSG, and simultaneously neglect to survive with inconsistent and fluctuational at a provided phase of time. However, the data got from “medical research” such that the biometric and facial acknowledgment data set consistently changes with the entry of the time. Along these lines, Ramot et al. (2002) extended the scope of SG from a genuine subset to the unit circle of the complicated plane and henceforth established the principle of complex FS (CFS). The mathematical structure of SG in the circumstances of CFS is of the form MCC¯¯¯¯xE˜=MR¯¯¯¯xE˜ei2πMI¯¯xE˜ with MR¯¯¯¯xE˜,MI¯¯¯¯xE˜0,1. Since CFS restricts only up to SG and does not take into account NSG, Alkouri & Salleh (2012) produced the principle of complex IFS (CIFS) in the shape of SG MCC¯¯¯¯xE˜=MR¯¯¯¯xE˜ei2πMI¯¯¯¯xE˜ and NSG NCC¯¯¯¯xE˜=NR¯¯¯¯xE˜ei2πNI¯¯¯¯xE˜, with 0MR¯¯¯¯xE˜+NR¯¯¯¯xE˜1 and 0MI¯¯¯¯xE˜+NI¯¯¯¯xE˜1. Recently, Garg & Rani (2019a) studied the form of CIFS in the interval environment and proposed the mathematical structure of CIVIFS. Because of its strong ability in dealing with uncertain information, CIVIFS has been promoted in many ways, but the results in Aczel-Alsina operational laws still need to be enriched.

Literature Review

Under the powerful characteristic of FS, many scholars have conducted a lot of extended research. For illustration, ordered weighted averaging aggregation operators (Yager, 1988), immediate probabilities (Yager, Engemann & Filev, 1995), modeling decision-making under immediate probabilities (Engemann, Filev & Yager, 1996), mixed uncertain satisfaction (Yager, 2017), aggregation function (Durante & Ricci, 2018), deviation-based aggregation (Decký, Mesiar & Stupňanová, 2018), generalized averaging aggregation operators (Beliakov et al., 2011; Liu et al., 2016; Yang & Yao, 2021), and analysis of fuzzy research under bibliometric indicators (Merigó, Gil-Lafuente & Yager, 2015).

Due to strong data-inclusive features, IFS and IVIFS have been extended in distinct regions, including bipolar soft sets (Mahmood, 2020), analysis of image quality under measures (Hassaballah & Ghareeb, 2017), decision-making framework (Gao et al., 2021; Zeng, Hu & Llopis-Albert, 2023), distance and similarity measures (Garg & Rani, 2021; Peng, Xiaohe & Jianbo, 2021), hybrid variable approach (Liu et al., 2021; Xue, Deng & Garg, 2021; Zhang et al., 2022), construction of shadowed sets (Yang & Yao, 2021), time-series mapping (Bas, Yolcu & Egrioglu, 2021), transportation problem (Bharati, 2021), and combined compromise solution approach (Alrasheedi et al., 2021; Su et al., 2023).

Due to its dominant structure, several scholars have shown their interest in CFS and applied it to diverse regions. For convenience, cross-entropy measures (Liu, Ali & Mahmood, 2020), complex fuzzy soft sets (CFSS) (Thirunavukarasu, Suresh & Ashokkumar, 2017), IV CFSS (Selvachandran & Singh, 2018; Dai, Bi & Hu, 2019), and complex multi-fuzzy soft sets (Al-Qudah & Hassan, 2019). Further, Garg & Rani (2019a); Garg & Rani (2020a) invented the CIVIFS and the advanced aggregation operators under CIFS. Garg & Rani (2020b) modified the theory of robust and geometric aggregation operators under CIFS. Garg & Rani (2019b) proposed the methodology of aggregation operators under generalized CIFS. Ali et al. (2021) combined the principle of CIFS and soft set and explored some aggregation operators. Especially, the statistical metrics evaluated by Menger (1942), Einstein aggregation operators for IFS invented by Wang & Liu (2012), Archimedean aggregation operators for IFS stated by Xia, Xu & Zhu (2012), Hamacher aggregation operators for interval-valued IFS presented by Liu (2013), and so on.

Motivation and Main Contribution

CIVIFS theory is the modified version of the FS, IFS, IVIFS, CFS, and CIFS because of their valuable and dominant structure. Further, the theory of Aczel-Alsina is also very famous and reliable because it is the generation of the algebraic t-norm and t-conorm. Moreover, discovering the theory of aggregation operators in the presence of Aczel-Alsina information for managing CIVIF values is a very challenging task for new fuzzy scholars, because up to date no one can derive the theory of Aczel-Alsina aggregation operators for CIVIF values. Furthermore, deriving the theory of the WASPAS technique (Zavadskas et al., 2012) is also a very awkward and challenging task for fuzzy researchers.

Keeping the benefits of the above prevailing operators, the major contribution of this analysis is illustrated below:

  1. To initiate the Aczel-Alsina operational laws and their related results.

  2. To invent the principle of CIVIFAAWA, CIVIFAAOWA, CIVIFAAHA, CIVIFAAWG, CIVIFAAOWG, and CIVIFAAHG operators, and illustrated their well-known properties and results.

  3. To derive the theory of the WASPAS method for CIVIFSs.

  4. To demonstrate the MADM strategy under the invented works.

  5. To express the supremacy and dominancy of the invented works with the help of sensitive analysis and geometrical shown of the explored works.

Presentation of our analysis is implemented in the shape: Section 2 covers all the prevailing methodologies. In Section 3, we initiate the Aczel-Alsina operational laws and their related results. Section 4 produces the principle of CIVIFAAWA, CIVIFAAOWA, CIVIFAAHA, CIVIFAAWG, CIVIFAAOWG, and CIVIFAAHG operators, and illustrates their well-known properties. In Section 5, we derive the WASPAS method for CIVIFSs. In Section 6, we demonstrate the effectiveness of the MADM strategy under the invented works. The conclusion of this study is illustrated in Section 7.

Before starting the proposed work, all variables and indexes used in this study are defined in Table 1.

Table 1:
Representation of the notation used in the proposed work.
Notation meanings Notation meanings Notation Meanings
C C i j ¯ ¯ Entry of matrix M C C ¯ ¯ ¯ ¯ x E ˜ Complex Interval-valued truth grade N C C ¯ ¯ ¯ ¯ x E ˜ Complex Interval-valued falsity grade
W j Weight vector M R ¯ ¯ ¯ ¯ L x E ˜ Lower bound of real part in truth grade N R ¯ ¯ ¯ ¯ L x E ˜ Lower bound of real part in falsity grade
S i Score value M R ¯ ¯ ¯ ¯ U x E ˜ upper bound of real part in truth grade N R ¯ ¯ ¯ ¯ U x E ˜ upper bound of real part in falsity grade
°F Scaler M I ¯ ¯ ¯ ¯ L x E ˜ Lower bound of imaginary part in truth grade N I ¯ ¯ ¯ ¯ L x E ˜ Lower bound of imaginary part in falsity grade
X U ˜ Universal set M I ¯ ¯ ¯ ¯ U x E ˜ upper bound of imaginary part in truth grade N I ¯ ¯ ¯ ¯ U x E ˜ upper bound of imaginary part in falsity grade
R C ¯ ¯ ¯ ¯ C x E ˜ Complex Interval-valued neutral grade R R ¯ ¯ ¯ ¯ L x E ˜ Lower bound of real part in neutral grade R I ¯ ¯ ¯ ¯ L x E ˜ Lower bound of imaginary part in neutral grade
x E ˜ Element of universal set R R ¯ ¯ ¯ ¯ U x E ˜ upper bound of real part in neutral grade R I ¯ ¯ ¯ ¯ U x E ˜ upper bound of imaginary part in neutral grade
DOI: 10.7717/peerjcs.1362/table-1

Preliminaries

Here, we utilized the weighted sum model (WSM) and the weighted product model (WPM) to review the concept of the WASPAS method (Zavadskas et al., 2012). Moreover, the extended WASPAS method was derived from Zavadskas et al. (2013). Some valuable and effective steps of the WASPAS method are listed below:

Step 1: The input data of the technique is represented in the form of a matrix of alternatives and attributes, which is based on the data received from the expert.

Step 2: Normalize the decision matrix in the presence of the information in Eq. (1): CCij¯¯=CCij¯¯maxiCCij¯¯ifiBminiCCij¯¯CCij¯¯ifiC

where B represented the benefit types of data and C stated the cost type of criteria.

Step 3: Compute WSM and WPM of each alternative: WSMi=j=1mWjCCij¯¯ WPMi=j=1mCCij¯¯Wj

Step 4: Calculate the score value by using the theory of WSM and WPM information referring to the following way: Si=°FWSMi+1°FWPMi.There exist some special cases: when °F = 1 in Eq. (4), Si = WSMi; when °F = 0 , Si = WPMi.

Step 5: Deriving the best preference by the score value in Step 4.

Next, the algebraic theories of some prevailing principles like CIVIFSs, the concept of Aczel-Alsina t-norm and t-conorm will be discussed. Of note, the notation XU˜, stated for universal sets.

Definition 1:(Garg & Rani, 2019a) The mathematical structure of CIVIFS CC¯¯ is shown in the shape of: CC¯¯=MCC¯¯¯¯xE˜,NCC¯¯¯¯xE˜:xE˜XU˜where the term MCC¯¯¯¯xE˜=MR¯¯¯¯LxE˜,MR¯¯¯¯UxE˜ei2πMI¯¯¯¯LxE˜,MI¯¯¯¯UxE˜ and NCC¯¯¯¯xE˜=NR¯¯¯¯LxE˜,NR¯¯¯¯UxE˜ei2πNI¯¯¯¯LxE˜,NI¯¯¯¯UxE˜ indicate the TD and FD with 0MR¯¯¯¯UxE˜+NR¯¯¯¯UxE˜1 and 0MI¯¯¯¯UxE˜+NI¯¯¯¯UxE˜1. Moreover, RCC¯¯¯¯xE˜=RR¯¯¯¯LxE˜,RR¯¯¯¯UxE˜ei2πRI¯¯¯¯LxE˜,RI¯¯¯¯UxE˜=1MR¯¯¯¯LxE˜+NR¯¯¯¯LxE˜,1MR¯¯¯¯UxE˜+NR¯¯¯¯UxE˜ei2π1MI¯¯¯¯LxE˜+NI¯¯¯¯LxE˜,1MI¯¯¯¯UxE˜+NI¯¯¯¯UxE˜ states the neutral grade, and

C C j ¯ ¯ = M R j ¯ ¯ ¯ ¯ L x E ˜ , M R j ¯ ¯ ¯ ¯ U x E ˜ e i 2 π M I j ¯ ¯ ¯ ¯ L x E ˜ , M I j ¯ ¯ ¯ ¯ U x E ˜ ,

NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜ denotes the complex interval-valued intuitionistic fuzzy number (CIVIFN).

Definition 2:(Garg & Rani, 2019a) Suppose there are two CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2, then: CC1¯¯CC2¯¯=MR1¯¯¯¯L+MR2¯¯¯¯LMR1¯¯¯¯LMR2¯¯¯¯L,MR1¯¯¯¯U+MR2¯¯¯¯UMR1¯¯¯¯UMR2¯¯¯¯Uei2πMI1¯¯¯¯L+MI2¯¯¯¯LMI1¯¯¯¯LMI2¯¯¯¯L,MI1¯¯¯¯U+MI2¯¯¯¯UMI1¯¯¯¯UMI2¯¯¯¯U,NR1¯¯¯¯LNR2¯¯¯¯L,NR1¯¯¯¯UNR2¯¯¯¯Uei2πNI1¯¯¯¯LNI2¯¯¯¯L,NI1¯¯¯¯UNI2¯¯¯¯U CC1¯¯CC2¯¯=MR1¯¯¯¯LMR2¯¯¯¯L,MR1¯¯¯¯UMR2¯¯¯¯Uei2πMI1¯¯¯¯LMI2¯¯¯¯L,MI1¯¯¯¯UMI2¯¯¯¯U,NR1¯¯¯¯L+NR2¯¯¯¯LNR1¯¯¯¯LNR2¯¯¯¯L,NR1¯¯¯¯U+NR2¯¯¯¯UNR1¯¯¯¯UNR2¯¯¯¯Uei2πNI1¯¯¯¯L+NI2¯¯¯¯LNI1¯¯¯¯LNI2¯¯¯¯L,NI1¯¯¯¯U+NI2¯¯¯¯UNI1¯¯¯¯UNI2¯¯¯¯U ψS¯¯CC1¯¯=11MR1¯¯¯¯LψS¯¯,11MR1¯¯¯¯UψS¯¯ei2π11MI1¯¯¯¯LψS¯¯,11MI1¯¯¯¯UψS¯¯,NR1¯¯¯¯LψS¯,NR1¯¯¯¯UψS¯ei2πNI1¯¯¯¯LψS¯¯,NI1¯¯¯¯UψS¯¯ CC1¯¯ψS¯¯=MR1¯¯¯¯LψS¯¯,MR1¯¯¯¯UψS¯¯ei2πMI1¯¯¯¯LψS¯¯,MI1¯¯¯¯UψS¯¯,11NR1¯¯¯¯LψS¯¯,11NR1¯¯¯¯UψS¯¯ei2π11NI1¯¯¯¯LψS¯¯,11NI1¯¯¯¯UψS¯¯

Definition 3:(Garg & Rani, 2019b) By taking any two CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, then the score value (SV) and accuracy value (AV) are determined by the following formulas: SSV¯¯CC1¯¯=14MR1¯¯¯¯L+MI1¯¯¯¯LNR1¯¯¯¯LNI1¯¯¯¯L+MR1¯¯¯¯U+MI1¯¯¯¯UNR1¯¯¯¯UNI1¯¯¯¯U, HAV¯¯CC1¯¯=14MR1¯¯¯¯L+MI1¯¯¯¯L+NR1¯¯¯¯L+NI1¯¯¯¯L+MR1¯¯¯¯U+MI1¯¯¯¯U+NR1¯¯¯¯U+NI1¯¯¯¯UDefinition 4:(Garg & Rani, 2019a) By taking any two CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, j = 1, 2, then

  1. If SSV¯¯CC1¯¯>SSV¯¯CC2¯¯, then CC1¯¯>CC2¯¯;

  2. If SSV¯¯CC1¯¯<SSV¯¯CC2¯¯, then CC1¯¯<CC2¯¯;

  3. If SSV¯¯CC1¯¯=SSV¯¯CC2¯¯, then

  4. If HAV¯¯CC1¯¯>HAV¯¯CC2¯¯, then CC1¯¯>CC2¯¯;

  5. If HAV¯¯CC1¯¯<HAV¯¯CC2¯¯, then CC1¯¯<CC2¯¯;

  6. If HAV¯¯CC1¯¯=HAV¯¯CC2¯¯, then CC1¯¯=CC2¯¯.

Definition 5:(Klement & Mesiar, 1997) Suppose TTN¯¯:0,1×0,10,1 states a TN, then

  1. TTN¯¯xE˜,xE˜=TTN¯¯xE˜,xE˜,xE˜,xE˜0,1;

  2. TTN¯¯xE˜,xE˜TTN¯¯xE˜,xE˜, if xE˜xE˜;

  3. TTN¯¯xE˜,TTN¯¯xE˜,xE˜=TTN¯¯TTN¯¯xE˜,xE˜,xE˜;

  4. TTN¯¯xE˜,1=xE˜.

Definition 6:(Klement & Mesiar, 1997) Suppose STN¯¯:0,1×0,10,1 states a TCN, then

  1. STN¯¯xE˜,xE˜=STN¯¯xE˜,xE˜,xE˜,xE˜0,1;

  2. STN¯¯xE˜,xE˜STN¯¯xE˜,xE˜, if xE˜xE˜;

  3. STN¯¯xE˜,STN¯¯xE˜,xE˜=STN¯¯STN¯¯xE˜,xE˜,xE˜;

  4. STN¯¯xE˜,0=xE˜.

Definition 7:(Aczél & Alsina, 1982) Suppose TTN¯¯Aψψ0, states the Aczel-Alsina TN, its expression is listed as follows: TTN¯¯AψxE˜,xE˜=TTN¯¯xE˜,xE˜ifψ=0minxE˜,xE˜ifψ=elogxE˜ψ+logxE˜ψ1ψotherwise

Definition 8:(Aczél & Alsina, 1982) Suppose STN¯¯Aψψ0, states the Aczel-Alsina TCN, the detailed expression is shown as follows: STN¯¯AψxE˜,xE˜=STN¯¯xE˜,xE˜ifψ=0maxxE˜,xE˜ifψ=1elog1xE˜ψ+log1xE˜ψ1ψotherwise

Aczel-Alsina Operational laws for CIVIFSs

This section mainly introduces the Aczel-Alsina operational laws for CIVIFS that keeps the benefits of the IV information and explores these elementary properties.

Definition 9: For CIVIFNs CCj¯¯=MRj¯¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2, then CC1¯¯CC2¯¯=STN¯¯AψMR¯1¯¯¯L,MR¯2¯¯¯L,STN¯¯AψMR¯1¯¯¯U,MR¯2¯¯¯Uei2πSTN¯¯AψMI¯1¯¯¯L,MI¯2¯¯¯L,STN¯¯AψMI¯1¯¯¯U,MI¯2¯¯¯U,TTN¯¯AψNR¯1¯¯¯L,NR¯2¯¯¯L,TTN¯¯AψNR¯1¯¯¯U,NR¯2¯¯¯Uei2πTTN¯¯AψNI¯1¯¯¯L,NI¯2¯¯¯L,TTN¯¯AψNI¯1¯¯¯U,NI¯2¯¯¯U CC1¯¯CC2¯¯=TTN¯¯AψMR¯1¯¯¯L,MR¯2¯¯¯L,TTN¯¯AψMR¯1¯¯¯U,MR¯2¯¯¯Uei2πTTN¯¯AψMI¯1¯¯¯L,MI¯2¯¯¯L,TTN¯¯AψMI¯1¯¯¯U,MI¯2¯¯¯U,STN¯¯AψNR¯1¯¯¯L,NR¯2¯¯¯L,STN¯¯AψNR¯1¯¯¯U,NR¯2¯¯¯Uei2πSTN¯¯AψNI¯1¯¯¯L,NI¯2¯¯¯L,STN¯¯AψNI¯1¯¯¯U,NI¯2¯¯¯UDefinition 10: For any two CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2, then the following mathematical formulas hold: CC1¯¯CC2¯¯=1elog1MR¯1¯¯¯Lψ+log1MR¯2¯¯¯Lψ1ψ,1elog1MR¯1¯¯¯Uψ+log1MR¯2¯¯¯Uψ1ψei2π1elog1MR¯1¯¯¯Lψ+log1MR¯2¯¯¯Lψ1ψ,1elog1MR¯1¯¯¯Uψ+log1MR¯2¯¯¯Uψ1ψ,elogNR¯1¯¯¯Lψ+logNR¯2¯¯¯Lψ1ψ,elogNR¯1¯¯¯Uψ+logNR¯2¯¯¯Uψ1ψei2πelogNI¯1¯¯¯Lψ+logNI¯2¯¯¯Lψ1ψ,elogNI¯1¯¯¯Uψ+logNI¯2¯¯¯Uψ1ψ CC1¯¯CC2¯¯=elogMR¯1¯¯¯Lψ+logMR¯2¯¯¯Lψ1ψ,elogMR¯1¯¯¯Uψ+logMR¯2¯¯¯Uψ1ψei2πelogMI¯1¯¯¯Lψ+logMI¯2¯¯¯Lψ1ψ,elogMI¯1¯¯¯Uψ+logMI¯2¯¯¯Uψ1ψ,1elog1NR¯1¯¯¯Lψ+log1NR¯2¯¯¯Lψ1ψ,1elog1NR¯1¯¯¯Uψ+log1NR¯2¯¯¯Uψ1ψei2π1elog1NR¯1¯¯¯Lψ+log1NR¯2¯¯¯Lψ1ψ,1elog1NR¯1¯¯¯Uψ+log1NR¯2¯¯¯Uψ1ψ θS¯CC1¯¯¯=1eθS¯¯log1MR¯1¯¯¯Lψ1ψ,1eθS¯¯log1MR¯1¯¯¯Uψ1ψei2π1eθS¯¯log1MI¯1¯¯¯Lψ1ψ,1eθS¯¯log1MI¯1¯¯¯Uψ1ψ,eθS¯¯logNR¯1¯¯¯Lψ1ψ,eθS¯¯logNR¯1¯¯¯Uψ1ψei2πeθS¯¯logNI¯1¯¯¯Lψ1ψ,eθS¯¯logNI¯1¯¯¯Uψ1ψ CC1¯¯θS¯¯=eθS¯¯logMR¯1¯¯¯Lψ1ψ,eθS¯¯logMR¯1¯¯¯Uψ1ψei2πeθS¯¯logMI¯1¯¯¯Lψ1ψ,eθS¯¯logMI¯1¯¯¯Uψ1ψ,1eθS¯¯log1NR1¯¯¯¯Lψ1ψ,1eθS¯¯log1NR1¯¯¯¯Uψ1ψei2π1eθS¯¯log1NI1¯¯¯¯Lψ1ψ,1eθS¯¯log1NI1¯¯¯¯Uψ1ψ

Theorem 1: For any two CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2, then we can derive the subsequent mathematic properties:

  1. CC1¯¯CC2¯¯=CC2¯¯CC1¯¯;

  2. CC1¯¯CC2¯¯=CC2¯¯CC1¯¯;

  3. θS¯¯CC1¯¯CC2¯¯=θ¯SCC1¯¯¯θS¯¯CC2¯¯;

  4. θS1¯+θS1¯CC1¯¯=θS1¯CC1¯¯θS2¯CC1¯¯;

  5. CC1¯¯CC2¯¯θS¯=CC1¯¯θS¯CC2¯¯θS¯;

  6. CC1¯¯θS1¯¯CC1¯¯θS1¯¯=CC1¯¯θS1¯¯+θS2¯¯.

Proof: Next we present the proofs of properties (1), (3) and (5), as we can similarly complete the proofs of properties (2), (4) and (6).

  1. On the basis of Eqs. (16) to (19), then we calculate CC1¯¯CC2¯¯: CC1¯¯CC2¯¯=1elog1MR1¯¯¯¯Lψ+log1MR2¯¯¯¯Lψ1ψ,1elog1MR1¯¯¯¯Uψ+log1MR2¯¯¯¯Uψ1ψei2π1elog1MR1¯¯¯¯Lψ+log1MR2¯¯¯¯Lψ1ψ,1elog1MR1¯¯¯¯Uψ+log1MR2¯¯¯¯Uψ1ψ,elogNR1¯¯¯¯Lψ+logNR2¯¯Lψ1ψ,elogNR1¯¯¯¯Uψ+logNR2¯¯Uψ1ψei2πelogNI1¯¯¯¯Lψ+logNI2¯¯¯¯Lψ1ψ,elogNI1¯¯¯¯Uψ+logNI2¯¯¯¯Uψ1ψ

= 1 e log 1 M R 2 ¯ ¯ ¯ ¯ L ψ + log 1 M R 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e log 1 M R 2 ¯ ¯ ¯ ¯ U ψ + log 1 M R 1 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π 1 e log 1 M R 2 ¯ ¯ ¯ ¯ L ψ + log 1 M R 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e log 1 M R 2 ¯ ¯ ¯ ¯ U ψ + log 1 M R 1 ¯ ¯ ¯ ¯ U ψ 1 ψ , e log N R 2 ¯ ¯ L ψ + log N R 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , e log N R 2 ¯ ¯ U ψ + log N R 1 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π e log N I 2 ¯ ¯ ¯ ¯ L ψ + log N I 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , e log N I 2 ¯ ¯ ¯ ¯ U ψ + log N I 1 ¯ ¯ ¯ ¯ U ψ 1 ψ = C C 2 ¯ ¯ C C 1 ¯ ¯ .

Hence, we investigated CC1¯¯CC2¯¯=CC2¯¯CC1¯¯, the property (1) is proved.

  1. Suppose θS¯¯CC1¯¯CC2¯¯, then θS¯¯CC1¯¯CC2¯¯=θS¯¯1elog1MR1¯¯¯¯Lψ+log1MR2¯¯¯¯Lψ1ψ,1elog1MR1¯¯¯¯Uψ+log1MR2¯¯¯¯Uψ1ψei2π1elog1MR1¯¯¯¯Lψ+log1MR2¯¯¯¯Lψ1ψ,1elog1MR1¯¯¯¯Uψ+log1MR2¯¯¯¯Uψ1ψ,elogNR1¯¯¯¯Lψ+logNR2¯¯¯¯Lψ1ψ,elogNR1¯¯¯¯Uψ+logNR2¯¯¯¯Uψ1ψei2πelogNI1¯¯¯¯Lψ+logNI2¯¯¯¯Lψ1ψ,elogNI1¯¯¯¯Uψ+logNI2¯¯¯¯Uψ1ψ

= 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ L ψ + log 1 M R 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ U ψ + log 1 M R 2 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ L ψ + log 1 M R 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ U ψ + log 1 M R 2 ¯ ¯ ¯ ¯ U ψ 1 ψ , e θ S ¯ ¯ log N R 1 ¯ ¯ ¯ ¯ L ψ + log N R 2 ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N R 1 ¯ ¯ ¯ ¯ U ψ + log N R 2 ¯ ¯ U ψ 1 ψ e i 2 π e θ S ¯ ¯ log N I 1 ¯ ¯ ¯ ¯ L ψ + log N I 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N I 1 ¯ ¯ ¯ ¯ U ψ + log N I 2 ¯ ¯ ¯ ¯ U ψ 1 ψ = 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M R 1 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π 1 e θ S ¯ ¯ log 1 M I 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M I 1 ¯ ¯ ¯ ¯ U ψ 1 ψ , e θ S ¯ ¯ log N R 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N R 1 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π e θ S ¯ ¯ log N I 1 ¯ ¯ ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N I 1 ¯ ¯ ¯ ¯ U ψ 1 ψ 1 e θ S ¯ ¯ log 1 M R 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M R 2 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π 1 e θ S ¯ ¯ log 1 M I 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , 1 e θ S ¯ ¯ log 1 M I 2 ¯ ¯ ¯ ¯ U ψ 1 ψ , e θ S ¯ ¯ log N R 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N R 2 ¯ ¯ ¯ ¯ U ψ 1 ψ e i 2 π e θ S ¯ ¯ log N I 2 ¯ ¯ ¯ ¯ L ψ 1 ψ , e θ S ¯ ¯ log N I 2 ¯ ¯ ¯ ¯ U ψ 1 ψ = θ S ¯ ¯ C C 1 ¯ ¯ θ S ¯ ¯ C C 2 ¯ ¯ .

Hence, θS¯CC1¯¯CC2¯¯=θS¯¯CC1¯¯θS¯¯CC2¯¯, the property (3) is proved.

  1. Suppose CC1¯¯CC2¯¯θS¯¯, then CC1¯¯CC2¯¯θS¯¯=elogMR1¯¯¯¯Lψ+logMR2¯¯¯¯Lψ1ψ,elogMR1¯¯¯¯Uψ+logMR2¯¯¯¯Uψ1ψei2πelogMI1¯¯¯¯Lψ+logMI2¯¯¯¯Lψ1ψ,elogMI1¯¯¯¯Uψ+logMI2¯¯¯¯Uψ1ψ,1elog1NR1¯¯¯¯Lψ+log1NR2¯¯¯¯Lψ1ψ,1elog1NR1¯¯¯¯Uψ+log1NR2¯¯¯¯Uψ1ψei2π1elog1NR1¯¯¯¯Lψ+log1NR2¯¯¯¯Lψ1ψ,1elog1NR1¯¯¯¯Uψ+log1NR2¯¯¯¯Uψ1ψθS¯¯ =eθS¯¯logMR1¯¯¯¯Lψ1ψ,eθS¯¯logMR1¯¯¯¯Uψ1ψei2πeθS¯¯logMI1¯¯¯¯Lψ1ψ,eθS¯¯logMI1¯¯¯¯Uψ1ψ,1eθS¯¯log1NR1¯¯¯¯Lψ1ψ,1eθS¯¯log1NR1¯¯¯¯Uψ1ψei2π1eθS¯¯log1NI1¯¯¯¯Lψ1ψ,1eθS¯¯log1NI1¯¯¯¯Uψ1ψ eθS¯¯logMR2¯¯¯¯Lψ1ψ,eθS¯¯logMR2¯¯¯¯Uψ1ψei2πeθS¯¯logMI2¯¯¯¯Lψ1ψ,eθS¯¯logMI2¯¯¯¯Uψ1ψ,1eθS¯¯log1NR2¯¯¯¯Lψ1ψ,1eθS¯¯log1NR2¯¯¯¯Uψ1ψei2π1eθS¯¯log1NI2¯¯¯¯Lψ1ψ,1eθS¯¯log1NI2¯¯¯¯Uψ1ψ =CC1¯¯θS¯¯CC2¯¯θS¯¯

Hence, CC1¯¯CC2¯¯θS¯¯=CC1¯¯θS¯¯CC2¯¯θS¯¯, and the property (5) is proved.

Aczel-Alsina Aggregation Operators for CIVIFS

This section proposes a group of aggregation operators by utilizing the Aczel-Alsina operational laws for CIVIFSs such that CIVIFAAWA, CIVIFAAOWA, CIVIFAAHA, CIVIFAAWG, CIVIFAAOWG, and CIVIFAAHG operators, and illustrates their well-known properties.

Definition 11: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then the CIVIFAAWA operator is interpreted as: CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯=W1¯¯CC1¯¯W2¯¯CC2¯¯Wn¯¯CCn¯¯=j=1nWj¯¯CCj¯¯where W¯¯=W¯¯1,W¯¯2,,W¯¯nTmeans the weight of Cj, with a rule j=1nW¯¯j=1.

Theorem 2: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then by using Eq. (20), we elaborate CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯ =1ej=1nWj¯¯log1MRj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MRj¯¯¯¯Uψ1ψei2π1ej=1nWj¯¯log1MIj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MIj¯¯¯¯Uψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Uψ1ψei2πej=1nWj¯¯logNIj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNIj¯¯¯¯Uψ1ψ

Furthermore, we derive the theory of idempotency, boundedness, and monotonicity for the information in Eq. (21).

Property 1: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯=C¯¯, then the detailed expression is shown as: CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯=C¯¯Proof: Suppose CCj¯¯=C¯¯=MR¯¯¯¯L,MR¯¯¯¯Uei2πMI¯¯¯¯L,MI¯¯¯¯U,NR¯¯¯¯L,NR¯¯¯¯Uei2πNI¯¯¯¯L,NI¯¯¯¯U, then CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯=1ej=1nWj¯¯log1MRj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MRj¯¯¯¯Uψ1ψei2π1ej=1nWj¯¯log1MIj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MIj¯¯¯¯Uψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Uψ1ψei2πej=1nWj¯¯logNIj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNIj¯¯¯¯Uψ1ψ =1elog1MR¯¯¯¯Lψ1ψ,1elog1MR¯¯¯¯Uψ1ψei2π1elog1MI¯¯¯¯Lψ1ψ,1elog1MI¯¯¯¯Uψ1ψ,elogNR¯¯¯¯Lψ1ψ,elogNR¯¯¯¯Uψ1ψei2πelogNI¯¯¯¯Lψ1ψ,elogNI¯¯¯¯Uψ1ψ =1elog1MR¯¯¯¯L,1elog1MR¯¯¯¯Uei2π1elog1MI¯¯¯¯L,1elog1MI¯¯¯¯U,elogNR¯¯¯¯L,elogNR¯¯¯¯Uei2πelogNI¯¯¯¯L,elogNI¯¯¯¯U =MR¯¯¯¯L,MR¯¯¯¯Uei2πMI¯¯¯¯L,MI¯¯¯¯U,NR¯¯¯¯L,NR¯¯¯¯Uei2πNI¯¯¯¯L,NI¯¯¯¯U.Property 2: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if C¯¯=minjMRj¯¯¯¯L,minjMRj¯¯¯¯Uei2πminjMIj¯¯¯¯L,minjMIj¯¯¯¯U,

maxjNRj¯¯¯¯L,maxjNRj¯¯¯¯Uei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and C¯¯+=maxjMRj¯¯¯¯L,maxjMRj¯¯¯¯Uei2πmaxjMIj¯¯¯¯L,maxjMIj¯¯¯¯U,minjNRj¯¯¯¯L,minjNRj¯¯¯¯U

ei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, then C¯¯CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯C¯¯+Proof: Suppose CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, if

C ¯ ¯ = min j M R j ¯ ¯ ¯ ¯ L , min j M R j ¯ ¯ ¯ ¯ U e i 2 π min j M I j ¯ ¯ ¯ ¯ L , min j M I j ¯ ¯ ¯ ¯ U , max j N R j ¯ ¯ ¯ ¯ L , max j N R j ¯ ¯ ¯ ¯ U

ei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and

C ¯ ¯ + = max j M R j ¯ ¯ ¯ ¯ L , max j M R j ¯ ¯ ¯ ¯ U e i 2 π max j M I j ¯ ¯ ¯ ¯ L , max j M I j ¯ ¯ ¯ ¯ U , min j N R j ¯ ¯ ¯ ¯ L , min j N R j ¯ ¯ ¯ ¯ U

ei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, by using inequality, we have 1ej=1nWj¯¯log1MRj¯¯¯¯Lψ1ψ1ej=1nWj¯¯log1MRj¯¯¯¯Lψ1ψ1ej=1nWj¯¯log1MRj¯¯¯¯+Lψ1ψ 1ej=1nWj¯¯log1MIj¯¯¯¯Lψ1ψ1ej=1nWj¯¯log1MIj¯¯¯¯Lψ1ψ1ej=1nWj¯¯log1MIj¯¯¯¯+Lψ1ψ ej=1nWj¯¯logMRj¯¯¯¯Lψ1ψej=1nWj¯¯logMRj¯¯¯¯Lψ1ψej=1nWj¯¯logMRj¯¯¯¯+Lψ1ψ ej=1nWj¯¯logMIj¯¯¯¯Lψ1ψej=1nWj¯¯logMIj¯¯¯¯Lψ1ψej=1nWj¯¯logMIj¯¯¯¯+Lψ1ψSimilarly, for the upper part, we have ej=1nWj¯¯logMIj¯¯¯¯Uψ1ψej=1nWj¯¯logMIj¯¯¯¯Uψ1ψej=1nWj¯¯logMIj¯¯¯¯+Uψ1ψ

Therefore, we obtained C¯¯CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯C+¯¯.Property 3: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, if CCj¯¯CCj¯¯, then CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯Definition 12: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then the CIVIFAAOWA operator is invented by: CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯=W1¯¯CCφ1¯¯W2¯¯CCφ2¯¯Wn¯¯CCφn¯¯=j=1nWj¯¯CCφj¯¯where W¯¯=W1¯¯,W2¯¯,,Wn¯¯T indicates the weight of Cj, with j=1nWj¯¯=1, with parameter φ1,φ2,,φn based on CCφj¯¯CCφj1¯¯.

Theorem 2: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then by using Eq. (25), we elaborate CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯=1ej=1nWj¯¯log1MRφj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MRφj¯¯¯¯Uψ1ψei2π1ej=1nWj¯¯log1MIφj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MIφj¯¯¯¯Uψ1ψ,ej=1nWj¯¯logNRφj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNRφj¯¯¯¯Uψ1ψei2πej=1nWj¯¯logNIφj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNIφj¯¯¯¯Uψ1ψIdempotency-Property 4: By taking CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯=C¯¯, then CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯=C¯¯Monotonicity-Property 5: By taking CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if C¯¯=minjMRj¯¯¯¯L,minjMRj¯¯¯¯Uei2πminjMIj¯¯¯¯L,minjMIj¯¯¯¯U,

maxjNRj¯¯¯¯L,maxjNRj¯¯¯¯Uei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and

C¯¯+=maxjMRj¯¯¯¯L,maxjMRj¯¯¯¯Uei2πmaxjMIj¯¯¯¯L,maxjMIj¯¯¯¯U,

minjNRj¯¯¯¯L,minjNRj¯¯¯¯Uei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, then C¯¯CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯C¯¯+Boundedness-Property 6: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯CCj¯¯, then CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯CIVIFAAOWACC1¯¯,CC2¯¯,,CCn¯¯Definition 13: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then the CIVIFAAHA operator is invented by: CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯=W1¯¯CCφ1̇¯¯W2¯¯CCφ2̇¯¯Wn¯¯CCφṅ¯¯=j=1nWj¯¯CCφj̇¯¯Theorem 3: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then by using Eq. (30), we elaborate CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯=1ej=1nWj¯¯log1MRφj¯¯̇¯¯Lψ1ψ,1ej=1nWj¯¯log1MRφj¯¯̇¯¯Uψ1ψei2π1ej=1nWj¯¯log1MIφj¯¯̇¯¯Lψ1ψ,1ej=1nWj¯¯log1MIφj¯¯̇¯¯Uψ1ψ,ej=1nWj¯¯logNRφj¯¯̇¯¯Lψ1ψ,ej=1nWj¯¯logNRφj¯¯̇¯¯Uψ1ψei2πej=1nWj¯¯logNIφj¯¯̇¯¯Lψ1ψ,ej=1nWj¯¯logNIφj¯¯̇¯¯Uψ1ψIdempotency-Property 7: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯=C¯¯, then CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯=C¯¯Monotonicity-Property 8: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, if C¯¯=minjMRj¯¯¯¯L,minjMRj¯¯¯¯Uei2πminjMIj¯¯¯¯L,minjMIj¯¯¯¯U, maxjNRj¯¯¯¯L,maxjNRj¯¯¯¯Uei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and

C¯¯+=maxjMRj¯¯¯¯L,maxjMRj¯¯¯¯Uei2πmaxjMIj¯¯¯¯L,maxjMIj¯¯¯¯U, minjNRj¯¯¯¯L,minjNRj¯¯¯¯Uei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, then C¯¯CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯C¯¯+Boundedness-Property 9: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯CCj¯¯, then CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯CIVIFAAHACC1¯¯,CC2¯¯,,CCn¯¯Definition 14: By taking CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, then the CIVIFAAWG operator is interpreted as: CIVIFAAWGCC1¯¯,CC2¯¯,,CCn¯¯=CC1¯¯W1¯¯CC2¯¯W2¯¯CCn¯¯Wn¯¯=j=1nCCj¯¯Wj¯¯Theorem 4: By taking CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜, then by using Eq. (35), we elaborate CIVIFAAWGCC1¯¯,CC2¯¯,,CCn¯¯=ej=1nlogMRj¯¯¯¯LψWj¯¯1ψ,ej=1nlogMRj¯¯¯¯UψWj¯¯1ψei2πej=1nlogMIj¯¯¯¯LψWj¯¯1ψ,ej=1nlogMIj¯¯¯¯UψWj¯¯1ψ,1ej=1nlog1NRj¯¯¯¯LψWj¯¯1ψ,1ej=1nlog1NRj¯¯¯¯UψWj¯¯1ψei2π1ej=1nlog1NIj¯¯¯¯LψWj¯¯1ψ,1ej=1nlog1NIj¯¯¯¯UψWj¯¯1ψDefinition 15: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then the CIVIFAAOWG operator is interpreted as: CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯=CCφ1¯¯W1¯¯CCφ2¯¯W2¯¯CCφn¯Wn¯¯=j=1nCCφj¯¯Wj¯¯where W¯¯=W¯¯1,W¯¯2,,W¯¯nT indicates the weight of Cj, with a rule j=1nW¯¯j=1, with parameter φ1,φ2,,φn based on CCφj¯¯CCφj1¯¯.

Theorem 5: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then we elaborate CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯=ej=1nlogMRφj¯¯LψWj¯¯1ψ,ej=1nlogMRφj¯¯UψWj¯¯1ψei2πej=1nlogMIφj¯¯LψWj¯¯1ψ,ej=1nlogMIφj¯¯UψWj¯¯1ψ,1ej=1nlog1NRφj¯¯LψWj¯¯1ψ,1ej=1nlog1NRφj¯¯UψWj¯¯1ψei2π1ej=1nlog1NIφj¯¯LψWj¯¯1ψ,1ej=1nlog1NIφj¯¯UψWj¯¯1ψIdempotency-Property 10: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯=C¯¯, then CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯=C¯¯Monotonicity-Property 11: By taking CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if

C ¯ ¯ = min j M R j ¯ ¯ ¯ ¯ L , min j M R j ¯ ¯ ¯ ¯ U e i 2 π min j M I j ¯ ¯ ¯ ¯ L , min j M I j ¯ ¯ ¯ ¯ U , max j N R j ¯ ¯ ¯ ¯ L , max j N R j ¯ ¯ ¯ ¯ U

ei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and C¯¯+=maxjMRj¯¯¯¯L,maxjMRj¯¯¯¯U

ei2πmaxjMIj¯¯¯¯L,maxjMIj¯¯¯¯U,minjNRj¯¯¯¯L,minjNRj¯¯¯¯Uei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, then C¯¯CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯C¯¯+Boundedness-Property 12: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯CCj¯¯, then CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯CIVIFAAOWGCC1¯¯,CC2¯¯,,CCn¯¯Definition 16: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then the CIVIFAAHG operator is shown as: CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯=CCφ1̇¯¯W1¯¯CCφ2̇¯¯W2¯¯CCφṅ¯¯Wn¯¯=j=1nCCφj̇¯¯Wj¯¯where W¯¯=W1¯¯,W2¯¯,,Wn¯¯T indicates the weight of Cj, with a rule j=1nWj¯¯=1, with parameter φ1,φ2,,φn based on CCφj̇¯¯CCφj1̇¯¯. Additionally, CCφj̇¯¯=nWj¯¯CCφj̇¯¯ with j=1nWj¯¯=1.

Theorem 6: For CIVIFNs CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,,n, then by using Eq. (42)), we elaborate CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯=ej=1nlogMRφj¯¯̇¯¯LψWj¯¯1ψ,ej=1nlogMRφj¯¯̇¯¯UψWj¯¯1ψei2πej=1nlogMIφj¯¯̇¯¯LψWj¯¯1ψ,ej=1nlogMIφj¯¯̇¯¯UψWj¯¯1ψ,1ej=1nlog1NRφj¯¯̇¯¯LψWj¯¯1ψ,1ej=1nlog1NRφj¯¯̇¯¯UψWj¯¯1ψei2π1ej=1nlog1NIφj¯¯̇¯¯LψWj¯¯1ψ,1ej=1nlog1NIφj¯¯̇¯¯UψWj¯¯1ψ

Idempotency-Property 13: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯=C¯¯, then CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯=C¯¯

Monotonicity-Property 14: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜ , j = 1, 2, …, n, if C¯¯=minjMRj¯¯¯¯L,minjMRj¯¯¯¯Uei2πminjMIj¯¯¯¯L,minjMIj¯¯¯¯U,

maxjNRj¯¯¯¯L,maxjNRj¯¯¯¯Uei2πmaxjNIj¯¯¯¯L,maxjNIj¯¯¯¯U and

C¯¯+=maxjMRj¯¯¯¯L,maxjMRj¯¯¯¯Uei2πmaxjMIj¯¯¯¯L,maxjMIj¯¯¯¯U,

minjNRj¯¯¯¯L,minjNRj¯¯¯¯Uei2πminjNIj¯¯¯¯L,minjNIj¯¯¯¯U, then C¯¯CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯C¯¯+Boundedness-Property 15: By taking CIVIFNs

CCj¯¯=MRj¯¯¯¯LxE˜,MRj¯¯¯¯UxE˜ei2πMIj¯¯¯¯LxE˜,MIj¯¯¯¯UxE˜,NRj¯¯¯¯LxE˜,NRj¯¯¯¯UxE˜ei2πNIj¯¯¯¯LxE˜,NIj¯¯¯¯UxE˜,j=1,2,,n, if CCj¯¯CCj¯¯, then CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯CIVIFAAHGCC1¯¯,CC2¯¯,,CCn¯¯

WASPAS Method for CIVIFSs

The main theme of this section is to illustrate the WASPAS method for CIVIFSs and verify the validity of the proposed method with the help of some numerical examples.

Some valuable and effective steps of the WASPAS method are listed below:

Step 1: The input data of the technique is represented in the form of a matrix of alternatives and attributes, which is based on the data received from the expert.

Step 2: Further, we normalize the information in decision matrix by using the below theory: CCoj¯¯=maxjMRoj¯¯¯¯LxE˜,maxjMRoj¯¯¯¯UxE˜ei2πmaxjMIoj¯¯¯¯LxE˜,maxjMIoj¯¯¯¯UxE˜,minjNR0j¯¯¯¯LxE˜,minjNR0j¯¯¯¯UxE˜ei2πminjNI0j¯¯¯¯LxE˜,minjNI0j¯¯¯¯UxE˜where the data in Eq. (48) is used for benefit types of data, such as CCij¯¯/=0otherwiseMRij¯¯¯¯L1+MRoj¯¯¯¯L¯MRij¯¯¯¯LMRoj¯¯¯¯L,MRij¯¯¯¯UMRoj¯¯¯¯U,MIij¯¯¯¯LMIoj¯¯¯¯L,MIij¯¯¯¯UMIoj¯¯¯¯UNRij¯¯¯¯L1+NRoj¯¯¯¯LfornonmembershipgradeWhere the data in Eq. (49) is used for cost types of data, such as CCij¯¯/=0otherwiseMRij¯¯¯¯L1+MCCoj¯L¯MRij¯¯¯¯LMRoj¯¯¯¯L,MRij¯¯¯¯UMRoj¯¯¯¯U,MIij¯¯¯¯LMIoj¯¯¯¯L,MIij¯¯¯¯UMIoj¯¯¯¯UNRij¯¯¯¯L1+NCCoj¯¯¯L¯fornonmembershipgradewhere CCoj=minjMRoj¯¯¯¯LxE˜,minjMRoj¯¯¯¯UxE˜ei2πminjMIoj¯¯¯¯LxE˜,minjMIoj¯¯¯¯UxE˜,maxjNR0j¯¯LxE˜,maxjNR0j¯¯UxE˜ei2πmaxjNI0j¯¯LxE˜,maxjNI0j¯¯UxE˜.

Step 3: Utilizing CIVIFAAWA and CIVIFAAWG operators to obtain the WSM and WPM of each alternative: WSMi=CIVIFAAWACC1¯¯,CC2¯¯,,CCn¯¯ =1ej=1nWj¯¯log1MRj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MRj¯¯¯¯Uψ1ψei2π1ej=1nWj¯¯log1MIj¯¯¯¯Lψ1ψ,1ej=1nWj¯¯log1MIj¯¯¯¯Uψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNRj¯¯¯¯Uψ1ψei2πej=1nWj¯¯logNIj¯¯¯¯Lψ1ψ,ej=1nWj¯¯logNIj¯¯¯¯Uψ1ψ WPMi=CIVIFAAWGCC1¯¯,CC2¯¯,,CCn¯¯ =ej=1nlogMRj¯¯¯¯LψWj¯¯1ψ,ej=1nlogMRj¯¯¯¯UψWj¯¯1ψei2πej=1nlogMIj¯¯¯¯LψWj¯¯1ψ,ej=1nlogMIj¯¯¯¯UψWj¯¯1ψ,1ej=1nlog1NRj¯¯¯¯LψWj¯¯1ψ,1ej=1nlog1NRj¯¯¯¯UψWj¯¯1ψei2π1ej=1nlog1NIj¯¯¯¯LψWj¯¯1ψ,1ej=1nlog1NIj¯¯¯¯UψWj¯¯1ψStep 4: Compute the score value according to WSM and WPM, the detailed formula is listed as follows. Si=°FSSV¯¯WSMi+1°FSSV¯¯WPMiStep 5: Rank the alternatives and derive the best one referring to the score value Si in Step 4.

Further, we justify the above-mentioned method by some practical examples.

Example 1: To verify the WASPAS technique under the consideration of some CIVIF information, we applied it for practical CIVIF decision matrix to obtain the best alternative. Four alternatives: S1, S2, S3, S4; and four criteria C1, C2, C3, C4, and CIJ indicates the assessment information of SI(I = 1, 2, 3, 4) under the criterion CJJ=1,2,3,4. Some valuable and effective steps of the WASPAS method are listed below:

Step 1: The input data of the technique is represented in the form of a matrix of alternatives and attributes, which is based on the data received from the expert. CCij¯¯=0.3,0.6ei2π0.1,0.3,0.3,0.4ei2π0.3,0.30.2,0.3ei2π0.6,0.7,0.3,0.4ei2π0.2,0.30.1,0.3ei2π0.3,0.4,0.1,0.2ei2π0.1,0.20.3,0.4ei2π0.3,0.3,0.2,0.2ei2π0.1,0.20.2,0.3ei2π0.2,0.4,0.3,0.5ei2π0.3,0.40.3,0.4ei2π0.5,0.6,0.2,0.3ei2π0.1,0.30.2,0.4ei2π0.3,0.5,0.2,0.3ei2π0.2,0.20.3,0.5ei2π0.3,0.4,0.2,0.2ei2π0.1,0.20.3,0.4ei2π0.1,0.3,0.2,0.2ei2π0.2,0.30.4,0.5ei2π0.4,0.5,0.3,0.4ei2π0.2,0.20.1,0.3ei2π0.2,0.2,0.3,0.3ei2π0.2,0.30.2,0.2ei2π0.2,0.3,0.2,0.2ei2π0.1,0.20.1,0.2ei2π0.2,0.2,0.1,0.1ei2π0.1,0.30.5,0.6ei2π0.3,0.4,0.2,0.4ei2π0.2,0.20.2,0.2ei2π0.1,0.1,0.3,0.4ei2π0.2,0.30.1,0.1ei2π0.1,0.3,0.1,0.2ei2π0.1,0.2

Step 2: Further, we normalize the information in decision matrix by using Eqs. (47)49, and obtain following resutls: CC0,j¯¯=0.3,0.6ei2π0.2,0.4,0.1,0.1ei2π0.1,0.3,0.5,0.6ei2π0.6,0.7,0.2,0.3ei2π0.1,0.2,0.2,0.4ei2π0.3,0.5,0.1,0.2ei2π0.1,0.2,0.3,0.5ei2π0.3,0.4,0.1,0.2ei2π0.1,0.2 CCij¯¯/=0.231,0.375ei2π0.083,0.214,0.273,0.364ei2π0.273,0.2310.133,0.187ei2π0.375,0.412,0.25,0.308ei2π0.182,0.250.084,0.214ei2π0.230,0.267,0.091,0.167ei2π0.091,0.1670.230,0.267ei2π0.230,0.214,0.182,0.167ei2π0.091,0.1670.154,0.187ei2π0.167,0.285,0.273,0.455ei2π0.273,0.3070.2,0.25ei2π0.312,0.353,0.167,0.231ei2π0.091,0.250.167,0.285ei2π0.230,0.333,0.182,0.25ei2π0.182,0.1670.230,0.334ei2π0.230,0.285,0.182,0.167ei2π0.091,0.1670.231,0.25ei2π0.083,0.214,0.182,0.182ei2π0.182,0.2310.267,0.312ei2π0.25,0.294,0.25,0.308ei2π0.182,0.1670.083,0.214ei2π0.153,0.133,0.273,0.25ei2π0.182,0.250.153,0.133ei2π0.153,0.214,0.182,0.167ei2π0.091,0.1670.077,0.125ei2π0.167,0.143,0.,0.ei2π0.,0.0.333,0.375ei2π0.187,0.2353,0.167,0.308ei2π0.182,0.1670.167,0.142ei2π0.076,0.067,0.273,0.333ei2π0.182,0.250.076,0.067ei2π0.076,0.214,0.091,0.167ei2π0.091,0.167

Step 3: Compute the WSM and WPM of each alternative according to the CIVIFAAWA and CIVIFAAWG operators (ψ = 1), the specific results are illustrated as follows. WSMi=0.000028,0.0011ei2π0.000007,0.00009,0.8096,0.9050ei2π0.8096,0.8925,0.0001,0.0003ei2π0.0003,0.0007,0.828,0.9292ei2π0.6953,0.828,0.000007,0.00009ei2π0.00002,0.00003,0.8096,0.8907ei2π0.6952,0.8279,0.00003,0.00004ei2π0.00003,0.0001,0.6953,0.7296ei2π0.3637,0.7296 WPMi=0.7291,0.8651ei2π0.5452,0.8377,0.00005,0.000160ei2π0.000059,0.00020,0.8658,0.9222ei2π0.9222,0.9512,0.00008,0.0004ei2π0.00002,0.00008,0.5452,0.8377ei2π0.7292,0.7847,0.00005,0.000187ei2π0.00002,0.00008,0.7292,0.7847ei2π0.7292,0.8693,0.00002,0.00003ei2π0.000003,0.00003

Further, we examine the values of the score function, such as: WSMi=0.8542,0.82,0.8058,0.629 WPMi=0.7442,0.9152,0.7241,0.7781Step 4: Acquire the score value of each alternative by using the theory of WSM and WPM information: S1=0.4245,S2=0.5682,S3=0.4181,S4=0.4966For convenience, we assume °F = 0.2.

Step 5: Identify the ranking information for evaluating or deriving the best preference. S2S4S1S3

From the above analysis, we obtain the best preferences as S2.

Application in MADM

The significant commitment of this examination is to apply MADM method under CIVIFS for deciding the optimal scheme from the group of complex interval-valued intuitionistic fuzzy data. To determine the best one, we expounded a dynamic interaction. There are m alternative CC¯¯=CC1¯¯,CC2¯¯,,CCm¯¯ and n criteria looking like

Procedure of decision-making

To achieve the acquirement of the best one, we built the dynamic calculation looking like the accompanying stages:

Stage 1: Construct the CIVIF decision matrix utilizing the CIVIF evaluation information.

Stage 2: Normalize the CIVIF decision matrix. The specific conversion process is shown below when dealing with beneficial data and cost data: D=MRjk¯¯¯L,MRjk¯¯¯¯Uei2πMIjk¯¯¯¯L,MIjk¯¯¯¯U,NRjk¯¯¯L,NRjk¯¯¯¯Uei2πNIjk¯¯¯¯L,NIjk¯¯¯¯UforbenefitsortofdataNRjk¯¯¯¯L,NRjk¯¯¯¯Uei2πNIjk¯¯¯¯L,NIjk¯¯¯¯U,MRjk¯¯¯¯L,MRjk¯¯¯¯Uei2πMIjk¯¯¯¯L,MIjk¯¯¯¯UforcostsortofdataStage 3: Utilizing the Eq. (17) (CIVIFAAWA) and Eq. (32) (CIVIFAAWG) to aggregate the information in the decision matrix.

Stage 4: Using Eq. (6) to derive the score information.

Stage 5: Evaluate the ranking information in the availability of score information.

Represented example

The significant finding of this investigation is to break down the explained administrators in the conditions of the MADM methodology. For this, we examined some pragmatic information to decide the practicality and probability of the introduced works.

Clarification of the problem

Permit us to ponder a creation association that expects to enroll a publicizing director for an unfilled post. Here, we consider five competitors CCj¯¯,j=1,2,3,4,5, allocated for extra appraisals, such as: CC1¯¯: Oral presentation capacity; CC2¯¯: History; CC3¯¯: Overall tendency; and CC4¯¯: confidence. For this, we consider weight vectors such as 0.4,0.3,0.2,0.1. The five specialists CCj¯¯,j=1,2,3,4,5 are to oversee vagueness under CIVIF information by utilizing dynamic strategies.

Method under CIVIFAAWA and CIVIFAAWG operators

Determine the useful individual from the gathering of people (Five up-and-comers) by utilizing the MADM procedure under CIVIFAAWA and CIVIFAAWG operators. For obtaining the ideal one, we developed the dynamic calculation looking like the accompanying stages:

Stage 1: Construct the CIVIF decision matrix. The specific data covering the cost and beneficial sorts are listed as Table 2.

Table 2:
CIVIF data.
C C 1 ¯ ¯ C C 2 ¯ ¯
C C 1 ¯ ¯ 0 . 4 , 0 . 5 e i 2 π 0 . 3 , 0 . 4 , 0 . 2 , 0 . 3 e i 2 π 0 . 2 , 0 . 4 0 . 41 , 0 . 51 e i 2 π 0 . 31 , 0 . 41 , 0 . 21 , 0 . 31 e i 2 π 0 . 21 , 0 . 41
C C 2 ¯ ¯ 0 . 3 , 0 . 4 e i 2 π 0 . 0 , 0 . 1 , 0 . 0 , 0 . 1 e i 2 π 0 . 0 , 0 . 1 0 . 31 , 0 . 41 e i 2 π 0 . 01 , 0 . 11 , 0 . 01 , 0 . 11 e i 2 π 0 . 01 , 0 . 11
C C 3 ¯ ¯ 0 . 4 , 0 . 5 e i 2 π 0 . 1 , 0 . 2 , 0 . 3 , 0 . 4 e i 2 π 0 . 2 , 0 . 3 0 . 41 , 0 . 51 e i 2 π 0 . 11 , 0 . 21 , 0 . 31 , 0 . 41 e i 2 π 0 . 21 , 0 . 31
C C 4 ¯ ¯ 0 . 2 , 0 . 3 e i 2 π 0 . 4 , 0 . 5 , 0 . 0 , 0 . 1 e i 2 π 0 . 1 , 0 . 2 0 . 21 , 0 . 31 e i 2 π 0 . 41 , 0 . 51 , 0 . 01 , 0 . 11 e i 2 π 0 . 11 , 0 . 21
C C 5 ¯ ¯ 0 . 4 , 0 . 5 e i 2 π 0 . 4 , 0 . 5 , 0 . 0 , 0 . 1 e i 2 π 0 . 2 , 0 . 3 0 . 41 , 0 . 51 e i 2 π 0 . 41 , 0 . 51 , 0 . 01 , 0 . 11 e i 2 π 0 . 21 , 0 . 31
C C 3 ¯ ¯ C C 4 ¯ ¯
C C 1 ¯ ¯ 0 . 42 , 0 . 52 e i 2 π 0 . 32 , 0 . 42 , 0 . 22 , 0 . 32 e i 2 π 0 . 22 , 0 . 42 0 . 43 , 0 . 53 e i 2 π 0 . 33 , 0 . 43 , 0 . 23 , 0 . 33 e i 2 π 0 . 23 , 0 . 43
C C 2 ¯ ¯ 0 . 32 , 0 . 42 e i 2 π 0 . 02 , 0 . 12 , 0 . 02 , 0 . 12 e i 2 π 0 . 02 , 0 . 12 0 . 33 , 0 . 43 e i 2 π 0 . 03 , 0 . 13 , 0 . 03 , 0 . 13 e i 2 π 0 . 03 , 0 . 13
C C 3 ¯ ¯ 0 . 42 , 0 . 52 e i 2 π 0 . 12 , 0 . 22 , 0 . 32 , 0 . 42 e i 2 π 0 . 22 , 0 . 32 0 . 43 , 0 . 53 e i 2 π 0 . 13 , 0 . 23 , 0 . 33 , 0 . 43 e i 2 π 0 . 23 , 0 . 33
C C 4 ¯ ¯ 0 . 22 , 0 . 32 e i 2 π 0 . 42 , 0 . 52 , 0 . 02 , 0 . 12 e i 2 π 0 . 12 , 0 . 22 0 . 23 , 0 . 33 e i 2 π 0 . 43 , 0 . 53 , 0 . 03 , 0 . 13 e i 2 π 0 . 13 , 0 . 23
C C 5 ¯ ¯ 0 . 42 , 0 . 52 e i 2 π 0 . 42 , 0 . 52 , 0 . 02 , 0 . 12 e i 2 π 0 . 22 , 0 . 32 0 . 43 , 0 . 53 e i 2 π 0 . 43 , 0 . 53 , 0 . 03 , 0 . 13 e i 2 π 0 . 23 , 0 . 33
DOI: 10.7717/peerjcs.1362/table-2

Stage 2: Normalize the decision matrix referring to the subsequent conversion process. D=MRjk¯¯¯¯L,MRjk¯¯¯¯Uei2πMIjk¯¯¯¯L,MIjk¯¯¯¯U,NRjk¯¯¯¯L,NRjk¯¯¯¯Uei2πNIjk¯¯¯¯L,NIjk¯¯¯¯UforbenefitsortofdataNRjk¯¯¯¯L,NRjk¯¯¯¯Uei2πNIjk¯¯¯¯L,NIjk¯¯¯¯U,MRjk¯¯¯¯L,MRjk¯¯¯¯Uei2πMIjk¯¯¯¯L,MIjk¯¯¯¯UforcostsortofdataStage 3: Under the CIVIFAAWA and CIVIFAAWG operators, we obtain the aggregation consequence shown in Table 3 (ψ = 1).

Table 3:
Aggregation information matric.
CIV IFAAWA operator CIV IFAAWG operator
C C 1 ¯ ¯ 0 . 2048 , 0 . 2665 e i 2 π 0 . 1489 , 0 . 2048 , 0 . 5075 , 0 . 6012 e i 2 π 0 . 6012 , 0 . 6789 0 . 6789 , 0 . 7464 e i 2 π 0 . 6012 , 0 . 6789 , 0 . 0973 , 0 . 1489 e i 2 π 0 . 1489 , 0 . 2048
C C 2 ¯ ¯ 0 . 1489 , 0 . 2048 e i 2 π 0 . 0048 , 0 . 0494 , 0 . 1029 , 0 . 3828 e i 2 π 0 . 1029 , 0 . 3828 0 . 6012 , 0 . 6789 e i 2 π 0 . 1029 , 0 . 3828 , 0 . 0048 , 0 . 0494 e i 2 π 0 . 0048 , 0 . 0494
C C 3 ¯ ¯ 0 . 2048 , 0 . 2665 e i 2 π 0 . 0494 , 0 . 0973 , 0 . 6012 , 0 . 6789 e i 2 π 0 . 5075 , 0 . 6012 0 . 6789 , 0 . 7464 e i 2 π 0 . 3828 , 0 . 5075 , 0 . 1489 , 0 . 2048 e i 2 π 0 . 0973 , 0 . 1489
C C 4 ¯ ¯ 0 . 0973 , 0 . 1489 e i 2 π 0 . 2048 , 0 . 2665 , 0 . 1029 , 0 . 3828 e i 2 π 0 . 3828 , 0 . 5075 0 . 5075 , 0 . 6012 e i 2 π 0 . 6789 , 0 . 7464 , 0 . 0048 , 0 . 0494 e i 2 π 0 . 0494 , 0 . 0973
C C 5 ¯ ¯ 0 . 2048 , 0 . 2665 e i 2 π 0 . 2048 , 0 . 2665 , 0 . 1029 , 0 . 3828 e i 2 π 0 . 1029 , 0 . 3828 0 . 6789 , 0 . 7464 e i 2 π 0 . 6789 , 0 . 7464 , 0 . 0048 , 0 . 0494 e i 2 π 0 . 0048 , 0 . 0494
DOI: 10.7717/peerjcs.1362/table-3

Stage 4: Here, we compute the score values of the aggregated information in Stage 3, see Table 4.

Table 4:
Score values.
CIV IFAAWA operator CIV IFAAWG operator
C C 1 ¯ ¯ −0.3909 0.5263
C C 2 ¯ ¯ −0.1409 0.4143
C C 3 ¯ ¯ −0.4427 0.4289
C C 4 ¯ ¯ −0.1646 0.5833
C C 5 ¯ ¯ −0.0072 0.6855
DOI: 10.7717/peerjcs.1362/table-4

Stage 5: Obtain the ranking information based on the score values, the detailed result is stated in Table 5.

Table 5:
Ranking lists.
CIFAAWA operator C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIFAAWG operator C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
DOI: 10.7717/peerjcs.1362/table-5

According to the theory of CIFAAWA operator and CIFAAWG operator, the best optimal is CC5¯¯.

Influence of parameter

Here, we discuss the stability and influence of the derived operators based on the different values of parameters ψ. Therefore, by using the information in Table 2 and various parameter values, we obtain the subsequent consequence listed in Table 6.

Table 6:
Represented the stability of the proposed work.
Parameter Operator Score values Ranking values
ψ = 1 CIVIFAAWA operator −0.3909, − 0.1409, − 0.4427, − 0.1646, − 0.0072 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5263, 0.4143, 0.4289, 0.5833, 0.6855 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
ψ = 5 CIVIFAAWA operator −0.3901, − 0.1261, − 0.4416, − 0.1571, 0.0065 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5255, 0.4049, 0.4278, 0.5811, 0.6826 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
ψ = 11 CIVIFAAWA operator −0.3888, − 0.1169, − 0.4401, − 0.1518, 0.0151 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5242, 0.3989, 0.4262, 0.5791, 0.6803 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
ψ = 51 CIVIFAAWA operator −0.3818, − 0.1049, − 0.4329, − 0.141, 0.0274 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5176, 0.3901, 0.4185, 0.5724, 0.6748 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
ψ = 101 CIVIFAAWA operator −0.3773, − 0.1013, − 0.4289, − 0.1363, 0.0323 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5138, 0.3876, 0.4142, 0.5696, 0.6726 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
DOI: 10.7717/peerjcs.1362/table-6

We have gotten the consistent advantageous ideal CC5¯¯ based on diverse operators by utilizing the particular upsides of the boundary. This result shows that our calculation model has a good stability.

Comparative analysis

Here, our main theme to evaluate the comparison between proposed method with few existing analyses to show the stability and effectiveness of the proposed method. For this, we use various existing operators such as Aggregation operators (AOs) (Xu, 2007), geometric AOs (Xu & Yager, 2006), information AOs (Wang & Liu, 2012), Einstein geometric AOs (Wang & Liu, 2012), Hamacher AOs (Huang, 2014), Dombi AOs (Seikh & Mandal, 2021) under the IFSs, and AOs Garg & Rani (2019a) and Garg & Rani (2019b) based on CIVIFSs. The comparative analysis is stated in Table 7 for the data in Table 2.

Table 7:
Comparison information for Table 1.
Methods Score values Ranking values
Xu (2007) × × × × × × × × × × × × × × × × × × × ×
Xu & Yager (2006) × × × × × × × × × × × × × × × × × × × ×
Wang & Liu (2012) × × × × × × × × × × × × × × × × × × × ×
Wang & Liu (2011) × × × × × × × × × × × × × × × × × × × ×
Huang (2014) × × × × × × × × × × × × × × × × × × × ×
Seikh and Mandal (2021) × × × × × × × × × × × × × × × × × × × ×
Garg & Rani (2019a) and Garg & Rani (2019b) 0.4174, 0.3054, 0.3199, 0.4744, 0.5766 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWA operator −0.3909, − 0.1409, − 0.4427, − 0.1646, − 0.0072 C C 5 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 2 ¯ ¯ > C C 3 ¯ ¯
CIVIFAAWG operator 0.5263, 0.4143, 0.4289, 0.5833, 0.6855 C C 5 ¯ ¯ > C C 2 ¯ ¯ > C C 4 ¯ ¯ > C C 1 ¯ ¯ > C C 3 ¯ ¯
DOI: 10.7717/peerjcs.1362/table-7

Notes:

“ ×” denotes it is unsuitble to calculate the score values.

Under the various kinds of operators, we have gotten a completely consistent optimal judgment CC5¯¯ by utilizing the particular upsides of the boundary. The best optimal is CC5¯¯ according to the theory which was proposed by Garg & Rani (2019a) and Garg & Rani (2019b) based on CIVIFSs and proposed operators. Further, the derived theory of Aggregation operators (AOs) (Xu, 2007), geometric AOs (Xu & Yager, 2006), information AOs (Wang & Liu, 2012), Einstein geometric AOs (Wang & Liu, 2012), Hamacher AOs (Huang, 2014), Dombi AOs (Seikh & Mandal, 2021) under the IFSs have been failed, due to various limitations, because these operators or information ware proposed based on FSs, IFSs, IVIFSs, CFSs, and CIFSs which are the particular cases of the proposed information and hence they are not able to evaluate our suggestion information (CIVIF values).

Therefore, it can be inferred that the presented information and MADM model are very valuable and dominant for handling awkward information.

Conclusion

In this manuscript, we combined four main theories such as CIVIF information, Aczel-Alsina operational laws, averaging/geometric aggregation operators, and the WASPAS technique. Furthermore, the theory of CIVIF information is the modified version of the FSs, IFSs, CFSs, CIFSs, and IVIFSs, because these are the special cases of the invented theory. Further, we derived the theory of aggregation operators based on Aczel-Alsina operational laws for CIVIF information. The theory of the WAPSAS technique is also proposed based on Aczel-Alsina aggregation operators for CIVIF information. The key influence of this assessment is debated below: (1) We initiated the Aczel-Alsina operational laws and their related results; (2) We initiated the principle of CIVIFAAWA, CIVIFAAOWA, CIVIFAAHA, CIVIFAAWG, CIVIFAAOWG, and CIVIFAAHG operators, and illustrated their well-known properties and results; (3) We derived the WASPAS method for CIVIFSs and evaluated their main steps with the help of some numerical examples; (4) We demonstrated the MADM strategy under the invented works; (5) We expressed the supremacy and dominancy of the invented works with the help of sensitive analysis and geometrical shown of the explored works.

In the future, we concentrate to derive some new ideas such as complex fuzzy superior Mandelbrot sets, complex intuitionistic fuzzy mandelbrot set, and their extension, and we try to utilize them in the field of artificial intelligence, machine learning, game theory, neural networks, and clustering analysis to improve or enhance the quality of the presented information.

4 Citations   Views   Downloads