Loading [MathJax]/extensions/TeX/boldsymbol.js
Research article

Selection of artificial neutral networks based on cubic intuitionistic fuzzy Aczel-Alsina aggregation operators

  • Artificial neural networks (ANNs) are the collection of computational techniques or models encouraged by the shape and purpose of natural or organic neural networks. Furthermore, a cubic intuitionistic fuzzy (CIF) set is the modified or extended form of a Fuzzy set (FS). Our goal was to address or compute the model of Aczel-Alsina operational laws under the consideration of the CIF set as well as Aczel-Alsina t-norm (AATN) and Aczel-Alsina t-conorm (AATCN), where the model of Algebraic norms and Drastic norms were the special parts of the Aczel-Alsina norms. Further, using the above invented operational laws, we aimed to develop the model of Aczel-Alsina average/geometric aggregation operators, called CIF Aczel-Alsina weighted averaging (CIFAAWA), CIF Aczel-Alsina ordered weighted averaging (CIFAAOWA), CIF Aczel-Alsina hybrid averaging (CIFAAHA), CIF Aczel-Alsina weighted geometric (CIFAAWG), CIF Aczel-Alsina ordered weighted geometric (CIFAAOWG), and CIF Aczel-Alsina hybrid geometric (CIFAAHG) operators with some well-known and desirable properties. Moreover, a procedure decision-making technique was presented for finding the best type of artificial neural networks with the help of multi-attribute decision-making (MADM) problems based on CIF aggregation information. Finally, we determined a numerical example for showing the rationality and advantages of the developed method by comparing their ranking values with the ranking values of many prevailing tools.

    Citation: Chunxiao Lu, Zeeshan Ali, Peide Liu. Selection of artificial neutral networks based on cubic intuitionistic fuzzy Aczel-Alsina aggregation operators[J]. AIMS Mathematics, 2024, 9(10): 27797-27833. doi: 10.3934/math.20241350

    Related Papers:

    [1] Wajid Ali, Tanzeela Shaheen, Iftikhar Ul Haq, Hamza Toor, Faraz Akram, Harish Garg, Md. Zia Uddin, Mohammad Mehedi Hassan . Aczel-Alsina-based aggregation operators for intuitionistic hesitant fuzzy set environment and their application to multiple attribute decision-making process. AIMS Mathematics, 2023, 8(8): 18021-18039. doi: 10.3934/math.2023916
    [2] Tahir Mahmood, Azam, Ubaid ur Rehman, Jabbar Ahmmad . Prioritization and selection of operating system by employing geometric aggregation operators based on Aczel-Alsina t-norm and t-conorm in the environment of bipolar complex fuzzy set. AIMS Mathematics, 2023, 8(10): 25220-25248. doi: 10.3934/math.20231286
    [3] Aziz Khan, Shahzaib Ashraf, Saleem Abdullah, Muhammad Ayaz, Thongchai Botmart . A novel decision aid approach based on spherical hesitant fuzzy Aczel-Alsina geometric aggregation information. AIMS Mathematics, 2023, 8(3): 5148-5174. doi: 10.3934/math.2023258
    [4] Saba Ijaz, Kifayat Ullah, Maria Akram, Dragan Pamucar . Approaches to multi-attribute group decision-making based on picture fuzzy prioritized Aczel–Alsina aggregation information. AIMS Mathematics, 2023, 8(7): 16556-16583. doi: 10.3934/math.2023847
    [5] Muhammad Naeem, Younas Khan, Shahzaib Ashraf, Wajaree Weera, Bushra Batool . A novel picture fuzzy Aczel-Alsina geometric aggregation information: Application to determining the factors affecting mango crops. AIMS Mathematics, 2022, 7(7): 12264-12288. doi: 10.3934/math.2022681
    [6] Ghous Ali, Kholood Alsager, Asad Ali . Novel linguistic $ q $-rung orthopair fuzzy Aczel-Alsina aggregation operators for group decision-making with applications. AIMS Mathematics, 2024, 9(11): 32328-32365. doi: 10.3934/math.20241551
    [7] Saleem Abdullah, Muhammad Qiyas, Muhammad Naeem, Mamona, Yi Liu . Pythagorean Cubic fuzzy Hamacher aggregation operators and their application in green supply selection problem. AIMS Mathematics, 2022, 7(3): 4735-4766. doi: 10.3934/math.2022263
    [8] Muhammad Qiyas, Muhammad Naeem, Muneeza, Arzoo . Logarithmic cubic aggregation operators and their application in online study effect during Covid-19. AIMS Mathematics, 2023, 8(3): 5847-5878. doi: 10.3934/math.2023295
    [9] Rana Muhammad Zulqarnain, Xiao Long Xin, Muhammad Saeed . Extension of TOPSIS method under intuitionistic fuzzy hypersoft environment based on correlation coefficient and aggregation operators to solve decision making problem. AIMS Mathematics, 2021, 6(3): 2732-2755. doi: 10.3934/math.2021167
    [10] Ghous Ali, Kholood Alsager . Novel Heronian mean based $ m $-polar fuzzy power geometric aggregation operators and their application to urban transportation management. AIMS Mathematics, 2024, 9(12): 34109-34146. doi: 10.3934/math.20241626
  • Artificial neural networks (ANNs) are the collection of computational techniques or models encouraged by the shape and purpose of natural or organic neural networks. Furthermore, a cubic intuitionistic fuzzy (CIF) set is the modified or extended form of a Fuzzy set (FS). Our goal was to address or compute the model of Aczel-Alsina operational laws under the consideration of the CIF set as well as Aczel-Alsina t-norm (AATN) and Aczel-Alsina t-conorm (AATCN), where the model of Algebraic norms and Drastic norms were the special parts of the Aczel-Alsina norms. Further, using the above invented operational laws, we aimed to develop the model of Aczel-Alsina average/geometric aggregation operators, called CIF Aczel-Alsina weighted averaging (CIFAAWA), CIF Aczel-Alsina ordered weighted averaging (CIFAAOWA), CIF Aczel-Alsina hybrid averaging (CIFAAHA), CIF Aczel-Alsina weighted geometric (CIFAAWG), CIF Aczel-Alsina ordered weighted geometric (CIFAAOWG), and CIF Aczel-Alsina hybrid geometric (CIFAAHG) operators with some well-known and desirable properties. Moreover, a procedure decision-making technique was presented for finding the best type of artificial neural networks with the help of multi-attribute decision-making (MADM) problems based on CIF aggregation information. Finally, we determined a numerical example for showing the rationality and advantages of the developed method by comparing their ranking values with the ranking values of many prevailing tools.



    To find the finest or best optimal form from the collection of finite alternatives, different techniques have been proposed by different scholars, such as MADM techniques [1,2], pattern recognition, artificial neural networks, and artificial intelligence. Various individuals have developed the MADM tools in different fields [3,4] based on classical set theory. However, because of complications and complexity in the case of classical set theory, experts have lost a lot of data during the decision-making process. To solve this problem, the fuzzy set (FS) was developed by Zadeh [5] in 1965 by modifying the function ¨μ¨μ:{0,1} into ¨μ¨μ:[0,1], called truth grade. Furthermore, the FS has a lot of benefits, but it also has some limitations, such as in the presence of truth grade and falsity grade, FS has failed because it deals only with truth information and not with falsity information. For this, the IFS was proposed by Atanassov [6], which covered the truth and falsity grades, such as ¨μ¨μ:[0,1] and ηη:[0,1] with a condition 0¨μ¨μ(α)+ηη(α)1. The FS is a special part of the IFS if we exclude the falsity of information ηη:[0,1]. Additionally, to increase the ratio of correctness, we have also the best option to take the shape of an interval instead of a real number. For example, during any cricket match between Team A and Team B, we provided our opinion in the shape of the interval, and we decided that Team A would score between 150 to 180 in the T20 match. For such type of problem, the IFS and FS are not good; therefore, the idea of interval-valued IFS (IVIFS) was given by Atanassov [7], with a characteristic 0¨μ+¨μ(α)+η+η(α)1, where [¨μ¨μ(α),¨μ+¨μ(α)] and [ηη(α),η+η(α)] represents the interval-valued truth and interval-valued falsity information. Moreover, Jun et al. [8] developed the cubic set, which is the combination of FS and interval-valued FS (IVFS) [9,10]. Moreover, Kaur and Garg [11] developed the cubic IFS (CIFS), which is the combination of IFS and IVIFS. The geometric representation of the FSs and their extensions are described in Figure 1. The model of cubic intuitionistic fuzzy sets is more extensive compared to other existing models. Further, a detailed review of the above existing models is described in the next sub-sections.

    Figure 1.  Geometrical representation of the fuzzy sets and their extensions.

    FS and its extensions have many applications in different fields, and because of their valuable and dominant structure, FS is better than the classical set, and IFS is more beneficial than FS, but the CIFS is more advanced and reliable than FS because it is a combination of two different structures, such as IFS and IVIFS. Some valuable applications are given; for instance, Mardani et al. [12] explored the aggregation operators for FS. Moreover, Merigo and Casanovas [13] developed the generalized hybrid aggregation operators for FS and their applications. Additionally, Xu [14] derived the simple aggregation operators for IFSs, whereas the prioritized aggregation operators for IFS were used by Yu and Xu [15]. Moreover, Xu and Yager [16] examined the geometric aggregation operators for IFS and their application in decision-making problems. Garg et al. [17] explored the Schweizer-Sklar prioritized aggregation operators for IFSs. Wang et al. [18] developed the aggregation operators for IVIFSs and their applications. Senapati et al. [19] proposed the Aczel-Alsina aggregation operators for IVIFSs. Shi et al. [20] evaluated the power aggregation operators based on Aczel-Alsina operational laws for IVIFSs. Wei and Wang [21] studied the geometric aggregation operators for IVIFSs and their application in decision-making problems. Xu and Chen [22] proposed the geometric aggregation operators for IVIFSs. Fahmi et al. [23] developed the Einstein aggregation operators for cubic fuzzy sets. Khan et al. [24] studied the cubical fuzzy aggregation operators and their application in decision-making problems. Kaur and Garg [25] examined the simple aggregation operators based on cubic IFSs and their applications. Additionally, Kaur and Garg [26] derived the generalized aggregation operators (AOs) for cubic IFS and their application in decision-making problems.

    Aggregating the collection of finite information is a very challenging task for scholars. The triangular norms were proposed by Klement and Mesiar [27], which are very valuable and dominant for evaluating any kind of aggregation operator. Furthermore, Aczel and Alsina [28] developed the Aczel-Alsina t-norm and t-conorm, which are the modified versions of the algebraic norms. Many scholars developed different types of aggregation operators based on Aczel-Alsina operational laws, for instance, Senapati et al. [29] presented the Aczel-Alsina AOs for IFSs. Further, Senapati et al. [30] developed the Aczel-Alsina AOs for IVIFSs. Moreover, Aczel-Alsina AOs based on hesitant FS were given by Senapati et al. [31]. Mahmood et al. [32] presented the Aczel-Alsina AOs for complex IFSs and their application. Senapati et al. [33] examined the geometric AOs for IFSs and their applications. Ahmad et al. [34] derived the Aczel-Alsina AOs for the intuitionistic fuzzy rough set. Sarfraz et al. [35] proposed the prioritized Aczel-Alsina AOs for IFSs. Mahmood et al. [36] explored the Aczel-Alsina power AOs for complex IFSs. Recently, Hussain et al. [37] introduced the intuitionistic fuzzy rough Aczel-Alsina AOs and their application in decision-making problems. Further, many types of operators were constructed by well-known scholars, for instance, the model of Dombi operators [38], Archimedean operators [39], and Frank operators [40]. Moreover, some scholars have modified the model of IFSs and invented the model of quasirung orthopair fuzzy sets [41], the model of (3, 4)-quasirung orthopair fuzzy sets [42], q-rung orthopair fuzzy prioritized operators [43], linear Diophantine fuzzy sets [44], cubic picture fuzzy topology [45], and picture fuzzy soft-max Einstein operators [46].

    The model for FSs theory and their modifications are very flexible because of their features, where these techniques are very reliable; however, due to ambiguity and problems, experts have lost a lot of information during the decision-making procedure. During decision-making assessments, all decision-makers have faced the following dilemmas, such as

    1) How we define a new aggregation operator.

    2) How we aggregate the collection of information into a singleton set.

    3) How we rank all alternatives to select the best one.

    For handling such kinds of problems, the Aczel-Alsina operators based on the CIF set are very beneficial and consistent for assessing uncooperative and vague information in real-life problems. The model of Aczel-Alsina norms is described below, such as

    ¯¯πtn(ˇα1,ˇα2)={¯¯πtn(ˇα1,ˇα2)when=0,min(ˇα1,ˇα2)when=E((In(ˇα1))+(In(ˇα2)))1otherwise.,
    ¯¯πtcn(ˇα1,ˇα2)={¯¯πtcn(ˇα1,ˇα2)when=0,max(ˇα1,ˇα2)when=1E((In(1ˇα1))+(In(1ˇα2)))1otherwise.,

    Note that ¯¯πtn(ˇα1,ˇα2)=ˇα1.ˇα2 and ¯¯πtcn(ˇα1,ˇα2)=ˇα1+ˇα2ˇα1.ˇα2 describe the algebraic norms with drastic norms min(ˇα1,ˇα2) and max(ˇα1,ˇα2), which are the special cases of the Aczel-Alsina norms. After a long assessment, we noticed that the technique of Aczel-Alsina operational laws is based on CIF sets. Further, the technique of averaging and geometric operators based on Aczel-Alsina norms for CIF values are also very reliable but have not been invented yet. These techniques are very capable and strong due to their characteristics and have not been proposed by anyone. The main motivation of the proposed work is that no one can propose it, and the Aczel-Alsina aggregation operators for the CIF set and the Aczel-Alsina AOs were proposed for FSs, IFSs, IVIFSs, but not for cubic IFSs. To propose these operators, many operators are the only parts of the proposed operators because they are the modified version of the existing operators. The limitations of the existing techniques are briefly evaluated and discussed in Table 1.

    Table 1.  Theoretical comparison between proposed and existing models.
    Authors Methods Membership function Non-membership function Interval-valued function Cubic information Aczel-Alsina norms Algebraic norms Drastic norms
    Zadeh [5] Fuzzy sets × × × ×
    Atanassov [6] Intuitionistic fuzzy sets × × ×
    Atanassov [7] Interval-valued Intuitionistic fuzzy sets × ×
    Jun et al. [8] Cubic sets × ×
    Zadeh [9] Interval-valued fuzzy sets × × ×
    Turksen [10] Interval-valued fuzzy sets × × ×
    Kaur and Garg [11] Cubic intuitionistic fuzzy sets ×
    Proposed Aczel-Alsina operators for CIF values

     | Show Table
    DownLoad: CSV

    Information in Table 1 briefly describes that the proposed models are very effective because of their features, where the symbol " ×" represents the "no" and the term "yes" is denoted by " ". Therefore, according to theoretical assessments, we observed the model of Aczel-Alsina operators for CIF values is very reliable and dominant compared to others.

    To compile the solution to the above queries, we aim to simplify the model of Aczel-Alsina operational laws for evaluating the models of average/geometric operators based on it for CIF values. The model of Aczel-Alsina aggregation operators based on CIF values is the modified version of the existing technique of FSs and their related extensions. Some advantages of the proposed operators are as follows: The model of Aczel-Alsina, Algebraic, and Drastic aggregation operators, which are the special cases of the proposed theory.

    The above information contains the special cases of the invented theory. The proposed model is superior and more dominant because of the parameters that are involved in the structure of the proposed theory. Inspired by the above observation, we decided to determine the following major contributions of the proposed manuscript, such as

    1) To obtain the Aczel-Alsina operational laws based on the CIF set.

    2) To develop the CIFAAWA, CIFAAOWA, CIFAAHA, CIFAAWG, CIFAAOWG, and CIFAAHG operators with some well-known and desirable properties.

    3) A procedure of decision-making technique is presented for finding the best type of artificial neural networks with the help of MADM problems based on CIF information.

    4) A numerical example is provided to show the rationality and advantages of the developed method by comparison with many prevailing tools. The geometrical interpretation of the proposed models is briefly evaluated in Figure 2.

    Figure 2.  Geometrical interpretation of the proposed models.

    This manuscript is arranged as:

    In Section 2, we introduce the valuable IFSs, IVIFSs, CIFSs, and their operational laws.

    In Section 3, we develop the Aczel-Alsina operational laws and their related results.

    In Section 4, we propose the CIFAAWA, CIFAAOWA, CIFAAHA, CIFAAWG, CIFAAOWG, and CIFAAHG operators. Moreover, some well-known and desirable properties and special cases of them are discussed.

    In Section 5, a procedure of decision-making technique is presented for finding the best type of artificial neural networks with the help of MADM problems based on CIF information, and a numerical or practical example is provided to show the rationality and advantages of the developed method by comparison with many prevailing tools.

    In Section 6, we conclude final remarks about the proposed theory.

    In this section, we introduce the valuable IFSs, IVIFSs, CIFSs, and their operational laws. The main goal is to obtain the Aczel-Alsina operational laws and Aczel-Alsina operators based on CIFSs. For this, we used a universal set to state the existing ideas.

    Definition 1: [6] Consider a fixed set , then the IFS /IF is given below:

    /IF={(¨μ¨μ(α),ηη(α)):α}. (1)

    With a characteristic 0¨μ¨μ(α)+ηη(α)1, where ¨μ¨μ(α) and ηη(α) represents the truth and falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=1(¨μ¨μ(α)+ηη(α)). Moreover, the simple form of the IF number (IFN) is shown by: /IFω=(¨μ¨μω,ηηω),ω=1,2,,z.

    Definition 2: [7] Consider a fixed set , then the IVIFS /IVIF is given below:

    /IVIF={([¨μ¨μ(α),¨μ+¨μ(α)],[ηη(α),η+η(α)]):α}. (2)

    With a characteristic 0¨μ+¨μ(α)+η+η(α)1, where [¨μ¨μ(α),¨μ+¨μ(α)] and [ηη(α),η+η(α)] represents the interval-valued truth and interval-valued falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=[¨ϑ¨ϑ(α),¨ϑ+¨ϑ(α)]=[1¨μ+¨μ(α)+η+η(α),1¨μ¨μ(α)+ηη(α)]. Moreover, the simple form of the IVIF number (IVIFN) is shown by: /IVIFω=([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω]),ω=1,2,,z.

    Definition 3: [11] Consider a fixed set , then the CIFS /CuIF is given below:

    /CuIF={((¨μ¨μ(α),ηη(α)),([¨μ¨μ(α),¨μ+¨μ(α)],[ηη(α),η+η(α)])):α}. (3)

    With a characteristic 0¨μ¨μ(α)+ηη(α)1 and 0¨μ+¨μ(α)+η+η(α)1, where [¨μ¨μ(α),¨μ+¨μ(α)] and [ηη(α),η+η(α)] represents the interval-valued truth and interval-valued falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=[¨ϑ¨ϑ(α),¨ϑ+¨ϑ(α)]=[1¨μ+¨μ(α)+η+η(α),1¨μ¨μ(α)+ηη(α)], where ¨μ¨μ(α) and ηη(α) represents the truth and falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=1(¨μ¨μ(α)+ηη(α)). Moreover, the simple form of the CIF number (CIFN) is shown by: /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z. Furthermore, the score function and accuracy function are given, such as

    Ssf(/CuIFω)=12((¨μ¨μωηηω)+12(¨μ¨μω+¨μ+¨μωηηωη+ηω))[1,1], (4)
    Haf(/CuIFω)=12((¨μ¨μω+ηηω)+12(¨μ¨μω+¨μ+¨μω+ηηω+η+ηω))[1,1]. (5)

    For the above information, we can give some characteristics, such as if Ssf(/CuIF1)>Ssf(/CuIF2)/CuIF1>/CuIF2, if Ssf(/CuIF1)<Ssf(/CuIF2)/CuIF1</CuIF2, if Ssf(/CuIF1)=Ssf(/CuIF2), thus Haf(/CuIF1)>Haf(/CuIF2)/CuIF1>/CuIF2, if Haf(/CuIF1)<Haf(/CuIF2)/CuIF1</CuIF2.

    Definition 4: [28] The Aczel-Alsina t-norm for a scaler Ξ0 is given below:

    ¯¯πtn(ˇα1,ˇα2)={¯¯πtn(ˇα1,ˇα2)whEn=0,min(ˇα1,ˇα2)whEn=,E((In(ˇα1))+(In(ˇα2)))1othErwisE. (6)
    ¯¯πtcn(ˇα1,ˇα2)={¯¯πtcn(ˇα1,ˇα2)whEn=0,max(ˇα1,ˇα2)whEn=,1E((In(1ˇα1))+(In(1ˇα2)))1othErwisE. (7)

    Note that ¯¯πtn(ˇα1,ˇα2)=ˇα1.ˇα2 and ¯¯πtcn(ˇα1,ˇα2)=ˇα1+ˇα2ˇα1.ˇα2 described the algebraic norms with drastic norms min(ˇα1,ˇα2) and max(ˇα1,ˇα2).

    In this section, we aim to develop the Aczel-Alsina norms for CIFSs and try to derive some Aczel-Alsina operational laws. Further, we prove some important results based on these operational laws.

    Definition 5: For two CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2, we have Aczel-Alsina operational laws, such as

    /CuIF1/CuIF2=((1E((In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,E((In(ηη1))+(In(ηη2)))1),([1E((In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,1E((In(1¨μ+¨μ1))+(In(1¨μ+¨μ2)))1],[E((In(ηη1))+(In(ηη2)))1,E((In(η+η1))+(In(η+η2)))1])), (8)
    /CuIF1/CuIF2=((E((In(¨μ¨μ1))+(In(¨μ¨μ2)))1,1E((In(1ηη1))+(In(1ηη2)))1),([E((In(¨μ¨μ1))+(In(¨μ¨μ2)))1,E((In(¨μ+¨μ1))+(In(¨μ+¨μ2)))1],[1E((In(1ηη1))+(In(1ηη2)))1,1E((In(1η+η1))+(In(1η+η2)))1])), (9)
    ¨s/CuIF1=((1E(¨s(In(1¨μ¨μ1)))1,E(¨s(In(ηη1)))1),([1E(¨s(In(1¨μ¨μ1)))1,1E(¨s(In(1¨μ+¨μ1)))1],[E(¨s(In(ηη1)))1,E(¨s(In(η+η1)))1])), (10)
    (/CuIF1)¨s=((E(¨s(In(¨μ¨μ1)))1,1E(¨s(In(1ηη1)))1),([E(¨s(In(¨μ¨μ1)))1,E(¨s(In(¨μ+¨μ1)))1],[1E(¨s(In(1ηη1)))1,1E(¨s(In(1η+η1)))1])). (11)

    Further, we simplify the above techniques based on some suitable examples. For this, we consider two CIF numbers, such as /1=((0.5,0.4),([0.4,0.5],[0.1,0.2])) and /2=((0.3,0.1),([0.3,0.5],[0.1,0.4])) with =¨s=2, thus

    /1/2=((0.54138,0.08389),([0.46368,0.62479],[0.03853,0.15692])),
    /1/2=((0.24926,0.40642),([0.22025,0.37521],[0.13843,0.42732])),
    2/1=((0.62479,0.27367),([0.51442,0.62479],[0.03853,0.10269])),
    (/1)2=((0.37521,0.51442),([0.27367,0.37521],[0.13843,0.27063])).

    Theorem 1: For any CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, thus

    1) /CuIF1/CuIF2=/CuIF2/CuIF1.

    2) /CuIF1/CuIF2=/CuIF2/CuIF1.

    3) ¨s/CuIF1¨s/CuIF2=¨s(/CuIF1/CuIF2).

    4) (/CuIF1)¨s(/CuIF2)¨s=(/CuIF1/CuIF2)¨s.

    Proof.

    1) Let

    /CuIF1/CuIF2=((1E((In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,E((In(ηη1))+(In(ηη2)))1),([1E((In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,1E((In(1¨μ+¨μ1))+(In(1¨μ+¨μ2)))1],[E((In(ηη1))+(In(ηη2)))1,E((In(η+η1))+(In(η+η2)))1]))
    =((1E((In(1¨μ¨μ2))+(In(1¨μ¨μ1)))1,E((In(ηη2))+(In(ηη1)))1),([1E((In(1¨μ¨μ2))+(In(1¨μ¨μ1)))1,1E((In(1¨μ+¨μ2))+(In(1¨μ+¨μ1)))1],[E((In(ηη2))+(In(ηη1)))1,E((In(η+η2))+(In(η+η1)))1]))=/CuIF2/CuIF1.

    2) Let

    /CuIF1/CuIF2=((E((In(¨μ¨μ1))+(In(¨μ¨μ2)))1,1E((In(1ηη1))+(In(1ηη2)))1),([E((In(¨μ¨μ1))+(In(¨μ¨μ2)))1,E((In(¨μ+¨μ1))+(In(¨μ+¨μ2)))1],[1E((In(1ηη1))+(In(1ηη2)))1,1E((In(1η+η1))+(In(1η+η2)))1]))=((E((In(¨μ¨μ2))+(In(¨μ¨μ1)))1,1E((In(1ηη2))+(In(1ηη1)))1),([E((In(¨μ¨μ2))+(In(¨μ¨μ1)))1,E((In(¨μ+¨μ2))+(In(¨μ+¨μ1)))1],[1E((In(1ηη2))+(In(1ηη1)))1,1E((In(1η+η2))+(In(1η+η1)))1]))=/CuIF2/CuIF1.

    3) Consider

    ¨s/CuIF1¨s/CuIF2=((1E(¨s(In(1¨μ¨μ1)))1,E(¨s(In(ηη1)))1),([1E(¨s(In(1¨μ¨μ1)))1,1E(¨s(In(1¨μ+¨μ1)))1],[E(¨s(In(ηη1)))1,E(¨s(In(η+η1)))1]))((1E(¨s(In(1¨μ¨μ2)))1,E(¨s(In(ηη2)))1),([1E(¨s(In(1¨μ¨μ2)))1,1E(¨s(In(1¨μ+¨μ2)))1],[E(¨s(In(ηη2)))1,E(¨s(In(η+η2)))1]))
    =((1E(s(In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,E(s(In(ηη1))+(In(ηη2)))1),([1E(s(In(1¨μ¨μ1))+(In(1¨μ¨μ2)))1,1E(s(In(1¨μ+¨μ1))+(In(1¨μ+¨μ2)))1],[E(s(In(ηη1))+(In(ηη2)))1,E(s(In(η+η1))+(In(η+η2)))1]))=¨s(/CuIF1/CuIF2).

    4) Assume that

    (/CuIF1)¨s(/CuIF2)¨s=((E(¨s(In(¨μ¨μ1)))1,1E(¨s(In(1ηη1)))1),([E(¨s(In(¨μ¨μ1)))1,E(¨s(In(¨μ+¨μ1)))1],[1E(¨s(In(1ηη1)))1,1E(¨s(In(1η+η1)))1]))((E(¨s(In(¨μ¨μ2)))1,1E(¨s(In(1ηη2)))1),([E(¨s(In(¨μ¨μ2)))1,E(¨s(In(¨μ+¨μ2)))1],[1E(¨s(In(1ηη2)))1,1E(¨s(In(1η+η2)))1]))
    =((E(¨s(In(¨μ¨μ1))+(In(¨μ¨μ2)))1,1E(¨s(In(1ηη1))+(In(1ηη2)))1),([E(¨s(In(¨μ¨μ1))+(In(¨μ¨μ2)))1,E(¨s(In(¨μ+¨μ1))+(In(¨μ+¨μ2)))1],[1E(¨s(In(1ηη1))+(In(1ηη2)))1,1E(¨s(In(1η+η1))+(In(1η+η2)))1]))=(/CuIF1/CuIF2)¨s.

    In this section, we develop the novel CIFAAWA operator, CIFAAOWA operator, CIFAAHA operator, CIFAAWG operator, CIFAAOWG operator, and CIFAAHG operator. These operators are the combination of the Aczel-Alsina operational and CIFNs. Furthermore, we have also stated some fundamental properties for the above results.

    Definition 6: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAWA operator is defined as:

    CuIFAAWA:z,byCuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)=¨s1/CuIF1¨s2/CuIF2¨sz/CuIFz=zω=1¨sω/CuIFω. (12)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1.

    Theorem 2: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that Eq (12) is also a CIFN, such as

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)=((1E(zω=1¨sω(In(1¨μ¨μω)))1,E(zω=1¨sω(In(ηηω)))1),([1E(zω=1¨sω(In(1¨μ¨μω)))1,1E(zω=1¨sω(In(1¨μ+¨μω)))1],[E(zω=1¨sω(In(ηηω)))1,E(zω=1¨sω(In(η+ηω)))1])). (13)

    Proof. To prove Eq (13), we used mathematical induction. For this, first, we considered the value of z=2, we have

    ¨s1/CuIF1=((1E(¨s1(In(1¨μ¨μ1)))1,E(¨s1(In(ηη1)))1),([1E(¨s1(In(1¨μ¨μ1)))1,1E(¨s1(In(1¨μ+¨μ1)))1],[E(¨s1(In(ηη1)))1,E(¨s1(In(η+η1)))1])),
    ¨s2/CuIF2=((1E(¨s2(In(1¨μ¨μ2)))1,E(¨s2(In(ηη2)))1),([1E(¨s2(In(1¨μ¨μ2)))1,1E(¨s2(In(1¨μ+¨μ2)))1],[E(¨s2(In(ηη2)))1,E(¨s2(In(η+η2)))1])),
    CuIFAAWA(/CuIF1,/CuIF2)=¨s1/CuIF1¨s2/CuIF2=((1E(¨s1(In(1¨μ¨μ1)))1,E(¨s1(In(ηη1)))1),([1E(¨s1(In(1¨μ¨μ1)))1,1E(¨s1(In(1¨μ+¨μ1)))1],[E(¨s1(In(ηη1)))1,E(¨s1(In(η+η1)))1]))((1E(¨s2(In(1¨μ¨μ2)))1,E(¨s2(In(ηη2)))1),([1E(¨s2(In(1¨μ¨μ2)))1,1E(¨s2(In(1¨μ+¨μ2)))1],[E(¨s2(In(ηη2)))1,E(¨s2(In(η+η2)))1]))=((1E(2ω=1¨sω(In(1¨μ¨μω)))1,E(2ω=1¨sω(In(ηηω)))1),([1E(2ω=1¨sω(In(1¨μ¨μω)))1,1E(2ω=1¨sω(In(1¨μ+¨μω)))1],[E(2ω=1¨sω(In(ηηω)))1,E(2ω=1¨sω(In(η+ηω)))1])).

    Equation (13) is correct for z=2.

    We consider that it is also correct for z=y, thus

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFy)=((1E(yω=1¨sω(In(1¨μ¨μω)))1,E(yω=1¨sω(In(ηηω)))1),([1E(yω=1¨sω(In(1¨μ¨μω)))1,1E(yω=1¨sω(In(1¨μ+¨μω)))1],[E(yω=1¨sω(In(ηηω)))1,E(yω=1¨sω(In(η+ηω)))1])).

    Then, we prove that the Eq (13) is also correct for z=y+1, such as

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)=¨s1/CuIF1¨s2/CuIF2¨sy/CuIFy¨sy+1/CuIFy+1=yω=1¨sω/CuIFω¨sy+1/CuIFy+1=((1E(yω=1¨sω(In(1¨μ¨μω)))1,E(yω=1¨sω(In(ηηω)))1),([1E(yω=1¨sω(In(1¨μ¨μω)))1,1E(yω=1¨sω(In(1¨μ+¨μω)))1],[E(yω=1¨sω(In(ηηω)))1,E(yω=1¨sω(In(η+ηω)))1]))¨sy+1/CuIFy+1
    =((1E(yω=1¨sω(In(1¨μ¨μω)))1,E(yω=1¨sω(In(ηηω)))1),([1E(yω=1¨sω(In(1¨μ¨μω)))1,1E(yω=1¨sω(In(1¨μ+¨μω)))1],[E(yω=1¨sω(In(ηηω)))1,E(yω=1¨sω(In(η+ηω)))1]))((1E(¨sy+1(In(1¨μ¨μy+1)))1,E(¨sy+1(In(ηηy+1)))1),([1E(¨sy+1(In(1¨μ¨μy+1)))1,1E(¨sy+1(In(1¨μ+¨μy+1)))1],[E(¨sy+1(In(ηηy+1)))1,E(¨sy+1(In(η+ηy+1)))1]))
    =((1E(y+1ω=1¨sω(In(1¨μ¨μω)))1,E(y+1ω=1¨sω(In(ηηω)))1),([1E(y+1ω=1¨sω(In(1¨μ¨μω)))1,1E(y+1ω=1¨sω(In(1¨μ+¨μω)))1],[E(y+1ω=1¨sω(In(ηηω)))1,E(y+1ω=1¨sω(In(η+ηω)))1])).

    Hence, Eq (13) is correct for all positive values of z.

    Property 1: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (14)

    Proof. Let /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, thus

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)=((1E(zω=1¨sω(In(1¨μ¨μω)))1,E(zω=1¨sω(In(ηηω)))1),([1E(zω=1¨sω(In(1¨μ¨μω)))1,1E(zω=1¨sω(In(1¨μ+¨μω)))1],[E(zω=1¨sω(In(ηηω)))1,E(zω=1¨sω(In(η+ηω)))1]))=((1E(zω=1¨sω(In(1¨μ¨μ)))1,E(zω=1¨sω(In(ηη)))1),([1E(zω=1¨sω(In(1¨μ¨μ)))1,1E(zω=1¨sω(In(1¨μ+¨μ)))1],[E(zω=1¨sω(In(ηη)))1,E(zω=1¨sω(In(η+η)))1]))=((1E((In(1¨μ¨μ)))1,E((In(ηη)))1),([1E((In(1¨μ¨μ)))1,1E((In(1¨μ+¨μ)))1],[E((In(ηη)))1,E((In(η+η)))1])),(zω=1¨sω=1)
    =((1EIn(1¨μ¨μ),EIn(ηη)),([1EIn(1¨μ¨μ),1EIn(1¨μ+¨μ)],[EIn(ηη),EIn(η+η)]))=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η]))=/CuIF.

    Property 2: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAWA(CuIF1,CuIF2,,CuIFz). (15)

    Proof. Consider that /CuIFωCuIFω, which means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, thus

    ¨μ¨μω¨μ¨μω1¨μ¨μω1¨μ¨μωIn(1¨μ¨μω)In(1¨μ¨μω)In(1¨μ¨μω)In(1¨μ¨μω)(zω=1¨sω(In(1¨μ¨μω)))1(zω=1¨sω(In(1¨μ¨μω)))1(zω=1¨sω(In(1¨μ¨μω)))1(zω=1¨sω(In(1¨μ¨μω)))1E(zω=1¨sω(In(1¨μ¨μω)))1E(zω=1¨sω(In(1¨μ¨μω)))1E(zω=1¨sω(In(1¨μ¨μω)))1E(zω=1¨sω(In(1¨μ¨μω)))11E(zω=1¨sω(In(1¨μ¨μω)))11E(zω=1¨sω(In(1¨μ¨μω)))1.

    Similarly, for the lower and upper parts of the truth grade, we have

    1E(zω=1¨sω(In(1¨μ¨μω)))11E(zω=1¨sω(In(1¨μ¨μω)))11E(zω=1¨sω(In(1¨μ+¨μω)))11E(zω=1¨sω(In(1¨μ+¨μω)))1.

    Further, for the falsity of information, we have

    ηηωηηωIn(ηηω)In(ηηω)In(ηηω)In(ηηω)zω=1¨sω(In(ηηω))zω=1¨sω(In(ηηω))(zω=1¨sω(In(ηηω)))1(zω=1¨sω(In(ηηω)))1E(zω=1¨sω(In(ηηω)))1E(zω=1¨sω(In(ηηω)))1.

    Similarly, for the lower and upper parts of the falsity grade, we have

    E(zω=1¨sω(In(ηηω)))1E(zω=1¨sω(In(ηηω)))1E(zω=1¨sω(In(η+ηω)))1E(zω=1¨sω(In(η+ηω)))1.

    Finally, by the score function and accuracy function, we can easily get the following results, such as

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAWA(CuIF1,CuIF2,,CuIFz).

    Property 3: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (16)

    Proof. Considering Property 1 and Property 2, we have

    CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAWA(+CuIF1,+CuIF2,,+CuIFz)=+CuIFω,CuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAWA(CuIF1,CuIF2,,CuIFz)=CuIFω.

    Thus, we have

    CuIFωCuIFAAWA(/CuIF1,/CuIF2,,/CuIFz)+CuIFω.

    Definition 7: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAOWA operator is defined as

    CuIFAAOWA:z,byCuIFAAOWA(/CuIF1,/CuIF2,,/CuIFz)=¨s1/CuIF0(1)¨s2/CuIF0(2)¨sz/CuIFo(z)=zω=1¨sω/CuIF0(ω). (17)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1 with 0(ω)0(ω1), where we can get the order of the CIFNs by the score function.

    Theorem 3: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that Eq (17) is also a CIFN, such as

    CuIFAAOWA(/CuIF1,/CuIF2,,/CuIFz)=((1E(zω=1¨sω(In(1¨μ¨μ0(ω))))1,E(zω=1¨sω(In(ηη0(ω))))1),([1E(zω=1¨sω(In(1¨μ¨μ0(ω))))1,1E(zω=1¨sω(In(1¨μ+¨μ0(ω))))1],[E(zω=1¨sω(In(ηη0(ω))))1,E(zω=1¨sω(In(η+η0(ω))))1])). (18)

    Proof. Straightforward.

    Property 4: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAOWA(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (19)

    Proof. Straightforward.

    Property 5: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAOWA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAOWA(CuIF1,CuIF2,,CuIFz). (20)

    Proof. Straightforward.

    Property 6: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAOWA(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (21)

    Proof. Straightforward.

    Definition 8: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAHA operator is defined as

    CuIFAAHA:z,byCuIFAAHA(/CuIF1,/CuIF2,,/CuIFz)=¨s1CuIF0(1)¨s2CuIF0(2)¨szCuIFo(z)=zω=1¨sωCuIF0(ω). (22)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1 with 0(ω)0(ω1), where we can get the order of the CIFN by the score function and CuIF0(ω)=z¨wω/CuIFω,ω=1,2,,z with another weight vector ¨wω[0,1] with zω=1¨wω=1.

    Theorem 4: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that Eq (22) is also a CIFN, such as

    CuIFAAHA(/CuIF1,/CuIF2,,/CuIFz)=((1E(zω=1¨sω(In(1¨μ¨μ0(ω))))1,E(zω=1¨sω(In(ηη0(ω))))1),([1E(zω=1¨sω(In(1¨μ¨μ0(ω))))1,1E(zω=1¨sω(In(1¨μ¨μ0(ω)+)))1],[E(zω=1¨sω(In(ηη0(ω))))1,E(zω=1¨sω(In(ηη0(ω)+)))1])). (23)

    Proof. Straightforward.

    Property 7: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAHA(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (24)

    Proof. Straightforward.

    Property 8: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAHA(/CuIF1,/CuIF2,,/CuIFz)CuIFAAHA(CuIF1,CuIF2,,CuIFz). (25)

    Proof. Straightforward.

    Property 9: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAHA(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (26)

    Proof. Straightforward.

    Definition 9: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAWG operator is defined as:

    CuIFAAWG:z,byCuIFAAWG(/CuIF1,/CuIF2,,/CuIFz)=(/CuIF1)¨s1(/CuIF2)¨s2(/CuIFz)¨sz=zω=1(/CuIFω)¨sω. (27)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1.

    Theorem 5: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that the Eq (27) is also a CIFN, such as

    CuIFAAWG(/CuIF1,/CuIF2,,/CuIFz)=((E(zω=1¨sω(In(¨μ¨μω)))1,1E(zω=1¨sω(In(1ηηω)))1),([E(zω=1¨sω(In(¨μ¨μω)))1,E(zω=1¨sω(In(¨μ+¨μω)))1],[1E(zω=1¨sω(In(1ηηω)))1,1E(zω=1¨sω(In(1η+ηω)))1])). (28)

    Proof. Straightforward.

    Property 10: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAWG(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (29)

    Proof. Straightforward.

    Property 11: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAWG(/CuIF1,/CuIF2,,/CuIFz)CuIFAAWG(CuIF1,CuIF2,,CuIFz). (30)

    Proof. Straightforward.

    Property 12: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAWG(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (31)

    Proof. Straightforward.

    Definition 10: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAOWG operator is defined as:

    CuIFAAOWG:z,by

    CuIFAAOWG(/CuIF1,/CuIF2,,/CuIFz)=(/CuIF0(1))¨s1(/CuIF0(2))¨s2(/CuIF0(z))¨sz=zω=1(/CuIF0(ω))¨sω. (32)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1 with 0(ω)0(ω1), where we can get the order of the CIFN by the score function.

    Theorem 6: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that the Eq (32) is also a CIFN, such as

    CuIFAAOWG(/CuIF1,/CuIF2,,/CuIFz)=((E(zω=1¨sω(In(¨μ¨μ0(ω))))1,1E(zω=1¨sω(In(1ηη0(ω))))1),([E(zω=1¨sω(In(¨μ¨μ0(ω))))1,E(zω=1¨sω(In(¨μ+¨μ0(ω))))1],[1E(zω=1¨sω(In(1ηη0(ω))))1,1E(zω=1¨sω(In(1η+η0(ω))))1])). (33)

    Proof. Straightforward.

    Property 13: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAOWG(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (34)

    Proof. Straightforward.

    Property 14: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAOWG(/CuIF1,/CuIF2,,/CuIFz)CuIFAAOWG(CuIF1,CuIF2,,CuIFz). (35)

    Proof. Straightforward.

    Property 15: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAOWG(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (36)

    Proof. Straightforward.

    Definition 11: For the finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, then the CIFAAHG operators are defined as:

    CuIFAAHG:z,by

    CuIFAAHG(/CuIF1,/CuIF2,,/CuIFz)=(CuIF0(1))¨s1(CuIF0(2))¨s2(CuIFo(z))¨sz=zω=1(CuIF0(ω))¨sω. (37)

    Note that the weighted vector is stated by: ¨sω[0,1] with zω=1¨sω=1 with 0(ω)0(ω1), where we can get the order of the CIFN by the score function and CuIF0(ω)=z¨wω/CuIFω,ω=1,2,,z with another weight vector ¨wω[0,1] with zω=1¨wω=1.

    Theorem 7: For any finite collection of CIFNs /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z, we proved that Eq (37) is also a CIFN, such as

    CuIFAAHG(/CuIF1,/CuIF2,,/CuIFz)=((E(zω=1¨sω(In(¨μ¨μ0(ω))))1,1E(zω=1¨sω(In(1ηη0(ω))))1),([E(zω=1¨sω(In(¨μ¨μ0(ω))))1,E(zω=1¨sω(In(¨μ¨μ0(ω)+)))1],[1E(zω=1¨sω(In(1ηη0(ω))))1,1E(zω=1¨sω(In(1ηη0(ω)+)))1])). (38)

    Proof. Straightforward.

    Property 16: If /CuIFω=/CuIF=((¨μ¨μ,ηη),([¨μ¨μ,¨μ+¨μ],[ηη,η+η])),ω=1,2,,z, then

    CuIFAAHG(/CuIF1,/CuIF2,,/CuIFz)=/CuIF. (39)

    Proof. Straightforward.

    Property 17: If /CuIFωCuIFω, it means that ¨μ¨μω¨μ¨μω,ηηωηηω and ¨μ¨μω¨μ¨μω,¨μ+¨μω¨μ+¨μω,ηηωηηω,η+ηωη+ηω, then

    CuIFAAHG(/CuIF1,/CuIF2,,/CuIFz)CuIFAAHG(CuIF1,CuIF2,,CuIFz). (40)

    Proof. Straightforward.

    Property 18: If CuIFω=((minω¨μ¨μω,maxωηηω),([minω¨μ¨μω,minω¨μ+¨μω],[maxωηηω,maxωη+ηω])) and +CuIFω=((maxω¨μ¨μω,minωηηω),([maxω¨μ¨μω,maxω¨μ+¨μω],[minωηηω,minωη+ηω])), then

    CuIFωCuIFAAHG(/CuIF1,/CuIF2,,/CuIFz)+CuIFω. (41)

    Proof. Straightforward.

    In this section, we select the best type of artificial neural network among the five artificial neural networks based on the proposed method for CIFS. Furthermore, according to the internet, ANNs mean "artificial neural networks", which are the collection of computational techniques motivated by the shape and specification of biological neural networks discovered in the human brain. Based on the CIFAAWA operator and CIFAAWG operator, we select the best one among five artificial neural networks.

    For this, we collect a finite collection of alternatives CuIF1,CuIF2,,CuIFz and for each alternative, we have the collection of finite attributes atributECuIF1,atributECuIF2,,atributECuIFn with well-known weight vectors ¨sω[0,1] with zω=1¨sω=1. Further, we get a matrix with the CIF values, where 0¨μ¨μ(α)+ηη(α)1 and 0¨μ+¨μ(α)+η+η(α)1, and [¨μ¨μ(α),¨μ+¨μ(α)] and [ηη(α),η+η(α)] represent the interval-valued truth and interval-valued falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=[¨ϑ¨ϑ(α),¨ϑ+¨ϑ(α)]=[1¨μ+¨μ(α)+η+η(α),1¨μ¨μ(α)+ηη(α)], where ¨μ¨μ(α) and ηη(α) represent the truth and falsity degrees with a neutral grade ¨ϑ¨ϑ(α)=1(¨μ¨μ(α)+ηη(α)). Moreover, the simple form of the CIF number (CIFN) is shown by: /CuIFω=((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω])),ω=1,2,,z. After getting the matrix, we will use the following procedure for evaluating the best decision between five decisions. The geometrical representation of the proposed algorithm is mentioned in Figure 3.

    Figure 3.  The geometrical shape of the proposed algorithm.

    Step 1: During the collection of CIF values, we have two possibilities, such as benefit or cost type of information, if we have cost type of data in the decision matrix, then we aim to normalize the matrix, such as

    N={((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω]))forbenefit,((ηηω,¨μ¨μω),([ηηω,η+ηω],[¨μ¨μω,¨μ+¨μω]))forcost.

    However, if we have a benefit type of data, we do not need to normalize the data.

    Step 2: For aggregating the normalized data into a singleton one, we use the CIFAAWA operator and CIFAAWG operator.

    Step 3: For getting the score values, we use Eq (4) or Eq (5).

    Step 4: Ranking the order of the alternatives based on their score values to examine the best optimal among the five ones.

    Further, we simplify the above procedure with the help of some practical examples, which are related to artificial neural networks. For this, we consider five artificial neural networks and select the best one.

    The ANN technique is used in many fields because of their features and dominancy. In this example, we aim to consider five alternatives, and for each alternative, we have four attributes with weight vectors (0.25,0.25,0.25,0.25)T. Furthermore, each alternative can be stated below:

    1) Feedforward Neural Networks (FNNs) " CuIF1": FNNs are the valuable and simple kind of ANNs, containing input, hidden, and output layers.

    2) Recurrent Neural Networks (RNNs) " CuIF2": RNNs are specially constructed for coping with sequential information like time series or natural language.

    3) Long Short-Term Memory Networks (LSTMs) " CuIF3": LSTMs are a valuable and dominant type of RNN that evaluates the vanishing gradient problems.

    4) Convolutional Neural Networks (CNNs) " CuIF4": CNNs are specifically designed for the primary computer vision tasks.

    5) Generative Adversarial Networks (GANs) " CuIF5": GANs consist of two ANNs, a generator, and a discriminator, that are trained together in a game-like setting.

    To choose the best one, we use the following features which are stated as the main attribute or criteria, such as: atributECuIF1: Risk analysis, atributECuIF2: Growth analysis, atributECuIF3: Enviromental impact, and atributECuIF4: Social and political impact. Then, we get the data in Table 2.

    Table 2.  Cubic intuitionistic fuzzy decision matrix.
    AtributECuIF1 AtributECuIF2
    CuIF1 ((0.2,0.7),([0.2,0.3],[0.4,0.5])) ((0.71,0.21),([0.41,0.51],[0.21,0.31]))
    CuIF2 ((0.1,0.5),([0.1,0.2],[0.2,0.4])) ((0.51,0.11),([0.21,0.41],[0.11,0.21]))
    CuIF3 ((0.2,0.4),([0.3,0.4],[0.3,0.5])) ((0.41,0.21),([0.31,0.51],[0.31,0.41]))
    CuIF4 ((0.2,0.3),([0.1,0.2],[0.1,0.2])) ((0.31,0.21),([0.11,0.21],[0.11,0.21]))
    CuIF5 ((0.1,0.8),([0.1,0.2],[0.5,0.6])) ((0.81,0.11),([0.51,0.61],[0.11,0.21]))
    AtributECuIF3 AtributECuIF4
    CuIF1 ((0.72,0.22),([0.42,0.52],[0.22,0.32])) ((0.73,0.23),([0.43,0.53],[0.23,0.33]))
    CuIF2 ((0.52,0.12),([0.22,0.42],[0.12,0.22])) ((0.53,0.13),([0.23,0.43],[0.13,0.23]))
    CuIF3 ((0.42,0.22),([0.32,0.52],[0.32,0.42])) ((0.43,0.23),([0.33,0.53],[0.33,0.43]))
    CuIF4 ((0.32,0.22),([0.12,0.22],[0.12,0.22])) ((0.33,0.23),([0.13,0.23],[0.13,0.23]))
    CuIF5 ((0.82,0.12),([0.52,0.62],[0.12,0.22])) ((0.83,0.13),([0.53,0.63],[0.13,0.23]))

     | Show Table
    DownLoad: CSV

    After getting the matrix, we will use the following procedure to get the best decision, such as:

    Step 1: Because AtributECuIF1 is the cost type, we aim to normalize the matrix in Table 2, such as

    N={((¨μ¨μω,ηηω),([¨μ¨μω,¨μ+¨μω],[ηηω,η+ηω]))forbenefit,((ηηω,¨μ¨μω),([ηηω,η+ηω],[¨μ¨μω,¨μ+¨μω]))forcost.

    then the normalized matrix is given in Table 3.

    Table 3.  Normalized Cubic intuitionistic fuzzy decision matrix.
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{1}}^{\boldsymbol{A}\boldsymbol{t}\boldsymbol{r}\boldsymbol{i}\boldsymbol{b}\boldsymbol{u}\boldsymbol{t}\mathfrak{E}} {\mathfrak{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{2}}^{\boldsymbol{A}\boldsymbol{t}\boldsymbol{r}\boldsymbol{i}\boldsymbol{b}\boldsymbol{u}\boldsymbol{t}\mathfrak{E}}
    {\mathfrak{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{1}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.7, 0.2}\right), \\ \left(\left[\mathrm{0.4, 0.5}\right], \left[\mathrm{0.2, 0.3}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.71, 0.21}\right), \\ \left(\left[\mathrm{0.41, 0.51}\right], \left[\mathrm{0.21, 0.31}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{2}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.5, 0.1}\right), \\ \left(\left[\mathrm{0.2, 0.4}\right], \left[\mathrm{0.1, 0.2}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.51, 0.11}\right), \\ \left(\left[\mathrm{0.21, 0.41}\right], \left[\mathrm{0.11, 0.21}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{3}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.4, 0.2}\right), \\ \left(\left[\mathrm{0.3, 0.5}\right], \left[\mathrm{0.3, 0.4}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.41, 0.21}\right), \\ \left(\left[\mathrm{0.31, 0.51}\right], \left[\mathrm{0.31, 0.41}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{4}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.3, 0.2}\right), \\ \left(\left[\mathrm{0.1, 0.2}\right], \left[\mathrm{0.1, 0.2}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.31, 0.21}\right), \\ \left(\left[\mathrm{0.11, 0.21}\right], \left[\mathrm{0.11, 0.21}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{5}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.8, 0.1}\right), \\ \left(\left[\mathrm{0.5, 0.6}\right], \left[\mathrm{0.1, 0.2}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.81, 0.11}\right), \\ \left(\left[\mathrm{0.51, 0.61}\right], \left[\mathrm{0.11, 0.21}\right]\right)\end{array}\right)
    {℉}_{CuI{F}_{3}}^{Atribut\mathfrak{E}} {\mathfrak{℉}}_{CuI{F}_{4}}^{Atribut\mathfrak{E}}
    {\mathfrak{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{1}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.72, 0.22}\right), \\ \left(\left[\mathrm{0.42, 0.52}\right], \left[\mathrm{0.22, 0.32}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.73, 0.23}\right), \\ \left(\left[\mathrm{0.43, 0.53}\right], \left[\mathrm{0.23, 0.33}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{2}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.52, 0.12}\right), \\ \left(\left[\mathrm{0.22, 0.42}\right], \left[\mathrm{0.12, 0.22}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.53, 0.13}\right), \\ \left(\left[\mathrm{0.23, 0.43}\right], \left[\mathrm{0.13, 0.23}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{3}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.42, 0.22}\right), \\ \left(\left[\mathrm{0.32, 0.52}\right], \left[\mathrm{0.32, 0.42}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.43, 0.23}\right), \\ \left(\left[\mathrm{0.33, 0.53}\right], \left[\mathrm{0.33, 0.43}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{4}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.32, 0.22}\right), \\ \left(\left[\mathrm{0.12, 0.22}\right], \left[\mathrm{0.12, 0.22}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.33, 0.23}\right), \\ \left(\left[\mathrm{0.13, 0.23}\right], \left[\mathrm{0.13, 0.23}\right]\right)\end{array}\right)
    {\boldsymbol{℉}}_{\boldsymbol{C}\boldsymbol{u}\boldsymbol{I}{\boldsymbol{F}}_\mathbf{5}}^{\boldsymbol{*}\boldsymbol{*}} \left(\begin{array}{c}\left(\mathrm{0.82, 0.12}\right), \\ \left(\left[\mathrm{0.52, 0.62}\right], \left[\mathrm{0.12, 0.22}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.83, 0.13}\right), \\ \left(\left[\mathrm{0.53, 0.63}\right], \left[\mathrm{0.13, 0.23}\right]\right)\end{array}\right)

     | Show Table
    DownLoad: CSV

    Step 2: For aggregating the normalized data into a singleton one, we use the CIFAAWA operator and CIFAAWG operator to get the results, shown in Table 4.

    Table 4.  Aggregated decision matrix.
    CIFAAWA Operator CIFAAWG Operator
    {℉}_{CuI{F}_{1}}^{**} \left(\begin{array}{c}\left(\mathrm{0.4204, 0.5126}\right), \\ \left(\left[\mathrm{0.2077, 0.2697}\right], \left[\mathrm{0.5126, 0.6053}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.8643, 0.0998}\right), \\ \left(\left[\mathrm{0.6824, 0.7495}\right], \left[\mathrm{0.0998, 0.1515}\right]\right)\end{array}\right)
    {℉}_{CuI{F}_{2}}^{**} \left(\begin{array}{c}\left(\mathrm{0.2697, 0.3900}\right), \\ \left(\left[\mathrm{0.0998, 0.2077}\right], \left[\mathrm{0.3900, 0.5126}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.7495, 0.0517}\right), \\ \left(\left[\mathrm{0.5126, 0.6824}\right], \left[\mathrm{0.0517, 0.0998}\right]\right)\end{array}\right)
    {℉}_{CuI{F}_{3}}^{**} \left(\begin{array}{c}\left(\mathrm{0.2077, 0.5126}\right), \\ \left(\left[\mathrm{0.1515, 0.2697}\right], \left[\mathrm{0.6053, 0.6824}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.6824, 0.0998}\right), \\ \left(\left[\mathrm{0.6053, 0.7495}\right], \left[\mathrm{0.1515, 0.2077}\right]\right)\end{array}\right)
    {℉}_{CuI{F}_{4}}^{**} \left(\begin{array}{c}\left(\mathrm{0.1515, 0.5126}\right), \\ \left(\left[\mathrm{0.0517, 0.0998}\right], \left[\mathrm{0.3900, 0.5126}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.6053, 0.0998}\right), \\ \left(\left[\mathrm{0.3900, 0.5126}\right], \left[\mathrm{0.0517, 0.0998}\right]\right)\end{array}\right)
    {℉}_{CuI{F}_{5}}^{**} \left(\begin{array}{c}\left(\mathrm{0.5198, 0.3900}\right), \\ \left(\left[\mathrm{0.2697, 0.3394}\right], \left[\mathrm{0.3900, 0.5126}\right]\right)\end{array}\right) \left(\begin{array}{c}\left(\mathrm{0.5149, 0.0517}\right), \\ \left(\left[\mathrm{0.7495, 0.8096}\right], \left[\mathrm{0.0517, 0.0998}\right]\right)\end{array}\right)

     | Show Table
    DownLoad: CSV

    Step 3: For getting the score values, we use Eq (4) to calculate it, as shown in Table 5.

    Table 5.  The score values of the aggregated values.
    CIFAAWA Operator CIFAAWG Operator
    {℉}_{CuI{F}_{1}}^{**} -0.20622 0.67741
    {℉}_{CuI{F}_{2}}^{**} -0.20895 0.6098
    {℉}_{CuI{F}_{3}}^{**} -0.36904 0.54018
    {℉}_{CuI{F}_{4}}^{**} -0.36835 0.44056
    {℉}_{CuI{F}_{5}}^{**} -0.00851 0.78353

     | Show Table
    DownLoad: CSV

    Step 4: We can get the ranking order of the alternatives based on their score values, and get the best optimal among the five ones, see Table 6.

    Table 6.  Ranking values.
    Methods Ranking values Best decision
    CIFAAWA Operator {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**} {℉}_{CuI{F}_{5}}^{**}
    CIFAAWG Operator {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} {℉}_{CuI{F}_{5}}^{**}

     | Show Table
    DownLoad: CSV

    From the Table 6, we observed that the best optimal is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) by the two different techniques based on CIFSs. Further, we try to discuss different types of cases using the data in Table 2. For instance, if we exclude the interval-valued information from the data in Table 2, then the aggregated values are shown in Table 7.

    Table 7.  Score values of IFSs.
    IFAAWA Operator IFAA WG Operator
    {℉}_{CuI{F}_{1}}^{**} -0.0922 0.7645
    {℉}_{CuI{F}_{2}}^{**} -0.1203 -0.2975
    {℉}_{CuI{F}_{3}}^{**} -0.3048 0.5825
    {℉}_{CuI{F}_{4}}^{**} -0.3610 0.5055
    {℉}_{CuI{F}_{5}}^{**} 0.1297 0.8632

     | Show Table
    DownLoad: CSV

    Moreover, we derive the ranking order of the alternatives based on their score values and get the best optimal among the five (see Table 8).

    Table 8.  The ranking results are based on Table 7.
    Methods Ranking values Best decision
    IFAAWA Operator {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} {℉}_{CuI{F}_{5}}^{**}
    IFAAWG Operator {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**} {℉}_{CuI{F}_{5}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 8, we observed that the best optimal is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) by the two different techniques based on CIFSs.

    Further, we excluded the intuitionistic information from the data in Table 2. The aggregated values are shown in Table 9.

    Table 9.  Score values for IVIFSs.
    IVIFAAWA Operator
    (0.25, 0.25, 0.25, 0.25)
    IVIFAAWG Operator
    (0.25, 0.25, 0.25, 0.25)
    IVIFAAWA Operator
    (0.2, 0.3, 0.2, 0.3)
    IVIFAAWG Operator
    (0.2, 0.3, 0.2, 0.3)
    {℉}_{CuI{F}_{1}}^{**} -0.3202 0.5902 0.9575 0.9739
    {℉}_{CuI{F}_{2}}^{**} -0.2975 0.5217 0.944 0.9673
    {℉}_{CuI{F}_{3}}^{**} -0.4332 0.4977 0.9476 0.9558
    {℉}_{CuI{F}_{4}}^{**} -0.3756 0.3756 0.914 0.9452
    {℉}_{CuI{F}_{5}}^{**} -0.1467 0.7038 0.9682 0.9818

     | Show Table
    DownLoad: CSV

    Moreover, we derive the ranking order of the alternatives based on their score values and get the best optimal among the five (see Table 10).

    Table 10.  The ranking results from Table 9.
    Methods Ranking values Best decision
    CIFAAWA Operator
    (0.25, 0.25, 0.25, 0.25)
    {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**} {℉}_{CuI{F}_{5}}^{**}
    CIFAAWG Operator
    (0.25, 0.25, 0.25, 0.25)
    {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} {℉}_{CuI{F}_{5}}^{**}
    CIFAAWA Operator
    (0.2, 0.3, 0.2, 0.3)
    {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{1}}^{**} {℉}_{CuI{F}_{5}}^{**}
    CIFAAWG Operator
    (0.2, 0.3, 0.2, 0.3)
    {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} {℉}_{CuI{F}_{5}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 10, we observe that the best optimal is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) by the two different techniques based on CIFSs. This means that when we use only IFSs, IVIFSs, and CIF types of data, the proposed technique could easily get the same results. Moreover, we check the influence of the parameters and do a comparative analysis of the proposed method with some methods.

    In this subsection, we verify the stability or influences of the proposed work with the help of the different values of parameters \mathrm{\hslash }\mathrm{\hslash }\ge 1 .

    For this, we consider the data in Table 2, and then based on the CIFAAWA operator and CIFAAWG operators, we check the ranking results. For the CIFAAWA operator, the influence of the possible values of \mathrm{\hslash }\mathrm{\hslash } is shown in Table 11.

    Table 11.  Influence of the parameter based on the CIFAAWA operator.
    Parameter Score values Ranking results
    \mathrm{\hslash }\mathrm{\hslash }=1 -0.2062, -0.2089, -0.3690, -0.3683, -0.0085 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=3 -0.2056, -0.208, -0.3685, -0.3675, -0.0075 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=5 -0.2049, -0.2071, -0.3679, -0.3667, -0.0065 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=7 -0.2043, -0.2062, -0.3673, -0.3659, -0.0055 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=9 -0.2037, -0.2053, -0.3668, -0.3651, -0.0045 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=11 -0.2031, -0.2045, -0.3662, -0.3644, -0.0036 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 11, we observe that the best optimal is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) by the Aczel-Alsina weighted averaging based on CIFSs for all possible values of the parameter. Furthermore, the influence of the possible values of \mathrm{\hslash }\mathrm{\hslash } for the CIFAAWG operator is shown in Table 12.

    Table 12.  Influence of the parameter based on the CIFAAWG operator.
    Parameter Score values Ranking values
    \mathrm{\hslash }\mathrm{\hslash }=1 0.6774, 0.6098, 0.5401, 0.4405, 0.7835 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=3 0.6768, 0.609, 0.5396, 0.4398, 0.7827 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=5 0.6763, 0.6083, 0.5391, 0.439, 0.782 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=7 0.6757, 0.6076, 0.5386, 0.4382, 0.7813 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=9 0.6752, 0.6069, 0.5381, 0.4374, 0.7806 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    \mathrm{\hslash }\mathrm{\hslash }=11 0.6747, 0.6063, 0.5375, 0.4367, 0.7799 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 12, we observe that the best optimal is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) by the Aczel-Alsina weighted geometric based on CIFSs for all possible values of the parameter. Furthermore, we use the data in Table 2 to perform a comparative analysis of the proposed method with some existing methods.

    In this subsection, our main target is to compare the proposed method with some existing methods to show the effectiveness of the derived method. For this, we consider the following existing methods, for instance, Xu [14] addressed the AOs for IFSs. Moreover, Xu and Yager [16] developed the geometric AOs for IFSs. Wang et al. [18] presented the AOs for IVIFSs. Further, Senapati et al. [19] derived the geometric AOs for IVIFSs. Wei and Wang [21] addressed the geometric AOs for IVIFSs. Moreover, Xu and Chen [22] presented the geometric AOs for IVIFSs. Kaur and Garg [25] developed the AOs for the CIF set. Finally, Kaur and Garg [26] proposed the generalized AOs for CIF values. Based on the data in Table 2, the comparative analysis is shown in Table 13.

    Table 13.  Comparative analysis for the CIF values.
    Methods Score values Ranking values
    Xu [14] Failed Failed
    Xu and Yager [16] Failed Failed
    Wang et al. [18] Failed Failed
    Senapati et al. [19] Failed Failed
    Wei and Wang [21] Failed Failed
    Xu and Chen [22] Failed Failed
    Kaur and Garg [25] 0.3504, 0.2756, 0.1253, 0.0504, 0.5507 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Kaur and Garg [26] 0.3498, 0.2748, 0.1248, 0.0496, 0.5498 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    CIFAAWA operator -0.2062, -0.209, -0.369, -0.3683, -0.0085 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    CIFAAWG operator 0.6774, 0.6098, 0.5402, 0.4406, 0.7835 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 13, we see that the best decision is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) according to the proposed CIFAAWA, CIFAAWG, and the methods proposed by Kaur and Garg [25,26] because these operators are based on CIF information, but the other existing techniques failed to solve this problem because they are based on IFS or IVIFSs. If we use only the IFS from the data in Table 2, then the comparison is stated in Table 14.

    Table 14.  Comparative analysis for the IFSs.
    Methods Score values Ranking values
    Xu [14] 0.5005, 0.4007, 0.2004, 0.1004, 0.7009 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**}
    Xu and Yager [16] 0.4998, 0.3998, 0.1998, 0.0997, 0.6999 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**}
    Wang et al. [18] Failed Failed
    Senapati et al. [19] Failed Failed
    Wei and Wang [21] Failed Failed
    Xu and Chen [22] Failed Failed
    Kaur and Garg [25] 0.5005, 0.4007, 0.2004, 0.1004, 0.7009 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**}
    Kaur and Garg [26] 0.4998, 0.3998, 0.1998, 0.0997, 0.6999 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**}
    CIFAAWA operator -0.0922, -0.1203, -0.3048, -0.3610, 0.1297 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    CIFAAWG operator 0.7645, -0.2975, 0.5825, 0.5055, 0.8632 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{2}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 14, we see that the best decision is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) according to the proposed CIFAAWA, and CIFAAWG, the methods proposed by Kaur and Garg [25,26], Xu [14], and Xu and Yager [16], because these operators are based on CIF information or IFS, but the other techniques failed to solve this problem because they are based on IVIFSs. If we used only the IVIFS from the data in Table 2, then the comparison is shown in Table 15.

    Table 15.  Comparative analysis for the IVIFSs.
    Methods Score values Ranking values
    Xu [14] Failed Failed
    Xu and Yager [16] Failed Failed
    Wang et al. [18] 0.2004, 0.1505, 0.0503, 0.0005, 0.4006 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Senapati et al. [19] 0.9575, 0.9437, 0.9475, 0.913, 0.9682 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Wei and Wang [21] 0.1998, 0.1497, 0.0497, -0.0005, 0.3998 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Xu and Chen [22] 0.1998, 0.1497, 0.0497, -0.0005, 0.3998 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Kaur and Garg [25] 0.2004, 0.1505, 0.0503, 0.0005, 0.4006 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    Kaur and Garg [26] 0.1998, 0.1497, 0.0497, -0.0005, 0.3998 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}
    CIFAAWA operator -0.3202, -0.2975, -0.4332, -0.3756, -0.1467 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{4}}^{**} > {℉}_{CuI{F}_{3}}^{**}
    CIFAAWG operator 0.5902, 0.5217, 0.4977, 0.3756, 0.7038 {℉}_{CuI{F}_{5}}^{**} > {℉}_{CuI{F}_{1}}^{**} > {℉}_{CuI{F}_{2}}^{**} > {℉}_{CuI{F}_{3}}^{**} > {℉}_{CuI{F}_{4}}^{**}

     | Show Table
    DownLoad: CSV

    From Table 15, we see that the best decision is {℉}_{CuI{F}_{5}}^{**} (Generative Adversarial Networks (GANs)) according to the proposed CIFAAWA, CIFAAWG, the methods proposed by Kaur and Garg [25,26], Wang et al. [18], Senapati et al. [19], Wei and Wang [21], and Xu and Chen [22], because these operators are based on CIF information and IVIFS.However, the other techniques failed to solve this problem because they are based on IFSs. Hence the proposed method is massively powerful and dominant compared to the existing techniques.

    The model of cubic intuitionistic fuzzy sets is the combination of two different techniques, called cubic and intuitionistic fuzzy sets, and is a reliable technique to cope with vague and uncertain information. The major influences of this article are listed below:

    1) We addressed or computed the model of Aczel-Alsina operational laws under the consideration of the CIF set as well as AATN and AATCN, where the model of Algebraic norms and Drastic norms are the special parts of the Aczel-Alsina norms.

    2) Using the above invented operational laws, we aimed to develop the model of Aczel-Alsina average/geometric aggregation operators, called CIFAAWA, CIFAAOWA, CIFAAHA, CIFAAWG, CIFAAOWG, and CIFAAHG operators with some well-known and desirable properties.

    3) A procedure of decision-making technique is presented for finding the best type of artificial neural networks with the help of MADM problems based on CIF aggregation information.

    4) We determined a numerical example for showing the rationality and advantages of the developed method by comparing their ranking values with the ranking values of many prevailing tools.

    The model of cubic intuitionistic fuzzy sets is very flexible but due to ambiguity and problems, they are not working in many places. For instance, when a person provides information in the form of yes, no, and abstinence, then the model of the CIF set has been failed. For this, we aim to compute the model of cubic picture fuzzy sets and their extensions.

    In the future, we will extend the Aczel-Alsina operators to complex cubic intuitionistic fuzzy, Pythagorean fuzzy, q-rung orthopair fuzzy, and their extensions. Further, we will also concentrate on their application in green supply chain management, artificial intelligence, road signals, and decision-making problems.

    Chunxiao Lu: Conceptualization, methodology, investigation, validation, writing–review and editing; Zeeshan Ali: methodology, formal analysis, validation, software, writing–original draft preparation; Peide Liu: Conceptualization, software, supervision, fund, writing–review and editing.

    About the publication of this manuscript, the authors declare that they have no conflict of interest.



    [1] G. A. Klein, Strategies of decision making, Mil. Rev., 69 (1989), 56–64.
    [2] C. R. Schwenk, Strategic decision making, J. Manag., 21 (1995), 471–493. https://doi.org/10.1016/0149-2063(95)90016-0 doi: 10.1016/0149-2063(95)90016-0
    [3] D. H. Jonassen, designing for decision making, Education Tech. Res. Dev., 60 (2012), 341–359. https://doi.org/10.1007/s11423-011-9230-5 doi: 10.1007/s11423-011-9230-5
    [4] J. Peterson, Decision‐making in the European Union: Towards a framework for analysis, J. Eur. Public Policy, 2 (1995), 69–93. https://doi.org/10.1080/13501769508406975 doi: 10.1080/13501769508406975
    [5] L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
    [6] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets Syst., 20 (1986), 87–96. https://doi.org/10.1007/978-3-7908-1870-3_1 doi: 10.1007/978-3-7908-1870-3_1
    [7] K. T. Atanassov, Interval valued intuitionistic fuzzy sets, In: Intuitionistic fuzzy sets: Theory and applications, Heidelberg: Physica, 1999. https://doi.org/10.1007/978-3-7908-1870-3_2
    [8] Y. B. Jun, C. S. Kim, K. O. Yang, Cubic sets, Ann. Fuzzy Math. Inf., 4 (2012), 83–98.
    [9] L. A. Zadeh, Outline of a new approach to the analysis of complex systems and decision processes, IEEE Trans. Syst. Man Cybern., SMC-3 (1973), 28–44. https://doi.org/10.1109/TSMC.1973.5408575
    [10] I. B. Turksen, Interval valued fuzzy sets based on normal forms, Fuzzy Sets Syst., 20 (1986), 191–210. https://doi.org/10.1016/0165-0114(86)90077-1 doi: 10.1016/0165-0114(86)90077-1
    [11] G. Kaur, H. Garg, Multi-attribute decision-making based on Bonferroni mean operators under cubic intuitionistic fuzzy set environment, Entropy, 20 (2018), 65. https://doi.org/10.3390/e20010065 doi: 10.3390/e20010065
    [12] A. Mardani, M. Nilashi, E. K. Zavadskas, S. R. Awang, H. Zare, N. M. Jamal, Decision making methods based on fuzzy aggregation operators: Three decades review from 1986 to 2017, Int. J. Inf. Tech. Decis. Making, 17 (2018), 391–466. https://doi.org/10.1142/S021962201830001X doi: 10.1142/S021962201830001X
    [13] J. M. Merigó, M. Casanovas, Fuzzy Generalized Hybrid Aggregation Operators and its Application in Fuzzy Decision Making, Int. J. Fuzzy Syst., 12 (2010), 11–22. https://doi.org/10.1142/S021962201830001 doi: 10.1142/S021962201830001
    [14] Z. Xu, Intuitionistic fuzzy aggregation operators, IEEE Trans. Fuzzy Syst., 15 (2007), 1179–1187. https://doi.org/10.1109/TFUZZ.2006.890678 doi: 10.1109/TFUZZ.2006.890678
    [15] X. Yu, Z. Xu, Prioritized intuitionistic fuzzy aggregation operators, Inf. Fusion, 14 (2013), 108–116. https://doi.org/10.1016/j.inffus.2012.01.011 doi: 10.1016/j.inffus.2012.01.011
    [16] Z. Xu, R. R. Yager, Some geometric aggregation operators based on intuitionistic fuzzy sets, Int. J. General Syst., 35 (2006), 417–433. https://doi.org/10.1080/03081070600574353 doi: 10.1080/03081070600574353
    [17] H. Garg, Z. Ali, T. Mahmood, M. R. Ali, A. Alburaikan, Schweizer-Sklar prioritized aggregation operators for intuitionistic fuzzy information and their application in multi-attribute decision-making, Alex. Eng. J., 67 (2023), 229–240. https://doi.org/10.1016/j.aej.2022.12.049 doi: 10.1016/j.aej.2022.12.049
    [18] W. Wang, X. Liu, Y. Qin, Interval-valued intuitionistic fuzzy aggregation operators, J. Syst. Eng. Electron., 23 (2012), 574–580. https://doi.org/10.1109/JSEE.2012.00071 doi: 10.1109/JSEE.2012.00071
    [19] T. Senapati, R. Mesiar, V. Simic, A. Iampan, R. Chinram, R. Ali, Analysis of interval-valued intuitionistic fuzzy aczel–alsina geometric aggregation operators and their application to multiple attribute decision-making, Axioms, 11 (2022), 258. https://doi.org/10.3390/axioms11060258 doi: 10.3390/axioms11060258
    [20] X. Shi, Z. Ali, T. Mahmood, P. Liu, Power Aggregation Operators of Interval-Valued Atanassov-Intuitionistic Fuzzy Sets Based on Aczel–Alsina t-Norm and t-Conorm and Their Applications in Decision Making, Int. J. Comput. Intell. Syst., 16 (2023), 43. https://doi.org/10.1007/s44196-023-00208-7 doi: 10.1007/s44196-023-00208-7
    [21] G. Wei, X. Wang, Some geometric aggregation operators based on interval-valued intuitionistic fuzzy sets and their application to group decision making, 2007 International Conference on Computational Intelligence and Security (CIS 2007), 2007,495–499. https://doi.org/10.1109/CIS.2007.84
    [22] Z. Xu, J. Chen, On geometric aggregation over interval-valued intuitionistic fuzzy information. Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007,466–471. https://doi.org/10.1109/FSKD.2007.427
    [23] A. Fahmi, F. Amin, S. Abdullah, A. Ali, Cubic fuzzy Einstein aggregation operators and its application to decision-making, Int. J. Syst. Sci., 49 (2018), 2385–2397. https://doi.org/10.1080/00207721.2018.1503356 doi: 10.1080/00207721.2018.1503356
    [24] A. Khan, A. U. Jan, F. Amin, A. Zeb, Multiple attribute decision-making based on cubical fuzzy aggregation operators, Granul. Comput., 7 (2022), 393–410. https://doi.org/10.1007/s41066-021-00273-3 doi: 10.1007/s41066-021-00273-3
    [25] G. Kaur, H. Garg, Cubic intuitionistic fuzzy aggregation operators, Int. J. Uncertainty Quantif., 8 (2018), 405–427. https://doi.org/10.1615/Int.J.UncertaintyQuantification.2018020471 doi: 10.1615/Int.J.UncertaintyQuantification.2018020471
    [26] G. Kaur, H. Garg, Generalized cubic intuitionistic fuzzy aggregation operators using t-norm operations and their applications to group decision-making process, Arabian J. Sci. Eng., 44 (2019), 2775–2794. https://doi.org/10.1007/s13369-018-3532-4 doi: 10.1007/s13369-018-3532-4
    [27] E. P. Klement, P. Mesiar, Triangular norms, Tatra Mt. Math. Publ., 13 (1997), 169–193.
    [28] J. Aczél, C. Alsina, Characterizations of some classes of quasilinear functions with applications to triangular norms and to synthesizing judgements, Aeq. Math., 25 (1992), 313–315. https://doi.org/10.1007/BF02189626 doi: 10.1007/BF02189626
    [29] T. Senapati, G. Chen, R. R. Yager, Aczel–Alsina aggregation operators and their application to intuitionistic fuzzy multiple attribute decision making, Int. J. Intell. Syst., 37 (2022), 1529–1551. https://doi.org/10.1002/int.22684 doi: 10.1002/int.22684
    [30] T. Senapati, G. Chen, R. Mesiar, R. R. Yager, Novel Aczel–Alsina operations‐based interval‐valued intuitionistic fuzzy aggregation operators and their applications in multiple attribute decision‐making process, Int. J. Intell. Syst., 37 (2022), 5059–5081. https://doi.org/10.1002/int.22751 doi: 10.1002/int.22751
    [31] T. Senapati, G. Chen, R. Mesiar, R. R. Yager, A. Saha, Novel Aczel–Alsina operations-based hesitant fuzzy aggregation operators and their applications in cyclone disaster assessment, Int. J. Gen. Syst., 51 (2022), 511–546. https://doi.org/10.1080/03081079.2022.2036140 doi: 10.1080/03081079.2022.2036140
    [32] T. Mahmood, Z. Ali, S. Baupradist, R. Chinram, Complex intuitionistic fuzzy Aczel-Alsina aggregation operators and their application in multi-attribute decision-making, Symmetry, 14 (2022), 2255. https://doi.org/10.3390/sym14112255 doi: 10.3390/sym14112255
    [33] T. Senapati, G. Chen, R. Mesiar, R. R. Yager, Intuitionistic fuzzy geometric aggregation operators in the framework of Aczel-Alsina triangular norms and their application to multiple attribute decision making, Expert. Syst. Appl., 212 (2023), 118832. https://doi.org/10.1016/j.eswa.2022.118832 doi: 10.1016/j.eswa.2022.118832
    [34] J. Ahmmad, T. Mahmood, N. Mehmood, K. Urawong, R. Chinram, Intuitionistic Fuzzy Rough Aczel-Alsina Average Aggregation Operators and Their Applications in Medical Diagnoses, Symmetry, 14 (2022), 2537. https://doi.org/10.3390/sym14122537 doi: 10.3390/sym14122537
    [35] M. Sarfraz, K. Ullah, M. Akram, D. Pamucar, D. Božanić, Prioritized aggregation operators for intuitionistic fuzzy information based on Aczel–Alsina T-norm and T-conorm and their applications in group decision-making, Symmetry, 14 (2022), 2655. https://doi.org/10.3390/sym14122655 doi: 10.3390/sym14122655
    [36] T. Mahmood, Z. Ali, Multi-attribute decision-making methods based on Aczel–Alsina power aggregation operators for managing complex intuitionistic fuzzy sets, Comp. Appl. Math., 42 (2023), 87. https://doi.org/10.1007/s40314-023-02204-1 doi: 10.1007/s40314-023-02204-1
    [37] A. Hussain, H. Wang, H. Garg, K. Ullah, An Approach to Multi-attribute Decision Making Based on Intuitionistic Fuzzy Rough Aczel-Alsina Aggregation Operators, J. King Saud Univ.-Sci., 35 (2023), 102760. https://doi.org/10.1016/j.jksus.2023.102760 doi: 10.1016/j.jksus.2023.102760
    [38] M. R. Seikh, U. Mandal, Intuitionistic fuzzy Dombi aggregation operators and their application to multiple attribute decision-making, Granul. Comput., 6 (2021), 473–488. https://doi.org/10.1007/s41066-019-00209-y doi: 10.1007/s41066-019-00209-y
    [39] M. R. Seikh, U. Mandal, q-Rung orthopair fuzzy Archimedean aggregation operators: application in the site selection for software operating units, Symmetry, 15 (2023), 1680. https://doi.org/10.3390/sym15091680 doi: 10.3390/sym15091680
    [40] M. R. Seikh, U. Mandal, Q-rung orthopair fuzzy Frank aggregation operators and its application in multiple attribute decision-making with unknown attribute weights, Granul. Comput., 7 (2022), 709–730. https://doi.org/10.1007/s41066-021-00290-2 doi: 10.1007/s41066-021-00290-2
    [41] M. R. Seikh, U. Mandal, Multiple attribute group decision making based on quasirung orthopair fuzzy sets: Application to electric vehicle charging station site selection problem, Eng. Appl. Artif. Intell, 115 (2022), 105299. https://doi.org/10.1016/j.engappai.2022.105299 doi: 10.1016/j.engappai.2022.105299
    [42] M. R. Seikh, U. Mandal, Multiple attribute decision-making based on 3, 4-quasirung fuzzy sets, Granul. Comput., 7 (2022), 965–978. https://doi.org/10.1007/s41066-021-00308-9 doi: 10.1007/s41066-021-00308-9
    [43] H. M. A. Farid, S. Dabic-Miletic, M. Riaz, V. Simic, D. Pamucar, Prioritization of sustainable approaches for smart waste management of automotive fuel cells of road freight vehicles using the q-rung orthopair fuzzy CRITIC-EDAS method, Inf. Sci., 661 (2024), 120162. https://doi.org/10.1016/j.ins.2024.120162 doi: 10.1016/j.ins.2024.120162
    [44] M. Riaz, M. R. Hashmi, Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems, J. Intell. Fuzzy Syst., 37 (2022), 5417–5439. https://doi.org/10.3233/JIFS-190550 doi: 10.3233/JIFS-190550
    [45] M. Riaz, R. Kausar, T. Jameel, D. Pamucar, Cubic picture fuzzy topological data analysis with integrating blockchain and the metaverse for uncertain supply chain management, Eng. Appl. Artif. Intell., 131 (2024), 107827. https://doi.org/10.1016/j.engappai.2023.107827 doi: 10.1016/j.engappai.2023.107827
    [46] A. Razzaq, M. Riaz, Picture fuzzy soft-max Einstein interactive weighted aggregation operators with applications, Comput. Appl. Math., 43 (2024), 90–104. https://doi.org/10.1007/s40314-024-02609-6 doi: 10.1007/s40314-024-02609-6
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(745) PDF downloads(34) Cited by(0)

Figures and Tables

Figures(3)  /  Tables(15)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog