Research article

Improved salp swarm algorithm based on gravitational search and multi-leader search strategies

  • Received: 24 September 2022 Revised: 25 November 2022 Accepted: 01 December 2022 Published: 13 December 2022
  • MSC : 93-08, 90C29, 65K10

  • The salp swarm algorithm (SSA) will converge prematurely and fall into local optimum when solving complex high-dimensional multimodal optimization tasks. This paper proposes an improved SSA (GMLSSA) based on gravitational search and multi-swarm search strategies. In the gravitational search strategy, using multiple salp individuals to guide the location update of search agents can get rid of the limitation of individual guidance and improve the exploration ability of the algorithm. In the multi-swarm leader strategy, the original population is divided into several independent subgroups to increase population diversity and avoid falling into local optimization. In the experiment, 20 benchmark functions (including the well-known CEC 2014 function) were used to test the performance of the proposed GMLSSA in different dimensions, and the results were compared with the most advanced search algorithm and SSA variants. The experimental results are evaluated through four different analysis methods: numerical, stability, high-dimensional performance, and statistics. These results conclude that GMLSSA has better solution quality, convergence accuracy, and stability. In addition, GMLSSA is used to solve the tension/compression spring design problem (TCSD). The proposed GMLSSA is superior to other competitors in terms of solution quality, convergence accuracy, and stability.

    Citation: Xuncai Zhang, Guanhe Liu, Kai Zhao, Ying Niu. Improved salp swarm algorithm based on gravitational search and multi-leader search strategies[J]. AIMS Mathematics, 2023, 8(3): 5099-5123. doi: 10.3934/math.2023256

    Related Papers:

    [1] Cuiying Li, Rui Wu, Ranzhuo Ma . Existence of solutions for Caputo fractional iterative equations under several boundary value conditions. AIMS Mathematics, 2023, 8(1): 317-339. doi: 10.3934/math.2023015
    [2] Kirti Kaushik, Anoop Kumar, Aziz Khan, Thabet Abdeljawad . Existence of solutions by fixed point theorem of general delay fractional differential equation with $ p $-Laplacian operator. AIMS Mathematics, 2023, 8(5): 10160-10176. doi: 10.3934/math.2023514
    [3] Kishor D. Kucche, Sagar T. Sutar, Kottakkaran Sooppy Nisar . Analysis of nonlinear implicit fractional differential equations with the Atangana-Baleanu derivative via measure of non-compactness. AIMS Mathematics, 2024, 9(10): 27058-27079. doi: 10.3934/math.20241316
    [4] Luchao Zhang, Xiping Liu, Zhensheng Yu, Mei Jia . The existence of positive solutions for high order fractional differential equations with sign changing nonlinearity and parameters. AIMS Mathematics, 2023, 8(11): 25990-26006. doi: 10.3934/math.20231324
    [5] Yige Zhao, Yibing Sun, Zhi Liu, Yilin Wang . Solvability for boundary value problems of nonlinear fractional differential equations with mixed perturbations of the second type. AIMS Mathematics, 2020, 5(1): 557-567. doi: 10.3934/math.2020037
    [6] Sunisa Theswan, Sotiris K. Ntouyas, Jessada Tariboon . Coupled systems of $ \psi $-Hilfer generalized proportional fractional nonlocal mixed boundary value problems. AIMS Mathematics, 2023, 8(9): 22009-22036. doi: 10.3934/math.20231122
    [7] Choukri Derbazi, Zidane Baitiche, Mohammed S. Abdo, Thabet Abdeljawad . Qualitative analysis of fractional relaxation equation and coupled system with Ψ-Caputo fractional derivative in Banach spaces. AIMS Mathematics, 2021, 6(3): 2486-2509. doi: 10.3934/math.2021151
    [8] Choukri Derbazi, Hadda Hammouche . Caputo-Hadamard fractional differential equations with nonlocal fractional integro-differential boundary conditions via topological degree theory. AIMS Mathematics, 2020, 5(3): 2694-2709. doi: 10.3934/math.2020174
    [9] Iyad Suwan, Mohammed S. Abdo, Thabet Abdeljawad, Mohammed M. Matar, Abdellatif Boutiara, Mohammed A. Almalahi . Existence theorems for $ \Psi $-fractional hybrid systems with periodic boundary conditions. AIMS Mathematics, 2022, 7(1): 171-186. doi: 10.3934/math.2022010
    [10] Naimi Abdellouahab, Keltum Bouhali, Loay Alkhalifa, Khaled Zennir . Existence and stability analysis of a problem of the Caputo fractional derivative with mixed conditions. AIMS Mathematics, 2025, 10(3): 6805-6826. doi: 10.3934/math.2025312
  • The salp swarm algorithm (SSA) will converge prematurely and fall into local optimum when solving complex high-dimensional multimodal optimization tasks. This paper proposes an improved SSA (GMLSSA) based on gravitational search and multi-swarm search strategies. In the gravitational search strategy, using multiple salp individuals to guide the location update of search agents can get rid of the limitation of individual guidance and improve the exploration ability of the algorithm. In the multi-swarm leader strategy, the original population is divided into several independent subgroups to increase population diversity and avoid falling into local optimization. In the experiment, 20 benchmark functions (including the well-known CEC 2014 function) were used to test the performance of the proposed GMLSSA in different dimensions, and the results were compared with the most advanced search algorithm and SSA variants. The experimental results are evaluated through four different analysis methods: numerical, stability, high-dimensional performance, and statistics. These results conclude that GMLSSA has better solution quality, convergence accuracy, and stability. In addition, GMLSSA is used to solve the tension/compression spring design problem (TCSD). The proposed GMLSSA is superior to other competitors in terms of solution quality, convergence accuracy, and stability.



    This article is devoted to the following nonlinear fractional differential equation with periodic boundary condition

    {cDα0+x(t)λx(t)=f(t,x(t)), 0<tω,x(0)=x(ω), (1.1)

    where λ0, 0<α1 and cDα0+ is Caputo fractional derivative

    cDα0+x(t)=1Γ(1α)t0(ts)αx(s)ds.

    Differential equations of fractional order occur more frequently on different research areas and engineering, such as physics, economics, chemistry, control theory, etc. In recent years, boundary value problems for fractional differential equation have become a hot research topic, see [2,3,4,5,6,7,9,10,11,12,13,15,16,17,18,19,20,21,24,25]. In [27], Zhang studied the boundary value problem for nonlinear fractional differential equation

    {cDα0+u(t)=f(t,u(t)), 0<t<1,u(0)+u(0)=0,u(1)+u(1)=0, (1.2)

    where 1<α2, f:[0,1]×[0,+)[0,+) is continuous and cDα0+ is Caputo fractional derivative

    cDα0+u(t)=1Γ(2α)t0(ts)1αu(s)ds.

    The author obtained the existence of the positive solutions by using the properties of the Green function, Guo-Krasnosel'skill fixed point theorem and Leggett-Williams fixed point theorem.

    Ahmad and Nieto [1] studied the anti-periodic boundary value problem of fractional differential equation

    {cDq0+u(t)=f(t,u(t)), 0tT, 1<q2,u(0)=u(T), cDp0+u(0)=cDp0+u(T), 0<p<1, (1.3)

    where f:[0,T]×RR is continuous. The authors obtained some existence and uniqueness results by applying fixed point principles. The anti-periodic boundary value condition in this article corresponds to the anti-periodic condition u(0)=u(T),u(0)=u(T) in ordinary differential equation.

    In [26], Zhang studied the following fractional differential equation

    {Dδ0+u(t)=f(t,u), 0<tT,limt0+t1αu(t)=u0, (1.4)

    where 0<δ<1, T>0, u0R and Dδ0+ is Riemann-Liouville fractional derivative

    Dδ0+u(t)=1Γ(1δ)ddtt0(ts)δu(s)ds.

    The author obtained the existence and uniqueness of the solutions by the method of upper and lower solutions and monotone iterative method.

    In [7], Belmekki, Nieto and Rodriguez-Lopez studied the following equation

    {Dδ0+u(t)λu(t)=f(t,u(t)),0<t1,limt0+t1δu(t)=u(1), (1.5)

    where 0<δ<1, λR, f is continuous. The authors obtained the existence and uniqueness of the solutions by using the fixed point theorem. Cabada and Kisela [8] studied the following equation

    {Dδ0+u(t)λu(t)=f(t,t1αu(t)),0<t1,limt0+t1δu(t)=u(1), (1.6)

    where 0<δ<1, λ0(λR), f is continuous. The authors studied the existence and uniqueness of periodic solutions by using Krasnosel'skii fixed point theorem and monotone iterative method. In [7,8], the boundary condition limt0+t1δu(t)=u(1) was called as periodic boundary value condition of Riemann-Liouville fractional differential equation, which is different from the periodic condition for ordinary differential equation. The boundary value condition u(0)=u(1) is not suitable for Riemann-Liouville fractional differential equation.

    For the ordinary differential equation, the periodic boundary value problem is closely related to the periodic solution. For the Caputo fractional differential equation, the periodic boundary value condition u(0)=u(w) is meaningful. As far as we know, few work involves the periodic boundary value problem for Caputo fractional. The aim of this paper is to show the existence of positive solutions of (1.1) by using Krasnosel'skii fixed point theorem. Meanwhile, we also use the monotone iterative method to study the extremal solutions problem

    {cDα0+u(t)=f(t,u(t)),0<tω,u(0)=u(ω). (1.7)

    The paper is organized as follows. In Section 2, we recall and derive some results on Mittag-Leffler functions. In Section 3, we use the Laplace transform to obtain the solution of a linear problem and discuss some properties of Green's function. In Section 4, the existence of positive solution is studied by using the Krasnosel'skii fixed point theorem. In Section 5, the existence of extremal solutions is proved by utilizing the monotone iterative technique. Section 6 is conclusion of the paper.

    A key role in the theory of linear fractional differential equation is played by the well-known two-parameter Mittag-Leffler function

    Eα,β(z)=Σk=0zkΓ(αk+β),  zR, α, β>0. (2.1)

    We recall and derive some of their properties and relationships summarized in the following.

    Proposition 2.1. Let α(0,1],β>0,λR and ξ>0. Then it holds

    (C1) limt0+Eα,β(λtα)=1Γ(β),limt0+Eα,1(λtα)=1.

    (C2) Eα,α+1(λtα)=λ1tα(Eα,1(λtα)1).

    (C3) Eα,α(λtα)>0, Eα,1(λtα)>0 for all t0.

    (C4) Eα,α(λtα) is decreasing in t for λ<0and increasing for λ>0 for all t>0.

    (C5) Eα,1(λtα) is decreasing in t for λ<0 and increasing forλ>0 for all t>0.

    (C6) ξ0tβ1Eα,β(λtα)dt=ξβEα,β+1(λξα).

    Proof. (C1) It is obtained by an immediate calculation from (2.1).

    (C2) By (2.1), we get

    Eα,1(λtα)=Σk=0(λtα)kΓ(αk+1)=1+λtαΓ(α+1)+(λtα)2Γ(2α+1)+(λtα)3Γ(3α+1)+,
    Eα,α+1(λtα)=Σk=0(λtα)kΓ(αk+α+1)=1Γ(α+1)+λtαΓ(2α+1)+(λtα)2Γ(3α+1)+.

    Hence,

    Eα,α+1(λtα)=λ1tα(Eα,1(λtα)1).

    (C3) It follows from [23,Lemma 2.2].

    (C4) It follows from [8,Proposition 1].

    (C5) By a direct calculation, we get

    ddtEα,1(λtα)=λtα1Eα,α(λtα),

    since α(0,1], t>0 and Eα,α(λtα) is positive by Proposition (C3), the assertion is proved.

    (C6) It follows from (1.99) of [20].

    In this section, we deal with the linear case that f(t,x)=f(t) is a continuous function by mean of the Laplace transform for caputo fractional derivative

    (LcDα0+x)(s)=sαX(s)sα1x(0), 0<α1, (3.1)

    where L denotes the Laplace transform operator, X(s) denotes the Laplace transform of x(t).

    From Lemma 3.2 of [14], we get

    (LEα(λtα))(s)=sα1sαλ,Re(s)>0,λC,|λsα|<1, (3.2)

    and

    (Ltβ1Eα,β(λtα))(s)=sαβsαλ,Re(s)>0,λC,|λsα|<1. (3.3)

    We do Laplace transform to the equation

    cDα0+x(t)λx(t)=f(t),  x(0)=x(ω). (3.4)

    By (3.1), we obtain

    sαX(s)λX(s)=F(s)+x(0)sα1,
    X(s)=F(s)sαλ+sα1sαλx(0),

    where F denotes the Laplace transform of f. By (3.2) and (3.3), we obtain that

    x(t)=t0(ts)α1Eα,α(λ(ts)α)f(s)ds+x(0)Eα,1(λtα). (3.5)

    Hence,

    x(ω)=x(0)Eα,1(λwα)+ω0(ωs)α1Eα,α(λ(ωs)α)f(s)ds=x(0),

    which implies that

    x(0)=ω0(ωs)α1Eα,α(λ(ωs)α)f(s)ds1Eα,1(λωα)

    if Eα,1(λωα)1. Therefore, if Eα,1(λωα)1, the solution of the problem (3.4) is

    x(t)=ω0(ωs)α1Eα,α(λ(ωs)α)f(s)ds1Eα,1(λωα)Eα,1(λtα)+t0Eα,α(λ(ts)α)(ts)1αf(s)ds=t0Eα,1(λtα)Eα,α(λ(ωs)α)(1Eα,1(λωα))(ωs)1αf(s)ds+t0Eα,α(λ(ts)α)(ts)1αf(s)ds+ωtEα,1(λtα)Eα,α(λ(ωs)α)(1Eα,1(λωα))(ωs)1αf(s)ds.

    Theorem 3.1. Let Eα,1(λωα)1, the periodic boundary value problem (3.4) has a unique solutiongiven by

    x(t)=ω0Gα,λ(t,s)f(s)ds,

    where

    Gα,λ(t,s)={Eα,1(λtα)Eα,α(λ(ωs)α)(1Eα,1(λωα))(ωs)1α+Eα,α(λ(ts)α)(ts)1α, 0s<tω,Eα,1(λtα)Eα,α(λ(ωs)α)(1Eα,1(λωα))(ωs)1α, 0ts<ω. (3.6)

    Remark 3.2. The unique solution x of (3.4) is continuous on [0,ω].

    Lemma 3.3. Let 0<α1,λ0 and sign(η) denotes the signumfunction. Then

    (F1) limt0+Gα,λ(t,s)=Eα,α(λ(ωs)α)(1Eα,1(λωα))(ωs)1α for anyfixed s[0,ω),

    (F2)limsωGα,λ(t,s)=sign(λ) for any fixed t[0,ω],

    (F3)limts+Gα,λ(t,s)= for any fixeds[0,ω),

    (F4)Gα,λ(t,s)>0 for λ<0 and for all t[0,ω] and s[0,ω),

    (F5)Gα,λ(t,s) changes its sign for λ>0 for t[0,ω] and s[0,ω).

    Proof. (F1) When 0ts<ω, by Proposition 2.1 (C1) we can get (F1).

    (F2) When 0ts<ω, it follows by Proposition 2.1 (C5) that 1Eα,1(λωα) is positive for λ<0 and negative for λ>0. The unboundedness is implied by continuity of Mittag-Leffler function, Proposition 2.1 (C1) and the relation limt0+tr= for r>0.

    (F3) When 0s<tω, the first term of (3.6) is finite due to the continuity of the involved functions. And by a similar argument as in the previous point of this proof we have the second term tends to infinity.

    (F4) It is obtained by the positivity of all involved functions (Proposition 2.1 (C3)) and the inequation 1Eα,1(λωα)>0 for λ<0.

    (F5) When 0s<tω, the second term of (3.6) is positive due to

    limst(ts)α1Eα,α(λ(ts)α)=+,

    and by the positivity of all involved functions (Proposition 2.1 (C3)) we get the proof. When 0ts<ω, it is obtained by 1Eα,1(λωα)<0 for λ>0 and the positivity of all involved functions (Proposition 2.1 (C3)).

    Proposition 3.4. Let α(0,1] and λ<0. Then the Green's function (3.6) satisfies

    (K1) Gα,λ(t,s)m=:Eα,1(λωα)Eα,α(λωα)|λ|ωEα,α+1(λωα)>0,

    (K2)ω0Gα,λ(t,s)ds=M=:1|λ| for all t[0,ω].

    Proof. (K1) For 0ts<ω, we deduce from Proposition 2.1 (C4),(C5) that Gα,λ has the minimum on the line t=s. Hence,

    Gα,λ(t,s)Gα,λ(t,t)=Eα,1(λtα)Eα,α(λ(ωt)α)(1Eα,1(λωα))(ωt)1αEα,1(λωα)Eα,α(λωα)(1Eα,1(λωα))ω1α=Eα,1(λωα)Eα,α(λωα)[1(Eα,α+1(λωα)λωα+1)]ω1α=Eα,1(λωα)Eα,α(λωα)|λ|ωEα,α+1(λωα).

    For 0s<tω, we have

    Gα,λ(t,s)Eα,1(λωα)Eα,α(λωα)|λ|ωEα,α+1(λωα)+Eα,α(λωα)ω1αEα,1(λωα)Eα,α(λωα)|λ|ωEα,α+1(λωα).

    (K2) Employing Proposition 2.1, we get

    ω0Gα,λ(t,s)ds=ω0Eα,1(λtα)Eα,α(λ(ωs)α)(ωs)1α(1Eα,1(λωα))ds+t0Eα,α(λ(ts)α)(ts)1αds=Eα,1(λtα)1Eα,1(λωα)ω0(ωs)α1Eα,α(λ(ωs)α)ds+t0(ts)α1Eα,α(λ(ts)α)ds=Eα,1(λtα)1Eα,1(λωα)ωαEα,α+1(λωα)+tαEα,α+1(λtα)=Eα,1(λtα)1Eα,1(λωα)ωαλ1ωα(Eα,1(λωα)1)+tαλ1tα(Eα,1(λtα)1)=1|λ|,

    which completes the proof.

    Let C[0,ω] be the space continuous function on [0,ω] with the norm x=sup{|x(t)|:t[0,ω]}.

    In this section, we always assume that λ<0. Clearly, x is a solution of (1.1) if and only if

    x(t)=ω0Gα,λ(t,s)f(s,x(s))ds, (4.1)

    where Gα,λ is Green's function defined in Theorem 3.1.

    The following famous Krasnosel'skii fixed point theorem, which is main tool of this section.

    Theorem 4.1. [22] Let B be a Banach space, and let PB be a cone. AssumeΩ1,Ω2 two open and bounded subsets of B with0Ω1,Ω1Ω2 and letA:P(¯Ω2Ω1)P bea completely continuous operator such that one of the followingconditions is satisfied:

    (L1) Axx, if xPΩ1, andAxx, if xPΩ2,

    (L2) Axx, if xPΩ1, andAxx, if xPΩ2.

    Then, A has at least one fixed point inP(¯Ω2Ω1).

    Proposition 4.2. Assume that there exist 0<r<R,0<c1<c2 such that

    f:[0,ω]×[mc1ωMc2r,R]R  is continuous, (4.2)
    c1f(t,u)c2, (t,u)[0,ω]×[mc1ωMc2r,R]. (4.3)

    Let PC[0,ω] be the cone

    P={xC[0,ω]:mint[0,ω]x(t)mc1ωMc2x}.

    Then the operator A:¯PRPrP givenby

    Ax(t)=ω0Gα,λ(t,s)f(s,x(s))ds (4.4)

    is completely continuous, where Pl={uP:u<l}.

    Proof. Let x¯PRPr, then

    mc1ωMc2rx(t)R  for  all  t[0,ω]. (4.5)

    We first show that A is well-defined, i.e. that A:¯PRPrP. Note that

    Ax(t)=ω0Gα,λ(t,s)f(s,x(s))ds=ω0Eα,1(λtα)Eα,α(λ(ωs)α)(ωs)1α(1Eα,1(λωα))f(s,x(s))ds       +t0Eα,α(λ(ts)α)(ts)1αf(s,x(s))ds=kq(ω)Eα,1(λtα)+q(t), (4.6)

    where k=11Eα,1(λωα) and

    q(t)={t0Eα,α(λ(ts)α)(ts)1αf(s,x(s))ds,0<tω,0,t=0. (4.7)

    Clearly, for t(0,ω]

    0<q(t)c2t0Eα,α(λ(ts)α)(ts)1αdsc2Γ(α)t0(ts)α1ds=c2Γ(α+1)tα, (4.8)

    which implies that q is continuous at t=0. On the other hand,

    q(t)=k<1α1λkt0(ts)αk+α1Γ(αk+α)f(s,x(s))ds+t0k1α1λkΓ(αk+α)(ts)αk+α1f(s,x(s))ds=k<1α1λkΓ(αk+α)t0uαk+α1f(tu,x(tu))du+t0k1α1λkΓ(αk+α)(ts)αk+α1f(s,x(s))ds=:H1(t)+H2(t),

    where

    H1(t)=k<1α1λkΓ(αk+α)t0uαk+α1f(tu,x(tu))du,H2(t)=t0k1α1λkΓ(αk+α)(ts)αk+α1f(s,x(s))ds.

    Since

    |uαk+α1f(tu,x(tu))|c2uαk+α1,u>0, t(0,ω], x¯PR/Pr,|λk(ts)αk+α1Γ(αk+α)f(s,x(s))|λkΓ(αk+α)tαk+α1c2, 0st, x¯PR/Pr,t0uαk+α1du<+, t(0,ω],k1α1λktαk+α1Γ(αk+α)<+, t(0,ω],

    we obtain that H1C[0,ω] and

    H2(t)=k1α1λkΓ(αk+α)t0(ts)αk+α1f(s,x(s))ds=:k1α1λkΓ(αk+α)uk(t).

    Noting that ukC(0,ω]

    |uk(t)|c2ωαk+ααk+α, t(0,ω],   λkΓ(αk+α)ωαk+ααk+α<+,

    we have H2C(0,ω]. Hence, qC[0,ω].

    Moreover,

    mc1ωMc2Ax=mc1ωMc2supω0Gα,λ(t,s)f(s,x(s))dsmc1ωMsupω0Gα,λ(t,s)ds=mc1ωminω0Gα,λ(t,s)f(s,x(s))ds=mint[0,ω]Ax(t), (4.9)

    which means that A:¯PRPrP.

    Next, we show that A is continuous on ¯PRPr. Let xn,x¯PRPr and xnx0. From (4.2), we have f(t,xn(t))f(t,x(t))0,

    AxnAx=supt[0,ω]|ω0Gα,λ(t,s)(f(s,x(s))f(s,y(s)))ds|supt[0,ω]ω0Gα,λ(t,s)dsf(t,xn(t))f(t,x(t))Mf(t,xn(t))f(t,x(t))0,

    which implies that A is continuous. From (4.6), we get that Ax(t) is uniformly bounded. Finally, we show that {Ax|x¯PR/Pr} is an equicontinuity in C[0,ω]. By (4.6), we have

    |Ax(t1)Ax(t2)|=|ω0(Gα,λ(t1,s)Gα,λ(t2,s))f(s,x(s))ds|kq(ω)|Eα,1(λtα1)Eα,1(λtα2)|+|q(t1)q(t2)|.

    Since Eα,1(λtα)C[0,ω], q(t)C[0,ω] are uniformly continuous, |Eα,1(λtα1)Eα,1(λtα2)| and |q(t1)q(t2)| tend to zero as |t1t2|0. Hence, {Ax(t)|x¯PRPr} is equicontinuous in C[0,ω].

    Finally, by Arzela-Ascoli theorem, we can obtain that A is compact. Hence, it is completely continuous.

    Theorem 4.3. Assume that there exist 0<r<R,0<c1<c2 such that (4.2)and (4.3) hold. Further suppose one of the followingconditions is satisfied

    (i)f(t,u)Mc2m2ω2c1u,  (t,u)[0,ω]×[mc1ωMc2r,r],

    f(t,u)|λ|u,  (t,u)[0,ω]×[mc1ωMc2R,R],

    (ii)f(t,u)|λ|u,  (t,u)[0,ω]×[mc1ωMc2r,r],

    f(t,u)Mc2m2ω2c1u,  (t,u)[0,ω]×[mc1ωMc2R,R].

    Then (1.1) has at least a positive solution x with rxR.

    Proof. Here we only consider the case (i). By Proposition 4.2, A:¯PRPrP is completely continuous. For xPr, we have

    x=r,  mc1ωMc2rx(t)r, t[0,ω]

    and

    Ax(t)mω0f(s,x(s))dsMc2mω2c1ω0x(s)dsr=x.

    Similarly, if xPR,

    mc1ωMc2Rx(t)R,  t[0,ω],
    0Ax(t)ω0Gα,λ(t,s)|λ|x(s)ds|λ|Rω0Gα,λ(t,s)ds=R=x.

    By Theorem 4.1, there exists x¯PRPr such that Ax=x and x is a solution of (1.1). Moreover,

    mc1ωMc2rx(t)R.

    Corollary 4.4. Let c1<c2 be positive reals and f(t,x) satisfy the conditions

    (i) c1f(t,x)c2 for all x0,

    (ii) f:[0,w]×(0,+)R is a continuous function.

    Then problem (1.1) has a positive solution.

    Proof. Let 0<r<c21m2ω2Mc2, R>c22M|λ|m1c1ω, then (4.2) and (4.3) are satisfied. Clearly, for (t,u)[0,ω]×[mc1ωMc2r,r],

    f(t,u)c1Mc2m2ω2c1rMc2m2ω2c1u

    and for (t,u)[0,ω]×[mc1ωMc2R,R],

    f(t,u)c2|λ|mc1ωMc2R|λ|u.

    Hence, by Theorem 4.3 (1.1) has at least a positive solution.

    Example 4.5. Consider the equation

    {cDα0+x(t)λx(t)=1+x1β(t), 0<xω,x(0)=x(ω), (4.10)

    where 0<α1,β>1 and

    Λ={λ<0,|λ|Eα,1(λωα)Eα,α(λωα)4Eα,α+1(λωα)}.

    Choosing c1=1,c2=2,r=110min{1,m2ω22M},R=1. It is easy to check that (4.2) and (4.3) hold. For λΛ,

    f(t,u)=1+u1β1Mc2m2ωc1rMc2m2ωc1u,(t,u)[0,ω]×[mc1ωMc2r,r],
    f(t,u)2|λ|mc1ωMc2=|λ|mω2M|λ|u,(t,u)[0,ω]×[mc1ωMc2R,R].

    Hence, (4.10) has at least one positive solution for λΛ.

    In this section, by using the monotone iterative method, we discuss the existence of solutions when λ=0 in (1.1). Firstly, we give the definition of the upper and lower solutions and get monotone iterative sequences with the help of the corresponding linear equation. Finally, we prove the limits of the monotone iterative sequences are solutions of (1.7).

    Definition 5.1. Let h,kC1[0,ω]. h and k are called lower solution and upper solution of problem (1.7), respectively if h and k satisfy

    cDα0+h(t)f(t,h(t)), 0<tω, h(0)h(ω), (5.1)
    cDα0+k(t)f(t,k(t)), 0<tω, k(0)k(ω), (5.2)

    Clearly, if g the lower solution or upper solution of (1.7), then cDα0+g is continuous on [0,ω].

    Lemma 5.2. Let δC[0,ω] with δ0 and pR with p0. Then

    {cDα0+z(t)λz(t)=δ(t), 0<tω,z(ω)z(0)=p, (5.3)

    has a unique solution z(t)0 for t[0,ω], where 0<α1,λ<0.

    Proof. Let z1, z2 are two solutions of (5.3) and v=z1z2, then

    {cDα0+v(t)λv(t)=0, 0<tω,v(ω)=v(0). (5.4)

    Using Theorem 3.1, (5.4) has trivial solution v=0.

    By (3.5), we can verify that problem (5.3) has a unique solution

    z=ω0Gα,λ(t,s)δ(t)ds+pEα,1(λωα)Eα,1(λωα)1.

    As consequence, by Proposition 2.1 (C3), (C5) and Lemma 3.3 (F4), we conclude that z(t)0. This completes the proof.

    Theorem 5.3. Assume that h,k are the lower and upper solutions ofproblem (1.7) and hk. Moreover, supposethat f satisfies the following properties:

    (M) there is λ<0 such that for all fixed t[0,ω], f(t,x)λx is nondecreasing in h(t)xk(t),

    (J) f:[0,ω]×[h(t),k(t)]R is a continuous function.

    Then there are two monotone sequences {hn} and {kn} are nonincreasingand nondecreasing, respectively with h0=h and k0=ksuch that limnhn=¯h(t), limnkn=¯k(t)uniformly on [0,ω], and ¯h,¯k are the minimal and the maximalsolutions of (1.7) respectively, such that

    h0h1h2...hn¯hx¯kkn...k2k1k0

    on [0,ω], where x is any solution of (1.7) such that h(t)x(t)k(t)on [0,ω].

    Proof. Let [h,k]={uC[0,ω]:h(t)u(t)k(t),t[0,ω]}. For any η[h,k], we consider the equation

    {cDα0+x(t)λx(t)=f(t,η(t))λη(t), 0<tω,x(0)=x(ω),

    Theorem 3.1 implies the above problem has a unique solution

    x(t)=ω0Gα,λ(t,s)(f(s,η(s))λη(s))ds. (5.5)

    Define an operator B by x=Bη, we shall show that

    (a) kBk,Bhh,

    (b) B is nondecreasing on [h,k].

    To prove (a). Denote θ=kBk, we have

    cDα0+θ(t)λθ(t)= cDα0+k(t) cDα0+Bk(t)λ(k(t)Bk(t))f(t,k(t))((f(t,k(t))λk(t))λk(t)=0,

    and θ(w)θ(0)0. Since kC1[0,ω],

    cDα0+kC[0,ω],   cDα0+BkC[0,ω].

    By Lemma 5.2, θ0, i.e. kBk. In an analogous way, we can show that Bhh.

    To prove (b). We show that Bη1Bη2 if hη1η2k. Let z1=Bη1, z2=Bη2 and z=z2z1, then by (M), we have

    cDα0+z(t)λz(t)= cDα0+z2(t) cDα0+z1(t)λ(z2(t)z1(t))=f(t,η2(t))λη2(t)(f(t,η1(t))λη1(t))0,

    and v(ω)=v(0). By Lemma 5.2, z(t)0, which implies Bη1Bη2.

    Define the sequence {hn}, {kn} with h0=h,k0=k such that hn+1=Bhn,kn+1=Bkn for n=0,1,2,.... From (a) and (b), we have

    h0h1h2...hnkn...k2k1k0

    on t[0,ω], and

    hn(t)=ω0Gα,λ(t,s)(f(s,hn1(s))λhn1(s))ds,
    kn(t)=ω0Gα,λ(t,s)(f(s,kn1(s))λkn1(s))ds.

    Therefore, there exist ¯h,¯k such that limnhn=¯h, limnkn=¯k.

    Similar to the proof of Proposition 4.2, we can show that B:[h,k][h,k] is a completely continuous operator. Therefore, ¯h,¯k are solutions of (1.7).

    Finally, we prove that if x[h0,k0] is one solution of (1.7), then ¯h(t)x(t)¯k(t) on [0,ω]. To this end, we assume, without loss of generality, that hn(t)x(t)kn(t) for some n. From property (b), we can get that hn+1(t)x(t)kn+1(t),t[0,ω]. Since h0(t)x(t)k0(t), we can conclude that

    hn(t)x(t)kn(t),  forall n.

    Passing the limit as n, we obtain ¯h(t)x(t)¯k(t), t[0,ω]. This completes the proof.

    Example 5.4. Consider the equation

    {cDα0+x(t)=t+1x2(t), 0<x1,x(0)=x(1). (5.6)

    It easy to check that h=1,k=2 are the low solution and upper solution of (5.6), respectively. Let λ=10. For all t[0,ω],

    f(t,u)λu=t2+1u2+10u

    is nondecreasing on u[1,2] and

    f(t,u)=t+1u2

    is continuous on [0,ω]×[1,2].

    Hence, there exist two monotone sequences {hn} and {kn}, nonincreasing and nondecreasing respectively, that converge uniformly to the extremal solutions of (5.6) on [h,k].

    This paper focuses on the existence of solutions for the Caputo fractional differential equation with periodic boundary value condition. We use Green's function to transform the problem into the existence of the fixed points of some operator, and we prove the existence of positive solutions by using the Krasnosel'skii fixed point theorem. On the other hand, the existence of the extremal solutions for the special case of the problem is obtained from monotone iterative technique and lower and upper solutions method. Since the fractional differential equation is nonlocal equation, the process of verifying the compactness of operator is very tedious, and we will search for some better conditions to prove the compactness of the operator A in the follow-up research. Meanwhile, since the existence result for 0<α1 is obtained in present paper, we will discuss the existence of solutions for the Caputo fractional differential equation when n1<αn in follow-up research.

    The authors declare that there are no conflicts of interest regarding the publication of this paper.



    [1] T. Back, Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms, Oxford: Oxford university press, 1996.
    [2] H. Chen, Y. Xu, M. Wang, X. Zhao, A balanced whale optimization algorithm for constrained engineering design problems, Appl. Math. Model., 71 (2019), 45–59. https://doi.org/10.1016/j.apm.2019.02.004 doi: 10.1016/j.apm.2019.02.004
    [3] Y. Zhong, L. Wang, M. Lin, H. Zhang, Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem, Swarm Evol. Comput., 48 (2019), 134–144. https://doi.org/10.1016/j.swevo.2019.04.002 doi: 10.1016/j.swevo.2019.04.002
    [4] A. Chakraborty, A. K. Kar, Swarm intelligence: a review of algorithms, Nature-Inspired Comput. Optimiz., 2017,475–494. https://doi.org/10.1007/978-3-319-50920-4_19 doi: 10.1007/978-3-319-50920-4_19
    [5] X. S. Yang, Nature-inspired metaheuristic algorithms, Beckington: Luniver press, 2010.
    [6] C. Özgüven, L. Özbakır, Y. Yavuz, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, App. Math. Model., 34 (2010), 1539–1548. https://doi.org/10.1016/j.apm.2009.09.002 doi: 10.1016/j.apm.2009.09.002
    [7] H. Salimi, Stochastic fractal search: a powerful metaheuristic algorithm, Know.-Based Syst., 75 (2015), 1–18. https://doi.org/10.1016/j.knosys.2014.07.025 doi: 10.1016/j.knosys.2014.07.025
    [8] P. Savsani, V. Savsani, Passing vehicle search (PVS): a novel metaheuristic algorithm, Appl. Math. Model., 40 (2016), 3951–3978. https://doi.org/10.1016/j.apm.2015.10.040 doi: 10.1016/j.apm.2015.10.040
    [9] Z. Cui, X. Gao, Theory and applications of swarm intelligence, Neural Comput. Applic., 2012,205–206. https://doi.org/10.1007/s00521-011-0523-8 doi: 10.1007/s00521-011-0523-8
    [10] A. Ribeiro, A. Awruch, H. Gomes, An airfoil optimization technique for wind turbines, Appl. Math. Model., 36 (2012), 4898–4907. https://doi.org/10.1016/j.apm.2011.12.026 doi: 10.1016/j.apm.2011.12.026
    [11] D. Binu, B. Kariyappa, RideNN: A new rider optimization algorithm-based neural network for fault diagnosis in analog circuits, IEEE T. Instrum. Meas., 68 (2018), 2–26. https://doi.org/10.1109/TIM.2018.2836058 doi: 10.1109/TIM.2018.2836058
    [12] F. Wang, H. Zhang, K. Li, Z. Lin, J. Yang, X. L. Shen, A hybrid particle swarm optimization algorithm using adaptive learning strategy, Inform. Sciences, 436 (2018), 162–177. https://doi.org/10.1016/j.ins.2018.01.027 doi: 10.1016/j.ins.2018.01.027
    [13] J. Chen, W. Yu, J. Tian, L. Chen, Z. Zhou, Image contrast enhancement using an artificial bee colony algorithm, Swarm Evol. Comput., 38 (2018), 287–294. https://doi.org/10.1016/j.swevo.2017.09.002 doi: 10.1016/j.swevo.2017.09.002
    [14] R. Skinderowicz, Improving ant colony optimization efficiency for solving large TSP instances, Appl. Soft Comput., 120 (2022), 108653. https://doi.org/10.1016/j.asoc.2022.108653 doi: 10.1016/j.asoc.2022.108653
    [15] W. Deng, J. Xu, H. Zhao, An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem, IEEE Access, 7 (2019), 20281–20292. https://doi.org/10.1109/ACCESS.2019.2897580 doi: 10.1109/ACCESS.2019.2897580
    [16] J. Lu, J. Zhang, J. Sheng, Enhanced multi-swarm cooperative particle swarm optimizer, Swarm Evol. Comput., 69 (2022), 1942–1948. https://doi.org/10.1016/j.swevo.2021.100989 doi: 10.1016/j.swevo.2021.100989
    [17] D. Wang, D. Tan, L. Liu, Particle swarm optimization algorithm: an overview, Soft Comput., 22 (2018), 387–408. https://doi.org/10.1007/s00500-016-2474-6 doi: 10.1007/s00500-016-2474-6
    [18] D. Kumar, K. Mishra, Portfolio optimization using novel co-variance guided Artificial Bee Colony algorithm, Swarm Evol. Comput., 33 (2017), 119–130. https://doi.org/10.1016/j.swevo.2016.11.003 doi: 10.1016/j.swevo.2016.11.003
    [19] S. Ghambari, A. Rahati, An improved artificial bee colony algorithm and its application to reliability optimization problems, Appl. Soft Comput., 62 (2018), 736–767. https://doi.org/10.1016/j.asoc.2017.10.040 doi: 10.1016/j.asoc.2017.10.040
    [20] D. H. Wolpert, W. G. Macready, No free lunch theorems for optimization, IEEE T. Evol. Comput., 1 (1997), 67–82. https://doi.org/10.1109/4235.585893 doi: 10.1109/4235.585893
    [21] X. S. Yang, S. Deb, Cuckoo search via Lévy flights, 2009 World congress on nature & biologically inspired computing (NaBIC), 2009,210–214.
    [22] S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Software, 69 (2014), 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007 doi: 10.1016/j.advengsoft.2013.12.007
    [23] W. T. Pan, A new fruit fly optimization algorithm: taking the financial distress model as an example, Know.-Based Syst., 26 (2012), 69–74. https://doi.org/10.1016/j.knosys.2011.07.001 doi: 10.1016/j.knosys.2011.07.001
    [24] S. Mirjalili, The ant lion optimizer, Adv. Eng. Software, 83 (2015), 80–98. https://doi.org/10.1016/j.advengsoft.2015.01.010 doi: 10.1016/j.advengsoft.2015.01.010
    [25] A. Askarzadeh, A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm, Comput. Struct., 169 (2016), 1–12. https://doi.org/10.1016/j.compstruc.2016.03.001 doi: 10.1016/j.compstruc.2016.03.001
    [26] A. H. Gandomi, A. H. Alavi, Krill herd: a new bio-inspired optimization algorithm, Commun. Nonlinear Sci., 17 (2012), 4831–4845. https://doi.org/10.1016/j.cnsns.2012.05.010 doi: 10.1016/j.cnsns.2012.05.010
    [27] X. S. Yang, Firefly algorithms for multimodal optimization, International symposium on stochastic algorithms, 5792 (2009). https://doi.org/10.1007/978-3-642-04944-6_14 doi: 10.1007/978-3-642-04944-6_14
    [28] M. Jain, V. Singh, A. Rani, A novel nature-inspired algorithm for optimization: Squirrel search algorithm, Swarm Evol. Comput., 44 (2019), 148–175. https://doi.org/10.1016/j.swevo.2018.02.013 doi: 10.1016/j.swevo.2018.02.013
    [29] S. Li, H. Chen, M. Wang, A. A. Heidari, S. Mirjalili, Slime mould algorithm: a new method for stochastic optimization, Future Gener. Comp. Sy., 111 (2020), 300–323. https://doi.org/10.1016/j.future.2020.03.055 doi: 10.1016/j.future.2020.03.055
    [30] S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris, S. M. Mirjalili, Salp Warm Algorithm: A bio-inspired optimizer for engineering design problems, Adv. Eng. Software, 114 (2017), 163–191. https://doi.org/10.1016/j.advengsoft.2017.07.002 doi: 10.1016/j.advengsoft.2017.07.002
    [31] R. Abbassi, A. Abbassi, A. A. Heidari, S. Mirjalili, An efficient salp swarm-inspired algorithm for parameters identification of photovoltaic cell models, Energ. Convers. Manage., 179 (2019), 362–372. https://doi.org/10.1016/j.enconman.2018.10.069 doi: 10.1016/j.enconman.2018.10.069
    [32] M. Tolba, H. Rezk, A. A. Z. Diab, M. Al-Dhaifallah, A novel robust methodology based salp swarm algorithm for allocation and capacity of renewable distributed generators on distribution grids, Energies, 11 (2018), 2556. https://doi.org/10.3390/en11102556 doi: 10.3390/en11102556
    [33] R. A. Ibrahim, A. A. Ewees, D. Oliva, M. Abd Elaziz, S. Lu, Improved salp swarm algorithm based on particle swarm optimization for feature selection, J. Amb. Intell. Hum. Comp., 10 (2019), 3155–3169. https://doi.org/10.1007/s12652-018-1031-9 doi: 10.1007/s12652-018-1031-9
    [34] N. Neggaz, A. A. Ewees, M. Abd Elaziz, M. Mafarja, Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection, Expert Syst. Appl., 145 (2020), 113103. https://doi.org/10.1016/j.eswa.2019.113103 doi: 10.1016/j.eswa.2019.113103
    [35] G. I. Sayed, G. Khoriba, M. H. Haggag, A novel chaotic salp swarm algorithm for global optimization and feature selection, Appl. Intell., 48 (2018), 3462–3481. https://doi.org/10.1007/s10489-018-1158-6 doi: 10.1007/s10489-018-1158-6
    [36] Q. Zhang, H. Chen, A. A. Heidari, X. Zhao, Y. Xu, P. Wang, et al., Chaos-induced and mutation-driven schemes boosting salp chains-inspired optimizers, IEEE Access, 7 (2019), 31243–31261. https://doi.org/10.1109/ACCESS.2019.2902306 doi: 10.1109/ACCESS.2019.2902306
    [37] H. Faris, M. M. Mafarja, A. A. Heidari, I. Aljarah, A. Z. Ala'M, S. Mirjalili, et al., An efficient binary salp swarm algorithm with crossover scheme for feature selection problems, Know.-Based Syst., 154 (2018), 43–67. https://doi.org/10.1016/j.knosys.2018.05.009 doi: 10.1016/j.knosys.2018.05.009
    [38] B. Yang, L. Zhong, X. Zhang, H. Shu, T. Yu, H. Li, et al., Novel bio-inspired memetic salp swarm algorithm and application to MPPT for PV systems considering partial shading condition, J. Clean. Prod., 215 (2019), 1203–1222. https://doi.org/10.1016/j.jclepro.2019.01.150 doi: 10.1016/j.jclepro.2019.01.150
    [39] A. A. El-Fergany, Extracting optimal parameters of PEM fuel cells using salp swarm optimizer, Renew. Energ., 119 (2018), 641–648. https://doi.org/10.1016/j.renene.2017.12.051 doi: 10.1016/j.renene.2017.12.051
    [40] Q. Fan, Z. Chen, Z. Li, Z. Xia, Y. Lin, An efficient refracted salp swarm algorithm and its application in structural parameter identification, Eng. Comput., 38 (2021), 175–189. https://doi.org/10.1007/s00366-020-01034-7 doi: 10.1007/s00366-020-01034-7
    [41] A. E. Hegazy, M. Makhlouf, G. S. El-Tawel, Improved salp swarm algorithm for feature selection, J. King Saud Uni. Comput. Inform. Sci., 32 (2020), 335–344. https://doi.org/10.1016/j.jksuci.2018.06.003 doi: 10.1016/j.jksuci.2018.06.003
    [42] W. Chao, R. Xu, L. Ma, J. Zhao, L. Wang, An efficient salp swarm algorithm based on scale-free informed followers with self-adaption weight, Appl. Intell., 2022, 1–33. https://doi.org/10.1007/s10489-022-03438-y doi: 10.1007/s10489-022-03438-y
    [43] M. Tawhid, A. Ibrahim, Improved salp swarm algorithm combined with chaos, Math. Comput. Simulat., 202 (2022), 113–148. https://doi.org/10.1016/j.matcom.2022.05.029 doi: 10.1016/j.matcom.2022.05.029
    [44] C. Lin, P. Wang, X. Zhao, H. Chen, Double mutational salp swarm algorithm: from optimal performance design to analysis, J. Bionic Eng., 2022, 1–28. https://doi.org/10.1007/s42235-022-00262-5 doi: 10.1007/s42235-022-00262-5
    [45] N. Singh, L. Hoang, F. Chiclana, J. Magnot, A new fusion of salp swarm with sine cosine for optimization of non-linear functions, Eng. Comput., 36 (2020), 185–212. https://doi.org/10.1007/s00366-018-00696-8 doi: 10.1007/s00366-018-00696-8
    [46] E. Rashedi, H. Nezamabadi-Pour, S. Saryazdi, GSA: a gravitational search algorithm, Inform. Sci., 179 (2009), 2232–2248. https://doi.org/10.1016/j.ins.2009.03.004 doi: 10.1016/j.ins.2009.03.004
    [47] V. Andersen, P. Nival, A model of the population dynamics of salps in coastal waters of the Ligurian Sea, J. Plankton Res., 8 (1986), 1091–1110. https://doi.org/10.1093/plankt/8.6.1091 doi: 10.1093/plankt/8.6.1091
    [48] D. Karaboga, B. Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J. Global Optim., 39 (2007), 459–471. https://doi.org/10.1007/s10898-007-9149-x doi: 10.1007/s10898-007-9149-x
    [49] A. R. Mehrabian, C. Lucas, A novel numerical optimization algorithm inspired from weed colonization, Ecol. Inform., 1 (2006), 355–366. https://doi.org/10.1016/j.ecoinf.2006.07.003 doi: 10.1016/j.ecoinf.2006.07.003
    [50] J. Barraza, L. Rodríguez, O. Castillo, P. Melin, F. Valdez, A new hybridization approach between the fireworks algorithm and grey wolf optimizer algorithm, J. Optim., 2018 (2018), 6495362. https://doi.org/10.1155/2018/6495362 doi: 10.1155/2018/6495362
    [51] N. Singh, F. Chiclana, J. P. Magnot, A new fusion of salp swarm with sine cosine for optimization of non-linear functions, Eng. Comput., 36 (2020), 185–212. https://doi.org/10.1007/s00366-018-00696-8 doi: 10.1007/s00366-018-00696-8
    [52] J. Derrac, S. García, D. Molina, F. Herrera, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm Evol. Comput., 1 (2011), 3–18. https://doi.org/10.1016/j.swevo.2011.02.002 doi: 10.1016/j.swevo.2011.02.002
    [53] A. Kaveh, V. R. Mahdavi, Colliding bodies optimization: a novel meta-heuristic method, Comput. Struct., 139 (2014), 18–27. https://doi.org/10.1016/j.compstruc.2014.04.005 doi: 10.1016/j.compstruc.2014.04.005
    [54] A. Kaveh, T. Bakhshpoori, E. Afshari, An efficient hybrid particle swarm and swallow swarm optimization algorithm, Comput. Struct., 143 (2014), 40–59. https://doi.org/10.1016/j.compstruc.2014.07.012 doi: 10.1016/j.compstruc.2014.07.012
    [55] W. Long, X. Liang, Y. Huang, Y. Chen, An effective hybrid cuckoo search algorithm for constrained global optimization, Neural Comput. Appl., 25 (2014), 911–926. https://doi.org/10.1007/s00521-014-1577-1 doi: 10.1007/s00521-014-1577-1
  • This article has been cited by:

    1. Zhilin Li, Guoping Chen, Weiwei Long, Xinyuan Pan, Variational approach to p-Laplacian fractional differential equations with instantaneous and non-instantaneous impulses, 2022, 7, 2473-6988, 16986, 10.3934/math.2022933
    2. Saleh Fahad Aljurbua, Extended existence results for FDEs with nonlocal conditions, 2024, 9, 2473-6988, 9049, 10.3934/math.2024440
    3. Saleh Fahad Aljurbua, Extended existence results of solutions for FDEs of order $ 1 < \gamma\leq 2 $, 2024, 9, 2473-6988, 13077, 10.3934/math.2024638
    4. Limin Guo, Weihua Wang, Cheng Li, Jingbo Zhao, Dandan Min, Existence results for a class of nonlinear singular $ p $-Laplacian Hadamard fractional differential equations, 2024, 32, 2688-1594, 928, 10.3934/era.2024045
  • 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(2232) PDF downloads(175) Cited by(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog