Processing math: 27%
Research article

Exact wave patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional NLSE

  • In this paper, exact wave propagation patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional nonlinear Schrödinger equation are studied. The topological structure of the dynamic system of the equation is studied by the complete discrimination system for the cubic polynomial method, in which the existence conditions of the soliton solutions and periodic solutions are obtained. Then, by the trial equation method, thirteen exact solutions are obtained, including solitary wave solutions, triangular function solutions, rational solutions and the elliptic function double periodic solutions, especially the elliptic function double periodic solutions. Finally, it is found that the system has chaotic behaviors when given the appropriate perturbations.

    Citation: Ninghe Yang. Exact wave patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional NLSE[J]. AIMS Mathematics, 2024, 9(11): 31274-31294. doi: 10.3934/math.20241508

    Related Papers:

    [1] Shahid Hussain Gurmani, Zhao Zhang, Rana Muhammad Zulqarnain . An integrated group decision-making technique under interval-valued probabilistic linguistic T-spherical fuzzy information and its application to the selection of cloud storage provider. AIMS Mathematics, 2023, 8(9): 20223-20253. doi: 10.3934/math.20231031
    [2] 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
    [3] Ghous Ali, Kholood Alsager, Asad Ali . Novel linguistic q-rung orthopair fuzzy Aczel-Alsina aggregation operators for group decision-making with applications. AIMS Mathematics, 2024, 9(11): 32328-32365. doi: 10.3934/math.20241551
    [4] Zeeshan Ali, Tahir Mahmood, Muhammad Bilal Khan . Three-way decisions with complex q-rung orthopair 2-tuple linguistic decision-theoretic rough sets based on generalized Maclaurin symmetric mean operators. AIMS Mathematics, 2023, 8(8): 17943-17980. doi: 10.3934/math.2023913
    [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] Sumaira Yasmin, Muhammad Qiyas, Lazim Abdullah, Muhammad Naeem . Linguistics complex intuitionistic fuzzy aggregation operators and their applications to plastic waste management approach selection. AIMS Mathematics, 2024, 9(11): 30122-30152. doi: 10.3934/math.20241455
    [7] Abbas Qadir, Shadi N. Alghaffari, Shougi S. Abosuliman, Saleem Abdullah . A three-way decision-making technique based on Pythagorean double hierarchy linguistic term sets for selecting logistic service provider and sustainable transportation investments. AIMS Mathematics, 2023, 8(8): 18665-18695. doi: 10.3934/math.2023951
    [8] Wajid Azeem, Waqas Mahmood, Tahir Mahmood, Zeeshan Ali, Muhammad Naeem . Analysis of Einstein aggregation operators based on complex intuitionistic fuzzy sets and their applications in multi-attribute decision-making. AIMS Mathematics, 2023, 8(3): 6036-6063. doi: 10.3934/math.2023305
    [9] Tahir Mahmood, Azam, Ubaid ur Rehman, Jabbar Ahmmad . Prioritization and selection of operating system by employing geometric aggregation operators based on Aczel-Alsina t-norm and t-conorm in the environment of bipolar complex fuzzy set. AIMS Mathematics, 2023, 8(10): 25220-25248. doi: 10.3934/math.20231286
    [10] Misbah Rasheed, ElSayed Tag-Eldin, Nivin A. Ghamry, Muntazim Abbas Hashmi, Muhammad Kamran, Umber Rana . Decision-making algorithm based on Pythagorean fuzzy environment with probabilistic hesitant fuzzy set and Choquet integral. AIMS Mathematics, 2023, 8(5): 12422-12455. doi: 10.3934/math.2023624
  • In this paper, exact wave propagation patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional nonlinear Schrödinger equation are studied. The topological structure of the dynamic system of the equation is studied by the complete discrimination system for the cubic polynomial method, in which the existence conditions of the soliton solutions and periodic solutions are obtained. Then, by the trial equation method, thirteen exact solutions are obtained, including solitary wave solutions, triangular function solutions, rational solutions and the elliptic function double periodic solutions, especially the elliptic function double periodic solutions. Finally, it is found that the system has chaotic behaviors when given the appropriate perturbations.



    Generally speaking, multi-criteria evaluation refers to the evaluation conducted under multiple criteria that cannot be replaced by each other. In the specific evaluation process, information is often missing because of the wide range of evaluation criteria. Some information is available but very inaccurate; Some can only give a rough range based on empirical judgment. Therefore, in the process of scheme evaluation, quantitative calculation shall be carried out for those criteria that can be accurately quantified; For those criteria that are difficult to accurately quantify or cannot be quantified, it is necessary to make a rough estimation or invite relevant experts to conduct qualitative analysis and hierarchical semi quantitative description. On account of the complexity and uncertainty of objective things, as well as the fuzziness brought by human cognitive level and thinking mode, it is difficult for experts to give accurate and quantitative information in evaluation process. Therefore, how to realize mutual transformation between qualitative and quantitative as well as reflect the soft reasoning ability in linguistic expression has always been a research hot-spot in uncertain system evaluation and decision-making.

    For example, the fuzzy set [1] shows the relationship between scheme and criterion in a quantitative way, which has been recognized by many scholars. Since then, quantitative decision tools, that is, various extensions of fuzzy set [2,3,4,5], have been emerged to show decision information. However, with the ceaseless advancement and change of decision-making environment, it is difficult for decision-makers to use a set of quantitative and specific values to describe the decision-making information of a scheme under a certain criterion. To solve this deficiency, Zadeh proposed linguistic variable (LV) [6], which qualitatively displays the decision information of decision-makers in a non-numerical way for the first time. Then, In line with LV, decision tools such as uncertain LV [7,8,9], hesitant fuzzy linguistic term set (HFLTS) [10,11], terms with weakening modifiers [12] appeared to help decision-makers give qualitative decision information. In the face of complex MADM problems, owing to the influence of complex information as well as uncertain factors of group cognition, people sometimes use a single linguistic term (LT) to describe attribute evaluation information, but sometimes need to use several LTs to express decision information at the same time [13,14]. For example, when students evaluate the quality of class teaching, they may use both "good" and "very good" to evaluate it at the same time. Inspired by hesitant fuzzy sets [15] and linguistic term set (LTS) [6], Rodriguez et al [10] defined HFLTS in 2012, which allows decision-makers to use several possible LTs to evaluate attributes simultaneously.

    Although HFLTSs can meet the needs of decision-makers to express information by multiple LTs, the HFLTSs are assumed that the weight of all possible LTs are equal. Obviously, this assumption is too idealistic and inconsistent with actual situation. Because although decision-makers shilly-shally about several possible LTs, they may tend to use some of them under certain circumstances. Therefore, different LTs should possess different weights. In line with this reality, Pang et al. (2016) Proposed probabilistic linguistic term sets (PLTSs), which is composed of possible LTs and associated with their probabilities [16]. On the one hand, probability linguistic contains several LTs to show decision-makers view in decision-making, which retains the good nature of HFLTS. On the other hand, it reflects the corresponding weights of several LTs. This way of displaying decision information by combining qualitative and quantitative information well reflects decision-makers decision information, which will not lose linguistic evaluation information, so they can make decision evaluation more in line with the reality. Although it is difficult to give a definite decision-making view on the problems that needs to decide, it will give the weight of corresponding view and give relatively clear decision-making information as much as possible to help experts solve decision-making problems. Briefly, the merit of PLTSs is that it can express information more completely and accurately. Hence, PLTSs could be utilized to solve practical decision-making problems.

    Aggregation operator (AO) is an important tool for information fusion. Most AOs are built on the special triangle t-norm. Archimedeans t-norm (ATN) and Archimedeans t-conorm (ATC) are composed of t-norm (TN) and t-conorm(TC) families. They can deduce some basic algorithms of fuzzy sets. Linguistic scaling functions can define different semantics for LTs in different linguistic environments. At the same time, the significant advantage of Muirhead operator is that it can reflect the relationship between any parameters. Liu et al. [17] defined the algorithm for PLTS based on ATN and linguistic scaling function, and then combined the Muirhead average operator with the PLTSs to propose the Archimedeans Muirhead average operator and Archimedeans weighted Muirhead average operator of probabilistic linguistic, Archimedean dual Muirhead average operator of probability linguistic and Archimedean weighted dual Muirhead average operator of probability linguistic. After that, more and more attention has been paid to various aggregation operators [18,19,20]. In real MADM, it is rare that the evaluation attributes of various alternatives are independent with each other. For example, there is a positive correlation between teaching quality and lesson design, that is, the better the curriculum design, the higher the quality of teaching. For capturing these dependencies, Maclaurin [21] initially proposed Maclaurin symmetric mean (MSM) operator, which can consider the relationship between multiple attribute values at the same time, and MSM has an adjusting parameter k. The MSM operator is a flexible operator that can consider the relationship between several attribute values. Therefore, it is essential to develop some MSM operators [22,23,24,25,26,27,28,29,30,31,32,33,34] in different polymerization environment; Besides, the operation laws are essential in the process of aggregation, and they can generate many operation laws based on certain ATTs and ATCs. Although MSM operators have attracted a lot of attentions since it's appearance, MSM operator has some disadvantages. The main disadvantage of MSM operator is that it only focus on the overall relationship, ignoring heterogeneity among individuals. To address this handicap, Detemple and Robertson [35] proposed generalized Maclaurin symmetric mean (GMSM), which is considered as a new generalization of MSM. GMSM can not only reflect the relationship of the whole, but also consider the importance level of individuals. Besides, compared with MSM, GMSM can avoid information loss. Because the polymerization process increased equality constraints. Therefore, GMSM is extensively employed in information fusion.

    Since PLTSs are introduced by integrating the LTSs and the HFSs, PLTSs can successfully express random and fuzzy information. Therefore, it is necessary to develop a novel important probabilistic linguistic information fusion tool (that is, PLGMSM operator) which can not only combine the merits of PLTSs and MSM, but also reflect the relationship of the whole and consider the importance level of individuals. These considerations lead us to lock the main targets that follow from this work:

    (1) To introduce new probabilistic linguistic GMSM operators along with investigate some properties as well as some special situations;

    (2) To construct an MADM algorithm based upon the proposed PLGMSM operators;

    (3) To manifest an example based on probabilistic linguistic information to prove the availability of the proposed MADM approach;

    (4) To analyze the sensitivities of parameters in the proposed aggregation operators.

    To achieve the above objective, some probabilistic linguistic GMSM operators are introduced for PLTSs based on ATN and ATC in current work. The structure of this work is arranged as: In Sect.2, some related basic concepts are presented, for instance PLTS, MSM operators, ATN and ATC, etc. In Sect.3, the PLGMSM are introduced based upon the ATN and ATC, some properties of the PLGMSM operators and special situations of PLGMSM operators are also given. In Sect.4, the weighted PLGMSM (WPLGMSM) is introduced based upon the ATN and ATC, some properties of the PLGMSM and special situations of WPLGMSM are also listed in this section. Section. 5 constructs a MADM method for evaluating quality of classroom teaching. Some comparisons are carried out in Sect.6. and a conclusion is made in Sect.7.

    Some basic concepts will be reviewed in this part, including linguistic term set (LTS), probabilistic linguistic term set (PLTS), ATN and ATC.

    Definition 2.1. [36] Suppose S={sv|v=τ,,1,0,1,,τ} be a LTS, where sv expresses a possible value of a LV, and τ is a positive integer. For any two LVs sα,sβS, it satisfies: if α>β, then sα>sβ.

    Definition 2.2. [16] Suppose S={sv|v=τ,,1,0,1,,τ} be a LTS, a PLTS is defined as following:

    (p)={(i)(p(i))|(i)S,p(i)0,i=1,,#(p),#(p)i=1p(i)1} (2.1)

    where (i)(p(i)) denotes the i-th LV with probability p(i), and #(p) represents the number of all different elements in (p).

    In line with Definition 2.2, Eq (2.1) can be transformed

    (˜p)={(i)(˜p(i))|(i)S,˜p(i)0,i=1,,#(p),#(p)i=1˜p(i)=1} (2.2)

    where ˜p(i)=p(i)/#(p)i=1p(i).

    The score of (p) can be calculated as

    E((p))=sr, (2.3)

    where r=#(p)i=1r(i)p(i)/#(p)i=1p(i), r(k) is subscript of (k).

    The deviation degree of (p) is

    σ((p))=(#pi=1((r(i)r)p(i))2)1/2/#(p)i=1p(i). (2.4)

    For any two LPTSs 1(p),2(p),

    (1) if E(1(p))>E(2(p)), the 1(p)>2(p);

    (2) if E(1(p))=E(2(p)), when σ(1(p))>σ(2(p)), then 1(p)<2(p);

    (3) if E(1(p))=E(2(p)), when σ(1(p))=σ(2(p)), then 1(p)=2(p).

    In order to calculate the PLTSs more conveniently, the transformation function g was introduced by Gou et al. [37]. Suppose there is a LTS S and a PLTS (p), the g and g1 are defined as:

    g:[τ,τ][0,1],g(v(p))={(ν+τ2τ)(p(i))}={(γ)(p(i))},γ[0,1], (2.5)

    and

    g1:[0,1][τ,τ],g1(g((p)))={S(2γ1)τ(p(i))|γ[0,1]}=(p). (2.6)

    AOs are very important tools for information fusion in some decision-making problems. However, most of AOs are defined based on TNs and TCs. So it is essentially to review TNs and TCs before the operations of PLTS are given.

    Definition 2.3. [37] If the function ς:[0,1]2[0,1] meets the following four requirements for all α,β,δ[0,1], it was named as a TN:

    (1) ς(α,β)=ς(β,α);

    (2) ς(α,ς(β,δ))=ς(ς(α,β),δ);

    (3) ς(α,β)ς(α,δ), if βδ;

    (4) ς(1,α)=α.

    A TC ς [38] is a mapping from [0,1]2 to [0,1], if ς meets the following four requirements for all α,β,δ[0,1]:

    (1) ς(α,β)=ς(β,α);

    (2) ς(α,ς(β,δ))=ς(ς(α,β),δ);

    (3) ς(α,β)ς(α,δ), if βδ;

    (4) ς(0,α)=α.

    The TN ς and TC ς are dual, that is, ς(α,β)=1ς(1α,1β).

    A TN ς is Archimedean t-norm (ATN), if there exists an integral n, such that ς(a,,an  times)<b for any (a,b)[0,1]2. A TC ς is Archimedean t-conorm (ATC), if there is an integral n, such that ς(a,,an  times)>b for any (a,b)[0,1]2. Specially, if ς and ς satisfy the three given requirements:

    (1) ς and ς are continuous;

    (2) ς and ς and are strictly increasing;

    (3) for all α[0,1], and ς(α,α)>α,

    then ς and ς are strict ATN and strict ATC respectively.

    Assuming there is an additive generator J:[0,1][0,). A strict ATN ς(α,β) can be defined by:

    ς(α,β)=J1(J(α)+J(β)), (2.7)

    where J1 is the inverse of J. Similarly, its ATC ς(α,β) also can be generated by its additive generator J:

    ς(α,β)=(J)1(J(α)+J(β)), (2.8)

    where J(α)=J(1α), (J)1(α)=1J1(α) and (J)1 is the inverse of J.

    Moreover, we can also derive ς(α,β) as:

    ς(α,β)=1J1(J(1α)+J(1β)). (2.9)

    MSM operator [21] was originally proposed by Maclaurin and then further generalized by Detemple [35], it's merit is that it can reflect the relationship between multiple input parameters. The MSM is defined as follows:

    Definition 2.4. [21] Let ξ1,ξ2,,ξn be n nonnegative real numbers, and m=1,,n. A MSM operator will be expressed as

    MSM(m)(ξ1,ξ2,ξn)=(1i1<<imnmj=1ξijCmn)1m, (2.10)

    where (i1,i2,,in) is a permutation of (1,2,,n).

    Definition 2.5. [35] Let ξ1,ξ2,,ξn be n nonnegative real numbers, and μj0. A GMSM operator can be expressed as

    GMSM(m,u1,,um  )(ξ1,ξ2,,ξn)=(1i1<<imnmj=1ξujijCmn)1(u1+u2++um  ), (2.11)

    where (i1,i2,,in) is a permutation of (1,2,,n), i=1,2,,n and j=1,2,,m.

    The properties of GMSM(m,u1,,um  ) are given as follows:

    (a) Idempotency. GMSM(m,u1,,um  )  (ξ,,ξ)=ξ, if ξi=ξ for all i;

    (b) Monotonicity. GMSM(m,u1,,um  )  (ξ1,,ξn)GMSM(m,u1,,um  )  (η1,,ηn), if ξiηi for all i;

    (c) Boundedness. mini(ξi)GMSM(m,u1,,um  )  (ξ1,ξ2,,ξn)maxi(ξi).

    Under some special situations, GMSM(m,u1,,um  ) can reduce to some concrete operators when m takes different values:

    (1) When m=2, the GMSM(m,u1,,um  ) will reduce to BM operator:

    GMSM(m,u1,u2)(ξ1,ξ2,,ξn)=(1i<jnξu1iξu2jn(n1))1(u1+u2). (2.12)

    (2) When m=3, the GMSM(m,u1,,um  ) will reduce to generalized BM operator:

    GMSM(m,u1,u2,u3)(ξ1,ξ2,,ξn)=(1i,j,kn,ijkξu1iξu2jξu3kn(n1)(n2))1(u1+u2+u3). (2.13)

    (3) When u1=u2==um=1, the GMSM(m,u1,,um  ) will reduced to MSM operator:

    GMSM(m,u1,,um  )(ξ1,ξ2,,ξn)=(1i1<<imnmj=1ξijCmn)1m. (2.14)

    In terms of ATN and ATC, a series of operation laws of PLTS can be defined as follows:

    Definition 3.1. Let 1(p),2(p) be two PLTSs, then

    (1)

    1(p)2(p)=g1(η(t)ig(i(p))(i=1,2){ς(η(t)1,η(t)2)(p(i)1p(i)2)})=g1(η(t)ig(i(p))(i=1,2){(1J1(J(1η(i)1)+J(1η(i)2)))(p(i)1p(i)2)});

    (2)

    1(p)2(p)=g1(η(t)ig(i(p))(i=1,2){ς(η(i)1,η(i)2)(p(i)1p(i)2)})=g1(η(t)ig(i(p))(i=1,2){J1(J(η(i)1)+J(η(i)2))(p(i)1p(i)2)});

    (3)

    λ1(p)=g1(η(t)1g(1(p)){(1J1(λJ(1η(i)1)))(p(i)1)}),forallλR;

    (4)

    1(p)λ=g1(η(t)1g(1(p)){J1(λJ(η(i)1))(p(i)1)}),forallλR.

    Remark 3.1. In Definition 3.1, J is a generator of ATN, when J takes different function which satisfies the condition of generators, we can obtain different operations of two PLTSs. Therefore, Definition 3.1 can be regarded as a unified expression of some existing operations of PLTSs.

    In what follows, i(p)={(t)i(p(t)i)|t=1,2,,#i(p)} if not specifically stated. Based upon operational laws of PLTSs defined in Defintion 3.1, PLGMSM operator can be proposed and listed as follows.

    Definition 3.2. Let 1(p),,n(p) be a group of PLTSs, the probabilistic linguistic generalized MSM operator (PLGMSM) based on ATN and ATC is a function PLGMSM:ΩnΩ and

    PLGMSM(m,u1,,um)(1(p),,n(p))=(1i1<<imn(mj=1(p)ijuj)Cmn)1u1+u2++um, (3.1)

    where Ω is the set of all PLTSs.

    According to Definition 3.1 and Definition 3.2, the following result can be derived.

    Theorem 3.1. Let 1(p),,n(p) be a group of PLTSs, then

    PLGMSM(m,u1,u2,,um)(1(p),,n(p))=g1(η(t)ig(i(p)){J1(1mk=1ukJ(1J1(1Cmn(Σ1i1<<imnJ(1J1(mj=1ujJ(η(t)ij)))))))(1i1<<imnmj=1p(t)ij)}) (3.2)

    Proof. According to Definition 3.1, we have

    ((p)ij)uj=g1(η(t)ig(i(p)){J1(ujJ(η(t)ij))(p(t)ij)}),

    and

    mj=1((p)ij)uj=g1(η(t)ig(i(p)){J1(mj=1(J(J1(ujJ(η(t)ij)))))(mj=1p(t)ij)})=g1(η(t)ig(i(p)){J1(mj=1(ujJ(η(t)ij)))(mj=1p(t)ij)}),

    therefore

    1i1<<imn(mj=1((p)ij)uj)=g1(η(t)ig(i(p)){1J1(mj=1J(1J1(mj=1ujJ(η(t)ij))))(1i1<<imnmj=1p(t)ij)}).

    Furthermore, we have

    1i1<<imn(mj=1(p)ijuj)Cmn=g1(η(t)ig(i(p)){1J1(1CmnJ(1(1J1(Σ1i1<<imnJ(1J1(mj=1ujJ(η(t)ij)))))))(1i1<<imnmj=1p(t)ij)}).

    So

    (1i1<<imn(mj=1(p)ijuj)Cmn)1u1+u2++um=g1(η(t)ig(i(p)){J1(1mk=1ukJ(1J1(1Cmn(Σ1i1<<imnJ(1J1(mj=1ujJ(η(t)ij)))))))(1i1<<imnmj=1p(t)ij)}).

    Proved.

    Theorem 3.2. Let 1(p),,n(p) be a group of PLTSs. If (1(p)(p),2(p),,n(p)) is a permutation of (1(p),,n(p)), then

    PLGMSM(m, u1u2um)(1(p),,n(p)) = PLGMSM(m, u1u2um)(1(p),,n(p)). (3.3)

    Proof. The proofs is similar to Property 3 in [24]. So, the details are omitted.

    In this section, some special PLGMSMS operators will be investigated when parameters take different values and the generator takes different functions.

    (a) When m=1, the PLGMSM operator based on ATN and ATC will reduce to

    PLMSM(1(p),,n(p))=g1(η(t)i{J1(1u1J(1J1(1n(1inJ(1J1(u1J(η(t)i)))))))(1inp(t)i)}). (3.4)

    (b) When m=2, the PLGMSM operator based on ATN and ATC will reduce to

    PLGMSM(2,u1,u2,)(1(p),,n(p))=g1(η(t)i{J1(1u1+u2J(1J1(1n(n1)(Σ1i1<i2nJ(1J1(2j=1ujJ(η(t)ij)))))))(1i1<i2n2j=1p(t)ij)}). (3.5)

    (c) When u1=u2==um=1, the PLGMSM operator based on ATN and ATC will reduce to

    PLGMSM(m,u1,u2,,um)(1(p),,n(p))=g1(η(t)i{J1(1mJ(1J1(1Cmn(Σ1i1<<imnJ(1J1(mj=1ujJ(η(t)ij)))))))(1i1<<imnmj=1p(t)ij)}). (3.6)

    (a) If J(x)=lnx, it has J1(x)=ex. Then we get probabilistic linguistic Archimedean Algebraic GMSM (PLAAGMSM) [16] operators as follows:

    PLAAGMSM(m,u1,u2,,um)(1(p),,n(p))=g1(η(t)i(1(1i1<<imn(1mj=1(η(t)ij)uj)1Cmn)1mk=1uk)(1i1<<imnmj=1p(t)ij)). (3.7)

    In this situation, GPLGMSM reduce to the PLAAMSM.

    (b) If J(x)=ln2xx, it gains J1(x)=2ex+1. We get probabilistic linguistic Archimedean Einstein GMSM (PLAEGMSM) operators as follows:

    PLAEGMSM(m,u1,u2,,um)(1(p),,n(p))=g1(η(t)I(2(A1)1mk=1uk(2A+3)1mk=1uk+(A1)1mk=1uk)(1i1<<imnmj=1p(t)ij)), (3.8)

    in which,

    A=1i1<<imn(mj=1(2η(t)ij)uj+3mj=1(η(t)ij)ujmj=1(2η(t)ij)ujmj=1(η(t)ij)uj)1Cmn.

    (c) If J(x)=lnε+(1ε)xx (ε>0), then it has J1(x)=εex+ε1. We can get probabilistic linguistic Archimedean Hamacher GMSM (PLAHGMSM) operators as follows.

    PLAHGMSM(m,u1,u2,,um)(1(p),,n(p))=g1(η(t)i(ε(ε2b1+1)1mk=1uk+ε1)(1i1<<imnmj=1p(t)ij)), (3.9)

    in which,

    b=1i1<<imn(ε2a1+1)1Cmn,

    and where

    a=mj=1(ε+(1ε)η(t)ijη(t)ij)uj.

    In this case, when ε=1, PLAHGMSM reduces to the GPLAAMSM.

    Example 3.1. Suppose 1={1(1)}, 2={s2(1)}, 3={s0(0.3),s1(0.7)} be three PLTSs, applying the function g to convert i (i=1,2,3) into

    g(1)={0.25(1)},g(2)={0(1)},g(3)={0.5(0.3),0.75(0.7)}.

    Besides, previous different operators could be used to aggregate i (i=1,2,3). Here, set m=2,u1=1,u2=2. In line with the above formula, we get

    PLAAGMSM(2, 1, 2)(1(p),2(p),3(p))=g1(η(t)ig(i(p)),i=1,3(1(1i1<i23(12j=1(η(t)ij)uj)1C23)11+2)(1i1<i232j=1p(t)ij))={s1.34(0.3),s0.8(0.7)}.

    Due to each individual's different background knowledge and preference, the importance should be different. Hence, it is essential to consider the individual weight information to make the decision results are more reasonable and scientific. In this section, the weighted probabilistic linguistic generalized MSM operators based on ATN and ATC will be introduced.

    Definition 4.1. Let 1(p),,n(p) be n PLTSs and wi be the weight of i(p) with wi[0,1], ni=1wi=1. The WPLGMSM is a function WPLGMSM(m, u1u2um):ΩnΩ, if

    WPLGMSM(m, u1u2um)(1(p),,n(p))=(1i1<<imn(mj=1((nwij)(p)ij)uj)Cmn)1u1+u2 + +um, (4.1)

    where Ω is the set of all PLTSs.

    In the light of Definition 4.1, the following result can be derived.

    Theorem 4.1. Let 1(p),,n(p) be n PLTSs and wi be the weight of i(p) with wi[0,1], ni=1wi=1. Then

    WPLGMSM(m, u1u2um)(1(p),,n(p))=g1(η(t)ig(i(p)){J1(1mk=1ukJ(1J1(1Cmn1i1<<imnJ(1J1(mj=1ujJ(1J1(nwijJ(1η(t)ij))))))))}(1i1<<imnmj=1pij(t))).

    Proof. In line with the operational formula, we have

    (nwij(p)ij)=g1(η(t)ijg((p)ij){1J1(nwijJ(1η(t)ij))}(p(t)ij)),(nwij(p)ij)uj=g1(η(t)ijg((p)ij){{J1[ujJ(1J1(nwijJ(1η(t)ij)))]}}(p(t)ij)).

    Therefore,

    mj=1(nwij(p)ij)uj=g1(η(t)ijg((p)ij){J1(mj=1J(J1[ujJ(1J1(nwijJ(1η(t)ij)))]))}(mj=1p(t)ij))=g1(η(t)ijg((p)ij){J1(mj=1(ujJ(1J1(nwijJ(1η(t)ij)))))}(mj=1p(t)ij))

    and so

    mj=1(nwij(p)ij)uj=g1(η(t)ijg((p)ij){J1(mj=1J(J1[ujJ(1J1(nwijJ(1η(t)ij)))]))}(mj=1p(t)ij))=g1(η(t)ijg((p)ij){J1(mj=1(ujJ(1J1(nwijJ(1η(t)ij)))))}(mj=1p(t)ij)),
    1Cmn1i1<<imn(mj=1(nwij(p)ij)uj)=g1(η(t)ijg((p)ij){1J1(1CmnJ(J1[1i1<<imnJ(1J1(mj=1ujJ(1J1(nwijJ(1η(t)ij)))))]))}(1i1<<imnmj=1pij(t)))=g1(η(t)ijg((p)ij){1J1(1Cmn(1i1<<imnJ(1J1(mj=1ujJ(1J1(nwijJ(1η(t)ij)))))))}(1i1<<imnmj=1pij(t))).

    Hence,

    (1Cmn1i1<<imn(mj=1((nwij)(p)ij)uj))1u1+u2 + +um=g1(η(t)ijg((p)ij){J1(1mk=1ukJ(1J1(1Cmn1i1<<imnJ(1J1(mj=1ujJ(1J1(nwijJ(1η(t)ij))))))))}(1i1<<imnmj=1pij(t))).

    Proved.

    Theorem 4.2. Let 1(p),,n(p) be a group of PLTSs. If (1(p),,n(p)) is a permutation of (1(p),,n(p)), then {

    WPLGMSM(m, u1u2um)(1(p),,n(p)) = WPLGMSM(m, u1u2um)(1(p),,n(p)). (4.2)

    Proof. The proofs of this theorem is similar to Property 3 in [24]. So, the details are omitted.

    In this section, some special PLGMSMS operators will be investigated when the parameters take different values and the generator takes different function.

    (a) When m=1, the WPLGMSM operator based on ATN and ATC will reduce to

    WPLMSM(1(p),,n(p))=g1(η(t)ig(i(p)){J1(1u1J(1J1(1n1i1nJ(1J1(ujJ(1J1(nwijJ(1η(t)ij))))))))}(1i1npi1(t))).

    (b) When m=2, the PLGMSM operator based on ATN and ATC will reduce to

    PLGMSM(2, u1u2, )(1(p),,n(p))=g1(η(t)ig(i(p)),{J1(1u1+u2J(1J1(1n(n1)(Σ1i1<i2nJ(1J1(2j=1ujJ(1J1(nwijJ(1η(t)ij)))))))))(1i1<i2n2j=1p(t)ij)}).

    (c) When u1 = u2 =  = um = 1, the PLGMSM operator based on ATN and ATC will reduce to

    PLGMSM(m, u1u2um)(1(p),,n(p))=g1(η(t)ijg((p)ij){J1(Jm(1J1(1Cmn(Σ1i1<<imnJ(1J1(mj=1ujJ(1J1(nwijJ(1η(t)ij)))))))))(1i1<<imnmj=1p(t)ij)}).

    In the what follows, the special situations of the WPLGMSM based on ATN and ATC will be discussed.

    (1) If J(x)=lnx, then J1(x) = ex. The weighted probabilistic linguistic Archimedean Algebraic GMSM (WPLAAGMSM) operators will be obtained as follows:

    WPLAAGMSM(m, u1u2um)(1(p),,n(p))=g1(η(t)ijg((p)ij)(1(1i1<<imn(1mj=1(1(1η(t)ij)nwij)uj)1Cmn)1u1+u2 + +um)(1i1<<imnmj=1p(t)ij)). (4.3)

    (2) If J(x)=ln 2xx, it has J1(x) = 2ex+1. Then the weighted probabilistic linguistic Archimedean Einstein GMSM (WPLAEGMSM) operators will be obtained as follows:

    WPLAEGMSM(m, u1u2um)(1(p),,n(p)))=g1(η(t)ijg((p)ij)(2(A1Cmn1)1u1+u2 + +um(A1Cmn1)1u1+u2 + +um+(A1Cmn+1)1u1+u2 + +um)(1i1<<imnmj=1p(t)ij)), (4.4)

    where,

    A=1i1<<imn((mj=1((2η(t)ij)nwij+(η(t)ij)nwij(2η(t)ij)nwij(η(t)ij)nwij)uj+1)/(mj=1((2η(t)ij)nwij+(η(t)ij)nwij(2η(t)ij)nwij(η(t)ij)nwij)uj+1)(mj=1((2η(t)ij)nwij+(η(t)ij)nwij(2η(t)ij)nwij(η(t)ij)nwij)uj1)(mj=1((2η(t)ij)nwij+(η(t)ij)nwij(2η(t)ij)nwij(η(t)ij)nwij)uj1)).

    (3) If J(x)=ln ε+(1ε)xx (ε>0), then J1(x) = εex+ε1, the weighted probabilistic linguistic Archimedean Hamacher GMSM (WPLAHGMSM) operators will be obtained as follows:

    WPLAHGMSM(m, u1u2um)(1(p),,n(p))=g1(η(t)ijg((p)ij){ε(Cij)1u1+u2 + +um(ε+(1ε)Cij)1u1+u2 + +um(1ε)(Cij)1u1+u2 + +um}(1i1<<imnmj=1p(t)ij)), (4.5)

    where,

    Cij=((1i1<<imnε+(1ε)BijBij)1Cmn1)/((1i1<<imnε+(1ε)BijBij)1Cmn1)((1i1<<imnε+(1ε)BijBij)1Cmn(1ε))((1i1<<imnε+(1ε)BijBij)1Cmn(1ε)),B(t)ij=(ε+(1ε)Aij)ujAijuj(ε+(1ε)Aij)uj(1ε)Aijuj,A(t)ij=(ε+(1ε)(1η(t)ij))nwij(η(t)ij)nwij(ε+(1ε)(1η(t)ij))nwij(1ε)(η(t)ij)nwij.

    In the following, we will continue to give some examples to testify different aggregation operators, and discuss some special situations for diverse parameters.

    Example 4.1. Let 1={s - 1(0.3),s1(0.7)}, 2={s1(1)}, 3={s0(0.25),s2(0.75)} be three PLTSs. Suppose w=(0.35,0.25,0.4) is the weight vector of 1,2,3. Set τ=3, then, with the function g, 1,2,3 will converted into g(1(p))={0.33(0.3),0.67(0.7)}, g(2(p))={0.67(1)}, g\left({\ell{_3}\left(p \right)} \right) = \left\{ {0.5(0.25), 0.83\left({0.75} \right)} \right\} , respectively.

    Then will use the WPLGMSM operator based on ATN and ATC to fuse \ell{_1}, \ell{_2}, \ell{_3} . set m\; = \; 2, {u_1}\; = \; 1, {u_2} = 2 , with different additive generators, the aggregated results are obtained as follows:

    (1) If J\left(x \right) = - {\text{ln }}x :

    \begin{array}{l} &&WPLGMS{M^{{\text{(2, 1, }}2{\text{)}}}}\left( {\ell{_1}\left( P \right), \ell{_2}\left( P \right), \ell{_3}\left( P \right)} \right)\\ & = & {\left( {\frac{{\mathop \oplus \limits_{1 \leqslant {i_1} < {i_2} \leqslant 3} \left( {\mathop \otimes \limits_{j = 1}^2 {{\left( {\left( {3{w_{{i_j}}}} \right) \otimes \ell{{\left( p \right)}_{{i_j}}}} \right)}^{{u_j}}}} \right)}}{{C_3^2}}} \right)^{\frac{1}{{1 + 2}}}}\\ & = & \left\{ {\begin{array}{*{20}{c}} {{S_{0.068}}\left( {0.006} \right)}&{{S_{0.329}}\left( {0.013} \right)}&{{S_{0.436}}\left( {0.017} \right)}&{{S_{1.024}}\left( {0.039} \right)} \\ {{S_{0.329}}\left( {0.013} \right)}&{{S_{0.546}}\left( {0.031} \right)}&{{S_{0.637}}\left( {0.039} \right)}&{{S_{1.153}}\left( {0.092} \right)} \\ {{S_{0.708}}\left( {0.017} \right)}&{{S_{0.873}}\left( {0.039} \right)}&{{S_{0.943}}\left( {0.051} \right)}&{{S_{1.362}}\left( {0.118} \right)} \\ {{S_{0.873}}\left( {0.039} \right)}&{{S_{1.108}}\left( {0.092} \right)}&{{S_{1.081}}\left( {0.118} \right)}&{{S_{1.460}}\left( {0.276} \right)} \end{array}} \right\}\\ & = &\left\{ {\begin{array}{*{20}{c}} {{S_{0.068}}\left( {0.006} \right)}&{{S_{0.329}}\left( {0.026} \right)}&{{S_{0.436}}\left( {0.017} \right)}&{{S_{1.024}}\left( {0.039} \right)} \\ {{S_{0.546}}\left( {0.031} \right)}&{{S_{0.637}}\left( {0.039} \right)}&{{S_{1.153}}\left( {0.092} \right)}&{{S_{0.708}}\left( {0.017} \right)} \\ {{S_{0.873}}\left( {0.078} \right)}&{{S_{0.943}}\left( {0.051} \right)}&{{S_{1.362}}\left( {0.118} \right)}&{{S_{1.108}}\left( {0.092} \right)} \\ {}&{{S_{1.081}}\left( {0.118} \right)}&{{S_{1.460}}\left( {0.276} \right)}&{} \end{array}} \right\}. \end{array}

    (2) If J\left(x \right) = {\text{ln }}\frac{{2 - x}}{x} :

    \begin{array}{l} &&WPLAEGMS{M^{{\text{(2, 1, }}2{\text{)}}}}\left( {\ell{_1}\left( P \right), \ell{_2}\left( P \right), \ell{_3}\left( P \right)} \right)\\ & = & {\left( {\frac{{\mathop \oplus \limits_{1 \leqslant {i_1} < {i_2} \leqslant 3} \left( {\mathop \otimes \limits_{j = 1}^2 {{\left( {\left( {3{w_{{i_j}}}} \right) \otimes \ell{{\left( p \right)}_{{i_j}}}} \right)}^{{u_j}}}} \right)}}{{C_3^2}}} \right)^{\frac{1}{{1 + 2}}}}\\ & = & \left\{ {\begin{array}{*{20}{c}} {{s_{0.226}}\left( {0.006} \right)}&{{s_{0.469}}\left( {0.013} \right)}&{{s_{0.638}}\left( {0.017} \right)}&{{s_{1.136}}\left( {0.039} \right)} \\ {{s_{1.008}}\left( {0.013} \right)}&{{s_{1.136}}\left( {0.031} \right)}&{{s_{1.233}}\left( {0.039} \right)}&{{s_{1.558}}\left( {0.092} \right)} \\ {{s_{0.437}}\left( {0.017} \right)}&{{s_{0.641}}\left( {0.039} \right)}&{{s_{0.787}}\left( {0.051} \right)}&{{s_{1.235}}\left( {0.118} \right)} \\ {{s_{1.118}}\left( {0.039} \right)}&{{s_{1.235}}\left( {0.092} \right)}&{{s_{1.325}}\left( {0.118} \right)}&{{s_{1.628}}\left( {0.276} \right)} \end{array}} \right\}. \end{array}

    (3) If J\left(x \right) = {\text{ln }}\frac{{\varepsilon + \left({1 - \varepsilon } \right)x}}{x} \left({\varepsilon = 2} \right) :

    \begin{array}{l} &&WPLAHGMS{M^{{\text{(2, 1, }}2{\text{)}}}}\left( {\ell{_1}\left( P \right), \ell{_2}\left( P \right), \ell{_3}\left( P \right)} \right)\\ & = &{\left( {\frac{{\mathop \oplus \limits_{1 \leqslant {i_1} < {i_2} \leqslant 3} \left( {\mathop \otimes \limits_{j = 1}^2 {{\left( {\left( {3{w_{{i_j}}}} \right) \otimes \ell{{\left( p \right)}_{{i_j}}}} \right)}^{{u_j}}}} \right)}}{{C_3^2}}} \right)^{\frac{1}{{1 + 2}}}}\\ & = &\left\{ {\begin{array}{*{20}{c}} {{s_{0.857}}\left( {0.006} \right)}&{{s_{0.782}}\left( {0.013} \right)}&{{s_{0.737}}\left( {0.017} \right)}&{{s_{0.568}}\left( {0.039} \right)} \\ {{s_{0.567}}\left( {0.013} \right)}&{{s_{0.529}}\left( {0.031} \right)}&{{s_{0.505}}\left( {0.039} \right)}&{{s_{0.406}}\left( {0.092} \right)} \\ {{s_{0.721}}\left( {0.017} \right)}&{{s_{0.666}}\left( {0.039} \right)}&{{s_{0.632}}\left( {0.051} \right)}&{{s_{0.497}}\left( {0.118} \right)} \\ {{s_{0.496}}\left( {0.039} \right)}&{{s_{0.465}}\left( {0.092} \right)}&{{s_{0.445}}\left( {0.118} \right)}&{{s_{0.361}}\left( {0.276} \right)} \end{array}} \right\} \end{array}

    Before giving the decision-making approach, a formal description of a MADM problem with probabilistic linguistic information will be given. Suppose A = \left\{{{A_1}, \ldots, {A_k}} \right\} be a set of diverse alternatives, CR = \left\{ {C{R_1}, C{R_2}, \ldots, C{R_l}} \right\} be the set of different attributes, and w = \left\{{{w_1}, {w_2}, \ldots, {w_l}}\right\} be the weight vector of attributes C{R_i} with {w_i} and \sum\nolimits_{i = 1}^l {{w_i}} = 1 . A probabilistic linguistic decision matrix can be expressed as M{\text{ = }}{\left({\ell{{\left(p \right)}_{ij}}} \right)_{k \times l}} , where \ell{\left(p \right)_{ij}}{\text{ = }}\left\{ {\ell_{ij}^{\left(t \right)}\left({p_{ij}^{\left(t \right)}} \right)|t = 1, 2, \ldots, \# \ell{{\left(p \right)}_{ij}}} \right\} is a PLTS, and \ell{\left(p \right)_{ij}} expresses the evaluation value of alternatives {A_j}\left({j = 1, 2, \ldots, k} \right) for the attributes C{R_i}\left({i = 1, \ldots, l} \right) .

    In line with the given above-mentioned description of MADM problem, the proposed aggregated operators will adopted to address some actual issues and find an ideal alternative. Some main procedures are listed as follows:

    Step 1. Standardize the attribute values by the following ways:

    If the attribute is a benefit type, then

    \begin{array}{l} \ell{\left( p \right)_{ij}}{\text{ = }}\left\{ {\ell_{ij}^{\left( t \right)}\left( {p_{ij}^{\left( t \right)}} \right)|t = 1, 2, \ldots, \# \ell{{\left( p \right)}_{ij}}} \right\}, \end{array} (5.1)

    If the attribute is a cost type, then

    \begin{array}{l} \ell{\left( p \right)_{ij}}{\text{ = }}{g^{ - 1}}\left( {\mathop \cup \limits_{\eta _{ij}^{\left( t \right)} \in g\left( {L{\text{S}}{{\left( p \right)}_{{\text{ij}}}}} \right)} \left\{ {\left( {1 - \eta _{ij}^{\left( t \right)}} \right)\left( {p_{ij}^{\left( t \right)}} \right)} \right\}} \right). \end{array} (5.2)

    Step 2. Transform all attributes values \ell{\left(p \right)_{ij}} of each alternative to probabilistic hesitant fuzzy element r{\left(p \right)_{ij}} .

    Step 3. Aggregate all attributes values r{\left(p \right)_{ij}} of each alternative to the comprehensive values r{\left(p \right)_j} .

    Step 4. Transform r{\left(p \right)_j} into PLTS \ell{\left(p \right)_j} .

    Step 5. Calculate the score function and the deviation degree of {A_j}\left({j = 1, \ldots, k} \right) by Eq (2.3) and Eq (2.4).

    Step 6. Rank all alternatives and then choose the desirable one.

    This section will discuss the decision making option based upon the given WPLGMSM with experimental cases.

    Example 5.1. At present, continuous improvement of education quality has been placed at an important position in colleges and universities, and the evaluation of teaching quality is the baton for the healthy development of education, as well as an essential part of education mechanism. Exploring the evaluation index system of teaching quality, building a scientific evaluation model, and forming a reasonable education evaluation system will help to improve the teaching quality and promote the high-quality development of education. In this study four main factors will be used as teaching quality evaluation indexes, they are C{R_1} : teaching content, C{R_2} : teaching method, C{R_3} : teaching effect and C{R_4} : teaching attitude. It is assumed that the weight of four indexes are w = {\left({0.2, 0.3, 0.4, 0.1} \right)} , and four teachers' ({A_1}-{A_4}) teaching course Bayesian formula and its application in Probability Theory and Mathematical Statistics will be evaluated. At the same time, through the questionnaire survey on teaching experience of some graduated students and teachers, they are required to evaluate with the following linguistic variables through their own experience:

    \begin{array}{l} &\{{s_{ - 3}}{ { = extremely ~~bad, }}{s_{ - 2}} = { {very ~~bad, }}{s_{ - 1}} = { {bad, }}{s_0}{ { = medium, }}\\ &{s_1}{ { = good, }}{s_2}{ { = very ~~good, }}{s_3}{ { = extremely~~ good}}\}. \end{array}

    After collecting data, relevant decision-making information is obtained as in Table 1.

    Table 1.  Original decision making matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    A_1 \left\{ {{s_0}\left({0.45} \right), {s_1}\left({0.55} \right)} \right\} \left\{ {{s_2}\left(1 \right)} \right\} \left\{ {{s_0}\left({0.3} \right), {s_2}\left({0.7} \right)} \right\} \left\{ {{s_0}\left(1 \right)} \right\}
    A_2 \left\{ {{s_0}\left(1 \right)} \right\} \left\{ {{s_0}\left({0.25} \right), {s_2}\left({0.75} \right)} \right\} \left\{ {{s_1}\left(1 \right)} \right\} \left\{ {{s_0}\left(1 \right)} \right\}
    A_3 \left\{ {{s_0}\left({0.45} \right), {s_1}\left({0.55} \right)} \right\} \left\{ {{s_2}\left(1 \right)} \right\} \left\{ {{s_0}\left({0.3} \right), {s_2}\left({0.7} \right)} \right\} \left\{ {{s_0}\left(1 \right)} \right\}
    A_4 \left\{ {{s_0}\left({0.45} \right), {s_1}\left({0.55} \right)} \right\} \left\{ {{s_2}\left(1 \right)} \right\} \left\{ {{s_0}\left({0.3} \right), {s_2}\left({0.7} \right)} \right\} \left\{ {{s_0}\left(1 \right)} \right\}

     | Show Table
    DownLoad: CSV

    The following task is to make decision by using the procedure in Section 5.1:

    Step 1. Standardize the attribute values \ell{\left(p \right)_{ij}} . As all criteria are benefit-type, so it is not necessary to standardize.

    Step 2. Transformed all attributes values of each alternative to probabilistic hesitant fuzzy element r\left(p \right)_{ij} . We set \tau = 3 and use the function of g . Probabilistic linguistic information will transformed into probabilistic hesitant fuzzy element and listed r\left(p \right)_{ij} in Table 2.

    Table 2.  Probabilistic hesitant fuzzy element decision information matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    g\left({{A_1}(p)} \right) \left\{ {\frac{1}{2}\left({0.45} \right), \frac{2}{3}\left({0.55} \right)} \right\} \left\{ {\frac{5}{6}\left(1 \right)} \right\} \left\{ {\frac{1}{2}\left({0.3} \right), \frac{5}{6}\left({0.7} \right)} \right\} \left\{ {\frac{1}{2}\left(1 \right)} \right\}
    g\left({{A_2}(p)} \right) \left\{ {\frac{1}{2}\left(1 \right)} \right\} \left\{ {\frac{1}{2}\left({0.25} \right), \frac{5}{6}\left({0.75} \right)} \right\} \left\{ {\frac{2}{3}\left(1 \right)} \right\} \left\{ {\frac{1}{2}\left(1 \right)} \right\}
    g\left({{A_3}(p)} \right) \left\{ {\frac{1}{2}\left({0.5} \right), \frac{2}{3}\left({0.5} \right)} \right\} \left\{ {\frac{2}{3}\left(1 \right)} \right\} \left\{ {\frac{1}{3}\left({0.3} \right), \frac{5}{6}\left({0.7} \right)} \right\} \left\{ {\frac{1}{3}\left(1 \right)} \right\}
    g\left({{A_4}(p)} \right) \left\{ {\frac{5}{6}\left(1 \right)} \right\} \left\{ {\frac{1}{2}\left({0.35} \right), \frac{5}{6}\left({0.65} \right)} \right\} \left\{ {\frac{2}{3}\left(1 \right)} \right\} \left\{ {\frac{2}{3}\left(1 \right)} \right\}

     | Show Table
    DownLoad: CSV

    Step 3.-Step 4. We choose the aggregation operator based on algebraic generator to fuse decision information. As the vast numbers, the results not listed here.

    Step 5. Calculate the expected value and listed as follows:

    \begin{array}{l} E({A_1}) = 1.1233, \; E({A_2}) = 1.1145, \; E({A_3}) = 0.6608, \; E({A_4}) = 1.4618. \end{array}

    Step 6. Determine the desirable alternative according to the expected values. From the calculated results of Step 5, we have A_4\succ A_1\succ A_2\succ A_3 . Therefore, {A_4} is the desirable one.

    Meanwhile, we use other three proposed aggregation operators to fuse above decision information, the results are listed in Table 3.

    Table 3.  The ranking based three proposed aggregation operators when {u_1}{\text{ = }}1 , {u_2}{\text{ = }}2 .
    Aggregation operators Expected values Ranking
    WPLAAGMSM E({A_1}) = 1.1233, E({A_2}) = 1.1145, E({A_3}) = 0.6608, E({A_4}) = 1.4618 {A_4} \succ {A_1} \succ {A_2} \succ {A_3}
    WPLAEGMSM E({A_1}) = 1.2210, E({A_2}) = 0.8550, E({A_3}) = 0.8217, E({A_4}) = 1.2546 {A_4} \succ {A_1} \succ {A_2} \succ {A_3}
    WPLAHGMSM E({A_1}) = - 0.3405, E({A_2}) = - 0.3837, E({A_3}) = - 0.3964, E({A_4}) = - 0.2681 {A_4} \succ {A_1} \succ {A_2} \succ {A_3}

     | Show Table
    DownLoad: CSV

    It is obviously the ranking results are consistent with different aggregated operators. Meanwhile, we feed back the ranking results of this paper to some evaluators. Most of them state that the results are in line with their selection order, which also demonstrates the rationalities and effectiveness of the proposed method in Section 5.1.

    To further justify the validity and robustness of our proposed decision-making method, more comparisons will be carried out in this section.

    B. Fang, et al.[40] proposed an improved possibility degree formula to assess the education and teaching quality in military academies with probabilistic linguistic MCDM method, some main concepts are reviewed as follows.

    Definition 6.1. [40] Assume S = \left\{ {{s_\upsilon }|\upsilon = -\tau, \ldots, -1, 0, 1, \ldots, \tau} \right\} be a LTS, for any two PLTSs \ell{_1}(p) and \ell{_2}\left(p \right) , the possibility degree of \ell{_1}\left(p \right) \geqslant \ell{_2}\left(p \right) could be defined as follows:

    \begin{array}{l} P\left( {\ell{_1} \geqslant \ell{_2}} \right) = 0.5+\sum\limits_{t = 1}^{\# \ell{_1}} {\left( {\frac{{\tau + r_1^{(t)}}}{{2\tau }} - 0.5{{\left( {\frac{{\tau + r_1^{(t)}}}{{2\tau }}} \right)}^2}} \right)} * p_1^{\left( t \right)}-\sum\limits_{t = 1}^{\# \ell{_2}} {\left( {\frac{{\tau + r_2^{(t)}}}{{2\tau }} - 0.5{{\left( {\frac{{\tau + r_2^{(t)}}}{{2\tau }}} \right)}^2}} \right)} * p_2^{\left( t \right)} \end{array} (6.1)

    in which, r_1^{(t)} and r_2^{(t)} are the subscript of \ell_1^{\left(t \right)} and \ell_2^{\left(t \right)} , p_1^{\left(t \right)} and p_2^{\left(t \right)} are the corresponding probability, respectively.

    Step 1. Calculate comprehensive possibility degree matrix. For each attribute C{R_j} , {w_j} is the weight of C{R_j} and \sum\limits_{j = 1}^n {{w_j} = 1} . If P_{ik}^j = P\left({\ell{_{ij}} \ge \ell{_{kj}}} \right) , then the possibility degree matrix of will be defined as follows:

    \begin{array}{l} {P_j} = \left( {\begin{array}{*{20}{c}} {P_{11}^j}&{P_{12}^j}& \cdots &{P_{1n}^j}\\ {P_{21}^j}&{P_{22}^j}& \cdots &{P_{2n}^j}\\ \vdots & \vdots & \ddots & \vdots \\ {P_{n1}^j}&{P_{2n}^j}& \cdots &{P_{nn}^j} \end{array}} \right). \end{array}

    Step 2. Then with the method of weighted arithmetic average, the comprehensive possibility degree matrix will be calculated by

    \begin{array}{l} P = \sum\limits_{j = 1}^n {{w_j}} {P_j}. \end{array}

    Step 3. Calculate the ranking results of alternatives Set \delta = {\left({{\delta _1}, {\delta _2}, \cdots, {\delta _m}} \right)^T } is the ordering vector of matrix P , and 0 \leq \delta _i \leq 1 with \sum\limits_{i = 1}^m {{\delta _i}} = 1 . Then the alternatives can be ranked with the values of {\delta _i} . The higher value of {\delta _i} , the better of the alternative, in which,

    \begin{array}{l} {\delta _i} = \frac{1}{m}\left( {\sum\limits_{k = 1}^m {{P_{ik}} + 1} } \right) - 0.5, \end{array}

    with this method, the teaching quality in Example 5.1 could be ranked as follows.

    Firstly, calculating the possibility degree matrix with Step 1.

    \begin{array}{l} {P_1} = \left( {\begin{array}{*{20}{c}} {0.5}&{0.5382}&{0.5035}&{0.4271}\\ {0.4618}&{0.5}&{0.4653}&{0.3889}\\ {0.4965}&{0.5347}&{0.5}&{0.4236}\\ {0.5729}&{0.6111}&{0.5764}&{0.5} \end{array}} \right), {P_2} = \left( {\begin{array}{*{20}{c}} {0.5} & {0.5278} & {0.5417} & {0.5389}\\ {0.4722} & {0.5} & {0.5139} & {0.5111}\\ {0.4583} & {0.4861} & {0.5} & {0.4972}\\ {0.4611} & {0.4889} & {0.5028} & {0.5} \end{array}} \right), \end{array}
    \begin{array}{l} {P_3} = \left( {\begin{array}{*{20}{c}} {0.5}&{0.5083}&{0.5292}&{0.5083}\\ {0.4917}&{0.5}&{0.5208}&{0.5}\\ {0.4708}&{0.4792}&{0.5}&{0.4792}\\ {0.4917}&{0.5}&{0.5208}&{0.5} \end{array}} \right), {P_4} = \left( {\begin{array}{*{20}{c}} {0.5}&{0.5}&{0.5972}&{0.4306}\\ {0.5}&{0.5}&{0.5972}&{0.4036}\\ {0.4028}&{0.4028}&{0.5}&{0.3333}\\ {0.5694}&{0.5694}&{0.6667}&{0.5} \end{array}} \right). \end{array}

    Secondly, calculating the compressive possibility degree matrix with weight w = \left({0.2, 0.3, 0.4, 0.1} \right) as follows:

    \begin{array}{l} P = \sum\limits_{i = 1}^4 {{w_i}{P_i}} = \left({\begin{array}{*{20}{c}} {0.5}&{0.5193}&{0.5346}&{0.4935}\\ {0.4807}&{0.5}&{0.5153}&{0.4742}\\ {0.4654}&{0.4847}&{0.5}&{0.4589}\\ {0.5065}&{0.5258}&{0.5411}&{0.5} \end{array}} \right) \end{array}

    Lastly, calculating the ranking results:

    \begin{array}{l} {\delta _1} = 0.2618, {\delta _2} = 0.2425, {\delta _3} = 0.2273, {\delta _4} = 0.2684. \end{array}

    According to the above results, the ranking order is

    \begin{array}{l} {A_4} \succ {A_1} \succ {A_2} \succ {A_3}, \end{array}

    which is the same as our proposed method.

    We take the example of Zhao [39]. To evaluate four cities ( {\Lambda _1} : Nanchang, {\Lambda _2} : Ganzhou, {\Lambda _3} : Jiujiang, {\Lambda _4} : Jingdezhen) intelligent transportation system. Taking four factors into consideration ( C{R_1} : Traffic data collection, C{R_2} : Convenient transportation, C{R_3} : Accident emergency handling capacity, C{R_4} : Traffic signal equipment) to improve the rationality of evaluation. There we set w = {\left({0.2, 0.35, 0.25, 0.2} \right)^T} are the weight of C{R_i}\left({i = 1, 3, 4} \right) , and the LTS is:

    \begin{array}{l} S = \left\{ {\left. {{s_{{\rm{ - }}2}}{\rm{ = bad}}, {s_{{\rm{ - }}1}}{\rm{ = slightly \ \ bad}}, {s_{\rm{0}}}{\rm{ = medium}}, {s_{\rm{1}}}{\rm{ = slightly\ \ good}}, {s_2}{\rm{ = good}}} \right\}}, \right. \end{array}

    using the data of the decision-making matrix without considering the hesitance, after normalizing the probability and listed in the following Table 4.

    Table 4.  Decision matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    \Lambda _1 \left\{ {{s_{ - 1}}\left({0.4} \right), {s_0}\left({0.6} \right)} \right\} \left\{ {{s_0}\left({0.6} \right)} \right\} \left\{ {{s_{{\rm{ - }}2}}\left({0.5} \right), {s_{{\rm{ - }}1}}\left({0.4} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.5} \right)} \right\}
    \Lambda _2 \left\{ {{s_{{\rm{ - }}1}}\left({0.5} \right), {s_0}\left({0.3} \right)} \right\} \left\{ {{s_0}\left({0.4} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.7} \right)} \right\} \left\{ {{s_{{\rm{ - }}2}}\left({0.7} \right)} \right\}
    \Lambda _3 \left\{ {{s_{{\rm{ - }}2}}\left({0.4} \right), {s_0}\left({0.2} \right)} \right\} \left\{ {{s_1}\left({0.4} \right)} \right\} \left\{ {{s_{ - 2}}\left({0.3} \right), {s_{{\rm{ - }}1}}\left({0.2} \right)} \right\} \left\{ {{s_0}\left({0.6} \right)} \right\}
    \Lambda _4 \left\{ {{s_{{\rm{ - }}2}}\left({0.7} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.7} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.4} \right)} \right\} \left\{ {{s_{{\rm{ - 2}}}}\left({0.5} \right), {s_{{\rm{ - }}1}}\left({0.4} \right)} \right\}

     | Show Table
    DownLoad: CSV

    After normalizing the probability and using the function of g , the probabilistic hesitant fuzzy matrix will be obtained and listed in Table 5.

    Table 5.  Normalized decision matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    g\left({{\Lambda _1}} \right) \left\{ {\frac{1}{4}\left({0.4} \right), \frac{1}{2}\left({0.6} \right)} \right\} \left\{ {\frac{1}{2}\left(1 \right)} \right\} \left\{ {0\left({0.56} \right), \frac{1}{4}\left({0.44} \right)} \right\} \left\{ {\frac{1}{4}\left(1 \right)} \right\}
    g\left({{\Lambda _2}} \right) \left\{ {\frac{1}{4}\left({0.625} \right), \frac{1}{2}\left({0.375} \right)} \right\} \left\{ {\frac{1}{4}\left(1 \right)} \right\} \left\{ {\frac{1}{4}\left(1 \right)} \right\} \left\{ {0\left(1 \right)} \right\}
    g\left({{\Lambda _3}} \right) \left\{ {0\left({0.67} \right), \frac{1}{2}\left({0.33} \right)} \right\} \left\{ {\frac{1}{4}\left(3 \right)} \right\} \left\{ {0\left({0.6} \right), \frac{1}{4}\left({0.4} \right)} \right\} \left\{ {\frac{1}{2}\left(1 \right)} \right\}
    g\left({{\Lambda _4}} \right) \left\{ {0\left(1 \right)} \right\} \left\{ {\frac{1}{4}\left(1 \right)} \right\} \left\{ {\frac{1}{4}\left(1 \right)} \right\} \left\{ {0\left({0.56} \right), \frac{1}{4}\left({0.44} \right)} \right\}

     | Show Table
    DownLoad: CSV

    Based on the operator of J\left(x \right) = - {\rm{ln }}x , the following expected values and ranking order are obtained:

    \begin{array}{l} E({\Lambda _1}) = -0.9548, \; E({\Lambda _2}) = -1.0790, \; E({\Lambda _3}) = -0.6757, \; E({\Lambda _4}) = -1.9367. \end{array}

    It has {\Lambda _3} \succ {\Lambda _1} \succ {\Lambda _2} \succ {\Lambda _4} . Hence, the optimal intelligent transportation system is \Lambda _3 (Jiujiang), which is the same as the answer in Zhao [39].

    Peide Liu et al. [17] proposed probabilistic linguistic Archimedean Muirhead mean operators to rank the alternatives. For the case of maximization profit problems, we make a comparison between our methods and Archimedean Muirhead Mean operators' methods.

    For four potential projects {\Lambda _i}\left({i = 1, 2, 3, 4} \right) , directors need to choose the desirable one through four attributes ( {\Lambda _1} : Financial perspective, {\Lambda _2} : Customers satisfaction, {\Lambda _3} : Internal business process, {\Lambda _4} : Learning and growth) to improve the rationality of evaluation. Suppose the weight of attributes are w = \left({0.2, 0.3, 0.3, 0.2} \right) , and the LTS is:

    \begin{array}{l} S = \left\{ {\left. {{s_{{\rm{ - }}2}}{\rm{ = low}}, {s_{{\rm{ - }}1}}{\rm{ = little \ low}}, {s_{\rm{0}}}{\rm{ = medium}}, {s_{\rm{1}}}{\rm{ = little \ high}}, {s_2}{\rm{ = high}}} \right\}}.\right. \end{array}

    The original decision-making matrix with PLTSs can be normalized and listed in Table 6.

    Table 6.  Original decision matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    \Lambda _1 \left\{ {{s_0}\left(1 \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.6} \right)} \right\} \left\{ {{s_1}\left({0.4} \right), {s_2}\left({0.4} \right)} \right\} \left\{ {{s_1}\left({0.8} \right)} \right\}
    \Lambda _2 \left\{ {{s_0}\left({0.8} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.8} \right)} \right\} \left\{ {{s_{{\rm{ - 2}}}}\left({0.6} \right), {s_{{\rm{ - 1}}}}\left({0.2} \right)} \right\} \left\{ {{s_0}\left({0.6} \right)} \right\}
    \Lambda _3 \left\{ {{s_{{\rm{ - 1}}}}\left({0.4} \right)} \right\} \left\{ {{s_1}\left({0.6} \right)} \right\} \left\{ {{s_0}\left({0.8} \right), {s_1}\left({0.2} \right)} \right\} \left\{ {{s_{{\rm{ - }}2}}\left({0.5} \right)} \right\}
    \Lambda _4 \left\{ {{s_{{\rm{ - 1}}}}\left({0.8} \right)} \right\} \left\{ {{s_{{\rm{ - }}1}}\left({0.6} \right)} \right\} \left\{ {{s_1}\left({0.5} \right), {s_2}\left({0.5} \right)} \right\} \left\{ {{s_0}\left(1 \right)} \right\}

     | Show Table
    DownLoad: CSV

    To assure the calculated results more accurate, we do not normalize the probabilities. Using the function of g , we get the probabilistic hesitant fuzzy matrix and listed in Table 7.

    Table 7.  Probabilistic hesitant fuzzy decision matrix.
    C{R_1} C{R_2} C{R_3} C{R_4}
    g\left({{\Lambda _1}} \right) \left\{ {\frac{1}{2}\left(1 \right)} \right\} \left\{ {\frac{1}{4}\left({0.6} \right)} \right\} \left\{ {\frac{3}{4}\left({0.4} \right), 1\left({0.4} \right)} \right\} \left\{ {\frac{3}{4}\left({0.8} \right)} \right\}
    g\left({{\Lambda _2}} \right) \left\{ {\frac{1}{2}\left({0.8} \right)} \right\} \left\{ {\frac{1}{4}\left({0.8} \right)} \right\} \left\{ {0\left({0.6} \right)\frac{1}{4}\left({0.2} \right)} \right\} \left\{ {\frac{1}{2}\left({0.6} \right)} \right\}
    g\left({{\Lambda _3}} \right) \left\{ {\frac{1}{4}\left({0.4} \right)} \right\} \left\{ {\frac{3}{4}\left({0.6} \right)} \right\} \left\{ {\frac{1}{2}\left({0.8} \right), \frac{3}{4}\left({0.2} \right)} \right\} \left\{ {0\left({0.5} \right)} \right\}
    g\left({{\Lambda _4}} \right) \left\{ {\frac{1}{4}\left({0.8} \right)} \right\} \left\{ {\frac{1}{4}\left({0.6} \right)} \right\} \left\{ {1\left({0.5} \right)\frac{3}{4}\left({0.5} \right)} \right\} \left\{ {\frac{1}{2}\left(1 \right)} \right\}

     | Show Table
    DownLoad: CSV

    Using different decision approaches in [16,17] and our proposed approaches to address this decision problem and the results are listed in Table 8.

    Table 8.  The results obtained by different decision approaches.
    Methods Aggregated results Ranking
    PLWA [16] E\left({{\Lambda _1}} \right){\rm{ = }}1.48, E\left({{\Lambda _2}} \right){\rm{ = }}0.83, E\left({{\Lambda _3}} \right){\rm{ = }}0.95, E\left({{\Lambda _4}} \right){\rm{ = }}1.27 {\Lambda _1} \succ {\Lambda _4} \succ {\Lambda _3} \succ {\Lambda _2}
    PLWG [16] E\left({{\Lambda _1}} \right){\rm{ = }}1.59, E\left({{\Lambda _2}} \right){\rm{ = }}0.61, E\left({{\Lambda _3}} \right){\rm{ = }}0, E\left({{\Lambda _4}} \right){\rm{ = }}1.38 {\Lambda _1} \succ {\Lambda _4} \succ {\Lambda _2} \succ {\Lambda _3}
    HPLAWMM [17] \begin{array}{l} E\left({{\Lambda _1}} \right){\rm{ = }}3.20, E\left({{\Lambda _2}} \right){\rm{ = }}1.28, E\left({{\Lambda _3}} \right){\rm{ = }}2.05, E\left({{\Lambda _4}} \right){\rm{ = }}3.01\\ \left({{\mathop{\rm suppose}\nolimits} \ \ P = \left({1, 0, 0, 0} \right) \ \ {\rm{and}}\ \ \delta = 1} \right) \end{array} {\Lambda _1} \succ {\Lambda _4} \succ {\Lambda _3} \succ {\Lambda _2}
    HPLADWMM [17] \begin{array}{l} E\left({{\Lambda _1}} \right){\rm{ = }}2.08, E\left({{\Lambda _2}} \right){\rm{ = }}0.33, E\left({{\Lambda _3}} \right){\rm{ = }}0, E\left({{\Lambda _4}} \right){\rm{ = }}1.67\\ \left({{\mathop{\rm suppose}\nolimits}\ \ P = \left({1, 0, 0, 0} \right)\ \ {\rm{and}}\ \ \delta = 1} \right) \end{array} {\Lambda _1} \succ {\Lambda _4} \succ {\Lambda _2} \succ {\Lambda _3}
    Proposed PLAAGMSM \begin{array}{l} E\left({{\Lambda _1}} \right){\rm{ = }}0.516, E\left({{\Lambda _2}} \right){\rm{ = }}-1.278, E\left({{\Lambda _3}} \right){\rm{ = }}-{\rm{0}}{\rm{.258, }}\\ E\left({{\Lambda _4}} \right){\rm{ = }}-0.159 \left({{\mathop{\rm suppose}\nolimits} \ \ {u_1} = 1 \ \ {u_1} = 2, \ \ n = 3} \right) \end{array} {\Lambda _1} \succ {\Lambda _4} \succ {\Lambda _3} \succ {\Lambda _2}
    Proposed PLAEGMSM \begin{array}{l} E\left({{\Lambda _1}} \right){\rm{ = }}0.5433, E\left({{\Lambda _2}} \right){\rm{ = }} - 0.7559, E\left({{\Lambda _3}} \right){\rm{ = }} - 0.3227, \\E\left({{\Lambda _4}} \right){\rm{ = }} - 0.1177 \left({{\mathop{\rm suppose} \nolimits}\ \ {u_1} = 1, \ \ {u_1} = 2, \ \ n = 3} \right) \end{array} {\Lambda _1} \succ {\Lambda _3} \succ {\Lambda _4} \succ {\Lambda _2}
    Proposed PLAHGMSM \begin{array}{l} E\left({{\Lambda _1}} \right){\rm{ = }} - 0.2653, E\left({{\Lambda _2}} \right){\rm{ = }}-0.3507, E\left({{\Lambda _3}} \right){\rm{ = }} - {\rm{0}}{\rm{.3076, }}\\ E\left({{\Lambda _4}} \right){\rm{ = }} - 0.3087 \left({{\mathop{\rm suppose} \nolimits}\ \ {u_1} = 1, \ \ {u_1} = 2, \ \ n = 3} \right) \end{array} {\Lambda _1} \succ {\Lambda _3} \succ {\Lambda _4} \succ {\Lambda _2}

     | Show Table
    DownLoad: CSV

    According to the ranking order, the optimal project is \Lambda_1 , which is the same obtained by other extant decision making approach. This also shows the reliability and effectiveness of the method.

    Although the proposed decision-making approach integrated the advantages of PLTSs and GMSM operators, there is a limitation of the proposed approach, that is, as the number of elements increases, the complexity of calculation will increase, corresponding.

    Classical MSM operators have been attracted great attention of many scholars and widely been used in the field of information fusion due to their biggest merit that they can reflect the relationship between multiple input arguments. On this basis, Wang generalized the traditional MSM operators and introduced the generalized MSM operators. On the other hand, PLTS, a new tool for describing uncertain decision information, can better reflect the actual decision-making problems such as the hesitation of decision-makers, the relative importance of linguistic variables. Combining the merits of PTLS and GMSM operators, PLGMSM and WPLGMSM based on ATN and ATC are proposed and their properties are also investigated. Meanwhile, some special situations are discussed when parameters take different values and the generators of ATN take different function. Besides, this proposed method is applied in teaching quality evaluation in universities, to evaluate an ideal classroom teaching in four alternatives. At last, several comparison analysis are adopted to ensure the validity of the decision-making results, which further verify the reasonability of our proposed decision-making approach.

    In future studies, we will continue the current work in expanding and applying the current operators into other contexts. Also some novel MADM approaches will be developed to address some decision-making problems with probabilistic linguistic information. The proposed MADM problem could also be used to other complicated issues.

    The research was funded by the General Program of Natural Funding of Sichuan Province (No: 2021JY018), Scientific Research Project of Neijiang Normal University (2022ZD10, 18TD08, 2021TD04.)

    The authors declare no conflict of interest.



    [1] J. Shang, W. Li, D. Li, Traveling wave solutions of a coupled Schrödinger-Korteweg-de Vries equation by the generalized coupled trial equation method, Heliyon, 9 (2023), e15695. http://dx.doi.org/10.1016/j.heliyon.2023.e15695 doi: 10.1016/j.heliyon.2023.e15695
    [2] B. Liu, Q. Zhao, X. Li, Step-like initial value problem and Whitham modulation in fluid dynamics to a generalized derivative nonlinear Schrödinger equation, Phys. Fluids, 36 (2024), 066109. http://dx.doi.org/10.1063/5.0210864 doi: 10.1063/5.0210864
    [3] S. Rizvi, A. Seadawy, N. Farah, S. Ahmad, Application of Hirota operators for controlling soliton interactions for Bose-Einstein condensate and quintic derivative nonlinear Schrödinger equation, Chaos Soliton. Fract., 159 (2022), 112128. http://dx.doi.org/10.1016/j.chaos.2022.112128 doi: 10.1016/j.chaos.2022.112128
    [4] N. Karjanto, Modeling wave packet dynamics and exploring applications: a comprehensive guide to the nonlinear Schrödinger equation, Mathematics, 12 (2024), 744. http://dx.doi.org/10.3390/math12050744 doi: 10.3390/math12050744
    [5] Y. Jiang, C. Wang, Exact solutions and dynamic properties of perturbed Fokas-Lenells equation, J. Opt., in press. http://dx.doi.org/10.1007/s12596-024-01823-z
    [6] N. Raza, M. Osman, A. Abdel-Aty, S. Abdel-Khalek, H. Besbes, Optical solitons of space-time fractional Fokas-Lenells equation with two versatile integration architectures, Adv. Differ. Equ., 2020 (2020), 517. http://dx.doi.org/10.1186/s13662-020-02973-7 doi: 10.1186/s13662-020-02973-7
    [7] A. Arnous, A. Elsherbeny, A. Secer, M. Ozisik, M. Bayram, N. Shah, et al., Optical solitons for the dispersive concatenation model with spatio-temporal dispersion having multiplicative white noise, Results Phys., 56 (2024), 107299. http://dx.doi.org/10.1016/j.rinp.2023.107299 doi: 10.1016/j.rinp.2023.107299
    [8] W. Rabie, H. Ahmed, M. Hashemi, M. Mirzazadeh, M. Bayram, Generating optical solitons in the extended (3+1)-dimensional nonlinear Kudryashov's equation using the extended F-expansion method, Opt. Quant. Electron., 56 (2024), 894. http://dx.doi.org/10.1007/s11082-024-06787-9 doi: 10.1007/s11082-024-06787-9
    [9] Y. Zhang, X. Lü, Data-driven solutions and parameter discovery of the extended higher-order nonlinear Schrödinger equation in optical fibers, Physica D, 468 (2024), 134284. https://doi.org/10.1016/j.physd.2024.134284 doi: 10.1016/j.physd.2024.134284
    [10] Y. Li, Y. Kai, Wave structures and the chaotic behaviors of the cubic-quartic nonlinear Schrödinger equation for parabolic law in birefringent fibers, Nonlinear Dyn., 111 (2023), 8701–8712. http://dx.doi.org/10.1007/s11071-023-08291-3 doi: 10.1007/s11071-023-08291-3
    [11] H. Triki, F. Azzouzi, A. Biswas, S. Moshokoa, M. Belic, Bright optical solitons with Kerr law nonlinearity and fifth order dispersion, Optik, 128 (2017), 172–177. http://dx.doi.org/10.1016/j.ijleo.2016.10.026 doi: 10.1016/j.ijleo.2016.10.026
    [12] Y. Wu, M. Vivas-Cortez, H. Ur Rehman, E. Sherif, A. Rashid, Bifurcation study, phase portraits and optical solitons of dual-mode resonant nonlinear Schrödinger dynamical equation with Kerr law non-linearity, Heliyon, 10 (2024), e34416. http://dx.doi.org/10.1016/j.heliyon.2024.e34416 doi: 10.1016/j.heliyon.2024.e34416
    [13] P. Albayrak, M. Ozisik, A. Secer, M. Bayram, S. Das, Optical solitons of stochastic perturbed Radhakrishnan-Kundu-Lakshmanan model with Kerr law of self-phase-modulation, Mod. Phys. Lett. B, 38 (2024), 2450122. http://dx.doi.org/10.1142/S0217984924501227 doi: 10.1142/S0217984924501227
    [14] A. Biswas, M. Ekici, A. Dakova, S. Khan, S. Moshokoa, H. Alshehri, et al., Highly dispersive optical soliton perturbation with Kudryashov's sextic-power law nonlinear refractive index by semi-inverse variation, Results Phys., 27 (2021), 104539. http://dx.doi.org/10.1016/j.rinp.2021.104539 doi: 10.1016/j.rinp.2021.104539
    [15] K. Ahmed, N. Badra, H. Ahmed, W. Rabie, M. Mirzazadeh, M. Eslami, et al., Investigation of solitons in magneto-optic waveguides with Kudryashov's law nonlinear refractive index for coupled system of generalized nonlinear Schrödinger's equations using modified extended mapping method, Nonlinear Anal.-Model., 29 (2024), 205–223. http://dx.doi.org/10.15388/namc.2024.29.34070 doi: 10.15388/namc.2024.29.34070
    [16] N. Ozdemi, S. Altun, A. Secer, M. Ozisik, M. Bayram, Revealing optical soliton solutions of Schrödinger equation having parabolic law and anti-cubic law with weakly nonlocal nonlinearity, J. Taibah Univ. Sci., 18 (2024), 2270237. http://dx.doi.org/10.1080/16583655.2023.2270237 doi: 10.1080/16583655.2023.2270237
    [17] S. Arshed, G. Akram, M. Sadaf, A. Ul Nabi, A. Alzaidi, Optical soliton solutions of perturbed nonlinear Schrödinger equation with parabolic law nonlinearity, Opt. Quant. Electron., 56 (2024), 50. http://dx.doi.org/10.1007/s11082-023-05564-4 doi: 10.1007/s11082-023-05564-4
    [18] M. Aamir Ashraf, A. Seadawy, S. Rizvi, A. Althobaiti, Dynamical optical soliton solutions and behavior for the nonlinear Schrödinger equation with kudryashov's quintuple power law of refractive index together with the dual-form of nonlocal nonlinearity, Opt. Quant. Electron., 56 (2024), 1243. http://dx.doi.org/10.1007/s11082-024-07096-x doi: 10.1007/s11082-024-07096-x
    [19] E. Zayed, K. Alurrfi, A. Arnous, M. Hashemi, M. Bayram, Effects of high dispersion and generalized non-local laws on optical soliton perturbations in magneto-optic waveguides with sextic-power law refractive index, Nonlinear Dyn., 112 (2024), 8507–8525. http://dx.doi.org/10.1007/s11071-024-09518-7 doi: 10.1007/s11071-024-09518-7
    [20] T. Han, Z. Li, K. Shi, G. Wu, Bifurcation and traveling wave solutions of stochastic Manakov model with multiplicative white noise in birefringent fibers, Chaos Soliton. Fract., 163 (2022), 112548. http://dx.doi.org/10.1016/j.chaos.2022.112548 doi: 10.1016/j.chaos.2022.112548
    [21] T. Han, Y. Jiang, J. Lyu, Chaotic behavior and optical soliton for the concatenated model arising in optical communication, Results Phys., 58 (2024), 107467. http://dx.doi.org/10.1016/j.rinp.2024.107467 doi: 10.1016/j.rinp.2024.107467
    [22] J. Zhang, Optical solitons in optical metamaterials with anti-cubic nonlinearity, Optik, 251 (2022), 168329. https://doi.org/10.1016/j.ijleo.2021.168329 doi: 10.1016/j.ijleo.2021.168329
    [23] L. Tang, Bifurcations and dispersive optical solitons for the nonlinear Schrödinger-Hirota equation in DWDM networks, Optik, 262 (2022), 169276. http://dx.doi.org/10.1016/j.ijleo.2022.169276 doi: 10.1016/j.ijleo.2022.169276
    [24] I. Samir, O. El-Sham, R. El-barkoki, H. Ahmed, W. Abbas, M. Hashemi, Extraction of solitons in optical fibers for the (2+1)-dimensional perturbed nonlinear Schrödinger equation via the improved modified extended tanh function technique, Contemp. Math., 5 (2024), 2397–2410. http://dx.doi.org/10.37256/cm.5220244301 doi: 10.37256/cm.5220244301
    [25] K. Ahmed, H. Ahmed, N. Badra, W. Rabie, Optical solitons retrieval for an extension of novel dual-mode of a dispersive non-linear Schrödinger equation, Optik, 307 (2024), 171835. http://dx.doi.org/10.1016/j.ijleo.2024.171835 doi: 10.1016/j.ijleo.2024.171835
    [26] H. Rehman, I. Iqbal, M. Medani, A. Awan, U. Perveen, R. Alroobaea, Analyzing the dynamics of multi-solitons and other solitons in the perturbed nonlinear Schrödinger equation, Mod. Phys. Lett. B, in press. http://dx.doi.org/10.1142/S0217984924504682
    [27] A. Farooq, M. Khan, W. Ma, Exact solutions for the improved mKdv equation with conformable derivative by using the Jacobi elliptic function expansion method, Opt. Quant. Electron., 56 (2024), 542. http://dx.doi.org/10.1007/s11082-023-06258-7 doi: 10.1007/s11082-023-06258-7
    [28] A. Arnous, A. Biswas, Y. Yıldırım, Q. Zhou, W. Liu, A. Alshomrani, et al., Cubic-quartic optical soliton perturbation with complex Ginzburg-Landau equation by the enhanced Kudryashov's method, Chaos Soliton. Fract., 155 (2022), 111748. http://dx.doi.org/10.1016/j.chaos.2021.111748 doi: 10.1016/j.chaos.2021.111748
    [29] A. Elsherbeny, M. Mirzazadeh, A. Arnous, A. Biswas, Y. Yıldırım, A. Asiri, Optical bullets and domain walls with cross-spatio dispersion having parabolic law of nonlinear refractive index, J. Opt., in press. http://dx.doi.org/10.1007/s12596-023-01398-1
    [30] A. Biswas, Theory of optical bullets, J. Opt. A, 4 (2002), 84–97. http://dx.doi.org/10.1163/156939302X01254 doi: 10.1163/156939302X01254
    [31] K. Hosseini, M. Matinfar, M. Mirzazadeh, A (3+1)-dimensional resonant nonlinear Schrödinger equation and its Jacobi elliptic and exponential function solutions, Optik, 207 (2020), 164458. http://dx.doi.org/10.1016/j.ijleo.2020.164458 doi: 10.1016/j.ijleo.2020.164458
    [32] S. Kumar, A. Kukkar, Dynamics of several optical soliton solutions of a (3+1)-dimensional nonlinear Schrödinger equation with parabolic law in optical fibers, Mod. Phys. Lett. B, in press. http://dx.doi.org/10.1142/S0217984924504530
    [33] W. Rabie, H. Ahmed, I. Samir, M. Alnahhass, Optical solitons and stability analysis for NLSE with nonlocal nonlinearity, nonlinear chromatic dispersion and Kudryashov's generalized quintuple-power nonlinearity, Results Phys., 59 (2024), 107589. http://dx.doi.org/10.1016/j.rinp.2024.107589 doi: 10.1016/j.rinp.2024.107589
    [34] C. Liu, Applications of complete discrimination system for polynomial for classifications of traveling wave solutions to nonlinear differential equations, Comput. Phys. Commun., 181 (2010), 317–324. http://dx.doi.org/10.1016/j.cpc.2009.10.006 doi: 10.1016/j.cpc.2009.10.006
    [35] C. Liu, Trial equation method based on symmetry and applications to nonlinear equations arising in mathematical physics, Found. Phys., 41 (2011), 793–804. http://dx.doi.org/10.1007/s10701-010-9521-4 doi: 10.1007/s10701-010-9521-4
    [36] C. Liu, Canonical-like transformation method and exact solutions to a class of diffusion equations, Chaos Soliton. Fract., 42 (2009), 441–446. http://dx.doi.org/10.1016/j.chaos.2009.01.006 doi: 10.1016/j.chaos.2009.01.006
    [37] C. Liu, The classification of travelling wave solutions and superposition of multi-solutions to Camassa-Holm equation with dispersion, Chinese Phys., 16 (2007), 1832. http://dx.doi.org/10.1088/1009-1963/16/7/004 doi: 10.1088/1009-1963/16/7/004
    [38] Y. Kai, J. Ji, Z. Yin, Study of the generalization of regularized long-wave equation, Nonlinear Dyn., 107 (2022), 2745–2752. http://dx.doi.org/10.1007/s11071-021-07115-6 doi: 10.1007/s11071-021-07115-6
    [39] Y. Kai, S. Chen, K. Zhang, Z. Yin, A study of the shallow water waves with some Boussinesq-type equations, Waves Random Complex, 34 (2024), 1251–1268. http://dx.doi.org/10.1080/17455030.2021.1933259 doi: 10.1080/17455030.2021.1933259
    [40] L. Guo, W. Xu, The traveling wave mode for nonlinear Biswas-Milovic equation in magneto-optical wave guide coupling system with Kudryashov's law of refractive index, Results Phys., 27 (2021), 104500. http://dx.doi.org/10.1016/j.rinp.2021.104500 doi: 10.1016/j.rinp.2021.104500
    [41] Y. Chen, Exact chirped solutions for the generalized nonlinear Schrödinger equation in highly-nonlinear optical fibers, Optik, 281 (2023), 170814. http://dx.doi.org/10.1016/j.ijleo.2023.170814 doi: 10.1016/j.ijleo.2023.170814
    [42] S. Li, Nonlinear chirped optical solitons of the perturbation Fokas-Lenells equation in optical fibers, Optik, 276 (2023), 170627. http://dx.doi.org/10.1016/j.ijleo.2023.170627 doi: 10.1016/j.ijleo.2023.170627
    [43] Y. Zhao, L. Guo, Optical wave solutions of the nonlinear Schrödinger equation with an anti-cubic nonlinear in presence of Hamiltonian perturbation terms, Optik, 274 (2023), 170593. http://dx.doi.org/10.1016/j.ijleo.2023.170593 doi: 10.1016/j.ijleo.2023.170593
    [44] Y. Li, Y. Kai, Chaotic behavior of the Zakharov-Kuznetsov equation with dual-power law and triple-power law nonlinearity, AppliedMath, 3 (2023), 1–9. http://dx.doi.org/10.3390/appliedmath3010001 doi: 10.3390/appliedmath3010001
    [45] Y. Kai, S. Chen, K. Zhang, Z. Yin, Exact solutions and dynamic properties of a nonlinear fourth-order time-fractional partial differential equation, Waves Random Complex, in press. http://dx.doi.org/10.1080/17455030.2022.2044541
  • This article has been cited by:

    1. Shizhou Weng, Zhengwei Huang, Yuejin Lv, Probability numbers for multi-attribute decision-making, 2024, 46, 10641246, 6109, 10.3233/JIFS-223565
    2. Zeynep Tuğçe Kalender, Olasılıklı dil terimi kümeleri yaklaşımı kullanılarak akıllı ev teknolojilerinin benimsenmesinde tüketici dinamiklerinin incelenmesi, 2025, 40, 1300-1884, 1099, 10.17341/gazimmfd.1396803
    3. Jing Guo, Xianjun Zhu, Wenfeng Li, Hui Li, A noval approach for dual probabilistic linguistic multi-criteria decision making based on prioritized Maclaurin symmetric mean operators and VIKOR, 2025, 48, 1064-1246, 447, 10.3233/JIFS-224232
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

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

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

Metrics

Article views(730) PDF downloads(46) Cited by(0)

Figures and Tables

Figures(18)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog