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

An efficient eigenvector-based crossover for differential evolution: Simplifying with rank-one updates

  • Received: 02 January 2025 Revised: 25 January 2025 Accepted: 06 February 2025 Published: 24 February 2025
  • MSC : 68T01, 68W50

  • We propose a new approach to enhancing the efficiency of the differential evolution (DE) algorithm, specifically targeting rotational invariance. The performance of the DE algorithm can be hampered by the crossover's dependency on the coordinate system, particularly in optimization problems involving strongly correlated variables. Previous attempts to achieve rotational invariance in the DE algorithm have involved estimating the covariance matrix using the population's distribution information and executing the crossover operation in an eigen coordinate system. However, these methods are computationally intensive. Our approach exclusively employs the rank-one update method, estimating the covariance matrix using the means of the current and previous generations' populations. This lightweight technique reduces the computational costs from O(NpD2) to O(D2) (where Np is the population size and D is the dimension) operations, yet still preserves the critical rotational invariance property. Experiments conducted on 57 benchmark functions demonstrated that our method finds quicker and more accurate solutions than previous methods. This represents a substantial improvement in achieving rotational invariance in the DE algorithm.

    Citation: Tae Jong Choi. An efficient eigenvector-based crossover for differential evolution: Simplifying with rank-one updates[J]. AIMS Mathematics, 2025, 10(2): 3500-3522. doi: 10.3934/math.2025162

    Related Papers:

    [1] Liang Hong, Jie Li, Libin Rong, Xia Wang . Global dynamics of a delayed model with cytokine-enhanced viral infection and cell-to-cell transmission. AIMS Mathematics, 2024, 9(6): 16280-16296. doi: 10.3934/math.2024788
    [2] Yanchao Liu, Pengzhou Zhang, Deyu Li, Junpeng Gong . Dynamic analysis and optimum control of a rumor spreading model with multivariate gatekeepers. AIMS Mathematics, 2024, 9(11): 31658-31678. doi: 10.3934/math.20241522
    [3] Ahmed M. Elaiw, Ghadeer S. Alsaadi, Aatef D. Hobiny . Global co-dynamics of viral infections with saturated incidence. AIMS Mathematics, 2024, 9(6): 13770-13818. doi: 10.3934/math.2024671
    [4] Hui Wang, Shuzhen Yu, Haijun Jiang . Rumor model on social networks contemplating self-awareness and saturated transmission rate. AIMS Mathematics, 2024, 9(9): 25513-25531. doi: 10.3934/math.20241246
    [5] A. E. Matouk, Ismail Gad Ameen, Yasmeen Ahmed Gaber . Analyzing the dynamics of fractional spatio-temporal SEIR epidemic model. AIMS Mathematics, 2024, 9(11): 30838-30863. doi: 10.3934/math.20241489
    [6] Yujuan Jiao, Jinmiao Yang, Hang Zhang . Traveling wave solutions to a cubic predator-prey diffusion model with stage structure for the prey. AIMS Mathematics, 2022, 7(9): 16261-16277. doi: 10.3934/math.2022888
    [7] Xuefeng Yue, Weiwei Zhu . The dynamics and control of an ISCRM fractional-order rumor propagation model containing media reports. AIMS Mathematics, 2024, 9(4): 9721-9745. doi: 10.3934/math.2024476
    [8] B. M. Almuqati, F. M. Allehiany . Global stability of a multi-group delayed epidemic model with logistic growth. AIMS Mathematics, 2023, 8(10): 23046-23061. doi: 10.3934/math.20231173
    [9] Shufan Wang, Zhihui Ma, Xiaohua Li, Ting Qi . A generalized delay-induced SIRS epidemic model with relapse. AIMS Mathematics, 2022, 7(4): 6600-6618. doi: 10.3934/math.2022368
    [10] Ahmed M. Elaiw, Amani S. Alsulami, Aatef D. Hobiny . Global properties of delayed models for SARS-CoV-2 infection mediated by ACE2 receptor with humoral immunity. AIMS Mathematics, 2024, 9(1): 1046-1087. doi: 10.3934/math.2024052
  • We propose a new approach to enhancing the efficiency of the differential evolution (DE) algorithm, specifically targeting rotational invariance. The performance of the DE algorithm can be hampered by the crossover's dependency on the coordinate system, particularly in optimization problems involving strongly correlated variables. Previous attempts to achieve rotational invariance in the DE algorithm have involved estimating the covariance matrix using the population's distribution information and executing the crossover operation in an eigen coordinate system. However, these methods are computationally intensive. Our approach exclusively employs the rank-one update method, estimating the covariance matrix using the means of the current and previous generations' populations. This lightweight technique reduces the computational costs from O(NpD2) to O(D2) (where Np is the population size and D is the dimension) operations, yet still preserves the critical rotational invariance property. Experiments conducted on 57 benchmark functions demonstrated that our method finds quicker and more accurate solutions than previous methods. This represents a substantial improvement in achieving rotational invariance in the DE algorithm.



    Rumors are pieces of information that are not verified and often spread quickly through word of mouth, social media, or other means of communication. They can have serious consequences, causing panic, fear, and even violence. Therefore, understanding how rumors start and spread is crucial to prevent their negative impacts.

    In order to better predict and control rumors, the commonly used method is to utilize mathematics to study the mathematical rumor model, analyze its nature, and apply it to real life to reduce the adverse effects of rumors. For example, in [1], the authors studied the local stability and optimal control of the rumor propagation model in online social networks as the number of total users changes. Because the transmission mechanism of rumors is very similar to that of infectious diseases, the research method of infectious diseases can be used to study the model of rumor transmission. Besides, many scholars have studied the rumor propagation model of ordinary differential equations, and a large number of brilliant results have appeared. In 1965, Daley and Kendall [2] proposed a mathematical model of rumor propagation, namely the DK model, and the model divided the population into three categories, namely, ignorant people, disseminators, and rational people. In 1973, Maki and Thomson [3] developed the DK model on the basis of mathematical theoretical analysis, introducting an immune population, and established the MT rumor model. Afterwards, subsequent studies based on the MT rumor model have been expanded and promoted, and most of the research literature assumes that rumor spreading can ignore the skeptical population, that is, upon hearing the rumor, every ignorant person will immediately spread it, become a spreader, and then wake up and acquire permanent or temporary immunity. For such models, we call them SIR models or SIRS models based on the infectious disease model. For example, in [4], Wang et al. introduced the trust mechanism into the SIR model to obtain a new model of removal of susceptible persons, which reduced the size of the final rumor and the speed of rumor propagation, and delayed the end time of the rumor.

    When rumors spread more and more widely, and even emergency situations such as subway congestion or car accidents occur, it is crucial to improve the ability to deal with such emergencies. In this regard, the authors in [5] established an improved SIRS model of the spread of passenger panic in subway emergencies, which provides certain reference significance for the construction and implementation of rail transit emergency treatment modes. Then, in [6], Zhang et al. took into account a forgetting mechanism and a memory mechanism, and analyzed the final scale of rumor propagation.

    Moreover, many rumors are not propagated immediately by the disseminators after hearing the rumors, and some people are skeptical and do not spread rumors during the wait-and-see period. For such populations, skeptics are introduced into the model, and the resulting models are called SEIR models or SEIRS models, respectively, depending on whether the sober person is permanently awake. For example, in research [7], Liu et al. proposed a novel SEIR heterogeneous network model for rumor propagation and analyzed the global dynamic behavior of the rumor-free equilibrium point. In the research [8], Chen et al. considered a new model, it was known as the susceptibility-exposure-infection-recovery-susceptibility (SEIRS-V) model. However, the above studies do not consider the effects of time delay.

    It is worth noting that time delay is a real and common phenomenon in social networks. Considering this factor, many scholars have established a rumor propagation model with delay. In [9], the authors proposed a delayed rumor propagation model in social networks and analyzed and discussed the Hopf bifurcation between time delay and rumor propagation rate.

    It is well known that optimal control by media intervention refers to the use of media channels and strategies to influence or manipulate public opinion, shape narratives, and control information flow for a specific agenda or outcome. While media intervention can be used for various purposes, such as promoting positive social change or raising awareness about important issues, it can also be utilized for more manipulative purposes. For example, in [10], Misra et al. proposed a nonlinear susceptible-infected-susceptible (SIS) infectious disease model that incorporated media-induced behavioral responses and integrated media publicity activities into the modeling process to encourage individuals to adopt protective measures. This approach resulted in a decline in the transmission rate, which in turn altered the contact rate and effectively controlled the spread of infectious diseases. This study illustrates the significant impact of implementing media control strategies on the future course of an epidemic. Chen [11] has extended the traditional rumor theory to incorporate crisis management by establishing an ignorants-latents-spreaders-cooled-removed (ILSCR) rumor propagation model, and explored the media's control of rumors in emergencies, taking into account factors such as the cooling-off period, which is more reflective of real-world situations, and the mobility of personnel in specific regions. The numerical results of the study demonstrate that enhancing the credibility of mainstream media could potentially serve as an effective measure for controlling rumors. Meanwhile, optimal control has also been discussed to reduce the frequency of rumor propagation [12,13,14]. For example, Zhu and Wang [12] proposed a rumor propagation model with the function of forced silence in online social networks to further strengthen the supervision of network information security. Their research also analyzed the Hopf bifurcation phenomenon caused by time delay during rumor propagation. Because of the negative impact of rumors on society, researchers have focused on the optimal control of rumors after studying the mechanism of rumor propagation. In [14], the authors introduced a new classification for the pages that propagate rumors within the network, and proposed a cholera-based model to depict the dynamic process of rumor dissemination via social media. This study also implemented an optimal control strategy to counter the spread of rumors on social media. The effectiveness of this strategy was validated through final numerical results. In addition, in [15] the author studied a constant rumor propagation model with an age-dependent propagation coefficient among people with age structure; in [16,17,18], the authors considered random factors and studied stochastic rumor propagation models. In [19], Zhang and Teng improved the SEIRS disease transmission model with exponential population structure in [20], in which they not only analyzed the stability of disease-free balance and the existence, uniqueness and stability of endemic balance, but they also proved the uniform persistence of the disease.

    However, in previous studies, most scholars did not consider the logistic growth of the spread population. This logistic growth phenomenon means that rumors spread quickly at the beginning, but after a period of time, the increase rate of the number of sober people will gradually slow down the increase rate of the spreading population. As time goes by, people lose interest in rumors, and rumors gradually stop spreading. Therefore, this kind of growth phenomenon is more realistic in the process of rumor propagation, and it is necessary to consider the logistic growth of the spreading population in the rumor propagation model. Although some previous studies have discussed the optimal control strategy for controlling rumors, it is a very new perspective to control rumors in unexpected situations through media publicity activities. It is the most direct and easiest way for media to refute rumors through social software. Therefore, analyzing media control is a necessary way to curb rumors. In this paper, we consider the effects of two time delays. When a controversial topic appears, people will be confused, they will hesitate, wait and see, and then analyze and demonstrate, where the time spent in the middle is the time lag. The two time delays reflect real-life more effectively, and most previous studies have been based on a single time delay. In addition, differing from the linear propagation rate and the standard propagation rate, we choose the saturated propagation rate because of the large target population base. The main purpose of this paper is to study the spreading mechanism and influencing factors of a rumor model using an epidemic-like model.

    The content of this paper is organized as follows: Section 2 presents the considered model and some preliminaries. Section 3 studies the boundedness of the system and analyzes the conditions for the existence of a positive equilibrium point. Section 4 gives the conditions for the stability of the rumor-free equilibrium point. Section 5 discusses the permanence of the rumor. In Section 6, sufficient conditions for the global stability (including local stability) of the local equilibrium point of system (3) are given. In Section 7, the optimal control by media for the system is given. Section 8 gives three examples with numerical simulations to illustrate the main results of this paper. Finally, Section 9 gives the conclusions of this paper.

    Based on the above works and the model discussed in [20], the components X, D, Y, and Z stand, respectively, for the ignorant, the doubters (doubting but not spreading rumors), the communicators, and the sober, and thus we can obtain the rumor propagation model with exponential population structure

    {dXdt=bN(t)bX(t)βX(t)Y(t)N(t)+ϵebτZ(tτ),D=ttωβX(u)Y(u)N(u)eb(tu)du,dYdt=βebωX(tω)Y(tω)N(tω)(b+η)Y(t),Z=ttτεY(u)eb(tu)du,N(t)=X(t)+D(t)+Y(t)+Z(t). (1)

    The spread rate of rumors, like the incidence rate in epidemiological models, plays a very important role in the rumor spreading model. We can refer to the definition of incidence rate to write a general expression of transmission rate: βC(N)XYN where N(t) represents the total population at time t. In most models of rumor spreading, the linear incidence rate βXY and standard incidence rate βXYN are frequently used. Linear incidence is more suitable for propagation in a chain of relationships than in a network. For standard incidence rates, a large target base of the rumor and higher actual exposure per person than assumed by the theory provides a good approximation. However, when the target base is low, the authors [19] combined the two previous approaches by assuming that the number of actual per capita partners C(N) is proportional to N, whereas, if the number of available partners is large, there is a saturation effect which makes the number of actual partners constant. Specifically, it has the form (Michaelis-Menten contact rate):

    C(N)=aN1+bN.

    Clearly, the transmission rate of the above form indicates that the number of new communicators per unit time is saturated with the total population. If the propagation rate of the ignorant or the spreader is saturated, two forms of propagation are used in the rumor propagation dynamics model: βXY1+αX, βXY1+αY.

    The parameter b is the rate that an event will cause a rumor in the crowd, d is related to a specific event, about which the group is no longer active, b represents the probability that the rumor generated is equal to the probability that the rumor is no longer interesting. β is the average number of adequate contacts of an infectious individuals per unit time, η is the rate that the spreader will become awake after contact with an awake person, the delay ω is the time it takes for an ignorant person to think about its authenticity before spreading it, the delay τ is the time required for the communicator to undergo continuous analysis and demonstration in the process of becoming conscious, and ϵ is the rate that a sober person becomes suspicious after hearing too many rumors (ε>0, the sober becomes the ignorant; ε=0, always awake).

    However, based on the dynamics of rumor propagation, we need to consider more realistic factors. In the beginning, the rumor spreads quickly, but after a while, almost everyone has heard the rumor, and it is difficult to find an ignorant person who has not heard the rumor; at this time, the spread rate will slow down to zero. Therefore, it is very important to consider the logical growth of the disseminator group in the rumor propagation model. We calculated the threshold of a rumor's influence, that is, the situation in which a rumor prevails until it finally disappears.

    Additionally, the total population has a boundary, the rate of increase in the number of sober people reduces the rate of increase in the number of communicators, and with the passage of time, people lose interest in rumors. So, after a while, the rumor stops spreading and incrementally increases to a constant K. Therefore, for model (1) we consider the logical growth Y(1YK) and obtain

    {dXdt=bN(t)bX(t)βX(t)Y(t)1+αX(t)+ϵebτZ(tτ),dDdt=βX(t)Y(t)1+αX(t)βebωX(tω)Y(tω)1+αX(tω)bD(t),dYdt=Y(t)(1Y(t)K)+βebωX(tω)Y(tω)1+αX(tω)(b+η)Y(t),dZdt=ηY(t)bZ(t)εebτZ(tτ),N(t)=X(t)+D(t)+Y(t)+Z(t). (2)

    Because the variable D does not appear in the first, third, and fourth equations of system (2), so we consider the subsystem of system (2)

    {dXdt=bbX(t)βX(t)Y(t)1+αX(t)+εebτZ(tτ),dYdt=Y(t)(1Y(t)K)+βebωX(tω)Y(tω)1+αX(tω)(b+η)Y(t),dZdt=ηY(t)bZ(t)εebτZ(tτ). (3)

    Let ι=max{τ,ω} and M be the Banach space of continuous functions ψ: [ι,0]R3 with norm

    ||ψ||=suprθ0{|ψ1(θ)|,|ψ2(θ)|,|ψ3(θ)|},

    where ψ=(ψ1,ψ2,ψ3). Further, let

    M+=ψ={(ψ1,ψ2,ψ3)M:ψi(θ)0for all θ[ι,0], i=1,2,3}.

    The initial conditions for system (6) are given by

    X(θ)=ψ1(θ),Y(θ)=ψ2(θ),Z(θ)=ψ3(θ),ιθ0,

    where ψ=(ψ1,ψ2,ψ3)M+.

    Now, we present a useful definition and a useful lemma.

    Definition 2.1. The rumor in system (3) is said to be permanent if there exist constants l>0 and L>0 such that the any solution (X(t),Y(t),Z(t)) of system (3) with initial conditions satisfies

    llimt+infY(t)limt+supY(t)L.

    Lemma 2.1. The solutions of system (3) with initial conditions are positive for all t0.

    In this section, we will obtain the boundedness and positive equilibrium point of system (3).

    From

    X(t)+D(t)+Y(t)+Z(t)1,

    we can see that

    Γ={(X,Y,Z):X0, Y0, Z0, X+Y+Z1}

    is positively invariant with respect to system (3).

    Theorem 3.1. The positive solutions of system (3) with initial conditions are ultimately bounded.

    Proof. Let (X(t),Y(t),Z(t)) be any positive solution of system (3), then from system (3) we can obtain

    dN(t)dt=ρ(Y)+bbN(t),

    where

    ρ(Y)=Y(1YK).

    One can derive that the function ρ(Y) reaches its maximum value K4 when Y is equal to K2. Then, from above equation, we have

    dN(t)dtK4+bbN(t),

    which yields

    N(t)K4+bb+(N(0)K4+bb)ebτ.

    It follows from the above inequality when t,

    lim suptN(t)limt[K4+bb+(N(0)K4+bb)ebτ]=K4+bb.

    Hence, there exists a constant T>0 such that

    N(t)=X(t)+D(t)+Y(t)+Z(t)K4+bb

    for t>T.

    Therefore, we obtain

    X(t)b+K4b,D(t)b+K4b,Y(t)b+K4b,Z(t)b+K4b

    for t>T.

    One can see that there are two equilibria points of system (3):

    (1) Rumor-free equilibrium point E0=(ˉx,0,0) where ˉx=1. This means that the rumors will eventually disappear.

    (2) Rumor prevailing equilibrium point or rumor existing equilibrium point E+=(ˆX,ˆY,ˆZ) with ˆY0. This means that the rumors will continue to spread.

    Next, by the interior equilibrium point and system (3), we obtain

    bbX(t)βX(t)Y(t)1+αX(t)+εebτZ(tτ)=0,Y(t)(1Y(t)K)+βebωX(tω)Y(tω)1+αX(tω)(b+η)Y(t)=0,ηY(t)bZ(t)εebτZ(tτ)=0. (4)

    Then, solving the first and third equations of system (4), we have

    ˆX=b+η1+ˆYKβebωα(b+η1+ˆYK),ˆZ=ηb+εebτˆY. (5)

    From the values of ˆX and ˆZ and the second equation of system (5), one has the following cubic equation of Y

    L1(ˆY)3L2(ˆY)2+L3ˆYL4=0, (6)

    where

    L1=αK2,L2=bebωα+1K+ηεebτ2bω[α(b+η1)β]b+εebτ+(b+η1)(βebωα(b+η1)),L3=2α(b+η1)βebωKαηebτbωK(b+εebτ),L4=bebω[(α+1)(b+η1)βebω].

    It is clear that this fixed point exists only if Eq (6) has a positive root. Thus, L1 and L2 are positive. Now we can suppose that L4<0 or R0>1. If this condition is true, then there are two cases:

    (ⅰ) L3<0, meaning that Eq (6) has only one positive root.

    (ⅱ) L3>0, meaning Eq (6) has three roots or exactly one positive root.

    If the condition is not true, then there are two possibilities:

    (ⅰ') L3<0, meaning Eq (6) has two positive real roots or no real roots (according to Descartes' rule of sign).

    (ⅱ') L3>0, meaning Eq (6) has two positive real roots or no real roots (according to Descartes' rule of sign).

    In order to find the one positive real root of Eq (6), first we need to find the value of ˆY, and then we can find the values of ˆX and ˆZ. Thus, we want to get a positive real root of Eq (6).

    From the above discussion, one can see that system (3) has at least one positive rumor local equilibrium point.

    Now, by the next generation matrix method [21], we can obtain the basic regeneration number (which is analogous to the basic reproduction number in a disease transmission model)

    R0=1+βebω1+αη+b=1+α+βebω(1+α)(b+η)

    and then one can easily get that, when R01, system (3) only has E0, and, when R0>1, system (3) has E+ except for E0 and E+ is unique.

    On the stability of the rumor-free equilibrium point E0 of system (3), we have the following result:

    Theorem 4.1. In Γ, the equilibrium point E0 of system (3) is globally stable if R01, and the equilibrium point E0 of system (3) is unstable if R0>1.

    Proof. Denote

    ht=(X(t+θ),Y(t+θ),Z(t+θ)),θ[r,0],

    where

    h(t)=(X(t),Y(t),Z(t))

    is any positive solution of system (3) with initial function (ψ1,ψ2,ψ3).

    Construct a Lyapunov functional as follows:

    V(ht)=Y(t)+βebωttωX(u)Y(u)1+αX(u)du.

    Then by calculation we obtain

    V(ht)=[1YK+βebωX(t)1+αX(t)(b+η)]Y(t).

    Let

    G={ψM+:V(ψ)=0}

    and take the largest set ΨG which is invariant with respect to system (3). Obviously, Ψ is not empty, because (1,0,0)Ψ. If R0<1, from X(t)1 we get

    V(ht)[βebωX(t)1+αX(t)+1(b+η)]Y(t)(R01)(η+b)Y(t)0.

    Hence,

    G={ψ=(ψ1,0,ψ3)M+}.

    It follows from system (3) that

    Ψ={(1,0,0)}.

    If R0=1, we have

    V(ht)(η+b1)X(t)11+αX(t)Y(t)0.

    Hence,

    G={ψ=(ψ1,ψ2,ψ3)M+:ψ1=1orψ2=1}.

    By

    X(t)+D(t)+Y(t)+Z(t)1

    and when X(t)=1, one can get

    Y(t)=0andΨ={(1,0,0)}.

    By means of the Lyapunov-LaSalle invariance principle, we have that, when R01, the equilibrium point E0 is globally stable in Γ. Next, when R0>1, we let

    X1(t)=X(t)1,  Y1(t)=Y(t),  Z1(t)=Z(t),

    and then we have the following linearization equations of system (3) at E0

    {dX1(t)dt=bX1(t)βY1(t)1+α+εebτZ1(tτ),dY1(t)dt=Y1(t)(1Y1(t)K)+βebωX1(tω)1+α(b+η)Y1(t),dZ1(t)dt=ηY1(t)bZ1(t)εebτZ1(tτ). (7)

    Further, we have the characteristic equation of system (7)

    |λ+bβ1+αεebτeλτ0λ[1+βebω1+αeλω(η+b)]00ηλ+(εebτeλτ+b)|=0.

    Consequently,

    (λ+b)(λ[1+βebω1+αeλω(η+b)])(λ+(εebτ+b))=0. (8)

    Set

    f(λ)=λ[1+βebω1+αeλω(η+b)].

    Obviously,

    f(0)=b+η1βebω1+αebω<0,

    and, by R0>1, when λ+ we have f(λ)+. In this case, there must be a λ0>0 such that f(λ0)=0. Therefore, there exists at least one root of (8) with positive real part. Thus, E0 is unstable.

    On the permanence of the rumor of system (3), we have the following result.

    Theorem 5.1. In system (3), if R0>1, then the rumor is permanent.

    Proof. From

    R0=1+βebω1+αb+η=1+α+βebω(1+α)(b+η)>1,

    there are small enough α0>0 and large enough T0>0 such that

    1η+b+βebωbb+βα0 (1e(b+βα0)T0)1+αbb+βα0(1e(b+βα0)T0)1η+b>1. (9)

    Consider the derivative of the function

    ˙V(t)=(1YK+βebωX(t)1+αX(t)(η+b))Y(t),

    where

    V(t)=Y(t)+βebωttωX(u)Y(u)1+αX(u)du.

    Now, we claim that for all tt0T0, Y(t)α0 is impossible. Suppose the contrary is true. Then for tt1, we have

    dX(t)dt=bbX(t)βX(t)Y(t)1+αX(t)+εZ(tτ)ebτb(b+βα0)X(t).

    Therefore, when tt1+T0,

    X(t)=[X(t1)+btt1e(b+βα0)(θt1)dθ]e(b+βα0)(tt1)bb+βα0(1e(b+βα0)(tt1))=N, (10)

    where

    N=bb+βα0(1e(b+α0)T0).

    Let t1=T0, and then from the above inequality, for t2T0, we get

    ˙V(t)=(1YK+βebωX(t)1+αX(t)(η+b))Y(t)(1YK+βebωN1+αN(η+b))Y(t).

    Take

    y_=minθ[ω,0]Y(2T0+ω+θ)>0.

    Now, we prove that Y(t)y_ for all t2T0. If the condition is not true, then there is a T0 satisfies T0, Y(t)y_ for all

    2T0t2T0+ω+T,
    Y(2T0+ω+T)=y_

    and

    ˙Y(2T0+ω+T)0.

    In addition, from the second equation of system (3), we get

    ˙Y(2T0+ω+T)=Y(2T0+T)[1Y(2T0+T)K]+βebωX(2T0+T)Y(2T0+T)1+αX(2T0+T)(η+b)Y(2T0+ω+T)[βebωN1+αN(η+b)]y_>0.

    This is a contradiction. Therefore, Y(t)y_ for all t2T0. Consequently, for all t2T0, we obtain

    ˙V(t)[1YK+βebωN1+αN(η+b)]Y(t)[βebωN1+αN(η+b)]y_>0.

    This means that V(t)+ as t+ contradicts the boundedness of V(t). Thus, the claim is valid. Then, we will discuss the following two possibilities for all large t:

    (ⅰ) Y(t)α0;

    (ⅱ) Y(t) oscillates about α0.

    At last, for a sufficiently large t, we will get the result

    Y(t)α0e(η+b)(T0+ω).

    Therefore, we only need to consider case (ⅱ).

    Set t1 and t2 large enough satisfying

    Y(t1)=Y(t2)=α0

    and Y(t)<α0 for all t(t1,t2).

    If

    t2t1T0+ω,

    since

    ˙Y(t)(b+η)Y(t)andY(t1)=α0,

    we get

    Y(t)α0e(b+η)(T0+ω)

    for all t[t1,t2]. If t2t1>T0+ω, then, it is easy to see that

    Y(t)α0e(b+η)(T0+ω)

    for all t[t1,t1+T0+ω]. Therefore, based on the analysis and proof of the above claims, we observe that

    Y(t)α0e(b+η)(T0+ω)

    on [t1+T0+ω,t2]. If it does not hold, then there exists a ˜T0 such that

    Y(t)α0e(b+η)(T0+ω)

    for all t[t1,t1+T0+ω+˜T], and

    Y(t1+T0+ω+˜T)=α0e(b+η)(T0+ω)

    and

    ˙Y(t1+T0+ω+˜T)0.

    Next, from (10) and by the second equation of system (3), we get for

    t=t1+T0+ω+˜T,dY(t)dt=Y(t)(1Y(t)K)+βebωX(tω)I(tω)1+αS(tω)(b+η)Y(t)[1Y(t)K+βebωNΔ1+αNΔ(b+η)]α0e(b+η)(T0+ω)>0,

    which is a contradiction. Thus,

    Y(t)α0e(b+η)(T0+ω)

    holds for any t[t1,t2]. Therefore, we obtain

    limtinfY(t)α0e(b+η)(T0+ω)>0.

    Remark 5.1. From Theorems 4.1 and 5.1, one can see that the condition R0>1 is a sufficient and necessary condition for the permanence of the rumor in system (3). Moreover, the condition R01 is a sufficient and necessary condition for global stability of the rumor-free equilibrium point of system (3).

    In this part, we will derive some conditions on the locally asymptotic stability and global stability of the rumor prevailing equilibrium point of system (3). First, let

    A(t)=X(t)ˆX,B(t)=Y(t)ˆY,C(t)=Z(t)ˆZ.

    Then, system (3) takes the form

    {dA(t)dt=bA(t)βX(t)B(t)1+αX(t)βA(t)ˆY1+αX(t)+εebτC(tτ),dB(t)dt=[1(b+η)2ˆYK]B(t)B2(t)K+βebωA(tω)Y(tω)+(1+αX(tω))ˆXB(tω)(1+αX(tω))(1+αˆX),dC(t)dt=ηB(t)bC(t)εebτC(tτ). (11)

    The linear part of system (11) is

    {dA(t)dt=k11A(t)k12B(t)+k13C(t),dB(t)dt=k21A(tω)+k22B2(t)+k23B(tω)k24B(t),dC(t)dt=k31B(t)k32C(t)k33C(tτ), (12)

    where

    k11=b+βˆY(1+αˆX)2,k12=βˆX1+αˆX,k13=εebτ,k21=βebωˆY(1+αˆX)2,k22=1K,k23=βebωˆX1+αˆX,k24=12ˆYK(η+b),k31=η,k32=b,k33=εebτ.

    It is clear that in order to prove the locally uniform asymptotic stability of the rumor prevailing equilibrium point E+ of system (3), we only need to prove the locally uniform asymptotic stability of the zero solution of system (12).

    Theorem 6.1. If R0>1 holds and conditions Gi (i=1,2,3) hold, then the equilibrium point E+ of system (3) is locally uniformly asymptotically stable, where

    (G1) 2k11+k12k13k21(1+k23ω)>0;

    (G2) k31(1+k33τ)+(k243k232k21k22)+k12>0;

    (G3) 2k32+k33k31k33τ(k31+2k32+2k33)>0.

    Proof. First, we define

    F11(t)=A2(t).

    Then, by a2+b22|ab| and system (12), we get

    ddtF11(t)=2A(t)[k11A(t)k12B(t)+k13C(tτ)](k12+k132k11)A2(t)+k12B2(t)+k13C2(tτ).

    Let

    F12(t)=k13ttτC2(u)du.

    Then, from the derivatives of F11(t) and F12(t), we have

    ddtF1(t)(2k11k12+k13)A2(t)+k12B2(t)+k13C2(t),

    where

    F1(t)=F11(t)+F12(t).

    Rewriting the second equation of (12), we get

    dB(t)dt=k21A(tω)+k22B2(t)+k23B(tω)k24B(t)=k21A(tω)+k22B2(t)+(k23k24)B(t)k23ttω[k21A(uω)+k22B2(u)+k23B(uω)k24B(u)]du.

    Define

    F21(t)=B2(t)

    and from system (12), we get

    ddtF21(t)=2B(t)[k21A(tω)+k22B2(t)+(k23k24)B(t)]2B(t)[k23ttω[k21A(uω)+k22B2(u)+k23B(uω)k24B(u)]du]=2k22B3(t)+2(k23k24)B2(t)+2k21B(t)A(tω)k23ttω[2k21B(t)A(uω)+2k22B(t)B2(u)+2k23B(t)B(uω)2k23B(t)B(u)]du.

    Using the inequality a2+b22|ab|, we further get

    ddtF21(t)2k22B3(t)+2(k23k24)B2(t)+k21B2(t)+k21AB2(tω)+k23ttω[k21A2(uω)+k22B4(u)+k23B2(uω)+k24B2(u)]du+(k21+k22+k23+k24)k23ωI(t).

    Define

    F22(t)=k22ttωtv[k21A2(uω)+k24B4(t)+k23B2(uω)+k24B2(u)]dudv.

    Then, from the derivatives of F21(t) and F22(t), we have

    ddt(F21(t)+F22(t))2k22B3(t)+(2k232k24+k21)B2(t)+k21A2(tω)+(k21+k22+k23+k24)k23ωT(t)+k23ω[k21A2(tω)+k22B4(t)+k23B2(tω)+k24B2(t)].

    Next, let

    F2(t)=F21(t)+F22(t)+F23(t),

    where

    F23(t)=k225B5(t)k222B4(t)+k21(1+k23ω)ttωA2(u)du+k223ωttωB2(u)du.

    Then, we have

    ddtF2(t)(2k232k24+k21)B2(t)+(k21+k22+k23+k24)k23ωB(t)+k21(1+k23ω)A2(t)(3k23k24+2k21+k22)B2(t)+k21(1+k23ω)A2(t).

    Similarly, rewriting the third equation of (12) we get

    dC(t)dt=k31B(t)(k32+k33)C(t)+k33ttτC(u)du=k31B(t)(k32+k33)C(t)+k33ttτ(k31B(u)k32C(u)k33C(uτ))du.

    Let

    F31(t)=C2(t).

    Then, using the inequality a2+b22|ab|, we further derive

    ddtF31(t)[2k32+2k33k31]C2(t)+k31B2(t)+k33τ(k31+k32+k33)C2(t)+k33ttτ(k31B2(u)+k32C2(u)+k33C2(uτ))du.

    Define F32(t) as

    F32(t)=k33ttτ(tv(k31B2(u)+k32C2(u)+k33C2(uτ))du)dv.

    Then, from the derivatives of F31(t) and F32(t), we have

    ddt(F31(t)+F32(t))[2(k32+k33)k31k33τ(k31+2k32+k33)]C2(t)+k31(1+k33τ)B2(t)+k233τC2(tτ).

    Define

    F3(t)=F31(t)+F32(t)+F33(t),

    where

    F33(t)=k233τttτC2(u)du.

    Then, we get

    ddtF3(t)[2(k32+k33)k31k33τ(k31+2k32+2k33)]C2(t)+k31(1+k33τ)B2(t).

    Finally, let

    F(t)=F1(t)+F2(t)+F3(t).

    Then, we get

    ddtF(t)(D1x2(t)+D2y2(t)+D3z2(t)),

    where

    H1=2k11+k12k13k21(1+k23ω),H2=k12k31(1+k33τ)(k243k232k21k22),H3=2(k32+k33)k31k33τ(k31+2k32+2k33)k13.

    Obviously, from the assumptions of Theorem 6.1, we can see that

    Hi>0,  (i=1,2,3),

    and then dFdt is negative definite in Γ.

    Now, we will consider the global stability of the rumor prevailing equilibrium point E+. We need the positive invariant set of system (11)

    ˉΓ={(A,B,C):AˆX,BˆY,CˆZ,A+B+C1(ˆX+ˆY+ˆZ)}

    and the following lemma:

    Lemma 6.1. Suppose that (X(t), Y(t), Z(t)) is any positive solution of system (3). Then,

    limt+X(t)bb+βΔ=a.

    Proof. For any positive constant θ, there exists a sufficiently large t1>0, such that Y(t)1+θ as tt1. Then, from system (3), we get

    ˙X(t)b(b+β(1+θ)1+αX(t))b[b+β(1+θ)]X(t)

    for tt1. Since θ is arbitrary and it follows from the above inequality when t,

    limt+X(t)bb+β.

    Hence, there exists a constant T0>0 such that

    X(t)bb+β

    for t>T0.

    Based on the above lemma, we can assume

    aX(t)1,0Y(t)1,0Z(t)1.

    First, define functions Ji(i=1,2,3) as follows:

    J1(A(t),B(t),C(t))=12A2(t),J2(A(t),B(t),C(t))=12B2(t),J3(A(t),B(t),C(t))=12C2(t).

    Next, by calculation of the derivatives of Ji (i=1,2,3) along system (11), we get

    ˙J1(A(t),B(t),C(t))=(b+βˆY(1+αX(t))(1+αˆX))A2(t)βX(t)1+αX(t)A(t)B(t)+εebτB(t)C(tτ)(b+βˆY(1+α)(1+αˆX))A2(t)+β2(1+α)(A2(t)+B2(t))+εebτ2(A2(t)+C2(tτ)),
    ˙J2(A(t),B(t),C(t))=B2(t)2B2(t)KB3(t)K(b+η)B2(t)+βebωˆX1+αˆXB(t)B(tω)+βebωY(tω)(1+αX(tω))(1+αˆX)B(t)A(tω)(b+η1+2K)B2(t)+βebωˆX2(1+αˆX)(B2(t)+B2(tω))+βebω2(1+αa)(1+αˆX)(B2(t)+A2(tω))

    and

    ˙J3(A(t),B(t),C(t))=ηC(t)B(t)bC2(t)εebτC(t)C(tτ)bC2(t)+η2(B2(t)+C2(t))+εebτ2(C2(t)+C2(tτ)).

    Finally, we construct the Lyapunov functional

    J(t)=J1(t)+J2(t)+J3(t)+J4(t),

    where

    J4(A(t),B(t),C(t))=βebω2(1+αa)(1+αˆX)ttωA2(u)du+εebτttτC2(u)du+βebωˆX2(1+αˆX)ttωB2(u)du.

    Then, calculating the derivative of J(t), we get

    dJdt(p1A2(t)+p2B2(t)+p3C2(t)),

    where

    e1=b+βˆY(1+α)(1+αˆX)(β2(1+α)+εebτ2+βebω2(1+αa)(1+αˆX)),e2=b1+2K+η2(β2(1+α)+βebωˆX1+αˆX+βebω2(1+αa)(1+αˆX)),e3=b(η2+3εebτ2).

    Based on the above analysis and discussion on the globally asymptotic stability of rumor prevailing equilibrium point E+ of system (3), we have the following result:

    Theorem 6.2. If R0>1 and ei>0 (i=1,2,3) hold, then the rumor prevailing equilibrium point of system (3) is globally asymptotically stable in Γ.

    If there is an emergency or a situation becomes very urgent, in order to curb the spread of rumors, the government will usually control or intervene in the trend of rumors through the media [22,23,24]. This paper uses the most common media interventions to study the role of control mechanisms in the system. For a clearer understanding, a period of time can be selected as the effective time, during which the control is added, and the control is removed when the number of spreaders is reduced enough to restore the stability of the system. At this time, both the ignorant and the conscious are actively or passively taking control. Therefore, when the system performs media intervention controls, we calculate the cost per user. Now, assume that u is the media control variable, then we have the following assumptions:

    (1) Let u2(t)(X(t)+Y(t)+Z(t)) be the cost function of the control, where the media control are effective for all users. Although our goal is to minimize the spread of false information, the spread of false information through the media cannot be applied to any specific group, but to all groups.

    (2) The ignorant population directly enters the aware class with the rate ζ1, whereas the spreader population transfers to the aware class with the rate ζ2. It is evident that ζ1 is greater than ζ2.

    {dXdt=bN(t)bX(t)βX(t)Y(t)1+αX(t)+ϵZ(t)ζ1uX(t),dYdt=Y(t)(1Y(t)K)+βX(t)Y(t)1+αX(t)(b+η)Y(t)ζ2uY(t),dZdt=ηY(t)bZ(t)εZ(t)+(ζ1X(t)+ζ2Y(t))u (13)

    with the initial condition X(0)0, Y(0)0, Z(0)0. Here our objective is to minimize the total number of spreaders and the corresponding cost. So,

    W(X,Y,Z,u)=minuˆΘT0[F0Y(t)+F1u2(t)(X(t)+Y(t)+Z(t))]dt, (14)

    where

    ˆΘ={u:uL2[0,T],0u1}.

    By [25], to find the optimal solution, we find the Hamiltonian of our optimal control problem (13) as given by

    G=[F0Y+F1u2(X(t)+Y(t)+Z(t))]+f1(bbX(t)βX(t)Y(t)1+αX(t)+ϵZ(t)ζ1uX(t))+f2[Y(t)(1Y(t)K)+βX(t)Y(t)1+αX(t)(b+η)Y(t)ζ2uY(t)]+f3[ηY(t)bZ(t)εZ(t)+(ζ1X(t)+ζ2Y(t))u], (15)

    where the fi (i=1,2,3) are adjoint variables.

    Theorem 7.1. For system (13) and objective function (14), there exists an optimal control uˆΘ for which

    W(X,Y,Z,u)=minuˆΘT0[F0Y+F1(u)2(X+Y+Z)]dt.

    Proof. As all the state variables and co-state variables are non-negative, so too is the control variable u. The control space ˆΘ is convex and closed. According to Theorems 3.1 and 5.1 and their proofs in [26], one can see that there is a minimum value, so the control coefficient u has a minimum value, and thus there is an optimal control, and the proof is complete.

    Here we find the set of necessary conditions for our optimal control problem with the help of Pontryagin's maximum principle.

    Theorem 7.2. If u is the optimal control variable which optimizes (14) for system (13), with optimal state variables X,Y, and Z, and optimal co-state variable fi(i=1,2,3) where fi satisfies the system

    {df1dt=F1u2+f1(b+ζ1u+βY(1+αX)2)f2βY(1+αX)2f3ζ1u,df2dt=F0F1u2+(f1f2)βX1+αX+2f2YK+(b+η1)f2f3η+(f2f3)ζ2u,df3dt=F1u2f1ε+f3(b+ε) (16)

    with transversality condition

    fi(T)=0,i=1,2,3, (17)

    then we obtain

    u=min{max{(f1f3)ζ1X+(f2f3)ζ2Y2B1(X+Y+Z),0},1}. (18)

    Proof. Using Pontryagin's maximum principle on the Hamiltonian (15), we obtain the mathematical expression of the adjoint system (16), which is

    {df1dt=GX=F1u2+f1(b+ζ1u+βY(1+αX)2)f2βY(1+αX)2f3ζ1u,df2dt=GY=F0F1u2+(f1f2)βX1+αX+2f2YK+(b+η1)f2f3η+(f2f3)ζ2u,df3dt=GZ=F1u2f1ε+f3(b+ε). (19)

    From the optimality condition

    GuX=X,Y=Y,Z=Z=0,

    we obtain

    u=(f1f3)ζ1X+(f2f3)ζ2Y2B1(X+Y+Z).

    By definition, the highest and the lowest value of control are 1 and 0, respectively. That is, if u0 then u=0, and if u1, then u=1. So, for u we get the optimum value of W(X,Y,Z) for system (16).

    In this section, three examples are given to illustrate the effectiveness of our results obtained in this paper.

    Example 8.1. First, we take a set of parameters and consider the following system

    {dXdt=0.80.8X(t)0.5X(t)Y(t)1+0.2X(t)+0.3e0.16Z(t0.2),dYdt=Y(t)(1Y(t)K)+0.5e0.4X(t0.5)Y(t0.5)1+0.2X(t0.5)1.6Y(t),dZdt=0.8Y(t)0.8Z(t)0.3e0.2Z(t0.2). (20)

    Directly from calculation, we get R0=0.7996<1. On the basis of Theorem 3.1, we have that the rumor-free equilibrium point E0=(1,0,0) is globally stable, which means the rumor disappears. The corresponding simulations are shown in Figure 1.

    Figure 1.  The time histories and the phase trajectories of system (20).

    Next, we take another set of parameters and consider the following system

    {dXdt=0.60.6X(t)0.01X(t)Y(t)1+0.5X(t)+0.6e1.05Z(t0.6),dYdt=Y(t)(1Y(t)K)+0.01e0.42X(t0.7)Y(t0.7)1+0.5X(t0.7)1.5Y(t),dZdt=0.9Y(t)0.6Z(t)0.6e1.05Z(t0.7). (21)

    Directly from calculation, we get R0=0.6696<1. From Theorem 3.1, we also have that the rumor-free equilibrium point E0=(1,0,0) is globally stable, which means the rumor disappears. The corresponding simulations are shown in Figure 2.

    Figure 2.  The time histories and the phase trajectories of system (21).

    Example 8.2. Next, we consider the system

    {dXdt=1X(t)15X(t)Y(t)1+0.3X(t)+0.2e1Z(t1),dYdt=Y(t)(1Y(t)K)+15e0.9X(t0.9)Y(t0.9)1+0.5X(t0.9)1.4Y(t),dZdt=0.4Y(t)0.6Z(t)0.6e1Z(t1). (22)

    Directly from calculation, we get R0=4.0651>1.

    From Theorem 5.1, we have that the rumor is permanent, which means the rumor exists for a long time. The corresponding simulations are shown in Figure 3.

    Figure 3.  The time histories and the phase trajectories of system (22).

    Example 8.3. Finally, we consider the system

    {dXdt=0.8X(t)12.8X(t)Y(t)1+0.3X(t)+6.4eτZ(tτ),dYdt=Y(t)(1Y(t)K)+12.8eωX(tω)Y(tω)1+0.3X(tω)1.9Y(t),dZdt=0.9Y(t)Z(t)6.4eτZ(tτ), (23)

    where τ=0.38, ω=0.07. Directly from calculation, we get

    R0=5.3582>1

    and

    E+(0.1382,0.6844,0.1144).

    The corresponding simulations are shown in Figure 4 (a1,b1,c1,d1,e1,f1,g1).

    Figure 4.  The time histories and the phase trajectories of system (23).

    In system (23), if we take

    τ=0.38,  ω=0.24,

    then, we have

    R0=4.6028.

    The corresponding simulations are shown in Figure 5 (a2,b2,c2,d2,e2,f2,g2).

    Figure 5.  The time histories and the phase trajectories of system (23).

    In system (23), if we take

    τ=0.38,  ω=0.72,

    then we have

    R0=3.0488

    and

    E+(0.2095,0.3284,0.0551).

    The corresponding simulations are shown in Figure 6 (a3,b3,c3,d3,e3,f3,g3).

    Figure 6.  The time histories and the phase trajectories of system (23).

    In system (23), if we take

    τ=1.48,  ω=0.72,

    then we have

    R0=3.0488

    and

    E+(0.2052,0.3058,0.1117).

    The corresponding simulations are shown in Figure 7 (a4,b4,c4,d4,e4,f4,g4).

    Figure 7.  The time histories and the phase trajectories of system (23).

    Remark 8.1. From the above numerical simulation figures in Example 8.3 and the values of the time delays τ, ω, we can see that if τ=0.38, ω=0.07, then the rumor prevailing equilibrium point E+ of system (23) is globally asymptotically stable; if τ=0.38, ω=0.24, then the rumor prevailing equilibrium point E+ of system (23) is unstable; if τ=0.38, ω=0.72, then the rumor prevailing equilibrium point E+ of system (22) is globally asymptotically stable; if τ=1.48, ω=0.72, then the rumor prevailing equilibrium point E+ of system (22) is globally asymptotically stable. From the above analysis, we can conclude that the time delay ω has an effect on the global asymptotic stability of the rumor prevailing equilibrium point E+.

    Social networks have become an important medium for rumor propagation, and it may cause some serious negative effects on our society. Hence, studying the ways in which rumors spread and controlling them is of great significance. This paper considers the delayed XDYZ rumor propagation model based on social networks with logistic growth and saturation incidence, and the dynamical behavior of the model is studied by using of the next generation matrix method, some inequality techniques, the Lyapunov-LaSalle invariance principle, and the Lyapunov functional. First, the positiveness and boundedness of the system are obtained. Second, the rumor-free equilibrium point, the rumor prevailing equilibrium point, and the basic regeneration number R0 of the model are obtained. Meanwhile, the global stability of the rumor-free equilibrium point E0, the permanence of the rumor, and the global asymptotic stability of the rumor prevailing equilibrium point E+ are obtained. Then, the minimum cost of controlling rumors is given. Finally, the validity of the theoretical results and the influence of different parameters and time delays on the model are shown by numerical simulations. Additionally, we can see from the results and numerical simulation examples that the time delay ω has an effect on the aforementioned dynamic behaviors of the considered system. Because of this, system (2) can be seen as a general model compared to the models in [1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,18], and the theoretical results obtained in this article and model (2) can be seen as extensions of and supplements to the previously known theoretical results and models.

    From the dynamic analysis of the rumor propagation model, one can find that rumor propagation is a very complicated process. Mathematical analysis can provide a theoretical basis for reducing and controlling the harmful effects of rumor propagation and to reduce the disturbance or panic caused by widely circulated rumors (viral scenes) in society. In conclusion, studying the ways in which rumors spread and controlling them is essential to preventing their negative impacts. By using social network analysis, debunking false claims, and addressing the underlying emotions that drive rumor-mongering, governments and organizations can effectively manage rumors and protect their communities. This model can also use different time delays required by users of different age structures or take into account the role of a trust mechanism to study a more realistic rumor propagation model.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This research is supported by the Open Project of Key Laboratory of Applied Mathematics of Xinjiang Uygur Autonomous Region (grant No. 2023D04045) and the National Natural Science Foundation of Xinjiang (grant No. 2021D01C067).

    The authors declare that they have no competing interests.



    [1] R. D. Al-Dabbagh, F. Neri, N. Idris, M. S. Baba, Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy, Swarm Evol. Comput., 43 (2018), 284–311. https://doi.org/10.1016/j.swevo.2018.03.008 doi: 10.1016/j.swevo.2018.03.008
    [2] N. Awad, M. Ali, J. Liang, B. Qu, P. Suganthan, Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective bound constrained real-parameter numerical optimization, in Technical report, Nanyang Technological University, Singapore, 2016, 1–34.
    [3] F. Caraffini, F. Neri, A study on rotation invariance in differential evolution, Swarm Evol. Comput., 50 (2019), 100436. https://doi.org/10.1016/j.swevo.2018.08.013 doi: 10.1016/j.swevo.2018.08.013
    [4] T. J. Choi, A rotationally invariant stochastic opposition-based learning using a beta distribution in differential evolution, Expert Syst. Appl., 231 (2023), 120658. https://doi.org/10.1016/j.eswa.2023.120658 doi: 10.1016/j.eswa.2023.120658
    [5] T. J. Choi, C. W. Ahn, Artificial life based on boids model and evolutionary chaotic neural networks for creating artworks, Swarm Evol. Comput., 47 (2019), 80–88. https://doi.org/10.1016/j.swevo.2017.09.003 doi: 10.1016/j.swevo.2017.09.003
    [6] T. J. Choi, C. W. Ahn, An improved lshade-rsp algorithm with the cauchy perturbation: ilshade-rsp, Knowl.-Based Syst., 215 (2021), 106628. https://doi.org/10.1016/j.knosys.2020.106628 doi: 10.1016/j.knosys.2020.106628
    [7] T. J. Choi, J. H. Lee, H. Y. Youn, C. W. Ahn, Adaptive differential evolution with elite opposition-based learning and its application to training artificial neural networks, Fund. Inform., 164 (2019), 227–242. https://doi.org/10.3233/FI-2019-1764 doi: 10.3233/FI-2019-1764
    [8] T. J. Choi, J. Togelius, Y. G. Cheong, Advanced cauchy mutation for differential evolution in numerical optimization, IEEE Access, 8 (2020), 8720–8734. https://doi.org/10.1109/ACCESS.2020.2964222 doi: 10.1109/ACCESS.2020.2964222
    [9] T. J. Choi, J. Togelius, Y. G. Cheong, A fast and efficient stochastic opposition-based learning for differential evolution in numerical optimization, Swarm Evol. Comput., 60 (2021), 100768. https://doi.org/10.1016/j.swevo.2020.100768 doi: 10.1016/j.swevo.2020.100768
    [10] M. Dai, X. Feng, H. Yu, W. Guo, An opposition-based differential evolution clustering algorithm for emotional preference and migratory behavior optimization, Knowl.-Based Syst., 259 (2023), 110073. https://doi.org/10.1016/j.knosys.2022.110073 doi: 10.1016/j.knosys.2022.110073
    [11] S. Das, S. S. Mullick, P. N. Suganthan, Recent advances in differential evolution–-An updated survey, Swarm Evol. Comput., 27 (2016), 1–30. https://doi.org/10.1016/j.swevo.2016.01.004 doi: 10.1016/j.swevo.2016.01.004
    [12] S. Das, P. N. Suganthan, Differential evolution: A survey of the state-of-the-art, IEEE T. Evolut. Comput., 15 (2010), 4–31. https://doi.org/10.1109/TEVC.2010.2059031 doi: 10.1109/TEVC.2010.2059031
    [13] M. Friedman, The use of ranks to avoid the assumption of normality implicit in the analysis of variance, J. Am. Stat. Assoc., 32 (1937), 675–701. https://doi.org/10.1080/01621459.1937.10503522 doi: 10.1080/01621459.1937.10503522
    [14] M. Friedman, A comparison of alternative tests of significance for the problem of m rankings, Ann. Math. Stat., 11 (1940), 86–92. https://doi.org/10.1214/aoms/1177731944 doi: 10.1214/aoms/1177731944
    [15] W. Gao, Q. Dang, M. Gong, An adaptive framework to select the coordinate systems for evolutionary algorithms, Appl. Soft Comput., 129 (2022), 109585. https://doi.org/10.1016/j.asoc.2022.109585 doi: 10.1016/j.asoc.2022.109585
    [16] S. M. Guo, C. C. Yang, Enhancing differential evolution utilizing eigenvector-based crossover operator, IEEE T. Evol. Comput., 19 (2014), 31–49. https://doi.org/10.1109/TEVC.2013.2297160 doi: 10.1109/TEVC.2013.2297160
    [17] S. Gupta, W. Shu, Y. Zhang, R. Su, Differential evolution-driven traffic light scheduling for vehicle-pedestrian mixed-flow networks, Knowl.-Based Syst., 274 (2023), 110636. https://doi.org/10.1016/j.knosys.2023.110636 doi: 10.1016/j.knosys.2023.110636
    [18] S. Gupta, R. Su, Multiple individual guided differential evolution with time varying and feedback information-based control parameters, Knowl.-Based Syst., 259 (2023), 110091. https://doi.org/10.1016/j.knosys.2022.110091 doi: 10.1016/j.knosys.2022.110091
    [19] Y. Han, H. Peng, C. Mei, L. Cao, C. Deng, H. Wang, et al., Multi-strategy multi-objective differential evolutionary algorithm with reinforcement learning, Knowl.-Based Syst., 277 (2023), 110801. https://doi.org/10.1016/j.knosys.2023.110801 doi: 10.1016/j.knosys.2023.110801
    [20] N. Hansen, The cma evolution strategy: A comparing review, Towards a new evolutionary computation: Advances in the estimation of distribution algorithms, Springer, Berlin, Heidelberg, 2006, 75–102. https://doi.org/10.1007/3-540-32494-1_4
    [21] N, Hansen, The cma evolution strategy: A tutorial, arXiv preprint, arXiv: 1604.00772, 2016.
    [22] N. Hansen, S. Kern, Evaluating the cma evolution strategy on multimodal test functions, in International conference on parallel problem solving from nature, Springer, 2004,282–291.
    [23] N. Hansen, S. D. Müller, P. Koumoutsakos, Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cma-es), Evol. Comput., 11 (2003), 1–18. https://doi.org/10.1162/106365603321828970 doi: 10.1162/106365603321828970
    [24] N. Hansen, A. Ostermeier, Completely derandomized self-adaptation in evolution strategies, Evol. Comput., 9 (2001), 159–195. https://doi.org/10.1162/106365601750190398 doi: 10.1162/106365601750190398
    [25] N. Hansen-INRIA, Variable metrics in evolutionary computation, 2009.
    [26] Y. Hochberg, A sharper bonferroni procedure for multiple tests of significance, Biometrika, 75 (1988), 800–802. https://doi.org/10.1093/biomet/75.4.800 doi: 10.1093/biomet/75.4.800
    [27] J. J. Liang, B. Qu, P. N. Suganthan, A. G. Hernández-Díaz, Problem definitions and evaluation criteria for the cec 2013 special session on real-parameter optimization, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical Report, 201212 (2013), 281–295.
    [28] Z. Z. Liu, Y. Wang, S. Yang, K. Tang, An adaptive framework to tune the coordinate systems in nature-inspired optimization algorithms, IEEE T. Cybernetics, 49 (2018), 1403–1416. https://doi.org/10.1109/TCYB.2018.2802912 doi: 10.1109/TCYB.2018.2802912
    [29] K. D. Lu, Z. G. Wu, Constrained-differential-evolution-based stealthy sparse cyber-attack and countermeasure in an ac smart grid, IEEE T. Ind. Inform., 18 (2021), 5275–5285. https://doi.org/10.1109/TII.2021.3129487 doi: 10.1109/TII.2021.3129487
    [30] K. D. Lu, Z. G. Wu, T. Huang, Differential evolution-based three stage dynamic cyber-attack of cyber-physical power systems, IEEE-ASME T. Mech., 28 (2022), 1137–1148. https://doi.org/10.1109/TMECH.2022.3214314 doi: 10.1109/TMECH.2022.3214314
    [31] H. B. Mann, D. R. Whitney, On a test of whether one of two random variables is stochastically larger than the other, Ann. Math. Stat., 1947, 50–60. https://doi.org/10.1214/aoms/1177730491 doi: 10.1214/aoms/1177730491
    [32] R. R. Mostafa, A. M. Khedr, Z. A. Aghbari, I. Afyouni, I. Kamel, N. Ahmed, An adaptive hybrid mutated differential evolution feature selection method for low and high-dimensional medical datasets, Knowl.-Based Syst., 283 (2024), 111218. https://doi.org/10.1016/j.knosys.2023.111218 doi: 10.1016/j.knosys.2023.111218
    [33] F. Neri, V. Tirronen, Recent advances in differential evolution: A survey and experimental analysis, Artif. Intell. Rev., 33 (2010), 61–106. https://doi.org/10.1007/s10462-009-9137-2 doi: 10.1007/s10462-009-9137-2
    [34] B. Mirza, M. Pant, H. Zaheer, L. Garcia-Hernandez, A. Abraham, Differential evolution: A review of more than two decades of research, Eng. Appl. Artif. Intel., 90 (2020), 103479. https://doi.org/10.1016/j.engappai.2020.103479 doi: 10.1016/j.engappai.2020.103479
    [35] K. V. Price, Differential evolution vs. the functions of the 2/sup nd/iceo, in Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), IEEE, 1997,153–157.
    [36] X. Song, Y. Zhang, W. Zhang, C. He, Y. Hu, J. Wang, et al., Evolutionary computation for feature selection in classification: A comprehensive survey of solutions, applications and challenges, Swarm Evol. Comput., 90 (2024), 101661. https://doi.org/10.1016/j.swevo.2024.101661 doi: 10.1016/j.swevo.2024.101661
    [37] V. Stanovov, S. Akhmedova, E. Semenkin, Nl-SHADE-RSP algorithm with adaptive archive and selective pressure for CEC 2021 Numerical Optimization, in 2021 IEEE Congress on Evolutionary Computation (CEC), IEEE, 2021,809–816. https://doi.org/10.1109/CEC45853.2021.9504959
    [38] V. Stanovov, S. Akhmedova, E. Semenkin, Nl-SHADE-LBC algorithm with linear parameter adaptation bias change for CEC 2022 Numerical Optimization, in 2022 IEEE Congress on Evolutionary Computation (CEC), IEEE, 2022, 01–08. https://doi.org/10.1109/CEC55065.2022.9870295
    [39] R. Storn, On the usage of differential evolution for function optimization, in Proceedings of north american fuzzy information processing, IEEE, 1996,519–523. https://doi.org/10.1109/NAFIPS.1996.534789
    [40] R. Storn, K. Price, Minimizing the real functions of the icec'96 contest by differential evolution, in Proceedings of IEEE international conference on evolutionary computation, IEEE, 1996,842–844. https://doi.org/10.1109/ICEC.1996.542711
    [41] R. M. Storn, K. Price, Differential evolution–-A simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 11 (1997), 341–359. https://doi.org/10.1023/A:1008202821328 doi: 10.1023/A:1008202821328
    [42] A. M. Sutton, M. Lunacek, L. D. Whitley, Differential evolution and non-separability: Using selective pressure to focus search, in Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007, 1428–1435.
    [43] Y. Wang, H. X. Li, T. Huang, L. Li, Differential evolution based on covariance matrix learning and bimodal distribution parameter setting, Appl. Soft Comput., 18 (2014), 232–247. https://doi.org/10.1016/j.asoc.2014.01.038 doi: 10.1016/j.asoc.2014.01.038
    [44] Y. Wang, Z. Z. Liu, J. Li, H. X. Li, G. G. Yen, Utilizing cumulative population distribution information in differential evolution, Appl. Soft Comput., 48 (2016), 329–346. https://doi.org/10.1016/j.asoc.2016.07.012 doi: 10.1016/j.asoc.2016.07.012
    [45] Y. Zhang, D. W. Gong, X. Z. Gao, T. Tian, X. Y. Sun, Binary differential evolution with self-learning for multi-objective feature selection, Inform. Sciences, 507 (2020), 67–85. https://doi.org/10.1016/j.ins.2019.08.040 doi: 10.1016/j.ins.2019.08.040
    [46] X. Zhong, P. Cheng, Z. You, An improved differential evolution algorithm based on basis vector type and its application in fringe projection 3D imaging, Knowl.-Based Syst., 268 (2023), 110470. https://doi.org/10.1016/j.knosys.2023.110470 doi: 10.1016/j.knosys.2023.110470
  • This article has been cited by:

    1. juntao Li, Parikshit N. Mahalle, Mohammad S. Obaidat, 2024, Rumor propagation model and simulation based on k-means clustering modeling and simulation of rumor propagation, 9781510681637, 194, 10.1117/12.3036948
  • Reader Comments
  • © 2025 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(274) PDF downloads(21) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog