
In this paper, an ensemble metaheuristic algorithm (denoted as LX-BBSCA) is introduced. It combines the strengths of Laplacian biogeography-based optimization (LX-BBO) and the sine cosine algorithm (SCA) to address structural engineering design optimization problems. Our primary objective is to mitigate the risk of getting stuck in local minima and accelerate the algorithm's convergence rate. We evaluate the proposed LX-BBSCA algorithm on a set of 23 benchmark functions, including both unimodal and multimodal problems of varying complexity and dimensions. Additionally, we apply LX-BBSCA to tackle five real-world structural engineering design problems, comparing the results with those obtained using other metaheuristics in terms of objective function values and convergence behavior. To ensure the statistical validity of our findings, we employ rigorous tests such as the t-test and the Wilcoxon rank test. The experimental outcomes consistently demonstrate that the ensemble LX-BBSCA algorithm outperforms not only the basic versions of BBO, SCA and LX-BBO but also other state-of-the-art metaheuristic algorithms.
Citation: Vanita Garg, Kusum Deep, Khalid Abdulaziz Alnowibet, Ali Wagdy Mohamed, Mohammad Shokouhifar, Frank Werner. LX-BBSCA: Laplacian biogeography-based sine cosine algorithm for structural engineering design optimization[J]. AIMS Mathematics, 2023, 8(12): 30610-30638. doi: 10.3934/math.20231565
[1] | Ahmed M. Gemeay, Najwan Alsadat, Christophe Chesneau, Mohammed Elgarhy . Power unit inverse Lindley distribution with different measures of uncertainty, estimation and applications. AIMS Mathematics, 2024, 9(8): 20976-21024. doi: 10.3934/math.20241021 |
[2] | Fiaz Ahmad Bhatti, Azeem Ali, G. G. Hamedani, Mustafa Ç. Korkmaz, Munir Ahmad . The unit generalized log Burr XII distribution: properties and application. AIMS Mathematics, 2021, 6(9): 10222-10252. doi: 10.3934/math.2021592 |
[3] | Hongping Guo, Yuhang Qian, Yiran Zhu, Xinming Dai, Xiao Wang . Confidence intervals for the difference between coefficients of variation of zero-inflated gamma distributions. AIMS Mathematics, 2023, 8(12): 29713-29733. doi: 10.3934/math.20231521 |
[4] | Abdulhakim A. Al-Babtain, Amal S. Hassan, Ahmed N. Zaky, Ibrahim Elbatal, Mohammed Elgarhy . Dynamic cumulative residual Rényi entropy for Lomax distribution: Bayesian and non-Bayesian methods. AIMS Mathematics, 2021, 6(4): 3889-3914. doi: 10.3934/math.2021231 |
[5] | Ali A. Al-Shomrani . An improvement in maximum likelihood estimation of the Burr XII distribution parameters. AIMS Mathematics, 2022, 7(9): 17444-17460. doi: 10.3934/math.2022961 |
[6] | Muhammad Amin, Saima Afzal, Muhammad Nauman Akram, Abdisalam Hassan Muse, Ahlam H. Tolba, Tahani A. Abushal . Outlier detection in gamma regression using Pearson residuals: Simulation and an application. AIMS Mathematics, 2022, 7(8): 15331-15347. doi: 10.3934/math.2022840 |
[7] | Refah Alotaibi, Mazen Nassar, Zareen A. Khan, Ahmed Elshahhat . Analysis of reliability index R=P(Y<X) for newly extended xgamma progressively first-failure censored samples with applications. AIMS Mathematics, 2024, 9(11): 32200-32231. doi: 10.3934/math.20241546 |
[8] | M. G. M. Ghazal, Yusra A. Tashkandy, Oluwafemi Samson Balogun, M. E. Bakr . Exponentiated extended extreme value distribution: Properties, estimation, and applications in applied fields. AIMS Mathematics, 2024, 9(7): 17634-17656. doi: 10.3934/math.2024857 |
[9] | Haiwu Huang, Yuan Yuan, Hongguo Zeng . An extension on the rate of complete moment convergence for weighted sums of weakly dependent random variables. AIMS Mathematics, 2023, 8(1): 622-632. doi: 10.3934/math.2023029 |
[10] | H. M. Barakat, M. A. Alawady, I. A. Husseiny, M. Nagy, A. H. Mansi, M. O. Mohamed . Bivariate Epanechnikov-exponential distribution: statistical properties, reliability measures, and applications to computer science data. AIMS Mathematics, 2024, 9(11): 32299-32327. doi: 10.3934/math.20241550 |
In this paper, an ensemble metaheuristic algorithm (denoted as LX-BBSCA) is introduced. It combines the strengths of Laplacian biogeography-based optimization (LX-BBO) and the sine cosine algorithm (SCA) to address structural engineering design optimization problems. Our primary objective is to mitigate the risk of getting stuck in local minima and accelerate the algorithm's convergence rate. We evaluate the proposed LX-BBSCA algorithm on a set of 23 benchmark functions, including both unimodal and multimodal problems of varying complexity and dimensions. Additionally, we apply LX-BBSCA to tackle five real-world structural engineering design problems, comparing the results with those obtained using other metaheuristics in terms of objective function values and convergence behavior. To ensure the statistical validity of our findings, we employ rigorous tests such as the t-test and the Wilcoxon rank test. The experimental outcomes consistently demonstrate that the ensemble LX-BBSCA algorithm outperforms not only the basic versions of BBO, SCA and LX-BBO but also other state-of-the-art metaheuristic algorithms.
In biology, discrete models of interspecific relationships in populations without generation-level overlap are more generalizable than continuous ones, which has attracted many scholars in recent years (see [1,2,3,4,5,6,7,8,9,10,11,12]). Obviously, all these works indicate that discrete systems have more complex dynamic behavior. The predator-prey model is a class of classical biomathematical model that has been studied by different scholars in terms of the evolutionary patterns of populations over time [13,14] and the effects of different functional responses on the stability of populations [15,16].
For the predator-prey system, external factors such as food supply, climate change and population migration can affect predation and population reproduction [17,18]. However, the effects of changes in predators themselves are often overlooked, such as predator fear [19]. Frightened predators tend to eat less, which leads to reduced birth rates and increased mortality [19]. Therefore, predator fear, which cannot be quantitatively described, is more difficult to study.
Sasmal [20] studied a predator-prey model with Allee effect and reduced reproduction of prey due to cost of fear. They discussed the effects of time scale separation between prey and predator.
{dudt=ru(1−uk)(u−θ)11+fv−auv(0<θ<k)dvdt=aαuv−mv | (1.1) |
where u and v are the prey and predator population densities, respectively. r is the maximum growth rate of the population, k is the carrying capacity, and θ represents the Allee threshold (0<θ<k), below which the population becomes extinct. f refers to the level of fear, which is due to the anti-predator response of prey. a is the predation rate, α is the conversion efficiency of predator by consuming prey, and m represents the predator's natural mortality rate.
To simplify parameters, define N=uk, P=arkv, ϵ=aαr, θ=θk, m=maαk, f=rkfa, t=aαkt. Then, the system is given by
{dNdt=1ϵ[N(1−N)(N−θ)11+fP−NP]dPdt=NP−mP |
At present, there are some studies on predator-prey systems with Flip bifurcation and Hopf bifurcation [21] in continuous models, where, however, the chaotic properties have not been mentioned. For example, Khan studied a discrete-time Nicholson-Bailey host-parasitoid model and obtained the local dynamics and supercritical Neimark-Sacker bifurcation in 2017 [22]. In 2019, Li et al. investigated the discrete time predator-prey model undergoing Flip and Neimark Sacker bifurcation using the center manifold theorem and bifurcation theory [23]. In 2022, Yu et al. gave a description of the bifurcations in theory for a symmetrically coupled period-doubling system, including the Transcritical bifurcation, Pitchfork bifurcation, Flip bifurcation and Neimark-Sacker bifurcation [24]. In 2022, Chen et al. studied a discrete predator-prey system with Allee effect, which undergoes Fold bifurcation and Flip bifurcation. They obtained cascades of period-doubling bifurcation in orbits of period-2, 4, 8 and chaotic properties [25].
Based on the above analysis and discussion, we obtain the following discrete-time model:
{Nn+1=Nn+h{1ϵ[Nn(1−Nn)(Nn−θ)11+fPn−NnPn]}Pn+1=Pn+h[NnPn−mPn] | (1.2) |
where h>0 refers to the step length of (1.2), 0<θ<1.
In this paper, we study the existence and stability of four equilibria of model (1.2) and focus on local dynamics of the unique positive equilibrium point in Section 2. In Sections 3 and 4, we study Flip bifurcation and Hopf bifurcation when bifurcation parameter h varies in a small neighborhood of the unique positive equilibrium point. In Section 5, we study chaos scenarios of Flip bifurcation. Meanwhile, some numerical simulations about bifurcations are given by maximum Lyapunov exponent and phase diagrams to verify our results. Finally, brief conclusions are given in Section 6.
Initially, the existence and stability of the equilibrium point of model (1.2) are analyzed.
By calculating model (1.2), obviously, the trivial equilibrium point E1=(0,0) and boundary equilibria E2=(1,0), E3=(θ,0) are obtained. Since the negative equilibrium point has no practical meaning in biology, the unique positive internal equilibrium point E4=(m,−1+√1+4f(1−m)(m−θ)2f) is chosen.
The Jacobi matrix of the linear system of (1.2) at any equilibrium point (N∗,P∗) is given by:
J=(1+hϵ[−3N2+2(1+θ)N−θ1+fP−P]hϵ[(N3−(1+θ)N2+θN)f(1+fP)2−N]hP1+hN−mh)|(N∗,P∗) |
Now, we give some dynamical properties of four equilibria.
Theorem 2.1. For the trivial equilibrium E1, with eigenvalues λ1=1−hθϵ and λ2=1−hm.
(i) E1 is a sink if 0<h<min{2ϵθ,2m}, with eigenvalues |λ1|<1 and |λ2|<1.
(ii) E1 is a source if h>max{2ϵθ,2m}, with eigenvalues |λ1|>1 and |λ2|>1.
(iii) E1 is a saddle point if 2ϵθ<h<2m with eigenvalues |λ1|>1 and |λ2|<1, or 2m<h<2ϵθ with eigenvalues |λ1|<1 and |λ2|>1.
(iv) Flip bifurcation occurs at E1 if h=2ϵθ<2m, with eigenvalues λ1=−1 and |λ2|<1, or h=2m<2ϵθ, with eigenvalues λ2=−1 and |λ1|<1.
Theorem 2.2. For the boundary equilibrium E2, with eigenvalues λ1=1+hϵ(θ−1) and λ2=1+h(1−m).
(i) E2 is a sink if {m>10<h<min(2ϵ1−θ,2m−1), with eigenvalues |λ1|<1 and |λ2|<1.
(ii) E2 is a source if {m<1h>2ϵ1−θ or {m>1h>max{2ϵ1−θ,2m−1}, with eigenvalues |λ1|>1 and |λ2|>1.
(iii) E2 is a saddle point if {m>12ϵ1−θ<h<2m−1 or {m>12m−1<h<2ϵ1−θ with eigenvalues |λ1|>1 and |λ2|<1, or {m<1h<2ϵ1−θ with eigenvalues |λ1|<1 and |λ2|>1.
(iv) Flip bifurcation occurs at E2 if {m>1h=2ϵ1−θ<2m−1 with eigenvalues λ1=−1 and |λ2|<1, or h=2m−1<2ϵ1−θ with eigenvalues λ2=−1 and |λ1|<1.
(v) Transcritical bifurcation occurs at E2 if {m=1h<2ϵ1−θ, with eigenvalues λ2=1 and |λ1|<1.
Theorem 2.3. For the equilibrium E3, with eigenvalues λ1=1+hϵθ(1−θ) and λ2=1+h(θ−m).
(i) E3 is a source if θ>m or {θ<mh>2m−θ, with eigenvalues |λ1|>1 and |λ2|>1.
(ii) E3 is a saddle point if {θ<m0<h<2m−θ, with eigenvalues |λ1|>1 and |λ2|<1.
There is no situation as |λ1|<1, i.e., stability does not exist.
Theorem 2.4. For the internal equilibrium E4,
(i) E4 is a sink if
{1+hϵ[m(1+θ−2m)1+√1+4f(1−m)(m−θ)]+h2ϵ[m(1−m)(m−θ)√1+4f(1−m)(m−θ)[1+√1+4f(1−m)(m−θ)]2]>0m(1−m)(m−θ)√1+4f(1−m)(m−θ)>01+θ−2m1+√1+4f(1−m)(m−θ)+h[2(1−m)(m−θ)√1+4f(1−m)(m−θ)[1+√1+4f(1−m)(m−θ)]2]<0 |
(ii) Transcritical bifurcation occurs at E4 if
{m=1 or m=θ−2ϵ<h[2m(1+θ−2m)1+√1+4f(1−m)(m−θ)]<0. |
(iii) Flip bifurcation occurs at E4 if
{1+hϵ[m(1+θ−2m)1+√1+4f(1−m)(m−θ)]+h2ϵ[m(1−m)(m−θ)√1+4f(1−m)(m−θ)[1+√1+4f(1−m)(m−θ)]2]=0−4<hϵ[m(1+θ−2m)1+√1+4f(1−m)(m−θ)]<−2. |
(iv) Hopf bifurcation occurs at E4 if
{h=(2m−θ−1)[1+√1+4f(1−m)(m−θ)]2(1−m)(m−θ)√1+4f(1−m)(m−θ)−4<hϵ[m(1+θ−2m)1+√1+4f(1−m)(m−θ)]<0. |
Proof. The Jacobi matrix of (1.2) at point E4=(N0,P0) is
J∣(N0,P0)=(1+hϵ[2m(1+θ−2m)1+√1+4f(1−m)(m−θ)] hϵ[−2m+√1+4f(1−m)(m−θ)1+√1+4f(1−m)(m−θ)]h(−1+√1+4f(1−m)(m−θ))2f 1) | (2.1) |
where n=1+√1+4f(1−m)(m−θ).
Meanwhile, the characteristic polynomial of J∣(N0,P0) is given by:
f(λ)=λ2−(A+1)λ+(A+BC)=0 | (2.2) |
where
A=1+hϵ[2m(1+θ−2m)1+√1+4f(1−m)(m−θ)], |
B=hϵ[−2m+√1+4f(1−m)(m−θ)1+√1+4f(1−m)(m−θ)],C=h(−1+√1+4f(1−m)(m−θ))2f. |
Then, eigenvalues of J∣(N0,P0) are λ1=A+1+√Δ2 and λ2=A+1−√Δ2, where Δ=(A−1)2−4BC.
(i) (N0,P0) is a sink, if |λ1|<1 and |λ2|<1. From the Jury Criterion [26], we obtain {1+(A+1)+(A+BC)>01−(A+1)+(A+BC)>01−(A+BC)>0.
(ii) If Δ>0, λ1=1 and |λ2|<1 or λ2=1 and |λ1|<1, then we have {BC=0|A|<1.
(iii) If Δ>0, λ1=−1 and |λ2|<1 or λ2=−1 and |λ1|<1, then we have {2A+BC+2=0|A+2|<1.
(iv) If Δ<0, |λ1|=|λ2|=1, which is a pair of conjugate complex roots, then we have {A+BC=10<|A+1|<2.
When λ1 and λ2 is a pair of conjugate complex roots, we assume λ1=a+bi and λ2=a−bi (a2+b2=1 b≠0), i.e., 0<|a|<1. Since (λ−λ1)(λ−λ2)=λ2−(λ1+λ2)λ+λ1λ2=0, obviously we have λ1+λ2=A+1=2a and λ1λ2=A+BC=1.
All of the expressions A,B,C can be brought into equations mentioned above to obtain the corresponding conclusions.
In this section, we discuss how system (1.2) undergoes Flip bifurcation around its internal equilibrium E4=(m,−1+√1+4f(1−m)(m−θ)2f) when h is chosen as bifurcation parameter. The necessary conditions for Flip bifurcation to occur is given by the following curve:
U={(m,n,θ,f,ϵ)∈R5+:h=h∗=2f(2m−1−θ)+2√f2(1+θ−2m)2+1m(n−1)(n−2)ϵfnm(n−1)(n−2) ,|D|<1} |
where D=hϵ(m(1+θ−2m)1+√1+4f(1−m)(m−θ))+3 and n=1+√1+4f(1−m)(m−θ).
The Jacobi matrix of the linear system of (1.2) at the equilibrium point (N0,P0) is given by:
J∣(N0,P0)=(1+hϵ[2m(1+θ−2m)n] hϵ[−2m(n−1)n]h(n−2)2f 1) | (3.1) |
where n=1+√1+4f(1−m)(m−θ).
In order to obtain the bifurcation properties, we consider translations ¯Nn+1=Nn+1−N0, ¯Pn+1=Pn+1−P0 for shifting (N0,P0) to the origin. Then, the model (1.2) is given by
{¯Nn+1=¯Nn+h{1ϵ[(¯Nn+N0)(1−¯Nn−N0)(¯Nn+N0−θ)11+f(¯Pn+P0)−(¯Nn+N0)(¯Pn+P0)]}¯Pn+1=¯Pn+h[(¯Nn+N0)(¯Pn+P0)−m(¯Pn+P0)] | (3.2) |
Using Taylor expansion at the point E4(N0,P0) yields the following expression :
(¯Nn+1¯Pn+1)=J∣(N0,P0)(¯Nn¯Pn)+h(1ϵψ1(¯Nn,¯Pn)ψ2(¯Nn,¯Pn)) | (3.3) |
where
ψ1(¯Nn,¯Pn)=b1¯Nn2+b2¯Nn¯Pn+b3¯Pn2+b4¯Nn3+b5¯Nn2¯Pn+b6¯Nn¯Pn2+b7¯Pn3+O((|¯Nn|+|¯Pn|)4),
ψ2(¯Nn,¯Pn)=¯Nn¯Pn,
b1=−3N0+1+θ1+fP0, b2=[3N20−2(1+θ)N0+θ]f(1+fP0)2−1, b3=[−N30+(1+θ)N20−θN0]f2(1+fP0)3, b4=−11+fP0, b5=(3N0−1−θ)f(1+fP0)2,
b6=[3N20−2(1+θ)N0+θ]f2(1+fP0)3, b7=[N30−(1+θ)N20+θN0]f3(1+fP0)4.
From the characteristic polynomial (2.2), we obtain f(−1)=h2ϵ[m(n−1)(n−2)fn]+hϵ[4m(1+θ−2m)n]+4.
Since step size h>0, the bifurcation parameter is chosen as
h∗=2f(2m−1−θ)+2√f2(1+θ−2m)2+1m(n−1)(n−2)ϵfnm(n−1)(n−2) |
where parameter m satisfies 1+θ2<m<1.
Consider parameter h with a small perturbation δ, i.e., h=h∗+δ, |δ|≪1, and the system (3.3) becomes
(¯Nn+1¯Pn+1)=(1+(h∗+δ)ϵ[2m(1+θ−2m)n](h∗+δ)ϵ[−2m(n−1)n](h∗+δ)(n−2)2f1)(¯Nn¯Pn)+(h∗+δ)(1ϵψ1(¯Nn,¯Pn)ψ2(¯Nn,¯Pn)) | (3.4) |
The characteristic polynomial of (3.4) is given by
g(λ)=λ2−[2+h∗+δϵ[2m(1+θ−2m)n]]λ+1+h∗+δϵ[2m(1+θ−2m)n]+(h∗+δ)2ϵ[m(n−1)(n−2)fn] |
The transversal condition at (N0,P0) is
dg(λ)dδ∣λ=−1,δ=0=−4−2mh∗(1+θ−2m)ϵn |
If dg(λ)dδ∣λ=−1,δ=0≠0, then Flip bifurcation will occur at E4.
To facilitate discussion, define A=(1+h∗ϵ[2m(1+θ−2m)n]h∗ϵ[−2m(n−1)n]h∗(n−2)2f1).
If the eigenvalue of A goes for λ=−1, the corresponding eigenvector is given as:
T1=(h∗ϵ[−2m(n−1)n]−2−h∗ϵ[2m(1+θ−2m)n]) |
If the eigenvalue of A goes for λ=λ2, the corresponding eigenvector is given as:
T2=(h∗ϵ[−2m(n−1)n]λ2−1−h∗ϵ[2m(1+θ−2m)n]) |
Then, we have the invertible matrix
T=(T1,T2)=(h∗ϵ[−2m(n−1)n]h∗ϵ[−2m(n−1)n]−2−h∗ϵ[2m(1+θ−2m)n] λ2−1−h∗ϵ[2m(1+θ−2m)n]) |
Using translation (xnyn)=T−1(¯Nn¯Pn), system (3.4) turns into
(xn+1yn+1)=(−100λ2)(xnyn)+(f1(¯Nn,¯Pn,δ)g1(¯Nn,¯Pn,δ)) | (3.5) |
where
f1(¯Nn,¯Pn,δ)=a11¯Nnδ+a12¯Pnδ+b11¯Nn2+b12¯Nn¯Pn+b13¯Pn2+b14¯Nn3+b15¯Nn2¯Pn+b16¯Nn¯Pn2+b17¯Pn3+c11¯Nn2δ+c12¯Nn¯Pnδ+c13¯Pn2δ+c14¯Nn3δ+c15¯Nn2¯Pnδ+c16¯Nn¯Pn2δ+c17¯Pn3δ |
g1(¯Nn,¯Pn,δ)=a21¯Nnδ+a22¯Pnδ+b21¯Nn2+b22¯Nn¯Pn+b23¯Pn2+b24¯Nn3+b25¯Nn2¯Pn+b26¯Nn¯Pn2+b27¯Pn3+c21¯Nn2δ+c22¯Nn¯Pnδ+c23¯Pn2δ+c24¯Nn3δ+c25¯Nn2¯Pnδ+c26¯Nn¯Pn2δ+c27¯Pn3δ |
a11=1h∗(λ2+1)[2m−1−θn−1](λ2−1−h∗ϵ[2m(1+θ−2m)n])−n−22f(λ2+1)a12=1h∗(λ2+1)(λ2−1−h∗ϵ[2m(1+θ−2m)n])a21=1h∗(λ2+1)[2m−1−θn−1](2+h∗ϵ[2m(1+θ−2m)n])+n−22f(λ2+1)a22=1h∗(λ2+1)(2+h∗ϵ[2m(1+θ−2m)n])b11=1λ2+1[n−2m(n−1)](λ2−1−h∗ϵ[2m(1+θ−2m)n])b1b12=1λ2+1[n−2m(n−1)](λ2−1−h∗ϵ[2m(1+θ−2m)n])b2−h∗λ2+1b13=1λ2+1[n−2m(n−1)](λ2−1−h∗ϵ[2m(1+θ−2m)n])b3⋮b17=1λ2+1[n−2m(n−1)](λ2−1−h∗ϵ[2m(1+θ−2m)n])b7cij=h∗bij(i=1,2 ; j=1,2,⋯,7) |
Using translation (¯Nn+1¯Pn+1)=T(xn+1yn+1), system (3.5) becomes
(xn+1yn+1)=(−xnλ2yn)+(f2(xn,yn,δ)g2(xn,yn,δ)) | (3.6) |
where
f2(xn,yn,δ)=d11xnδ+d12ynδ+e11x2n+e12xnyn+e13y2n+e14x3n+e15x2nyn+e16xny2n+e17y3n+f11x2nδ+f12xnynδ+f13y2nδ+f14x3nδ+f15x2nynδ+f16xny2nδ+f17y3nδ |
g2(xn,yn,δ)=d21xnδ+d22ynδ+e21x2n+e22xnyn+e23y2n+e24x3n+e25x2nyn+e26xny2n+e27y3n+f21x2nδ+f22xnynδ+f23y2nδ+f24x3nδ+f25x2nynδ+f26xny2nδ+f27y3nδ |
k11=k12=h∗ϵ[−2m(n−1)n], k21=−2−h∗ϵ[2m(1+θ−2m)n], k22=λ2−1−h∗ϵ[2m(1+θ−2m)n]
d11=a11k11+a12k21,d12=a11k12+a12k22,e11=b11k211+b12k11k21+b13k221,e12=2b11k11k12+b12(k11k22+k12k21)+2b13k21k22,e13=b11k212+b12k12k22+b13k222,e14=b14k311+b15k211k21+b16k11k221+b17k321,e15=3b14k211k12+b15(k211k22+2k11k12k21)+b16(2k11k21k22+k12k221)+3b17k221k22,e16=3b14k11k212+b15(2k11k12k22+k212k21)+b16(k11k222+2k12k21k22)+3b17k21k222,e17=b14k312+b15k212k22+b16k12k222+b17k322,d21=a21k11+a22k21,d22=a21k12+a22k22,e21=b21k211+b22k11k21+b23k221,e22=2b21k11k12+b22(k11k22+k12k21)+2b23k21k22,e23=b21k212+b22k12k22+b23k222,e24=b24k311+b25k211k21+b26k11k221+b27k321,e25=3b24k211k12+b25(k211k22+2k11k12k21)+b26(2k11k21k22+k12k221)+3b27k221k22,e26=3b24k11k212+b25(2k11k12k22+k212k21)+b26(k11k222+2k12k21k22)+3b27k21k222,e27=b24k312+b25k212k22+b26k12k222+b27k322,fij=heij(i=1,2 ; j=1,2,⋯,7). |
Next, by using the center manifold theorem and normal form theories, the direction of Flip bifurcation at E4 is given.
α1=(∂2f∂˜xnδ+12∂f∂δ∂2f∂˜x2n)∣(0,0),α2=(16∂3f∂˜x3n+(12∂2f∂˜x2n)2)∣(0,0), |
where the coefficients of α1 and α2 are derived from (3.6).
Theorem 3.1. If α1≠0, α2≠0, then the system undergoes Flip bifurcation at the immobile point (N0,P0), and if α2>0(<0), then the two-cycle point is stable (unstable).
For sufficiently small neighborhoods of the parameter δ=0, there exists a central manifold at (0,0):
Wc(0,0)={(˜x,˜y):˜yn+1=m1˜x2n+1+m2˜xn+1δ} | (3.7) |
Substituting (3.7) into (3.6), the solution is given as
m1=e211−λ2=b21k211+b22k11k21+b23k2211−λ2,m2=−d211+λ2=−(a21k11+a22k21) 1+λ2 |
Restricting the system of equations on Wc(0,0), the results are as follows.
˜xn+1=−˜xn+l1˜x2n+l2˜xnδ+l3˜x2nδ+l4˜xnδ2+l5˜x3n+O((|˜xn|+|δ|)4) |
where l1=e11=b11k211+b12k11k21+b13k221, l2=d11=a11k11+a12k21, l3=d12m1+f11+e12m2, l4=d12m2, l5=e12m1+e14.
According to the normal form theories related to bifurcation analysis, we require the following quantity at (x,y,δ)=(0,0,0).
α1=(∂2f∂˜xnδ+12∂f∂δ∂2f∂˜x2n)∣(0,0)=l2+l3,α2=(16∂3f∂˜x3n+(12∂2f∂˜x2n)2)∣(0,0)=l5+l21 |
For numerical simulations, we choose the following parameters to prove our theoretical discussion. The unique positive equilibrium point (N0,P0)≈(0.89,0.0708765) of the model can be obtained by giving the parameters h=0.1, e=0.023933614, θ=0.2, f=1, m=0.89. By choosing the initial value of (0.9,0.07115), the result can be obtained by numerical simulation as Figure 1.
It is obvious from the diagrams that variables N and P appear as two-point solutions with a period for a given parameter condition and gradually stabilize near the equilibrium point, which verifies Flip bifurcation occurs at this point.
In this section, we still choose h as the bifurcation parameter to discuss Hopf bifurcation around its positive equilibrium (N0,P0). The necessary conditions for Hopf bifurcation to occur is given by the following curve:
S={(m,n,θ,f,ϵ)∈R5+:h=h∗1=(2m−1−θ)[1+√1+4f(1−m)(m−θ)]2(1−m)(m−θ)√1+4f(1−m)(m−θ), |E|<2} |
where E=hϵ(m(1+θ−2m)1+√1+4f(1−m)(m−θ))+2.
For emergence of Hopf bifurcation around positive equilibrium (N0,P0), two roots of the characteristic polynomial (2.2) must be complex conjugate with unit modulus. Therefore, it is easy to obtain the bifurcation parameter h∗1=(2m−θ−1)(1+√1+4f(1−m)(m−θ))2(1−m)(m−θ)√1+4f(1−m)(m−θ)>0, i.e., 0<m<θ or 1+θ2<m<1.
We still consider parameter h with a small perturbation δ, and then characteristic equation (2.2) can be rewritten as:
λ2+p(δ)λ+q(δ)=0, |
where
p(δ)=−[2+(h∗1+δ)ϵ[2m(1+θ−2m)n]], |
q(δ)=1+(h∗1+δ)ϵ[2m(1+θ−2m)n]+(h∗1+δ)2ϵ[m(n−1)(n−2)fn] |
The roots of the characteristic equation of J∣(N0,P0) are
λ1=p(δ)+i√4q(δ)−p(δ)22 , λ2=p(δ)−i√4q(δ)−p(δ)22 |
Also,
|λ1,2|=√q(δ),d|λ1,2|dδ∣δ=0=[1−4f(1+θ−2m)2ϵn(n−1)(n−2)+2(2m−1−θ)ϵmn]−12(1+θ−2m)(m−2)ϵn |
where d|λ1,2|dδ∣δ=0>0 if and only if (1+θ−2m)(m−2)ϵn>0.
If p(0)≠0,1, we have −4f(2m−1−θ)2ϵn(n−1)(n−2)≠2,3, which means λn1,2≠1 n=1,2,3,4.
The transversal condition at (N0,P0) is given by
d|λ1|2dδ∣δ=0=(λ1dλ2dδ+λ2dλ1dδ)∣δ=0=m(1+θ−2m)ϵn[3+2mh∗1(1+θ−2m)ϵn]+mh∗1(n−1)(n−2)ϵfn |
If 1+θ2<m<1, we have d|λ1|2dδ∣δ=0>0. Then, Hopf bifurcation will occur at (N0,P0).
Now, let
α=1+h∗1ϵ[m(1+θ−2m)n],β=h∗1√m(n−1)(n−2)ϵfn−m2(1+θ−2m)2ϵ2n2 |
The invertible matrix T is given by
T=( hϵ[−2m(n−1)n]0 α−1−hϵ[2m(1+θ−2m)n]−β ) |
Using the following translation
(¯Nn+1¯Pn+1)=T(¯xn+1¯yn+1) |
Then, the Eq (3.4) transforms to
(¯xn+1¯yn+1)=(α−ββα)(ˉxnˉyn)+(f(ˉxn,ˉyn)g(ˉxn,ˉyn)) |
where
f(ˉxn,ˉyn)=l11ˉx2n+l12ˉxnˉyn+l13ˉy2n+l14ˉx3n+l15ˉxn2ˉyn+l16ˉxnˉy2n+l17ˉy3n,g(ˉxn,ˉyn)=l21ˉx2n+l22ˉxnˉyn+l23ˉy2n+l24ˉx3n+l25ˉxn2ˉyn+l26ˉxnˉy2n+l27ˉy3n,l11=b1α3+b2α2β+αβ2+b3αβ2,l12=−2b1α2β+b2α3+βα2−b2αβ2−β3+2b3α2β,l13=b1αβ2−b2α2β−αβ2+b3α3,l14=b4α4+b5α3β+b6α2β2+b7αβ3,l15=−3b4α3β+b5α4−2b5α2β2+2b6α3β−b6αβ3+3b7α2β2,l16=3b4α2β2+b5αβ3−2b5α3β+b6α4−2b6α2β2+3b7α3β,l17=−b4αβ3+b5α2β2−b6α3β+b7α4,l21=b1α2β+b2αβ2−α2β+b3β3,l22=−2b1αβ2+b2α2β−b2β3−α3+αβ2+2b3αβ2,l23=b1β3−b2αβ2+α2β+b3α2β,l24=b4α3β+b5α2β2+b6αβ3+b7β4,l25=−3b4α2β2+b5α3β−2b5αβ3+2b6α2β2−b6β4+3b7αβ3,l26=3b4αβ3+b5β4−2b5α2β2+b6α3β−2b6αβ3+3b7α2β2,l27=−b4β4+b5αβ3−b6α2β2+b7α3β |
Next, by using the center manifold theorem and normal form theories, the direction of Hopf bifurcation at E4 is given. According to the normal form theories related to bifurcation analysis, we require the following quantity at (x,y,δ)=(0,0,0).
L=−Re[(1−2λ)ˉλ21−λξ11ξ20]−12|ξ11|2−|ξ02|2+Re(ˉλξ21) |
where
ξ20=18[fˉxˉx+fˉyˉy+2gˉxˉy+i(gˉxˉx−gˉyˉy−2fˉxˉy)],ξ11=14[fˉxˉx+fˉyˉy+i(gˉxˉx+gˉyˉy)],ξ02=18[fˉxˉx−fˉyˉy+2gˉxˉy+i(gˉxˉx−gˉxˉy+2fˉxˉy)],ξ21=116[fˉxˉxˉx+fˉxˉyˉy+gˉxˉxˉy+gˉyˉyˉy+i(gˉxˉxˉx+gˉxˉyˉy−fˉxˉxˉy−fˉyˉyˉy)],fˉxˉx=2l11 , fˉxˉy=l12 , fˉxˉxˉx=6l14 , fˉxˉxˉy=2l15 , fˉxˉyˉy=2l16 , fˉyˉy=2l13 , fˉyˉyˉy=6l17,gˉxˉx=2l21 , gˉxˉy=l22 , gˉxˉxˉx=6l24 , gˉxˉxˉy=2l25 , gˉxˉyˉy=2l26 , gˉyˉy=2l23 , gˉyˉyˉy=6l27 . |
Theorem 4.1. If the above conditions hold, and L≠0, the Hopf bifurcation occurs at the point (N0,P0). When δ>0, if L<0, then it attracts at that point; when δ<0, if L>0, then it repels at that point.
To verify whether the condition is correct, we select the following parameters for numerical simulations and obtain the following conclusions. By selecting the first set of parameters h≈0.062163, e=1, θ=0.1, f=1, m=0.554, the unique positive equilibrium point (N0,P0)≈(0.554,0.004932) of the model can be obtained. By choosing the initial value K1=(0.5,0.005), the following results can be obtained by numerical simulation.
Figure 2 reflects that variable N gradually tends to oscillate steadily at the equilibrium point N=0.554 with the increase of the number of iterations n, while variable P also gradually oscillates steadily with the increase of the number of iterations N, but the equilibrium point is attracted to P≈0.157.
By choosing the second set of parameters h≈1.120901, e=1, θ=0.61, f=1, m=0.823 the only internal equilibrium point (N0,P0)≈(0.823,0.020442) of the model can be obtained. Choosing the initial value K2=(0.8,0.02), the following results can be obtained by numerical simulation.
Figure 3 shows that as the number of iterations n increases, eventually, the variable P will also be attracted to stabilize at P≈0.035.
In this section, chaotic cases at bifurcating points are analyzed using numerical simulations. We give maximum Lyapunov exponents and phase diagrams for different perturbation parameters to prove our results. The chaos theory analysis of Flip bifurcation and Hopf bifurcation is given as follows.
Definition 5.1. [27] The formula for the maximum Lyapunov index is given by
λ=limn→∞1nn−1∑n=0ln|df(xn,μ)dx| |
Theorem 5.1. [27] If λ<0, the neighboring points eventually come together and merge into a single point, which corresponds to stable immobile points and periodic motion. If λ>0, the neighboring points eventually separate, which corresponds to local instability of the orbit generating chaotic situations.
In the following, we choose two different equilibria to consider the Flip bifurcation with chaotic cases. Initially, we select the parameters h=0.95, e≈0.1841359, θ=0.5, f=1, m=0.961, and obviously the model comes to
{Nn+1=Nn+0.95{10.1841359[Nn(1−Nn)(Nn−0.5)11+Pn−NnPn]}Pn+1=Pn+0.95[NnPn−0.961Pn] |
where the internal equilibrium point is (N1,P1)≈(0.961,0.01807).
After selecting the perturbation δ∈(0,0.2) and analyzing the trend of N with δ by numerical simulation, we obtain the chaotic bifurcating cases (see Figure 4).
Next, choosing the parameters h=0.95, e≈0.184136, θ=0.5, f=1, m=0.9601, we obtain the model
{Nn+1=Nn+0.95{10.184136[Nn(1−Nn)(Nn−0.5)11+Pn−NnPn]}Pn+1=Pn+0.95[NnPn−0.9601Pn] |
Obviously, the internal equilibrium point (N2,P2)≈(0.9601,0.0180734). We still choose the perturbation δ∈(0,0.2) to analyze the trend of N with δ. The chaotic bifurcating case is obtained (see Figure 5). By calculating the bifurcating diagrams and the maximum Lyapunov exponent for two bifurcating points with small differences, it can be shown that the small change of the initial value near the equilibrium point has a great influence on the stability of the initial state. Although they are different perturbed bifurcating cases, the two cases tend to go the same during the process of δ gradually increasing.
In the following, we choose two different equilibria to consider Hopf bifurcation with chaotic cases. By picking the first set of parameters h≈0.062163, e=1, θ=0.1, f=1, m=0.554, the unique internal equilibrium point (N3,P3)≈(0.554,0.004932) of the model can be obtained.
After choosing perturbation δ∈(0,0.5), we obtain phase diagrams (see Figure 6).
The analysis mentioned above shows that with the perturbation δ increasing, the asymptotic stability of variable N gradually becomes weaker, and the range of periodic solutions gradually becomes larger, but the convergence speed comes faster increases (see Figure 6).
By choosing the second set of parameters h≈1.120901, e=1, θ=0.61, f=1, m=0.823, we can obtain the unique internal equilibrium point (N4,P4)≈(0.823,0.020442) of the model.
After choosing perturbation δ∈(−1,1), we obtain phase diagrams (see Figure 7).
Our work deals with the study of local dynamical properties of a predator-prey model with discrete time (1.2), Flip bifurcation and Hopf bifurcation associated with the periodic solution, as well as their chaotic cases. We prove that the system (1.2) has four unique equilibria. In addition, their stability and instability conditions are given, which mark the final equilibrium state of both groups as fear, climate and other factors change. We focus on the unique positive equilibrium point E4=(m,−1+√1+4f(1−m)(m−θ)2f), with stability condition:
{1+hϵ[m(1+θ−2m)1+√1+4f(1−m)(m−θ)]+h2ϵ[m(1−m)(m−θ)√1+4f(1−m)(m−θ)[1+√1+4f(1−m)(m−θ)]2]>0 m(1−m)(m−θ)√1+4f(1−m)(m−θ)>01+θ−2m1+√1+4f(1−m)(m−θ)+h[2(1−m)(m−θ)√1+4f(1−m)(m−θ)[1+√1+4f(1−m)(m−θ)]2]<0 |
Significantly, after analyzing the formation conditions of Flip bifurcation and Hopf bifurcation at (N0,P0), we give their chaotic scenarios from both theoretical and numerical simulations. Moreover, it is found that Flip bifurcation is more prone to chaos scenarios, and Hopf bifurcation is closely related to periodic solutions.
Biologically, the occurrence of Flip bifurcation implies the number of predators and prey will alternate around a value instead of converging to a fixed value, eventually. The corresponding chaotic scenario suggests that small perturbations in the variable parameters will eventually have a significant impact on the population, ultimately leading to chaos. The appearance of Hopf bifurcation points indicates that the equilibrium point of the system loses its attraction and eventually produces a closed orbit, which implies the existence of periodic oscillations of predators and prey. Therefore, we can precisely change the biological density of predators and prey to achieve the desired goal by regulating the number of bifurcation parameters h, for the fact that the chaotic scenario does not exist. All the conclusions illustrate the effect of fear on populations. Finally, the accuracy of the theory is demonstrated using the maximum Lyapunov exponent and phase diagrams.
In future work, the model can be investigated using different discrete methods. In addition, to obtain specific biological properties, new bifurcation parameters can be selected for the study to obtain the desired conclusions.
The authors declare that they have no competing interests.
[1] |
N. Pazhaniraja, S. Basheer, K. Thirugnanasambandam, R. Ramalingam, M. Rashid, J. Kalaivani, Multi-objective Boolean grey wolf optimization based decomposition algorithm for high-frequency and high-utility itemset mining, AIMS Mathematics, 8 (2023), 18111–18140. https://doi.org/10.3934/math.2023920 doi: 10.3934/math.2023920
![]() |
[2] |
M. Sohrabi, M. Zandieh, M. Shokouhifar, Sustainable inventory management in blood banks considering health equity using a combined metaheuristic-based robust fuzzy stochastic programming, Socio-Econ. Plan. Sci., 86 (2023), 101462. https://doi.org/10.1016/j.seps.2022.101462 doi: 10.1016/j.seps.2022.101462
![]() |
[3] |
N. Behmanesh-Fard, H. Yazdanjouei, M. Shokouhifar, F. Werner, Mathematical Circuit Root Simplification Using an Ensemble Heuristic–Metaheuristic Algorithm, Mathematics, 11 (2023), 1498. https://doi.org/10.3390/math11061498 doi: 10.3390/math11061498
![]() |
[4] |
A. Shokouhifar, M. Shokouhifar, M. Sabbaghian, H. Soltanian-Zadeh, Swarm intelligence empowered three-stage ensemble deep learning for arm volume measurement in patients with lymphedema, Biomed. Signal Process. Control., 85 (2023), 105027. https://doi.org/10.1016/j.bspc.2023.105027 doi: 10.1016/j.bspc.2023.105027
![]() |
[5] |
H. Esmaeili, V. Hakami, B. M. Bidgoli, M. Shokouhifar, Application-specific clustering in wireless sensor networks using combined fuzzy firefly algorithm and random forest, Expert Syst. Appl., 210 (2022), 118365. https://doi.org/10.1016/j.eswa.2022.118365 doi: 10.1016/j.eswa.2022.118365
![]() |
[6] |
D. H. Wolpert, W. G. Macready, No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1 (1997), 67–82. https://doi.org/10.1109/4235.585893 doi: 10.1109/4235.585893
![]() |
[7] |
M. Shokouhifar, FH-ACO: Fuzzy heuristic-based ant colony optimization for joint virtual network function placement and routing, Appl. Soft Comput., 107 (2021), 107401. https://doi.org/10.1016/j.asoc.2021.107401 doi: 10.1016/j.asoc.2021.107401
![]() |
[8] |
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
![]() |
[9] |
D. Simon, Biogeography-based optimization, IEEE Trans. Evol. Comput., 12 (2008), 702–713. https://doi.org/10.1109/TEVC.2008.919004 doi: 10.1109/TEVC.2008.919004
![]() |
[10] |
V. Garg, K. Deep, Performance of Laplacian Biogeography-Based Optimization Algorithm on CEC 2014 continuous optimization benchmarks and camera calibration problem, Swarm Evol. Comput., 27 (2016), 132–144. https://doi.org/10.1016/j.swevo.2015.10.006 doi: 10.1016/j.swevo.2015.10.006
![]() |
[11] |
J. Wang, W. Yang, P. Du, T. Niu, A novel hybrid forecasting system of wind speed based on a newly developed multi-objective sine cosine algorithm, Energy Convers. Manag., 163 (2018), 134–150. https://doi.org/10.1016/j.enconman.2018.02.012 doi: 10.1016/j.enconman.2018.02.012
![]() |
[12] |
M. A. Tawhid, V. Savsani, Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems, Neural Comput. Appl., 31 (2019), 915–929. https://doi.org/10.1007/s00521-017-3049-x doi: 10.1007/s00521-017-3049-x
![]() |
[13] |
K. S. Reddy, L. K. Panwar, B. K. Panigrahi, R. Kumar, A new binary variant of sine–cosine algorithm: development and application to solve profit-based unit commitment problem, Arab. J. Sci. Eng., 43 (2018), 4041–4056. https://doi.org/10.1007/s13369-017-2790-x doi: 10.1007/s13369-017-2790-x
![]() |
[14] |
S. Gupta, K. Deep, A. P. Engelbrecht, A memory guided sine cosine algorithm for global optimization, Eng. Appl. Artif. Intell., 93 (2020), 103718. https://doi.org/10.1016/j.engappai.2020.103718 doi: 10.1016/j.engappai.2020.103718
![]() |
[15] |
A. Selim, S. Kamel, F. Jurado, Efficient optimization technique for multiple DG allocation in distribution networks, Appl. Soft Comput., 86 (2020), 105938. https://doi.org/10.1016/j.asoc.2019.105938 doi: 10.1016/j.asoc.2019.105938
![]() |
[16] | S. Hota, A. K. Mohanty, D. Mishra, P. Satapathy, B. Jena, Designing of Financial Time Series Forecasting Model Using Stochastic Algorithm Based Extreme Learning Machine, In: Intelligent and Cloud Computing, Singapore: Springer, 2022,363–369. https://doi.org/10.1007/978-981-16-9873-6_33 |
[17] |
R. Sindhu, R. Ngadiran, Y. M. Yacob, N. A. H. Zahri, M. Hariharan, Sine–cosine algorithm for feature selection with elitism strategy and new updating mechanism, Neural Comput. Appl., 28 (2017), 2947–2958. https://doi.org/10.1007/s00521-017-2837-7 doi: 10.1007/s00521-017-2837-7
![]() |
[18] |
W. Zhu, C. Ma, X. Zhao, M. Wang, A. A. Heidari, H. Chen, et al., Evaluation of sino foreign cooperative education project using orthogonal sine cosine optimized kernel extreme learning machine, IEEE Access, 8 (2020), 61107–61123. https://doi.org/10.1109/ACCESS.2020.2981968 doi: 10.1109/ACCESS.2020.2981968
![]() |
[19] |
S. Gupta, K. Deep, A hybrid self-adaptive sine cosine algorithm with opposition based learning, Expert Syst. Appl., 119 (2019), 210–230. https://doi.org/10.1016/j.eswa.2018.10.050 doi: 10.1016/j.eswa.2018.10.050
![]() |
[20] | M. A. El-Shorbagy, M. A. Farag, A. A. Mousa, I. M. El-Desoky, A hybridization of sine cosine algorithm with steady state genetic algorithm for engineering design problems, In: The International Conference on Advanced Machine Learning Technologies and Applications, Cham: Springer, 2020,143–155. https://doi.org/10.1007/978-3-030-14118-9_15 |
[21] |
H. Chen, S. Jiao, A. A. Heidari, M. Wang, X. Chen, X. Zhao, An opposition-based sine cosine approach with local search for parameter estimation of photovoltaic models, Energy Convers. Manag., 195 (2019), 927–942. https://doi.org/10.1016/j.enconman.2019.05.057 doi: 10.1016/j.enconman.2019.05.057
![]() |
[22] |
N. Singh, S. B. Singh, A novel hybrid GWO-SCA approach for optimization problems, Eng. Sci. Technol. Int. J., 20 (2017), 1586–1601. https://doi.org/10.1016/j.jestch.2017.11.001 doi: 10.1016/j.jestch.2017.11.001
![]() |
[23] |
Y. Fan, P. Wang, A. A. Heidari, M. Wang, X. Zhao, H. Chen, et al., Rationalized fruit fly optimization with sine cosine algorithm: A comprehensive analysis, Expert Syst. Appl., 157 (2020), 113486. https://doi.org/10.1016/j.eswa.2020.113486 doi: 10.1016/j.eswa.2020.113486
![]() |
[24] |
N. Kumar, I. Hussain, B. Singh, B. K. Panigrahi, Single sensor-based MPPT of partially shaded PV system for battery charging by using cauchy and gaussian sine cosine optimization, IEEE Trans. Energy Convers., 32 (2017), 983–992. https://doi.org/10.1109/TEC.2017.2669518 doi: 10.1109/TEC.2017.2669518
![]() |
[25] | S. Bureerat, N. Pholdee, Adaptive sine cosine algorithm integrated with differential evolution for structural damage detection, In: Computational Science and Its Applications–ICCSA 2017, Cham: Springer, 2017, 71–86. https://doi.org/10.1007/978-3-319-62392-4_6 |
[26] |
V. Garg, K. Deep, N. P. Padhee, Constrained laplacian biogeography-based optimization for economic load dispatch problems, Process Integr. Optim. Sustain., 6 (2022), 483–496. https://doi.org/10.1007/s41660-022-00227-5 doi: 10.1007/s41660-022-00227-5
![]() |
[27] |
M. Banerjee, V. Garg, K. Deep, Solving structural and reliability optimization problems using efficient mutation strategies embedded in sine cosine algorithm, Int. J. Syst. Assur. Eng. Manag., 14 (2023), 307–312. https://doi.org/10.1007/s13198-023-01857-9 doi: 10.1007/s13198-023-01857-9
![]() |
[28] |
M. Issa, A. E. Hassanien, D. Oliva, A. Helmi, I. Ziedan, A. Alzohairy, ASCA-PSO: Adaptive sine cosine optimization algorithm integrated with particle swarm for pairwise local sequence alignment, Expert Syst. Appl., 99 (2018), 56–70. https://doi.org/10.1016/j.eswa.2018.01.019 doi: 10.1016/j.eswa.2018.01.019
![]() |
[29] |
A. F. Attia, R. A. El Sehiemy, H. M. Hasanien, Optimal power flow solution in power systems using a novel Sine-Cosine algorithm, Int. J. Electr. Power Energy Syst., 99 (2018), 331–343. https://doi.org/10.1016/j.ijepes.2018.01.024 doi: 10.1016/j.ijepes.2018.01.024
![]() |
[30] |
S. Das, A. Bhattacharya, A. K. Chakraborty, Solution of short-term hydrothermal scheduling using sine cosine algorithm, Soft Comput., 22 (2018), 6409–6427. https://doi.org/10.1007/s00500-017-2695-3 doi: 10.1007/s00500-017-2695-3
![]() |
[31] |
O. E. Turgut, Thermal and economical optimization of a shell and tube evaporator using hybrid backtracking search—sine–cosine algorithm, Arab. J. Sci. Eng., 42 (2017), 2105–2123. https://doi.org/10.1007/s13369-017-2458-6 doi: 10.1007/s13369-017-2458-6
![]() |
[32] |
M. Abd Elaziz, D. Oliva, S. Xiong, An improved opposition-based sine cosine algorithm for global optimization, Expert Syst. Appl., 90 (2017), 484–500. https://doi.org/10.1016/j.eswa.2017.07.043 doi: 10.1016/j.eswa.2017.07.043
![]() |
[33] |
V. Garg, K. Deep, K. A. Alnowibet, H. M. Zawbaa, A. W. Mohamed, Biogeography Based optimization with Salp Swarm optimizer inspired operator for solving non-linear continuous optimization problems, Alex. Eng. J., 73 (2023), 321–341. https://doi.org/10.1016/j.aej.2023.04.054 doi: 10.1016/j.aej.2023.04.054
![]() |
[34] | V. Garg, K. Deep, A state-of-the-art review of biogeography-based optimization, In: Proceedings of Fourth International Conference on Soft Computing for Problem Solving, New Delhi: Springer, 2015,533–549. https://doi.org/10.1007/978-81-322-2220-0_44 |
[35] | V. Garg, K. Deep, Effectiveness of constrained laplacian biogeography based optimization for solving structural engineering design problems, In: Proceedings of Sixth International Conference on Soft Computing for Problem Solving, Singapore: Springer, 2016,206–219. https://doi.org/10.1007/978-981-10-3325-4_21 |
[36] |
S. Yin, Q. Luo, Y. Zhou, IBMSMA: An Indicator-based Multi-swarm Slime Mould Algorithm for Multi-objective Truss Optimization Problems, J. Bionic Eng., 20 (2023), 1333–1360. https://doi.org/10.1007/s42235-022-00307-9 doi: 10.1007/s42235-022-00307-9
![]() |
[37] |
Y. Zhang, Y. Zhou, G. Zhou, Q. Luo, An effective multi-objective bald eagle search algorithm for solving engineering design problems, Appl. Soft Comput., 145 (2023), 110585. https://doi.org/10.1016/j.asoc.2023.110585 doi: 10.1016/j.asoc.2023.110585
![]() |
[38] |
Q. Luo, S. Yin, G. Zhou, W. Meng, Y. Zhao, Y. Zhou, Multi-objective equilibrium optimizer slime mould algorithm and its application in solving engineering problems, Struct. Multidiscip. Optim., 66 (2023), 114. https://doi.org/10.1007/s00158-023-03568-y doi: 10.1007/s00158-023-03568-y
![]() |
[39] |
A. Özmen, Y. Zinchenko, G. W. Weber, Robust multivariate adaptive regression splines under cross-polytope uncertainty: An application in a natural gas market, Ann. Oper. Res., 324 (2023), 1337–1367. https://doi.org/10.1007/s10479-022-04993-w doi: 10.1007/s10479-022-04993-w
![]() |
[40] |
E. Kropat, G. W. Weber, E. B. Tirkolaee, Foundations of semialgebraic gebe-environment networks, J. Dyn. Games, 7 (2020), 253. https://doi.org/10.3934/jdg.2020018 doi: 10.3934/jdg.2020018
![]() |
[41] |
M. Shokouhifar, A. Jalali, Optimized sugeno fuzzy clustering algorithm for wireless sensor networks, Eng. Appl. Artif. Intell., 60 (2017), 16–25. https://doi.org/10.1016/j.engappai.2017.01.007 doi: 10.1016/j.engappai.2017.01.007
![]() |
[42] |
M. Shokouhifar, M. Ranjbarimesan, Multivariate time-series blood donation/demand forecasting for resilient supply chain management during COVID-19 pandemic, Clean. Logist. Supply Chain., 5 (2022), 100078. https://doi.org/10.1016/j.clscn.2022.100078 doi: 10.1016/j.clscn.2022.100078
![]() |
[43] |
P. Aryai, A. Khademzadeh, S. J. Jassbi, M. Hosseinzadeh, O. Hashemzadeh, M. Shokouhifar, Real-time health monitoring in WBANs using hybrid Metaheuristic-Driven Machine Learning Routing Protocol (MDML-RP), AEU-Int. J. Electron. Commun., 168 (2023), 154723. https://doi.org/10.1016/j.aeue.2023.154723 doi: 10.1016/j.aeue.2023.154723
![]() |
[44] |
Z. Ghasemi Darehnaei, M. Shokouhifar, H. Yazdanjouei, S. M. J. Rastegar Fatemi, SI‐EDTL: swarm intelligence ensemble deep transfer learning for multiple vehicle detection in UAV images, Concurr. Comput. Pract. Exper., 34 (2022), e6726. https://doi.org/10.1002/cpe.6726 doi: 10.1002/cpe.6726
![]() |
[45] |
A. Çevik, G. W. Weber, B. M. Eyüboğlu, K. K. Oğuz, Alzheimer's Disease Neuroimaging Initiative, Voxel-MARS: A method for early detection of Alzheimer's disease by classification of structural brain MRI, Ann. Oper. Res., 258 (2017), 31–57. https://doi.org/10.1007/s10479-017-2405-7 doi: 10.1007/s10479-017-2405-7
![]() |
[46] |
E. Savku, G. W. Weber, Stochastic differential games for optimal investment problems in a Markov regime-switching jump-diffusion market, Ann. Oper. Res., 312 (2022), 1171–1196. https://doi.org/10.1007/s10479-020-03768-5 doi: 10.1007/s10479-020-03768-5
![]() |
[47] |
M. Shokouhifar, M. Sohrabi, M. Rabbani, S. M. H. Molana, F. Werner, Sustainable Phosphorus Fertilizer Supply Chain Management to Improve Crop Yield and P Use Efficiency Using an Ensemble Heuristic–Metaheuristic Optimization Algorithm, Agronomy, 13 (2023), 565. https://doi.org/10.3390/agronomy13020565 doi: 10.3390/agronomy13020565
![]() |
[48] |
P. Taylan, F. Yerlikaya-Özkurt, B. Bilgic Ucak, G. W. Weber, A new outlier detection method based on convex optimization: Application to diagnosis of Parkinson's disease, J. Appl. Stat., 48 (2021), 2421–2440. https://doi.org/10.1080/02664763.2020.1864815 doi: 10.1080/02664763.2020.1864815
![]() |
[49] |
M. Shokouhifar, A. Goli, Designing a Resilient–Sustainable Supply Chain Network of Age-Differentiated Blood Platelets Using Vertical–Horizontal Transshipment and Grey Wolf Optimizer, Int. J. Environ. Res. Public Health., 20 (2023), 4078. https://doi.org/10.3390/ijerph20054078 doi: 10.3390/ijerph20054078
![]() |
[50] |
S. K. Das, F. Y. Vincent, S. K. Roy, G. W. Weber, Location-allocation problem for green efficient two-stage vehicle-based logistics system: A type-2 neutrosophic multi-objective modeling approach, Expert Syst. Appl., 238 (2023), 122174. https://doi.org/10.1016/j.eswa.2023.122174 doi: 10.1016/j.eswa.2023.122174
![]() |
1. | Qiang Zhao, Chao Zhang, Jingjing Wu, Xiuli Wang, Robust and efficient estimation for nonlinear model based on composite quantile regression with missing covariates, 2022, 7, 2473-6988, 8127, 10.3934/math.2022452 | |
2. | Asifa Tassaddiq, Abdulrahman Alruban, Ming-Sheng Liu, On Modifications of the Gamma Function by Using Mittag-Leffler Function, 2021, 2021, 2314-4785, 1, 10.1155/2021/9991762 | |
3. | Emrah Altun, A new two-parameter discrete poisson-generalized Lindley distribution with properties and applications to healthcare data sets, 2021, 36, 0943-4062, 2841, 10.1007/s00180-021-01097-0 | |
4. | Mahmoud El-Morshedy, Adel A. El-Faheem, Afrah Al-Bossly, Mohamed El-Dawoody, Exponentiated Generalized Inverted Gompertz Distribution: Properties and Estimation Methods with Applications to Symmetric and Asymmetric Data, 2021, 13, 2073-8994, 1868, 10.3390/sym13101868 | |
5. | Mohamed S. Eliwa, Fahad Sameer Alshammari, Khadijah M. Abualnaja, Mahmoud El-Morshedy, A Flexible Extension to an Extreme Distribution, 2021, 13, 2073-8994, 745, 10.3390/sym13050745 | |
6. | Mashael A. Alshehri, Mohamed Kayid, A Modified Gamma Model: Properties, Estimation, and Applications, 2023, 12, 2075-1680, 262, 10.3390/axioms12030262 | |
7. | Emrah Altun, Gökçen Altun, The Maxwell-Boltzmann-Exponential distribution with regression model, 2024, 74, 0139-9918, 1011, 10.1515/ms-2024-0074 | |
8. | Nasir Saleem, Atif Akbar, Ateeq Ur Rehman Irshad, Burhanettin Ozdemir, Javaria Ahmad khan, Ljubisa Kocinac, Influence Diagnostics in Gamma‐Pareto Regression Model With Cook’s Distance for Standardized and Adjusted Pearson, Deviance, and Likelihood Residuals: Simulation and Application, 2025, 2025, 2314-4629, 10.1155/jom/3440237 | |
9. | Qiang Zhao, Wenqing Wu, Yali Chen, Qi Wang, Qingfan Song, Comprehensive risk assessment of drought disasters from the perspective of multi-source geospatial big data: evidence from China's grain production bases, 2025, 16, 2040-2244, 995, 10.2166/wcc.2025.626 |