Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

T-spherical linear Diophantine fuzzy aggregation operators for multiple attribute decision-making

  • This paper aims to amalgamate the notion of a T-spherical fuzzy set (T-SFS) and a linear Diophantine fuzzy set (LDFS) to elaborate on the notion of the T-spherical linear Diophantine fuzzy set (T-SLDFS). The new concept is very effective and is more dominant as compared to T-SFS and LDFS. Then, we advance the basic operations of T-SLDFS and examine their properties. To effectively aggregate the T-spherical linear Diophantine fuzzy data, a T-spherical linear Diophantine fuzzy weighted averaging (T-SLDFWA) operator and a T-spherical linear Diophantine fuzzy weighted geometric (T-SLDFWG) operator are proposed. Then, the properties of these operators are also provided. Furthermore, the notions of the T-spherical linear Diophantine fuzzy-ordered weighted averaging (T-SLDFOWA) operator; T-spherical linear Diophantine fuzzy hybrid weighted averaging (T-SLDFHWA) operator; T-spherical linear Diophantine fuzzy-ordered weighted geometric (T-SLDFOWG) operator; and T-spherical linear Diophantine fuzzy hybrid weighted geometric (T-SLDFHWG) operator are proposed. To compare T-spherical linear Diophantine fuzzy numbers (T-SLDFNs), different types of score and accuracy functions are defined. On the basis of the T-SLDFWA and T-SLDFWG operators, a multiple attribute decision-making (MADM) method within the framework of T-SLDFNs is designed, and the ranking results are examined by different types of score functions. A numerical example is provided to depict the practicality and ascendancy of the proposed method. Finally, to demonstrate the excellence and accessibility of the proposed method, a comparison analysis with other methods is conducted.

    Citation: Ashraf Al-Quran. T-spherical linear Diophantine fuzzy aggregation operators for multiple attribute decision-making[J]. AIMS Mathematics, 2023, 8(5): 12257-12286. doi: 10.3934/math.2023618

    Related Papers:

    [1] Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan . Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making. AIMS Mathematics, 2023, 8(5): 11916-11942. doi: 10.3934/math.2023602
    [2] Shahzaib Ashraf, Huzaira Razzaque, Muhammad Naeem, Thongchai Botmart . Spherical q-linear Diophantine fuzzy aggregation information: Application in decision support systems. AIMS Mathematics, 2023, 8(3): 6651-6681. doi: 10.3934/math.2023337
    [3] Muhammad Akram, Sumera Naz, Feng Feng, Ghada Ali, Aqsa Shafiq . Extended MABAC method based on 2-tuple linguistic T-spherical fuzzy sets and Heronian mean operators: An application to alternative fuel selection. AIMS Mathematics, 2023, 8(5): 10619-10653. doi: 10.3934/math.2023539
    [4] Hanan Alohali, Muhammad Bilal Khan, Jorge E. Macías-Díaz, Fahad Sikander . On (p,q)-fractional linear Diophantine fuzzy sets and their applications via MADM approach. AIMS Mathematics, 2024, 9(12): 35503-35532. doi: 10.3934/math.20241685
    [5] Sohail Ahmad, Ponam Basharat, Saleem Abdullah, Thongchai Botmart, Anuwat Jirawattanapanit . MABAC under non-linear diophantine fuzzy numbers: A new approach for emergency decision support systems. AIMS Mathematics, 2022, 7(10): 17699-17736. doi: 10.3934/math.2022975
    [6] Muhammad Qiyas, Muhammad Naeem, Neelam Khan . Fractional orthotriple fuzzy Choquet-Frank aggregation operators and their application in optimal selection for EEG of depression patients. AIMS Mathematics, 2023, 8(3): 6323-6355. doi: 10.3934/math.2023320
    [7] Muhammad Qiyas, Muhammad Naeem, Saleem Abdullah, Neelam Khan . Decision support system based on complex T-Spherical fuzzy power aggregation operators. AIMS Mathematics, 2022, 7(9): 16171-16207. doi: 10.3934/math.2022884
    [8] Muhammad Bilal Khan, Dragan Pamucar, Mohamed Abdelwahed, Nurnadiah Zamri, Loredana Ciurdariu . Using multi-attribute decision-making technique for the selection of agribots via newly defined fuzzy sets. AIMS Mathematics, 2025, 10(5): 12168-12204. doi: 10.3934/math.2025552
    [9] Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan, Salman Khan . Spherical fuzzy rough Hamacher aggregation operators and their application in decision making problem. AIMS Mathematics, 2023, 8(7): 17112-17141. doi: 10.3934/math.2023874
    [10] Muhammad Naeem, Aziz Khan, Shahzaib Ashraf, Saleem Abdullah, Muhammad Ayaz, Nejib Ghanmi . A novel decision making technique based on spherical hesitant fuzzy Yager aggregation information: application to treat Parkinson's disease. AIMS Mathematics, 2022, 7(2): 1678-1706. doi: 10.3934/math.2022097
  • This paper aims to amalgamate the notion of a T-spherical fuzzy set (T-SFS) and a linear Diophantine fuzzy set (LDFS) to elaborate on the notion of the T-spherical linear Diophantine fuzzy set (T-SLDFS). The new concept is very effective and is more dominant as compared to T-SFS and LDFS. Then, we advance the basic operations of T-SLDFS and examine their properties. To effectively aggregate the T-spherical linear Diophantine fuzzy data, a T-spherical linear Diophantine fuzzy weighted averaging (T-SLDFWA) operator and a T-spherical linear Diophantine fuzzy weighted geometric (T-SLDFWG) operator are proposed. Then, the properties of these operators are also provided. Furthermore, the notions of the T-spherical linear Diophantine fuzzy-ordered weighted averaging (T-SLDFOWA) operator; T-spherical linear Diophantine fuzzy hybrid weighted averaging (T-SLDFHWA) operator; T-spherical linear Diophantine fuzzy-ordered weighted geometric (T-SLDFOWG) operator; and T-spherical linear Diophantine fuzzy hybrid weighted geometric (T-SLDFHWG) operator are proposed. To compare T-spherical linear Diophantine fuzzy numbers (T-SLDFNs), different types of score and accuracy functions are defined. On the basis of the T-SLDFWA and T-SLDFWG operators, a multiple attribute decision-making (MADM) method within the framework of T-SLDFNs is designed, and the ranking results are examined by different types of score functions. A numerical example is provided to depict the practicality and ascendancy of the proposed method. Finally, to demonstrate the excellence and accessibility of the proposed method, a comparison analysis with other methods is conducted.



    The following abbreviations are used in this manuscript:

    AF Accuracy Function
    ESF Expected Score Function
    FS Fuzzy Set
    F-grade Falsity-Membership Grade
    Ⅰ-grade Indeterminacy Grade
    IFS Intuitionistic Fuzzy Set
    LDFWG Linear Diophantine Fuzzy Weighted Geometric
    LDFS Linear Diophantine Fuzzy Set
    MADM Multiple Attribute Decision-Making
    PFS Picture Fuzzy Set
    PyFS Pythagorean Fuzzy Set
    q-LDFWA q-Linear Diophantine Fuzzy Weighted Averaging
    q-LDFWG q-Linear Diophantine Fuzzy Weighted Geometric
    q-LDFS q-Rung Linear Diophantine Fuzzy Set
    q-ROFS q-Rung Orthopair Fuzzy Set
    QAF Quadratic Accuracy Function
    QSF Quadratic Score Function
    RPs Reference Parameters
    SF Score Function
    SLDFWA Spherical Linear Diophantine Fuzzy Weighted Averaging
    SLDFWG Spherical Linear Diophantine Fuzzy Weighted Geometric
    SFS Spherical Fuzzy Set
    SLDFS Spherical Linear Diophantine Fuzzy Set
    T-grade Truth-Membership Grade
    T-SFS T-spherical fuzzy set
    T-SLDFHWA T-spherical Linear Diophantine Fuzzy Hybrid Weighted Averaging
    T-SLDFHWG T-spherical Linear Diophantine Fuzzy Hybrid Weighted Geometric
    T-SLDFNs T-spherical Linear Diophantine Fuzzy Numbers
    T-SLDFOWA T-spherical Linear Diophantine Fuzzy-Ordered Weighted Averaging
    T-SLDFOWG T-spherical Linear Diophantine Fuzzy-Ordered Weighted Geometric
    T-SLDFS T-spherical Linear Diophantine Fuzzy Set
    T-SLDFWA T-spherical Linear Diophantine Fuzzy Weighted Averaging
    T-SLDFWG T-spherical Linear Diophantine Fuzzy Weighted Geometric

    The fuzzy set (FS), coined by Zadeh [1], is a pioneering notion that has a great strides on the classical decision-making (DM) theory. It has been successfully utilized to address ambiguous and misleading information in complicated decision-making processes. However, the modeling parameters of FS have been limited to tackling fuzzy and obscure data where two or more sources of uncertainty arise simultaneously. Consequently, many variations and generalizations of FS have been proposed. One of the uttermost significant and acclaimed generalizations is the intuitionistic FS (IFS) [2]. IFS is constructed by a truth-membership grade (T-grade) and falsity-membership grade (F-grade) fulfilling the constraint that their sum is limited to one, which confines the options to the satisfaction and dissatisfaction classes. To eradicate such problem, the principle of the Pythagorean FS (PyFS) has been settled by Yager [3], where the sum of the squares of its T-grade and F-grade is limited to one. Yager [4] again put forward that for some cases, the constraint of the PyFS structure may be violated and thus elaborated the q-rung orthopair FS (q-ROFS) characterized by a T-grade and an F-grade, providing the following condition: The sum of the qth power of the T-grade and F-grade is not exceed one.

    The above-mentioned uncertainty sets have seen a great deal of investigations and applications in real-life [5,6,7,8,9,10]. However, these models have various strict restrictions on their membership grades. To overcome this difficulty, Riaz and Hashmi [11] initiated the new framework of the linear Diophantine fuzzy (LDF) set (LDFS). The LDFS extends IFS and PyFS by assigning reference parameters (RPs) associated to the T-grades and F-grades. This paradigm is the most appropriate structure for DM where the users can freely choose the grades. In this direction, Almagrabi et al. [12] designed the flexible model of q-rung LDFS (q-LDFS), that involves the addition of RPs to the structure of the q-ROFS to make it more effectual and adaptable than other methods. Some aggregation operators have been developed based on LDFSs and q-LDFS [11,12,13,14,15,16,17,18,19,20]. In [11], the authors presented the LDF weighted geometric (LDFWG) operator and proposed a new method for MADM based on LDF topological space and LDFWG operator. Almagrabi et al. [12] defined a series of averaging and geometric aggregation operators under q-LDFS. Riaz et al. presented LDF prioritized weighted (LDFPW) average (LDFPWA) and LDFPW geometric (LDFPWG) operators in [13]. Iampan et al. [14] developed the LDF Einstein weighted averaging (LDFEWA) and LDF Einstein weighted geometric (LDFEWG) operators. Mahmood et al. [15] introduced the interval LDF power Muirhead mean (Ⅳ-LDFMM) and interval LDF weighted power Muirhead mean (Ⅳ-LDFWPMM) operators. Several types of linear Diophantine, uncertain linguistic power Einstein (LDULPE) operator were elaborated in [16], including the LDULPE averaging (LDULPEA) operator, LDULPE weighted averaging (LDULPEWA) operator, LDULPE geometric (LDULPEG) operator and LDULPE weighted geometric (LDULPEWG) operator. Izatmand et al. [17] proposed LD uncertain linguistic generalized Hamacher (LDULGH) averaging and LDULGH hybrid averaging operators. Qiyas et al. [18] proposed some new q-LDFS distances and similarity measures, including Jaccard, exponential, and cosine similarity measures. In the complex space, Ali et al. [19] explained the complex LDULPEA, complex LDULPEWA, complex LDULPEG, and complex LDULPEWG operators. Kamaci [20] introduced the cosine distances and similarity measures among the complex LDFSs. The proposed cosine measures for complex LDFSs are used in medical diagnoses. Differently, Kamaci [21] investigated the theoretical LDFS approaches to algebraic structures, and Ayub et al. [22] formulated the LDF relation and its application in DM. Riaz et al. [23] also developed the LDF rough sets, followed by LDF graph by Prakash et al. [24] and the Dijkstra algorithm to solve an LDF environment by Parimala et al. [25].

    By incorporating the indeterminacy grade (Ⅰ-grade) into the above-mentioned sets consisting of T-grades and F-grades, various versions and generalizations were proposed. Apart from these generalizations, the principle of the picture FS (PFS) is introduced, which has been presented by Cuong [26]. A PFS is expressed by a T-grade (L), an Ⅰ-grade (M) and a F-grade (N) such that 0L+M+N1. Many researchers have created PFS methods and applications in various disciplines based on this idea [27,28,29]. However, it is noticed that this condition of the PFS does not enable us to determine grades for L, M, and N freely. In other words, the domain of a PFS is restricted. Consequently, the novel structure of the spherical FS (SFS) [30,31] is suggested, which gives flexibility to the structure of the PFS by expanding the space of its grades in the interval [0,1] with a constraint 0L2+M2+N21. Further, Mahmood et al. [31] empowered the concept of the SFS, and he developed the framework of T-SFS, including a new constraint 0Lq+Mq+Nq1, provided that qZ and q1. The SFS and T-SFS have diverse applications in decision making problems [32,33,34,35,36,37,38,39,40,41,42,43,44], but they have some strict restrictions for their T-grades, Ⅰ-grades and F-grades. The conditions of SFSs and T-SFSs reveal that their grades are not independent. To eliminate this limitation, Riaz et al. [45] launched the notion of spherical LDFS (SLDFS) under the prominent constraints 0aL+bM+cN1 and 0a+b+c1, such that a, b and c are RPs associated with the T-grade, Ⅰ-grade and F-grade, respectively, and picked from [0,1]. The beauty of this new thought is that all grades can be taken independently from [0,1]. This paper aims to continue investigating SLDFS, T-SFS and their combinations by introducing the novel theory of T-SLDFS and its aggregation operators.

    Zadeh [1] assigned T-grade say L to the crisp set by coining the theory of FSs. Atanassov [2] expanded the notion of FSs to IFSs by adding F-grade N to a T-grade L with a condition 0L+N1. Under some circumstances, the sum of T-grade and F-grade is sometimes greater than 1, for example 0.5+0.61. To handle this situation, Yager [3] come up with a theory of PyFS under condition 0L2+N21. Thus, according to this condition 0.52+0.62=0.25+0.36=0.611. However, in the situation 0.72+0.82=0.49+0.64=1.131, IFS and PyFS are unusable. To remove this limitation, q-ROFS [4] on the basis of PyFS was developed. The main advantage of q-ROFS is that it replaces the constraints of PyFS with requirement 0Lq+Nq1. For this, if we choose q=3, then by using the condition of q-ROFS, we obtain 0.73+0.83=0.343+0.512=0.8551. Nevertheless, in the actual process of solving the DM problem, it may happen that the opinion of the decision-maker does not satisfy the q-ROFS constraint. By way of illustration, if L given by the decision maker is 1 and N is 0.3. It is clearly that pair (1, 0.3) cannot be expressed by q-ROFS since 1q+0.3q1 for any value of q. In this situation, the theories of IFS, PyFS and q-ROFS fail to work when solving DM problems under these circumstances. To model such situations, Riaz and Hashmi [11] introduced LDFS under conditions 0aL+bN1, and 0a+b1. For this, if we choose RPs a=0.1 and b=0.2, then the LDFS technique delivers (0.1)(1)+(0.2)(0.3)=0.161 and 0.1+0.2=0.31. But here again, the sum of the RPs in LDFS is sometimes larger than 1, i.e., a+b1. To remove such restriction, Almagrabi et al. [12] came with q-LDFS, in which 0(a)qL+(b)qN1, and 0(a)q+(b)q1. However, The neutrality is not given consideration in the above mentioned uncertainty models. To keep up with this situation, the notion of PFS [26] was introduced in the form of (L,M,N) under the condition 0L+M+N1. In a PFS, when L,M and N are assigned as 0.5,0.4 and 0.3, respectively, since 0.5+0.4+0.3=1.21, condition 0L+M+N1 does not hold. To manage such a situation, a SFS was proposed by [30,31] as a generalization of the PFS under condition 0L2+M2+N21. Thus, according to this condition 0.52+0.42+0.32=0.51. Thus, SFS extends PFS but only to some range, for example when L,M and N are taken as 0.7,0.6 and 0.8, then even squaring is not enough as 0.72+0.52+0.62=1.11. Therefore, T-SFS [31] is constructed under the restriction 0Lq+Mq+Nq1. For example, in our case when L=0.7,M=0.5 and N=0.6, then for q=3, we have 0.73+0.53+0.63=0.6841. In some particular cases, the PFS, SFS and T-SFS are failed, if a decision maker provides (L,M,N)=(1,0.5,0.3), i.e., 1q+0.5q+0.3q1 for any value of q, the PFS, SFS and T-SFS cannot characterize effectively such kinds of information. To precisely cope with such kind of problems, Riaz et al. [45] established the idea of SLDFS whose restriction is that 0aL+bM+cN1, with 0a+b+c1. Obviously, the SLDFS can present effectively such kinds of information, i.e., 0(0.2)(1)+(0.4)(0.5)+(0.1)(0.3)1, with 00.2+0.4+0.1=0.71, where (a,b,c)=(0.2,0.4,0.1) are RPs associated with the grades L,M and N, respectively. But here again, the sum of RPs provided by decision maker is often larger than one i.e., a+b+c1, which violates the restriction of SLDFS related to RPs. The SLDFS has its own limitations related to the RPs. In order to remove such limitation and motivated by the idea from LDFS to q-LDFS in two-dimensional space, it is necessary to extend SLDF to T-SLDFS in three-dimensional space. In T-SLDFS we introduce the qth power of RP which cover the space of existing structure and cover the space of the membership grades with the help of qth power of RPs. The PFS, SFS, T-SFS and SLDFS all are the special cases of T-SLDFS. For example, in the environment of T-SLDFS, if q=1 and each RP equals 1, then T-SLDFS is converted to PFS. If q=2 and each RP equals 1, then T-SLDFS is converted to SFS. If each RP equals 1 for any q, then T-SLDFS is converted to T-SFS. If q=1 and each RP is freely chosen, then T-SLDFS is converted to SLDFS. From the above discussions, it is clear that the T-SLDFS is more versatile and more superior to PFS, SFS, T-SFS and SLDFS to describe awkward and complication information in real-decision. The advantages of the proposed method and the drawbacks of the existing methods discussed above served as the motivation for this paper. Therefore, the contributions of this paper are shown as follows. Firstly, we establish the notion of the T-SLDFS, which generalizes the theories of the PFS, SFS, T-SFS, and SLDFS. Secondly, we explore the notions of T-SLDFWA and T-SLDFWG operators on the basis of the operational laws of T-SLDFNs. Thirdly, we define several types of SFs and AFs for the ranking process. Fourthly, we solve a MADM problem based on T-SLDFNs by using T-SLDFWA and T-SLDFWG operators. Lastly, a comprehensive comparative analysis and geometrical interpretations are presented to reveal the advantages of the suggested methods. Figure 1 represents the contributions graphically.

    Figure 1.  Graphical representation of the contributions.

    The rest of this manuscript is summarized as follows: In Section 2, we review some background on the IFS, PyFS, LDFS, q-ROFS, qRLDFS, SFS, SLDFS, and T-SFS. Throughout Section 3, we give the definition of the T-SLDFS and study its operations. Several types of SFs and AFs are also introduced in this section. In Section 4, we conceptualize the T-SLDFWA and T-SLDFWG operators and discuss their properties. Section 5 exhibits a MADM method using the proposed operators. In Section 6, We present an illustrative example to show the application of the proposed models. We also analyze the results of the proposed method in this section. Section 7 provides a comprehensive comparative analysis to depict the superiority of the proposed methods.

    This section, briefly provides the preliminary knowledge of the IFS, PyFS, LDFS, q-ROFS, q-LDFS, SFS, SLDFS, and T-SFS, before defining T-SLDFS in the next section.

    Definition 2.1. [2] Suppose a universe D. An IFS B is defined on D as

    B={(t,TB(t),FB(t)):tD},

    where TB and FB[0,1] are, respectively, the T-grade and F-grade, such that 0TB(t)+FB(t)1, tD.

    The IFS fails in situations when the sum of the T-grade and F-grade is larger than 1. Thus, Yager [3] generalized the IFS to PyFS, whose main characteristic is that the square sum of the T-grade and F-grade cannot exceed 1.

    Definition 2.2. [3] A PyFS K in a universe of discourse D is given as

    K={(t,TK(t),FK(t)):tD},

    where TK:D[0,1] denotes the T-grade and FK:D[0,1] denotes the F-grade with the condition that 0(TK(t))2+(FK(t))21.

    Riaz and Hashmi [11] developed the LDFS by combining the grades of RPs with the T-grade and F-grade in the definitions of the IFS and PyFS.

    Definition 2.3. [11] A LDFS BH on the reference set C is defined as

    BH={(s,RH(s),TH(s),a(s),b(s)):sC},

    where RH(s),TH(s),a(s),b(s)[0,1] are, respectively, the T-grade, F-grade and reference parameters. These functions fulfill the constraint 0aRH(s)+bTH(s)1, sC, with 0a+b1.

    Definition 2.4. [11] Let EH=(RH,TH,a,b) be a LDFN on the reference set C and LDFN(C) be the collection of LDFNs on C. Then:

    (1) The score function (SF) is characterized through the transformation L:LDFN(C)[1,1] which formalized as LEH=L(EH)=12[(RHTH)+(ab)].

    (2) The accuracy function (AF) is determined by the transformation M:LDFN(C)[0,1] and defined by MEH=M(EH)=12[RHTH2+(a+b)].

    (3) The quadratic score function (QSF) is a transformation N:LDFN(C)[1,1] which is written as NEH=N(EH)=12[(R2HT2H)+(a2b2)].

    (4) The quadratic accuracy function (QAF) is a transformation O:LDFN(C)[0,1] which is formalized by OEH=O(EH)=12[R2HT2H2+(a2+b2)].

    (5) The expected score function (ESF) determined by P:LDFN(C)[0,1] and defined by PEH=P(EH)=12[(RHTH+1)2+(ab+1)2].

    Definition 2.5. [11] Let EHκ={(κRH,κTH,κa,κb):κ=1,2,...,r} be a assembling of LDFNs on the universe C and τ=(τ1,τ2,...,τr) be the weight vector such that rκ=1τκ=1. Then, the mapping φ:LDFN(C)LDFN(C) is called the LDFWG operator and portrayed as LDFWG (EH1,EH2,...,EHr)=rκ=1EφκHκ=(rκ=1κRφκH,1rκ=1(1κTH)φκ,rκ=1κaφκ,1rκ=1(1κb)φκ).

    The IFS and PFS have been developed also into the q-ROFS [4], which is more adaptable than the IFS and PYFS since the sum of the qth power of the T-grade and F-grade is less than 1.

    Definition 2.6. [4] Let D be a universal set. Then, the q-ROFS R on D is formalized as

    R={(t,TL(t),FL(t)):tD},

    where TL(t) and FL(t)) stand for the T-grade and F-grade, respectively, where TL(t) and FL(t)) lie in [0,1] and 0(TL(t))q+(FL(t))q1 (q1),tD. The refusal part is given as:

    BL(t)=((TL(t))q+(FL(t))q(TL(t))q(FL(t))q)1/q.

    Almagrabi et al. [12] introduced the q-LDFS with the addition of RPs to the construction of the q-ROFS to be more effective and versatile than other approaches.

    Definition 2.7. [12] A q-LDFS QM on the reference U is determined by

    QM={(t,YM(t),XM(t),f,g):tU},

    where YM(t),XM(t),f,g[0,1] are the T-grade, F-grade and RPs, respectively. These grades satisfy the restriction 0(f)qYM(t)+(g)qXM(t)1, tU (q1), with 0(f)q+(g)q1.

    Apart from the above sets, the notion of the SFSs has been introduced by [30,31], which encompasses three membership degrees where the sum of squares of all degrees is less than one.

    Definition 2.8. [30,31] A SFS K on the set Z is characterized by

    K={(h,TK(h),IK(h),FK(h)):hZ},

    where TK(h),IK(h) and FK(h)[0,1] represent, T-grade, Ⅰ-grade and F-grade, respectively, and 0(TK(h))2+(IK(h))2+(FK(h))21, for all hZ. The refusal degree of h to Z is determined by

    BK(h)=(1[(TK(h))2+(IK(h))2+(FK(h))2])1/2.

    Riaz et al. [45] characterized the SLDFS by taking the RPs into account in SFSs.

    Definition 2.9. [45] A SLDFS WD on the reference set Z is defined as

    WD={(ε,LD(ε),MD(ε),ND(ε),a,b,c):εZ},

    such that LD(ε),MD(ε),ND(ε),a,b,c[0,1] are the T-grade, Ⅰ-grade, F-grade and RPs, respectively. These grades satisfy the condition 0aLD(ε)+bMD(ε)+cND(ε)1, εZ, with 0a+b+c1.

    Mahmood et al. [31] extended the SFSs to the T-SFSs, where there are no restrictions on their constraints.

    Definition 2.10. [31] A T-SFS L on the finite set Q is portrayed as follows.

    L={(a,TL(a),IL(a),FL(a)):aQ},

    where TL(a),IL(a) and FL(a)[0,1] are T-grade, Ⅰ-grade, F-grade, respectively, and 0(TL(a))q+(IL(a))q+(FL(a))q1 (q1),aQ. The refusal part is determined by

    BL(a)=(1[(TL(a))q+(IL(a))q+(FL(a))q])1/q.

    In this paper, we formalize the T-SLDFS by combining the grades of RPs to the T-grade, Ⅰ-grade, and F-grade in the constructions of TSFS.

    In this section, we propose the concept of T-SLDFS, SFs and AFs of T-SLDFNs and some operations on T-SLDFS.

    Definition 3.1. Let X be a fixed non-empty reference set. The T-SLDFS SΛ over X can be defined as

    SΛ={(t,TΛ(t),IΛ(t),FΛ(t),μ(t),ν(t),ω(t)):tX},

    where TΛ(t),IΛ(t),FΛ(t)[0,1] denote respectively, the reality grades, abstinence grades and falsity grades. μ(t),ν(t),ω(t)[0,1] are RPs associated with the grades TΛ(t),IΛ(t) and FΛ(t), respectively, and they satisfy the following conditions:

    0μq(t)TΛ(t)+νq(t)IΛ(t)+ωq(t)FΛ(t)1,tX, q1,with
    0μq(t)+νq(t)+ωq(t)1. The refusal part is given by
    θMΛ=(1(μq(t)TΛ(t)+νq(t)IΛ(t)+ωq(t)FΛ(t)))1q,

    where θ represents the RP associated with the refusal degree.

    Definition 3.2. A collection of Ω=(TΛ,IΛ,FΛ,μ,ν,ω) is called T-SLDFN with

    0μqTΛ+νqIΛ+ωqFΛ1 and 0μq+νq+ωq1, (q1).

    Remark 3.3. In the above definition,

    (1) If q=1, then the T-SLDFN is reduced to SLDFN.

    (2) If IΛ=ν=0, then the T-SLDFN is reduced to q-LDFN.

    Remark 3.4. (1) Any PFS is an SLDFS and any SLDFS is a T-SLDFS for q=1, but the converse is not true.

    (2) Any SFS is a SLDFS and any SLDFS is a T-SLDFS for q=1, but the converse is not true.

    Now we put forward the definition of absolute T-SLDFS and the definition of null T-SLDFS.

    Definition 3.5. Let SΛ={(t,TΛ(t),IΛ(t),FΛ(t),μ(t),ν(t),ω(t)):tX} be a T-SLDFS over X. Then, SΛ is said to be an absolute T-SLDFS denoted by ˜Ψ if TΛ(t)=μ(t)=1 and FΛ(t)=IΛ(t)=ν(t)=ω(t)=0, tX, i.e., ˜Ψ=(1,0,0,1,0,0).

    Definition 3.6. Let SΛ={(t,TΛ(t),IΛ(t),FΛ(t),μ(t),ν(t),ω(t)):tX} be a T-SLDFS over X. Then, SΛ is said to be a null T-SLDFS denoted by ˜Φ if TΛ(t)=μ(t)=0 and FΛ(t)=IΛ(t)=ν(t)=ω(t)=1, tX, i.e., ˜Φ=(0,1,1,0,1,1).

    In this section, we define the SF, QSF, ESF, AF, and QAF.

    Definition 3.1.1. Let Ω=(TΛ,IΛ,FΛ,μ,ν,ω) be a T-SLDFN; then the SF on Ω is determined by the transformation κ:TSLDFN(X)[1,1] and defined as

    κΩ=κ(Ω)=12[(TΛIΛFΛ)+(μqνqωq)],q1,

    where TSLDFN(X) is the collection of T-SLDFNs on the reference set X.

    Definition 3.1.2. The AF ξ is determined by the transformation ξ:TSLDFN(X)[0,1] and defined as

    ξΩ=ξ(Ω)=12[(TΛ+IΛ+FΛ)3+(μq+νq+ωq)],q1,

    where TSLDFN(X) is the collection of T-SLDFNs on the reference set X.

    Definition 3.1.3. Let Ω1 and Ω2 be two T-SLDFNs. By using Definitions 3.1.1 and 3.1.2, we can compare the T-SLDFNs Ω1 and Ω2 as follows.

    (1) If κΩ1<κΩ2, then Ω1<Ω2.

    (2) If κΩ1>κΩ2, then Ω1>Ω2.

    (3) If κΩ1=κΩ2, and ξΩ1<ξΩ2, then Ω1<Ω2.

    (4) If κΩ1=κΩ2, and ξΩ1>ξΩ2, then Ω1>Ω2.

    (5) If κΩ1=κΩ2, and ξΩ1=ξΩ2, then Ω1 = Ω2.

    The next definition is QSF.

    Definition 3.1.4. The mapping π:TSLDFN(X)[1,1] represents the QSF for the T-SLDFN Ω, which can be given as

    πΩ=π(Ω)=12[(T2ΛI2ΛF2Λ)+((μq)2(νq)2(ωq)2)],q1.

    Definition 3.1.5. The mapping Φ:TSLDFN(X)[0,1] represents the QAF for the T-SLDFN Ω, which can be given as

    ΦΩ=Φ(Ω)=12[(T2Λ+I2Λ+F2Λ)3+((μq)2+(νq)2+(ωq)2)],q1.

    The QSF and QAF are used to compare the T-SLDFNs as follows.

    Definition 3.1.6. If Ω1 and Ω2 are two T-SLDFNs. By using Definitions 3.1.4 and 3.1.5, we can compare the T-SLDFNs Ω1 and Ω2 as follows.

    (1) If πΩ1<πΩ2, then Ω1<Ω2.

    (2) If πΩ1>πΩ2, then Ω1>Ω2.

    (3) If πΩ1=πΩ2, and ΦΩ1<ΦΩ2, then Ω1<Ω2.

    (4) If πΩ1=πΩ2, and ΦΩ1>ΦΩ2, then Ω1>Ω2.

    (5) If πΩ1=πΩ2, and ΦΩ1=ΦΩ2, then Ω1 = Ω2.

    In the following, we present a generalized form of the SF called the ESF.

    Definition 3.1.7. Let Ω=(TΛ,IΛ,FΛ,μ,ν,ω) be a T-SLDFN; then, a ESF on Ω is determined by the transformation Γ:TSLDFN(X)[0,1] and defined as

    ΓΩ=Γ(Ω)=13[(TΛIΛFΛ+2)2+(μqνqωq+2)2],q1.

    In this part, we provide some operations on T-SLDFNs.

    Definition 3.2.1. Let Ω1=(1TΛ,1IΛ,1FΛ,1μ,1ν,1ω) and Ω2=(2TΛ,2IΛ,2FΛ,2μ,2ν,2ω) be two T-SLDFNs over X and λ>0; then,

    (1) Ωc1=(1FΛ,11IΛ,1TΛ,1ω,11ν,1μ),

    (2) Ω1=Ω2 1TΛ=2TΛ,1IΛ=2IΛ,1FΛ=2FΛ,1μ=2μ,1ν=2ν,1ω=2ω,

    (3) Ω1Ω2 1TΛ2TΛ,1IΛ2IΛ,1FΛ2FΛ,1μ2μ,1ν2ν,1ω2ω,

    (4) Ω1Ω2=(max(1TΛ,2TΛ),min(1IΛ,2IΛ),min(1FΛ,2FΛ),max(1μΛ,2μΛ),min(1νΛ,2νΛ), min(1ωΛ,2ωΛ)),

    (5) Ω1Ω2=(min(1TΛ,2TΛ),max(1IΛ,2IΛ),max(1FΛ,2FΛ),min(1μΛ,2μΛ),max(1νΛ,2νΛ), max(1ωΛ,2ωΛ)),

    (6) Ω1Ω2=(((1TΛ)q+(2TΛ)q(1TΛ)q(2TΛ)q)1q,(1IΛ 2IΛ),(1FΛ 2FΛ),((1μ)q+(2μ)q (1μ)q(2μ)q)1q,( 1ν 2ν),( 1ω 2ω)),q1,

    (7) Ω1Ω2=((1TΛ 2TΛ),((1IΛ)q+(2IΛ)q(1IΛ)q(2IΛ)q)1q,((1FΛ)q+(2FΛ)q(1FΛ)q(2FΛ)q)1q,(1μ 2μ),((1ν)q+(2ν)q (1ν)q(2ν)q)1q,((1ω)q+(2ω)q (1ω)q(2ω)q)1q),q1,

    (8) λΩ1=((1(1(1TΛ)q)λ)1q,(1IΛ)λ,(1FΛ)λ,(1(1(1μq))λ)1q,(1νλ),(1ωλ)) λ>0,q1,

    (9) Ωλ1=((1TΛ)λ,(1(1(1IΛ)q)λ)1q,(1(1(1FΛ)q)λ)1q,,(1μλ),(1(1(1νq))λ)1q,(1(1(1ωq))λ)1q,), λ>0,q1.

    Remark 3.2.2. If 1IΛ=2IΛ=1ν=2ν=0, then all operations in Definition 3.2.1 reduce to the operations of q-LDFNs.

    Proposition 3.2.3. Let Ωδ=(δTΛ,δIΛ,δFΛ,δμ,δν,δω) for δΔ (indexing Set) be a collection of T-SLDFNs over X and λ>0. Then, δΔΩδ,δΔΩδ,ΩCδ,δΔΩδ,δΔΩδ,Ωλδ and λΩ are also T-SLDFNs.

    Proof. The proof is accomplished using Definition 3.2.1.

    Example 3.2.4. If Ω1=(0.6,0.82,0.4,0.1,0.42,0.55) and Ω2=(0.96,0.78,0.1,0.6,0.3,0.43) be two 3-SLDFNs. If λ=5, then

    (1) ΩC1=(0.4,0.18,0.6,0.55,0.58,0.1),

    (2) Ω1Ω2 as 0.60.96,0.820.78,0.40.1 and 0.10.6,0.420.3,0.550.43,

    (3) Ω1Ω2=(0.96,0.78,0.1,0.6,0.3,0.43)=Ω2,

    (4) Ω1Ω2=(0.6,0.82,0.4,0.1,0.42,0.55)=Ω1,

    (5) Ω1Ω2=(0.97,0.64,0.04,0.6,0.13,0.24),

    (6) Ω1Ω2=(0.58,0.91,0.4,0.06,0.46,0.62),

    (7) λΩ1=(0.89,0.37,0.01,0.17,0.01,0.05),

    (8) Ωλ1=(0.078,0.99,0.66,0,0.68,0.84).

    Proposition 3.2.5. Let Ω1,Ω2 and Ω3 be three T-SLDFNs. Then, the following properties hold.

    (1) Ω1Ω2=Ω2Ω1,

    (2) Ω1Ω2=Ω2Ω1,

    (3) Ω1(Ω2Ω3)=(Ω1Ω2)(Ω1Ω3),

    (4) Ω1(Ω2Ω3)=(Ω1Ω2)(Ω1Ω3),

    (5) (Ω1Ω2)c=Ωc1Ωc2,

    (6) (Ω1Ω2)c=Ωc1Ωc2,

    (7) Ω1Ω2=Ω2Ω1,

    (8) Ω1Ω2=Ω2Ω1,

    (9) λ(Ω1Ω2)=λΩ1λΩ2,

    (10) (Ω1Ω2)λ=Ωλ1Ωλ2.

    Proof. We just give the proof of (5), (7) and (9), as the proof of the other items is trivial.

    (5). According to (1) and (4) in Definition 3.2.1, we can obtain, for the left side of the equation,

    (Ω1Ω2)c=(min(1FΛ,2FΛ),1min(1IΛ,2IΛ),max(1TΛ,2TΛ),min(1ωΛ,2ωΛ),1min(1νΛ,2νΛ), max(1μΛ,2μΛ)).

    For the right-hand side, consider

    Ωc1=(1FΛ,11IΛ,1TΛ,1ω,11ν,1μ), Ωc2=(2FΛ,12IΛ,2TΛ,2ω,12ν,2μ), then

    Ωc1Ωc2=(min(1FΛ,2FΛ),max(11IΛ,12IΛ),max(1TΛ,2TΛ),min(1ωΛ,2ωΛ),max(11νΛ,12νΛ), max(1μΛ,2μΛ)) =(min(1FΛ,2FΛ),1min(1IΛ,2IΛ),max(1TΛ,2TΛ),min(1ωΛ,2ωΛ),1min(1νΛ,2νΛ), max(1μΛ,2μΛ))=(Ω1Ω2)c. This gives (5). (7). Based on Definition 3.2.1,

    Ω1Ω2=(((1TΛ)q+(2TΛ)q(1TΛ)q(2TΛ)q)1q,(1IΛ 2IΛ),(1FΛ 2FΛ),((1μ)q+(2μ)q (1μ)q(2μ)q)1q,( 1ν 2ν),( 1ω 2ω)),q1, =(((2TΛ)q+(1TΛ)q(2TΛ)q(1TΛ)q)1q,(2IΛ 1IΛ),(2FΛ 1FΛ),((2μ)q+(1μ)q (2μ)q(1μ)q)1q,( 2ν 1ν),( 2ω 1ω)),q1, =Ω2Ω1. This gives (7).

    (9). According to (6) and (8) in Definition 3.2.1, we can obtain, for the left side of the equation:

    λ(Ω1Ω2)=λ((((1TΛ)q+(2TΛ)q(1TΛ)q(2TΛ)q)1q,(1IΛ 2IΛ),(1FΛ 2FΛ),((1μ)q+(2μ)q (1μ)q(2μ)q)1q,( 1ν 2ν),( 1ω 2ω))),q1,

    =((1[1((1TΛ)q+(2TΛ)q(1TΛ)q(2TΛ)q)]λ)1q,(1I2ΛIΛ)λ,(1F2ΛFΛ)λ,(1[1((1μΛ)q+(2μΛ)q(1μΛ)q(2μΛ)q)]λ)1q,(1ν2ΛνΛ)λ,(1ω2ΛωΛ)λ),

    =[(1(11TqΛ)λ(12TqΛ)λ)1q,(1IΛ)λ(2IΛ)λ,(1FΛ)λ(2FΛ)λ,(1(11μq)λ(12μq)λ)1q,(1ν)λ(2ν)λ,(1ω)λ(2ω)λ]. For the right side of the equation, we have

    λΩ1=((1(1(1TΛ)q)λ)1q,(1IΛ)λ,(1FΛ)λ,(1(1(1μ)q)λ)1q,(1ν)λ,(1ω)λ) λ>0,q1, λΩ2=((1(1(2TΛ)q)λ)1q,(2IΛ)λ,(2FΛ)λ,(1(1(2μ)q)λ)1q,(2ν)λ,(2ω)λ) λ>0,q1; moreover, since

    λΩ1λΩ2=[(1(11TqΛ)λ+1(12TqΛ)λ[1(11TqΛ)λ][1(12TqΛ)λ])1q,(1IΛ)λ(2IΛ)λ,(1FΛ)λ(2FΛ)λ,(1(11μq)λ+1(12μq)λ[1(11μq)λ][1(12μq)λ])1q,(1ν)λ(2ν)λ,(1ω)λ(2ω)λ],

    =[(1(11TqΛ)λ(12TqΛ)λ)1q,(1IΛ)λ(2IΛ)λ,(1FΛ)λ(2FΛ)λ,(1(11μq)λ(12μq)λ)1q,(1ν)λ(2ν)λ,(1ω)λ(2ω)λ]. Thus, we have λ(Ω1Ω2)=λΩ1λΩ2.

    This section explores the notions of T-SLDFWA and T-SLDFWG operators on the basis of operational laws of T-SLDFNs.

    In this section, we define the T-SLDFWA perator, T-SLDFOWA operator, and T-SLDFHWA operator.

    Definition 4.1.1. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a collection of T-SLDFNs. The T-SLDFWA operator is a transformation T-SLDFWA: T-SLDFN(X) T-SLDFN(X), defined by

    TSLDFWA(Ω1,Ω2,...,Ωn)=φ1Ω1φ2Ω2...φnΩn,

    where φ=(φ1,φ2,...,φn) is the weight vector of Ωδ(δ=1,2,...,n), 0φδ1 and nδ=1φδ=1.

    Theorem 4.1.2. Suppose that Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} is the collection of T-SLDFNs. Let us consider the weight vector φ=(φ1,φ2,...,φn) of Ωδ. Then,

    TSLDFWA(Ω1,Ω2,...,Ωn)=(1nδ=1(1δTqΛ)φδ)1q,nδ=1(δIΛ)φδ,nδ=1(δFΛ)φδ,(1nδ=1(1δμq)φδ)1q,nδ=1(δν)φδ,nδ=1(δω)φδ,q1. (1)

    Proof. We will use the mathematical induction method to prove this theorem.

    (1) For n=2, since φ1Ω1=((1(1(1TΛ)q)φ1)1q,(1IΛ)φ1,(1FΛ)φ1,(1(1(1μq))φ1)1q,(1νφ1),(1ωφ1)), φ2Ω2=((1(1(2TΛ)q)φ2)1q,(2IΛ)φ2,(2FΛ)φ2,(1(1(2μq))φ2)1q,(2νφ2),(2ωφ2)),

    T-SLDFWA(Ω1,Ω2)=φ1Ω1φ2Ω2=[(1(11TqΛ)φ1+1(12TqΛ)φ2[1(11TqΛ)φ1][1(12TqΛ)φ2])1q,(1IΛ)φ1(2IΛ)φ2,(1FΛ)φ1(2FΛ)φ2,(1(11μq)φ1+1(12μq)φ2[1(11μq)φ1][1(12μq)φ2])1q,(1ν)φ1(2ν)φ2,(1ω)φ1(2ω)φ2]

    =[(1(11TqΛ)φ1(12TqΛ)φ2)1q,(1IΛ)φ1(2IΛ)φ2,(1FΛ)φ1(2FΛ)φ2,(1(11μq)φ1(12μq)φ2)1q,(1ν)φ1(2ν)φ2,(1ω)φ1(2ω)φ2]

    =[(12δ=1(1δTqΛ)φδ)1q,2δ=1(δIΛ)φδ,2δ=1(δFΛ)φδ,(12δ=1(1δμq)φδ)1q,2δ=1(δν)φδ,2δ=1(δω)φδ]; obviously, Eq (1) holds for n=2.

    (2) If Eq (1) holds for K=n, then

    TSLDFWA(Ω1,Ω2,...,Ωn)=(1nδ=1(1δTqΛ)φδ)1q,nδ=1(δIΛ)φδ,nδ=1(δFΛ)φδ,(1nδ=1(1δμq)φδ)1q,nδ=1(δν)φδ,nδ=1(δω)φδ,q1.

    When δ=n+1, and according to the operational laws of the T-SLDFNs, we have

    TSLDFWA(Ω1,Ω2,...,Ωn+1)=TSLDFWA(Ω1,Ω2,...,Ωn)φn+1Ωn+1

    =[(1nδ=1(1δTqΛ)φδ)1q,nδ=1(δIΛ)φδ,nδ=1(δFΛ)φδ,(1nδ=1(1δμq)φδ)1q,nδ=1(δν)φδ,nδ=1(δω)φδ][(1(1(n+1TΛ)q)φn+1)1q,(n+1IΛ)φn+1,(n+1FΛ)φn+1,(1(1(n+1μ)q)φn+1)1q,(n+1ν)φn+1,(n+1ω)φn+1],

    =[((1nδ=1(1δTqΛ)φδ)+(1(1n+1TqΛ)φn+1)(1nδ=1(1δTqΛ)φδ)(1(1n+1TqΛ)φn+1))1q,(nδ=1(δIΛ)φδ)(n+1Iφn+1Λ),(nδ=1(δFΛ)φδ)(n+1Fφn+1Λ),((1nδ=1(1δμq)φδ)+(1(1n+1μq)φn+1)(1nδ=1(1δμq)φδ)(1(1n+1μq)φn+1))1q,(nδ=1(δν)φδ)(n+1νφn+1),(nδ=1(δω)φδ)(n+1ωφn+1)], for δ=1,2,...,n.

    =[(1nδ=1(1δTqΛ)φδ(1n+1TqΛ)φn+1)1q,n+1δ=1(δIΛ)φδ,n+1δ=1(δFΛ)φδ,(1nδ=1(1δμq)φδ(1n+1μq)φn+1)1q,n+1δ=1(δν)φδ,n+1δ=1(δω)φδ]

    =[(1n+1δ=1(1δTqΛ)φδ)1q,n+1δ=1(δIΛ)φδ,n+1δ=1(δFΛ)φδ,(1n+1δ=1(1δμq)φδ)1q,n+1δ=1(δν)φδ,n+1δ=1(δω)φδ], k=1,2,...,n+1. That is, Eq (1) holds for k=n+1. Based on steps (1) and (2), we have that Eq~(1) holds for any k.

    The following are the properties of the T-SLDFWA operator.

    (1) Idempotency

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ωδ=Ω=(TΛ,IΛ,FΛ,μ,ν,ω), δ=1,...,n. Then, TSLDFWA(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω).

    (2) Boundedness

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ω=(TΛ,I+Λ,F+Λ,μ,ν+,ω+) and Ω+=(T+Λ,IΛ,FΛ,μ+,ν,ω), where, TΛ=minδ{δTΛ}, I+Λ=maxδ{δIΛ}, F+Λ=maxδ{δFΛ}, μ=minδ{δμ}, ν+=maxδ{δν}, ω+=maxδ{δω} and T+Λ=maxδ{δTΛ}, IΛ=minδ{δIΛ}, FΛ=minδ{δFΛ}, μ+=maxδ{δμ}, ν=minδ{δν}, ω=minδ{δω}. Then, ΩTSLDFWA(Ω1,Ω2,...,Ωn)Ω+.

    (3) Monotonicity

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} and Ωδ={(δTΛ,δIΛ,δFΛ, δμ,δν,δω):δ=1,...,n} be two collections of T-SLDFNs. If δTΛ δTΛ, δIΛ δIΛ, δFΛ δFΛ and δμ δμ, δν δν, δω δω δ=1,...,n. Then, TSLDFWA(Ω1,Ω2,...,Ωn)TSLDFWA(Ω1,Ω2,...,Ωn).

    Proof.

    (1) According to Theorem 4.1.2, since Ωδ=Ω=(TΛ,IΛ,FΛ,μ,ν,ω) δ=1,...,n, then,

    TSLDFWA(Ω1,Ω2,...,Ωn)=(1nδ=1(1TqΛ)φδ)1q,nδ=1(IΛ)φδ,nδ=1(FΛ)φδ,(1nδ=1(1μq)φδ)1q,nδ=1(ν)φδ,nδ=1(ω)φδ

    =(1(1TqΛ)nδ=1φδ)1q,(IΛ)nδ=1φδ,(FΛ)nδ=1φδ,(1(1μq)nδ=1φδ)1q,(ν)nδ=1φδ,(ω)nδ=1φδ

    =(1(1TqΛ))1q,IΛ,FΛ,(1(1μq))1q,ν,ω

    =(TΛ,IΛ,FΛ,μ,ν,ω)=Ω.

    (2) For q1, since TΛ δTΛT+Λ, then

    (TΛ)q δTqΛ(T+Λ)q, 1(TΛ)q 1 δTqΛ1(T+Λ)q, (1(TΛ)q)φδ (1 δTqΛ)φδ(1(T+Λ)q)φδ, nδ=1(1(TΛ)q)φδ nδ=1(1 δTqΛ)φδnδ=1(1(T+Λ)q)φδ, 1nδ=1(1(TΛ)q)φδ 1nδ=1(1 δTqΛ)φδ1nδ=1(1(T+Λ)q)φδ, (1nδ=1(1(TΛ)q)φδ)1q (1nδ=1(1 δTqΛ)φδ)1q(1nδ=1(1(T+Λ)q)φδ)1q. Thus, TΛ (1nδ=1(1 δTqΛ)φδ)1qT+Λ. Similarly, as μδμμ+, we have μ(1nδ=1(1μq)φδ)1qμ+, As IΛ δIΛI+Λ, then (IΛ)φδ(δIΛ)φδ(I+Λ)φδ, nδ=1(IΛ)φδnδ=1(δIΛ)φδnδ=1(I+Λ)φδ. Thus, IΛnδ=1(δIΛ)φδI+Λ.

    In the same way, as FΛ δFΛF+Λ, νΛ δνΛν+Λ and ωΛ δωΛω+Λ, we obtain FΛnδ=1(δFΛ)φδF+Λ, νΛnδ=1(δνΛ)φδν+Λ and ωΛnδ=1(δωΛ)φδω+Λ.

    Now, let TSLDFWA(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω). Then,

    κ(Ω)=12[(TΛIΛFΛ)+(μqνqωq)]12[(TΛI+ΛF+Λ)+((μ)q(ν+)q(ω+)q)]=κ(Ω) and κ(Ω)=12[(TΛIΛFΛ)+(μqνqωq)]12[(T+ΛIΛFΛ)+((μ+)q(ν)q(ω)q)]=κ(Ω+). This implies ΩTSLDFWA(Ω1,Ω2,...,Ωn)Ω+.

    (3) Since δTΛ δTΛ, δ=1,2,...,n. Then,

    δTqΛ(δTΛ)q, 1 δTqΛ1(δTΛ)q, (1 δTqΛ)φδ(1(δTΛ)q)φδ,nδ=1(1 δTqΛ)φδnδ=1(1(δTΛ)q)φδ, 1nδ=1(1 δTqΛ)φδ 1nδ=1(1(δTΛ)q)φδ, (1nδ=1(1 δTqΛ)φδ)1q (1nδ=1(1(δTΛ)q)φδ)1q. Similarly, as δμ δμ, δ=1,2,...,n, we have (1nδ=1(1 δμqΛ)φδ)1q (1nδ=1(1(δμΛ)q)φδ)1q.

    As δIΛ δIΛ, δ=1,2,...,n. Then, (δIΛ)φδ (δIΛ)φδ, nδ=1(δIΛ)φδ nδ=1(δIΛ)φδ. In the same way as δFΛ δFΛ, δνΛ δνΛ, δωΛ δωΛ, we obtain nδ=1(δFΛ)φδ nδ=1(δFΛ)φδ, nδ=1(δνΛ)φδ nδ=1(δνΛ)φδ and nδ=1(δωΛ)φδ nδ=1(δωΛ)φδ.

    Let TSLDFWA(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω) and TSLDFWA(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω). Then,

    κ(Ω)=12[(TΛIΛFΛ)+(μqνqωq)]12[(TΛIΛFΛ)+((μ)q(ν)q(ω)q)]=κ(Ω). This implies TSLDFWA(Ω1,Ω2,...,Ωn)TSLDFWA(Ω1,Ω2,...,Ωn).

    In this part, we define the T-SLDFOWA operator.

    Definition 4.1.3. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a collection of T-SLDFNs on the fixed set X and the weight vector φ=(φ1,φ2,...,φn) such that φδ0 (δN) with nδ=1φδ=1 and q1; then, the mapping TSLDFOWA:TSLDFN(X)TSLDFN(X) is called the T-SLDFOWA operator and defined as

    TSLDFOWA(Ω1,Ω2,...,Ωn)=nδ=1(φδΩδ(ε))=(1nδ=1(1δTqΛ(ε))φδ)1q,nδ=1(δIΛ(ε))φδ,nδ=1(δFΛ(ε))φδ,(1nδ=1(1δμq(ε))φδ)1q,nδ=1(δν(ε))φδ,nδ=1(δω(ε))φδ,q1, (2)

    where ε(1),ε(2),...,ε(n) is the arrangement of (δN), for which Ωε(δ1)Ωε(δ),  (δN).

    Here, we examine the traits of the T-SLDFOWA operator.

    (1) Idempotency : If Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} is a set of T-SLDFNs and Ωδ=Ω=(TΛ,IΛ,FΛ,μ,ν,ω), δN. Then, TSLDFOWA(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω).

    (2) Boundedness: Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ω=(TΛ,I+Λ,F+Λ,μ,ν+,ω+) and Ω+=(T+Λ,IΛ,FΛ,μ+,ν,ω), where, TΛ=minδ{δTΛ}, I+Λ=maxδ{δIΛ}, F+Λ=maxδ{δFΛ}, μ=minδ{δμ}, ν+=maxδ{δν}, ω+=maxδ{δω} and T+Λ=maxδ{δTΛ}, IΛ=minδ{δIΛ}, FΛ=minδ{δFΛ}, μ+=maxδ{δμ}, ν=minδ{δν}, ω=minδ{δω}. Then, ΩTSLDFOWA(Ω1,Ω2,...,Ωn)Ω+.

    (3) Monotonicity: Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} and Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δN} be two collections of T-SLDFNs. If δTΛ δTΛ, δIΛ δIΛ, δFΛ δFΛ and δμ δμ, δν δν, δω δω, δN. Then, TSLDFOWA(Ω1,Ω2,...,Ωn)TSLDFOWA(Ω1,Ω2,...,Ωn).

    Next, we define the T-SLDFHWA operator.

    Definition 4.1.4. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be the collection of T-SLDFNs on the reference set X and the weight vector φ=(φ1,φ2,...,φn) such that φδ0 (δN) with nδ=1φδ=1 and q1; then the mapping TSLDFHWA:TSLDFN(X)TSLDFN(X) is called the T-SLDFHWA operator and defined as

    TSLDFHWA(Ω1,Ω2,...,Ωn)=nδ=1(φδΩε(δ))=(1nδ=1(1 ε(δ)TqΛ)φδ)1q,nδ=1(ε(δ)IΛ)φδ,nδ=1(ε(δ)FΛ)φδ,(1nδ=1(1ε(δ)μq)φδ)1q,nδ=1(ε(δ)ν)φδ,nδ=1(ε(δ)ω)φδ,q1, (3)

    where Ωε(δ) represents the δth biggest weighted T-spherical linear Diophantine fuzzy values Ωδ(Ωδ=(Ωδ)nφδ,δN) and φ=(φ1,φ2,...,φn) is the weight vector by mean of φδ0 (δN) with nδ=1φδ=1.

    If φ=(1φ,1φ,...,1φ), then T-SLDFWA and T-SLDFOWA operators are considered to be specific cases of T-SLDFHWA. Thus, we conclude that the generalized form of T-SLDFWA and T-SLDFOWA operators is the T-SLDFHWA operator.

    We next discuss the properties of the T-SLDFHWA operator.

    (1) Idempotency : If Ωδ is a set of T-SLDFNs and Ωδ=Ω=(TΛ,IΛ,FΛ,μ,ν,ω), δN. Then, TSLDFHWA(Ω1,Ω2,...,Ωn)=Ω.

    (2) Boundedness: Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ω=(TΛ,I+Λ,F+Λ,μ,ν+,ω+) and Ω+=(T+Λ,IΛ,FΛ,μ+,ν,ω), where, TΛ=minδ{δTΛ}, I+Λ=maxδ{δIΛ}, F+Λ=maxδ{δFΛ}, μ=minδ{δμ}, ν+=maxδ{δν}, ω+=maxδ{δω} and T+Λ=maxδ{δTΛ}, IΛ=minδ{δIΛ}, FΛ=minδ{δFΛ}, μ+=maxδ{δμ}, ν=minδ{δν}, ω=minδ{δω}. Then, ΩTSLDFHWA(Ω1,Ω2,...,Ωn)Ω+.

    (3) Monotonicity: Let Ωδand Ωδ be two collections of T-SLDFNs. If Ωδ Ωδ, δN. Then, TSLDFHWA(Ω1,Ω2,...,Ωn)TSLDFHWA(Ω1,Ω2,...,Ωn).

    We define the T-SLDFWG operator, T-SLDFOWG operator, and T-SLDFHWG operator as follows.

    Definition 4.2.1. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a collection of T-SLDFNs. The T-SLDFWG operator is a transformation T-SLDFWG: T-SLDFN(X) T-SLDFN(X), defined by

    TSLDFWG(Ω1,Ω2,...,Ωn)=Ωφ11Ωφ22...Ωφnn,

    where φ=(φ1,φ2,...,φn) is the weight vector of Ωδ(δ=1,2,...,n), 0φδ1 and nδ=1φδ=1.

    Theorem 4.2.2. Suppose that Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} is the collection of T-SLDFNs. Let us consider the weight vector φ=(φ1,φ2,...,φn) of Ωδ. Then,

    TSLDFWG(Ω1,Ω2,...,Ωn)=nδ=1(δTΛ)φδ,(1nδ=1(1δIqΛ)φδ)1q,(1nδ=1(1δFqΛ)φδ)1q,nδ=1(δμ)φδ,(1nδ=1(1δνq)φδ)1q,(1nδ=1(1δωq)φδ)1q,,q1. (4)

    Proof. The proof is like that of Theorem 4.1.2.

    Similar to T-SLDFWA operator, the T-SLDFWG operator also possess the certain characteristics which are stated (without proof) as follows.

    (1) Idempotency

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ωδ=Ω=(TΛ,IΛ,FΛ,μ,ν,ω), δ=1,...,n. Then, TSLDFWG(Ω1,Ω2,...,Ωn)=Ω=(TΛ,IΛ,FΛ,μ,ν,ω).

    (2) Boundedness

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be a set of T-SLDFNs. If Ω=(TΛ,I+Λ,F+Λ,μ,ν+,ω+) and Ω+=(T+Λ,IΛ,FΛ,μ+,ν,ω), where, TΛ=minδ{δTΛ}, I+Λ=maxδ{δIΛ}, F+Λ=maxδ{δFΛ}, μ=minδ{δμ}, ν+=maxδ{δν}, ω+=maxδ{δω} and T+Λ=maxδ{δTΛ}, IΛ=minδ{δIΛ}, FΛ=minδ{δFΛ}, μ+=maxδ{δμ}, ν=minδ{δν}, ω=minδ{δω}. Then, ΩTSLDFWG(Ω1,Ω2,...,Ωn)Ω+.

    (2) Monotonicity

    Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} and Ωδ={(δTΛ,δIΛ,δFΛ, δμ,δν,δω):δ=1,...,n} be two collections of T-SLDFNs. If δTΛ δTΛ, δIΛ δIΛ, δFΛ δFΛ and δμ δμ, δν δν, δω δω δ=1,...,n. Then, TSLDFWG(Ω1,Ω2,...,Ωn)TSLDFWG(Ω1,Ω2,...,Ωn).

    Now, we define the T-SLDFOWG operator.

    Definition 4.2.3. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be the collection of T-SLDFNs on the reference set X and the weight vector φ=(φ1,φ2,...,φn) such that φδ0 (δN) with nδ=1φδ=1 and q1; then, the mapping TSLDFOWG:TSLDFN(X)TSLDFN(X) is called the T-SLDFOWG operator and defined as

    TSLDFOWG(Ω1,Ω2,...,Ωn)=nδ=1Ωφδδ(ε)=nδ=1(δTΛ(ε))φδ,(1 nδ=1(1 δIqΛ(ε))φδ)1q,(1 nδ=1(1 δFqΛ(ε))φδ)1q,nδ=1(δμ(ε))φδ,(1 nδ=1(1δνq(ε))φδ)1q,(1 nδ=1(1 δωq(ε))φδ)1q,,q1, (5)

    where ε(1),ε(2),...,ε(n) is the arrangement of (δN), for which Ωε(δ1)Ωε(δ),  (δN).

    Remark 4.2.4. The T-SLDFOWG operator satisfies the similar properties as those of T-SLDFOWA operator.

    The following is the definition of the T-SLDFHWG operator.

    Definition 4.2.5. Let Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω):δ=1,...,n} be the collection of T-SLDFNs on the reference set X and the weight vector φ=(φ1,φ2,...,φn) such that φδ0 (δN) with nδ=1φδ=1 and q1; then, the mapping TSLDFHWG:TSLDFN(X)TSLDFN(X) is called the T-SLDFHWG operator and defined as

    TSLDFHWG(Ω1,Ω2,...,Ωn)=nδ=1Ωφδε(δ)=nδ=1(ε(δ)TΛ)φδ,(1nδ=1(1 ε(δ)IqΛ)φδ)1q,(1nδ=1(1 ε(δ)FqΛ)φδ)1q,nδ=1(ε(δ)μ)φδ,(1nδ=1(1ε(δ)νq)φδ)1q,(1nδ=1(1 ε(δ)ωq)φδ)1q,,q1, (6)

    where Ωε(δ) is the δth biggest weighted, T-spherical linear Diophantine fuzzy values Ωδ(Ωδ=(Ωδ)nφδ,δN) and φ=(φ1,φ2,...,φn) is the weight vector by mean of φδ0 (δN) with nδ=1φδ=1.

    If φ=(1φ,1φ,...,1φ), then T-SLDFWG and T-SLDFOWG operators are considered to be specific cases of the T-SLDFHWG operator. Thus, we conclude that the generalized form of T-SLDFWG and T-SLDFOWG operators is the T-SLDFHWG operator.

    Remark 4.2.6. The T-SLDFHWG operator satisfies the similar properties as those of T-SLDFHWA operator.

    To adeptly highlight the reliability and usefulness of the proposed work, we display a MADM problem in terms of T-SLDFNs by using T-SLDFWA and T-SLDFWG operators. For this, let P={P1,P2,...,Pn} be a family of n alternatives, G={G1,G2,...,Gk} be a family of attributes and φ=(φ1,φ2,...,φk) be the weight vector of the attributes where nδ=1φδ=1 and φδ0. The detailed process of the decision making is displayed as follows.

    Algorithm 1:

    Step 1: The value of the alternative Pi corresponding to attribute Gj is stated by the decision maker in terms of the T-SLDFNs and summarized as a matrix called the decision matrix.

    Step 2: Normalization: Generally, there are two attribute types of MADM problems: Cost-type and benefit-type. To maintain consistency of the types, it is necessary to normalize the input data as follows.

    Ωδ={(δTΛ,δIΛ,δFΛ,δμ,δν,δω) for beneficial types(δFΛ,1δIΛ,δTΛ,δω,δν,δμ) for cost types (7)

    Step 3: Aggregate all the attribute values denoted by Li using the T-SLDFWA operator or T-SLDFWG operator.

    Step 4: Calculating the score values for the aggregated alternatives values, by using Definition 3.1.1.

    Step 5: Ranking and sorting the alternatives based on their scores and selecting the best choice.

    To exhibit the practicality of the proposed methods, we carry out the following study about the ranking of several kinds of a certain product.

    Example 6.1. Assume that a company intends to examine four kinds of a certain product from a manufacturer to choose the most suitable one. Let P={P1,P2,P3,P4} be a universe consisting of four kinds of products. The proposed methods are employed to evaluate these products based on the following features: G1:Price, G2:Quality, G3:Aesthetics, G4:Functionality and G5:Easy to use. For this, the weights for these features are as follows: 0.3,0.3,0.2,0.1,0.1. Assume that the characteristics of the alternative Pi under attribute Gj are expressed by T-SLDFNs with q=3. Additionally, we consider the reference parameters μ: the degree of attractiveness, ν: the indeterminate degree of attractiveness, and ω: the degree of repulsion. Then, we can rank the products utilizing Algorithm 1 as follows.

    Step 1: The input data are applied to this algorithm. The decision maker evaluates the four kinds of product, Pi(i=1,2,3,4), according to five attributes, Gj(j=1,2,3,4,5), and the decision matrix is constructed as shown in Table 1.

    Table 1.  Original decision matrix.
    Feature P1 P2 P3 P4
    G1 (0.6,0.8,0.4, 0.5,0.4,0.1) (0.5,0.1,0.6, 0.7,0.7,0.6) (0,0.9,0.8, 0.2,0.6,0.3) (0.1,0.3,0.9, 0.9,0.5,0.4)
    G2 (0.9,0.1,0.6, 0.6,0.8,0.3) (0.2,0.5,0.4, 0.6,0.5,0.4) (0.9,0.1,0.2, 0.8,0.4,0.3) (0.4,0.5,0.7, 0.2,0.3,0.5)
    G3 (0.8,0.4,0.4, 0.2,0.4,0.6) (0.1,0.4,0.2, 0.7,0.4,0.6) (0.7,0.8,0.9, 0.8,0.7,0.5) (0.9,0.9,0.8, 0.5,0.8,0.3)
    G4 (0.7,0.3,0.5, 0.7,0.5,0.2) (0.4,0.2,0.9, 0.2,0.5,0.3) (0.9,0,0, 0.9,0.1,0.1) (0.1,0.4,0.9, 0.1,0.3,0.5)
    G5 (0.4,0.6,0.5, 0.3,0.6,0.5) (0.9,0.8,0.7, 0.8,0.2,0.5) (0.7,0.1,0.3, 0.4,0.5,0.6) (0.3,0.1,0.7, 0.5,0.4,0.4)

     | Show Table
    DownLoad: CSV

    Step 2: Obtain the normalized T-SLDF information of Table 1 by taking the complement of G1=Price, which is the cost type attribute in this example. The normalized decision matrix is shown in Table 2.

    Table 2.  Normalized decision matrix.
    Feature P1 P2 P3 P4
    G1 (0.4,0.2,0.6, 0.1,0.4,0.5) (0.6,0.9,0.5, 0.6,0.7,0.7) (0.8,0.1,0, 0.3,0.6,0.2) (0.9,0.7,0.1, 0.4,0.5,0.9)
    G2 (0.9,0.1,0.6, 0.6,0.8,0.3) (0.2,0.5,0.4, 0.6,0.5,0.4) (0.9,0.1,0.2, 0.8,0.4,0.3) (0.4,0.5,0.7, 0.2,0.3,0.5)
    G3 (0.8,0.4,0.4, 0.2,0.4,0.6) (0.1,0.4,0.2, 0.7,0.4,0.6) (0.7,0.8,0.9, 0.8,0.7,0.5) (0.9,0.9,0.8, 0.5,0.8,0.3)
    G4 (0.7,0.3,0.5, 0.7,0.5,0.2) (0.4,0.2,0.9, 0.2,0.5,0.3) (0.9,0,0, 0.9,0.1,0.1) (0.1,0.4,0.9, 0.1,0.3,0.5)
    G5 (0.4,0.6,0.5, 0.3,0.6,0.5) (0.9,0.8,0.7, 0.8,0.2,0.5) (0.7,0.1,0.3, 0.4,0.5,0.6) (0.3,0.1,0.7, 0.5,0.4,0.4)

     | Show Table
    DownLoad: CSV

    Step 3: Using the T-SLDFWA operator, aggregate all the attribute values for each alternative. The aggregated attributes' values are given below.

    L1=(0.77,0.22,0.53,0.48,0.52,0.41), L2=(0.58,0.55,0.43,0.64,0.48,0.51), L3=(0.78,0,0,0.63,0,0.64), L4=(0.79,0.52,0.41,0.39,0.44,0.53).

    Step 4: Find the score value κ(Li) of each of the aggregated attribute values. We obtained κ(L1)=0.0395, κ(L2)=0.1905, κ(L3)=0.384 and κ(L4)=0.3147.

    Step 5: We obtained the ranks of the four alternatives as P3>P1>P2>P4.

    In this part, we will analyze the results of the proposed method by setting different value q to show the sensitivity of parameter q. We will also solve the same problem by using different types of the proposed aggregation operators. Furthermore, we will show the influences of the proposed SFs on the results.

    In order to better discuss the influence of different q values, in this part, we take different values for the parameter q. The ranking results are shown in Table 3.

    Table 3.  Ranking results based on T-SLDFWA operator by using the different q.
    q The Score Function Ranking Results
    q=2 κ(P1)=0.1188,κ(P2)=0.2677,κ(P3)=0.5557,κ(P4)=0.2444 P3>P1>P4>P2
    q=3 κ(P1)=0.0395,κ(P2)=0.1905,κ(P3)=0.5662,κ(P4)=0.3147 P3>P1>P2>P4
    q=5 κ(P1)=0.0159,κ(P2)=0.1372,κ(P3)=0.5352,κ(P4)=0.0784 P3>P1>P4>P2
    q=8 κ(P1)=0.0336,κ(P2)=0.1188,κ(P3)=0.4901,κ(P4)=0.048 P3>P1>P4>P2
    q=10 κ(P1)=0.0379,κ(P2)=0.1113,κ(P3)=0.4714,κ(P4)=0.0412 P3>P1>P4>P2
    q=12 κ(P1)=0.0412,κ(P2)=0.1044,κ(P3)=0.4592,κ(P4)=0.0372 P3>P1>P4>P2
    q=15 κ(P1)=0.0454,κ(P2)=0.0951,κ(P3)=0.4487,κ(P4)=0.0333 P3>P1>P4>P2
    q=20 κ(P1)=0.0507,κ(P2)=0.0833,κ(P3)=0.4414,κ(P4)=0.0292 P3>P1>P4>P2

     | Show Table
    DownLoad: CSV

    From Table 3, we can see that the aggregation results are slightly different with parameter q increasing in the T-SLDFWA operator and the ranking of the alternatives is still the same. So the method based on the T-SLDFWA operator is stable. Further, we can find that for alternative P3 (The optimal alternative) with the increase of parameter q, the score function becomes smaller in general, while for the other alternatives the score function becomes larger with the increase of parameter q. In general, different decision makers can set different values to parameter q on the basis of their preferences.

    We tested the performances of the proposed operators by using the information from Example 6.1. The ranking results by the proposed operators are shown in Table 4.

    Table 4.  Comparative analysis of the proposed operators.
    Operators Ranking Optimal Alternative
    T-SLDFWA P3>P1>P2>P4 P3
    T-SLDFOWA P3>P1>P2>P4 P3
    T-SLDFHWA P3>P1>P4>P2 P3
    T-SLDFWG P3>P1>P2>P4 P3
    T-SLDFOWG P3>P2>P1>P4 P3
    T-SLDFHWG P3>P1>P4>P2 P3

     | Show Table
    DownLoad: CSV

    From Table 4, we can see that there are slight differences between the ranking results derived from the proposed operators, but the best and the first choice were the same for all methods.

    Three types of SFs were proposed in Section 3.1, namely, the SF, QSF, and ESF. For each SF, an AF has been provided to compare the T-SLDFNs. To depict the influence of the proposed SFs, we used them to rank the alternative products in Example 6.1. The ranking orders using the T-SLDFWA operator and T-SLDFWG operator are shown in Tables 5 and 6.

    Table 5.  Ranking order using the T-SLDFWA operator.
    Score Function Score Values Ranking Results
    κ κ(P1)=0.0395,κ(P2)=0.1905,κ(P3)=0.5662,κ(P4)=0.3147 P3>P1>P2>P4
    π π(P1)=0.1229,π(P2)=0.0547,π(P3)=0.4196,π(P4)=0.0803 P3>P1>P4>P2
    Γ Γ(P1)=0.6532,Γ(P2)=0.6034,Γ(P3)=0.8551,Γ(P4)=0.613 P3>P1>P4>P2

     | Show Table
    DownLoad: CSV
    Table 6.  Ranking order using the T-SLDFWG operator.
    Score Function Score Values Ranking Results
    κ κ(P1)=0.3071,κ(P2)=0.6078,κ(P3)=0.1887,κ(P4)=0.7207 P3>P1>P2>P4
    π π(P1)=0.058,π(P2)=0.42,π(P3)=0.0028,π(P4)=0.4558 P3>P1>P2>P4
    Γ Γ(P1)=0.5639,Γ(P2)=0.4649,Γ(P3)=0.6038,Γ(P4)=0.4284 P3>P1>P2>P4

     | Show Table
    DownLoad: CSV

    In Table 5, it is clear that the ranking results generated by using all the SFs are almost the same, and their optimal selections are the same.

    In Table 6, we can observe that the ranking results are the same for all SFs. Additionally, it should be noted that for all SFs, the results from both operators are almost equivalent, which proves the validity of the proposed SFs very well. The column charts of the SF, QSF, and ESF values based on T-SLDFWA and T-SLDFWG operators are given in Figures 2 and 3.

    Figure 2.  The comparison of SF, QSF, and ESF under the T-SLDFWA operator.
    Figure 3.  The comparison of the SF, QSF, and ESF under the T-SLDFWG operator.

    The above section displays the method and detailed calculation processes of the proposed operators. Besides the proposed operators, there are many aggregation operators to solve quantitative MADM problems. Among them, we underline, for their relevance in this comparison, the LDFWG operator [11], q-LDF weighted averaging (q-LDFWA) operator [12], q-LDF weighted geometric (q-LDFWG) operator [12], SLDF weighted averaging (SLDFWA) operator [45] and SLDF weighted geometric (SLDFWG) operator [45]. To accomplish the comparison, we used the above operators to aggregate the same data presented in Example 6.1.

    It is noteworthy that the q-LDFS only has two membership grades, T-grade and F-grade, accompanied by two RPs. The T-SLDFS is characterized by three membership grades, which are T-grade, Ⅰ-grade, and F-grade, and three RPs. Thus, the q-LDFS is a special case of the T-SLDFS and can be easily written in the form of a T-SLDFS. Therefore, to compare the proposed model with those in [12], we set Ⅰ-grade to 0 in the proposed operator and assigned two RPs instead of three. The LDFS and SLDFS are also considered special cases of the T-SLDFS. In particular, we put q=1 and Ⅰ-grade=0 in the suggested operators when we compare the LDFS with the suggested operators and q=1 while comparing SLDFS operators with the proposed operators. The computed results are summarized in Table 7, and the geometrical interpretation of the results is shown in Figure 4.

    Table 7.  Comparative analysis of the proposed operators with existing operators.
    Methods Operators Score Values Ranking Results
    Riaz and Hashmi [11] IΛ=0,ν=0 (q=1) WG κ(P1)=0.0528,κ(P2)=0.1052,κ(P3)=0.2992,κ(P4)=0.2547 P3>P1>P2>P4
    Almagrabi et al. [12] IΛ=0,ν=0 (q=3) WA κ(P1)=0.1402,κ(P2)=0.1391,κ(P3)=0.6117,κ(P4)=0.1461 P3>P4>P1>P2
    Almagrabi et al. [12] IΛ=0,ν=0 (q=3) WG κ(P1)=0.01,κ(P2)=0.2957,κ(P3)=0.154,κ(P4)=0.2707 P3>P1>P4>P2
    Riaz et al. [45] (q=1) WA κ(P1)=0.1619,κ(P2)=0.4433,κ(P3)=0.3882,κ(P4)=0.4207 P3>P1>P4>P2
    Riaz et al. [45] (q=1) WG κ(P1)=0.4416,κ(P2)=0.6728,κ(P3)=0.0463,κ(P4)=0.8015 P3>P1>P2>P4
    Proposed operators (q=3) WA κ(P1)=0.0395,κ(P2)=0.1905,κ(P3)=0.5662,κ(P4)=0.3147 P3>P1>P2>P4
    Proposed operators (q=3) WG κ(P1)=0.3071,κ(P2)=0.6078,κ(P3)=0.1887,κ(P4)=0.7207 P3>P1>P2>P4

     | Show Table
    DownLoad: CSV
    Figure 4.  Geometrical representation of the information given in Table 7.

    It is clear from Table 7 that the best alternatives obtained by using the methods of Riaz and Hashmi [11], Almagrabi et al. [12] and Riaz et al. [45] remained our proposed operators. This implies that the suggested methods are authentic and applicable. As mentioned above, LDFNs and q-LDFNs do not have the Ⅰ-grade, which represents neutrality, which will lead to the lack of some information. The proposed T-SLDFNs include T-grade, Ⅰ-grade, and F-grade, and give decision makers a more flexible environment to avoid information loss in the decision-making process. The method of Riaz et al. [45] is based on SLDFNs, and the rung q in SLDFNs equals 1. Therefore, under this circumstance, some decision evaluation information cannot be effectively expressed.

    It should be noted that as the parameter q increases, the allowable area of the evaluated information escalates and we can continue to increase the value of parameter q to satisfy the required information range. This is what happened while applying the T-SLDFNs, as the parameter q in T-SLDFNs is not restricted by a certain value. As a result, the T-SLDFNs are more flexible and can express a wider range of fuzzy information than the SLDFNs.

    This manuscript briefly described how the proposed theory of T-SLDFS generalizes all of the existing methods. T-SLDFS can express fuzzy information and simulate realistic DM problem scenarios more accurately through the assignment of variable parameter q to the construction of the SLDFS. The formal definition of the T-SLDFS was stated. The operations laws were developed, and some aggregation operators were defined under the T-SLDF environment. Some roperties of these operators were verified. Furthermore, a MADM method was designed on the basis of the proposed operators and SFs. A case study was provided to rank some alternative products. A T-SLDFN is formulated to portray the performance of each alternative product concerning each feature. Then, T-SLDFWA, T-SLDFOWA, T-SLDFHWA, T-SLDFWG, T-SLDFOWG and T-SLDFHWG operators are utilized to aggregate the attribute values. Several types of score functions are used to obtain the ranking results. We see slight differences between the ranking results derived from the proposed operators, but the best and the first choice were the same for all proposed operators. Further, the results demonstrate a great similarity and compatibility while using other evaluation methods such as LDFWG, q-LDFWA, q-LDFWG, SLDFWA and SLDFWG operators. In this study we attempt to handle more complicated MADM problems, however, there are still some limitations in the proposed work. We have only taken into consideration the evaluation information given by T-SLDFS, whereas in factual MADM problems, decision makers can use hybrid evaluation methods by employing the features of soft sets, complex numbers, bipolarity, hesitancy and interval-based membership to better capture the vagueness and uncertainties in some complicated data. In addition, this study addressed only two aggregation operators with their variations, namely, T-SLDFWA, T-SLDFOWA, T-SLDFHWA, T-SLDFWG, T-SLDFOWG and T-SLDFHWG operators. In the future, our targets are to study other generalizations of T-SLDFS such as T-spherical linear Diophantine fuzzy soft set, T-spherical linear Diophantine hesitant fuzzy set, T-spherical linear Diophantine bipolar fuzzy set and interval-valued T-spherical linear Diophantine fuzzy sets. Also, the proposed operators could be extended to Heronian mean, power mean, Hamacher, Bonferroni mean and Dombi's aggregation operators.

    This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No.GRANT3115].

    The author declares no conflict of interest.



    [1] L. A. Zadeh, Fuzzy sets, Inform. Contr., 8 (1965), 338–353.
    [2] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set. Syst., 20 (1986), 87–96.
    [3] R. R. Yager, Pythagorean fuzzy subsets, In: 2013 Joint IFSA World Congress NAFIPS Annual Meeting (IFSA/NAFIPS), 2013, 57–61. https://doi.org/10.1109/IFSA-NAFIPS.2013.6608375
    [4] R. R. Yager, Generalized orthopair fuzzy sets, IEEE T. Fuzzy Syst., 25 (2017), 1222–1230. https://doi.org/10.1109/TFUZZ.2016.2604005 doi: 10.1109/TFUZZ.2016.2604005
    [5] S. M. Chen, C. H. Chang, Fuzzy multi-attribute decision making based on transformation techniques of intuitionistic fuzzy values and intuitionistic fuzzy geometric averaging operators, Inform. Sci., 352 (2016), 133–149. https://doi.org/10.1016/j.ins.2016.02.049 doi: 10.1016/j.ins.2016.02.049
    [6] M. B. Khan, G. Santos-García, S. Treanțǎ, M. A. Noor, M. S. Soliman, Perturbed mixed variational-like inequalities and auxiliary principle pertaining to a fuzzy environment, Symmetry, 14 (2022), 2503. https://doi.org/10.3390/sym14122503 doi: 10.3390/sym14122503
    [7] A. K. Das, C. Granados, FP-intuitionistic multi fuzzy N-soft set and its induced FP-hesitant N soft set in group decision-making, Decis. Mak. Appl. Manag. Eng., 5 (2022), 67–89. https://doi.org/10.31181/dmame181221045d doi: 10.31181/dmame181221045d
    [8] R. R. Yager, Pythagorean membership grades in multicriteria decision making, IEEE T. Fuzzy Syst., 22 (2013), 958–965. https://doi.org/10.1109/TFUZZ.2013.2278989 doi: 10.1109/TFUZZ.2013.2278989
    [9] S. Abdullah, M. Qiyas, M. Naeem, Mamona, Y. Liu, Pythagorean cubic fuzzy Hamacher aggregation operators and their application in green supply selection problem, AIMS Math., 7 (2022), 4735–4766. https://doi.org/10.3934/math.2022263 doi: 10.3934/math.2022263
    [10] K. Kumar, S. M. Chen, Group decision making based on q-rung orthopair fuzzy weighted averaging aggregation operator of q-rung orthopair fuzzy numbers, Inform. Sciences, 598 (2022), 1–18. https://doi.org/10.1016/j.ins.2016.02.049 doi: 10.1016/j.ins.2016.02.049
    [11] M. Riaz, M. R. Hashmi, Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems, J. Intell. Fuzzy Syst., 37 (2019), 5417–5439. https://doi.org/10.3233/JIFS-190550 doi: 10.3233/JIFS-190550
    [12] A. O. Almagrabi, S. Abdullah, M. Shams, Y. D. Al-Otaibi, S. Ashraf, A new approach to q-linear Diophantine fuzzy emergency decision support system for COVID-19, J. Amb. Intel. Hum. Comp., 13 (2022), 1687–1713. https://doi.org/10.1007/s12652-021-03130-y doi: 10.1007/s12652-021-03130-y
    [13] M. Riaz, H. M. A. Farid, M. Aslam, D. Pamucar, D. Bozanić, Novel approach for third-party reverse logistic provider selection process under linear Diophantine fuzzy prioritized aggregation operators, Symmetry, 13 (2021), 1152. https://doi.org/10.3390/sym13071152 doi: 10.3390/sym13071152
    [14] A. Iampan, G. S. Garcia, M. Riaz, H. Muhammad, A. Farid, R. Chinram, Linear Diophantine fuzzy Einstein aggregation operators for multi-criteria decision-making problems, J. Math., 2021 (2021). https://doi.org/10.1155/2021/5548033 doi: 10.1155/2021/5548033
    [15] T. Mahmood, I. Haleemzai, Z. Ali, D. Pamucar, D. Marinkovic, Power Muirhead mean operators for interval-valued linear Diophantine fuzzy sets and their application in decision-making strategies, Mathematics, 10 (2022), 70. https://doi.org/10.3390/math10010070 doi: 10.3390/math10010070
    [16] T. Mahmood, Z. Ali, K. Ullah, Q. Khan, A. Alsanad, M. A. A. Mosleh, Linear Diophantine uncertain linguistic power Einstein aggregation operators and their applications to multi attribute decision making, Complexity, 2021 (2021). https://doi.org/10.1155/2021/4168124 doi: 10.1155/2021/4168124
    [17] T. Mahmood, Z. Ali, M. Aslam, R. Chinram, Generalized Hamacher aggregation operators based on linear Diophantine uncertain linguistic setting and their applications in decision-making problems, IEEE Access, 9 (2021), 126748–126764. https://doi.org/10.1109/ACCESS.2021.3110273 doi: 10.1109/ACCESS.2021.3110273
    [18] M. Qiyas, M. Naeem, S. Abdullah, N. Khan, A. Ali, Similarity measures based on q-rung linear Diophantine fuzzy sets and their application in logistics and supply chain management, J. Math., 2022 (2022). https://doi.org/10.1155/2022/4912964 doi: 10.1155/2022/4912964
    [19] Z. Ali, T. Mahmood, G. Santos-García, Heronian mean operators based on novel complex linear Diophantine uncertain linguistic variables and their applications in multi-attribute decision making, Mathematics, 9 (2021), 2730. https://doi.org/10.3390/math9212730 doi: 10.3390/math9212730
    [20] H. Kamaci, Complex linear Diophantine fuzzy sets and their cosine similarity measures with applications, Complex Intell. Syst., 8 (2021), 1281–1305. https://doi.org/10.1007/s40747-021-00573-w doi: 10.1007/s40747-021-00573-w
    [21] H. Kamaci, Linear Diophantine fuzzy algebraic structures, J. Amb. Intell. Hum. Comput., 12 (2021), 10353–10373. https://doi.org/10.1007/s12652-020-02826-x doi: 10.1007/s12652-020-02826-x
    [22] S. Ayub, M. Shabir, M. Riaz, M. Aslam, R. Chinram, Linear Diophantine fuzzy relations and their algebraic properties with decision making, Symmetry, 13 (2021), 945. https://doi.org/10.3390/sym13060945 doi: 10.3390/sym13060945
    [23] M. Riaz, M. R. Hashmi, H. Kalsoom, D. Pamucar, Y. M. Chu, Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment, Symmetry, 12 (2020), 1215. https://doi.org/10.3390/sym12081215 doi: 10.3390/sym12081215
    [24] K. Prakash, M. Parimala, H. Garg, M. Riaz, Lifetime prolongation of a wireless charging sensor network using a mobile robot via linear Diophantine fuzzy graph environment, Complex Intell. Syst., 8 (2022), 2419–2434. https://doi.org/10.1007/s40747-022-00653-5 doi: 10.1007/s40747-022-00653-5
    [25] M. Parimala, S. Jafari, M. Riaz, M. Aslam, Applying the Dijkstra algorithm to solve a linear Diophantine fuzzy environment, Symmetry, 13 (2021), 1616. https://doi.org/10.3390/sym13091616 doi: 10.3390/sym13091616
    [26] B. C. Cuong, Picture fuzzy sets, J. Comput. Sci. Cyb., 30 (2014), 409–420. http://dx.doi.org/10.15625/1813-9663/30/4/5032 doi: 10.15625/1813-9663/30/4/5032
    [27] M. W. Jang, J. H. Park, M. J. Son, Probabilistic picture hesitant fuzzy sets and their application to multi-criteria decision-making, AIMS Math., 8 (2023), 8522–8559. https://doi.org/10.3934/math.2023429 doi: 10.3934/math.2023429
    [28] A. Ashraf, K. Ullah, A. Hussain, M. Bari, Interval-valued picture fuzzy Maclaurin symmetric mean operator with application in multiple attribute decision-making, Rep. Mech. Eng., 3 (2022), 210–226. https://doi.org/10.31181/rme20020042022a doi: 10.31181/rme20020042022a
    [29] B. F. Yildirim, S. K. Yıldırım, Evaluating the satisfaction level of citizens in municipality services by using picture fuzzy VIKOR method: 2014-2019 period analysis, Decis. Mak. Appl. Manag. Eng., 5 (2022), 50–66. https://doi.org/10.31181/dmame181221001y doi: 10.31181/dmame181221001y
    [30] S. Ashraf, S. Abdullah, T. Mahmood, F. Ghani, T. Mahmood, Spherical fuzzy sets and their applications in multi-attribute decision making problems, J. Intell. Fuzzy Syst., 36 (2019), 2829–2844. https://doi.org/10.3233/JIFS-172009 doi: 10.3233/JIFS-172009
    [31] T. Mahmood, K. Ullah, Q. Khan, N. Jan, An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets, Neural Comput. Appl., 31 (2019), 7041–7053. https://doi.org/10.1007/s00521-018-3521-2 doi: 10.1007/s00521-018-3521-2
    [32] Z. Ali, T. Mahmood, M. S. Yang, TOPSIS method based on complex spherical fuzzy sets with Bonferroni mean operators, Mathematics, 8 (2020), 1739. https://doi.org/10.3390/math8101739 doi: 10.3390/math8101739
    [33] M. Qiyas, M. Naeem, S. Abdullah, N. Khan, Decision support system based on complex T-Spherical fuzzy power aggregation operators, AIMS Math., 7 (2022), 16171–16207. https://doi.org/10.3934/math.2022884 doi: 10.3934/math.2022884
    [34] S. G. Quek, G. Selvachandran, M. Munir, T. Mahmood, K. Ullah, L. H. Son, et al., Multi-attribute multi-perception decision-making based on generalized T-spherical fuzzy weighted aggregation operators on neutrosophic sets, Mathematics, 7 (2019), 780. https://doi.org/10.3390/math7090780 doi: 10.3390/math7090780
    [35] A. Al-Quran, A new multi attribute decision making method based on the T-spherical hesitant fuzzy sets, IEEE Access, 9 (2021), 156200–156210. https://doi.org/10.1109/ACCESS.2021.3128953 doi: 10.1109/ACCESS.2021.3128953
    [36] H. Garg, K. Ullah, T. Mahmood, N. Hassan, N. Jan, T-spherical fuzzy power aggregation operators and their applications in multi-attribute decision making, J. Amb. Intel. Hum. Comput., 12 (2021), 9067–9080. https://doi.org/10.1007/s12652-020-02600-z doi: 10.1007/s12652-020-02600-z
    [37] M. Naeem, A. Khan, S. Ashraf, S. Abdullah, M. Ayaz, N. Ghanmi, A novel decision making technique based on spherical hesitant fuzzy Yager aggregation information: Application to treat Parkinson's disease, AIMS Math., 7 (2022), 1678–1706. https://doi.org/10.3934/math.2022097 doi: 10.3934/math.2022097
    [38] K. Ullah, H. Garg, T. Mahmood, N. Jan, Z. Ali, Correlation coefficients for T-spherical fuzzy sets and their applications in clustering and multi-attribute decision making, Soft Comput., 24 (2020), 1647–1659. https://doi.org/10.1007/s00500-019-03993-6 doi: 10.1007/s00500-019-03993-6
    [39] Y. Chen, M. Munir, T. Mahmood, A. Hussain, S. Zeng, Some generalized T-spherical and group-generalized fuzzy geometric aggregation operators with application in MADM problems, J. Math., 2021 (2021). https://doi.org/10.1155/2021/5578797 doi: 10.1155/2021/5578797
    [40] F. Karaaslan, M. A. D. Dawood, Complex T-spherical fuzzy Dombi aggregation operators and their applications in multiple-criteria decision-making, Complex Intell. Syst., 7 (2021), 2711–2734. https://doi.org/10.1007/s40747-021-00446-2 doi: 10.1007/s40747-021-00446-2
    [41] P. Liu, B. Zhu, P. Wang, A multi-attribute decision-making approach based on spherical fuzzy sets for Yunnan Baiyao's R&D project selection problem, Int. J. Fuzzy Syst., 21 (2019), 2168–2191. https://doi.org/10.1007/s40815-019-00687-x doi: 10.1007/s40815-019-00687-x
    [42] P. Liu, B. Zhu, P. Wang, M. Shen, An approach based on linguistic spherical fuzzy sets for public evaluation of shared bicycles in China, Eng. Appl. Artif. Intell., 87 (2020), 103295. https://doi.org/10.1016/j.engappai.2019.103295 doi: 10.1016/j.engappai.2019.103295
    [43] M. Q. Wu, T. Y. Chen, J. P. Fan, Divergence measure of T-spherical fuzzy sets and its applications in pattern recognition, IEEE Access, 8 (2020), 10208–10221. https://doi.org/10.1109/ACCESS.2019.2963260 doi: 10.1109/ACCESS.2019.2963260
    [44] P. Devi, B. Kizielewicz, A. Guleria, A. Shekhovtsov, J. Wątróbski, T. Królikowski, et al., Decision support in selecting a reliable strategy for sustainable Urban transport based on Laplacian energy of T-spherical fuzzy graphs, Energies, 15 (2022), 4970. https://doi.org/10.3390/en15144970 doi: 10.3390/en15144970
    [45] M. Riaz, M. R. Hashmi, D. Pamucar, Y. Chu, Spherical linear Diophantine fuzzy sets with modeling uncertainties in MCDM, Comput. Model. Eng. Sci., 126 (2021), 1125–1164. https://doi.org/10.32604/cmes.2021.013699 doi: 10.32604/cmes.2021.013699
  • This article has been cited by:

    1. Ashraf Al-Quran, Rukhsana Kausar, Toqeer Jameel, Muhammad Riaz, Enhancing Tropical Artificial Forests With Cubic Picture Fuzzy Fairly Aggregation Operators, 2023, 11, 2169-3536, 112362, 10.1109/ACCESS.2023.3322652
    2. Phakakorn Panpho, Pairote Yiarayong, (p, q)-Rung linear Diophantine fuzzy sets and their application in decision-making, 2023, 42, 2238-3603, 10.1007/s40314-023-02456-x
    3. Abrar Hussain, Nan Zhang, Kifayat Ullah, Harish Garg, Ashraf Al-Quran, Shi Yin, Selection of safety equipment with choquet integral operators and q-rung orthopair fuzzy information, 2024, 10641246, 1, 10.3233/JIFS-240169
    4. Abrar Hussain, Kifayat Ullah, Ashraf Al-Quran, Harish Garg, Some T-spherical fuzzy dombi hamy mean operators and their applications to multi-criteria group decision-making process, 2023, 45, 10641246, 9621, 10.3233/JIFS-232505
    5. K. M. Abirami, Narayanan Veena, R. Srikanth, P. Dhanasekaran, Shih Pin Chen, An Extensive Review of the Literature Using the Diophantine Equations to Study Fuzzy Set Theory, 2024, 2024, 0161-1712, 10.1155/2024/5014170
    6. AN. Surya, J. Vimala, Similarity measure for complex non-linear Diophantine fuzzy hypersoft set and its application in pattern recognition, 2025, 690, 00200255, 121591, 10.1016/j.ins.2024.121591
    7. Rong Yan, Yongguang Han, Fang Li, Pengfei Li, Evaluation of Sustainable Potential Bearing Capacity of Tourism Environment Under Uncertainty: A Multiphase Intuitionistic Fuzzy EDAS Technique Based on Hamming Distance and Logarithmic Distance Measures, 2024, 12, 2169-3536, 8081, 10.1109/ACCESS.2024.3352732
    8. Mani Parimala, Saeid Jafari, Spherical Linear Diophantine Fuzzy Graphs: Unleashing the Power of Fuzzy Logic for Uncertainty Modeling and Real-World Applications, 2024, 13, 2075-1680, 153, 10.3390/axioms13030153
    9. Weiwei Li, Pingtao Yi, Danning Zhang, Lu Wang, Qiankun Dong, Stochastic-integration-based decision support methods for heterogeneous multi-attribute group decision making with several attribute sets, 2023, 234, 09574174, 121100, 10.1016/j.eswa.2023.121100
    10. Ashraf Al-Quran, Nimra Jamil, Syeda Tayyba Tehrim, Muhammad Riaz, Cubic bipolar fuzzy VIKOR and ELECTRE-II algorithms for efficient freight transportation in Industry 4.0, 2023, 8, 2473-6988, 24484, 10.3934/math.20231249
    11. Yongfeng Pang, Wei Yang, Some T-Spherical Hesitant Fuzzy Shapley Bonferroni Mean Operators and Their Applications, 2024, 12, 2169-3536, 60185, 10.1109/ACCESS.2024.3392293
    12. Xiaoyu Cao, Han Liu, Preference Evaluation and Recommendation of Athletes for National Traditional Sports Training Using an Intelligent Method Based on Picture Fuzzy Knowledge, 2024, 12, 2169-3536, 164444, 10.1109/ACCESS.2024.3490652
    13. Pairote Yiarayong, A citizen co-designed approach to combat water scarcity using complex spherical linear Diophantine fuzzy sets, 2025, 44, 2238-3603, 10.1007/s40314-024-03035-4
    14. Mani Parimala, Karthikeyan Prakash, Ashraf Al-Quran, Muhammad Riaz, Saeid Jafari, Optimization Algorithms of PERT/CPM Network Diagrams in Linear Diophantine Fuzzy Environment, 2024, 139, 1526-1506, 1095, 10.32604/cmes.2023.031193
    15. Tongtong Cai, An Iterative Data-Driven Intelligent Multiple-Attribute Decision Making for Football Teaching Quality Evaluation in Higher Education, 2025, 13, 2169-3536, 45010, 10.1109/ACCESS.2025.3548889
  • Reader Comments
  • © 2023 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(2012) PDF downloads(117) Cited by(14)

Figures and Tables

Figures(4)  /  Tables(7)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog