Skip to main content
Heliyon logoLink to Heliyon
. 2024 Jan 24;10(3):e24767. doi: 10.1016/j.heliyon.2024.e24767

Archimedean Heronian mean operators based on complex intuitionistic fuzzy sets and their applications in decision-making problems

Zeeshan Ali a, Walid Emam b, Tahir Mahmood c,, Haolun Wang d
PMCID: PMC10873673  PMID: 38371962

Abstract

In this article, we derive the Archimedean aggregation operators for complex intuitionistic fuzzy sets, for this, first, we evaluate some Archimedean operational laws based on complex intuitionistic fuzzy values and then we discuss their special cases because the Archimedean norms are the general form of all existing norms, for instance, algebraic, Einstein, Hamacher, and Frank operational laws. Furthermore, we present the complex intuitionistic fuzzy Archimedean Heronian aggregation operator and complex intuitionistic fuzzy weighted Archimedean Heronian aggregation operator. Several special cases and the basic properties of the above-proposed operators are also diagnosed, because proposing the Heronian mean operators based on Archimedean norms are very challenging and complicated tasks, because of their features and structure. Additionally, a decision-making process is developed under the identified operators by using complex intuitionistic fuzzy information. Finally, we illustrate several examples to show the multi-attribute decision-making technique is more flexible than the prevailing works with the help of sensitive analysis between explored and certain prevailing works.

Keywords: Complex intuitionistic fuzzy sets, Heronian mean operators, Archimedean t-norm and t-conorm, Decision-making techniques

1. Introduction

The decision-making procedure is a technique that contains a lot of types, for instance, MADM technique, MAGDM technique, MCDM technique, and many others, which are used for addressing the best optimal among the collection of finite decisions. In some cases, experts have lost a lot of data, if they use the classical information for evaluating the MADM procedure because in the case of classical set theory, experts have only two opinions like zero or one. Zadeh [1] extended the range of the classical set and derived the FS. The range of FS is unit interval instead of {0,1} and because of this reason, experts have a lot of space for taking their decision. Adjust the grade of falsity is a very challenging task for scholars, because in many cases the falsity grade played an important role, especially during the elections, For handling such kind of problems, Atanassov [2] computed the IFS with a well-known rule: 0MkξTD(xEL)+NkξFD(xEL)1, where NkξFD(xEL) and MkξTD(xEL) represents the TD and FD. Some extensions and implementations of IFS are as follows: IVIFSs [3], Dombi aggregation operators for IFSs [4], entropy measures for IVIFSs [5], Bipolar soft sets [6], failure mode and effects analysis [7], improved TODIM processes [8], operational laws for IFSs [9], aggregation and infinite chains for IFSs [10], parameterized IVIFSs [11], telecom services providers under the IFSs [12], MABAC method for IFSs [13], and distance measures for IVIFSs [14].

The TD in FS theory is computed in the form of a simple function that can easily deal with one-dimensional information, but in our daily life problems, experts have faced a lot of problems that are present in the shape of two-dimensional information. For managing such kinds of problems, we needed to find a structure that has computed in the shape of a complex number, where the complex number can easily depict the two-dimensional problem. Therefore, we found a novel concept of complex FS (CFS), which was invented by Ramot et al. [15]. The TD in CFS is arranged in the shape of polar coordinates. Furthermore, operation properties for CFS were explored by Zhang et al. [16], complex fuzzy logic was explored by Ramot et al. [17], systematic view of CFS was presented by Yazdanbakhsh and Disk [18], neuro-fuzzy architecture for CFSs was developed by Chan et al. [19], complex neuro-fuzzy ARIMA forecasting was initiated by Li and Chiang [20], Distance measures for CFS was proposed by Hu et al. [21], periodic factor based on CFS was investigated by Ma et al. [22], linguistic variable for CFS was explored by Alkouri and Salleh [23], cross-entropy measures for CFSs was developed by Liu et al. [24], and distance measures for interval-valued CFSs were presented Dai et al. [25]. But sometimes the principle of CFS is enabled to describe the ambiguity and inconsistency in genuine life dilemmas. For this, the principle of complex IFS (CIFS) was initiated by Alkouri and Salleh [26] by putting the FD NkξCI(xEL)=NkξR(xEL)ei2π(NkξI(xEL)) in the region of CFSs, which covers only the TD MkξCI(xEL)=MkξR(xEL)ei2π(MkξI(xEL)) with some well-known rules: 0MkξR(xEL)+NkξR(xEL)1 and 0MkξI(xEL)+NkξI(xEL)1. CFSs are the specific part of the CIFSs, and numerous individuals have employed them in distinct regions. For illustration, information measures [27], robust correlation coefficient [28], generalized geometric aggregation operators [29], robust averaging/geometric aggregation operators [30], aggregation operators for generalized CIFSs [31], power aggregation operators [32], preference relation for CIFSs [33], and complex intuitionistic fuzzy soft sets [34].

The fundamental theory of Archimedean norms for IFS was proposed by Xia et al. [35], with the help of Archimedean norms, we can easily derive any kind of operators and their special cases. Furthermore, Luo et al. [36] initiated the exponential laws for IFS. Garg and Rani [37] elaborated on the generalized Bonferroni mean operators for IFSs. Moreover, Yu [38] initiated interval-valued multiplicative IFS based on Archimedean TN and TCN. Ma and Yang [39] presented the weighted mean operators using the Archimedean TN and TCN for IFSs. Liu et al. [40] derived the Quasi-OWA operators. Liu and Chen [41] proposed to the HM operators. Seikh and Mandal [42] evaluated the Frank operators for q-rung orthopair fuzzy sets and their application in decision-making. Recently, Seikh and Mandal [43] evaluated the Frank operators for picture fuzzy sets and their application in decision-making problems. After a brief discussion, we noticed that all experts have the following major issues, such as:

  • 1)

    How do we evaluate generalized operational laws for all t-norms and t-conorms?

  • 2)

    How do we propose generalized aggregation operators for CIFSs?

  • 3)

    How do we rank all the alternatives for evaluating the best optimal between a finite number of alternatives?

For dealing with the above three queries, we needed to develop the Archimedean Heronian mean operators for CIFSs because, with the help of these investigations, we can easily derive any kind of operators. It is clear that many scholars have invented the Heronian mean operators for FSs, and IFSs, but no one can derive it for CIFSs. Furthermore, the Archimedean operational laws for IFS have been proposed, but no one can derive them for CIFSs. Combining the Archimedean operational laws and Heronian mean operators with CIFS is very awkward and complicated because no one can derive it after the investigation of CIFS in 2012 up to yet. The proposed techniques are very reliable and dominant because of their structure, where many advantages follow, for instance, Archimedean aggregation operators, Heronian mean operators, Aggregation operators, Einstein aggregation operators, Hamacher aggregation operators, Frank aggregation operators, Heronian Aggregation operators, Einstein Heronian aggregation operators, Hamacher Heronian aggregation operators, and Frank Heronian aggregation operators for FSs, IFSs, CFSs, and CIFSs are exceptional cases of the derived work. Similarly, we have a lot of possibilities to derive different types of operators from the invented Archimedean Heronian mean operators based on CIFSs. Based on the above advantages, the major contributions of the derived operators are listed below:

  • 1)

    To propose the Archimedean operational laws based on CIF values.

  • 2)

    To derive the algebraic operational laws, Einstein operational laws, Hamacher operational laws, and Frank operational laws from the Archimedean operational laws by using different values of the functions in Archimedean operational laws.

  • 3)

    To evaluate the CIFAHA operator and CIFWAHA operator. Several special cases and the basic properties of the above-proposed operators are also diagnosed.

  • 4)

    To illustrate the MADM process is developed under the identified operators by using CIF information.

  • 5)

    To discover several examples to show the MADM technique is massively more flexible than the prevailing works with the help of sensitive analysis between explored and certain prevailing works. The major findings of the proposed theory are stated in Fig. 1.

Fig. 1.

Fig. 1

Representation of the summery of the proposed approaches.

The major objective of this analysis is reviewed in the subsequent approaches: In section 2, we revised the prevailing principles of CIFSs and their algebraic laws. Moreover, the principle of HM operator, algebraic, Einstein, Hamacher, frank operational laws, and the generalized form of TN and TCN are also revised in this study. In section 3, we elaborated on the algebraic, Einstein, Hamacher, and Frank rules for the CIF setting. Numerous specific cases of the presented rules are also illustrated with the help of parameters. In section 4, we initiated the CIFAHA operator and the CIFWAHA operator. Several important properties and their related results are also diagnosed. In section 5, we developed a MADM process under the identified operators by using CIF information. We illustrated several examples to show the MADM technique is massive flexible than the prevailing works with the help of sensitive analysis between explored and certain prevailing works. In section 6, we employed the assumption of this analysis.

2. Preliminaries

In this analysis, we revised the prevailing principles of CIFSs and their algebraic laws. Moreover, the principle of HM operator, algebraic, Einstein, Hamacher, frank operational laws, and the generalized form of TN and TCN are also revised in this study. The term MkξCI(xEL)=MkξR(xEL)ei2π(MkξI(xEL)) and NkξCI(xEL)=NkξR(xEL)ei2π(NkξI(xEL)), stated the TD and FD and the universal were invented by Xu.

Definition 1

[26] An CIFS kξCI is invented by:

kξCI={(MkξCI(xEL),NkξCI(xEL)):xELXu} (1)

where MkξCI(xEL)=MkξR(xEL)ei2π(MkξI(xEL)) and NkξCI(xEL)=NkξR(xEL)ei2π(NkξI(xEL)), with 0MkξR(xEL)+NkξR(xEL)1 and 0MkξI(xEL)+NkξI(xEL)1. The structure RkξCI=RkξR(xEL)ei2π(RkξI(xEL))=(1(MkξR(xEL)+NkξR(xEL)))ei2π(1(MkξI(xEL)+NkξI(xEL))), conveyed the neutral grade. The CIFNs are mentioned by: kξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L.

Definition 2

[28] Choose any two CIFNs kξCIN1=(MkξR1ei2π(MkξI1),NkξR1ei2π(NkξI1)) and kξCIN2=(MkξR2ei2π(MkξI2),NkξR2ei2π(NkξI2)), then

kξCIN1kξCIN2=((MkξR1+MkξR2MkξR1MkξR2)ei2π(MkξI1+MkξI2MkξI1MkξI2),NkξR1NkξR2ei2π(NkξI1NkξI2)) (2)
kξCIN1kξCIN2=(MkξR1MkξR2ei2π(MkξI1MkξI2),(NkξR1+NkξR2NkξR1NkξR2)ei2π(NkξI1+NkξI2NkξI1NkξI2)) (3)
γSCkξCIN1=(1(1MkξR1)γSCei2π(1(1MkξI1)γSC),NkξR1γSCei2π(NkξI1γSC)),γSC>0 (4)
kξCIN1γSC=(MkξR1γSCei2π(MkξI1γSC),1(1NkξR1)γSCei2π(1(1NkξI1)γSC)),γSC>0 (5)

For more simplification, we justify the data in Def. (2) with the help of some suitable examples, for this we consider any two CIFNs, such as kξCIN1=(0.5ei2π(0.6),0.3ei2π(0.2)) and kξCIN2=(0.7ei2π(0.8),0.2ei2π(0.1)) with γSC=2, then

kξCIN1kξCIN2=((0.5+0.70.5*0.7)ei2π(0.6+0.80.6*0.8),(0.3*0.2)ei2π(0.2*0.1))=((1.20.35)ei2π(1.40.48),(0.06)ei2π(0.02))=((0.85)ei2π(0.92),(0.06)ei2π(0.02)).
kξCIN1kξCIN2=((0.5*0.7)ei2π(0.6*0.8),(0.3+0.20.3*0.2)ei2π(0.2+0.10.2*0.1))=((0.35)ei2π(0.48),(0.50.06)ei2π(0.30.02))=((0.35)ei2π(0.48),(0.44)ei2π(0.28)).
2*kξCIN1=(1(10.5)2ei2π(1(10.6)2),(0.3)2ei2π(0.2)2)=(1(0.5)2ei2π(1(0.4)2),(0.09)ei2π(0.04))=((10.25)ei2π(10.16),(0.09)ei2π(0.04))=((0.75)ei2π(0.84),(0.09)ei2π(0.04)).
(kξCIN1)2=((0.5)2ei2π(0.6)2,1(10.3)2ei2π(1(10.2)2))=((0.25)ei2π(0.36),1(0.7)2ei2π(1(0.8)2))=((0.25)ei2π(0.36),(10.49)ei2π(10.64))=((0.25)ei2π(0.36),(0.51)ei2π(0.36)).

Definition 3

[29] Choose any CIFN kξCIN1=(MkξR1ei2π(MkξI1),NkξR1ei2π(NkξI1)), then the score value (SV) is invented by:

SSV(kξCIN1)=12(MkξR1+MkξI1NkξR1NkξI1) (6)

where SSV(kξCIN1)[1,1].

Definition 4

[30] Choose any CIFN kξCIN1=(MkξR1ei2π(MkξI1),NkξR1ei2π(NkξI1)), then the accuracy value (AV) is invented by:

RAV(kξCIN1)=12(MkξR1+MkξI1+NkξR1+NkξI1) (7)

where RAV(kξCIN1)[0,1].

Keeping in mind Eqs. (1), (2), (3), (4), (5), we have the following notions.

Definition 5

[30] Choose any two CIFNs kξCIN1=(MkξR1ei2π(MkξI1),NkξR1ei2π(NkξI1)) and kξCIN2=(MkξR2ei2π(MkξI2),NkξR2ei2π(NkξI2)), then by using Eq. (6) and Eq. (7), we initiate

  • 1.

    SSV(kξCIN1)>SSV(kξCIN2)kξCIN1>kξCIN2;

  • 2.

    SSV(kξCIN1)<SSV(kξCIN2)kξCIN1<kξCIN2;

  • 3.
    SSV(kξCIN1)=SSV(kξCIN2).
    • i)
      RAV(kξCIN1)>RAV(kξCIN2)kξCIN1>kξCIN2;
    • ii)
      RAV(kξCIN1)<RAV(kξCIN2)kξCIN1<kξCIN2;
    • iii)
      RAV(kξCIN1)=RAV(kξCIN2)kξCIN1=kξCIN2.

Definition 6

[40] Choose any group of integers (+ve) kξPIθ,θ=1,2,,L, thus

HMf,g(kξPI1,kξPI2,,kξPIL)=(2L(L+1)θ=1Lk=1LkξPIθfkξPIkg)1f+g (8)

Eq. (8) represents the HM operator, where f,g0. Furthermore, various valuable and well-known norms are stated below:

  • 1.

    Algebraic norms [41]:

TTN(xEL,yEL)=xELyELtnorm(additivegenerator):η(t)=ln(t) (9)
STN(xEL,yEL)=xEL+yELxELyELtconorm(additivegenerator):V(t)=ln(1t) (10)
  • 2.

    Einstein norms [41]:

TTN(xEL,yEL)=xELyEL1+(1xEL)(1yEL)tnorm(additivegenerator):η(t)=ln(2tt) (11)
STN(xEL,yEL)=xEL+yEL1+xELyELtconorm(additivegenerator):V(t)=ln(1+t1t) (12)
  • 3.

    Hamacher norms [41]:

TTN(xEL,yEL)=xELyELδSCˆ+(1δSCˆ)(xEL+yELxELyEL)tnorm(additivegenerator):η(t)=ln(δSCˆ+(1δSCˆ)tt) (13)
STN(xEL,yEL)=xEL+yELxELyEL(1δSCˆ)xELyEL1(1δSCˆ)xELyELtconorm(additivegenerator):V(t)=ln(δSCˆ+(1δSCˆ)(1t)1t) (14)
  • 4.

    Frank norms [41]:

TTN(xEL,yEL)=logδSCˆ(1+(δSCˆxEL1)(δSCˆyEL1)(δSCˆ1))tnorm(additivegenerator):IfδSCˆ=1,thenη(t)=ln(t),ifδSCˆ1,thenη(t)=ln(δSCˆ1δSCˆt1) (15)
STN(xEL,yEL)=1logδSCˆ(1+(δSCˆ1xEL1)(δSCˆ1yEL1)(δSCˆ1))tconorm(additivegenerator):IfδSCˆ=1,thenV(t)=ln(1t),ifδSCˆ1,thenV(t)=ln(δSCˆ1δSCˆ1t1) (16)

The modified and general form of TN and TCN is listed below in Eq. (17) and Eq. (18):

TTN(xEL,yEL)=η1(η(xEL)+η(yEL)) (17)
STN(xEL,yEL)=V1(V(xEL)+V(yEL)) (18)

where V(t)=η(1t).

3. Archimedean operational laws for CIFSs

In this section, we discover the well-known and famous theory of algebraic, Einstein, Hamacher, and Frank's rules for CIF information. These operations play an essential role in the construction of any kind of aggregation operator.

Definition 7

Choose any two CIFNs kξCIN1=(MkξR1ei2π(MkξI1),NkξR1ei2π(NkξI1)) and kξCIN2=(MkξR2ei2π(MkξI2),NkξR2ei2π(NkξI2)), then

kξCIN1kξCIN2=(STN(MkξR1,MkξR2)ei2π(STN(MkξI1,MkξI2)),TTN(NkξR1,NkξR2)ei2π(TTN(NkξI1,NkξI2)))
=(V1(V(MkξR1)+V(MkξR2))ei2π(V1(V(MkξI1)+V(MkξI2))),η1(η(NkξR1)+η(NkξR2))ei2π(η1(η(NkξI1)+η(NkξI2)))) (19)
kξCIN1kξCIN2=(TTN(MkξR1,MkξR2)ei2π(TTN(MkξI1,MkξI2)),STN(NkξR1,NkξR2)ei2π(STN(NkξI1,NkξI2)))
=(η1(η(MkξR1)+η(MkξR2))ei2π(η1(η(MkξI1)+η(MkξI2))),V1(V(NkξR1)+V(NkξR2))ei2π(V1(V(NkξI1)+V(NkξI2)))) (20)
γSCkξCIN1=(V1(γSCV(MkξR1))ei2π(V1(γSCV(MkξI1))),η1(γSCη(NkξR1))ei2π(η1(γSCη(NkξI1)))) (21)
kξCIN1γSC=(η1(γSCη(MkξR1))ei2π(η1(γSCη(MkξI1))),V1(γSCV(NkξR1))ei2π(V1(γSCV(NkξI1)))) (22)

To select the data in Eq. (9) and Eq. (10), then the data in Eq. (19) to Eq. (22) will be transformed to Eq. (2) to Eq. (5), called algebraic laws, further, to select the data in Eq. (11) and Eq. (12), then the data in Eq. (19) to Eq. (22) will be transformed to Eq. (23) to Eq. (26), called Einstein laws, such as

kξCIN1kξCIN2=((MkξR1+MkξR2)1+MkξR1MkξR2ei2π(MkξI1+MkξI21+MkξI1MkξI2),NkξR1NkξR21+(1NkξR1)(1NkξR2)ei2π(NkξI1NkξI21+(1NkξI1)(1NkξI2))) (23)
kξCIN1kξCIN2=(MkξR1MkξR21+(1MkξR1)(1MkξR2)ei2π(MkξI1MkξI21+(1MkξI1)(1MkξI2)),(NkξR1+NkξR2)1+NkξR1NkξR2ei2π(NkξI1+NkξI21+NkξI1NkξI2)) (24)
γSCkξCIN1=((1+MkξR1)γSC(1MkξR1)γSC(1+MkξR1)γSC+(1MkξR1)γSCei2π((1+MkξI1)γSC(1MkξI1)γSC(1+MkξI1)γSC+(1MkξI1)γSC),2NkξR1γSC(2NkξR1)γSC+NkξR1γSCei2π(2NkξI1γSC(2NkξI1)γSC+NkξI1γSC)),γSC>0 (25)
kξCIN1γSC=(2MkξR1γSC(2MkξR1)γSC+MkξR1γSCei2π(2MkξI1γSC(2MkξI1)γSC+MkξI1γSC),(1+NkξR1)γSC(1NkξR1)γSC(1+NkξR1)γSC+(1NkξR1)γSCei2π((1+NkξI1)γSC(1NkξI1)γSC(1+NkξI1)γSC+(1NkξI1)γSC)),γSC>0 (26)

To select the data in Eq. (11) and Eq. (12), then the data in Eq. (19) to Eq. (22) will be transformed to Eq. (27) to Eq. (30), called Hamacher laws, such as

kξCIN1kξCIN2=((MkξR1+MkξR2MkξR1MkξR2(1δSCˆ)MkξR1MkξR2)1(1δSCˆ)MkξR1MkξR2ei2π((MkξI1+MkξI2MkξI1MkξI2(1δSCˆ)MkξI1MkξI2)1(1δSCˆ)MkξI1MkξI2),NkξR1NkξR2δSCˆ+(1δSCˆ)(NkξR1+NkξR2NkξR1NkξR2)ei2π(NkξI1NkξI2δSCˆ+(1δSCˆ)(NkξI1+NkξI2NkξI1NkξI2))) (27)
kξCIN1kξCIN2=(MkξR1MkξR2δSCˆ+(1δSCˆ)(MkξR1+MkξR2MkξR1MkξR2)ei2π(MkξI1MkξI2δSCˆ+(1δSCˆ)(MkξI1+MkξI2MkξI1MkξI2)),(NkξR1+NkξR2NkξR1NkξR2(1δSCˆ)NkξR1NkξR2)1(1δSCˆ)NkξR1NkξR2ei2π((NkξI1+NkξI2NkξI1NkξI2(1δSCˆ)NkξI1NkξI2)1(1δSCˆ)NkξI1NkξI2)) (28)
γSCkξCIN1=((1+(δSCˆ1)MkξR1)γSC(1MkξR1)γSC(1+(δSCˆ1)MkξR1)γSC+(δSCˆ1)(1MkξR1)γSCei2π((1+(δSCˆ1)MkξI1)γSC(1MkξI1)γSC(1+(δSCˆ1)MkξI1)γSC+(δSCˆ1)(1MkξI1)γSC),2NkξR1γSC(1+(δSCˆ1)(1NkξR1))γSC+(δSCˆ1)NkξR1γSCei2π(2NkξI1γSC(1+(δSCˆ1)(1NkξI1))γSC+(δSCˆ1)NkξI1γSC)),γSC>0 (29)
kξCIN1γSC=(2MkξR1γSC(1+(δSCˆ1)(1MkξR1))γSC+(δSCˆ1)MkξR1γSCei2π(2MkξI1γSC(1+(δSCˆ1)(1MkξI1))γSC+(δSCˆ1)MkξI1γSC),(1+(δSCˆ1)NkξR1)γSC(1NkξR1)γSC(1+(δSCˆ1)NkξR1)γSC+(δSCˆ1)(1NkξR1)γSCei2π((1+(δSCˆ1)NkξI1)γSC(1NkξI1)γSC(1+(δSCˆ1)NkξI1)γSC+(δSCˆ1)(1NkξI1)γSC)),γSC>0 (30)

To choose the value of δSCˆ=1 in Eq. (27) to Eq. (30), we will get the data in Eq. (2) to Eq. (5), when we select the value of δSCˆ=2 in Eq. (27) to Eq. (30), thus we will derive the data in Eq. (23) to Eq. (26). To consider the data in Eq. (13) and Eq. (14), then the data in Eq. (19) to Eq. (22) will be transformed to Eq. (31) to Eq. (34), called Frank laws, such as

kξCIN1kξCIN2=(1logδSCˆ(1+θ=12(δSCˆ1MkξRθ1)δSCˆ1)ei2π(1logδSCˆ(1+θ=12(δSCˆ1MkξIθ1)δSCˆ1)),logδSCˆ(1+θ=12(δSCˆNkξRθ1)δSCˆ1)ei2π(logδSCˆ(1+θ=12(δSCˆNkξIθ1)δSCˆ1))) (31)
kξCIN1kξCIN2=(logδSCˆ(1+θ=12(δSCˆMkξRθ1)δSCˆ1)ei2π(logδSCˆ(1+θ=12(δSCˆMkξIθ1)δSCˆ1)),1logδSCˆ(1+θ=12(δSCˆ1NkξRθ1)δSCˆ1)ei2π(1logδSCˆ(1+θ=12(δSCˆ1NkξIθ1)δSCˆ1))) (32)
γSCkξCIN1=(1logδSCˆ(1+(δSCˆ1MkξR11)γSC(δSCˆ1)γSC1)ei2π(1logδSCˆ(1+(δSCˆ1MkξI11)γSC(δSCˆ1)γSC1)),logδSCˆ(1+(δSCˆNkξR11)γSC(δSCˆ1)γSC1)ei2π(logδSCˆ(1+(δSCˆNkξI11)γSC(δSCˆ1)γSC1))),γSC>0 (33)
kξCIN1γSC=(logδSCˆ(1+(δSCˆMkξR11)γSC(δSCˆ1)γSC1)ei2π(logδSCˆ(1+(δSCˆMkξI11)γSC(δSCˆ1)γSC1)),1logδSCˆ(1+(δSCˆ1NkξR11)γSC(δSCˆ1)γSC1)ei2π(1logδSCˆ(1+(δSCˆ1NkξI11)γSC(δSCˆ1)γSC1))),γSC>0 (34)

4. Proposed archimedean operators for CIFSs

In this section, we discovered the CIFAHA operator, CIFWAHA operator, and their special cases with the help of some conditions. Several important properties and their related results are also diagnosed.

Definition 8

Choose any group of CIFNs kξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L, then the CIFAHA operator is invented by:

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(2L(L+1)θ=1Lk=1LkξCINθfkξCINkg)1f+g (35)

where f,g0.

Theorem 1

Choose any group of CIFNskξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L, then by using Eq. (35), we initiate

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk))))))ei2π(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξIθ)+gη(MkξIk))))))),V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξRθ)+gV(NkξRk))))))ei2π(V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξIθ)+gV(NkξIk)))))))) (36)

Proof: Consider

kξCINθf=(η1(fη(MkξRθ))ei2π(η1(fη(MkξIθ))),V1(fV(NkξRθ))ei2π(V1(fV(NkξIθ))))
kξCINkg=(η1(gη(MkξRk))ei2π(η1(gη(MkξIk))),V1(gV(NkξRk))ei2π(V1(gV(NkξIk))))

then,

kξCINθfkξCINkg=(η1(fη(MkξRθ))ei2π(η1(fη(MkξIθ))),V1(fV(NkξRθ))ei2π(V1(fV(NkξIθ))))(η1(gη(MkξRk))ei2π(η1(gη(MkξIk))),V1(gV(NkξRk))ei2π(V1(gV(NkξIk))))
=(η1(fη(MkξRθ)+gη(MkξRk))ei2π(η1(fη(MkξIθ)+gη(MkξIk))),V1(fV(NkξRθ)+gV(NkξRk))ei2π(V1(fV(NkξIθ)+gV(NkξIk))))

and,

θ=1Lk=1LkξCINθfkξCINkg=(V1(θ=1Lk=θLV(η1(fη(MkξRθ)+gη(MkξRk))))ei2π(V1(θ=1Lk=θLV(η1(fη(MkξIθ)+gη(MkξIk))))),η1((θ=1Lk=θLη(V1(fV(NkξRθ)+gV(NkξRk)))))ei2π(η1((θ=1Lk=θLη(V1(fV(NkξIθ)+gV(NkξIk)))))))
2L(L+1)θ=1Lk=1LkξCINθfkξCINkg=(V1(2L(L+1)(θ=1Lk=θLV(η1(fη(MkξRθ)+gη(MkξRk)))))ei2π(V1(2L(L+1)(θ=1Lk=θLV(η1(fη(MkξIθ)+gη(MkξIk)))))),η1(2L(L+1)(θ=1Lk=θLη(V1(fV(NkξRθ)+gV(NkξRk)))))ei2π(η1(2L(L+1)(θ=1Lk=θLη(V1(fV(NkξIθ)+gV(NkξIk)))))))
CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(2L(L+1)θ=1Lk=1LkξCINθfkξCINkg)1f+g=(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk))))))ei2π(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξIθ)+gη(MkξIk))))))),V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξRθ)+gV(NkξRk))))))ei2π(V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξIθ)+gV(NkξIk)))))))).

Under Eq. (35) and Eq. (36), we employed some properties like idempotency, monotonicity, and boundedness.

Property 1

Choose any group of CIFNskξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L. IfkξCINθ=kξCIN=(MkξRei2π(MkξI),NkξRei2π(NkξI)), then

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=kξCIN (37)

Proof: By hypothesis kξCINθ=kξCIN=(MkξRei2π(MkξI),NkξRei2π(NkξI)), then

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(2L(L+1)θ=1Lk=1LkξCINfkξCINg)1f+g
=(2L(L+1)θ=1Lk=1LkξCINf+g)1f+g=(21(1+1)θ=11k=11kξCINf+g)1f+g

=(22kξCINf+g)1f+g=(kξCINf+g)1f+g=kξCIN. This proves Eq. (37).

Property 2

Choose any group of CIFNskξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L. IfkξCINθkξCINθ*, then

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)CIFAHAf,g(kξCIN1*,kξCIN2*,,kξCINL*) (38)

Proof: By hypothesis, we know that if kξCINθkξCINθ* that's mean MkξRθMkξRθ*,MkξIθMkξIθ* and NkξRθNkξRθ*,NkξIθNkξIθ*, then

fη(MkξRθ)+gη(MkξRk)fη(MkξRθ*)+gη(MkξRk*)

thus,

θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk))θ=1Lk=θLV(fη(MkξRθ*)+gη(MkξRk*))

then,

2L(L+1)(θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk)))2L(L+1)(θ=1Lk=θLV(fη(MkξRθ*)+gη(MkξRk*)))

thus,

V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk))))V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ*)+gη(MkξRk*))))

therefore,

η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ)+gη(MkξRk))))))η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξRθ*)+gη(MkξRk*))))))

Similarly, we investigate for an unreal term, such that

η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξIθ)+gη(MkξIk))))))η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(fη(MkξIθ*)+gη(MkξIk*))))))

Moreover, for real and unreal terms of FD, we have

V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξRθ)+gV(NkξRk))))))V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξRθ*)+gV(NkξRk*))))))

and,

V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξIθ)+gV(NkξIk))))))V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(fV(NkξIθ*)+gV(NkξIk*))))))

By using Eq. (6), we easily get the terms.

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)CIFAHAf,g(kξCIN1*,kξCIN2*,,kξCINL*). This proves Eq. (38).

Property 3

Choose any group of CIFNskξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L. IfkξCIN=(minθMkξRθei2π(minθMkξIθ),maxθNkξRθei2π(maxθNkξIθ))andkξCIN+=(maxθMkξRθei2π(maxθMkξIθ),minθNkξRθei2π(minθNkξIθ)), then

kξCINCIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)kξCIN+ (39)

Proof: To prove Eq. (39), we proceed as follows:

By hypothesis kξCIN=(minθMkξRθei2π(minθMkξIθ),maxθNkξRθei2π(maxθNkξIθ)) and kξCIN+=(maxθMkξRθei2π(maxθMkξIθ),minθNkξRθei2π(minθNkξIθ)), then by using Property 2, we initiate

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)CIFAHAf,g(kξCIN1+,kξCIN2+,,kξCINL+)

where CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=kξCIN and CIFAHAf,g(kξCIN1+,kξCIN2+,,kξCINL+)=kξCIN+, then

kξCINCIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)kξCIN+.

Where various realistic cases are stated below:

  • 1.

    For g=0, Eq. (36) will be transformed to

CIFAHAf,0(kξCIN1,kξCIN2,,kξCINL)=(η1(1fη(V1(2L(L+1)(θ=1L(L+1θ)V(η1fη(MkξRθ))))))ei2π(η1(1fη(V1(2L(L+1)(θ=1Lk=θL(L+1θ)V(η1fη(MkξIθ))))))),V1(1fV(η1(2L(L+1)(θ=1Lk=θL(L+1θ)η(V1fV(NkξRθ))))))ei2π(V1(1fV(η1(2L(L+1)(θ=1Lk=θL(L+1θ)η(V1fV(NkξIθ)))))))) (40)

Signified as a CIF generalized heavy-weighted averaging operator (CIFGHWAO).

  • 2.

    For f=1, and g=0, Eq. (36) will be transformed to

CIFAHA1,0(kξCIN1,kξCIN2,,kξCINL)=(V1(2L(L+1)(θ=1L(L+1θ)V((MkξRθ))))ei2π(V1(2L(L+1)(θ=1Lk=θL(L+1θ)V((MkξIθ))))),η1(2L(L+1)(θ=1L(L+1θ)η((NkξRθ))))ei2π(η1(2L(L+1)(θ=1L(L+1θ)η((NkξIθ)))))) (41)

Signified as a CIF heavy-weighted averaging operator (CIFHWAO).

  • 3.

    For f=0, Eq. (36) will be transformed to

CIFAHA0,g(kξCIN1,kξCIN2,,kξCINL)=(η1(1gη(V1(2L(L+1)(θ=1LiV(η1gη(MkξRθ))))))ei2π(η1(1gη(V1(2L(L+1)(θ=1LiV(η1gη(MkξIθ))))))),V1(1gV(η1(2L(L+1)(θ=1Liη(V1gV(NkξRθ))))))ei2π(V1(1gV(η1(2L(L+1)(θ=1Liη(V1gV(NkξIθ)))))))) (42)

Signified as a CIFGHWAO.

  • 4.

    For f=0 and g=1, Eq. (36) will be transformed to

CIFAHA0,1(kξCIN1,kξCIN2,,kξCINL)=(V1(2L(L+1)(θ=1LiV(MkξRθ)))ei2π(V1(2L(L+1)(θ=1LiV(MkξIθ)))),η1(2L(L+1)(θ=1Liη(NkξRθ)))ei2π(η1(2L(L+1)(θ=1Liη(NkξIθ))))) (43)
  • 5.

    By using Eq. (9) and Eq. (10), Eq. (36) will be transformed to

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=((1(θ=1Lk=θL(1MkξRθfMkξRkg))2L(L+1))1f+gei2π((1(θ=1Lk=θL(1MkξIθfMkξIkg))2L(L+1))1f+g),1(1(θ=1Lk=θL(1(1NkξRθ)f(1NkξRk)g))2L(L+1))1f+gei2π(1(1(θ=1Lk=θL(1(1NkξIθ)f(1NkξIk)g))2L(L+1))1f+g)) (44)

Signified as a CIFHM operator.

  • 6.

    By using Eq. (11) and Eq. (12), Eq. (36) will be transformed to

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(2(zR+zR)1f+g(zR+3zR)1f+g+(zR+zR)1f+gei2π(2(zI+zI)1f+g(zI+3zI)1f+g+(zI+zI)1f+g),(yR+3yR)1f+g(yRyR)1f+g(yR+3yR)1f+g+(yRyR)1f+gei2π((yI+3yI)1f+g(yIyI)1f+g(yI+3yI)1f+g+(yIyI)1f+g)) (45)

Where zR=θ=1Lk=θL(((2MkξRθMkξRθ)f(2MkξRkMkξRk)g)+3)2L(L+1),zR=θ=1Lk=θL(((2MkξRθMkξRθ)f(2MkξRkMkξRk)g)1)2L(L+1),yR=θ=1Lk=θL(((1+NkξRθ1NkξRθ)f(1+NkξRk1NkξRk)g)+3)2L(L+1),yR=θ=1Lk=θL(((1+NkξRθ1NkξRθ)f(1+NkξRk1NkξRk)g)1)2L(L+1) and zI=θ=1Lk=θL(((2MkξIθMkξIθ)f(2MkξIkMkξIk)g)+3)2L(L+1),zI=θ=1Lk=θL(((2MkξIθMkξIθ)f(2MkξIkMkξIk)g)1)2L(L+1),yI=θ=1Lk=θL(((1+NkξIθ1NkξIθ)f(1+NkξIk1NkξIk)g)+3)2L(L+1),yI=θ=1Lk=θL(((1+NkξIθ1NkξIθ)f(1+NkξIk1NkξIk)g)1)2L(L+1).

Signified as a CIF Einstein HM operator.

  • 7.

    By using Eq. (13) and Eq. (14), Eq. (36) will be transformed to

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(δSCˆ(zRzR)1f+g(zR+(δSCˆ21)zR)1f+g+(δSCˆ1)(zRzR)1f+gei2π(δSCˆ(zIzI)1f+g(zI+(δSCˆ21)zI)1f+g+(δSCˆ1)(zIzI)1f+g),(yR+3yR)1f+g(yRyR)1f+g(yR+3yR)1f+g+(yRyR)1f+gei2π((yI+3yI)1f+g(yIyI)1f+g(yI+3yI)1f+g+(yIyI)1f+g)) (46)

Where

zR=θ=1Lk=θL(((δSCˆ+(1δSCˆ)MkξRθMkξRθ)f(δSCˆ+(1δSCˆ)MkξRkMkξRk)g)+δSCˆ21)2L(L+1),zR=θ=1Lk=θL(((δSCˆ+(1δSCˆ)MkξRθMkξRθ)f(δSCˆ+(1δSCˆ)MkξRkMkξRk)g)1)2L(L+1),yR=θ=1Lk=θL(((δSCˆ+(1δSCˆ)(1NkξRθ)1NkξRθ)f(δSCˆ+(1δSCˆ)(1NkξRk)1NkξRk)g)+δSCˆ21)2L(L+1),yR=θ=1Lk=θL(((δSCˆ+(1δSCˆ)(1NkξRθ)1NkξRθ)f(δSCˆ+(1δSCˆ)(1NkξRk)1NkξRk)g)1)2L(L+1)

and

zI=θ=1Lk=θL(((δSCˆ+(1δSCˆ)MkξIθMkξIθ)f(δSCˆ+(1δSCˆ)MkξIkMkξIk)g)+δSCˆ21)2L(L+1),zI=θ=1Lk=θL(((δSCˆ+(1δSCˆ)MkξIθMkξIθ)f(δSCˆ+(1δSCˆ)MkξIkMkξIk)g)1)2L(L+1),yI=θ=1Lk=θL(((δSCˆ+(1δSCˆ)(1NkξIθ)1NkξIθ)f(δSCˆ+(1δSCˆ)(1NkξIk)1NkξIk)g)+δSCˆ21)2L(L+1),yI=θ=1Lk=θL(((δSCˆ+(1δSCˆ)(1NkξIθ)1NkξIθ)f(δSCˆ+(1δSCˆ)(1NkξIk)1NkξIk)g)1)2L(L+1).

Signified as a CIF Hamacher HM operator.

CIFAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(logδSCˆ((zR+(δSCˆ1)zR)1f+g+(δSCˆ1)(zRzR)1f+g(zR+(δSCˆ1)zR)1f+g)ei2π(logδSCˆ((zI+(δSCˆ1)zI)1f+g+(δSCˆ1)(zIzI)1f+g(zI+(δSCˆ1)zI)1f+g)),logδSCˆ(δSCˆ(yR+(δSCˆ1)yR)1f+g(yR+(δSCˆ1)yR)1f+g+(δSCˆ1)(yRyR)1f+g)ei2π(logδSCˆ(δSCˆ(yI+(δSCˆ1)yI)1f+g(yI+(δSCˆ1)yI)1f+g+(δSCˆ1)(yIyI)1f+g))) (47)

Where

zR=θ=1Lk=θL(1+(δSCˆ1)((δSCˆMkξRθ1δSCˆ1)f(δSCˆMkξRk1δSCˆ1)g))2L(L+1),zR=θ=1Lk=θL(1((δSCˆMkξRθ1δSCˆ1)f(δSCˆMkξRk1δSCˆ1)g))2L(L+1),yR=θ=1Lk=θL(1+(δSCˆ1)((δSCˆ1NkξRθ1δSCˆ1)f(δSCˆ1NkξRk1δSCˆ1)g))2L(L+1),yR=θ=1Lk=θL(1+(δSCˆ1)((δSCˆ1NkξRθ1δSCˆ1)f(δSCˆ1NkξRk1δSCˆ1)g))2L(L+1)

and

zI=θ=1Lk=θL(1+(δSCˆ1)((δSCˆMkξIθ1δSCˆ1)f(δSCˆMkξIk1δSCˆ1)g))2L(L+1),zI=θ=1Lk=θL(1((δSCˆMkξIθ1δSCˆ1)f(δSCˆMkξIk1δSCˆ1)g))2L(L+1),yI=θ=1Lk=θL(1+(δSCˆ1)((δSCˆ1NkξIθ1δSCˆ1)f(δSCˆ1NkξIk1δSCˆ1)g))2L(L+1),yI=θ=1Lk=θL(1+(δSCˆ1)((δSCˆ1NkξIθ1δSCˆ1)f(δSCˆ1NkξIk1δSCˆ1)g))2L(L+1).

Signified as a CIF Frank HM operator.

Definition 9

Choose any group of CIFNs kξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L, then the CIFWAHA operator is invented by:

CIFWAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(2L(L+1)θ=1Lk=1L(LωθkξCINθ)f(LωkkξCINk)g)1f+g (48)

Observed that f,g0, with ω=(ω1,ω2,,ωL)T, θ=1Lωθ=1, called weight vectors

Theorem 2

Choose any group of CIFNskξCINθ=(MkξRθei2π(MkξIθ),NkξRθei2π(NkξIθ)),θ=1,2,,L, then by using Eq. (48), we initiate

CIFWAHAf,g(kξCIN1,kξCIN2,,kξCINL)=(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(η1(fη(V1(LωθMkξRθ))+gη(V1(LωkMkξRk))))))))ei2π(η1(1f+gη(V1(2L(L+1)(θ=1Lk=θLV(η1(fη(V1(LωθMkξIθ))+gη(V1(LωkMkξIk))))))))),V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(V1(fV(η1(LωθNkξRθ))+gV(η1(LωkNkξRk))))))))ei2π(V1(1f+gV(η1(2L(L+1)(θ=1Lk=θLη(V1(fV(η1(LωθNkξIθ))+gV(η1(LωkNkξIk)))))))))) (49)

Proof: Skipped.

5. Decision-making procedure for derived operators

In this section, we concentrate on evaluating the MADM procedure in the presence of the invented operators for CIFSs. For this, we used the special cases of the proposed operators and tried to evaluate their decision matrix to enhance the stability and worth of the invented operators.

5.1. The procedure of the MADM technique

Consider the finite collection of alternatives kξAL={kξAL1,kξAL2,,kξALm} and L number of attributes kξAT={kξAT1,kξAT2,,kξATL} with weight vector ω=(ω1,ω2,,ωL)T with a rule θ=1Lωθ=1. For the above information, we compute the matrix by including their values in the shape of CIFNs, such as kξCINθk=(MkξRθkei2π(MkξIθk),NkξRθkei2π(NkξIθk)),θ=1,2,,L,k=1,2,,m, where MkξCI(xEL)=MkξR(xEL)ei2π(MkξI(xEL)) and NkξCI(xEL)=NkξR(xEL)ei2π(NkξI(xEL)), with 0MkξR(xEL)+NkξR(xEL)1 and 0MkξI(xEL)+NkξI(xEL)1. For simplification of some numerical examples, we evaluate the procedure of decision-making techniques, such as

Stage 1: To select the CIFNs, we construct the matrix, if the matrix covers the cost type of data, then we normalize the matrix, such as

DDM={(MkξRθkei2π(MkξIθk),NkξRθkei2π(NkξIθk))forbenefittypesdata(NkξRθkei2π(NkξIθk),MkξRθkei2π(MkξIθk))forcosttypesdata

But in the case of benefit types of data, we are not required to normalize the data.

Stage 2: We aggregate the information in the matrix.

Stage 3: Derive or discover the score value (SV) of the above aggregated information.

Stage 4: For discovering the most preferable decision, based on the score values, we rank alternatives. The graphical representation of the proposed decision-making procedure is listed in Fig. 2.

Fig. 2.

Fig. 2

Geometrical representation of the proposed decision-making procedure.

Finally, we analyze some examples based on the invented theory for evaluating the consistency and validity of the proposed operators as well as the decision-making procedure.

5.2. Analysis of best madia communications

Media communication covers numerous techniques and technologies for transmitting or showing information, data, material, or messages with the help of different sources like the internet, mobile phones, television, and different channels. All these channels are categorized into different kinds based on the medium or platform exploited for communications. The major influence of this application is to find the best kind of media communications among the five best, such as:

  • 1)

    Print Media “kξAL1”.

  • 2)

    Broadcast Media “kξAL2”.

  • 3)

    Digital Media “kξAL3”.

  • 4)

    Social Media “kξAL4”.

  • 5)

    Telecommunications “kξAL5”.

To address the best one, we use some features as an attribute's values, such as kξAT1: Growing analysis, kξAT2: Community-governmental impact, kξAT3: Ecological impact, and kξAT4: others. To achieve our target, we consider the weight vectors, such as 0.3,0.3,0.3, and 0.1. For simplification of some numerical examples, we evaluate the procedure of decision-making techniques, such as

Stage 1: To select the CIFNs, we construct the matrix, see Tables 1 and If the matrix covers the cost type of data, then we normalize the matrix, such as

DDM={(MkξRθkei2π(MkξIθk),NkξRθkei2π(NkξIθk))forbenefittypesdata(NkξRθkei2π(NkξIθk),MkξRθkei2π(MkξIθk))forcosttypesdata

Table 1.

The original matrix is given by the decision-maker.

kξAT1 kξAT2
kξAL1 (0.7ei2π(0.8),0.2ei2π(0.1)) (0.71ei2π(0.81),0.21ei2π(0.11))
kξAL2 (0.8ei2π(0.5),0.1ei2π(0.3)) (0.81ei2π(0.51),0.11ei2π(0.31))
kξAL3 (0.5ei2π(0.4),0.3ei2π(0.4)) (0.51ei2π(0.41),0.31ei2π(0.41))
kξAL4 (0.8ei2π(0.8),0.1ei2π(0.1)) (0.81ei2π(0.81),0.11ei2π(0.11))
kξAL5
(0.6ei2π(0.7),0.1ei2π(0.2))
(0.61ei2π(0.71),0.11ei2π(0.21))
kξAT3 kξAT4
kξAL1 (0.72ei2π(0.82),0.22ei2π(0.12)) (0.73ei2π(0.83),0.23ei2π(0.13))
kξAL2 (0.82ei2π(0.52),0.12ei2π(0.32)) (0.83ei2π(0.53),0.13ei2π(0.33))
kξAL3 (0.52ei2π(0.42),0.32ei2π(0.42)) (0.53ei2π(0.43),0.33ei2π(0.43))
kξAL4 (0.82ei2π(0.82),0.12ei2π(0.12)) (0.83ei2π(0.83),0.13ei2π(0.13))
kξAL5 (0.62ei2π(0.72),0.12ei2π(0.22)) (0.63ei2π(0.73),0.13ei2π(0.23))

But in the case of benefit types of data, we are not required to normalize the data. Anyhow the data in Table 1 is not required to be normalized.

Stage 2: To consider the data in Eq. (36) for f=g=1, the aggregation values are listed below:

kξAL1=(0.5909ei2π(0.6932),0.3388ei2π(0.2249)),kξAL2=(0.6932ei2π(0.4109),0.2249ei2π(0.4377)),kξAL3=(0.4109ei2π(0.3274),0.4377ei2π(0.5286)),kξAL4=(0.6932ei2π(0.6932),0.2249ei2π(0.2249)),kξAL5=(0.4981ei2π(0.5909),0.2249ei2π(0.3388))

Stage 3: For ranking values, we expose the score values, such as

kξAL1=0.3602,kξAL2=0.2207,kξAL3=0.114,kξAL4=0.4683,kξAL5=0.2626

Stage 4: The ranking information is listed below:

kξAL4>kξAL1>kξAL5>kξAL2>kξAL3

Seen that kξAL4 is the best one. Further, to eliminate the phase term from the data in Table 1, we obtained the simple IFS, see Table 2.

Table 2.

The original matrix is given by the decision-maker.

kξAT1 kξAT2 kξAT3 kξAT4
kξAL1 (0.7,0.2) (0.71,0.21) (0.72,0.22) (0.73,0.23)
kξAL2 (0.8,0.1) (0.81,0.11) (0.82,0.12) (0.83,0.13)
kξAL3 (0.5,0.3) (0.51,0.31) (0.52,0.32) (0.53,0.33)
kξAL4 (0.8,0.1) (0.81,0.11) (0.82,0.12) (0.83,0.13)
kξAL5 (0.6,0.1) (0.61,0.11) (0.62,0.12) (0.63,0.13)

To consider the data in Eq. (36) for f=g=1, the aggregated values are listed below:

kξAL1=(0.5909,0.3388),kξAL2=(0.6932,0.2249),kξAL3=(0.4109,0.4377),kξAL4=(0.6932,0.2249),kξAL5=(0.4981,0.2249)

For ranking values, we expose the score values, such as

kξAL1=0.1261,kξAL2=0.2341,kξAL3=0.013,kξAL4=0.2341,kξAL5=0.1366

The ranking information is listed below:

kξAL4>kξAL2>kξAL5>kξAL1>kξAL3

Seen that kξAL4 is the best one. Moreover, we derive the comparison between proposed and existing operators to improve the worth of the derived theory.

5.3. Sensitive analysis

In this section, we compare the discovered operators with some prevailing operators based on the data in Table 1 with phase term and without phase term. For comparing the invented techniques with existing techniques, we consider some valuable and dominant techniques to improve the worth of the invented theory. For this, we consider the following existing techniques, such as Garg and Rani [37] elaborated generalized Bonferroni mean operators for CIFSs, Liu, and Chen [41] initiated the HM operators for IFSs, and proposed works based on CIFSs. To consider the data in Table 1, the comparative analysis is listed in Table 3.

Table 3.

Sensitive analysis (Table 1).

Methods Score Values Ranking Values
Garg and Rani [37]
0.3593,0.2195,0.121,0.4769,0.2593
kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Liu and Chen [41] CannotbeCalculated CannotbeCalculated
Eq. (40) 0.2492,0.1094,0.231,0.3658,0.1492 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (41) 0.2492,0.1094,0.231,0.3658,0.1492 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (42) 0.2475,0.1077,0.232,0.3635,0.1465 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (43) 0.2475,0.1077,0.232,0.3635,0.1465 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (44) 0.3602,0.2207,0.114,0.4683,0.2626 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (45) 0.4713,0.3318,0.225,0.5794,0.3737 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (46) 0.5413,0.4118,0.3051,0.6584,0.4527 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (47) 0.2501,0.1106,0.003,0.3572,0.1515 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
Eq. (49) 0.6695,0.6273,0.6061,0.6654,0.6128 kξAL1>kξAL4>kξAL2>kξAL5>kξAL3

Seen that kξAL4 is the best one according to some operators and see that kξAL1 is the best one according to some operators. The geometrical interpretation of the data in Table 3 is listed in Fig. 3.

Fig. 3.

Fig. 3

Geometrical representation of the data in Table 3.

Furthermore, we state the influence of the parameters f and g. For this, first, we fixed the value of f=1, then for different values of g, the ranking values are stated in Table 4.

Table 4.

Influence of the parameter g, if f=1, (Table 1).

Parameter Score Values Ranking Values
g=1 0.3602,0.2207,0.114,0.4683,0.1641 kξAL4>kξAL1>kξAL2>kξAL5>kξAL3
g=2 0.414,0.2744,0.0585,0.5181,0.2694 kξAL4>kξAL1>kξAL2>kξAL5>kξAL3
g=3 0.447,0.307,0.0255,0.5489,0.3216 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
g=5 0.4867,0.3456,0.0123,0.5862,0.3763 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
g=7 0.5102,0.3679,0.0331,0.6086,0.4055 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
g=9 0.5258,0.3826,0.0463,0.6238,0.4238 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
g=10 0.5318,0.3882,0.0513,0.6297,0.4306 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3

We fixed the value of f=1, then the influence of the g, stated in Table 5.

Table 5.

Influence of the parameter g if f=1, (Table 1).

Parameter Score Values Ranking Values
g=1 0.1261,0.234,0.0134,0.2341,0.0892 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=2 01549,0.2591,0.0153,0.2591,0.1396 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=3 0.1726,0.2745,0.0326,0.2745,0.1645 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=5 0.1936,0.2931,0.0525,0.2931,0.1905 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=7 0.2058,0.3043,0.0636,0.3043,0.2043 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=9 0.2139,0.3119,0.0707,0.3119,0.213 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
g=10 0.2170,0.3148,0.0734,0.3148,0.2162 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3

We fixed the value of g=1, then the influence of the f, stated in Table 6.

Table 6.

Influence of the parameter f if g=1, (Table 1).

Parameter Score Values Ranking Values
f=1 0.3602,0.2207,0.114,0.4683,0.1641 kξAL4>kξAL1>kξAL2>kξAL5>kξAL3
f=2 0.4143,0.2747,0.0583,0.5186,0.3181 kξAL4>kξAL1>kξAL2>kξAL5>kξAL3
f=3 0.4476,0.3076,0.0252,0.5496,0.3519 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
f=5 0.4874,0.3463,0.0127,0.5871,0.3920 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
f=7 0.5109,0.3687,0.0338,0.6096,0.4153 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
f=9 0.5267,0.3835,0.0472,0.6248,0.4307 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3
f=10 0.5328,0.3892,0.0523,0.6307,0.4366 kξAL4>kξAL1>kξAL5>kξAL2>kξAL3

We fixed the value of g=1, then the influence of the f, stated in Table 7.

Table 7.

Influence of the parameter f if g=1, (Table 1).

Parameter Score Values Ranking Values
f=1 0.1261,0.2341,0.0134,0.2341,0.0892 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=2 0.1550,0.2593,0.0154,0.2593,0.1631 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=3 0.1727,0.2748,0.0327,0.2748,0.1791 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=5 0.1938,0.2936,0.0527,0.2936,0.1981 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=7 0.2062,0.3048,0.0639,0.3048,0.2092 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=9 0.2143,0.3124,0.0711,0.3124,0.2164 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3
f=10 0.2174,0.3154,0.0738,0.3154,0.2192 kξAL4>kξAL2>kξAL1>kξAL5>kξAL3

In the above investigation, we observed that for every value of parameters, we derive the same ranking results. The benefit of the proposed theory is that, with the help of proposed operators we can derive the ranking values of the many operators like algebraic, Einstein, Hamacher, and frank aggregation operators. Hence, the derived operator is more flexible and more dominant compared to other existing techniques.

6. Conclusion

Archimedean aggregation operators and Heronian mean operators are two different types of operators used for aggregating the collection of information into a singleton set. Keeping the advantages of the above operators, the major contributions of the derived operators are listed below:

  • 1.

    We proposed the Archimedean operational laws based on CIF values.

  • 2.

    We derived the algebraic operational laws, Einstein operational laws, Hamacher operational laws, and Frank operational laws from the Archimedean operational laws by using different values of the functions in Archimedean operational laws.

  • 3.

    We evaluated the CIFAHA operator and CIFWAHA operator. Several special cases and the basic properties of the above-proposed operators are also diagnosed.

  • 4.

    We illustrated the MADM process developed under the identified operators by using CIF information.

  • 5.

    We discovered several examples to show the MADM technique is massively more flexible than the prevailing works with the help of sensitive analysis between explored and certain prevailing works.

6.1. Limitations of the proposed works

The proposed Archimedean Heronian mean operators based on CIFS are very flexible and dominant because of their structure and features, but in complicated situations, these ideas have not worked properly, for instance, if we are faced the information in the shape of yes, abstinence, no, and refusal, then the proposed operators based on CIFS have been failed. For this, we are required to compute these operators based on complex T-spherical fuzzy sets and their extensions.

6.2. Future direction

In the upcoming time, the proposed operators based on CIFS will receive a lot of attraction because, with the help of these operators, we can easily depict unreliable and vague information. Further, these operators will be utilized in the circumstances of complex Pythagorean fuzzy sets and their extensions. With the help of the proposed work, we can easily evaluate the problem of machine learning, medical diagnosis, artificial intelligence, neural networks, and many others if someone provides practical data. Moreover, we will employ the principle of complex fuzzy sets [[44], [45], [46]] quasirung orthopair fuzzy sets [47,48], complex q-rung orthopair fuzzy sets [[49], [50], [51]], complex spherical and T-spherical fuzzy sets [52,53], T-spherical fuzzy sets [[54], [55], [56]], and linear Diophantine fuzzy sets [[57], [58], [59], [60], [61]] in the environment of medical diagnosis, pattern recognition, manufacturing science, and computer science to grow the excellence of the explore mechanisms.

Ethics declaration statement

The authors state that this is their original work, and it is neither submitted nor under consideration in any other journal simultaneously.

Data availability

The authors agree that the data used in this manuscript is available to everyone and anyone can use this data by just citing this article.

CRediT authorship contribution statement

Zeeshan Ali: Writing – review & editing, Writing – original draft, Resources, Methodology, Investigation, Formal analysis, Conceptualization. Walid Emam: Resources, Methodology, Investigation, Funding acquisition, Formal analysis. Tahir Mahmood: Writing – review & editing, Validation, Supervision, Project administration, Investigation, Formal analysis, Conceptualization. Haolun Wang: Validation, Resources, Methodology, Investigation, Formal analysis.

Declaration of competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Funding Acknowledgement

The study was funded by Researchers Supporting Project number (RSP2024R749), King Saud University, Riyadh, Saudi Arabia.

Contributor Information

Zeeshan Ali, Email: zeeshanalinsr@gmail.com.

Walid Emam, Email: wemam.c@ksu.edu.sa.

Tahir Mahmood, Email: tahirbakhat@iiu.edu.pk.

Haolun Wang, Email: hlwang71162@nchu.edu.cn.

References

  • 1.Zadeh L.A. Fuzzy sets. Inf. Control. 1965;8(3):338–353. [Google Scholar]
  • 2.Atanassov K. Intuitionistic fuzzy sets. Fuzzy Set Syst. 1986;20(1):87–96. [Google Scholar]
  • 3.Huang W., Zhang F., Xu S. A complete ranking method for interval-valued intuitionistic fuzzy numbers and their applications to multicriteria decision making. Soft Comput. 2021;25(3):2513–2520. [Google Scholar]
  • 4.Seikh M.R., Mandal U. Intuitionistic fuzzy Dombi aggregation operators and their application to multiple attribute decision-making. Granular Computing. 2021;6(3):473–488. [Google Scholar]
  • 5.Tiwari P. Generalized entropy and Similarity measure for interval-valued intuitionistic fuzzy sets with application in decision making. Int. J. Fuzzy Syst. Appl. 2021;10(1):64–93. [Google Scholar]
  • 6.Mahmood T. A novel approach towards bipolar soft sets and their applications. J. Math. 2020;2020 Article ID: 4690808, 2020. [Google Scholar]
  • 7.Huang G., Xiao L. Failure mode and effect analysis: an interval-valued intuitionistic fuzzy cloud theory-based method. Appl. Soft Comput. 2021;98:106834–106857. [Google Scholar]
  • 8.Zhao M., Wei G., Wei C., Wu J. Improved TODIM method for intuitionistic fuzzy MAGDM based on cumulative prospect theory and its application on stock investment selection. International Journal of Machine Learning and Cybernetics. 2021;12(3):891–901. [Google Scholar]
  • 9.Du W.S. Subtraction and division operations on intuitionistic fuzzy sets derived from the Hamming distance. Inf. Sci. 2021;571:206–224. [Google Scholar]
  • 10.Alcantud J.C.R., Khameneh A.Z., Kilicman A. Aggregation of infinite chains of intuitionistic fuzzy sets and their application to choices with temporal intuitionistic fuzzy information. Inf. Sci. 2020;514:106–117. [Google Scholar]
  • 11.Aydın T., Enginoğlu S. Interval-valued intuitionistic fuzzy parameterized interval-valued intuitionistic fuzzy soft sets and their application in decision-making. J. Ambient Intell. Hum. Comput. 2021;12(1):1541–1558. [Google Scholar]
  • 12.Rani P., Mishra A.R., Ansari M.D., Ali J. Assessment of performance of telecom service providers using intuitionistic fuzzy grey relational analysis framework (IF-GRA) Soft Comput. 2021;25(3):1983–1993. [Google Scholar]
  • 13.Mishra A.R., Garg A.K., Purwar H., Rana P., Liao H., Mardani A. An extended intuitionistic fuzzy multi-attributive border approximation area comparison approach for smartphone selection using discrimination measures. Informatica. 2021;32(1):119–143. [Google Scholar]
  • 14.Liu Y., Jiang W. A new distance measure of interval-valued intuitionistic fuzzy sets and its application in decision making. Soft Comput. 2020;24(9):6987–7003. [Google Scholar]
  • 15.Ramot D., Milo R., Friedman M., Kandel A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002;10(2):171–186. [Google Scholar]
  • 16.Zhang G., Dillon T.S., Cai K.Y., Ma J., Lu J. Operation properties and δ-equalities of complex fuzzy sets. Int. J. Approx. Reason. 2009;50(8):1227–1249. [Google Scholar]
  • 17.Ramot D., Friedman M., Langholz G., Kandel A. Complex fuzzy logic. IEEE Trans. Fuzzy Syst. 2003;11(4):450–461. [Google Scholar]
  • 18.Yazdanbakhsh O., Dick S. A systematic review of complex fuzzy sets and logic. Fuzzy Set Syst. 2018;338:1–22. [Google Scholar]
  • 19.Chen Z., Aghakhani S., Man J., Dick S. ANCFIS: a neuro-fuzzy architecture employing complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2010;19(2):305–322. [Google Scholar]
  • 20.Li C., Chiang T.W. Complex neuro-fuzzy ARIMA forecasting—a new approach using complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2012;21(3):567–584. [Google Scholar]
  • 21.Hu B., Bi L., Dai S., Li S. Distances of complex fuzzy sets and continuity of complex fuzzy operations. J. Intell. Fuzzy Syst. 2018;35(2):2247–2255. [Google Scholar]
  • 22.Ma J., Zhang G., Lu J. A method for multiple periodic factor prediction problems using complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2011;20(1):32–45. [Google Scholar]
  • 23.Alkouri A.U.M., Salleh A.R. Linguistic variables, hedges, and several distances on complex fuzzy sets. J. Intell. Fuzzy Syst. 2014;26(5):2527–2535. [Google Scholar]
  • 24.Liu P., Ali Z., Mahmood T. The distance measures and cross-entropy are based on complex fuzzy sets and their application in decision making. J. Intell. Fuzzy Syst. 2020;39(3):3351–3374. [Google Scholar]
  • 25.Dai S., Bi L., Hu B. Distance measures between the interval-valued complex fuzzy sets. Mathematics. 2019;7(6):549–561. [Google Scholar]
  • 26.Alkouri A.M.D.J.S., Salleh A.R. vol. 1482. American Institute of Physics; 2012. Complex intuitionistic fuzzy sets; pp. 464–470. (AIP Conference Proceedings). 1. [Google Scholar]
  • 27.Garg H., Rani D. Some results on information measures for complex intuitionistic fuzzy sets. Int. J. Intell. Syst. 2019;34(10):2319–2363. [Google Scholar]
  • 28.Garg H., Rani D. A robust correlation coefficient measure of complex intuitionistic fuzzy sets and their applications in decision-making. Appl. Intell. 2019;49(2):496–512. [Google Scholar]
  • 29.Garg H., Rani D. Generalized geometric aggregation operators based on t-norm operations for complex intuitionistic fuzzy sets and their application to decision-making. Cognitive Computation. 2019;4(1):1–20. [Google Scholar]
  • 30.Garg H., Rani D. Robust averaging–geometric aggregation operators for complex intuitionistic fuzzy sets and their applications to MCDM process. Arabian J. Sci. Eng. 2020;45(3):2017–2033. [Google Scholar]
  • 31.Garg H., Rani D. Some generalized complex intuitionistic fuzzy aggregation operators and their application to multicriteria decision-making process. Arabian J. Sci. Eng. 2019;44(3):2679–2698. [Google Scholar]
  • 32.Rani D., Garg H. Complex intuitionistic fuzzy power aggregation operators and their applications in multicriteria decision‐making. Expet Syst. 2018;35(6):e12325–e12348. [Google Scholar]
  • 33.Rani D., Garg H. Complex intuitionistic fuzzy preference relations and their applications in individual and group decision‐making problems. Int. J. Intell. Syst. 2021;36(4):1800–1830. [Google Scholar]
  • 34.Ali Z., Mahmood T., Aslam M., Chinram R. Another view of complex intuitionistic fuzzy soft sets based on prioritized aggregation operators and their applications to multiattribute decision making. Mathematics. 2021;9(16):1922–1949. [Google Scholar]
  • 35.Xia M., Xu Z., Zhu B. Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm. Knowl. Base Syst. 2012;31:78–88. [Google Scholar]
  • 36.Luo X., Xu Z., Gou X. Exponential operational laws and new aggregation operators of intuitionistic Fuzzy information based on Archimedean T-conorm and T-norm. International Journal of Machine Learning and Cybernetics. 2018;9(8):1261–1269. [Google Scholar]
  • 37.Garg H., Rani D. New generalised Bonferroni mean aggregation operators of complex intuitionistic fuzzy information based on Archimedean t-norm and t-conorm. J. Exp. Theor. Artif. Intell. 2020;32(1):81–109. [Google Scholar]
  • 38.Yu D. Group decision making under interval‐valued multiplicative intuitionistic fuzzy environment based on Archimedean t‐conorm and t‐norm. Int. J. Intell. Syst. 2015;30(5):590–616. [Google Scholar]
  • 39.Ma Z.M., Yang W. Symmetric intuitionistic fuzzy weighted mean operators based on weighted Archimedean t-norms and t-conorms for multi-criteria decision making. Informatica. 2020;31(1):89–112. [Google Scholar]
  • 40.Liu J., Lin S., Chen H., Zhou L. The continuous quasi-OWA operator and its application to group decision making. Group Decis. Negot. 2013;22(4):715–738. [Google Scholar]
  • 41.Liu P., Chen S.M. Group decision making based on Heronian aggregation operators of intuitionistic fuzzy numbers. IEEE Trans. Cybern. 2016;47(9):2514–2530. doi: 10.1109/TCYB.2016.2634599. [DOI] [PubMed] [Google Scholar]
  • 42.Seikh M.R., Mandal U. Q-rung orthopair fuzzy Frank aggregation operators and its application in multiple attribute decision-making with unknown attribute weights. Granular Computing. 2022:1–22. [Google Scholar]
  • 43.Seikh M.R., Mandal U. Some picture fuzzy aggregation operators based on Frank t-norm and t-conorm: application to MADM process. Informatica. 2021;45(3) [Google Scholar]
  • 44.Ozer O. Hamacher prioritized aggregation operators based on complex picture fuzzy sets and their applications in decision-making problems. Journal of Innovative Research in Mathematical and Computational Sciences. 2022;1(1):33–54. [Google Scholar]
  • 45.Liaqat M., Yin S., Akmram M., Ijaz S. Aczel-alsina aggregation operators based on interval-valued complex single-valued neutrosophic information and their application in decision-making problems. Journal of Innovative Research in Mathematical and Computational Sciences. 2022;1(2):40–66. [Google Scholar]
  • 46.Jaleel A. WASPAS technique utilized for agricultural robotics system based on Dombi aggregation operators under bipolar complex fuzzy soft information. Journal of Innovative Research in Mathematical and Computational Sciences. 2022;1(2):67–95. [Google Scholar]
  • 47.Seikh M.R., Mandal U. Multiple attribute decision-making based on 3, 4-quasirung fuzzy sets. Granular Computing. 2022:1–14. [Google Scholar]
  • 48.Seikh M.R., Mandal U. Multiple attribute group decision making based on quasirung orthopair fuzzy sets: application to electric vehicle charging station site selection problem. Eng. Appl. Artif. Intell. 2022;115 [Google Scholar]
  • 49.Ali Z., Mahmood T., Ullah K., Khan Q. Einstein geometric aggregation operators using a novel complex interval-valued pythagorean fuzzy setting with application in green supplier chain management. Reports in Mechanical Engineering. 2021;2(1):105–134. [Google Scholar]
  • 50.Ali Z., Mahmood T. Maclaurin symmetric mean operators and their applications in the environment of complex q-rung orthopair fuzzy sets. Comput. Appl. Math. 2020;39:1–27. [Google Scholar]
  • 51.Rong Y., Liu Y., Pei Z. Complex q‐rung orthopair fuzzy 2‐tuple linguistic Maclaurin symmetric mean operators and its application to emergency program selection. Int. J. Intell. Syst. 2020;35(11):1749–1790. [Google Scholar]
  • 52.Ali Z., Mahmood T., Yang M.S. TOPSIS method based on complex spherical fuzzy sets with Bonferroni mean operators. Mathematics. 2020;8(10):1739–1772. [Google Scholar]
  • 53.Ali Z., Mahmood T., Yang M.S. Complex T-spherical fuzzy aggregation operators with application to multi-attribute decision making. Symmetry. 2020;12(8):1311–1342. [Google Scholar]
  • 54.Mahmood T., Ullah K., Khan Q., Jan N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019;31(11):7041–7053. [Google Scholar]
  • 55.Wu M.Q., Chen T.Y., Fan J.P. Divergence measure of T-spherical fuzzy sets and its applications in pattern recognition. IEEE Access. 2019;8:10208–10221. [Google Scholar]
  • 56.Wu M.Q., Chen T.Y., Fan J.P. Similarity measures of T-spherical fuzzy sets based on the cosine function and their applications in pattern recognition. IEEE Access. 2020;8:98181–98192. [Google Scholar]
  • 57.Riaz M., Hashmi M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019;37(4):5417–5439. [Google Scholar]
  • 58.Riaz M., Hashmi M.R., Kalsoom H., Pamucar D., Chu Y.M. Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment. Symmetry. 2020;12(8):1215–1237. [Google Scholar]
  • 59.Kamacı H. Linear Diophantine fuzzy algebraic structures. J. Ambient Intell. Hum. Comput. 2021;2(4):1–21. [Google Scholar]
  • 60.Almagrabi A.O., Abdullah S., Shams M., Al-Otaibi Y.D., Ashraf S. A new approach to q-linear Diophantine fuzzy emergency decision support system for COVID19. J. Ambient Intell. Hum. Comput. 2021;2(3):1–27. doi: 10.1007/s12652-021-03130-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 61.Ayub S., Shabir M., Riaz M., Aslam M., Chinram R. Linear diophantine fuzzy relations and their algebraic properties with decision making. Symmetry. 2021;13(6):945–981. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The authors agree that the data used in this manuscript is available to everyone and anyone can use this data by just citing this article.


Articles from Heliyon are provided here courtesy of Elsevier

RESOURCES