Loading [MathJax]/jax/output/SVG/jax.js

A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems

  • Published: 01 January 2017
  • 90C59

  • Inspired by the representation designed for floorplanning problems, in this paper, we proposed a new representation, namely the moving block sequence (MBS), for resource investment project scheduling problems (RIPSPs). Since each activity of a project in RIPSPs has fixed duration and resource demand, we consider an activity as a rectangle block whose width is equal to the duration of the activity and height the resource needed by the activity. Four move modes are designed for activities, by using which the activity can move to the appropriate position. Therefore, the new representation of the project of RIPSPs consists of two parts: an activity list and a move mode list. By initializing the move modes randomly for each activity and moving it appropriately, the activity list can be decoded into valid solutions of RIPSPs. Since the decoding method of MBS guarantees that after moved, each activity is scheduled in the left-most and bottom-most position within a coordinate, which means that each activity in the corresponding project is arranged as early as possible when the precedence constraints and resource demands are satisfied. In addition, the multiagent evolutionary algorithm (MAEA) is employed to incorporate with the newly designed MBS representation in solving RIPSPs. With the intrinsic properties of MBS in mind, four behaviors, namely the crossover, mutation, competition, and self-learning operators are designed for agents in MAEA. To test the performance of our algorithm, 450 problem instances are used and the experimental results demonstrate the good performance of the proposed representation.

    Citation: Xiaoxiao Yuan, Jing Liu, Xingxing Hao. 2017: A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems, Big Data and Information Analytics, 2(1): 39-58. doi: 10.3934/bdia.2017007

    Related Papers:

    [1] Chungen Liu, Huabo Zhang . Ground state and nodal solutions for fractional Kirchhoff equation with pure critical growth nonlinearity. Electronic Research Archive, 2021, 29(5): 3281-3295. doi: 10.3934/era.2021038
    [2] Senli Liu, Haibo Chen . Existence and asymptotic behaviour of positive ground state solution for critical Schrödinger-Bopp-Podolsky system. Electronic Research Archive, 2022, 30(6): 2138-2164. doi: 10.3934/era.2022108
    [3] Xiaoyong Qian, Jun Wang, Maochun Zhu . Existence of solutions for a coupled Schrödinger equations with critical exponent. Electronic Research Archive, 2022, 30(7): 2730-2747. doi: 10.3934/era.2022140
    [4] Ping Yang, Xingyong Zhang . Existence of nontrivial solutions for a poly-Laplacian system involving concave-convex nonlinearities on locally finite graphs. Electronic Research Archive, 2023, 31(12): 7473-7495. doi: 10.3934/era.2023377
    [5] Shiyong Zhang, Qiongfen Zhang . Normalized solution for a kind of coupled Kirchhoff systems. Electronic Research Archive, 2025, 33(2): 600-612. doi: 10.3934/era.2025028
    [6] Zhiyan Ding, Hichem Hajaiej . On a fractional Schrödinger equation in the presence of harmonic potential. Electronic Research Archive, 2021, 29(5): 3449-3469. doi: 10.3934/era.2021047
    [7] Lingzheng Kong, Haibo Chen . Normalized solutions for nonlinear Kirchhoff type equations in high dimensions. Electronic Research Archive, 2022, 30(4): 1282-1295. doi: 10.3934/era.2022067
    [8] Jun Wang, Yanni Zhu, Kun Wang . Existence and asymptotical behavior of the ground state solution for the Choquard equation on lattice graphs. Electronic Research Archive, 2023, 31(2): 812-839. doi: 10.3934/era.2023041
    [9] Zijian Wu, Haibo Chen . Multiple solutions for the fourth-order Kirchhoff type problems in RN involving concave-convex nonlinearities. Electronic Research Archive, 2022, 30(3): 830-849. doi: 10.3934/era.2022044
    [10] Xiaoguang Li . Normalized ground states for a doubly nonlinear Schrödinger equation on periodic metric graphs. Electronic Research Archive, 2024, 32(7): 4199-4217. doi: 10.3934/era.2024189
  • Inspired by the representation designed for floorplanning problems, in this paper, we proposed a new representation, namely the moving block sequence (MBS), for resource investment project scheduling problems (RIPSPs). Since each activity of a project in RIPSPs has fixed duration and resource demand, we consider an activity as a rectangle block whose width is equal to the duration of the activity and height the resource needed by the activity. Four move modes are designed for activities, by using which the activity can move to the appropriate position. Therefore, the new representation of the project of RIPSPs consists of two parts: an activity list and a move mode list. By initializing the move modes randomly for each activity and moving it appropriately, the activity list can be decoded into valid solutions of RIPSPs. Since the decoding method of MBS guarantees that after moved, each activity is scheduled in the left-most and bottom-most position within a coordinate, which means that each activity in the corresponding project is arranged as early as possible when the precedence constraints and resource demands are satisfied. In addition, the multiagent evolutionary algorithm (MAEA) is employed to incorporate with the newly designed MBS representation in solving RIPSPs. With the intrinsic properties of MBS in mind, four behaviors, namely the crossover, mutation, competition, and self-learning operators are designed for agents in MAEA. To test the performance of our algorithm, 450 problem instances are used and the experimental results demonstrate the good performance of the proposed representation.



    Our goal of this paper is to consider the existence of nodal solution and ground state solution for the following fractional Kirchhoff equation:

    {(a+bu2K)LKu+V(x)u=|u|2α2u+kf(x,u),xΩ,u=0,xR3Ω, (1)

    where a,b,k are positive real numbers. Let α(34,1) such that 2α=632α(4,6) and V(x)C(R3,R+), ΩR3 is a bounded domain with a smooth boundary Ω. u2K:=R3R3|u(x)u(y)|2K(xy)dxdy. The non-local integrodifferential operator LK is defined as follows:

    LKu(x)=12R3(u(x+y)+u(xy)2u(x))K(y)dy,xR3,

    the kernel K:R3(0,) is a function with the properties that

    (ⅰ) mKL1(R3), where m(x)=min{|x|2,1};

    (ⅱ) there exists λ>0 such that K(x)λ|x|(3+2α) for any xR3{0};

    (ⅲ) K(x)=K(x) for any xR3{0}.

    We note that when K(x)=1|x|3+2α, the integrodifferential operator LK is the fractional Laplacian operator (Δ)α:

    (Δ)αu(x)=C(α)2R3(u(x+y)+u(xy)2u(x))|y|3+2αdy

    and in this case

    R3R3|u(x)u(y)|2K(xy)dxdy=2C(α)R3|(Δ)α/2u(x)|2dx,

    where C(α)=(R31cosξ1|ξ|3+2αdξ)1 is the normalized constant.

    When a=1, b=0 and K(x)=1|x|3+2α, the fractional Kirchhoff equation is reduced to the undermentioned fractional nonlocal problem

    {(Δ)αu+V(x)u=|u|2α2u+kf(x,u),xΩ,u=0,xR3Ω. (2)

    Equation (2) is derived from the fractional Schrödinger equation and the nonlinearity f(x,u) represents the particles interacting with each other. On the other hand, recently a great attention has been given to the so called fractional Kirchhoff equation (see [3,10] etc., ):

    (a+bR3R3|u(x)u(y)|2|xy|3+2αdxdy)(Δ)αu=f(x,u), (3)

    where ΩRN is a bounded domain or Ω=RN, a>0,b>0 and u satisfies some boundary conditions. Problem (3) is called to the stationary state of the fractional Kirchhoff equation

    utt+(a+bR3R3|u(x)u(y)|2|xy|3+2αdxdy)(Δ)αu=f(x,u). (4)

    As a special significant case, the nonlocal aspect of the tension arises from nonlocal measurements of the fractional length of the string. For more mathematical and physical background on Schrödinger-Kirchhoff type problems, we refer the readers to [6] and the references therein.

    In the remarkable work of Caffarelli and Silvestre [2], the authors express this nonlocal operator (Δ)α as a Dirichlet-Neumann map for a certain elliptic boundary value problem with local differential operators defined on the upper half space. This technique is a valid tool to deal with the equations involving fractional operator in the respects of regularity and variational methods. However, we do not know whether the Caffarelli-Silvestre extension method can be applied to the general integro-differential operator LK. So the nonlocal feature of the integro-differential operator brings some difficulties to applications of variational method to problem (1). Some of these additional difficulties were overcome in [12,13]. More studies on this integro-differential operator equation, for examples, positive, negative, sign-changing or ground state solutions, we refer the papers [4,5,9,16] and their references. In [1], the authors considered the obstacle problems for LK about the higher regularity of free boundaries. The obstacle problems for nonlinear integro-differential operators and applications are also available in papers [7,8]. The appearance of nonlocal term not only makes it playing an important role in many physical applications, but also brings some difficulties and challenges in mathematical analysis. This fact makes the study of fractional Kirchhoff equation or similar problems particularly interesting. A lot of interesting results on the existence of nonlocal problems were obtained recently, specially on the existence of positive solutions, multiple solutions, ground states and semiclassical states, for examples, we refer [3,15,19] and the cited references.

    In past few years, some researchers began to search for nodal solutions of Schrödinger type equation with critical growth nonlinearity and have got some interesting results. For example, Zhang [20] considered the following Schrödinger-Poisson system:

    {Δu+u+k(x)ϕu=a(x)|u|p2u+u5,xR3,Δϕ=k(x)u2,xR3, (5)

    where p(4,6), k(x) and a(x) are nonnegative functions. By using variational method, a ground state solution and a nodal solution for problem (5) were obtained.

    Wang [17] studies the following Kirchhoff-type equation:

    {(a+bΩ|u|2dx)Δu=|u|4u+λf(x,u), xΩ,u=0, xΩ, (6)

    where ΩR3 is a bounded domain, λ,a,b>0 are fixed parameters, and f(x,) is continuously differentiable for a.e. xΩ. By combining constrained variational method with the degree theory, the existence of ground state and nodal solutions for above problem were obtained.

    However, as for fractional Kirchhoff types equation, to the best of our knowledge, few results involved the existence and asymptotic behavior of ground state and nodal solutions in case of critical growth. If k(x)1, the method used in [20] seems not valid for problem (1), because their result depends on the case kLp(R3)L(R3) for some p(1,2α). We employ minimization arguments on suitable nodal Nehari manifold Mk to construct a nodal solution by using various constrained method and qualitative deformation lemma given in [14].

    It's worth noting that, the Brouwer degree method used in [18] strictly depends on the nonlinearity fC1(R3×R,R), so we have to find new tricks to solve our modeling where we only allow f:R3×RR is a Carathéodory function. On the other hand, in our modeling, both of the nonlocal fractional operator LK and nonlocal terms R3R3|u(x)u(y)|2K(xy)dxdy appear, we need to overcome the difficulties caused by the nonlocal terms under a suitable variational framework. In brief, our discussion is based on the standard nodal Nehari manifold method used in [14].

    Throughout this paper, we let

    E={uX:R3V(x)u2dx<,u=0a.e.inR3Ω},

    where the space X introduced by Servadei and Valdinoci ([12,13]) denotes the linear space of Lebesgue measurable functions u:R3R such that its restriction to Ω u|ΩL2(Ω) and

    ((x,y)(u(x)u(y))K(xy)L2((R3×R3)(Ωc×Ωc),dxdy)

    with the following norm

    ||u||2X=||u||2L2+Q|u(x)u(y)|2K(xy)dxdy,

    where Q=(R3×R3)(Ωc×Ωc). Then, E is a Hilbert space with inner product

    u,v=a2R3R3(u(x)u(y))(v(x)v(y))K(xy)dxdy+ΩV(x)uvdx,u,vE

    and the norm defined by

    u2=a2R3R3|u(x)u(y)|2K(xy)dxdy+ΩV(x)u2dx.

    X0={uX:u=0a.e.inR3Ω} is a Hilbert space with inner product (u,v)K=12R3R3(u(x)u(y))(v(x)v(y))K(xy)dxdy and the Gagliardo norm u2K:=(u,u)K=12R3R3|u(x)u(y)|2K(xy)dxdy. In X0 the norms K and X are equivalent. Thus due to V(x)0 in Ω, the inner product , and the norm defined above still make sense for the Hilbert space E. Moreover, u2Kau2. For more details, we refer to [12].

    The following result for the space X0 will be used repeatedly.

    Lemma 1.1. ([12]) Let s(0,1), N>2s, Ω be an open bounded set of RN, X0↪↪Lp(Ω) for 2<p<2α, and X0L2α(Ω) is continuous. Then, EX0 has the same embedding properties.

    A weak solution uE of (1) is defined to satisfy the following equation

    12(a+bu2K)R3R3(u(x)u(y))(v(x)v(y))K(xy)dxdy+ΩV(x)u(x)v(x)dxΩ|u(x)|2α2u(x)v(x)dxkΩf(x,u(x))v(x)dx=0,

    for any vE, i.e.

    u,v+bu2K(u,v)KkΩf(x,u)vdxΩ|u|2α2uvdx=0,vE.

    As for the function f, we assume f:Ω×RR is a Carathéodory function and satisfing the following hypotheses:

    (f1): f(x,t)t>0 for t0,xΩ and limt0f(x,t)t=0forxΩuniformly;

    (f2): There exists q(4,2α) such that limtf(x,t)tq1=0 for all tR{0} and for xΩ uniformly;

    (f3): f(x,t)|t|3 is an nondecreasing function with respect to t in (,0) and (0,+) for a.e. xΩ.

    Remark 1. We note that under the conditions (f1)-(f3), it is easy to see the function f(x,t)=t3 is an example satisfying all conditions (f1)-(f3).

    The main results can be stated as follows.

    Theorem 1.2. Suppose that (f1)-(f3) are satisfied. Then, there exists k>0 such that for all kk, the problem (1) has a ground state nodal solution uk.

    Remark 2. The ground state nodal solution uk with u±k0 is a solution of (1) satisfying

    Jk(uk)=ck:=infuMkJk(u),

    where Mk is defined by (7) in next section. For uE, u± is defined by

    u+=max{u(x),0},u=min{u(x),0}.

    We recall that the nodal set of a continuous function u:R3R is the set u1(0). Every connected component of R3u1(0) is called a nodal domain. For this equation talking about the nodal domain of uk in somewhat is difficult for us, we leave it as future topics.

    Theorem 1.3. Suppose that (f1)-(f3) are satisfied. Then, there exists k>0 such that for all kk, the c=infuNkJk(u)>0 is achieved by vk, which is a ground state solution of (1) and

    Jk(uk)>2c,

    where Nk={uE {0}|Jk(u),u=0}, uk is the ground state nodal solution obtained in Theorem 1.1.

    Comparing with the literature, the above two results can be regarded as a supplementary of those in [3,4,14,17].

    The remainder of this paper is organized as follows. In Section 2, we give some useful preliminaries. In Section 3, we study the existence of ground state and nodal solutions of (1) and we prove Theorems 1.1-1.2.

    We define the energy functional associated with equation (1) as follows:

    Jk(u)=12u2+b4u4KkΩF(x,u)dx12αΩ|u|2αdx,uE.

    According to our assumptions on f(x,t), Jk(u) belongs to C1(E,R) (see [10,12]), then by direct computations, we have

    Jk(u),v=u,v+bu2K(u,v)KkΩf(x,u)vdxΩ|u|2α2uvdx,u,vE.

    Note that, since (1) involves pure critical nonlinearity |u|2α2u, it will prevent us using the standard arguments as in [14]. Hence, we need some tricks to overcome the lack of compactness of EL2α(R3).

    For fixed uE with u±0, the function φu:[0,)×[0,)R is well defined by φu(s,t)=Jk(su++tu). We set

    H(s,t)=Jk(su++tu),su+,G(s,t)=Jk(su++tu),tu.

    The argument generally used is to modify the method developed in [11]. The nodal Nehari manifold is defined by

    Mk={uE,u±0andJk(u),u+=Jk(u),u=0}, (7)

    which is a subset of the Nehari manifold Nk and contains all nodal solutions of (1). Then, one needs to show the minimizer uMk is a critical point of Jk. Because the problem (1) contains a nonlocal term u2K, the corresponding functional Jk does not have the decomposition

    Jk(u)=Jk(u+)+Jk(u),

    it brings difficulties to construct a nodal solution.

    The following result describes the shape of the nodal Nehari manifold Mk.

    Lemma 2.1. Assume that (f1)-(f3) are satisfied, if uE with u±0, then there is a unique pair (su,tu)(0,)×(0,) such that suu++tuuMk, which is also the unique maximum point of φu on [0,)×[0,). Furthermore, if Jk(u),u±0, then 0<su,tu1.

    Proof. From (f1) and (f2), for any ε>0, there is Cε>0 satisfying

    |f(x,t)|ε|t|+Cε|t|q1,tR. (8)

    By above equality and Sobolev's embedding theorems, we have

    H(s,t):=s2u+2+bsu++tu2K(su++tu,su+)KΩ|su+|2αdxkΩf(x,su+)su+dxast2R3R3[u+(x)u(y)+u(x)u+(y)]K(xy)dxdys2u+2C1s2αu+2αkεC2s2u+2kCεC3squ+q. (9)

    By choosing ε>0 small enough, we can deduce H(s,t)>0 for 0<s1 and all t0. Similarly,

    G(s,t):=t2u2+bsu++tu2K(su++tu,tu)KΩ|tu|2αdxkΩf(x,tu)tudxast2R3R3[u+(x)u(y)+u(x)u+(y)]K(xy)dxdy>0, (10)

    for 0<t1 and all s0. We denote D(u)=u+,u=a(u+,u)K=a2R3R3[u+(x)u(y)+u(x)u+(y)]K(xy)dxdy0. Hence, by choosing δ1>0 small, we have

    H(δ1,t)>0,G(s,δ1)>0. (11)

    For any δ2>δ1, by condition (f1), it is easy to see

    H(δ2,t)δ22u+2+bδ2u++tu2K(δ2u++tu,δ2u+)Kδ22αR3|u+|2αdx+δ2tD(u).

    Similarly, we have

    G(s,δ2)δ22u2+bsu++δ2u2K(su++δ2u,δ2u)Kδ22αR3|u|2αdx+sδ2D(u).

    By choosing δ21, we deduce

    H(δ2,t)<0,G(s,δ2)<0 (12)

    for all s,t[δ1,δ2].

    Following (11) and (12), we can use Miranda's Theorem (see Lemma 2.4 in [17]) to get a positive pair (su,tu)(0,)×(0,) such that suu++tuuMk. Similar to the standard argument in [17], we can prove the pair (su,tu) is unique maximum point of φu on [0,+)×[0,+).

    Lastly, we will prove that 0<su,tu1 when Jk(u),u±0. Following from sutu>0, by a direct computation, we have

    s2uu+2+s2uD(u)+s4ub(u+2K+u2K+2D(u))(u+2K+D(u))s2uu+2+sutuD(u)+b(s2uu+2K+t2uu2K+2sutuD(u))(s2uu+2K+sutuD(u))=s2αuR3|u+|2αdx+kR3f(x,suu+)suu+dx. (13)

    On the other hand, Jk(u),u+0 implies that

    u+2+D(u)+b(u+2K+u2K+2D(u))(u+2K+D(u))R3|u+|2αdx+kR3f(x,u+)u+dx. (14)

    From (13) - (14), we can see that

    (1s2u1)(u+2+D(u))(s2α4u1)R3|u+|2αdx+kR3[f(x,suu+)(suu+)3f(x,u+)(u+)3](u+)4dx.

    So we have su1, which implies that 0<su,tu1.

    Lemma 2.2. There exists k>0 such that for all kk, the infimum ck=infuMkJk(u) is achieved.

    Proof. For any uMk, in view of the definitions of Mk, it follows that

    u±2+bu2K(u,u±)K=kR3f(x,u±)u±dx+R3|u±|2αdx.

    Hence, in view of (8), we have

    u±2kεC1u±2+kC2u±q+C3u±2α.

    By choosing ε>0 small enough, we can deduce

    u±ρ (15)

    for some ρ>0. From assumption (f3), we have

    f(x,t)t4F(x,t)0, (16)

    and f(x,t)t4F(x,t) is nondecreasing in (0,+) and non-increasing in (,0) with respect to the variable t. Hence, combining with Jk(u),u=0, we have

    Jk(u)=14u2+(1412α)R3|u|2αdx+k4R3[f(x,u)u4F(x,u)]dx14u2.

    So ck=infuMkJk(u)0 is well defined.

    Let uE with u±0 be fixed. According to Lemma 2.1, for each k>0, there exists sk,tk>0 such that sku++tkuMk. Hence, by (f1) and the Sobolev's embedding theorem, we have

    s2αkR3|u+|2αdx+t2αkR3|u|2αdxsku++tku2+bsku++tku4K2s2ku+2+2t2ku2+4bs4ku+4K+4bt4ku4K,

    which implies (sk,tk) is bounded and furthermore by taking any sequence (skn,tkn)(s0,t0) as kn, we claim that s0=t0=0. In fact, if s0>0 or t0>0. Thanks to sknu++tknuMkn, we get

    sknu++tknu2+bsknu++tknu4K=R3|sknu++tknu|2αdx+knR3f(sknu++tknu)(sknu++tknu)dx. (17)

    Because kn and {sknu++tknu} is bounded in E, we have a contradiction with the equality (17). On the other hand, we have

    0ckJk(sku++tku)s2ku+2+t2ku2+2bs4ku+4K+2bt4ku4K,

    so limkck=0. By the definition of ck, we can find a sequence {un}Mk satisfing limnJk(un)=ck, which converges to uk=u++uE. By standard arguments, we have

    u±nu±inLp(R3)p(2,2α),u±n(x)u±(x)a.e.xR3.

    Denote β:=s3(S)32s, where

    S:=infuE{0}u2(R3|u|2αdx)22α.

    Sobolev embedding theorem insures that β>0. So that there exists k>0 such that ck<β for all kk. Fix kk, in view of Lemma 2.1, we have Jk(su+n+tun)Jk(un).

    By u±nu±inE, we have

    u±n2u±nu±2=2u±n,u±u±2.

    By taking n in both sides of above equality, there holds

    limnu±n2=limnu±nu±2+u±2.

    On the other hand, by (8) we have

    R3F(x,su±n)dxR3F(x,su±)dx.

    Then,

    lim infnJk(su+n+tun)s22limn(u+nu+2+u+2)+t22limn(unu2+u2)+bs44[limnu+nu+2K+u+2K]2+bt44[limnunu2K+u2K]2+stlim infnD(un)+bs2t24a2lim infnD2(un)+bs2t22lim infn(u+n2Kun2K)+bs3t2alim infn(D(un)u+n2K)+bst32alim infn(D(un)un2K)s2α2αlimn(|u+nu+|2α2α+|u+|2α2α)t2α2αlimn(|unu|2α2α+|u|2α2α)kR3F(x,su+)dxkR3F(x,tu)dx,

    where ||2 and ||2α are the norm in L2(R3) and L2α(R3) repeatedly. So, Fatou's Lemma follows that

    lim infnJk(su+n+tun)Jk(su++tu)+s22limnu+nu+2+t22limnunu2s2α2αlimn|u+nu+|2α2αt2α2αlimn|unu|2α2α+bs42limnu+nu+2Ku+2K+bs44(limnu+nu+2K)2+bt42limnunu2Ku2K+bt44(limnunu2K)2=Jk(su++tu)+s22A1s2α2αB1+t22A2t2α2αB2+bs42A3u+2K+bs44A23+bt42A4u2K+bt44A24,

    where

    A1=limnu+nu+2,A2=limnunu2,B1=limn|u+nu+|2α2α,B2=limn|unu|2α2α,A3=limnu+nu+2K,A4=limnunu2K.

    From the inequality above, we deduce that

    Jk(su++tu)+s22A1s2α2αB1+t22A2t2α2αB2+bs42A3u+2K+bs44A23+bt42A4u2K+bt44A24ck. (18)

    We next prove u±0. Because the claim u0 is similar, so we only prove u+0. Indirectly, we suppose that u+=0 and so A1ρ from (15). By letting t=0 in (18), the case B1=0 is done. So we only study the case B1>0 at length. In this case, by the definition of S, we deduce

    β=α3S32αα3(A1(B1)22α)32α.

    It happens that,

    α3(A1(B1)22α)32α=maxs0{s22A1s2α2αB1}maxs0{s22A1s2α2αB1+bs42A3u+2K+bs44A23}.

    The inequality (18) and ck<β follows that

    βmaxs0{s22A1s2α2αB1+bs42A3u+2K+bs44A23}ck<β,

    which is a contradiction. Thus u+0 are claimed.

    Then, we consider the key point to the proof of Theorem 1.1, that is B1=B2=0 and then ck is achieved by uk=u++uMk.

    Similarly, we only prove B1=0. Indirectly, we suppose that B1>0. We have two cases.

    Case 1: B2>0. Let ˉs and ˉt be the numbers such that

    ˉs22A1ˉs2α2αB1+bˉs42A3u+2K+bˉs44A23=maxs0{s22A1s2α2αB1+bs42A3u+2K+bs44A23},
    ˉt22A2ˉt2α2αB2+bˉt42A4u2K+bˉt44A24=maxt0{t22A2t2α2αB2+bt42A4u2K+bt44A24}.

    Since φu is continuous, we have (su,tu)[0,ˉs]×[0,ˉt] satisfying

    φu(su,tu)=max(s,t)[0,ˉs]×[0,ˉt]φu(s,t).

    If t>0 small enough, then, φu(s,0)<Jk(su+)+Jk(tu)φu(s,t) for all s[0,ˉs]. Thus there is t0[0,ˉt] such that φu(s,0)φu(s,t0) for all s[0,ˉs]. Thus, (su,tu)[0,ˉs]×{0}. Similarly, (su,tu){0}×[0,ˉt].

    By direct computation, we get

    s22A1s2α2αB1+bs42A3u+2K+bs44A23>0, (19)
    t22A2t2α2αB2+bt42A4u2K+bt44A24>0, (20)

    for all (s,t)(0,ˉs]×(0,ˉt]. Hence, there holds

    βˉs22A1ˉs2α2αB1+bˉs42A3u+2K+bˉs44A23+t22A2t2α2αB2+bt42A4u2K+bt44A24,
    βˉt22A2ˉt2α2αB2+bs42A3u+2K+bs44A23+s22A1s2α2αB1+bˉt42A4u2K+bˉt44A24.

    In view of (18), it follows that φu(s,ˉt)0s[0,ˉs] and φu(ˉs,t)0t[0,ˉt]. That is, (su,tu){ˉs}×[0,ˉt] and (su,tu)[0,ˉs]×{ˉt}. Hence, we can deduce that (su,tu)(0,ˉs)×(0,ˉt). By (18), (19) and (20), we deduce

    ckJk(suu++tuu)+s2u2A1s2αu2αB1+t2u2A2t2αu2αB2+bs4u2A3u+2K+bs4u4A23+bt4u2A4u2K+bt4u4A24>Jk(suu++tuu)ck.

    It is impossible. The proof of Case 1 is completed.

    Case 2: B2=0. From the definition of Jk, it is easy to show that there exists t0[0,) such that φu(s,t)0, for all (s,t)[0,ˉs]×[t0,). Thus, there is (su,tu)[0,ˉs]×[0,) satisfying

    φu(su,tu)=max(s,t)[0,ˉs]×[0,)φu(s,t).

    We need to prove that (su,tu)(0,ˉs)×(0,). Similarly, it is noticed that φu(s,0)<φu(s,t) for s[0,ˉs] and 0<t1, that is (su,tu)[0,ˉs]×{0}. Also, for s small enough, we get φu(0,t)<φu(s,t) for t[0,), that is (su,tu){0}×[0,). We note that

    βˉs22A1ˉs2α2αB1+bˉs42A3u+2K+bˉs44A23+t22A2t2α2αB2+bt42A4u2K+bt44A24.

    Thus also from (20) and B2=0, we have φu(ˉs,t)0 for all t[0,). Hence, (su,tu){ˉs}×[0,). That is, (su,tu) is an inner maximizer of φu in [0,ˉs)×[0,). Hence by using (19), we obtain

    ckJk(suu++tuu)+s2u2A1s2αu2αB1+t2u2A2t2αu2αB2+bs4u2A3u+2K+bs4u4A23+bt4u2A4u2K+bt4u4A24>Jk(suu++tuu)ck,

    which is a contradiction.

    Since u±0, by Lemma 2.1, there are su,tu>0 such that ˜u:=suu++tuuMk. On the other hand, Fatou's Lemma follows that

    Jk(u),u±lim infnu±n2+blim infnun2K(un,u±n)KlimnR3f(x,u±n)u±ndxlimnR3|u±n|2α+lim infnL(un)limnJk(un),u±n=0.

    By Lemma 2.1, we know 0<su,tu1. Since unMk and B1=B2=0, we have

    ckJk(˜u)14Jk(˜u),˜u=14(suu+2+tuu2)+(1412α)(|suu+|2α2α+|tuu|2α2α)+k4R3[f(x,suu+)(suu+)4F(x,suu+)]dx+k4R3[f(x,tuu)(tuu)4F(x,tuu)]dxlim infn[Jk(un)14Jk(un),un]=ck.

    So, we have completed proof of Lemma 2.2.

    In this section, we will prove main results.

    Proof. Since ukMk and Jk(u+k+uk)=ck, by Lemma 2.1, for (s,t)(R+×R+)(1,1), we have

    Jk(su+k+tuk)<ck. (21)

    If Jk(uk)0, then there exist δ>0 and θ>0 such that

    Jk(v)θ,forallvuk3δ.

    We know by the result (15), if uMk, there exists L>0 such that u±>L and we can assume 6δ<L. Let Q:=(12,32)×(12,32), and g(s,t)=su+k+tuk, (s,t)Q. In view of (21), it is easy to see that

    ¯ck:=maxQIg<ck. (22)

    Let ε:=min{(ck¯ck)/4,θδ/8} and Sδ:=B(uk,δ), there exists a deformation ηC([0,1]×E,E) satisfying

    (a)] η(t,v)=v if t=0, or v(Jk)1([ck2ε,ck+2ε])S2δ;

    (b)] η(1,(Jk)ck+εSδ)(Jk)ckε;

    (c)]Jk(η(1,v))Jk(v) for all vE;

    (d)]Jk(η(,v)) is non increasing for every vE.

    To finish the proof of Theorem 1.1, one of the key points is to prove that

    max(s,t)ˉQJk(η(1,g(s,t)))<ck. (23)

    The other is to prove that η(1,g(Q))Mk. Let us begin this work. In fact, it follows from Lemma 2.1 that g(s,t)(Jk)ck+ε. On the other hand, from (a) and (d), we get

    Jk(η(1,v))Jk(η(0,v))=Jk(v),vE. (24)

    For (s,t)Q, when s1 or t1, according to (21) and (24),

    Jk(η(1,g(s,t)))Jk(g(s,t))<ck.

    If s=1 and t=1, that is, g(1,1)=uk, so that it holds g(1,1)Jck+εkSδ, then by (b)

    Jk(η(1,g(1,1)))ckε<ck.

    Thus (23) holds. Then, let φ(s,t):=η(1,g(s,t)) and

    Υ(s,t):=(1sJk(φ(s,t)),(φ(s,t))+,1tJk(φ(s,t)),(φ(s,t))).

    The claim holds if there exists (s0,t0)Q such that Υ(s0,t0)=(0,0). Since

    g(s,t)uk2=(s1)u+k+(t1)uk2|s1|2u+k2>|s1|2(6δ)2,

    and |s1|2(6δ)2>4δ2s<2/3ors>4/3, using (ⅰ) and the range of s, for s=12 and for every t[12,32] we have g(12,t)S2δ, so from (a), we have φ(12,t)=g(12,t). Thus

    Υ(12,t)=(2Jk(12u+k+tuk),12u+k,1tJk(12u+k+tuk),tu).

    On the other hand, from (9) and uMk, we have that

    H(t,t)=(t2t4)(u+2+D(u))+(t4t2α)R3|u+|2αdx+kt4R3(f(x,u+)f(x,tu+)t3)u+dx.

    According to (f3), when 0<t<1, H(t,t)>0, while in the case t>1, H(t,t)<0. Similarly, it is easy to get G(t,t)>0fort(0,1),G(t,t)<0fort>1. By above discussions, due to (f3) and 2α>4, we have

    H(12,t)=12u+k2+t2D(uk)+b(14u+k2K+t2uk2K+taD(uk))(14u+k2K+t2aD(uk))(12)2αR3|u+k|2αdxkR3f(x,12u+k)12u+kdxH(12,12)>0,

    which implies that

    H(12,t)>0,t[12,32]. (25)

    Analogously, φ(32,t)=g(32,t) implies that

    H(32,t)=32u+k2+3t2D(uk)+b(94u+k2K+t2uk2K+3taD(uk))(94u+k2K+3t2aD(uk))(32)2αR3|u+k|2αdxkR3f(x,32u+k)32u+kdxH(32,32)<0,

    that is,

    H(32,t)<0,t[12,32]. (26)

    By the same way,

    G(s,12)>0,s[12,32],andG(s,32)>0,s[12,32]. (27)

    From (25)-(27), the assumptions of Miranda's Theorem (see Lemma 2.4 in [17]) are satisfied. Thus, there exists (s0,t0)Q such taht Υ(s0,t0)=0, i.e. η(1,g(s0,t0))Mk. Comparing to (23), uk is a ground state nodal solution of problem (1).

    Proof. Recall that β=α3S32α, where S:=infuE{0}u2(R3|u|2αdx)22α. Similar to the proof of Lemma 2.2, we claim that there exists k1>0 such that for all kk1, there exists vkNk such that Jk(vk)=c>0 and there is k>0 such that c<β for all kk. By standard processes, we can assume vnvkE. Therefore, lim infnJk(tvn)cJk(tvk)+t22At2α2αB+bt44(C2+2Cvk2K), where A=limnvnvk2,B=limn|vnvk|2α2α and C=vnvk2K.

    Firstly, we prove that vk0. By contradiction, we suppose vk=0. The Case B=0 is contained in above equality. So we only consider the case B>0. The fact βα3(A1(B1)22α)32α follows that

    β˜t22A˜t2α2αB:=maxt0{t22At2α2αB}maxt0{t22At2α2αB+bt44(C2+2Cvk2K)}c<β.

    Which is a contradiction.

    Then, we prove that B=0 and cisachievedbyvk. Indirectly, we suppose that B>0. Firstly, we can maximize φvk(t)=Jk(tvk) in [0,) at tv, which be an inner maximizer. So we get t2v2At2αv2αB+bt4v4(C2+2Cvk2K)>0. Thus from tvvkNkb we get a contradiction by

    cJk(tvvk)<Jk(tvvk)+t2v2At2αv2αB+bt4v4(C2+2Cvk2K)c.

    From the above arguments we know ˜v:=tvvkNk. Furthermore, we have

    cJk(˜v)14Jk(˜v),˜v14vk2+(1412α)|vk|2α2α+k4R3[f(x,vk)vk4F(x,vk)]dx=lim infn[Jk(vn)14Jk(vn),vn]=c.

    Therefore, tv=1, and c is achieved by vkNk.

    By standard arguments, we can find vkE, a ground state solution of problem (1). For all kk, the problem (1) also has a ground state nodal solution uk. Let k=max{k,k1}. Suppose that uk=u++u, we let su+,tu(0,1) such that

    su+u+Nk,tuuNk.

    Thus, the above fact follows that

    2cJk(su+u+)+Jk(tuu)Jk(su+u++tuu)<Jk(u++u)=ck.
    [1] Abbass H. A., Bender A., Dam H., Baker S., Whitacre J. M., Sarker R. A. (2008) Computational scenario-based capability planning. in Genetic and Evolutionary Computation Conference (GECCO), ACM, Atlanta, Georgia 1437-1444. doi: 10.1145/1389095.1389378
    [2] Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112: 3-41. doi: 10.1016/S0377-2217(98)00204-5
    [3] Bui L. T., Barlow M., Abbass H. A. (2009) A multi-objective risk-based framework for mission capability planning. New Mathematics and Natural Computation 5: 459-485. doi: 10.1142/S1793005709001428
    [4] Chicano F., Luna F., Nebro A. J., Alba E. (2011) Using multi-objective metaheuristics to solve the software project scheduling problem. in GECCO'11 Proceedings of the 13th annual conference on Genetic and evolutionary computation, ACM, Dublin, Ireland 1915-1922. doi: 10.1145/2001576.2001833
    [5] Cho S.-H., Eppinger S. D. (2005) A simulation-based process model for managing complex design projects. IEEE Trans. Engineering Management 52: 316-328. doi: 10.1109/TEM.2005.850722
    [6] Debels D., Reyck B. D., Leus R., Vanhoucke M. (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169: 638-653, Feature Cluster on Scatter Search Methods for Optimization. doi: 10.1016/j.ejor.2004.08.020
    [7] Demeulemeester E. (1995) Minimizing resource availability costs in time-limited project networks. Management Science 41: 1590-1598. doi: 10.1287/mnsc.41.10.1590
    [8] Depenbrock B., Balint T., Sheehy J. (2015) Leveraging design principles to optimize technology portfolio prioritization. in 2015 IEEE Aerospace Conference 1-10. doi: 10.1109/AERO.2015.7119203
    [9] Drexl A., Kimms A. (2001) Optimization guided lower and upper bounds for the resource investment problem. The Journal of the Operational Research Society 52: 340-351. doi: 10.1057/palgrave.jors.2601099
    [10] Hindi K. S., Yang H., Fleszar K. (2002) An evolutionary algorithm for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation 6: 512-518. doi: 10.1109/TEVC.2002.804914
    [11] Kolisch R. (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90: 320-333. doi: 10.1016/0377-2217(95)00357-6
    [12] Kolisch R., Hartmann S. (1999) Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. Project Scheduling 147-178. doi: 10.1007/978-1-4615-5533-9_7
    [13] Kolisch R., Hartmann S. (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research 174: 23-37. doi: 10.1016/j.ejor.2005.01.065
    [14] Kolisch R., Sprecher A., Drexl A. (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41: 1693-1703. doi: 10.1287/mnsc.41.10.1693
    [15] Liu J., Zhong W., Jiao L. (2010) A multiagent evolutionary algorithm for combinatorial optimization problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 40: 229-240.
    [16] Liu J., Zhong W., Jiao L., Li X. (2008) Moving block sequence and organizational evolutionary algorithm for general floorplanning with arbitrarily shaped rectilinear blocks. IEEE Transactions on Evolutionary Computation 12: 630-646.
    [17] Liu J., Zhong W., Jiao L. (2006) A multiagent evolutionary algorithm for constraint satisfaction problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 36: 54-73.
    [18] Minku L. L., Sudholt D., Yao X. (2012) Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design. in GECCO'12 Proceedings of the 14th annual conference on Genetic and evolutionary computation, ACM, Philadelphia, Pennsylvania USA 1221-1228. doi: 10.1145/2330163.2330332
    [19] Möhring R. H. (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operational Research 32: 89-120.
    [20] Nübel H. (2001) The resource renting problem subject to temporal constraints. OR-Spektrum 23: 359-381. doi: 10.1007/PL00013357
    [21] C. Qian, Y. Yu and Z. -H. Zhou, Variable solution structure can be helpful in evolutionary optimization Science China Information Sciences, 58 (2015), 112105, 17 pp.

    10.1007/s11432-015-5382-y

    MR3416545

    [22] Reyck B. D., Leus R. (2008) R&d project scheduling when activities may fail. IIE Transactions 40: 367-384. doi: 10.1080/07408170701413944
    [23] Schultz S. R., Atzmon J. (2014) A simulation based heuristic approach to a resource investment problem (rip). in Proceedings of the Winter Simulation Conference 3411-3422. doi: 10.1109/WSC.2014.7020174
    [24] Shadrokh S., Kianfar F. (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research 181: 86-101. doi: 10.1016/j.ejor.2006.03.056
    [25] Xiong J., Liu J., Chen Y., Abbass H. A. (2014) A knowledge-based evolutionary multiobjective approach for stochastic extended resource investment project scheduling problems. IEEE Transactions on Evolutionary Computation 18: 742-763.
    [26] Xiong J., wei Yang K., Liu J., song Zhao Q., Chen Y.wu. (2012) A two-stage preference-based evolutionary multi-objective approach for capability planning problems. Knowledge-Based Systems 31: 128-139. doi: 10.1016/j.knosys.2012.02.003
    [27] Zhong W., Liu J., Xue M., Jiao L. (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 34: 1128-1141.
  • This article has been cited by:

    1. Yue Wang, Wei Wei, Ying Zhou, The Existence, Uniqueness, and Multiplicity of Solutions for Two Fractional Nonlocal Equations, 2023, 12, 2075-1680, 45, 10.3390/axioms12010045
  • Reader Comments
  • © 2017 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(4238) PDF downloads(514) Cited by(1)

Figures and Tables

Figures(6)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog