
Metaheuristic algorithms have the drawback that local optimal solutions are prone to precocious convergence. In order to overcome the disadvantages of the whale optimization algorithm, we propose an improved selective opposition whale optimization algorithm (ISOWOA) in this paper. Firstly, the enhanced quasi-opposition learning (EQOBL) is applied to selectively update the position of the predator, calculate the fitness of the population before and after, and retain optimal individuals as the food source position; Secondly, an improved time-varying update strategy for inertia weight predator position is proposed, and the position update of the food source is completed by this strategy. The performance of the algorithm is analyzed by 23 benchmark functions of CEC 2005 and 15 benchmark functions of CEC 2015 in various dimensions. The superior results are further shown by Wilcoxon's rank sum test and Friedman's nonparametric rank test. Finally, its applicability is demonstrated through applications to the field of biological computing. In this paper, our aim is to achieve access to DNA files and designs high-quantity DNA code sets by ISOWOA. The experimental results show that the lower bounds of the multi-constraint storage coding sets implemented in this paper equals or surpasses that of previous optimal constructions. The data show that the amount of the DNA storage cods filtered by ISOWOA increased 2–18%, which demonstrates the algorithm's reliability in practical optimization tasks.
Citation: Sijie Wang, Shihua Zhou, Weiqi Yan. An enhanced whale optimization algorithm for DNA storage encoding[J]. Mathematical Biosciences and Engineering, 2022, 19(12): 14142-14172. doi: 10.3934/mbe.2022659
[1] | Yujia Xiang, Yuqi Jiao, Xin Wang, Ruizhi Yang . Dynamics of a delayed diffusive predator-prey model with Allee effect and nonlocal competition in prey and hunting cooperation in predator. Electronic Research Archive, 2023, 31(4): 2120-2138. doi: 10.3934/era.2023109 |
[2] | Xiaowen Zhang, Wufei Huang, Jiaxin Ma, Ruizhi Yang . Hopf bifurcation analysis in a delayed diffusive predator-prey system with nonlocal competition and schooling behavior. Electronic Research Archive, 2022, 30(7): 2510-2523. doi: 10.3934/era.2022128 |
[3] | Miao Peng, Rui Lin, Zhengdi Zhang, Lei Huang . The dynamics of a delayed predator-prey model with square root functional response and stage structure. Electronic Research Archive, 2024, 32(5): 3275-3298. doi: 10.3934/era.2024150 |
[4] | Fengrong Zhang, Ruining Chen . Spatiotemporal patterns of a delayed diffusive prey-predator model with prey-taxis. Electronic Research Archive, 2024, 32(7): 4723-4740. doi: 10.3934/era.2024215 |
[5] | Mengting Sui, Yanfei Du . Bifurcations, stability switches and chaos in a diffusive predator-prey model with fear response delay. Electronic Research Archive, 2023, 31(9): 5124-5150. doi: 10.3934/era.2023262 |
[6] | Maurıicio F. S. Lima, Jaume Llibre . Hopf bifurcation for a class of predator-prey system with small immigration. Electronic Research Archive, 2024, 32(7): 4604-4613. doi: 10.3934/era.2024209 |
[7] | Chen Wang, Ruizhi Yang . Hopf bifurcation analysis of a pine wilt disease model with both time delay and an alternative food source. Electronic Research Archive, 2025, 33(5): 2815-2839. doi: 10.3934/era.2025124 |
[8] | Ruizhi Yang, Dan Jin . Dynamics in a predator-prey model with memory effect in predator and fear effect in prey. Electronic Research Archive, 2022, 30(4): 1322-1339. doi: 10.3934/era.2022069 |
[9] | Kerioui Nadjah, Abdelouahab Mohammed Salah . Stability and Hopf bifurcation of the coexistence equilibrium for a differential-algebraic biological economic system with predator harvesting. Electronic Research Archive, 2021, 29(1): 1641-1660. doi: 10.3934/era.2020084 |
[10] | Yichao Shao, Hengguo Yu, Chenglei Jin, Jingzhe Fang, Min Zhao . Dynamics analysis of a predator-prey model with Allee effect and harvesting effort. Electronic Research Archive, 2024, 32(10): 5682-5716. doi: 10.3934/era.2024263 |
Metaheuristic algorithms have the drawback that local optimal solutions are prone to precocious convergence. In order to overcome the disadvantages of the whale optimization algorithm, we propose an improved selective opposition whale optimization algorithm (ISOWOA) in this paper. Firstly, the enhanced quasi-opposition learning (EQOBL) is applied to selectively update the position of the predator, calculate the fitness of the population before and after, and retain optimal individuals as the food source position; Secondly, an improved time-varying update strategy for inertia weight predator position is proposed, and the position update of the food source is completed by this strategy. The performance of the algorithm is analyzed by 23 benchmark functions of CEC 2005 and 15 benchmark functions of CEC 2015 in various dimensions. The superior results are further shown by Wilcoxon's rank sum test and Friedman's nonparametric rank test. Finally, its applicability is demonstrated through applications to the field of biological computing. In this paper, our aim is to achieve access to DNA files and designs high-quantity DNA code sets by ISOWOA. The experimental results show that the lower bounds of the multi-constraint storage coding sets implemented in this paper equals or surpasses that of previous optimal constructions. The data show that the amount of the DNA storage cods filtered by ISOWOA increased 2–18%, which demonstrates the algorithm's reliability in practical optimization tasks.
Dendrolimus is a forest pest with large occurrence and wide damage area. Among them, Dendrolimus superans is mainly distributed in Northeast China, Russia Far East, Japan, and so on. Dendrolimus superans are mainly parasitic on coniferous trees such as Larix gmelinii Kuzen and Pinus tabuliformis Carriere. Their larvae eat a large number of needles, resulting in trees being unable to carry out normal photosynthesis, eventually leading to a wide range of trees being destroyed or killed. Dendrolimus superans is extremely harmful to agriculture and forestry. In addition, the outbreak of Dendrolimus superans leads to tree death, reduces vegetation coverage, changes in plant population structure, and damages forest health and ecosystem stability. The life cycle of Dendrolimus superans consists of four stages: Egg, larva, pupa, and adult. In the life cycle of Dendrolimus superans, their development typically encompasses several key stages: Adult, egg, larva, and pupa, with each stage transitioning closely to the next. Specifically, adult insects will actively approach trees as a crucial behavior for seeking suitable environments to lay eggs. After the adults deposit their eggs on pine needles, the eggs will eventually hatch into larvae. During the larval stage, insects crawl on pine needles; this behavior is likely in search of food resources to meet the demands of their rapid growth and development. Subsequently, the larvae enter the pupal stage, during which they undergo a series of complex physiological and morphological changes. Finally, they metamorphose into adults through a process of transformation, thus completing a full life cycle. This process not only showcases the morphological and behavioral characteristics of insects at different life stages but also reflects their important strategies for adapting to the environment and reproducing. Among these stages, the larval stage is the most damaging to forests. The spread mechanism of the Dendrolimus superans is illustrated in Figure 1.
There are three major methods for the prevention and control of Dendrolimus superans: Physical control, chemical control, and biological control. Among them, physical control is mainly aimed at the behavior patterns and characteristics of Dendrolimus superans. However, this method requires a lot of manpower and material resources, which is not suitable for large-scale prevention and control [1]. Although chemical control is effective for large-scale pests, the use of pesticides and other chemical reagents may cause environmental pollution. By comparison, biological control is an environmentally friendly and sustainable pest control technology. The use of natural biological control of pests reduces the use of chemical pesticides, maintains ecological balance, avoids pest resistance, and is harmless to human health. Therefore, it is suitable for long-term pest control. Dendrolimus superans mostly has two major natural enemies: Parasitic natural enemies and predatory natural enemies. Among the parasitic natural enemies, Trichogramma and Exorista civilis play an important role; in terms of predatory natural enemies, it is represented by Common Cuckoo, Cyanopica cyanus, and so on, as illustrated in Figure 2.
When exploring the interaction between Dendrolimus superans and Cyanopica cyanus, we frequently employ the predator-prey model for analysis. This model is crucial for understanding and studying the dynamic changes in the predator-prey relationship between these two species within the realm of mathematical biology. In other studies, scholars have continuously refined and optimized these models [2,3,4,5,6,7]. The flight distance of adult female Dendrolimus superans is about 1.5 km, which shows that there are some limitations in their dispersal ability. Therefore, in the study of predator-prey model, the research environment can be regarded as relatively isolated. In such a relatively closed natural environment, scholars are concerned about the various factors that affect the system. Some biological studies have shown that habitat complexity affects population size and growth trends, indicating the important role of habitat complexity in the construction of ecological communities [8,9,10]. In addition, the construction of mixed forests provides habitat for natural enemies, increases environmental complexity, creates an ecological environment that is not conducive to the growth and development of Dendrolimus superans, and can effectively control the population of Dendrolimus superans [11,12]. Therefore, it is of great significance to study the biological control of Dendrolimus superans and their impact on forest ecosystems by using mathematical models. Based on the Lotka-Volterra model[13], Ma and Wang[14] proposed a predator-prey model with time delay and habitat complexity, that is
{dudt=ru(1−uK)−c(1−β)uαv1+ch(1−β)uα,dvdt=ec(1−β)uα(t−τ)v(t−τ)1+ch(1−β)uα(t−τ)−dv, | (1.1) |
where u and v describe the population of prey and predator, respectively. r is the intrinsic growth rate of prey. K is the capacity of environmental for prey. c is the attack rate of predator. β stands for the strength of habitat complexity. h is the handling time of predator. e is the conversion efficiency. τ is the gestation delay of predator. d is the death rate of predator. α is a positive real number. All parameters in model (1.1) are positive.
The relationship between Dendrolimus superans and its natural enemies is typically characterized using the predator-prey model. The functional response, a key component in predator-prey models, is frequently employed to describe the predation ability of predators. Grounded in experimental findings, Holling[15] developed three functional responses, which are described below:
I:mu,II:au1+mu,III:au21+mu2. |
In a specific area, we assume that the predation rate will reach saturation when the population of natural enemies is sufficiently large. This means that the predation rate will not increase further even if the number of natural enemies continues to grow. Conversely, when the population of natural enemies is low and begins to increase, the predation rate rises more rapidly than a linear function. This nonlinear increase is due to the fact that predators become more efficient at capturing prey as their numbers increase. A natural selection for such a predation rate is the Holling type-II functional response, which captures this nonlinear relationship between predator population and predation rate. In other words, the value of parameter α=1 in model (1.1).
In a relatively closed natural environment, the spatial distribution of predators and prey significantly influences population dynamics, resource allocation, and predation efficiency. The nonlocal competition is in the interaction of predators and prey in different spatial locations, so that the system can predict the population dynamics and competition results more accurately. Peng and Zhang[16] investigated a predator-prey model incorporating collective behavior and nonlocal competition among prey. The findings indicated that nonlocal competition had a destabilizing effect on the predator-prey system.
In addition to geographical distribution, ecological conditions, and other factors, time delay also plays an important role in the maintenance of ecological balance. In the predator-prey model, gestation delay is a key biological factor affecting the system, which is mainly reflected in the time difference between the occurrence of predation behavior and the birth of offspring. This physiological trait can significantly change the functional response pattern of predators to prey: During the breeding interval, the predator's predation frequency may decrease significantly or decrease to zero. This time delay mechanism directly affects the predator's growth rate by adjusting the number of effective predation per unit time and affects the dynamic balance of the ecosystem. The researchers in [17,18,19] developed a type of predator-prey model incorporating gestation delay and examined the dynamic characteristics of the systems.
Inspired by the above, we incorporate the nonlocal competition and gestation delay into the model (1.1). In the ecological environment, spatial distribution is often inhomogeneous, and spatial diffusion often occurs within populations. Therefore, when we study predator-prey models, reaction-diffusion equations may be more realistic. Thus, the resulting system is given by:
{∂u(x,t)∂t=d1Δu+ru(1−˜uK)−acuv1+achu,x∈Ω,t>0,∂v(x,t)∂t=d2Δv+gacu(x,t−τ)v(x,t−τ)1+ahcu(x,t−τ)−dv,x∈Ω,t>0,∂u(x,t)∂→n=0,∂v(x,t)∂→n=0,x∈∂Ω,t>0,u(x,t)=u0(x,t)≥0,v(x,t)=v0(x,t)≥0,(t,x)∈[−τ,0]ׯΩ, | (1.2) |
where u and v denote the density of Dendrolimus superans (prey) and Cyanopica cyanus (predator), respectively, the parameters r, K, h, c, and d have the same meanings as in model (1.1). d1 stands for the diffusion coefficients of Dendrolimus superans. d2 stands for the diffusion coefficients of Cyanopica cyanus. g denotes the efficiency with which energy is transferred from the species Dendrolimus superans to Cyanopica cyanus. a is the attack rate of predator on prey. τ is the gestation delay of Cyanopica cyanus. r, K, a, c, h, g, d, d1, d2 are a positive constant. We select Ω∈(0,lπ) where l>0. ˜u=1K∫ΩG(x,y)u(y,t)dy represents the nonlocal competition, and the kernel function is given by G(x,y)=1|Ω|=1lπ, which is based on the assumption that the competition intensity among prey individuals in the habitat is uniform, meaning that the competition between any two preys is identical. The Neumann boundary condition is employed in this study, suggesting that the habitat is closed and effectively preventing any prey or predator from entering or leaving, thereby maintaining a self-contained ecosystem. We aim to investigate the dynamics of a predator-prey model, with a particular focus on the stability and dynamic properties of the system as the time delay parameter varies and serves as the bifurcation parameter.
The structure of this paper is as follows: In Section 2, we analyze the stability of positive constant steady states and the existence of Hopf bifurcation. In Section 3, we investigate the normal form of the Hopf bifurcation. In Section 4, we present numerical simulations. Finally, conclusions are drawn in Section 5.
System (1.2) has a boundary equilibria E0=(0,0) and a non-trivial equilibrium E1=(u∗,v∗), where
u∗=d(g−hd)ac,v∗=rg(g−hd)ac(1−u∗K). |
If the following assumption holds:
(H0)g>hd, |
then the system (1.2) must have a positive constant steady equilibrium E1=(u∗,v∗).
By defining U(x,t)=(u(x,t),v(x,t))T, the linearized system for Eq (1.2) can be re-expressed as a differential equation at the equilibrium E=(u0,v0),with(u0,v0)=(0,0)or(u∗,v∗):
∂∂tU=D(Δu(x,t)Δv(x,t))+L1(u(x,t)v(x,t))+L2(u(x,t−τ)v(x,t−τ))+L3(˜u(x,t)˜v(x,t)), |
where
D=(d100d2),L1=(a1a20−d),L2=(00b1b2),L3=(c1000), |
with a1=r(1−u0K)−acv0(1+achu0)2,a2=−acu01+achu0,b1=gacv0(1+achu0)2,b2=gacu01+achu0,c1=−ru0K.
Especially, when (u0,v0)=(u∗,v∗), a1=r(1−u∗K)hdg>0,a2=−dg<0,b1=r(g−hd)(1−u∗K)>0,b2=d>0,c1=−ru∗K<0.
Hence, the characteristic equation of (1.2) at E=(u0,v0) is given as follows:
λ2+Anλ+(Bnλ+Cn)e−λτ+Dn=0,n=0,1,2⋯. | (2.1) |
where
{An=(nl)2(d1+d2)+d−a1−δnc1,Bn=−b2,Cn=−(nl)2b2d1+a1b2−a2b1+δnb2c1,Dn=(nl)4d1d2+(nl)2d1d−(nl)2a1d2−a1d−δnc1d, |
with
δn={1,n=0,0,n≠0. |
When τ=0, Eq (2.1) for equilibrium E0=(0,0) becomes
λ2+[n2l2(d1+d2)+d−r]λ+n4l4d1d2+n2l2d1d−n2l2rd2−rd=0,n=0,1,2⋯. | (2.2) |
For the case of n=0 in Eq (2.2), the product of the two eigenvalues −rd is negative. Therefore, the equilibrium E0=(0,0) is always unstable.
When τ=0, Eq (2.1) for equilibrium E1=(u∗,v∗) becomes
λ2+(An+Bn)λ+Cn+Dn=0,n=0,1,2⋯. | (2.3) |
Subsequently, we examine the conditions under which habitat complexity guarantees the stability of a positive constant steady state in the system (1.2).
An+Bn=(nl)2(d1+d2)−a1. Due to d1+d2>0, there is An+Bn>A1+B1>A0+B0=−(a1+c1). Assuming A0+B0=−(a1+c1)>0, there is c<hd+gahK(g−hd). So we have A1+B1=d1+d2l2−a1>0⇒d1+d2l2−rhdg+rhd2gk(g−hd)ac>0. Thus, if rhdl2−(d1+d2)g>0, that is c<rhd2l2Ka(g−hd)[rhdl2−(d1+d2)g]. Otherwise, if rhdl2−(d1+d2)g<0, that is c>0. Define:
c0={rhd2l2Ka(g−hd)[rhdl2−(d1+d2)g],rhdl2−(d1+d2)g>0,hd+gahK(g−hd),rhdl2−(d1+d2)g<0. |
Due to a1>0,a2<0,b1>0,b2>0,C0+D0=−a2b1>0 holds. When n=0, −a2b1>0, a12d1≥0 and △1=(a1d2)2+4a2b1d1d2<0 ⇒c<dk(g−hd)a(1−4d1(g−hd)rh)−1≜c∗, the function Cn+Dn=(nl)4d1d2−(nl)2a1d2−a2b1>0 holds for any n∈N.
In summary, if c<min{hd+gahK(g−hd),c0,c∗} holds, A0−B0>0,An−Bn>0,Cn+Dn>0, for n∈N holds. Thus, we make the following hypothesis
(H1)c<min{hd+gahK(g−hd),c0,c∗}. |
When (H1) holds, the roots of characteristic equation (2.3) have negative real parts.
Theorem 1. For the model (1.2) with τ=0, the stability findings for equilibria are detailed below:
1) Equilibrium E0=(0,0) is always unstable.
2) Equilibrium E1=(u∗,v∗) is always locally asymptotically stable when (H0) and (H1) hold.
3) Equilibrium E1=(u∗,v∗) is always unstable when (H0) or (H1) does not hold.
Next, we investigate the existence of bifurcating periodic solutions near the positive constant steady state E1=(u∗,v∗) for τ≠0.
When τ≠0, the characteristic equation describing the system (2.1) is presented as:
λ2+Anλ+(Bnλ+Cn)e−λτ+Dn=0,n=0,1,2⋯. | (2.4) |
We may assume that λ=±iω (ω>0) are a pair of purely imaginary roots of Eq (2.4). By substituting λ=±iω into Eq (2.4) and separating the real and imaginary components, we derive:
{−ω2+Dn+Cncos(ωτ)−Bnωsin(ωτ)=0,ωAn−Cnsin(ωτ)−Bnωcos(ωτ)=0, |
that is,
{cos(ωτ)=ω2(−AnBn+Cn)−DnCnC2n+B2nω2,sin(ωτ)=ω(AnCn+BnDn+Bnω2)C2n+B2nω2, | (2.5) |
with n=0,1,2⋯. Then, for n=0,1,2,3⋯ and j=0,1,2,3⋯, we get
τ(j)n={1ωnarccos(cosωτ)+2jπ,sinωτ≥0,1ωn[2π−arccos(cosωτ)]+2jπ,sinωτ<0. | (2.6) |
From (2.5), let z=ω2, we obtain:
h(z)=z2+(A2n−2Dn−B2n)z+D2n−C2n=0. | (2.7) |
Calculating the transversality condition, we get:
Re(dλdτ)−1|τ=τ(j)n=2z+(A2n−2Dn−B2n)C2n+B2nω2n=h′(z)C2n+B2nω2n. |
Denote
τ∗c=min{τ(0)n∣n∈N+} | (2.8) |
and
(H2)D2n−C2n<0, |
(H3)A2n−2Dn−B2n<0,D2n−C2n>0,Δn>0, |
with Δn=(A2n−2Dn−B2n)2−4(D2n−C2n).
We define the following set
G1={nkj∈N+|j=1,2,3⋯}, |
G2={nkt∈N+|t=1,2,3⋯}. |
G1 satis (H2) and G2 satis (H3), respectively.
When (H2) holds, Eq (2.7) has the unique positive root znk for some n=nkj∈G1. Therefore, we can solve for ωnk and τ(j)nk, where
ωnk=√12[−[A2nk−2Dnk−B2nk])+√Δnk], | (2.9) |
h′(znk)>0,so we haveRe(dλdτ1)−1|τ=τ(j)nk>0.
When (H3) holds, Eq (2.7) has two positive root znt,i for some n=nkt∈G2. Therefore, we can solve for ωnt,i and τ(j)nt,i,i=1,2, where
ωnt,i=√12[−(A2nt,i−2Dnt,i−B2nt,)∓√Δnt,i]. | (2.10) |
Due to ωnt,1<ωnt,2, we have h′(znt,1)<0 and h′(znt,2)>0. Thus Re(dλdτ)−1|τ=τ(j)nt,1<0, Re(dλdτ)−1|τ=τ(j)nt,2>0 hold.
In summary, we can get the following conclusions.
Theorem 2. Under the framework of model (1.2) with τ≥0, when (H0) and (H1) are valid and τ(j)n is defined by Eq (2.6), the subsequent conclusions hold.
1) Under the conditions G1=∅ and G2=∅,Eq (2.7) has no positive roots, and the positive constant steady state E1 retains local asymptotic stability for all τ≥0.
2) Under the conditions G1≠∅ and G2=∅,Eq (2.7) admits a unique positive root znk for some nk∈G1, the positive constant steady state E1 of system (1.2) exhibits asymptotic stability for 0<τ1<τ∗c and unstable for τ1>τ∗c, where τ∗c=min{τ(0)nk∣nk∈G1}. Additionally, system (1.2) undergoes nk−mode Hopf bifurcation near E1 when τ=τ(j)nk(nk∈G1,j=0,1,2,3⋯).
3) Under the conditions G1=∅ and G2≠∅,Eq (2.7) admits two positive roots znt,i(i=1,2) for some nt∈G2, the positive constant steady state E1 of system (1.2) exhibits asymptotic stability for 0<τ1<τ∗c, but a stability switch may occur for τ1>τ∗c, where τ∗c=min{τ(0)nt∣nt∈G1}. Furthermore, nt−mode Hopf bifurcation emerges near E1 at τ=τ(j)nt(nt∈G1,j=0,1,2,3⋯).
4) Under the conditions G1≠∅ and G2≠∅,Eq (2.7) admits positive roots znk and znt,i(i=1,2) and letting np correspond to the smallest critical time delay τ∗c, where np∈G1 or np∈G2, the positive constant steady state E1 of model (1.2) remains asymptotically stable for 0<τ1<τ∗c, but a stability switch may arise for τ1>τ∗c, where τ∗c=min{τ(0)np∣np∈G1ornp∈G2}. Furthermore, np−mode Hopf bifurcation occurs near E1 at τ=τ(j)np(np∈G1ornp∈G2,j=0,1,2,3⋯).
In this section, we use the multiple time scales method to derive the normal form of the Hopf bifurcation for system (1.2).
Suppose that the characteristic equation (2.4) has a pair of pure imaginary roots λ=±iω for τ=τc Then, system (1.2) undergoes n-mode Hopf bifurcation near the equilibrium point E1. Then, we derive the normal form of Hopf bifurcation of system (1.2) by the multiple time scales method. We choose time delay τ as a bifurcation parameter, where τ=τc+εμ. The parameter ε is a dimensionless scaling factor, μ is a perturbation parameter, and τc is given in Eq (2.8).
We let u(x,t)⟶u(x,t)−u∗, v(x,t)⟶v(x,t)−v∗, α=ac, then model (1.2) can be rewritten as
{∂u(x,t)∂t=d1Δu+u(r−f1−u∗K)−ru∗K˜u−f2v−12f11u2−f12uv−16f111u3−12f112u2v,∂v(x,t)∂t=d2Δu+gf2v(x,t−τ)+gf1u(x,t−τ)+g2f11u2(x,t−τ)+gf12u(x,t−τ)v(x,t−τ)+g6f111u3(x,t−τ)+g2f112u2(x,t−τ)v(x,t−τ)−dv, | (3.1) |
where
f1=αv∗(1+αhu∗)2,f2=αu∗1+αhu∗,f11=−2α2hv∗(1+αhu∗)3+rK,f12=α(1+αhu∗)2,f111=6α3h2v∗(1+αhu∗)4,f112=−2α2h(1+αhu∗)3. |
Let h=(h11,h12)T be the the eigenvector of the linear operator of system (3.1) corresponding to the eigenvalue λ=iω, and let h∗=(h∗11,h∗12)T be the normalized eigenvector of the adjoint operator of the linear operator of system (3.1) corresponding to the eigenvalue −iω satisfying the inner product <h∗, h>=¯h∗T⋅h=1. By a simple calculation, we get
h=(h11,h12)T=(1,−iω−(nl)2d1+r−f1−u∗K−u∗Kδnf2),h∗=s(h21,h22)T=s(f2iω−(nl)2d1+r−f1−u∗K−u∗Kδn,1), | (3.2) |
with s=(¯h11h21+h22¯h12)−1, and
δn={1,n=0,0,n≠0. |
Suppose the solution of Eq (3.1) is
U(x,t)=U(x,T0,T1,T2,⋯)=+∞∑k=1εkUk(x,T0,T1,T2,⋯), | (3.3) |
where
U(x,T0,T1,T2,⋯)=(u(x,T0,T1,T2,⋯),v(x,T0,T1,T2,⋯))T,Uk(x,T0,T1,T2,⋯)=(uk(x,T0,T1,T2,⋯),vk(x,T0,T1,T2,⋯))T. |
The derivation with respect to t is
ddt=∂∂T0+ε∂∂T1+ε2∂∂T2+⋯=D0+εD1+ε2D2+⋯, |
where the differential operator Di=∂∂Ti,i=0,1,2,⋯.
We obtain
∂U(x,t)∂t=εD0U1+ε2D0U2+ε2D1U1+ε3D0U3+ε3D1U2+ε3D2U1+⋯,ΔU(x,t)=εΔU1(x,t)+ε2ΔU2(x,t)+ε3ΔU3(x,t)+⋯. | (3.4) |
Denote
uj=uj(x,T0,T1,T2,⋯),vj=vj(x,T0,T1,T2,⋯),uj,τc=uj(x,T0−τc,T1,T2,⋯),vj,τc=vj(x,T0−τc,T1,T2,⋯), |
with j=1,2,3,⋯.
We take perturbations as τ=τc+εμ to deal with the delayed terms. By expand U(x,t−τ) at U(x,T0−τc,T1,T2,···), respectively, that is,
{u(x,t−τ)=εu1,τc+ε2u2,τc+ε3u3,τc−ε2μD0u1,τc−ε3μD0u2,τc−ε2τcD1u1,τc−ε3μD1u1,τc−ε3τcD2u1,τc−ε3τcD1u2,τc+⋯,v(x,t−τ)=εv1,τc+ε2v2,τc+ε3v3,τc−ε2μD0v1,τc−ε3μD0v2,τc−ε2τcD1v1,τc−ε3μD1v1,τc−ε3τcD2v1,τc−ε3τcD1v2,τc+⋯. | (3.5) |
By substituting Eqs (3.3)–(3.5) into Eq (3.1), we obtain the expression for ε.
{D0u1−d1Δu1−(r−f1−u∗K)u1+u∗K~u1+f2v1=0,D0v1−d2Δv1−gf2v1,τc−gf1u1,τc+dv1=0. | (3.6) |
The solution of Eq (3.6) can be written as follows:
{u1=GeiωτcT0h11cos(nx)+c.c.,v1=GeiωτcT0h12cos(nx)+c.c., | (3.7) |
where h11 and h12 are given in Eq (3.2), and c.c. means the complex conjugate of the preceding terms.
For the ε2, we have
{D0u2−d1u2−(r−f1−u∗K)u2+u∗K~u2+f2v2=−D1u1−~u1v1K−12f11u21−f12u1v1,D0v2−d2v2−gf2v2,τc−gf1u2,τc+dv2=−D1v1+gf2(τcD1v1,τc+μD0v1,τc)+gf1(τcD1u1,τc+μD0u1,τc)+g2f11u21,τc+gf12u1,τcv1,τc. | (3.8) |
Substituting Eq (3.7) into the right side of Eq (3.8), we denote the coefficient vector of eiωT0 as m1, from solvability condition <h∗,(m1,cosnlx)>=0, we obtain
∂G∂T1=μMG, | (3.9) |
with
M=iω(gf2h12+gf1h11)[−iω−n2l2d1+r−f1−u∗K(1−δn)]f2h11+(h12+τcgf2h12+τcgf1h11)[−iω−n2l2d1+r−f1−u∗K(1−δn)]. |
Assume the solution of Eq (3.8) to be as follows:
{u2=+∞∑k=0(η0kG¯G+η1kG2e2iωT0+¯η1k¯G2e−2iωT0)cos(kxl),v2=+∞∑k=0(ς0kG¯G+ς1kG2e2iωT0+¯ς1k¯G2e−2iωT0)cos(kxl). | (3.10) |
Denote
{ck=∫lπ0cos(nxl)cos(kxl)dx={lπ,k=n≠0,lπ2,k=n=0,0,k≠n.fk=∫lπ0cos2(nxl)cos(kxl)dx={lπ2,k=0,lπ4,k=2n≠0,0,k≠2n≠0. |
Substituting solutions Eqs (3.7) and (3.10) into Eq (3.8), we obtain
η0k=X0kD0k−Y0kB0kA0kD0k−C0kB0k,ζ0k=A0kY0k−C0kX0kA0kD0k−C0kB0k,η1k=X1kD1k−Y1kB1kA1kD1k−C1kB1k,ζ1k=A1kY1k−C1kX1kA1kD1k−C1kB1k, |
where
{A0k=[(kl)2d1−(r−f1−u∗K)]∫lπ0cos2(klx)dx+u∗klπ[∫lπ0cos2(klx)dx]2,B0k=f2∫lπ0cos2(klx)dx,C0k=−gf1∫lπ0cos2(klx)dx,D0k=(d1+d2−gf2)∫lπ0cos2(klx)dx,X0k=−[(h11¯h12+h12¯h11)f2+f11h11¯h11+(h11¯h12+h11h12)]fk,Y0k=g[f11h11¯h11+f12(h12¯h11+h11¯h12)]fk,A1k=[2iω+(kl)2d1−(r−f1−u∗K)]∫lπ0cos2(klx)dx+u∗klπ[∫lπ0cos2(klx)dx]2,B1k=f2∫lπ0cos2(klx)dx,C1k=−gf1∫lπ0cos2(klx)dx,D1k=[2iω+d2(kl)2−gf2+d1]∫lπ0cos2(klx)dx,X1k=−h11h12ck−(12f11h211+f2h11h12)fk,Y1k=(g2f11h211+gf12h12h11)fk. |
For the ε3, we obtain
{D0u3−d1u3−(r−f1−u3K)u3+u3K~u3+f2v3+16f111u33=−D2u1−D1u2−~u1v2+~u2v1K−f11(u1u2+u2v1)−16f111u31−12f112u21v1+o(μ),D0v3−d2v3+gf2v3,τc+dv3=−D1u2−D2u1−gf2τc(D2v1,τc+D1v2,τc)−gf1τc(D2u1,τc+D1u2,τc)+gf11(u2,τcu1,τc−u1D1u1,τcτc)++g6f11u31,τc+g2f11u21,τ1v1,τc+gf12[u1,τcv2,τc+u2,τcv1,τc−τc(D1u1,τcv1,τc+D1v1,τcv1,τc)]+o(μ). | (3.11) |
Substituting Eqs (3.7) and (3.10) into the right side of Eq (3.11), we denote the coefficient vector of eiωT0 as m2, by solvability condition <h∗,(m2,cosnlx)>=0, we obtain
∂G∂T2=XG2¯G, | (3.12) |
where
X=σφ, | (3.13) |
with
{σ=−∞∑k=01klπ(η0kh11+η1k¯h11)fk+∞∑k=0(f11η0kh11+f11η1k¯h11+f12ς0kh12+f12ς1k¯h12)ck−12[(1−g)f111h211¯h11+(f112−gf111)(h211¯h12+2h11¯h11h12)]∫lπ0cos3(nlx)dx+∞∑k=0g[f11(η0kh11+η1k¯h11)+f12(ς0kh11+ς1k¯h11+η0kh12+η1k¯h12)]ck,φ=−[2h11+gτc(f2h12+f1h11)]∫lπ0cos2(nlx)dx. |
According to the above analysis, the normal form of Hopf bifurcation for system (1.2) reduced on the center manifold is
˙G=MμG+XG2¯G, | (3.14) |
where M and X are given by Eqs (3.9) and (3.13), respectively.
Let G=reiθ and substitute it into Eq (3.14), and we obtain the Hopf bifurcation normal form in polar coordinates:
{˙r=Re(M)μr+Re(X)r3,˙θ=Im(M)μ+Im(X)r2. | (3.15) |
Therefore, we arrive at the following theorem.
Theorem 3. For system (3.15), if Re(M)μRe(X)<0 holds, model (1.2) exists periodic solutions near equilibrium E1=(u∗,v∗).
1) If Re(M)μ<0 the bifurcating periodic solutions reduced on the center manifold are unstable, and the direction of bifurcation is forward (backward) for μ>0(μ<0).
2) If Re(M)μ>0 the bifurcating periodic solutions reduced on the center manifold are stable, and the direction of bifurcation is forward (backward) for μ>0(μ<0).
In this section, we perform numerical simulations to verify the correctness of the theoretical analysis. In summary, we choose d=0.3,g=0.6,a=0.6,d1=0.01,d2=0.2,c=0.55, r=0.41, K=5, h=0.41, and l=1.
Based on the data above, (H0) and (H1) always hold, and system (1.2) has one unstable boundary equilibrium E0=(0,0), and one nontrivial equilibrium E1=(u∗,v∗)=(1.90585,0.96710). What matters most to us is the stability of the nontrivial equilibrium E1.
According to Theorem 1, then E1 is local asymptotically stable. This means that if system (1.2) is without delay, although Cyanopica cyanus and Dendrolimus superans can coexist at this time, natural predators are capable of suppressing the reproduction of the pests.
When τ≠0, by a simple calculation, (H2) only holds for n=1 there does not exist any n such that (H3) holds. Thus, Eq (2.9) has a unique positive root ω=0.1616, which corresponds to the critical delay τ(0)1=2.5897. From the definition of τ∗c, we obtain τ∗c=2.5897, theorem 2.2 supports the conclusion that the positive constant steady state E1 achieves local asymptotic stability when τ∈[0,2.5897), and instability when τ∈(2.5897,+∞). We select τ=1.5∈[0,2.5897) to conduct the simulation. See Figure 3.
We choose τ=2.8>τ∗c=2.5879, from Eqs (3.9) and (3.12), we obtain Re(M)>0, Re(X)<0. Thus, according to Theorem 3, system (1.2) will generate inhomogeneous periodic solutions near the positive constant steady state E1 of model (1.2), and bifurcating periodic solutions are stable and forward (see Figure 4).
By analyzing Figures 3 and 4, we can draw the following conclusions.
1) When the gestation delay of the predator is less than the critical value, the predator can quickly control the number of pests and reach a stable state by preying on pests.
2) When the gestation delay of the predator is slightly more than the critical value, the predator has a certain control effect on the number of pests. This will cause the number of pest populations to erupt periodically, and the number of natural enemy populations will fluctuate periodically.
3) Comparing Figures 3 and 4, when the gestation delay of insectivorous birds is long, so it is necessary to artificially intervene in the population of pests to prevent the outbreak of insect pests. By releasing insectivorous birds to increase their number, we can indirectly reduce the increase in the number of pests and the outbreak of pests due to the prolonged pregnancy of predators, so that the population of pests can return to a controllable stable state.
In this paper, aiming at the population density control problem of the pine caterpillar, considering the Holling-II type functional response, we developed a pest control model with gestation delay and nonlocal competition. For our analysis, we focused on two major aspects: first, the existence and stability of the positive constant steady state, and second, the conditions under which Hopf bifurcations emerge near this steady state. In the part of numerical simulation, we selected a set of suitable parameters for numerical simulation. It provided an explanation for effectively controlling the population density of the pine caterpillar and maintained the stability between natural enemies and the pine caterpillar species, so as to realize effective environmental protection and true green pest control. Therefore, gestation delay has a significant impact on the stability of the population. When the gestation delay is less than the critical delay, the predator can effectively control the pest population. When the gestation delay exceeds the critical delay, the pest population experiences periodic outbreaks.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This study was funded by the Heilongjiang Provincial Natural Science Foundation of China (Grant No. LH2024A001), and the College Students Innovations Special Project funded by Northeast Forestry University (No. DCLXY-2025011).
The authors declare there are no conflicts of interest.
[1] |
S. Zhou, L. Xing, X. Zheng, N. Du, L. Wang, Q. Zhang, A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times, IEEE Trans. Cybern., 51 (2021), 1430–1442. https://doi.org/10.1109/TCYB.2019.2939219 doi: 10.1109/TCYB.2019.2939219
![]() |
[2] |
W. Deng, J. Xu, Y. Song, H. Zhao, Differential evolution algorithm with wavelet basis function and optimal mutation strategy for complex optimization problem, Appl. Soft Comput., 100 (2021), 1568–4946. https://doi.org/10.1016/j.asoc.2020.106724 doi: 10.1016/j.asoc.2020.106724
![]() |
[3] |
F. Zhao, X. He, L. Wang, A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem, IEEE Trans. Cybern., 51 (2020), 5291–5303. https://doi.org/10.1109/TCYB.2020.3025662 doi: 10.1109/TCYB.2020.3025662
![]() |
[4] |
A. Kaveh, A. D. Eslamlou, Water strider algorithm: A new metaheuristic and applications, Structures, 25 (2020), 520–541. https://doi.org/10.1016/j.istruc.2020.03.033 doi: 10.1016/j.istruc.2020.03.033
![]() |
[5] |
F. Zhao, L. Zhang, J. Cao, A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem, Comput. Ind. Eng., 153 (2021), 107082. https://doi.org/10.1016/j.cie.2020.107082 doi: 10.1016/j.cie.2020.107082
![]() |
[6] |
H. Yapici, N. Cetinkaya, A new meta-heuristic optimizer: Pathfinder algorithm, Appl. Soft Comput., 78 (2019), 545–568. https://doi.org/10.1016/j.asoc.2019.03.012 doi: 10.1016/j.asoc.2019.03.012
![]() |
[7] |
S. H. S. Moosavi, V. K. Bardsiri, Poor and rich optimization algorithm: A new human-based and multi populations algorithm, Eng. Appl. Artif. Intell., 86 (2019), 165–181. https://doi.org/10.1016/j.engappai.2019.08.025 doi: 10.1016/j.engappai.2019.08.025
![]() |
[8] |
A.W. Mohamed, A. A. Hadi, A. K. Mohamed, Gaining-sharing knowledge based algorithm for solving optimization problems: A novel nature-inspired algorithm, Int. J. Mach. Learn. Cybern., 11 (2020), 1501–1529. https://doi.org/10.1007/s13042-019-01053-x doi: 10.1007/s13042-019-01053-x
![]() |
[9] |
Y. Liu, R. Li, PSA: A photon search algorithm. J. Inf. Process. Syst., 16 (2020), 478–493. https://doi.org/10.3745/JIPS.04.0168 doi: 10.3745/JIPS.04.0168
![]() |
[10] |
L. Pflug, N. Bernhardt, M. Grieshammer, CSG: A new stochastic gradient method for the efficient solution of structural optimization problems with infinitely many states, Struct. Multidisc. Optim., 61 (2020), 2595–2611. https://doi.org/10.1007/s00158-020-02571-x doi: 10.1007/s00158-020-02571-x
![]() |
[11] |
Y. Yang, Y. Gao, S. Tan, An opposition learning and spiral modelling based arithmetic optimization algorithm for global continuous optimization problems, Eng. Appl. Artif. Intell., 113 (2022), 104981. https://doi.org/10.1016/j.engappai.2022.104981 doi: 10.1016/j.engappai.2022.104981
![]() |
[12] |
A. T. Khan, X. Cao, S. Li, Dual beetle antennae search system for optimal planning and robust control of 5-link biped robots, J. Comput. Sci., 60 (2022), 1877–7503. https://doi.org/10.1016/j.jocs.2022.101556 doi: 10.1016/j.jocs.2022.101556
![]() |
[13] |
W. L. Liu, Y. J. Gong, W. N. Chen, Z. Liu, H. Wang, J. Zhang, Coordinated charging scheduling of electric vehicles: a mixed-variable differential evolution approach, IEEE Trans. Intell. Transp., 21 (2020), 5094–5109. https://doi.org/10.1109/TITS.2019.2948596 doi: 10.1109/TITS.2019.2948596
![]() |
[14] |
F. Zhao, R. Ma, L. Wang, A self-learning discrete jaya algorithm for multi-objective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system, IEEE Trans. Cybern., 247 (2021), 1–12. https://doi.org/10.1109/TCYB.2021.3086181 doi: 10.1109/TCYB.2021.3086181
![]() |
[15] |
L. Pflug, N. Bernhardt, M. Grieshammer, CSG: A new stochastic gradient method for the efficient solution of structural optimization problems with infinitely many states, Struct. Multidisc. Optim., 61 (2020), 2595–2611. https://doi.org/10.1007/s00158-020-02571-x doi: 10.1007/s00158-020-02571-x
![]() |
[16] |
G. Dhiman, M. Garg, MoSSE: A novel hybrid multi-objective meta-heuristic algorithm for engineering design problems, Soft Comput., 24 (2020), 18379–18398. https://doi.org/10.1007/s00500-020-05046-9 doi: 10.1007/s00500-020-05046-9
![]() |
[17] |
F. Zhao, S. Di, J. Cao, J. Tang, Jonrinaldi, A Novel Cooperative Multi-Stage Hyper-Heuristic for Combination Optimization Problems, Complex Syst. Model. Simul., 1 (2021), 91-108. https://doi.org/10.23919/CSMS.2021.0010 doi: 10.23919/CSMS.2021.0010
![]() |
[18] |
Y. Yang, C. Qian, H. Li, An efficient DBSCAN optimized by arithmetic optimization algorithm with opposition-based learning, J. Supercomput., 440 (2022). https://doi.org/10.1007/s11227-022-04634-w doi: 10.1007/s11227-022-04634-w
![]() |
[19] |
S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Software, 95 (2016), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008 doi: 10.1016/j.advengsoft.2016.01.008
![]() |
[20] |
S. Chakraborty, A. K. Saha, S. Sharma, S. Mirjalili, R. Chakraborty, A novel enhanced whale optimization algorithm for global optimization, Comput. Ind. Eng., 153 (2021), 107086. https://doi.org/10.1016/j.cie.2020.107086 doi: 10.1016/j.cie.2020.107086
![]() |
[21] |
Q. Jin, Z. Xu, W. Cai, An improved whale optimization algorithm with random evolution and special reinforcement dual-operation strategy collaboration, Symmetry, 13 (2021), 238–256. https://doi.org/10.3390/sym13020238 doi: 10.3390/sym13020238
![]() |
[22] |
J. Luo, H. Chen, A. A. Heidari, Y. Xu, Q. Zhang, C. Li, Multi-strategy boosted mutative whale-inspired optimization approaches, Appl. Math. Modell., 73 (2019), 109–123. https://doi.org/10.1016/j.apm.2019.03.046 doi: 10.1016/j.apm.2019.03.046
![]() |
[23] |
Y. Yang, Z. Tao, C. Qian, A hybrid robust system considering outliers for electric load series forecasting, Appl. Intell., 52 (2022), 1630–1652. https://doi.org/10.1007/s10489-021-02473-5 doi: 10.1007/s10489-021-02473-5
![]() |
[24] |
Q. Fan, Z. Chen, W. Zhang, ESSAWOA: Enhanced whale optimization algorithm integrated with salp swarm algorithm for global optimization, Eng. Comput., 20 (2020). https://doi.org/10.1007/s00366-020-01189-3 doi: 10.1007/s00366-020-01189-3
![]() |
[25] |
M. Nguyen, T. Tran, T. Nguyen, G. Nguyen, Hybridization of galactic swarm and evolution whale optimization for global search problem, IEEE Access, 8 (2020), 74991–75010. https://doi.org/10.1109/ACCESS.2020.2988717 doi: 10.1109/ACCESS.2020.2988717
![]() |
[26] |
M. Abdel-Basset, V. Chang, R. Mohamed, HSMA_WOA: A hybrid novel Slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest X-ray images, Appl. Soft Comput., 95 (2020), 1568–4946. https://doi.org/10.1016/j.asoc.2020.106642 doi: 10.1016/j.asoc.2020.106642
![]() |
[27] |
J. Zhang, L. Hong, Q. Liu, An improved whale optimization algorithm for the traveling salesman problem, Symmetry, 13 (2020), 48–56. https://doi.org/10.3390/sym13010048 doi: 10.3390/sym13010048
![]() |
[28] |
M. Wang, H. Chen, Chaotic multi-swarm whale optimizer boosted support vector machine for medical diagnosis, Appl. Soft Comput., 88 (2020), 105946. https://doi.org/10.1016/j.asoc.2019.105946 doi: 10.1016/j.asoc.2019.105946
![]() |
[29] |
V. Hemmelmayr, K. F. Doerner, R. F. Hartl, S. Rath, A heuristic solution method for node routing based solid waste collection problems, J. Heuristics, 19 (2013), 129–156. https://doi.org/10.1177/0734242X18801186 doi: 10.1177/0734242X18801186
![]() |
[30] |
F. Kılıç, Y. Kaya, S. Yildirim, A novel multi population based particle swarm optimization for feature selection, Knowl.-Based. Syst., 219 (2021), 126–140. https://doi.org/10.1016/j.knosys.2021.106894 doi: 10.1016/j.knosys.2021.106894
![]() |
[31] | H. R. Tizhoosh, Opposition-based learning: A new scheme for machine intelligence, in International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC'06), 1 (2005), 695–701. https://doi.org/10.1109/CIMCA.2005.1631345 |
[32] |
S. Dhargupta, M. Ghosh, S. Mirjalili, R. Sarkar, Selective opposition based grey wolf optimization, Expert. Syst. Appl., 151 (2020), 113389. https://doi.org/10.1016/j.eswa.2020.113389 doi: 10.1016/j.eswa.2020.113389
![]() |
[33] |
M. H. Qais, H. M. Hasanien, S. Alghuwainem, Enhanced whale optimization algorithm for maximum power point tracking of variable-speed wind generators, Appl. Soft Comput., 86 (2020), 105937. https://doi.org/10.1016/j.asoc.2019.105937 doi: 10.1016/j.asoc.2019.105937
![]() |
[34] |
S. P. Adam, S. N. Alexandropoulos, P. M. Pardalos, M. N. Vrahatis, No free lunch theorem: A review, Optim. Appl., 145 (2019), 57–82. https://doi.org/10.1007/978-3-030-12767-1_5 doi: 10.1007/978-3-030-12767-1_5
![]() |
[35] |
Q. Fan, Z. Chen, Z. Li, A new improved whale optimization algorithm with joint search mechanisms for high-dimensional global optimization problems, Eng. Comput., 34 (2020), 1851–1878. https://doi.org/10.1007/s00366-019-00917-8 doi: 10.1007/s00366-019-00917-8
![]() |
[36] |
S. Mirjalili, SCA: A sine cosine algorithm for solving optimization problems, Knowl.-Based. Syst., 96 (2016), 120–133. https://doi.org/10.1016/j.knosys.2015.12.022 doi: 10.1016/j.knosys.2015.12.022
![]() |
[37] |
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
![]() |
[38] |
S. Mirjalili, Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowl.-Based. Syst., 89 (2015), 228–249. https://doi.org/10.1016/j.knosys.2015.07.006 doi: 10.1016/j.knosys.2015.07.006
![]() |
[39] |
H. Chen, W. Li, X. Yang, A whale optimization algorithm with chaos mechanism based on quasi-opposition for global optimization problems, Expert. Syst. Appl., 158 (2020), 23–46. https://doi.org/10.1016/j.eswa.2020.113612 doi: 10.1016/j.eswa.2020.113612
![]() |
[40] |
W. Qiao, Z. Yang, Z. Kang, Short-term natural gas consumption prediction based on Volterra adaptive filter and improved whale optimization algorithm, Eng. Appl. Artif. Intell., 87 (2020), 103323. https://doi.org/10.1016/j.engappai.2019.103323 doi: 10.1016/j.engappai.2019.103323
![]() |
[41] |
T. Tiwari, M. Saraswat, A new firefly algorithm-based superpixel clustering method for vehicle segmentation, Appl. Soft Comput., 278 (2022), 1–14. https://doi.org/10.1007/s00500-022-07206-5 doi: 10.1007/s00500-022-07206-5
![]() |
[42] |
A. Darwish, Bio-inspired computing: Algorithms review, deep analysis, and the scope of applications, Future Comput. Inf. J., 3 (2018), 231–246, https://doi.org/10.1016/j.fcij.2018.06.001 doi: 10.1016/j.fcij.2018.06.001
![]() |
[43] |
S. Zhou, A quantum image encryption method based on DNACNot, IEEE Access, 8 (2020), 178336–178344. https://doi.org/10.1109/ACCESS.2020.3027964 doi: 10.1109/ACCESS.2020.3027964
![]() |
[44] |
H. Hong, L. Wang, H. Ahmad, J. Li, Y. Yang, C. Wu, Construction of DNA codes by using algebraic number theory, Finite Fields Appl., 37 (2016), 328–343. https://doi.org/10.1016/j.ffa.2015.10.008 doi: 10.1016/j.ffa.2015.10.008
![]() |
[45] |
X. Wang, W. Xue, J. An, Image encryption algorithm based on LDCML and DNA coding sequence, Multimedia Tools Appl., 80 (2021), 591–614. https://doi.org/10.1007/s11042-020-09688-7 doi: 10.1007/s11042-020-09688-7
![]() |
[46] |
W. Song, K. Cai, M. Zhang, C. Yuen, Codes with run-length and GC-content constraints for DNA-based data storage, IEEE Commun. Lett., 22 (2018), 2004–2007. https://doi.org/10.1109/LCOMM.2018.2866566 doi: 10.1109/LCOMM.2018.2866566
![]() |
[47] | T. T. Nguyen, K. Cai, K. A. S. Immink, Constrained coding with error control for DNA-based data storage, in 2020 IEEE International Symposium on Information Theory (ISIT), (2020), 694–699. https://doi.org/10.1109/ISIT44484.2020.9174438 |
[48] | Y. Wang, M. Noor-A-Rahim, E. Gunawan, Y. L. Guan, C. L. Poh, Thermodynamically stable DNA code design using a similarity significance model, in 2020 IEEE International Symposium on Information Theory (ISIT), (2020), 21–26. https://doi.org/10.1109/ISIT44484.2020.9174468 |
[49] |
B. Cao, X. Li, X. Zhang, B. Wang, X. Wei, Designing uncorrelated address constrain for DNA storage by DMVO algorithm, IEEE/ACM Trans. Comput. Biol. Bioinf., 11 (2020), 866–877. https://doi.org/10.1109/TCBB.2020.3011582 doi: 10.1109/TCBB.2020.3011582
![]() |
[50] |
D. Limbachiya, M. K. Gupta, V. Aggarwal, Family of constrained codes for archival DNA data storage, IEEE Commun. Lett., 22 (2018), 1–10. https://doi.org/10.1109/LCOMM.2018.2861867 doi: 10.1109/LCOMM.2018.2861867
![]() |
[51] |
B. Cao, Q. Zhang, B. Wu, Q. Wang, X. Zhang, X. Wei, Minimum free energy coding for DNA storage, IEEE Trans. Nanobiosci., 20 (2021), 212–222. https://doi.org/10.1109/TNB.2021.3056351 doi: 10.1109/TNB.2021.3056351
![]() |
[52] |
M. Levy, E. Yaakobi, Mutually uncorrelated codes for DNA storage, IEEE Trans. Inf. Theory, 65 (2018), 3671–3691. https://doi.org/10.1109/TIT.2018.2873138 doi: 10.1109/TIT.2018.2873138
![]() |