Processing math: 45%
Research article Special Issues

New criteria on global Mittag-Leffler synchronization for Caputo-type delayed Cohen-Grossberg Inertial Neural Networks

  • Received: 30 August 2023 Revised: 01 October 2023 Accepted: 15 October 2023 Published: 26 October 2023
  • MSC : 26A33, 92B20, 94B50

  • Our focus of this paper is on global Mittag-Leffler synchronization (GMLS) of the Caputo-type Inertial Cohen-Grossberg Neural Networks (ICGNNs) with discrete and distributed delays. This model takes into account the inertial term as well as the two types of delays, which greatly reduces the conservatism with respect to the model. A change of variables transforms the 2β order inertial frame into β order ordinary frame in order to deal with the effect of the inertial term. In the following steps, two novel types of delay controllers are designed for the purpose of reaching the GMLS. In conjunction with the novel controllers, utilizing differential mean-value theorem and inequality techniques, several criteria are derived to determine the GMLS of ICGNNs within the framework of Caputo-type derivative and calculus properties. At length, the feasibility of the results is further demonstrated by two simulation examples.

    Citation: Hongmei Zhang, Xiangnian Yin, Hai Zhang, Weiwei Zhang. New criteria on global Mittag-Leffler synchronization for Caputo-type delayed Cohen-Grossberg Inertial Neural Networks[J]. AIMS Mathematics, 2023, 8(12): 29239-29259. doi: 10.3934/math.20231497

    Related Papers:

    [1] 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
    [2] Muhammad Akram, Naila Ramzan, Anam Luqman, Gustavo Santos-García . An integrated MULTIMOORA method with 2-tuple linguistic Fermatean fuzzy sets: Urban quality of life selection application. AIMS Mathematics, 2023, 8(2): 2798-2828. doi: 10.3934/math.2023147
    [3] Ayesha Khan, Uzma Ahmad, Adeel Farooq, Mohammed M. Ali Al-Shamiri . Combinative distance-based assessment method for decision-making with 2-tuple linguistic q-rung picture fuzzy sets. AIMS Mathematics, 2023, 8(6): 13830-13874. doi: 10.3934/math.2023708
    [4] Shahida Bashir, Ahmad N. Al-Kenani, Maria Arif, Rabia Mazhar . A new method to evaluate regular ternary semigroups in multi-polar fuzzy environment. AIMS Mathematics, 2022, 7(7): 12241-12263. doi: 10.3934/math.2022680
    [5] Muhammad Akram, Sumera Naz, Gustavo Santos-García, Muhammad Ramzan Saeed . Extended CODAS method for MAGDM with 2-tuple linguistic T-spherical fuzzy sets. AIMS Mathematics, 2023, 8(2): 3428-3468. doi: 10.3934/math.2023176
    [6] Mohammed M. Ali Al-Shamiri, Adeel Farooq, Muhammad Nabeel, Ghous Ali, Dragan Pamučar . Integrating TOPSIS and ELECTRE-Ⅰ methods with cubic m-polar fuzzy sets and its application to the diagnosis of psychiatric disorders. AIMS Mathematics, 2023, 8(5): 11875-11915. doi: 10.3934/math.2023601
    [7] Zu-meng Qiu, Huan-huan Zhao, Jun Yang . A group decision making approach based on the multi-dimensional Steiner point. AIMS Mathematics, 2024, 9(1): 942-958. doi: 10.3934/math.2024047
    [8] Muhammad Riaz, Maryam Saba, Muhammad Abdullah Khokhar, Muhammad Aslam . Novel concepts of m-polar spherical fuzzy sets and new correlation measures with application to pattern recognition and medical diagnosis. AIMS Mathematics, 2021, 6(10): 11346-11379. doi: 10.3934/math.2021659
    [9] Anas Al-Masarwah, Abd Ghafur Ahmad . Subalgebras of type (α, β) based on m-polar fuzzy points in BCK/BCI-algebras. AIMS Mathematics, 2020, 5(2): 1035-1049. doi: 10.3934/math.2020072
    [10] Anas Al-Masarwah, Abd Ghafur Ahmad . On (complete) normality of m-pF subalgebras in BCK/BCI-algebras. AIMS Mathematics, 2019, 4(3): 740-750. doi: 10.3934/math.2019.3.740
  • Our focus of this paper is on global Mittag-Leffler synchronization (GMLS) of the Caputo-type Inertial Cohen-Grossberg Neural Networks (ICGNNs) with discrete and distributed delays. This model takes into account the inertial term as well as the two types of delays, which greatly reduces the conservatism with respect to the model. A change of variables transforms the 2β order inertial frame into β order ordinary frame in order to deal with the effect of the inertial term. In the following steps, two novel types of delay controllers are designed for the purpose of reaching the GMLS. In conjunction with the novel controllers, utilizing differential mean-value theorem and inequality techniques, several criteria are derived to determine the GMLS of ICGNNs within the framework of Caputo-type derivative and calculus properties. At length, the feasibility of the results is further demonstrated by two simulation examples.



    Decision-making is a technique of making choices by identifying decisions, gathering information, and solving difficulties to choose the best alternative. Multiple-attribute decision making (MADM) is a branch of operations research in which satisfactory solutions are selected based on various key aspects of competing criteria that may be selected as decision problems. This technique can often be used to solve many real-world problems related to the fields of social sciences, economics, medicine, and engineering. MADM is divided into single-expert decision-making vs group decision-making according to the number of experts. Multi-attribute group decision-making (MAGDM) is a technique in which a group of experts presents their preferences to achieve better outcomes than individuals. In general, MAGDM is preferable because the aggregation matrix is developed by using the crowd's decision on the final result. This study is inclined to explore the TOPSIS [1] and ELECTRE [2] methods thoroughly.

    To address MADM and MAGDM problems the technique of order preferences by similarity to the ideal solution named (TOPSIS) is widely adopted. The TOPSIS approach works on the fundamental principle to select the best alternative that is closest to the positive ideal solution (PIS) and farthest from the negative ideal solution (NIS). In 1981, Hwang and Yoon [1] developed the TOPSIS technique to cope with decision-making issues. The classical TOPSIS approach only uses crisp data to tackle real-life issues. But, it is very rare in real-life decision-making to find crisp and precise data. The theory of fuzzy sets (FSs), pioneered by Zadeh [3], aimed to capture the ambiguous information to address the inherent fuzziness of real life situations. Firstly, Chen [4] merged the theories of TOPSIS method and FSs to develop new authentic technique to address the inconsistent data. In addition, Shen et al. [5] and Amiri [6] applied the fuzzy TOPSIS technique to pick suppliers and projects in oil field development, respectively. A significant contribution to FS theory was made by Atanassov [7] who introduced the concept of intuitionistic fuzzy set (IFS) that incorporated the non-membership ν and hesitation π degrees with the membership value μ, bounded by the condition μ+ν1. Boran et al. [8] proposed a decision-making approach based on TOPSIS method employing the adaptable structure of IFSs. Aloini et al. [9] also contributed to the IF-TOPSIS technique. Yager [10,11] introduced the concept of Pythagorean fuzzy sets (PFSs) with membership μ, non-membership ν and hesitation π=1μ2ν2, which relaxed the IFS condition μ+ν1 to μ2+ν21. Further, Zhang and Xu [12] extended the TOPSIS framework for PFSs. Further, Akram et al. [13] provided a modified version of PF-TOPSIS method for group decision-making along with explanatory numerical examples. Yucesan and Gul [14] unfolded the application of PF-TOPSIS method in the field of medical.

    The FS IFS and PFS were incompetent in dealing with imprecise and inconsistent multi-polar information. To overcome this limitation, Chen et al. [15] proposed the m-polar fuzzy set (mFS) that can deal with the multi-information for decision-making issues. Jana and Pal [16] presented some basic mF operations and utilized this idea for multi-attribute decision-making. Akram [17] is accredited to introduce the concept of mF graphs. Adeel et al. [18] extended the TOPSIS technique in mF environment for multi-attribute decision making. Akram and Adeel [19] introduced the hesitant m-polar fuzzy TOPSIS method for group decision making.

    Various aspects of daily life activities can not be evaluated accurately in a quantitative form but possibly in a qualitative one. Most people would like to express their opinions in dialogues, as good or bad. In this way, the quantification burden can be replaced by the qualitative concept. By utilizing the linguistic preferences, Liu et al. [20] and Akram et al. [21] contributed for group decision making. Xu et al. [22] and Zhu et al. [23] have made a significant contribution for linguistic preferences of data in decision analysis. Further, we can obtain more accurate results by using the 2-tuple linguistic (2TL) concept in decision-making. Firstly, Herrera and Martínez [24] introduced words processing by using a 2-tuple fuzzy linguistic representation model. For further contribution in 2TL environment, the reader can consult [25,26,27]. Akram et al. [28] introduced the combined concept of a 2-tuple linguistic and m-polar fuzzy set for decision analysis. In addition, Wei [29] provided the TOPSIS approach for multiple attribute group decision-making based on 2-tuple linguistic fuzzy information.

    Benayoun et al. [2] initiated the family of ELimination and Choice translating reality (ELECTRE) methods by presenting ELECTRE-I method. Figueira et al. [30] addressed the variants of ELECTRE strategies. The ELECTRE-I technique in fuzzy environment was first extended by Hatami-Marbini and Tavana [31]. Further, the fuzzy ELECTRE technique was applied for academic staff selection by Rouyendegh and Erkan [32]. For analyzing mobile payment business models, Asghari et al. [33] used the fuzzy ELECTRE technique. Kheirkhah and Dehghani [34] employed the fuzzy ELECTRE technique to assess the quality of public transportation. Chen and Wu [35] put forward the ELECTRE-I approach for the practical and competent framework of IFSs. Akram et al. [36] presented the ELECTRE-I method for multi-criteria group decision making in Pythagorean fuzzy environment. Further, Akram et al. [37] presented the extended version of the ELECTRE-I method in m-polar fuzzy environment. Adeel et al. [38] introduced mHF ELECTRE-I and HmF ELECTRE-I method for multi-criteria decision-making. Adeel et al. [39] contributed to group decision-making by presenting the m-polar fuzzy linguistic ELECTRE-I method. For the related work, the readers are suggested to [40,41,42,43,44,45].

    We now turn to the motivation and key significance of the planned research effort. All existing decision-making processes are successful and appropriate when the decision data are in precise or vaguely imprecise form, but they cannot be exploited when the decision problem contains multipolar imprecise data and 2-tuple linguistic information. We are inspired to extend the proposed MAGDM method based on 2TLmF information for the following reasons.

    ● The 2TLmF set has a wide range of applications because it combines the advantages of 2TL and m-polar fuzzy sets. However, handling 2-tuple linguistic methods, especially the 2TLmF MAGDM method, in the multi-pole fuzzy case remains a hurdle for us, which we address in this work.

    ● Existing strategies to solve the MAGDM problem are limited to dealing with m-polar ambiguous information. These methods cannot account for 2-tuple linguistic data. Therefore, information may be lost, leading to undesirable consequences. However, existing technical limitations can be addressed using the newly proposed work.

    ● The limited literature on 2TLmFS is a major incentive of our research as there is no known decision method, based on TOPSIS or ELECTRE approach, for processing 2TLmF data. Therefore, 2TLmF-TOPSIS and 2TLmF ELECTRE-I models are developed to address this research gap, which combine multi-polarity and 2-tuple linguistic terminology without adding any complexity.

    In this article, we offer two strategies, 2TLmF-TOPSIS and 2TLmF ELECTRE-I, based on the 2TLmF information as well as the combined flowchart for proposed work, to extract motivation from the 2TLmFS. These two methods collect the information both linguistically and multi-polar numeric values, which contribute to produce more reliable results. In 2TLmF-TOPSIS, we evaluate the normalized Euclidean distance to access the distance among alternatives by using 2TLmF aggregated weighted decision matrix, 2TLmFPIS, and 2TLmFNIS respectively. Finally, we rank the alternatives by using the relative closeness index. Nevertheless, in the 2TLmF ELECTRE-I method, we can compare the 2TLmF numbers by using their 2TLmF score and 2TLmF accuracy function. Firstly, we obtain the 2TLmF-concordance and 2TLmF-discordance sets by comparing the superiority and inferiority of every alternative over the other. Then, by utilizing these concordance and discordance sets we can obtain the concordance and discordance matrices. Further, we can construct the 2TLmF concordance dominance and 2TLmF discordance dominance matrix by comparing concordance and discordance levels with 2TLmF-concordance and 2TLmF-discordance indices. Ultimately, we use the outranking graph to select the most suitable alternative.

    The rest of the proposed research article is organized as: Section 2 reviews some basic concepts about 2-tuple linguistic (2TL) representation models, m-polar fuzzy sets (mF) and 2TLmFS. In Section 3, we introduce the mathematical model of the 2TLmF-TOPSIS approach for MAGDM. In Section 4, two numerical examples related to selection of highway construction project managers and the textile industry are taken into account by using the 2TLmF-TOPSIS approach. In Section 5, we present the 2TLm ELECTRE-I approach with a combined flowchart for 2TLmF-TOPSIS and 2TLm ELECTRE-I approaches. Section 6 addresses the same practical difficulties already discussed in Section 3, solved by using the 2TLmF ELECTRE-I method. Furthermore, in Section 7, we conduct a comparative study to examine the effectiveness of the proposed method. The Section 8 contains the contributions and limitations of the proposed work. The Section 9 gives conclusions and future directions.

    This section contains basic definitions that are necessary for this paper.

    Definition 2.1. [24] Let ={cj|j=0,,σ} be a set of linguistic terms and ψ[0,σ] be a number value illustrating the aggregation result of linguistic symbolic. Then the 2-tuple linguistic information equivalent to ψ is obtained by using function Λ defined as

    Λ:[0,σ]×[0.5,0.5),
    Λ(ψ)={cj,j=round(ψ)ϱ=ψj,ϱ[0.5,0.5). (2.1)

    Definition 2.2. [24] Let ={cj|j=0,,σ} be a set of linguistic terms and (cj,ϱj) be a 2-tuple, then the function Λ1 which restore the 2-tuple value to its equivalent numerical value ψ[0,σ]R is defined as

    Λ1:×[0.5,0.5)[0,σ],Λ1(cj,ϱ)=j+ϱ=ψ. (2.2)

    Definition 2.3. [24,25] Consider (ct,ϱ1) and (cu,ϱ2) be two 2TL values. Then,

    (1) For t<u, we have, (ct,ϱ1)<(cu,ϱ2).

    (2) If t = u, then

    a) For ϱ1=ϱ2(ct,ϱ1) and (cu,ϱ2) both are same.

    b) For ϱ1<ϱ2(ct,ϱ1) is less than (cu,ϱ2).

    c) For ϱ1>ϱ2(ct,ϱ1) is greater than (cu,ϱ2).

    Definition 2.4. [15] An mF set ˆÇ on non-empty set Y is a mapping ˆÇ:Y[0,1]m. The membership value for every element yY is represented as

    ˆÇ=(p1Ç(y),p2Ç(y),,pmÇ(y)).

    Here piÇ:[0,1]m[0,1] is the ith projection mapping.

    Where,

    ● The m-th power of [0, 1] is a poset with the point-wise order , where m is any arbitrary ordinal number (For convince, m={n|n<m} when m>0), is defined by xypi(x)pi(y) for each im (x,y[0,1]m).

    ● In the [0,1]m, the greatest value is 1=(1,1,,1) and the smallest value is 0=(0,0,,0).

    ● For convince the mF number is represented as, ˆÇ=(p1Ç,,pmÇ).

    Definition 2.5. [15] Let ˆÇ1=(p1Ç1,,pmÇ1), and ˆÇ2=(p1Ç2,,pmÇ2) be two m-polar fuzzy numbers. Then by using score S and accuracy function H we have:

    (1) If S(ˆÇ1)<S(ˆÇ2), than ˆÇ1<ˆÇ2.

    (2) If S(ˆÇ1)>S(ˆÇ2), than ˆÇ1>ˆÇ2.

    (3) If S(ˆÇ1)=S(ˆÇ2) and H(ˆÇ1)=H(ˆÇ2), than ˆÇ1=ˆÇ2.

    (4) If S(ˆÇ1)=S(ˆÇ2) but H(ˆÇ1)<H(ˆÇ2), than ˆÇ1<ˆÇ2.

    (5) If S(ˆÇ1)=S(ˆÇ2) but H(ˆÇ1)>H(ˆÇ2), than ˆÇ1>ˆÇ2.

    Definition 2.6. [28] A 2TLmF set ˆΦ on a nonempty set X is defined as

    ˆΦ={<x,((cϕ1(x),ϱ1(x)),(cϕ2(x),ϱ2(x)),,(cϕm(x),ϱm(x)))>:xX},

    where, the membership degree is denoted as, (cϕi(x),ϱi(x)) with the conditions cϕi(x)ˆΦ, ϱi(x)[0.5,0.5), 0Λ1(cϕi(x),ϱi(x))σ,i=1,2,,m.

    Conveniently, we say χ=((cϕ1,ϱ1),(cϕ2,ϱ2),,(cϕm,ϱm)), a 2-tuple linguistic m-polar fuzzy number.

    Definition 2.7. [28] The score function S of a 2TL m-polar fuzzy number, ˆχ=((cϕ1,ϱ1),(cϕ2,ϱ2),,(cϕm,ϱm)), is defined as

    S(ˆχ)=Λ(σmmr=1(Λ1(cϕr,ϱr)σ)),Λ1(S(ˆχ))[0,σ].

    Definition 2.8. [28] The accuracy function H of a 2TL m-polar fuzzy number, ˆχ=((cϕ1,ϱ1),(cϕ2,ϱ2),,(cϕm,ϱm)), is defined as

    H(ˆχ)=Λ(σmmr=1(1)r((Λ1(cϕr,ϱr)σ)1)),Λ1(H(ˆχ))[0,σ].

    Definition 2.9. [28] Let χ1=((cϕ11,ϱ11),(cϕ12,ϱ12),,(cϕ1m,ϱ1m)), and χ2=((cϕ21,ϱ21),(cϕ22,ϱ22),,(cϕ2m,ϱ2m)), be two 2TLmF numbers. we define the following operations on 2TLmF numbers as:

    (1) ρχ=(Λ(σ(1(1Λ1(cϕ1,ϱ1)σ)ρ)),,Λ(σ(1(1Λ1(cϕm,ϱm)σ)ρ))), ρ>0,

    (2) χρ=(Λ(σ(Λ1(cϕ1,ϱ1)σ)ρ),,Λ(σ(Λ1(cϕm,ϱm)σ)ρ)), ρ>0,

    (3) χ1χ2=(Λ(σ(Λ1(cϕ11,ϱ11)σ+Λ1(cϕ21,ϱ21)σΛ1(cϕ11,ϱ11)σ.Λ1(cϕ21,ϱ21)σ)),,(Λ(σ(Λ1(cϕ1m,ϱ1m)σ+Λ1(cϕ2m,ϱ2m)σΛ1(cϕ1m,ϱ1m)σ.Λ1(cϕ2m,ϱ2m)σ))),

    (4) χ1χ2=(Λ(σ(Λ1(cϕ11,ϱ11)σ.Λ1(cϕ21,ϱ21)σ)),,Λ(σ(Λ1(cϕ1m,ϱ1m)σ.Λ1(cϕ2m,ϱ2m)σ))).

    Definition 2.10. Let χ1=((cϕ11,ϱ11),(cϕ12,ϱ12),,(cϕ1m,ϱ1m)), and χ2=((cϕ21,ϱ21),(cϕ22,ϱ22),,(cϕ2m,ϱ2m)), be two 2TLmF sets. Then the normalized Euclidean distance between χ1 and χ2 is defined as

    D(χ1,χ2)=1m[(Λ1(cϕ11,ϱ11)σΛ1(cψ21,ϱ21)σ)2++(Λ1(cϕ1m,ϱ1m)σΛ1(cϕ2m,ϱ2m)σ)2].

    In this section, we construct a mathematical tool to interact with the 2TLmF TOPSIS approach for multi-attribute group decision making (MAGDM). In this approach, we consider ={1,2,,v} the set of decision makers who are recruited for decision-making. where each expert (u, u = 1, 2, , v) assigns a suitable rating to every attribute by observing its impact on alternative and the ratings values must be in the form of 2TLmF numbers. The developed 2TLmF-TOPSIS method is used to evaluate the most desirable alternative which is closest to the positive ideal solution (PIS) and farthest from negative ideal solution (NIS). Let ϝ={ϝ1,ϝ2,,ϝk} be the set of alternatives against the 2TLmF information from which the best one is selected based on some attributes denoted as, ζ={ζ1,ζ2,,ζt}. let q, (q=1,2,,m) be the number of poles according to m characteristics and (cϕq(x),ϱq(x)), q=1,2,,m be the number of membership values to each pole. The weight vector for attributes is represented as, φ={φ1,φ2,,φt}, where φ[0,1] and Σtp=1φp=1. The main ambition is the evaluation of most desirable alternative as the solution of this MAGDM problem. We present the proposed 2TLmF-TOPSIS method step by step as follows:

    Step 1: In this step, a group of experts are responsible for assessing 2TLm-polar fuzzy information of k distinct alternatives, and the appropriate ratings of alternatives are determined according to all experts that are evaluated in terms of m various qualities. Tabular depiction of 2TLmF decision matrix, Z(u)=(z(u)ij)k×t=((c(u)ϕij1,ϱij(u)1),(c(u)ϕij2,ϱij(u)2),,(c(u)ϕijm,ϱij(u)m))k×t, of predicted ratings under the group of u decision-makers according to their choice is given below:

    Step 2: The weight vector for DMs denoted as ϖ={ϖ1,ϖ1,,ϖv}, depending on their importance and weight vector satisfying ϖu[0,1], vu=1ϖu=1. By utilizing the group decision making given in matrix, Z(u) we drive the aggregated 2TLmF decision matrix Z=(zij)k×t=((cϕij1,ϱij1),(cϕij2,ϱij2),,(cϕijm,ϱijm))k×t, by using 2TLmF weighted average operator (2TLmFWA)defined as

    zij=2TLmFWAϖ(z(1)ij,z(2)ij,,z(v)ij),=ϖ1z(1)ijϖ2z(2)ijϖnz(v)ij,=(Λ(σ(1vu=1(1Λ1   (c(u)ϕ  ij1  ,ϱij(u)1)σ)ϖu)),Λ(σ(1vu=1(1Λ1   (c(u)ϕ  ij2  ,ϱij2  )σ)ϖu)),,Λ(σ(1vu=1(1Λ1   (c(u)ϕ  ijm  ,ϱijm  )σ)ϖu))).

    The aggregated 2TLmF decision matrix which obtained by using the 2TLmFWA operator can be displayed as:

    Step 3: All of the attributes may not be equally significant. The decision-makers assigned the weights to each attribute based on their relevance for the alternatives. Let φ={φ1,φ2,,φt}, be the weight vector for attributes, it must satisfy the normality condition as, Σtp=1φp=1 where φ[0,1].

    Step 4: Compute the aggregated weighted 2TLmF decision matrix.

    ˆZ=(ˆzij)k×t=((ˆcϕij1,ˆϱij1),(ˆcϕij2,ˆϱij2),,(ˆcϕijm,ˆϱijm))k×t,

    where,

    ^zij=zijφp,=(Λ(σ(1(1Λ1(cϕij1,ϱij1)σ)φ1)),,Λ(σ(1(1Λ1(cϕijm,ϱijm)σ)φn))),φp>0,p=1,2,,t.

    The 2TLmF aggregated weighted decision matrix can be evaluated as

    Step 5: Calculate the 2TLmF positive ideal solution (2TLmFPIS) and 2TLmF negative ideal solution (2TLmFNIS) as

    2TLmFPIS=((ˆcϕij1,ˆϱij1)+,(ˆcϕij2,ˆϱij2)+,,(ˆcϕijm,ˆϱijm)+),={(maxi(ˆcϕijq,ˆϱijq)|jI),(mini(ˆcϕijq,ˆϱijq)|jJ)|i=1,2,,k},q=1,2,,m

    and

    2TLmFNIS=((ˆcϕij1,ˆϱij1),(ˆcϕij2,ˆϱij2),,(ˆcϕijm,ˆϱijm)),={(mini(ˆcϕijq,ˆϱijq)|jI),(maxi(ˆcϕijq,ˆϱijq)|jJ)|i=1,2,,k},q=1,2,,m

    where I and J are the benefit and cost criterions respectively.

    Step 6: Compute the separation of each alternative lk, (i=1,2,,k) from 2TLmFPIS and 2TLmFNIS, respectively, by using normalized Euclidean distance formula given as follows:

    ˆD(li,2TLmFPIS)=1mttj=1[(Λ1(cϕij1,ϱij1)σΛ1(ˆcϕij1,ˆϱij1)+σ)2++(Λ1(cϕijm,ϱijm)σΛ1(ˆcϕijm,ˆϱijm)+σ)2],

    ˆD(li,2TLmFNIS)=1mttj=1[(Λ1(cϕij1,ϱij1)σΛ1(ˆcϕij1,ˆϱij1)σ)2++(Λ1(cϕijm,ϱijm)σΛ1(ˆcϕijm,ˆϱijm)σ)2].

    Step 7: Compute the relative 2TLmF closeness index of each alternative which is defined as

    ˆEi=ˆD(li,2TLmFNIS)ˆD(li,2TLmFPIS)+ˆD(li,2TLmFNIS), i=1,2,,k.

    Step 8: Rank the objects based on their index values. The alternative which have the highest 2TLmF closeness index will be the desired alternative.

    In this section, we apply the 2TLmF-TOPSIS method to select the meritable manager for the project of highway construction and best textile industry which, transparently elaborate the proposed model.

    Construction project management needs varieties of skills including the ability to interface with a diverse range of agencies and groups of people to lead the project from idea to building. A manager needs to follow the management principles during each phase of management and plays a crucial role to make project planning, coordination, budgeting, and supervision of the construction project. Construction planning is a challenging task in the management of projects. As the manager supervises the project from an initial and makes decisions to define, the bidding process, contractor selection, and project delivery method. Highway construction project managers are responsible for all aspects related to building materials. They must look with engineers and architects to develop plans, especially determining labor and material cost also, responsible for ensuring the project must complete within budget and on time. Generally, project management is the resources management over the life cycle of a project through different tools and methodologies to control cost, time and quality, etc. The main objective is to develop a systematic method for identifying the best among the candidates in the process of construction project manager selection. Let ϝ={ϝ1,ϝ2,ϝ3,ϝ4,ϝ5,ϝ6} be the set of managers as an alternatives. The proposed work is examined by using a case study in a project-based organization for selecting the most suitable project construction manager, in which six candidates under four different criteria ζ={ζ1,ζ2,ζ3,ζ4} are evaluated and prioritized by decision-makers, ={1,2,3} with weight vector ϖ={0.3571,0.3455,0.2974}. The hired experts express their assessments using linguistic terms as, = {c0 = extremely poor, c1 = very poor, c2 = poor, c3 = fair, c4 = good, c5 = very good, c6 = extremely good}. However, if we continue to use these linguistic terms, we may end up using the same linguistic term for various alternatives, making it impossible to rank the options to draw conclusions. Therefore, we solve this problem using zero-symbol translation, which transforms linguistic term data into 2TL data and allows us to rank alternatives based on symbol translation. The decision-maker select the best one manager under the following criteria:

    ζ1: Basic requirements.

    ζ2: Management Skills.

    ζ3: Project management skills.

    ζ4:Interpersonal skills.

    Each criterion has been divided into four components to form a 2TL4-polar fuzzy set.

    Basic requirements: To select the best manager for a construction project, the decision-makers must have a look at the basic needs for project management. Thus to make the 2TL4-polar fuzzy set, we consider four factors of basic requirements as qualification, experience, communication skills, and computer skills.

    Management skills: Construction management is a complex issue, so deal with management skills involve the allocation of resources, cost management, risk management, and human resources. Here we take the four factors of management skills as time management, budget management, resources management, and Quality management.

    Project management skills: From the initial phase of the project, it is the responsibility of the project manager to plan the entire process. staffing, creating benchmarks is the essential duty of the project manager. It is used to evaluate and regulate project health. To make a 2TL4-polar fuzzy set we consider four characteristics of Project management skills like planning, organizing, controlling, and monitoring progress

    Interpersonal skills: Interpersonal skills play a crucial role in project management skills. The manager can eye on their team and address the issues that might arise. Take four factors as problem-solving, decision-making, team development, and leadership skills. The subdivision of criterion is elaborated in Figure 1.

    Figure 1.  Representation of criterion subdivision for 2TL4-polar fuzzy set.

    We apply our proposed 2TLmF-TOPSIS method to solve MAGDM problem.

    (1) The 2TLmF preference ratings of decision makers 1, 2 and 3 are arranged in Tables 1, 2 and 3, respectively.

    Table 1.  2TL4F decision matrix provided by first expert 1.
    Alternatives Ç1 Ç2 Ç3 Ç4
    ϝ1 ((c4,0),(c2,0),(c3,0),(c4,0)) ((c4,0),(c3,0),(c4,0),(c5,0)) ((c3,0),(c5,0),(c5,0),(s4,0)) ((c4,0),(c3,0),(c3,0),(c4,0))
    ϝ2 ((c4,0),(c5,0),(c5,0),(c4,0)) ((c5,0),(c4,0),(c5,0),(c4,0)) ((c4,0),(c5,0),(c5,0),(c4,0)) ((c5,0),(c6,0),(c4,0),(c3,0))
    ϝ3 ((c5,0),(c6,0),(c5,0),(c5,0)) ((c5,0),(c5,0),(c6,0),(c4,0)) ((c4,0),(c5,0),(c5,0),(c5,0)) ((c6,0),(c5,0),(c6,0),(c5,0))
    ϝ4 ((c4,0),(c3,0),(c5,0),(c3,0)) ((c3,0),(c5,0),(c4,0),(c4,0)) ((c5,0),(c2,0),(c3,0),(c5,0)) ((c3,0),(c4,0),(c4,0),(c4,0))
    ϝ5 ((c4,0),(c3,0),(c3,0),(c3,0)) ((c4,0),(c3,0),(c4,0),(c3,0)) ((c3,0),(c4,0),(c3,0),(c4,0)) ((c4,0),(c3,0),(c4,0),(c4,0))
    ϝ6 ((c5,0),(c5,0),(c6,0),(c5,0)) ((c3,0),(c4,0),(c5,0),(c4,0)) ((c6,0),(c4,0),(c5,0),(c5,0)) ((c6,0),(c5,0),(c6,0),(c5,0))

     | Show Table
    DownLoad: CSV
    Table 2.  2TL4F decision matrix provided by second expert 2.
    Alternatives Ç1 Ç2 Ç3 Ç4
    ϝ1 ((c4,0),(c4,0),(c3,0),(c4,0)) ((c4,0),(c3,0),(c5,0),(c4,0)) ((c3,0),(c4,0),(c5,0),(s5,0)) ((c4,0),(c3,0),(c4,0),(c3,0))
    ϝ2 ((c5,0),(c4,0),(c5,0),(c4,0)) ((c4,0),(c5,0),(c4,0),(c5,0)) ((c4,0),(c5,0),(c4,0),(c5,0)) ((c4,0),(c5,0),(c5,0),(c4,0))
    ϝ3 ((c5,0),(c6,0),(c5,0),(c5,0)) ((c5,0),(c4,0),(c6,0),(c4,0)) ((c5,0),(c6,0),(c5,0),(c6,0)) ((c5,0),(c6,0),(c5,0),(c5,0))
    ϝ4 ((c4,0),(c5,0),(c4,0),(c3,0)) ((c4,0),(c5,0),(c5,0),(c4,0)) ((c4,0),(c3,0),(c4,0),(c3,0)) ((c4,0),(c3,0),(c4,0),(c4,0))
    ϝ5 ((c3,0),(c4,0),(c3,0),(c5,0)) ((c5,0),(c4,0),(c3,0),(c4,0)) ((c4,0),(c5,0),(c4,0),(c5,0)) ((c3,0),(c4,0),(c3,0),(c5,0))
    ϝ6 ((c6,0),(c4,0),(c6,0),(c5,0)) ((c4,0),(c5,0),(c4,0),(c3,0)) ((c6,0),(c5,0),(c5,0),(c6,0)) ((c6,0),(c5,0),(c4,0),(c6,0))

     | Show Table
    DownLoad: CSV
    Table 3.  2TL4F decision matrix provided by third expert 3.
    Alternatives Ç1 Ç2 Ç3 Ç4
    ϝ1 ((c5,0),(c3,0),(c4,0),(c3,0)) ((c4,0),(c3,0),(c4,0),(c4,0)) ((c3,0),(c5,0),(c5,0),(s5,0)) ((c4,0),(c3,0),(c5,0),(c4,0))
    ϝ2 ((c4,0),(c5,0),(c4,0),(c4,0)) ((c5,0),(c4,0),(c5,0),(c5,0)) ((c4,0),(c4,0),(c5,0),(c6,0)) ((c3,0),(c5,0),(c3,0),(c4,0))
    ϝ3 ((c5,0),(c6,0),(c5,0),(c4,0)) ((c4,0),(c5,0),(c6,0),(c5,0)) ((c4,0),(c6,0),(c5,0),(c6,0)) ((c4,0),(c5,0),(c6,0),(c5,0))
    ϝ4 ((c4,0),(c3,0),(c3,0),(c5,0)) ((c5,0),(c4,0),(c4,0),(c3,0)) ((c4,0),(c3,0),(c4,0),(c3,0)) ((c4,0),(c3,0),(c3,0),(c5,0))
    ϝ5 ((c4,0),(c3,0),(c4,0),(c5,0)) ((c4,0),(c3,0),(c3,0),(c4,0)) ((c3,0),(c4,0),(c4,0),(c5,0)) ((c3,0),(c4,0),(c4,0),(c5,0))
    ϝ6 ((c6,0),(c4,0),(c5,0),(c6,0)) ((c4,0),(c5,0),(c5,0),(c5,0)) ((c6,0),(c5,0),(c6,0),(c5,0)) ((c6,0),(c4,0),(c5,0),(c6,0))

     | Show Table
    DownLoad: CSV

    (2) The aggregated 2TL4F decision matrix as given in Table 4.

    Table 4.  Aggregated 2TL4-polar decision matrix by using 2TLmFWA operator.
    Alternatives Ç1 Ç2
    ϝ1 ((c4,0.37256),(c3,0.11000),(c3,0.34079),(c4,0.2563)) ((c4,0.00000),(c3,0.00000),(c4,0.42592),(c4,0.43853))
    ϝ2 ((c4,0.42592),(c5,0.2705),(c5,0.2289),(c4,0.00000)) ((c5,0.2705),(c4,0.42592),(c5,0.2705),(c5,0.2808))
    ϝ3 ((c5,0.00000),(c6,0.00001),(c5,0.00000),(c5,0.2289)) ((c5,0.2289),(c5,0.2705),(c6,0.00000),(c4,0.37256))
    ϝ4 ((c4,0.00000),(c4,0.0524),(c4,0.23842),(c4,0.1638)) ((c4,0.11901),(c5,0.2289),(c4,0.42592),(c4,0.2563))
    ϝ5 ((c4,0.3007),(c3,0.39215),(c3,0.34079),(c5,0.00000)) ((c4,0.42592),(c3,0.39215),(c3,0.40439),(c4,0.3115))
    ϝ6 ((c6,0.00000),(c4,0.43853),(c6,0.00000),(c6,0.00000)) ((c4,0.3115),(c5,0.2808),(c5,0.2705),(c4,0.12783))
    Alternatives Ç3 Ç4
    ϝ1 ((c3,0.00000),(c5,0.2705),(c5,0.00000),(c5,0.2808)) ((c4,0.00000),(c3,0.00000),(c4,0.11901),(c4,0.3007))
    ϝ2 ((c4,0.00000),(c5,0.22892),(c5,0.2705),(c6,0.00000)) ((c4,0.23842),(c6,0.00000),(c4,0.22420),(c4,0.3115))
    ϝ3 ((c4,0.42592),(c6,0.00000),(c5,0.00001),(c6,0.00000)) ((c6,0.00001),(c6,0.00000),(c6,0.00000),(c5,0.00000))
    ϝ4 ((c4,0.43853),(c3,0.3245),(c4,0.3115),(c4,0.0264)) ((c4,0.3115),(c3,0.40439),(c4,0.2563),(c4,0.37256))
    ϝ5 ((c3,0.39215),(c4,0.39215),(c4,0.3115),(c5,0.2808)) ((c3,0.00000),(c4,0.00000),(c3,0.34079),(c5,0.2808))
    ϝ6 ((c6,0.00000),(c5,0.2808),(c6,0.00000),(c6,0.00000)) ((c6,0.00000),(c5,0.2289),(c6,0.00000),(c6,0.00000))

     | Show Table
    DownLoad: CSV

    (3) Suppose the decision makers assign the following weights to the each attribute.

    φ = (φ1, φ2, φ3, φ4) = (0.3, 0.2, 0.4, 0.1).

    (4) The aggregated weighted 2TL4F decision matrix as given in Table 5.

    Table 5.  Aggregated weighted 2TL4-polar decision matrix.
    Alternatives Ç1 Ç2
    ϝ1 ((c2,0.05655),(c1,0.18079),(c1,0.29963),(c2,0.47430)) ((c1,0.18355),(c1,0.22330),(c1,0.40880),(c1,0.41618))
    ϝ2 ((c2,0.01617),(c2,0.23376),(c2,0.27124),(c2,0.31533)) ((c2,0.39867),(c1,0.40880),(c2,0.3986),(c2,0.40575))
    ϝ3 ((c2,0.49485),(c6,0.00000),(c2,0.494851),(c2,0.271240)) ((c2,0.36944),(c2,0.39867),(c6,0.00000),(c1,0.37808))
    ϝ4 ((c2,0.3153),(c2,0.3489),(c2,0.15409),(c2,0.41848)) ((c1,0.24228),(c2,0.36944),(c1,0.40880),(c1,0.06597))
    ϝ5 ((c1,0.499431),(c1,0.32705),(c1,0.29963),(c2,0.49485)) ((c1,0.40880),(c1,0.07898),(c1,0.07421),(c1,0.04203))
    ϝ6 ((c6,0.00000),(c2,0.006501),(c6,0.00000),(c6,0.00000)) ((c1,0.04203),(c2,0.40575),(c2,0.39867),(c1,0.24676))
    Alternatives Ç3 Ç4
    ϝ1 ((c1,0.45285),(c3,0.22472),(c3,0.06984),(c3,0.23511)) ((c1,0.37575),(c0,0.40180),(c1,0.34287),(c1,0.45158))
    ϝ2 ((c2,0.13363),(c3,0.18200),(c3,0.22472),(c6,0.00000)) ((c1,0.30794),(c6,0.00000),(c1,0.31221),(c1,0.45415))
    ϝ3 ((c2,0.486812),(c6,0.00000),(c3,0.06984),(c6,0.00000)) ((c6,0.00000),(c6,0.00001),(c6,0.00000),(c1,0.01575))
    ϝ4 ((c2,0.48681),(c6,0.00000),(c3,0.069841),(c6,0.00000)) ((c6,0.00000),(c6,0.00001),(c6,0.00000),(c1,0.01575))
    ϝ5 ((c2,0.29935),(c2,0.48681),(c2,0.0969),(c3,0.2351)) ((c0,0.40180),(c1,0.37575),(c0,0.4689),(c1,0.14145))
    ϝ6 ((c6,0.00000),(c3,0.23511),(c6,0.00000),(c6,0.00000)) ((c6,0.00000),(c1,0.12022),(c6,0.00000),(c6,0.00000))

     | Show Table
    DownLoad: CSV

    (6) The 2TL4F positive ideal solution (2TL4FPIS) is given as

    2TL4FPIS={((c6,0.00000),(c6,0.00000),(c6,0.00000),(c6,0.00000)),((c2,0.3694),(c2,0.3694),(c6,0.0000),(c2,0.4057)),((c6,0.00000),(c6,0.00000),(c6,0.00000),(c6,0.00000)),((c6,0.0000),(c6,0.00000),(c6,0.0000),(c6,0.00000))}.

    (7) The 2TL4F negative ideal colution (2TL4FNIS) is given below:

    2TL4FNIc={((c1,0.49943),(c1,0.18079),(c1,0.29963),(c2,0.47430)),((c1,0.04203),(c1,0.22330),(c1,0.07421),(c1,0.04203)),((c1,0.45285),(c1,0.26210),(c2,0.09690),(c2,0.11324)),((c0,0.40180),(c0,0.40180),(c0,0.46890),(c1,0.45415))}.

    (8) The 2TL4F distances of each alternatives from 2TL4FPIS and 2TL4FNIS are given in Table 6.

    Table 6.  2TL4F distances of alternatives from 2TL4FPIS and 2TL4FNIS.
    2TL4FPIS 2TL4FNIS
    ˆD(f1,2TL4FPIS)=0.687770 ˆD(f1,2TL4FNIS)=0.090819
    ˆD(f2,2TL4FPIS)=0.594904 ˆD(f2,2TL4FNIS)=0.306214
    ˆD(f3,2TL4FPIS)=0.383263 ˆD(f3,2TL4FNIS)=0.569076
    ˆD(f4,2TL4FPIS)=0.697161 ˆD(f4,2TL4FNIS)=0.068759
    ˆD(f5,2TL4FPIS)=0.695246 ˆD(f5,2TL4FNIS)=0.075106
    ˆD(f6,2TL4FPIS)=0.354904 ˆD(f6,2TL4FNIS)=0.605143

     | Show Table
    DownLoad: CSV

    (9) Relative 2TL4F closeness coefficients are given in Table 7.

    Table 7.  Relative closeness index.
    ˆEi Closeness index values
    ˆE1 0.116646
    ˆE2 0.339816
    ˆE3 0.597555
    ˆE4 0.089773
    ˆE5 0.097496
    ˆE6 0.630326

     | Show Table
    DownLoad: CSV

    (10) Ranking of objects based on their index values.

    ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4.

    Thus, ϝ6 is a best alternative.

    The industry is considered as the fundamental element for the economic development of any country, especially the textile industry contributes significantly to the country gross domestic products (GDP's), exports as well as employment. The textile industry is concerned, with the design, production, and distribution of yarn and clothing. It is the largest manufacturing industry, in fact the backbone of Pakistan's economy. In 1947, there were only 6 spinning factories in Pakistan, which have now grown to figure 503. Pakistan is the world's fourth-largest cotton grower, with the third-largest spinning capacity in Asia after China and India, 5 percent of worldwide spinning capacity, and the eighth-largest exporter of textile products. There are currently 1,221 ginning units, 442 spinning units, 124 big spinning units, and 425 small spinning units manufacturing textiles. This sector generates 9.5 percent of GDP and employs around 15 million people or roughly 30 percent of the country's 49 million workers. The development of a textile industry that makes full use of Pakistan's enormous cotton resources has been a priority area for the industrialization of Pakistan, which was formerly one of the world's leading producers of cotton. The main ambition is to develop a systematic scheme for identifying the best textile industry by using the proposed approach. Let L={L1,L2,L3,L4,L5,L6} be the set of alternatives as an textile industries. The decision-makers, ={1,2,3} with weight vector ˘ω={0.391,0.362,0.247} express their assessments using linguistic terms as, ˆ = {0 = very un-preferable, 1 = un-preferable, 2 = medium un-preferable, 3 = medium, 4 = medium preferable, 5 = preferable, 6 = very preferable, 7 = very very preferable, 8 = extremely preferable}.

    The decision-maker select the best textile industry under the following criterion:

    T1: Financial Condition and Performance,

    T2: Industrial Information,

    T3: ESG Unification.

    Each criterion has been divided into six components to form a 2TL6-polar fuzzy set.

    Financial condition and performance: The high financial performance is attractive for investors. Financial analysis not only helps you to understand your company's financial conditions, helping you to understand its creditworthiness, profitability, and ability to generate wealth but will also provide you with a more in-depth look at how well it operates internally. It plays a crucial role to evaluate economic trends and setting financial policies to build long-term plans for business activity. Financial reporting and taxation frameworks apply to textile companies like other sectors. These include budgeting and forecasting, financing, and treasury options. To make a 2TL6-polar fuzzy set we take Gross profit margin, net profit margin, inventory turnover, return on assets, return on equity, debt-to-equity ratio.

    Industrial information: In the evaluation of industrial development, industrial development information is an important factor. we take six factors of industrial information as industrial history, innovation capability, availability of resources or technology options, service offering, fabric care or fabric selection, new sustainable policies.

    ESG unification: The ESG integration is the collection of economic, social, and governmental factors which plays pivotal role for the industrial burgeoning. To make a 2TL6-polar fuzzy set, we consider six factors of ESG as energy-efficient designs, pollution prevention, regulatory standards, renewable energy sources, waste treatment and hazardous engineering processes.The subdivision of criterion is elaborated in Figure 2.

    Figure 2.  Representation of criterion subdivision for 2TL6F set.

    (1) The 2TLmF preference ratings of decision makers 1, 2 and 3 are arranged in Tables 8, 9 and 10, respectively.

    Table 8.  2TL6F decision matrix provided by first expert 1.
    Alternatives T1 T2 T3
    L1 ((4,0),(4,0),(5,0),(4,0),(5,0),(4,0)) ((3,0),(4,0),(5,0),(6,0),(5,0),(6,0)) ((5,0),(4,0),(5,0),(3,0),(5,0),(4,0))
    L2 ((5,0),(6,0),(4,0),(5,0),(7,0),(6,0)) ((4,0),(5,0),(4,0),(6,0),(5,0),(7,0)) ((6,0),(5,0),(7,0),(5,0),(7,0),(6,0))
    L3 ((4,0),(2,0),(5,0),(4,0),(3,0),(5,0)) ((2,0),(4,0),(5,0),(3,0),(5,0),(3,0)) ((4,0),(3,0),(5,0),(4,0),(3,0),(5,0))
    L4 ((5,0),(7,0),(4,0),(5,0),(4,0),(7,0)) ((5,0),(4,0),(6,0),(8,0),(4,0),(5,0)) ((7,0),(5,0),(4,0),(6,0),(5,0),(6,0))
    L5 ((5,0),(6,0),(5,0),(4,0),(4,0),(5,0)) ((5,0),(6,0),(4,0),(5,0),(5,0),(4,0)) ((6,0),(7,0),(6,0),(5,0),(6,0),(5,0))
    L6 ((5,0),(5,0),(6,0),(7,0),(5,0),(6,0)) ((5,0),(6,0),(5,0),(4,0),(6,0),(7,0)) ((6,0),(5,0),(5,0),(6,0),(7,0),(6,0))

     | Show Table
    DownLoad: CSV
    Table 9.  2TL6F decision matrix provided by second expert 2.
    Alternatives T1 T2 T3
    L1 ((4,0),(3,0),(5,0),(4,0),(5,0),(4,0)) ((3,0),(5,0),(5,0),(6,0),(6,0),(5,0)) ((5,0),(4,0),(5,0),(3,0),(6,0),(4,0))
    L2 ((5,0),(6,0),(5,0),(4,0),(7,0),(5,0)) ((5,0),(4,0),(5,0),(6,0),(5,0),(5,0)) ((6,0),(4,0),(7,0),(5,0),(6,0),(7,0))
    L3 ((4,0),(5,0),(3,0),(4,0),(5,0),(4,0)) ((3,0),(5,0),(4,0),(3,0),(5,0),(3,0)) ((4,0),(3,0),(5,0),(4,0),(3,0),(3,0))
    L4 ((4,0),(5,0),(6,0),(5,0),(5,0),(7,0)) ((5,0),(7,0),(6,0),(8,0),(4,0),(5,0)) ((6,0),(5,0),(7,0),(6,0),(5,0),(5,0))
    L5 ((6,0),(5,0),(5,0),(4,0),(5,0),(6,0)) ((4,0),(6,0),(4,0),(7,0),(6,0),(5,0)) ((6,0),(7,0),(6,0),(5,0),(7,0),(6,0))
    L6 ((6,0),(7,0),(5,0),(4,0),(6,0),(7,0)) ((5,0),(6,0),(5,0),(7,0),(6,0),(7,0)) ((5,0),(4,0),(5,0),(6,0),(5,0),(4,0))

     | Show Table
    DownLoad: CSV
    Table 10.  2TL6F decision matrix provided by third expert 3.
    Alternatives T1 T2 T3
    L1 ((3,0),(4,0),(5,0),(3,0),(5,0),(5,0)) ((4,0),(5,0),(4,0),(5,0),(5,0),(6,0)) ((5,0),(6,0),(5,0),(4,0),(3,0),(5,0))
    L2 ((6,0),(5,0),(6,0),(4,0),(6,0),(4,0)) ((4,0),(5,0),(6,0),(5,0),(6,0),(5,0)) ((6,0),(5,0),(6,0),(6,0),(5,0),(7,0))
    L3 ((5,0),(4,0),(3,0),(6,0),(4,0),(7,0)) ((2,0),(6,0),(4,0),(6,0),(7,0),(6,0)) ((6,0),(4,0),(3,0),(5,0),(6,0),(5,0))
    L4 ((7,0),(5,0),(6,0),(4,0),(5,0),(4,0)) ((6,0),(7,0),(5,0),(4,0),(5,0),(5,0)) ((5,0),(7,0),(5,0),(6,0),(5,0),(7,0))
    L5 ((4,0),(5,0),(4,0),(5,0),(4,0),(6,0)) ((5,0),(6,0),(7,0),(6,0),(5,0),(4,0)) ((4,0),(6,0),(5,0),(6,0),(5,0),(6,0))
    L6 ((5,0),(4,0),(5,0),(4,0),(5,0),(7,0)) ((5,0),(6,0),(5,0),(4,0),(5,0),(6,0)) ((5,0),(6,0),(5,0),(7,0),(5,0),(4,0))

     | Show Table
    DownLoad: CSV

    (2) The aggregated 2TL6F decision matrix by using 2TLmFWA operator as given in Table 11.

    Table 11.  Aggregated 2TL6-polar decision matrix.
    Alternatives T1
    L1 ((4,0.226654),(4,0.336520),(5,0.000000),(4,0.226654),(5,0.000000),(4,0.274366))
    L2 ((5,0.285894),(6,0.210673),(5,0.037230),(4,0.425552),(7,0.186736),(5,0.251286))
    L3 ((4,0.274366),(4,0.223610),(4,0.094747),(5,0.370587),(4,0.066999),(5,0.461950))
    L4 ((5,0.461950),(6,0.047608),(5,0.377395),(5,0.220928),(5,0.357162),(7,0.408344))
    L5 ((5,0.218775),(5,0.439825),(5,0.220928),(4,0.274366),(4,0.395606),(6,0.3435901))
    L6 ((5,0.409544),(6,0.164029),(5,0.439825),(6,0.326240),(5,0.409544),(7,0.311302))
    Alternatives T2
    L1 ((3,0.268125),(5,0.357162),(5,0.220928),(6,0.210673),(5,0.409544),(6,0.316194))
    L2 ((4,0.395606),(5,0.329270),(5,0.037230),(6,0.210673),(5,0.285894),(6,0.047608))
    L3 ((2,0.383217),(5,0.037230),(4,0.425552),(4,0.012700),(6,0.287032),(4,0.012700))
    L4 ((5,0.2858941),(6,0.2804870),(6,0.210673),(8,0.000000),(4,0.274366),(5,0.000000))
    L5 ((5,0.3292700),(6,0.000000),(5,0.1597852),(6,0.1764870),(5,0.409544),(4,0.395606))
    L6 ((5,0.000000),(6,0.000000),(5,0.000000),(6,0.421666),(6,0.210673),(7,0.186736))
    Alternatives T3
    L1 ((5,0.000000),(5,0.370587),(5,0.000000),(3,0.268125),(5,0.061180),(4,0.274366))
    L2 ((6,0.0000),(5,0.329270),(7,0.186736),(6,0.343590),(6,0.047608),(7,0.311302))
    L3 ((5,0.370587),(3,0.268125),(5,0.403438),(4,0.274366),(4,0.012700),(4,0.390637))
    L4 ((6,0.314138),(6,0.287032),(6,0.255560),(6,0.000000),(5,0.000000),(6,0.048266))
    L5 ((6,0.373473),(7,0.186736),(6,0.210673),(5,0.28589),(6,0.279907),(6,0.34359))
    L6 ((5,0.439825),(5,0.011997),(5,0.000000),(6,0.314706),(6,0.047608),(5,0.050403))

     | Show Table
    DownLoad: CSV

    (3) Suppose the decision makers assign the following weights to the each attribute.

    = (1, 2, 3) = (0.421, 0.234, 0.345).

    (4) The aggregated weighted 2TL6F decision matrix as given in Table 12.

    Table 12.  Aggregated weighted 2TL6-polar decision matrix.
    Alternatives T1
    L1 ((2,0.115524),(2,0.18195),(3,0.293673),(2,0.115524),(3,0.293673),(2,0.20084))
    L2 ((3,0.075115),(3,0.344847),(3,0.321232),(2,0.301112),(4,0.417449),(3,0.102260))
    L3 ((2,0.200849),(2,0.113670),(2,0.034436),(2,0.440277),(2,0.067088),(3,0.066175))
    L4 ((3,0.066175),(4,0.417918),(3,0.002367),(3,0.454427),(2,0.449610),(4,0.149691))
    L5 ((3,0.127580),(3,0.048114),(3,0.454427),(2,0.200849),(2,0.281061),(3,0.229001))
    L6 ((3,0.023540),(3,0.386453),(3,0.048114),(3,0.0481141),(3,0.0235401),(4,0.26369810))
    Alternatives T2
    L1 ((1,0.074971),(1,0.471033),(2,0.465982),(2,0.079128),(2,0.144647),(2,0.014171))
    L2 ((1,0.361565),(1,0.483766),(2,0.377738),(2,0.079128),(2,0.212059),(2,0.248785))
    L3 ((1,0.364563),(2,0.377738),(1,0.425552),(1,0.202866),(2,0.031892),(1,0.202866))
    L4 ((2,0.212059),(2,0.417203),(2,0.079128),(8,0.00000),(1,0.309974),(2,0.35935810))
    L5 ((1,0.483766),(2,0.216270),(2,0.278430),(2,0.339958),(2,0.144647),(1,0.361565))
    L6 ((2,0.359358),(2,0.216270),(2,0.359358),(2,0.048527),(2,0.07912),(3,0.11877))
    Alternatives T3
    L1 ((2,0.296640),(2,0.062790),(2,0.296640),(1,0.325628),(2,0.3370380),(2,0.1459351))
    L2 ((3,0.041169),(2,0.088000),(4,0.141676),(3,0.237609),(3,0.082215),(4,0.286781))
    L3 ((2,0.062790),(1,0.325628),(2,0.042890),(2,0.145935),(2,0.291556),(2,0.079074))
    L4 ((3,0.325044),(3,0.193652),(3,0.168883),(3,0.041169),(2,0.296640),(3,0.082786))
    L5 ((3,0.26055),(4,0.141676),(3,0.133161),(2,0.490335),(3,0.29251),(3,0.237609))
    L6 ((3,0.399790),(2,0.2887811),(2,0.296640),(3,0.3255870),(3,0.082215),(2,0.263761))

     | Show Table
    DownLoad: CSV

    (5) The 2TL6F positive ideal solution (2TL6FPIS) is given as

    2TL6FPIS={((3,0.066175),(4,0.417918),(3,0.048114),(3,0.243903),(4,0.417449),(4,0.263698)),((2,0.212059),(2,0.417203),(2,0.079128),(8,0.000000),(2,0.079128),(3,0.118772)),((3,0.325044),(4,0.141676),(4,0.141676),(3,0.325587),(3,0.292511),(4,0.286781))}.

    (6) The 2TL6F negative ideal solution (2TL6FNIS) is

    2TL6FNIS={((2,0.115524),(2,0.181952),(2,0.034436),(2,0.115524),(2,0.067088),(2,0.200849)),((1,0.364563),(1,0.471033),(1,0.374512),(1,0.202866),(1,0.309974),(1,0.202866)),((2,0.062790),(1,0.325628),(2,0.042890),(1,0.325628),(2,0.291556),(2,0.145935))}.

    (7) The 2TL6F distances of each alternatives from 2TL6FPIS and 2TL6FNIS are given in Table 13.

    Table 13.  2TL6F distances of alternatives from 2TL6FPIS and 2TL6FNIS.
    2TL6FPIS 2TL6FNIS
    ˆD(l1,2TL6FPIS)=0.240336 ˆD(l1,2TL6FNIS)=0.057793
    ˆD(l2,2TL6FPIS)=0.193977 ˆD(l2,2TL6FNIS)=0.147393
    ˆD(l3,2TL6FPIS)=0.268528 ˆD(l3,2TL6FNIS)=0.041564
    ˆD(l4,2TL6FPIS)=0.093810 ˆD(l4,2TL6FNIS)=0.243444
    ˆD(l5,2TL6FPIS)=0.197382 ˆD(l5,2TL6FNIS)=0.129373
    ˆD(l6,2TL6FPIS)=0.200682 ˆD(l6,2TL6FNIS)=0.146986

     | Show Table
    DownLoad: CSV

    (8) Relative 2TL6F closeness coefficients are given in Table 14.

    Table 14.  Relative closeness index.
    ˆEi Closeness index values
    ˆE1 0.193852
    ˆE2 0.431768
    ˆE3 0.134039
    ˆE4 0.721839
    ˆE5 0.395933
    ˆE6 0.422776

     | Show Table
    DownLoad: CSV

    (9) Ranking of objects based on their index values.

    L4>L2>L6>L5>L1>L3.

    Thus, L4 is a best alternative.

    In this section, we develop another mathematical technique, to deal with multi-attribute group decision making (MAGDM), namely, the 2TLmF ELECTRE-I approach comprising 2TLmF information. In this approach, a group of experts is selected to choose the best alternative. Each expert (u, u = 1, 2, , v) has the right of assigning the 2TLmF number to each alternative with respect to criteria. Let ϝ={ϝ1,ϝ2,,ϝk} be the set of alternatives against the 2TLmF information from which the best one is selected based on some attributes denoted as, ζ={ζ1,ζ2,,ζt}. Let q, (q=1,2,,m) be the number of poles according to m characteristics and (cϕq(x),ϱq(x)), q=1,2,,m be the number of membership values to each pole. The weight vector for attributes is represented by, φ={φ1,φ2,,φt}, where φ[0,1], the weights are given by the experts must satisfy the normality condition as, Σtj=1φj=1.

    The main target is the selection of the most desirable alternative as the solution to this MAGDM problem. We describe the 2TLmF ELECTRE-1 method step by step as follows.

    In 2TLmF ELECTRE-1 method, (Step 1–Step 4) are same as in 2TLmF-TOPSIS method, already described in Section 3.

    Step 5: The core concept behind the ELECTRE-1 method is to compare the distinct alternatives in pairs, the 2TLmFNs are compared by using the score and accuracy function. In case when two alternatives have the same score function, than we calculate accuracy function. The 2TLmF concordance sets are constructed as defined below:

    Mrs={1jk:(ˆcϕrjq,ˆϱrjq)(ˆcϕsjq,ˆϱsjq);rs;r,s=1,2,,k},q=1,2,,m

    where,

    (ˆcϕijq,ˆϱijq)=Λ(σm(Λ1(cϕ1ij,ϱ1ij)σ+Λ1(cϕ2ij,ϱ2ij)σ++Λ1(cϕ2ij,ϱ2ij)ϱ)).

    Step 6: The 2TLmF discordance sets are the complementary subsets of 2TLmF concordance sets. The 2TLmF discordance sets are constructed as

    Nrs={1jk:(ˆcϕrjq,ˆϱrjq)(ˆcϕsjq,ˆϱsjq);rs;r,s=1,2,,k},q=1,2,,m

    where,

    (ˆcϕijq,ˆϱijq)=Λ(σm(Λ1(cϕ1ij,ϱ1ij)σ+Λ1(cϕ2ij,ϱ2ij)σ++Λ1(cϕ2ij,ϱ2ij)ϱ)).

    Step 7: The 2TLmF concordance indices prs's are calculated by means of weights assigned to the concordance indicators involved in the corresponding concordance sets as

    prs=jPrsφj,r,s.

    Step 8: The 2TLmF concordance matrix P can be obtained by arranging all the 2TLmF concordance indices prs's as below:

    P=(p12p1(k1)p1kp21p2(k2)p2kp(k1)1p(k2)2p(k1)kpk1pk2p(k1)k).

    Step 9: On contrary to the 2TLmF concordance indices, the 2TLmF discordance indices qrs's are the extent in which one alternative is inferior to other. The 2TLmF discordance indices are obtained by using normalized Euclidean distance d(ˆzrj,ˆzsj), as defined below:

    qrs=maxjQrs(d(ˆzrj,ˆzsj))maxj(d(ˆzrj,ˆzsj)),=maxjQrs1m[(Λ1   (ˆcϕrj1,ˆϱrj1)σΛ1   (ˆcψsj1,ˆϱsj1)σ)2++(Λ1   (ˆcϕrjm,ˆϱrjm)σΛ1   (ˆcψsjm,ˆϱsjm)σ)2]maxj1m[(Λ1   (ˆcψrj1,ˆϱrj1)σΛ1   (ˆcψsj1,ˆϱsj1)σ)2++(Λ1   (ˆcψrjm,ˆϱrjm)σΛ1   (ˆcψsjm,ˆϱsjm)σ)2], r, s.

    Step 10: The 2TLmF discordance matrix Q can be obtained by arranging all the 2TLmF discordance indices qrs's as below:

    Q=(q12q1(k1)q1kq21q2(k2)q2kq(k1)1q(k2)2q(k1)kqk1qk2qk(k1)).

    Step 11: Now, we evaluate the 2TLmF concordance level ˉp and 2TLmF discordance level ˉq. The 2TLmF concordance level and the 2TLmF discordance level are obtained by calculating average of 2TLmF concordance and 2TLmF discordance indices as defined below:

    ˉp=1k(k1)kr=1rsks=1rsprs,ˉq=1k(k1)kr=1rsks=1rsqrs.

    Step 12: According to concordance and discordance level, the 2TLmF concordance dominance matrix and 2TLmF discordance dominance matrix are constructed as

    Υ=(γ12γ1(k1)γ1kγ21γ2(k1)γ2kγ(k1)1γ(k2)2γ(k1)kγk1γk2γk(k1)),

    where,

    γrs={1,prsˉp,0,prsˉp.
    η=(η12η1(k1)η1kη21η1(k2)η2kη(k1)1η(k2)2η(k1)kηk1ηk2ηk(k1)),

    where,

    ηrs={1,qrsˉq,0,qrsˉq.

    Step 13: The 2TLmF concordance and discordance dominance matrices are combined to obtained the aggregated outranking Boolean matrix that offers more accurate information on the outranking relationship and superiority of one alternative over another. Assemble the aggregated outranking boolean matrix as follows:

    τ=(τ12τ1(k1)τ1kτ21τ1(k2)τ2kτ(k1)1τ(k2)2τ(k1)kτk1τk2τk(k1)),

    where,

    τij=γij×ηij,(i,j=1,2,3,,k,ij).

    Step 14: Lastly, our target is to ranked the alternatives by using aggregated outranking Boolean matrix τ information. For convenience, we can visualized the outranking relations by using directed graph. A directed edge is exist from alternative ϝr to ϝs if and only if τrs=1.

    Then there exist the following three situations as described below:

    ● For a unique directed edge from ϝr to ϝs implies that ϝr is preferred over ϝs.

    ● Existence of directed edge from ϝr to ϝs and ϝs to ϝr implies that ϝr and ϝs are indifferent.

    ● If there is no edge between ϝr to ϝs implies that ϝr and ϝs both are incomparable.

    The representation of relations in an outranking decision graph is shown in Figure 3.

    Figure 3.  Graphically representation of relations in an outranking decision graph.

    Step 15: The decision graph allows for the partial ordering of the alternatives and eliminates the less favorable alternatives. On the other hand, the linear ranking order of the alternatives reduces the partial ordering dilemma that can be evaluated by employing net outranking indices to strengthen the proposed 2TLmF ELECTRE-I technique.

    Let {Θi,i=1,2,,k} be the concordance outranking relation derived with the help of concordance matrix P and the following Eq (5.1):

    Θi=kr=1ripirks=1sipis. (5.1)

    The discordance outranking relation {Θi,i=1,2,,k} computed by using discordance matrix Q and Eq (5.2) as given below:

    Θi=kr=1rspirkr=1rspis. (5.2)

    Thus, for the final linear ranking order, the net outranking index is defined as follows in Eq (5.3).

    Ξ=ΘiΘi. (5.3)

    The alternative with the maximum net outranking index is considered the most suitable choice. We describe our proposed methods, namely, 2TLmF-TOPSIS method and 2TLmF ELECRTE-1 method, in a flowchart as shown in Figure 4.

    Figure 4.  Flowchart for 2TLmF ELECTRE-I and 2TLmF-TOPSIS method.

    In this section, we apply the proposed 2TLmF ELECTRE-I method to the same MAGDM problems, whose case studies related to construction and industry field are already discussed in Section 3.

    (1) In this subsection, we apply proposed 2TLmF ELECTRE-I method to the "Selection of Highway Construction Project Manager" as already 2TLmF-TOPSIS method is applied on it in Section 3. In 2TLmF ELECTRE-I method, (Step 1–Step 4) are same as already discussed in 2TLmF-TOPSIS method.

    In order to construct the 2TL4F concordance and 2TL4F discordance set, the superiority and inferiority of the alternatives are checked by using 2TL4F score values as displayed in Table 15.

    Table 15.  2TL4F score values.
    Alternatives Ç1 Ç2 Ç3 Ç4
    ϝ1 (c1,0.487394) (c1,0.196308) (c3,0.48428) (c1,0.44210)
    ϝ2 (c2,0.043372) (c2,0.44857) (c3,0.431724) (c2,0.01857)
    ϝ3 (c3,0.315239) (c3,0.34750) (c4,0.389165) (c5,0.25393)
    ϝ4 (c2,0.30922) (c1,0.336906) (c2,0.05586) (c1,0.41972)
    ϝ5 (c2,0.34475) (c1,0.074408) (c2,0.213861) (c1,0.41162)
    ϝ6 (c5,0.00162) (c1,0.371090) (c5,0.191220) (c5,0.28005)

     | Show Table
    DownLoad: CSV

    Step 5: The 2TL4F concordance set is given in Table 16.

    Table 16.  2TL4F concordance set representation.
    k 1 2 3 4 5 6
    M1k {3} {2,3}
    M2k {1,2,3,4} {1,2,3,4} {1,2,3,4} {2}
    M3k {1,2,3,4} {1,2,3,4} {1,2,3,4} {1,2,3,4} {2,4}
    M4k {1,2,4} {1,2}
    M5k {1,4} {3,4}
    M6k {1,2,3,4} {1,2,3,4} {1,3} {1,2,3,4} {1,2,3,4}

     | Show Table
    DownLoad: CSV

    Step 6: The 2TL4F discordance set is given in Table 17.

    Table 17.  2TL4F discordance set representation.
    k 1 2 3 4 5 6
    N1k {1,2,3,4} {1,2,3,4} {1,2,4} {1,4} {1,2,3,4}
    N2k {1,2,3,4} {1,3,4}
    N3k {1,3}
    N4k {3} {1,2,3,4} {1,2,3,4} {3,4} {1,2,3,4}
    N5k {2,3} {1,2,3,4} {1,2,3,4} {1,2} {1,2,3,4}
    N6k {2} {2,4}

     | Show Table
    DownLoad: CSV

    Step 7: The 2TL4F-concordance matrix is computed as given below:

    P=(000.40.6010110.211110.30.6000.500.4000.5010.80.711).

    Step 8: The 2TL4F concordance level is: ˉp=0.5001.

    Step 9: The normalized Euclidean distances d(ˆzrj,ˆzsj) are arranged in Table 18, where the entries ˆzrj, ˆzsj are from aggregated weighted 2TL4F decision matrix as arranged in Table 5.

    Table 18.  Normalized Euclidean distances for 2TL4F data d(ˆzrj,ˆzsj).
    ˆz11 ˆz21 ˆz31 ˆz41 ˆz51 ˆz61 ˆz12 ˆz22 ˆz32 ˆz42 ˆz52 ˆz62
    ˆz11 0.020029 0.070153 0.010664 0.01494 0.106889 ˆz12 0.011135 0.065085 0.009263 0.01494 0.012061
    ˆz21 0.053503 0.010941 0.022640 0.096937 ˆz22 0.061226 0.009763 0.014138 0.009500
    ˆz31 0.062834 0.068473 0.102559 ˆz32 0.064142 0.071325 0.061664
    ˆz41 0.015663 0.103487 ˆz42 0.012148 0.004630
    ˆz51 0.103076 ˆz52 0.014473
    ˆz61 ˆz62
    ˆz13 ˆz23 ˆz33 ˆz43 ˆz53 ˆz63 ˆz14 ˆz24 ˆz34 ˆz44 ˆz54 ˆz64
    ˆz13 0.046101 0.065046 0.031574 0.017043 0.087542 ˆz14 0.077759 0.131008 0.003306 0.006669 0.129839
    ˆz23 0.044653 0.059610 0.047148 0.069929 ˆz24 0.104477 0.076727 0.074959 0.147221
    ˆz33 0.086642 0.069149 0.077820 ˆz34 0.131658 0.132380 0.099549
    ˆz43 0.022224 0.094621 ˆz44 0.003528 0.129726
    ˆz53 0.094006 ˆz54 0.130609
    ˆz63 ˆz64

     | Show Table
    DownLoad: CSV

    Step 10: The 2TL4F-discordance matrix is computed as given below:

    Q=(110.4067770.87684010100100001111111110.704784100.0645340.57065400).

    Step 11: The 2TL4F discordance level is: ˉq=0.60078.

    Step 12: By using concordance and discordance level, the 2TL4F-concordance dominance and 2TL4F-discordance dominance matrix are evaluated as:

    Υ=(000101011011110100100001011111),
    η=(001001011011110000000000011111).

    Step 13: The 2TL4F aggregated dominance matrix is evaluated as

    τ=(000001011011110000000000011111).

    Step 14: The alternatives ranking is shown in Figure 5. Thus, ϝ6 is outranking over all other alternatives, ϝ1,ϝ2,ϝ3,ϝ4,ϝ5. Where the partial preferences of the alternatives are pinned up in Table 19.

    Table 19.  Decision graph exploration.
    Alternatives Submissive alternatives Incomparable alternatives
    ϝ1 ϝ4, ϝ5
    ϝ2 ϝ1,ϝ4,ϝ5
    ϝ3 ϝ1,ϝ2,ϝ4,ϝ5
    ϝ4 ϝ1,ϝ5
    ϝ5 ϝ1,ϝ4
    ϝ6 ϝ1,ϝ2,ϝ3,ϝ4,ϝ5

     | Show Table
    DownLoad: CSV
    Figure 5.  Directed graph for alternatives ranking of Example I.

    Step 15: The concordance Θi and discordance Θi outranking coefficients are displayed in Table 20, with net Ξ outranking index. Table 20, represents that ϝ6 is the best alternative with linear ranking order of alternatives, ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4.

    Table 20.  Outranking indices of the alternatives.
    Alternatives Concordance outranking index Discordance outranking index Net outranking index Ranking
    ϝ1 -3.001 2.2836 -5.2836 4
    ϝ2 1.390 -1.0645 2.4645 3
    ϝ3 3.570 -3.9706 7.5706 2
    ϝ4 -2.761 3.8884 -6.6884 6
    ϝ5 -3.200 2.8279 -6.0279 5
    ϝ6 4.001 -3.9648 7.9648 1

     | Show Table
    DownLoad: CSV

    (2) We now used our proposed 2TLmF ELECTRE-I method for the "Selection of the Best Textile Industry" as already 2TLmF-TOPSIS method is applied on it in Section 3.

    In 2TLmF ELECTRE-I method (Step 1–Step 4) are same as in 2TLmF-TOPSIS method.

    In order to construct the 2TL6F concordance and 2TL6F discordance set, every pair of the alternatives are compared by using 2TL6F score values as displayed in Table 21.

    Table 21.  2TL4F score values.
    Alternatives T1 T2 T3
    L1 (2,0.200083) (2,0.35354) (2,0.028800)
    L2 (3,0.094133) (2,0.23609) (3,0.090886)
    L3 (2,0.271047) (1,0.344972) (2,0.18087)
    L4 (3,0.131794) (3,0.12751) (3,0.10281)
    L5 (3,0.30383) (2,0.1702) (3,0.001640)
    L6 (3,0.331541) (2,0.068230) (3,0.35713)

     | Show Table
    DownLoad: CSV

    Step 5: The 2TL6F concordance set is given in Table 22.

    Table 22.  2TL6F concordance set representation.
    k 1 2 3 4 5 6
    M1k {2,3}
    M2k {1,2,3} {1,2,3} {3} {1,3} {3}
    M3k {1}
    M4k {1,2,3} {1,2} {1,2,3} {1,2} {2,3}
    M5k {1,2,3} {2} {1,2,3} {3} {3}
    M6k {1,2,3} {1,2} {1,2,3} {1} {1,2}

     | Show Table
    DownLoad: CSV

    Step 6: The 2TL6F discordance set is given in Table 23.

    Table 23.  2TL6F discordance set representation.
    k 1 2 3 4 5 6
    N1k {1,2,3} {1} {1,2,3} {1,2,3} {1,2,3}
    N2k {1,2} {2} {1,2}
    N3k {2,3} {1,2,3} {1,2,3} {1,2,3} {1,2,3}
    N4k {3} {3} {1}
    N5k {1,3} {1,2} {1,2}
    N6k {3} {2,3} {3}

     | Show Table
    DownLoad: CSV

    Step 7: The 2TL6F concordance matrix is calculated as given below:

    P=(00.579000110.3450.7660.3450.421000010.65510.6550.57910.23410.3450.34510.65510.4210.655).

    Step 8: The 2TL6F concordance level is: ˆˉp=0.5001.

    Step 9: The normalized Euclidean distances d(˘zrj,˘zsj) are arranged in Table 24, where the entries ˘zrj, ˘zsj are from aggregated weighted 2TL6F decision matrix as arranged in Table 12.

    Table 24.  Normalized Euclidean distances for 2TL6F data d(˘zrj,˘zsj).
    ˘z11˘z21˘z31˘z41˘z51˘z61˘z12˘z22˘z32˘z42˘z52˘z62˘z13˘z23˘z33˘z43˘z53˘z63
    ˘z110.1350300.0742990.1521890.1001680.162004˘z120.0259250.0643350.3122110.0603080.070286˘z130.1536850.0591020.1286000.1334600.112571
    ˘z210.1507970.1215930.1117150.112332˘z220.0811550.3100600.0608330.053906˘z230.1673850.0845330.1167080.115150
    ˘z310.1252170.0768310.135916˘z320.3585650.0813660.11196˘z330.1398680.1705800.119144
    ˘z410.0629550.047672˘z420.2916910.318564˘z430.0861300.079839
    ˘z510.089844˘z520.081354˘z530.0994578
    ˘z61˘z62˘z63

     | Show Table
    DownLoad: CSV

    Step 10: The 2TL6F-discordance matrix is computed as given below:

    Q=(111110010.5212450.9755270.865896111100.27263600.2952790.14964601010.90334701011).

    Step 11: The 2TL6F discordance level is: ˆˉq=0.632785.

    Step 12: By using concordance and discordance level, the 2TL6F-concordance dominance and 2TL6F-discordance dominance matrix are evaluated as:

    =(010001001000000111111010011101),
    ¥=(000001101000000111111010010100).

    Step 13: The 2TL6F aggregated dominance matrix is evaluated as

    =(000001101000000111111010010100).

    Step 14: The alternatives ranking is shown in Figure 6. Thus, L4 is outranking over all other alternatives, L1,L2,L3,L5,L6. Where the partial preferences of the alternatives are pinned up in Table 25.

    Table 25.  Decision graph exploration.
    Alternatives Submissive alternatives Incomparable alternatives
    L1 L3
    L2 L1,L3,L5 L6
    L3 L1
    L4 L1,L2,L3,L5,L6
    L5 L1,L3 L6
    L6 L1,L3 L2,L5

     | Show Table
    DownLoad: CSV
    Figure 6.  Directed graph for alternatives ranking of Example II.

    Step 15: The concordance Ωi and discordance i outranking coefficients are displayed in Table 26, with net £ outranking index. Table 26 represents that L6 is the best alternative with linear ranking order of alternatives, L4>L2>L6>L5>L1>L3.

    Table 26.  Outranking indices of the alternatives.
    Alternatives Concordance outranking index Discordance outranking index Net outranking index Ranking
    L1 -3.842 4.13410 -7.9761 5
    L2 1.912 -1.0645 3.6878 2
    L3 -4.158 3.8658 -8.0238 6
    L4 2.778 3.8884 7.0604 1
    L5 0.848 -0.9131 1.7611 4
    L6 2.462 -1.0285 3.4905 3

     | Show Table
    DownLoad: CSV

    In this subsection, we present comparison study of our proposed methods, namely, 2TLmF-TOPSIS and 2TLmF ELECTRE-I. The 2TLmF-TOPSIS technique is, based on the concept of finding an alternative, that is nearest to the 2TLPIS and far away from the 2TLNIS, while an outranking 2TLmF ELECTRE-I method is based on the pairwise comparison of the alternatives. The 2TLmF ELECTRE-I method sometimes provides two optimal solutions at once because it only considers the benefit criterion, but the 2TLmF-TOPSIS method provides a single alternative because we believe that both benefits and cost standards. Based on two case studies related to construction and industrial fields by using the same descriptive 2TLmF set, the comparison of proposed methods is described below:

    (1) For "Selection of Highway Construction Project Manager" the comparison between 2TLmF-TOPSIS and 2TLmF ELECTRE-I methods is displayed in Table 27. This comparison shows that ϝ6 is the most desirable alternative by using the 2TLmF ELECTRE-1 and 2TLmF TOPSIS methods, order of ranking is given in Table 27. Comparison graph of proposed methods for the selection of highway construction project manager is displayed in Figure 7.

    Table 27.  Alternative ranking order.
    Methods Ranking Best alternative
    2TLmF TOPSIS ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4 ϝ6
    2TLmF ELECTRE-1 ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4 ϝ6

     | Show Table
    DownLoad: CSV
    Figure 7.  Comparison of proposed methods in case of manager selection.

    (2) For "Selection of the best textile industry" the comparison between 2TLmF-TOPSIS and 2TLmF ELECTRE-I methods is displayed in Table 28. This comparison shows that L4 is the most desirable alternative, order of ranking is given in Table 28. The comparative graph of proposed methods for the selection of best textile industry is displayed in Figure 8.

    Table 28.  Alternative ranking order.
    Methods Ranking Best alternative
    2TLmF TOPSIS L4>L2>L6>L5>L1>L3 L4
    2TLmF ELECTRE-1 L4>L2>L6>L5>L1>L3 L4

     | Show Table
    DownLoad: CSV
    Figure 8.  Comparison of proposed methods in case of textile industry selection.

    Recently, Akram et al. [28] developed the 2-tuple linguistic m-polar fuzzy Hamacher weighted average (2TLmFHWA) and 2TLmFHWG operators. In this subsection, we compare the proposed methods with the existing method [28] to check the applicability and versatility of the proposed models.

    (1) For a comparative study between the proposed method and the existing method [28], i.e. 2TLmFHWA and 2TLmFHWG operators with parameters λ=3, are employed to assemble the values given in Table 4. The values combined using the 2TLmFHWA and 2TLmFHWG operators are given in the Tables 29 and 30. The score values for each alternative using the Definition 2.7 are given in Tables 31 and 32. Therefore, according to the comparison of the existing model and the proposed model, ϝ6 is the most ideal alternative, ensuring the authenticity of our proposed study. The rank order of alternatives for existing and proposed work is shown in the Table 37.

    Table 29.  Assembled values (^i) by using the 2TLmFHWA operator.
    ^i 2TLmFHWA operator
    ^1 ((c4,0.237025),(c4,0.156577),(c4,0.405718),(c4,0.312066))
    ^2 ((c4,0.3160501),(c6,0.000000),(c5,0.302145),(c6,0.000000))
    ^3 ((c6,0.000000),(c5,0.2000000),(c6,0.000000),(c5,0.2000000))
    ^4 ((c4,0.180325),(c4,0.352272),(c4,0.024654),(c4,0.06813))
    ^5 ((c4,0.317807),(c4,0.09277),(c3,0.49582),(c5,0.350218))
    ^6 ((c6,0.000000),(c5,0.354769),(c6,0.000000),(c6,0.000000))

     | Show Table
    DownLoad: CSV
    Table 30.  Scores values for all the 2TL4F numbers ^i.
    Scores values 2TLmFHWA operator
    S(^1) (c4,0.081045)
    S(^2) (c5,0.330680)
    S(^3) (c6,0.40000)
    S(^4) (c4,0.05385)
    S(^5) (c4,0.06624)
    S(^6) (c6,0.33869)

     | Show Table
    DownLoad: CSV
    Table 31.  Assembled values (^i) by using the 2TLmFHWG operator.
    ^i 2TLmFHWG operator
    ^1 ((c4,0.303973),(c4,0.298562),(c4,0.2921963),(c4,0.2656442))
    ^2 ((c4,0.2968202),(c5,0.181945),(c5,0.308545),(c5,0.066331))
    ^3 ((c5,0.169367),(c6,0.240905),(c5,0.3103902),(c5,0.2236302))
    ^4 ((c4,0.1669631),(c4,0.482343),(c4,0.0040604),(c4,0.074481))
    ^5 ((c4,0.355479),(c4,0.140987),(c3,0.4912188),(c5,0.4038449))
    ^6 ((c6,0.436916),(c5,0.359750),(c6,0.240905),(c6,0.352806))

     | Show Table
    DownLoad: CSV
    Table 32.  Scores values for all the 2TL4F numbers ^i.
    Scores values 2TLmFHWG operator
    S(^1) (c4,0.011173)
    S(^2) (c5,0.315000)
    S(^3) (c5,0.2809367)
    S(^4) (c4,0.096450)
    S(^5) (c4,0.102273)
    S(^6) (c5,0.4024051)

     | Show Table
    DownLoad: CSV

    (2) For a comparative study between the proposed method and the existing method [28], i.e. 2TLmFHWA and 2TLmFHWG operators with parameters λ=3, are employed to assemble the values given in Table 11. The values assembled using the 2TLmFHWA and 2TLmFHWG operators are given in the Tables 33 and 34. The score values for each alternative using the Definition 2.7 are given in Tables 35 and 36. Therefore, according to the comparison of the existing model and the proposed model, L4 is the most ideal alternative, ensuring the authenticity of our proposed study. The rank order of alternatives for existing and proposed work is shown in the Table 37.

    Table 33.  Assembled values (~i) by using the 2TLmFHWA operator.
    ~i 2TLmFHWA operator
    ~1 ((4,0.11334054),(4,0.2419176),(5,0.050780),(4,0.1573784),(5,0.1203015),(5,0.356388))
    ~2 ((5,0.3708851),(5,0.18080780),(6,0.241310),(5,0.2173407),(6,0.2731900),(6,0.0144995))
    ~3 ((4,0.007891),(4,0.0935551),(4,0.2726495),(4,0.367347),(4,0.4859191),(5,0.207669))
    ~4 ((6,0.249351),(6,0.003903),(6,0.393966),(8,0.0000000),(5,0.313300),(6,0.101870))
    ~5 ((5,0.24687350),(6,0.1279355),(5,0.2425176),(5,0.1416756),(5,0.3783680),(5,0.3944357))
    ~6 ((5,0.3282144),(6,0.390561),(5,0.1911016),(6,0.106643),(6,0.268146),(6,0.2560303))

     | Show Table
    DownLoad: CSV
    Table 34.  Scores values for all the 2TL6F numbers ~i.
    Scores values 2TLmFHWA operator
    S(~1) (5,0.462371)
    S(~2) (6,0.364097)
    S(~3) (4,0.3027999)
    S(~4) (6,0.0235580)
    S(~5) (5,0.4219677)
    S(~6) (6,0.331667)

     | Show Table
    DownLoad: CSV
    Table 35.  Assembled values (~i) by using the 2TLmFHWG operator.
    ~i 2TLmFHWG operator
    ~1 ((4,0.0507263),(4,0.2128660),(5,0.051972),(4,0.0254261),(5,0.1163187),(5,0.407553))
    ~2 ((5,0.3161339),(5,0.1347207),(6,0.403355),(5,0.1588720),(6,0.192966),(6,0.067063))
    ~3 ((4,0.113670),(4,0.146005),(4,0.2602225),(4,0.359559),(4,0.4149561),(5,0.260478))
    ~4 ((6,0.286330),(6,0.013376),(6,0.400008),(6,0.034697),(5,0.32309),(6,0.030347))
    ~5 ((5,0.2282171),(6,0.0457900),(5,0.2126563),(5,0.0541447),(5,0.2693903),(5,0.3542517))
    ~6 ((5,0.3234717),(6,0.4208887),(5,0.1841108),(6,0.127622),(6,0.282073),(6,0.116531))

     | Show Table
    DownLoad: CSV
    Table 36.  Scores values for all the 2TL6F numbers ~i.
    Scores values 2TLmFHWG operator
    S(~1) (4,0.49096840)
    S(~2) (6,0.4446209)
    S(~3) (4,0.25243047)
    S(~4) (6,0.3378598)
    S(~5) (5,0.36074173)
    S(~6) (6,0.3677451)

     | Show Table
    DownLoad: CSV
    Table 37.  Comparison of proposed models with existing work.
    Case study Methods Ranking Best alternative
    Project manager selection 2TLmFHWA [28] ϝ6>ϝ3>ϝ2>ϝ1>ϝ4>ϝ5 ϝ6
    2TLmFHWG [28] ϝ6>ϝ3>ϝ2>ϝ1>ϝ4>ϝ5 ϝ6
    2TLmF TOPSIS (proposed) ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4 ϝ6
    2TLmF ELECTRE-1 (proposed) ϝ6>ϝ3>ϝ2>ϝ1>ϝ5>ϝ4 ϝ6
    Textile industry selection 2TLmFHWA [28] L4>L6>L2>L5>L1>L3 L4
    2TLmFHWG [28] L4>L6>L2>L5>L1>L3 L4
    2TLmF TOPSIS (proposed) L4>L2>L6>L5>L1>L3 L4
    2TLmF ELECTRE-1 (proposed) L4>L2>L6>L5>L1>L3 L4

     | Show Table
    DownLoad: CSV

    Finally, the similar results of the proposed and existing methods illustrate the reliability and transparency of our proposed methods. In contrast, our proposed methods can quickly summarize mF and 2TL information without parameter selection. However, selecting different parameter values makes the prior art difficult. These limitations of existing work are being reduced, and we can investigate better resiliency in practical use by using our proposed MAGDM model. Therefore, the advanced decision model provides a new flexible measure for expert control of the 2TLmF-MAGDM problem.

    In this section, we describe the contribution and limitations of the proposed work. The major contribution of this research article is described as follows:

    ● The most important contribution of this study is the establishment of revolutionary strategies to efficiently manipulate 2TLmF information with great precision to the benefit of MAGDM.

    ● The proposed method 2TLmF-TOPSIS focuses on 2TLPIS, 2TLNIS, normalized Euclidean distance using 2TL information. The alternatives ranking is based on a relative closeness index.

    ● In another proposed method, 2TLmF ELECTRE-I, the salient concepts of concordance and discordance sets are defined by using 2TLmF score and 2TLmF accuracy values. The strategy uses outranking relationships and outranking graphs to indicate the best alternatives.

    ● The overall picture of the proposed technique is depicted by a flowchart, which thoroughly depicts the step-by-step approach of the proposed work.

    ● The practical application of the proposed methods 2TLmF-TOPSIS, 2TLmF-ELECTRE-I is demonstrated by using two case studies from the construction and industrial fields to consider the importance and effectiveness of the provided techniques.

    ● A comparative study is carried out with existing techniques, which provides transparency and validity of our proposed methods.

    The limitations of this research article are described below:

    ● The proposed methods, i.e. 2TLmF-TOPSIS and 2TLmF ELECTRE-I only deal with 2TLm-polar membership values and cannot take into account the unfavorable and hesitant preferences of decision makers.

    ● The 2TL nature of multi-pole data makes the proposed method difficult because of the evaluation of symbolic translation at every step of calculations.

    The simplicity of m-polar fuzzy sets has been discovered by many researchers in a short time since many real-world examples rely on multipolar information. However, in the issue at hand, the technique cannot handle 2-tuple linguistic information, which can lead to data loss. Therefore, the multi-functional 2TLmFSs are found to be more suitable to utilize the linguistic multi-polar data aptly owing to its captivating design and modern structure in complex decision-making scenarios. In this research paper, the popular theories and heuristics of the TOPSIS and ELECTRE-I methods has been exploited for constructing new group decision-making techniques, namely, 2TLmF-TOPSIS and 2TLmF-ELECTRE I methods, which are beneficial and convenient for decision-makers. In addition, the presented MAGDM strategies have been embedded in an elegant flow chart diagram. Furthermore, the 2TLmF-TOPSIS and 2TLmF-ELECTRE I methods have been implemented with detailed explanations to solve two real-life problems for the evaluation of suitable highway construction project manager and the best textile industry. The proposed techniques have been proved to be transparent and suitable for MAGDM, as these techniques successfully deal with ambiguous data on the properties of 2TLmFS. Ultimately, the ability of the proposed method to take over data qualitatively and quantitatively makes it superior to previous techniques, preventing data loss, and engaging researchers for future decision-making. In the future, we will try to extend our work to other variants of the ELECTRE family, such as ELECTRE-II, ELECTRE-III, and ELECTRE-IV, under the 2TLmFS.

    The third author extends his appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through General Research Project under grant number (R.G.P.2/48/43).

    The authors declare that they have no conflicts of interest.



    [1] I. Podlubny, Fractional differential equations, New York: Academic Press, 1999.
    [2] R. Koeller, Applications of fractional calculus to the theory of viscoelasticity, J. Appl. Mech., 51 (1984), 229–307. https://doi.org/10.1115/1.3167616 doi: 10.1115/1.3167616
    [3] D. Baleanu, J. Machado, A. Luo, Fractional dynamics and control, Berlin: Springer, 2012.
    [4] X. Yang, C. Li, T. Huang, Q. Song, Mittag-Leffler stability analysis of nonlinear fractional-order systems with impulses, Appl. Math. Comput., 293 (2017), 416–422. https://doi.org/10.1016/j.amc.2016.08.039 doi: 10.1016/j.amc.2016.08.039
    [5] F. Hoppensteadt, E. Izhikevich, Pattern recognition via synchronization in phase-locked loop neural networks, IEEE T. Neural Networ., 11 (2000), 734–738. https://doi.org/10.1109/72.846744 doi: 10.1109/72.846744
    [6] F. Du, J. Lu, New criteria on finite-time stability of fractional-order hopfield neural networks with time delays, IEEE T. Neur. Net. Lear., 32 (2021), 3858–3866. https://doi.org/10.1109/TNNLS.2020.3016038 doi: 10.1109/TNNLS.2020.3016038
    [7] L. Zhou, H. Lin, F. Tan, Fixed/predefined-time synchronization of coupled memristor-based neural networks with stochastic disturbance, Chaos Soliton. Fract., 173 (2023), 113643. https://doi.org/10.1016/j.chaos.2023.113643 doi: 10.1016/j.chaos.2023.113643
    [8] S. Han, C. Hu, J. Yu, H. Jiang, S. Wen, Stabilization of inertial Cohen-Grossberg neural networks with generalized delays: A direct analysis approach, Chaos Soliton. Fract., 142 (2021), 110432. https://doi.org/10.1016/j.chaos.2020.110432 doi: 10.1016/j.chaos.2020.110432
    [9] C. Long, G. Zhang, Z. Zeng, J. Hu, Finite-time stabilization of complex-valued neural networks with proportional delays and inertial terms: A non-separation approach, Neural Networks, 148 (2022), 86–95. https://doi.org/10.1016/j.neunet.2022.01.005 doi: 10.1016/j.neunet.2022.01.005
    [10] N. Cui, H. Jiang, C. Hu, A. Abdurahman, Global asymptotic and robust stability of inertial neural networks with proportional delays, Neurocomputing, 272 (2018), 326–333. https://doi.org/10.1016/j.neucom.2017.07.001 doi: 10.1016/j.neucom.2017.07.001
    [11] J. Liu, L. Shu, Q. Chen, S. Zhong, Fixed-time synchronization criteria of fuzzy inertial neural networks via Lyapunov functions with indefinite derivatives and its application to image encryption, Fuzzy Set. Syst., 459 (2023), 22–42. https://doi.org/10.1016/j.fss.2022.08.002 doi: 10.1016/j.fss.2022.08.002
    [12] J. Han, G. Chen, J. Hu, New results on anti-synchronization in predefined-time for a class of fuzzy inertial neural networks with mixed time delays, Neurocomputing, 495 (2022), 26–36. https://doi.org/10.1016/j.neucom.2022.04.120 doi: 10.1016/j.neucom.2022.04.120
    [13] Y. Yu, Z. Zhang, M. Zhong, Z. Wang, Pinning synchronization and adaptive synchronization of complex-valued inertial neural networks with time-varying delays in fixed-time interval, J. Franklin I., 359 (2022), 1434–1456. https://doi.org/10.1016/j.jfranklin.2021.11.036 doi: 10.1016/j.jfranklin.2021.11.036
    [14] R. Guo, S. Xu, Observer-based sliding mode synchronization control of complex-valued neural networks with inertial term and mixed time-varying delays, Appl. Math. Comput., 442 (2023), 127761. https://doi.org/10.1016/j.amc.2022.127761 doi: 10.1016/j.amc.2022.127761
    [15] L. Ke, Mittag-Leffler stability and asymptotic ω-periodicity of fractional-order inertial neural networks with time-delays, Neurocomputing, 465 (2021), 53–62. https://doi.org/10.1016/j.neucom.2021.08.121 doi: 10.1016/j.neucom.2021.08.121
    [16] Y. Gu, H. Wang, Y. Yu, Stability and synchronization for Riemann-Liouville fractional-order time-delayed inertial neural networks, Neurocomputing, 340 (2019), 270–280. https://doi.org/10.1016/j.neucom.2019.03.005 doi: 10.1016/j.neucom.2019.03.005
    [17] Y. Cheng, H. Zhang, W. Zhang, H. Zhang, Novel algebraic criteria on global Mittag-Leffler synchronization for FOINNs with the Caputo derivative and delay, J. Appl. Math. Comput., 68 (2022), 3527–3544. https://doi.org/10.1007/s12190-021-01672-0 doi: 10.1007/s12190-021-01672-0
    [18] Q. Peng, J. Jian, Synchronization analysis of fractional-order inertial-type neural networks with time delays, Math. Comput. Simul., 205 (2022), 62–77. https://doi.org/10.1016/j.matcom.2022.09.023 doi: 10.1016/j.matcom.2022.09.023
    [19] A. Alimi, C. Aouiti, E. Assali, Finite-time and fixed-time synchronization of a class of inertial neural networks with multi-proportional delays and its application to secure communication, Neurocomputing, 332 (2019), 29–43. https://doi.org/10.1016/j.neucom.2018.11.020 doi: 10.1016/j.neucom.2018.11.020
    [20] M. Prakash, P. Balasubramaniam, S. Lakshmanan, Synchronization of Markovian jumping inertial neural networks and its applications in image encryption, Neural Networks, 83 (2016), 86–93. https://doi.org/10.1016/j.neunet.2016.07.001 doi: 10.1016/j.neunet.2016.07.001
    [21] J. Feng, J. Ma, S. Qin, Exponential stability of periodic solution for impulsive memristor-based cohen-grossberg neural networks with mixed delays, Int. J. Pattern Recogn., 31 (2017), 1750022. https://doi.org/10.1142/S0218001417500227 doi: 10.1142/S0218001417500227
    [22] C. Zhou, H. Zhang, H. Zhang, C. Dang, Global exponential stability of impulsive fuzzy Cohen-Grossberg neural networks with mixed delays and reaction Cdiffusion terms, Neurocomputing, 91 (2012), 67–76. https://doi.org/10.1016/j.neucom.2012.02.012 doi: 10.1016/j.neucom.2012.02.012
    [23] Z. Wang, H. Zhang, W. Yu, Robust stability of Cohen-Grossberg neural networks via state transmission matrix, IEEE T. Neural Networ., 20 (2009), 169–174. https://doi.org/10.1109/tnn.2008.2009119 doi: 10.1109/tnn.2008.2009119
    [24] Y. Li, J. Xiang, Existence and global exponential stability of anti-periodic solution for clifford-valued inertial Cohen-Grossberg neural networks with delays, Neurocomputing, 332 (2019), 259–269. https://doi.org/10.1016/j.neucom.2018.12.064 doi: 10.1016/j.neucom.2018.12.064
    [25] S. Baluni, V. Yadav, S. Das, Quasi projective synchronization of time varying delayed complex valued Cohen-Grossberg neural networks, Inform. Sciences, 612 (2022), 231–240. https://doi.org/10.1016/j.ins.2022.08.106 doi: 10.1016/j.ins.2022.08.106
    [26] F. Kong, Q. Zhu, R. Sakthivel, Finite-time and fixed-time synchronization analysis of fuzzy Cohen-Grossberg neural networks with discontinuous activations and parameter uncertainties, Eur. J. Control, 56 (2022), 179–190. https://doi.org/10.1016/j.ejcon.2020.03.003 doi: 10.1016/j.ejcon.2020.03.003
    [27] Q. Li, L. Zhou, Global asymptotic synchronization of inertial memristive Cohen-Grossberg neural networks with proportional delays, Commun. Nonlinear Sci., 123 (2023), 107295. https://doi.org/10.1016/j.cnsns.2023.107295 doi: 10.1016/j.cnsns.2023.107295
    [28] H. Jia, D. Luo, J. Wang, H. Shen, Fixed-time synchronization for inertial Cohen-Grossberg delayed neural networks: An event-triggered approach, Knowl.-Based Syst., 250 (2022), 109104. https://doi.org/10.1016/j.knosys.2022.109104 doi: 10.1016/j.knosys.2022.109104
    [29] L. Ke, W. Li, Exponential synchronization in inertial Cohen-Grossberg neural networks with time delays, J. Franklin I., 356 (2019), 11285–11304. https://doi.org/10.1016/j.jfranklin.2019.07.027 doi: 10.1016/j.jfranklin.2019.07.027
    [30] Z. Li, Y. Zhang, The boundedness and the global Mittag-Leffler synchronization of fractional-order inertial Cohen-Grossberg neural networks with time delays, Neural Process. Lett., 54 (2022), 597–611. https://doi.org/10.1007/s11063-021-10648-x doi: 10.1007/s11063-021-10648-x
    [31] H. Zhang, C. Wang, R. Ye, I. Stamova, J. Cao, Novel order-dependent passivity conditions of fractional generalized Cohen-Grossberg neural networks with proportional delays, Commun. Nonlinear Sci., 120 (2023), 107155. https://doi.org/10.1016/j.cnsns.2023.107155 doi: 10.1016/j.cnsns.2023.107155
    [32] L. Wan, Z. Liu, Multiple O(tq) stability and instability of time-varying delayed fractional-order Cohen-Grossberg neural networks with Gaussian activation functions, Neurocomputing, 454 (2021), 212–227. https://doi.org/10.1016/j.neucom.2021.05.018 doi: 10.1016/j.neucom.2021.05.018
    [33] R. Aravind, P. Balasubramaniam, Stability criteria for memristor-based delayed fractional-order Cohen-Grossberg neural networks with uncertainties, J. Comput. Appl. Math., 420 (2023), 114764. https://doi.org/10.1016/j.cam.2022.114764 doi: 10.1016/j.cam.2022.114764
    [34] H. Zhang, X. Chen, R. Ye, I. Stamova, J. Cao, Adaptive quasi-synchronization analysis for Caputo delayed Cohen-Grossberg neural networks, Math. Comput. Simulat., 212 (2023), 49–65. https://doi.org/10.1016/j.matcom.2023.04.025 doi: 10.1016/j.matcom.2023.04.025
    [35] J. Xiao, L. Wu, A. Wu, Z. Zeng, Z. Zhang, Novel controller design for finite-time synchronization of fractional-order memristive neural networks, Neurocomputing, 512 (2022), 494–502. https://doi.org/10.1016/j.neucom.2022.09.118 doi: 10.1016/j.neucom.2022.09.118
    [36] Z. Ruan, Y. Li, J. Hu, J. Mei, D. Xia, Finite-time synchronization of the drive-response networks by event-triggered aperiodic intermittent control, Neurocomputing, 485 (2022), 89–102. https://doi.org/10.1016/j.neucom.2022.02.037 doi: 10.1016/j.neucom.2022.02.037
    [37] B. Zheng, Z. Wang, Event-based delayed impulsive control for fractional-order dynamic systems with application to synchronization of fractional-order neural networks, Neural. Comput. Appl., 35 (2023), 20241–20251. https://doi.org/10.1007/s00521-023-08738-z doi: 10.1007/s00521-023-08738-z
    [38] X. Yuan, G. Ren, H. Wang, Y. Yu, Mean-square synchronization of fractional-order stochastic complex network via pinning control, Neurocomputing, 513 (2022), 153–164. https://doi.org/10.1016/j.neucom.2022.09.128 doi: 10.1016/j.neucom.2022.09.128
    [39] A. Kilbas, H. Srivastava, J. Trujillo, Theory and applications of fractional differential equations, Amsterdam: Elsevier, 2006.
    [40] M. D. Mermoud, N. A. Camacho, J. Gallegos, R. C. Linares, Using general quadratic Lyapunov functions to prove Lyapunov uniform stability for fractional order systems, Commun. Nonlinear Sci., 22 (2015), 650–659. https://doi.org/10.1016/j.cnsns.2014.10.008 doi: 10.1016/j.cnsns.2014.10.008
    [41] M. Tan, Asymptotic stability of nonlinear systems with unbounded delays, J. Math. Anal. Appl., 337 (2008), 1010–1021. https://doi.org/10.1016/j.jmaa.2007.04.019 doi: 10.1016/j.jmaa.2007.04.019
    [42] J. Chen, Z. Zeng, P. Jiang, Global Mittag-Leffler stability and synchronization of memristor-based fractional-order neural networks, Neural Networks, 51 (2014), 1–8. https://doi.org/10.1016/j.neunet.2013.11.016 doi: 10.1016/j.neunet.2013.11.016
    [43] L. Feng, C. Hu, J. Yu, H. Jiang, Pinning synchronization of directed networks with disconnected switching topology via averaging method, Nonlinear Anal.-Hybri., 49 (2023), 101369. https://doi.org/10.1016/j.nahs.2023.101369 doi: 10.1016/j.nahs.2023.101369
    [44] F. Tan, L. Zhou, J. Xia, Adaptive quantitative exponential synchronization in multiplex Cohen-Grossberg neural networks under deception attacks, J. Franklin I., 2022. https://doi.org/10.1016/j.jfranklin.2022.09.020. doi: 10.1016/j.jfranklin.2022.09.020
    [45] J. Xiao, Z. Zeng, A. Wu, S. Wen, Fixed-time synchronization of delayed Cohen-Grossberg neural networks based on a novel sliding mode, Neural Networks, 128 (2020), 1–12. https://doi.org/10.1016/j.neunet.2020.04.020 doi: 10.1016/j.neunet.2020.04.020
    [46] M. Hui, C. Wei, J. Zhang, H. Iu, R. Yao, L. Bai, Finite-time synchronization of fractional-order memristive neural networks via feedback and periodically intermittent control, Commun. Nonlinear Sci., 116 (2022), 160822. https://doi.org/10.1016/j.cnsns.2022.106822 doi: 10.1016/j.cnsns.2022.106822
    [47] H. Zhang, J. Cheng, H. Zhang, W. Zhang, J. Cao, Quasi-uniform synchronization of Caputo type fractional neural networks with leakage and discrete delays, Chaos Soliton. Fract., 152 (2021), 111432. https://doi.org/10.1016/j.chaos.2021.111432 doi: 10.1016/j.chaos.2021.111432
  • This article has been cited by:

    1. Muhammad Akram, Uzma Noreen, Muhammet Deveci, Enhanced ELECTRE II method with 2-tuple linguistic m-polar fuzzy sets for multi-criteria group decision making, 2023, 213, 09574174, 119237, 10.1016/j.eswa.2022.119237
    2. Muhammad Akram, Uzma Noreen, Dragan Pamucar, Extended PROMETHEE approach with 2‐tuple linguistic m ‐polar fuzzy sets for selection of elliptical cardio machine , 2023, 40, 0266-4720, 10.1111/exsy.13178
    3. Mohammed M. Ali Al-Shamiri, Adeel Farooq, Muhammad Nabeel, Ghous Ali, Dragan Pamučar, Integrating TOPSIS and ELECTRE-Ⅰ methods with cubic m-polar fuzzy sets and its application to the diagnosis of psychiatric disorders, 2023, 8, 2473-6988, 11875, 10.3934/math.2023601
    4. Muhammad Akram, Uzma Noreen, Muhammet Deveci, An outranking method for optimizing anti-aircraft missile system with 2-tuple linguistic m-polar fuzzy data, 2024, 132, 09521976, 107923, 10.1016/j.engappai.2024.107923
    5. Li Mu, An integrated methodology for enterprise financial management capability evaluation based on EDAS technique and group decision making, 2024, 46, 10641246, 2281, 10.3233/JIFS-233395
    6. Ayesha Khan, Uzma Ahmad, Sundas Shahzadi, A new decision analysis based on 2-tuple linguistic q-rung picture fuzzy ITARA–VIKOR method, 2023, 1432-7643, 10.1007/s00500-023-08263-0
    7. Zu-meng Qiu, Huan-huan Zhao, Jun Yang, A group decision making approach based on the multi-dimensional Steiner point, 2024, 9, 2473-6988, 942, 10.3934/math.2024047
    8. Adeel Farooq, Muhammad Nabeel, Ghous Ali, New MCDM applications using cubic bipolar fuzzy model in medicine and engineering, 2023, 1432-7643, 10.1007/s00500-023-09256-9
    9. Uzma Ahmad, Ayesha Khan, Sundas Shhazadi, Extended ELECTRE I method for decision-making based on 2-tuple linguistic q-rung picture fuzzy sets, 2024, 1432-7643, 10.1007/s00500-023-09544-4
    10. Muhammad Akram, Arooj Adeel, 2023, Chapter 9, 978-3-031-43635-2, 437, 10.1007/978-3-031-43636-9_9
    11. Muhammad Akram, Sundas Shahzadi, Rabia Bibi, Gustavo Santos-García, Extended group decision-making methods with 2-tuple linguistic Fermatean fuzzy sets, 2023, 1432-7643, 10.1007/s00500-023-08158-0
    12. Sumera Naz, Muhammad Akram, Bijan Davvaz, Aniqa Saadat, A new decision-making framework for selecting the river crossing project under dual hesitant q-rung orthopair fuzzy 2-tuple linguistic environment, 2023, 27, 1432-7643, 12021, 10.1007/s00500-023-08739-z
    13. Hong Li, An integrated probabilistic linguistic multiple attribute group decision making method for tourism mobile e-commerce service quality evaluation, 2025, 29, 1327-2314, 156, 10.1177/13272314241295961
    14. 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, 2025, 10, 2473-6988, 12168, 10.3934/math.2025552
  • 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(1449) PDF downloads(77) Cited by(0)

Figures and Tables

Figures(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog