
Marine Predators algorithm (MPA) is a newly proposed nature-inspired metaheuristic algorithm. The main inspiration of this algorithm is based on the extensive foraging strategies of marine organisms, namely Lévy movement and Brownian movement, both of which are based on random strategies. In this paper, we combine the marine predator algorithm with Teaching-learning-based optimization algorithm, and propose a hybrid algorithm called Teaching-learning-based Marine Predator algorithm (TLMPA). Teaching-learning-based optimization (TLBO) algorithm consists of two phases: the teacher phase and the learner phase. Combining these two phases with the original MPA enables the predators to obtain prey information for foraging by learning from teachers and interactive learning, thus greatly increasing the encounter rate between predators and prey. In addition, effective mutation and crossover strategies were added to increase the diversity of predators and effectively avoid premature convergence. For performance evaluation TLMPA algorithm, it has been applied to IEEE CEC-2017 benchmark functions and four engineering design problems. The experimental results show that among the proposed TLMPA algorithm has the best comprehensive performance and has more outstanding performance than other the state-of-the-art metaheuristic algorithms in terms of the performance measures.
Citation: Keyu Zhong, Qifang Luo, Yongquan Zhou, Ming Jiang. TLMPA: Teaching-learning-based Marine Predators algorithm[J]. AIMS Mathematics, 2021, 6(2): 1395-1442. doi: 10.3934/math.2021087
[1] | Ning Cui, Junhong Li . A new 4D hyperchaotic system and its control. AIMS Mathematics, 2023, 8(1): 905-923. doi: 10.3934/math.2023044 |
[2] | Junhong Li, Ning Cui . Dynamical behavior and control of a new hyperchaotic Hamiltonian system. AIMS Mathematics, 2022, 7(4): 5117-5132. doi: 10.3934/math.2022285 |
[3] | Figen Kangalgil, Seval Isșık . Effect of immigration in a predator-prey system: Stability, bifurcation and chaos. AIMS Mathematics, 2022, 7(8): 14354-14375. doi: 10.3934/math.2022791 |
[4] | Sukono, Siti Hadiaty Yuningsih, Endang Rusyaman, Sundarapandian Vaidyanathan, Aceng Sambas . Investigation of chaos behavior and integral sliding mode control on financial risk model. AIMS Mathematics, 2022, 7(10): 18377-18392. doi: 10.3934/math.20221012 |
[5] | Minghung Lin, Yiyou Hou, Maryam A. Al-Towailb, Hassan Saberi-Nik . The global attractive sets and synchronization of a fractional-order complex dynamical system. AIMS Mathematics, 2023, 8(2): 3523-3541. doi: 10.3934/math.2023179 |
[6] | Binhao Hong, Chunrui Zhang . Bifurcations and chaotic behavior of a predator-prey model with discrete time. AIMS Mathematics, 2023, 8(6): 13390-13410. doi: 10.3934/math.2023678 |
[7] | Wei Li, Qingkai Xu, Xingjian Wang, Chunrui Zhang . Dynamics analysis of spatiotemporal discrete predator-prey model based on coupled map lattices. AIMS Mathematics, 2025, 10(1): 1248-1299. doi: 10.3934/math.2025059 |
[8] | A. E. Matouk . Chaos and hidden chaos in a 4D dynamical system using the fractal-fractional operators. AIMS Mathematics, 2025, 10(3): 6233-6257. doi: 10.3934/math.2025284 |
[9] | Xiaoyan Hu, Bo Sang, Ning Wang . The chaotic mechanisms in some jerk systems. AIMS Mathematics, 2022, 7(9): 15714-15740. doi: 10.3934/math.2022861 |
[10] | Zhao Li, Shan Zhao . Bifurcation, chaotic behavior and solitary wave solutions for the Akbota equation. AIMS Mathematics, 2024, 9(8): 22590-22601. doi: 10.3934/math.20241100 |
Marine Predators algorithm (MPA) is a newly proposed nature-inspired metaheuristic algorithm. The main inspiration of this algorithm is based on the extensive foraging strategies of marine organisms, namely Lévy movement and Brownian movement, both of which are based on random strategies. In this paper, we combine the marine predator algorithm with Teaching-learning-based optimization algorithm, and propose a hybrid algorithm called Teaching-learning-based Marine Predator algorithm (TLMPA). Teaching-learning-based optimization (TLBO) algorithm consists of two phases: the teacher phase and the learner phase. Combining these two phases with the original MPA enables the predators to obtain prey information for foraging by learning from teachers and interactive learning, thus greatly increasing the encounter rate between predators and prey. In addition, effective mutation and crossover strategies were added to increase the diversity of predators and effectively avoid premature convergence. For performance evaluation TLMPA algorithm, it has been applied to IEEE CEC-2017 benchmark functions and four engineering design problems. The experimental results show that among the proposed TLMPA algorithm has the best comprehensive performance and has more outstanding performance than other the state-of-the-art metaheuristic algorithms in terms of the performance measures.
The concept of the hyperchaos was first put forward by Rössler [1] in 1979. Any system with at least two positive Lyapunov exponents is defined as hyperchaotic. Compared to chaotic attractors, hyperchaotic attractors have more complicated dynamical phenomena and stronger randomness and unpredictability. Hyperchaotic systems have aroused wide interest from more and more researchers in the last decades. A number of papers have investigated various aspects of hyperchaos and many valuable results have been obtained. For instance, in applications, in order to improve the security of the cellular neural network system, the chaotic degree of the system can be enhanced by designing 5D memristive hyperchaotic system [2]. For higher computational security, a new 4D hyperchaotic cryptosystem was constructed by adding a new state to the Lorenz system and well used in the AMr-WB G.722.2 codec to fully and partially encrypt the speech codec [3]. In fact, hyperchaos has a wide range applications such as image encryption [4], Hopfield neural network [5] and secure communication [6] and other fields [7,8]. Meanwhile, there are many hyperchaotic systems have been presented so far. Aimin Chen and his cooperators constructed a 4D hyperchaotic system by adding a state feedback controller to Lü system [9]. Based on Chen system, Z. Yan presented a new 4D hyperchaotic system by introducing a state feedback controller [10]. By adding a controlled variable, Gao et al. introduced a new 4D hyperchaotic Lorenz system [11]. Likewise, researchers also formulated 5D Shimizu-Morioka-type hyperchaotic system [12], 5D hyperjerk hypercaotic system [13] and 4D T hyperchaotic system [14] and so on.
In [15], a chaotic Rabinovich system was introduced
{˙x=hy−ax+yz,˙y=hx−by−xz,˙z=−cz+xy, | (1.1) |
where (x,y,z)T∈R3 is the state vector. When (h,a,b,c)=(0.04,1.5,−0.3,1.67), (1.1) has chaotic attractor[15,16]. System (1.1) has similar properties to Lorenz system, the two systems can be considered as special cases of generalized Lorenz system in [17]. Liu and his cooperators formulated a new 4D hyperchaotic Rabinovich system by adding a linear controller to the 3D Rabinovich system [18]. The circuit implementation and the finite-time synchronization for the 4D hyperchaotic Rabinovich system was also studied in [19]. Reference [20] formulated a 4D hyperchaotic Rabinovich system and the dynamical behaviors were studied such as the hidden attractors, multiple limit cycles and boundedness. Based on the 3D chaotic Rabinovich system, Tong et al. presented a new 4D hyperchaotic system by introducing new state variable [21]. The hyperchaos can be generated by adding variables to a chaotic system, which has been verificated by scholars [3,9,10,11,14]. In [18,19,20,21], the hyperchaotic systems were presented by adding a variable to the second equation of system (1.1). In fact, hyperchaos can also be generated by adding a linear controller to the first equation and second equation of system (1.1). Based on it, the following hyperchaotic system is obtained
{˙x=hy−ax+yz+k0u,˙y=hx−by−xz+mu,˙z=−dz+xy,˙u=−kx−ky, | (1.2) |
where k0,h,a,b,d,k,k0,m are positive parameters. Like most hyperchaotic studies (see [14,22,23,24] and so on), the abundant dynamical properties of system (1.2) are investigated by divergence, phase diagrams, equilibrium points, Lyapunov exponents, bifurcation diagram and Poincaré maps. The results show that the new 4D Rabinovich system not only exhibit hyperchaotic and Hopf bifurcation behaviors, but also has the rich dynamical phenomena including periodic, chaotic and static bifurcation. In addition, the 4D projection figures are also given for providing more dynamical information.
The rest of this paper is organized as follows: In the next section, boundedness, dissipativity and invariance, equilibria and their stability of (1.2) are discussed. In the third section, the complex dynamical behaviors such as chaos and hyperchaos are numerically verified by Lyapunov exponents, bifurcation and Poincaré section. In the fourth section, the Hopf bifurcation at the zero equilibrium point of the 4D Rabinovich system is investigated. In addition, an example is given to test and verify the theoretical results. Finally, the conclusions are summarized in the last section.
Theorem 2.1. If k0>m, system (1.2) has an ellipsoidal ultimate bound and positively invariant set
Ω={(x,y,z,u)|mx2+k0y2+(k0−m)[z−h(k0+m)k0−m]2+k0mu2k≤M}, |
where
M={14h2d2(m+k0)2(k0−m)a(d−a),(k0>m,d>a),14h2d2(m+k0)2(k0−m)b(−b+d),(k0>m,d>b),(m+k0)2h2k0−m,(k0>m). | (2.1) |
Proof. V(x,y,z,u)=mx2+k0y2+(k0−m)[z−h(k0+m)k0−m]2+k0mu2k. Differentiating V with respect to time along a trajectory of (1.2), we obtain
˙V(x,y,z,u)2=−amx2−by2k0+dhmz+dhzk0+dmz2−dz2k0. |
When ˙V(x,y,z,u)2=0, we have the following ellipsoidal surface:
Σ={(x,y,z,u)|amx2+bk0y2+d(k0−m)(z−hm+hk02k0−2m)2=dh2(k0+m)24(k0−m)}. |
Outside Σ that is,
amx2+bk0y2+d(k0−m)(z−hm+hk02k0−2m)2<dh2(k0+m)24(k0−m), |
˙V<0, while inside Σ, that is,
amx2+bk0y2+d(k0−m)(z−hm+hk02k0−2m)2>dh2(k0+m)24(k0−m), |
˙V>0. Thus, the ultimate bound for system (1.2) can only be reached on Σ. According to calculation, the maximum value of V on Σ is Vmax=14h2d2(m+k0)2(k0−m)a(d−a),(k0>m,d>a) and
Vmax=14h2d2(m+k0)2(k0−m)b(−b+d),(k0>m,d>b);Vmax=(m+k0)2h2k0−m,(k0>m). |
In addition, Σ⊂Ω, when a trajectory X(t)=(x(t),y(t),z(t),u(t)) of (1.2) is outside Ω, we get ˙V(X(t))<0. Then, limt→+∞ρ(X(t,t0,X0),Ω)=0. When X(t)∈Ω, we also get ˙V(X(t))<0. Thus, any trajectory X(t) (X(t)≠X0) will go into Ω. Therefore, the conclusions of theorem is obtained.
We can see that system (1.2) is invariant for the coordinate transformation
(x,y,z,u)→(−x,−y,z,−u). |
Then, the nonzero equilibria of (1.2) is symmetric with respect to z axis. The divergence of (1.2) is
∇W=∂˙x∂x+∂˙y∂y+∂˙z∂z+∂˙u∂u=−(a+b+d), |
system (1.2) is dissipative if and only if a+b+d>0. It shows that each volume containing the system trajectories shrinks to zero as t→∞ at an exponential rate −(a+b+d).
For m≤k0, system (1.2) only has one equilibrium point O(0,0,0,0) and the Jacobian matrix at O is
J=[−ah0k0h−b0m00−d0−k−k00]. |
Then, the characteristic equation is
(d+λ)(λ3+s2λ2+s1λ+s0), | (2.2) |
where
s2=a+b,s1=ab−h2+km+kk0,s0=akm+bkk0+hkm+hkk0. |
According to Routh-Hurwitz criterion [25], the real parts of eigenvalues are negative if and only if
d>0,a+b>0,(a+b)(ab−h2)+k(ak0+bm−hm−hk0)>0. | (2.3) |
When m>k0, system (1.2) has other two nonzero equilibrium points E1(x∗1,y∗1,z∗1,u∗1) and E2(−x∗1,−y∗1,z∗1,−u∗1), where
x∗1=√d(am+bk0+hm+hk0)m−k0,y∗1=−√d(am+bk0+hm+hk0)m−k0, |
z∗1=−am+bk0+hm+hk0m−k0,u∗1=−a+b+2hm−k0√d(am+bk0+hm+hk0)m−k0. |
The characteristic equation of Jacobi matrix at E1 and E2 is
λ4+δ3λ3+δ2λ2+δ1λ+δ0=0, |
where
δ3=a+b+d,δ2=x∗14d2+ab+ad+bd−h2+km+kk0, |
δ1=1d[x∗12(3x∗12+ad−bd+kk0−km)+k(m+k0)(d+h)]+abd+akm+bkk0−dh2, |
δ0=3kk0x∗12−3kmx∗12+akmd+bkk0d+hkk0d+hkmd. |
Based on Routh-Hurwitz criterion [25], the real parts of eigenvalues are negative if and only if
δ0>0,δ3>0,δ3δ2−δ1>0,δ3δ2δ1−δ21−δ0δ23>0. | (2.4) |
Therefore, we have:
Theorem 2.2. (I) When m≤k0, system (1.2) only has one equilibrium point O(0,0,0,0) and O is asymptotically stable if and only if (2.3) is satisfied.
(II) when m>k0, system (1.2) has two nonzero equilibria E1, E2, (2.4) is the necessary and sufficient condition for the asymptotically stable of E1 and E2.
When (b,d,h,a,k0,k,m)=(1,1,10,10,0.8,0.8,0.8), system (1.2) only has zero-equilibrium point E0(0,0,0,0,0), its corresponding characteristic roots are: −1,0.230,5.232,−16.462, E0 is unstable. The Lyapunov exponents are: LE1=0.199, LE2=0.083, LE3=0.000, LE4=−12.283, system (1.2) is hyperchaotic. Figure 1 shows the hyperchaotic attractors on z−x−y space and y−z−u space. The Poincaré mapping on the x−z plane and power spectrum of time series x(t) are depicted in Figure 2.
In the following, we fix b=1,d=1,h=10,a=10,k0=0.8,m=0.8, Figure 3 indicates the Lyapunov exponent spectrum of system (1.2) with respect to k∈[0.005,1.8] and the corresponding bifurcation diagram is given in Figure 4. These simulation results illustrate the complex dynamical phenomena of system (1.2). When k varies in [0.005,1.8], there are two positive Lyapunov exponents, system (1.2) is hyperchaoic as k varies.
Assume b=1,d=1,h=10,k=0.8,k0=0.8,m=0.8, the different Lyapunov exponents and dynamical properties with different values of parameter a are given in Table 1. It shows that system (1.2) has rich dynamical behaviors including periodic, chaos and hyperchaos with different parameters. The bifurcation diagram of system (1.2) with a∈[0.5,5] is given in Figure 5. Therefore, we can see that periodic orbits, chaotic orbits and hyperchaotic orbits can occur with increasing of parameter a. When a=1.08, Figure 6 indicates the (z,x,y,u) 4D surface of section and the location of the consequents is given in the (z,x,y) subspace and are colored according to their u value. The chaotic attractor and hyperchaotic attractor on y−x−z space and hyperchaotic attractor on y−z−u space are given in Figures 7 and 8, respectively. The Poincaré maps on x−z plane with a=2 and a=4 are depicted in Figure 9.
a | LE1 | LE2 | LE3 | LE4 | Dynamics |
1.08 | 0.000 | −0.075 | −4.661 | −2.538 | Periodic |
2 | 0.090 | 0.000 | −0.395 | −3.696 | Chaos |
4 | 0.325 | 0.047 | −0.000 | −6.373 | Hyperchaos |
Theorem 4.1. Suppose that ab>h2 and k0(a−h)+m(b−h)<0 are satisfied. Then, as m varies and passes through the critical value k=ah2+bh2−a2b−ab2ak0+bm−hm−hk0, system (1.2) undergoes a Hopf bifurcation at O(0,0,0,0).
Proof. Assume that system (1.2) has a pure imaginary root λ=iω,(ω∈R+). From (2.2), we get
s2ω2−s0=0,ω3−s1ω=0, |
then
ω=ω0=√ab−h2+k(k0+m), |
k=k∗=(a+b)(h2−ab)k0(a−h)+m(b−h). |
Substituting k=k∗ into (2.2), we have
λ1=iω,λ2=iω,λ3=−d,λ4=−(a+b). |
Therefore, when ab>h2, k0(a−h)+m(b−h)<0 and k=k∗, the first condition for Hopf bifurcation [26] is satisfied. From (2.2), we have
Re(λ′(k∗))|λ=iω0=h(k0+m)−ak0−bm2(s22+s1)<0, |
Thus, the second condition for a Hopf bifurcation [26] is also met. Hence, Hopf bifurcation exists.
Remark 4.1. When ab−h2+k(k0+m)≤0, system (1.2) has no Hopf bifurcation at the zero equilibrium point.
Theorem 4.2. When ab>h2 and k0(a−h)+m(b−h)<0, the periodic solutions of (1.2) from Hopf bifurcation at O(0,0,0,0) exist for sufficiently small
0<|k−k∗|=|k−(a+b)(h2−ab)k0(a−h)+m(b−h)|. |
And the periodic solutions have the following properties:
(I) if δ1g>0 (resp., δ1g<0), the hopf bifurcation of system (1.2) at (0,0,0,0) is non-degenerate and subcritical (resp. supercritical), and the bifurcating periodic solution exists for m>m∗ (resp., m<m∗) and is unstable (resp., stable), where
δ1g=14dδ(−k2δ01k02+ahδ01s1+kδ01k0s1−2dδ03δ05+2dδ04δ06),δ=ω0[(−ab+h2)(akk0+hkk0−hs1)+k(bm−hk0)(ha+h2+kk0)−k(ak−hm)(a2+ha−kk0+s1)],δ01=kω0(a2bm+a2hk−a2hk0+abhm+ah2k−ah2m−ah2k0+ak2k0−bkmk0−h3m−hkmk0+hkk02+bms1−hk0s1),δ03=ω0(a2bkm−2a2bkk0+a2hk2−a2hkk0+abhkm+2abhkk0+ah2k2−ah2km+ah2kk0−ak3k0+bk2mk0−h3km−2h3kk0+hk2mk0−hk2k02+2a2bs1−2ah2s1−bkms1+hkk0s1),δ04=(−ab+h2)s12+(a3b−a2h2+abh2−2abkm+2abkk0−ahk2+2ahkk0−bhkm−h4+h2km−h2kk0)s1−a2k3k0+abk2mk0−2abk2k02−ahk3k0+ahk2mk0−ahk2k02+bhk2mk0+h2k2mk0+h2k2k02,δ05=12d2+8s1[2ω0(−kk0aω0+hkk0ω0−hω0s1)+d(−hω02a−k2k02+kk0s1],δ06=12d2+8s1[d(−kk0aω0+hkk0ω0−hω0s1)−2ω0(k2k02+ahs1−kk0s1)]. |
(II) The period and characteristic exponent of the bifurcating periodic solution are:
T=2πω0(1+τ2∗ϵ2+O(ϵ4)),β=β2ϵ2+O(ϵ4), |
where ϵ=k−k∗μ2+O[(k−k∗)2] and
μ2=−ReC1(0)α′(0)=−(s22+s1)δ1gh(k0+m)−ak0−bm, |
τ2∗=δ2gω0−δ1g(ams2+bk0s2+hms2+hk0s2+ms1+k0s1)s1(h(k0+m)−ak0−bm), |
β2=δ1g, |
δ2g=14dδ(−k2δ02k02+ahδ02s1+kδ02k0s1−2δ03δ06d−2δ04δ05d). |
(III) The expression of the bifurcating periodic solution is
[xyzu]=[−kk0ϵcos(2πtT)−hω0ϵsin(2πtT)(kk0−s1)ϵcos(2πtT)−aω0ϵsin(2πtT)ϵ2[−kk0(kk0−s1)+hs1a2d+δ05−δ06sin(4πtT)]−k(a+h)ϵcos(2πtT)+kω0ϵsin(2πtT)]+O(ϵ3). |
Proof. Let k=k∗, by straightforward computations, we can obtain
t1=[ihω0−kk0kk0−s1+iaω00−(iω0+a+h)k],t3=[0010],t4=[ak0−hmbm−hk00h2−ab], |
which satisfy
Jt1=iω0t1,Jt3=−dt3,Jt4=−(a+b)t4. |
Now, we use transformation X=QX1, where X=(x,y,z,u)T, X1=(x1,y1,z1,u1)T, and
Q=[−kk0−hω00ak−hmkk0−s1−aω00bm−hk00010−k(a+h)kω00h2−ab], |
then, system (1.2) is transformed into
{˙x1=−ω0y1+F1(x1,y1,z1,u1),˙y1=ω0x1+F2(x1,y1,z1,u1),˙z1=−dz1+F3(x1,y1,z1,u1),˙u1=−(a+b)u1+F4(x1,y1,z1,u1), | (4.1) |
where
δ=ω0 [(−ab+h2)(akk0+hkk0−hs1)+k(bm−hk0)(ha+h2+kk0)−k(ak−hm) (a2+ha−kk0+s1)],
F1(x1,y1,z1,u1) =1δz1(f11x1+f12y1+f13u1),
f11=−kk0ω0(abh−ak2−h3+hkm)+ (kk0−s1)ω0(a2b−ah2−bkm+hkk0),
f12=−kk0ω0(abh−ak2−h3+hkm)+ (kk0−s1)ω0(a2b−ah2−bkm+hkk0),
f13=−kk0ω0(abh−ak2−h3+hkm)+ (kk0−s1)ω0(a2b−ah2−bkm+hkk0),
F2(x1,y1,z1,u1)= −1δz1(f21x1+f22y1+f23u1),
f21=(−ab+h2)(2k2k02−2kk0s1+s12) −k(a+h)(ak2k0−bkmk0−hkmk0+ hkk02+bms1−hk0s1),
f22=−aω0[abk(m−k0)−hk(ak0−bm)] +abs1−h2s1]−hω0[ak(ak+bk0+hk−hm)−h2k(m+k0)],
f23=(h2−ab)[hkk0(m−k0)−kk0(ak−bm)−s1(bm−hk0)]+k(a+h)[ak(ak−2hm) +bm(bm−2hk0)+h2(m2+k02)],
F3(x1,y1,z1,u1)= [−kk0x1−hω0y1+(ak−hm)u1][(kk0−s1)x1−aω0y1+(bm−hk0)u1],
F4(x1,y1,z1,u1)= 1δz1(f41x1+f42y1+f43u1),
f41=kk0 (hω0ka+h2ω0k+k2k0ω0)− (kk0−s1)kω0(a2+ah−kk0+s1),
f42= a3ω02k+a2ω02kh+h2ω02ka−ak2k0ω02+h3 ω02k+k2k0hω02+ akω02s1,
f43=−a2bkmω0−a2hk2ω0+ a2hkk0ω0−abhkmω0−ah2k2 ω0+ah2kmω0+ah2kk0ω0−ak3 k0ω0 +bk2mk0ω0+ h3kmω0+hk2mk0ω0−hk2k02ω0−bkm ω0s1+ hkk0ω0s1.
Furthermore,
g11=14[∂2F1∂x21+∂2F1∂y21+i(∂2F2∂x21+∂2F2∂y21)]=0, |
g02=14[∂2F1∂x21−∂2F1∂y21−2∂2F2∂x1∂y1+i(∂2F2∂x21−∂2F2∂y21+2∂2F1∂x1∂y1)]=0, |
g20=14[∂2F1∂x21−∂2F1∂y21+2∂2F2∂x1∂y1+i(∂2F2∂x21−∂2F2∂y21−2∂2F1∂x1∂y1)]=0, |
G21=18[∂3F1∂x31+∂3F2∂y31+∂3F1∂x1∂y21+∂3F2∂x21∂y1+i(∂3F2∂x31−∂3F2∂y31+∂3F2∂x1∂y21−∂3F1∂x21∂y1)]=0. |
By solving the following equations
[−d00−(a+b)][ω111ω211]=−[h111h211],[−d−2iω000−(a+b)−2iω0][ω120ω220]=−[h120h220], |
where
h111=12[(kk0+ah)s1−k2k02], |
h211=14(∂2F4∂x21+∂2F4∂y21)=0, |
h120=12[−k2k02−hs1a+kk0s1+(hkk0ω0−kk0aω0−hω0s1)i], |
h220=14(∂2F4∂x21−∂2F4∂y21−2i∂2F4∂x1∂y1)=0, |
one obtains
ω111=12d[hs1a−kk0(kk0−s1)],ω211=0,ω220=0, |
ω120=12d2+8s1{2ω0(−kk0aω0+hkk0ω0−hω0s1)+d(−hω02a−k2k02+kk0s1) |
+[d(−kk0aω0+hkk0ω0−hω0s1)−2ω0(k2k02+ahs1−kk0s1)]i}, |
G1110=12[(∂2F1∂x1∂z1+∂2F2∂y1∂z1)+i(∂2F2∂x1∂z1−∂2F1∂y1∂z1)]=12δ(δ01+δ02i), |
where
δ01=kω0(a2bm+a2hk−a2hk0+abhm+ah2k−ah2m−ah2k0+ak2k0−bkmk0−h3m−hkmk0+hkk02+bms1−hk0s1),δ02=(ab−h2)s12+(a3b−a2h2+abh2−2abkk0−ahk2+bhkm−h4+h2km+h2kk0)s1+k2k0(a2k−bma+2abk0+ahk−ahm+ahk0−bhm−h2m−h2k0),G2110=12[(∂2F1∂x1∂u1+∂2F2∂y1∂u1)+i(∂2F2∂x1∂u1−∂2F1∂y1∂u1)]=0,G1101=12[(∂2F1∂x1∂z1−∂2F2∂y1∂z1)+i(∂2F2∂x1∂z1+∂2F1∂y1∂z1)]=−12δ[δ03+δ04i], |
where
δ03=ω0(a2bkm−2a2bkk0+a2hk2−a2hkk0+abhkm+2abhkk0+ah2k2−ah2km+ah2kk0−ak3k0+bk2mk0−h3km−2h3kk0+hk2mk0−hk2k02+2a2bs1−2ah2s1−bkms1+hkk0s1),δ04=(−ab+h2)s12+(a3b−a2h2+abh2−2abkm+2abkk0−ahk2+2ahkk0−bhkm−h4+h2km−h2kk0)s1−a2k3k0+abk2mk0−2abk2k02−ahk3k0+ahk2mk0−ahk2k02+bhk2mk0+h2k2mk0+h2k2k02, |
G2101=12[(∂2F1∂x1∂u1−∂2F2∂y1∂u1)+i(∂2F2∂x1∂u1+∂2F1∂y1∂u1)]=0, |
g21=G21+2∑j=1(2Gj110ωj11+Gj101ωj20)=δ1g+δ2gi, |
where
δ1g=14dδ(−k2δ01k02+ahδ01s1+kδ01k0s1−2dδ03δ05+2dδ04δ06), |
δ2g=14dδ(−k2δ02k02+ahδ02s1+kδ02k0s1−2δ03δ06d−2δ04δ05d), |
δ05=12d2+8s1[2ω0(−kk0aω0+hkk0ω0−hω0s1)+d(−hω02a−k2k02+kk0s1)], |
δ06=12d2+8s1[d(−kk0aω0+hkk0ω0−hω0s1)−2ω0(k2k02+ahs1−kk0s1)]. |
Based on above calculation and analysis, we get
C1(0)=i2ω0(g20g11−2|g11|2−13|g02|2)+12g21=12g21, |
μ2=−ReC1(0)α′(0)=−(s22+s1)δ1gh(k0+m)−ak0−bm, |
τ2∗=δ2gω0−δ1g(ams2+bk0s2+hms2+hk0s2+ms1+k0s1)s1(h(k0+m)−ak0−bm), |
where
ω′(0)=ω0(ams2+bk0s2+hms2+hk0s2+ms1+k0s1)s1s22+s21, |
α′(0)=h(k0+m)−ak0−bm2(s22+s1),β2=2ReC1(0)=δ1g. |
Note α′(0)<0. From ab>h2 and k0(a−h)+m(b−h)<0, we obtain that if δ1g>0 (resp., δ1g<0), then μ2>0 (resp., μ2<0) and β2>0 (resp., β2<0), the hopf bifurcation of system (1.2) at (0,0,0,0) is non-degenerate and subcritical (resp. supercritical), and the bifurcating periodic solution exists for k>k∗ (resp., k<k∗) and is unstable (resp., stable).
Furthermore, the period and characteristic exponent are
T=2πω0(1+τ2∗ϵ2+O(ϵ4)),β=β2ϵ2+O(ϵ4), |
where ϵ=k−k∗μ2+O[(k−k∗)2]. And the expression of the bifurcating periodic solution is (except for an arbitrary phase angle)
X=(x,y,z,u)T=Q(¯y1,¯y2,¯y3,¯y4)T=QY, |
where
¯y1=Reμ,¯y1=Imμ,(¯y3,¯y4,¯y5)T=ω11|μ|2+Re(ω20μ2)+O(|μ|2), |
and
μ=ϵe2itπT+iϵ26ω0[g02e−4itπT−3g20e4itπT+6g11]+O(ϵ3)=ϵe2itπT+O(ϵ3). |
By computations, we can obtain
[xyzu]=[−kk0ϵcos(2πtT)−hω0ϵsin(2πtT)(kk0−s1)ϵcos(2πtT)−aω0ϵsin(2πtT)ϵ2[−kk0(kk0−s1)+hs1a2d+δ05−δ06sin(4πtT)]−k(a+h)ϵcos(2πtT)+kω0ϵsin(2πtT)]+O(ϵ3). |
Based on the above discussion, the conclusions of Theorem 4.2 are proved.
In order to verify the above theoretical analysis, we assume
d=2,h=1,k0=1,m=2,b=1.5,a=0.5. |
According to Theorem 4.1, we get k∗=1. Then from Theorem 4.2, μ2=−4.375 and β2=−0.074, which imply that the Hopf bifurcation of system (1.2) at (0,0,0,0) is nondegenerate and supercritical, a bifurcation periodic solution exists for k<k∗=1 and the bifurcating periodic solution is stable. Figure 10 shows the Hopf periodic solution occurs when k=0.999<k∗=1.
In this paper, we present a new 4D hyperchaotic system by introducing a linear controller to the first equation and second equation of the 3D Rabinovich system, respectively. If k0=0, m=1 and the fourth equation is changed to −ky, system (1.2) will be transformed to 4D hyperchaotic Rabinovich system in [18,19]. Compared with the system in [18], the new 4D system (1.1) has two nonzero equilibrium points which are symmetric about z axis when m>k0 and the dynamical characteristics are more abundant. The complex dynamical behaviors, including boundedness, dissipativity and invariance, equilibria and their stability, chaos and hyperchaos of (1.2) are investigated and analyzed. Furthermore, the existence of Hopf bifurcation, the stability and expression of the Hopf bifurcation at zero-equilibrium point are studied by using the normal form theory and symbolic computations. In order to analyze and verify the complex phenomena of the system, some numerical simulations are carried out including Lyapunov exponents, bifurcations and Poincaré maps, et al. The results show that the new 4D Rabinovich system can exhibit complex dynamical behaviors, such as periodic, chaotic and hyperchaotic. In the real practice, the hyperchaotic Rabinovich system can be applied to generate key stream for the entire encryption process in image encryption scheme [27]. In some cases, hyperchaos and chaos are usually harmful and need to be suppressed such as in biochemical oscillations [8] and flexible shaft rotating-lifting system [28]. Therefore, we will investigate hyperchaos control and chaos control in further research.
Project supported by the Doctoral Scientific Research Foundation of Hanshan Normal University (No. QD202130).
The authors declare that they have no conflicts of interest.
[1] | J. H. Holland, Genetic algorithms, Sci. Am., 267 (1992), 66-72. |
[2] | J. Kennedy, R. Eberhart, Particle swarm optimization, Perth, WA, Australia: Proceedings of IEEE International Conference on Neural Networks, 1995. |
[3] |
R. Storn, K. Price, Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 11 (1997), 341-359. doi: 10.1023/A:1008202821328
![]() |
[4] | K. V. Price, Differential evolution: A fast and simple numerical optimizer, Berkeley, CA, USA: Proceedings of North American Fuzzy Information Processing, 1996. |
[5] |
D. Karaboga, B. Basturk, A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm, J. Global Optim., 39 (2007), 459-471. doi: 10.1007/s10898-007-9149-x
![]() |
[6] | C. R. Hwang, Simulated annealing: Theory and applications, Acta Appl. Math., 12 (1988), 108- 111. |
[7] |
A. Faramarzi, M. Heidarinejad, S. Mirjalili, A. H. Gandomi, Marine Predators algorithm: A natureinspired metaheuristic, Expert Syst. Appl., 152 (2020), 113377. doi: 10.1016/j.eswa.2020.113377
![]() |
[8] | S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Software, 69 (2014), 46-61. |
[9] | S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Software, 95 (2016), 51-67. |
[10] |
S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris, S. M. Mirjalili, Salp swarm algorithm: A bio-inspired optimizer for engineering design problems, Adv. Eng. Software, 114 (2017), 163-191. doi: 10.1016/j.advengsoft.2017.07.002
![]() |
[11] |
R. V. Rao, V. J. Savsani, D. P. Vakharia, Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems, Comput.-Aided Des., 43 (2011), 303-315. doi: 10.1016/j.cad.2010.12.015
![]() |
[12] |
D. H. Wolpert, W. G. Macready, No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1 (1997), 67-82. doi: 10.1109/4235.585893
![]() |
[13] |
M. Liu, X. Yao, Y. Li, Hybrid whale optimization algorithm enhanced with Lévy flight and differential evolution for job shop scheduling problems, Appl. Soft Comput., 87 (2020), 105954. doi: 10.1016/j.asoc.2019.105954
![]() |
[14] | D. Tansui, A. Thammano, Hybrid nature-inspired optimization algorithm: Hydrozoan and sea turtle foraging algorithms for solving continuous optimization problems, IEEE Access, 8 (2020), 65780- 65800. |
[15] |
H. Garg, A hybrid GSA-GA algorithm for constrained optimization problems, Inf. Sci., 478 (2019), 499-523. doi: 10.1016/j.ins.2018.11.041
![]() |
[16] | D. T. Le, D. K. Bui, T. D. Ngo, Q. H. Nguyen, H. Nguyen-Xuan, A novel hybrid method combining electromagnetism-like mechanism and firefly algorithms for constrained design optimization of discrete truss structures, Comput. Struct., 212 (2019), 20-42. |
[17] | N. E. Humphries, N. Queiroz, J. R. M. Dyer, N. G. Pade, M. K. Musyl, K. M. Schaefer, et al., Environmental context explains Lévy and Brownian movement patterns of marine predators, Nature, 465 (2010), 1066-1069. |
[18] |
F. Bartumeus, J. Catalan, U. L. Fulco, M. L. Lyra, G. M. Viswanathan, Erratum: Optimizing the encounter rate in biological interactions: Lévy versus brownian strategies, Phys. Rev. Lett., 89 (2002), 109902. doi: 10.1103/PhysRevLett.89.109902
![]() |
[19] | M. A. A. Al-qaness, A. A. Ewees, H. Fan, L. Abualigah, M. A. Elaziz, Marine Predators algorithm for forecasting confirmed cases of COVID-19 in Italy, USA, Iran and Korea, Int. J. Environ. Res. Public Health, 17 (2020), 3520. |
[20] | D. Yousri, T. S. Babu, E. Beshr, M. B. Eteiba, D. Allam, A robust strategy based on marine predators algorithm for large scale photovoltaic array reconfiguration to mitigate the partial shading effect on the performance of PV system, IEEE Access, 8 (2020), 112407-112426. |
[21] | M. Abdel-Basset, R. Mohamed, M. Elhoseny, R. K. Chakrabortty, M. Ryan, A hybrid COVID- 19 detection model using an improved Marine Predators algorithm and a ranking-based diversity reduction strategy, IEEE Access, 8 (2020), 79521-79540. |
[22] | M. A. Elaziz, A. A. Ewees, D. Yousri, H. S. N. Alwerfali, Q. A. Awad, S. Lu, et al., An improved Marine Predators algorithm with fuzzy entropy for multi-level thresholding: Real world example of COVID-19 CT image segmentation, IEEE Access, 8 (2020), 125306-125330. |
[23] |
R. V. Rao, V. Patel, Multi-objective optimization of heat exchangers using a modified teachinglearning-based optimization algorithm, Appl. Math. Modell., 37 (2013), 1147-1162. doi: 10.1016/j.apm.2012.03.043
![]() |
[24] | R. V. Rao, V. Patel, An improved Teaching-learning-based optimization algorithm for solving unconstrained optimization problems, Sci. Iran., 20 (2013), 710-720. |
[25] |
A. R. Yildiz, Optimization of multi-pass turning operations using hybrid teaching learning-based approach, Int. J. Adv. Manuf. Technol., 66 (2013), 1319-1326. doi: 10.1007/s00170-012-4410-y
![]() |
[26] |
K. Yu, X. Wang, Z. Wang, An improved Teaching-learning-based optimization algorithm for numerical and engineering optimization problems, J. Intell. Manuf., 27 (2016), 831-843. doi: 10.1007/s10845-014-0918-3
![]() |
[27] | E. Uzlu, M. Kankal, A. Akpınar, T. Dede, Estimates of energy consumption in Turkey using neural networks with the Teaching-learning-based optimization algorithm, Energy, 75 (2014), 295-303. |
[28] | V. Toǧan, Design of planar steel frames using teaching-learning based optimization, Eng. Struct., 34 (2012), 225-232. |
[29] |
R. V. Rao, V. D. Kalyankar, Parameter optimization of modern machining processes using teachinglearning-based optimization algorithm, Eng. Appl. Artif. Intell., 26 (2013), 524-531. doi: 10.1016/j.engappai.2012.06.007
![]() |
[30] |
M. Singh, B. K. Panigrahi, A. R. Abhyankar, S. Das, Optimal coordination of directional overcurrent relays using informative differential evolution algorithm, J. Comput. Sci., 5 (2014), 269-276. doi: 10.1016/j.jocs.2013.05.010
![]() |
[31] |
H. Bouchekara, M. A. Abido, M. Boucherma, Optimal power flow using Teaching-learning-based optimization technique, Electr. Power Syst. Res., 114 (2014), 49-59. doi: 10.1016/j.epsr.2014.03.032
![]() |
[32] | G. M. Viswanathan, V. Afanasyev, S. V. Buldyrev, E. J. Murphy, P. A. Prince, H. E. Stanley, Lévy flight search patterns of wandering albatrosses, Nature, 381 (1996), 413-415. |
[33] | J. D. Filmalter, L. Dagorn, P. D. Cowley, M. Taquet, First descriptions of the behavior of silky sharks, Carcharhinus falciformis, around drifting fish aggregating devices in the Indian Ocean, Bull. Mar. Sci., 87 (2011), 325-337. |
[34] | E. Clark, Instrumental conditioning of lemon sharks, Science (New York, N.Y.), 130 (1959), 217-218. |
[35] | L. A. Dugatkin, D. S. Wilson, The prerequisites for strategic behaviour in bluegill sunfish, Lepomis macrochirus, Anim. Behav., 44 (1992), 223-230. |
[36] | V. Schluessel, H. Bleckmann, Spatial learning and memory retention in the grey bamboo shark (Chiloscyllium griseum), Zoology, 115 (2012), 346-353. |
[37] | D. W. Zimmerman, B. D. Zumbo, Relative power of the Wil-coxon test, the Friedman test, and repeated-measures ANOVA on ranks, J. Exp. Educ., 62 (1993), 75-86. |
[38] | S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris, S. M. Mirjalili, Salp swarm algorithm: A bio-inspired optimizer for engineering design problems, Adv. Eng. Software, 114 (2017), 163-191. |
[39] |
C. A. C. Coello, E. M. Montes, Constraint-handling in genetic algorithms through the use of dominance-based tournament selection, Adv. Eng. Inf., 16 (2002), 193-203. doi: 10.1016/S1474-0346(02)00011-3
![]() |
[40] |
E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, GSA: A gravitational search algorithm, Inf. Sci., 179 (2009), 2232-2248. doi: 10.1016/j.ins.2009.03.004
![]() |
[41] | H. Eskandar, A. Sadollah, A. Bahreininejad, M. Hamdi, Water cycle algorithm-a novel metaheuristic optimization method for solving constrained engineering optimization problems, Comput. Struct., 110 (2012), 151-166. |
[42] | R. A. Krohling, L. dos Santos Coelho, Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems, IEEE Trans. Syst., Man, Cybern., Part B (Cybernetics), 36 (2006), 1407-1416. |
[43] |
K. M. Ragsdell, D. T. Phillips, Optimal design of a class of welded structures using geometric programming, J. Eng. Ind., 98 (1976), 1021-1025. doi: 10.1115/1.3438995
![]() |
[44] |
P. Savsani, V. Savsani, Passing vehicle search (PVS): A novel metaheuristic algorithm, Appl. Math. Model., 40 (2016), 3951-3978. doi: 10.1016/j.apm.2015.10.040
![]() |
[45] | M. Dorigo, T. Stützle, Ant colony optimization: Overview and recent advances, 2Eds., Cham, Switzerland: Springer International Publishing, 2019. |
[46] | S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Software, 95 (2016), 51-67. |
[47] |
S. Mirjalili, SCA: A sine cosine algorithm for solving optimization problems, Knowl.-Based Syst., 96 (2016), 120-133. doi: 10.1016/j.knosys.2015.12.022
![]() |
[48] |
H. Beyer, H. Schwefel, Evolution strategies-A comprehensive introduction, Nat. Comput., 1 (2002), 3-52. doi: 10.1023/A:1015059928466
![]() |
[49] |
R. Moghdani, K. Salimifard, Volleyball premier league algorithm, Appl. Soft Comput., 64 (2018), 161-185. doi: 10.1016/j.asoc.2017.11.043
![]() |
[50] |
H. Liu, Z. Cai, Y. Wang, Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization, Appl. Soft Comput., 10 (2010), 629-640. doi: 10.1016/j.asoc.2009.08.031
![]() |
[51] |
K. Thirugnanasambandam, S. Prakash, V. Subramanian, S. Pothula, V. Thirumal, Reinforced cuckoo search algorithm-based multimodal optimization, Appl. Intell., 49 (2019), 2059-2083. doi: 10.1007/s10489-018-1355-3
![]() |
[52] | K. Deb, GeneAS: A robust optimal design technique for mechanical component design, 2Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. |
[53] | M. Mahdavi, M. Fesanghary, E. Damangir, An improved harmony search algorithm for solving optimization problems, Appl. Math. Comput., 188 (2007), 1567-1579. |
[54] | E. Mezura-Montes, C. A. C. Coello, R. Landa-Becerra, Engineering optimization using simple evolutionary algorithm, Sacramento, CA, USA: Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence, 2003. |
[55] |
T. Ray, P. Saini, Engineering design optimization using swarm with an intelligent information sharing among individuals, Eng. Optim., 33 (2001), 735-748. doi: 10.1080/03052150108940941
![]() |
[56] |
A. D. Belegundu, J. S. Arora, A study of mathematical programming methods for structural optimization. Part I: Theory, Int. J. Numer. Methods Eng., 21 (1985), 1583-1599. doi: 10.1002/nme.1620210904
![]() |
[57] |
T. Ray, K. M. Liew, Society and civilization: An optimization algorithm based on the simulation of social behavior, IEEE Trans. Evol. Comput., 7 (2003), 386-396. doi: 10.1109/TEVC.2003.814902
![]() |
[58] | Q. Zhang, H. Chen, A. A. Heidari, X. Zhao, Y. Xu, P. Wang, et al., Chaos-induced and mutationdriven schemes boosting salp chains-inspired optimizers, IEEE Access, 7 (2019), 31243-31261. |
[59] | A. Kaveh, M. Khayatazad, A new meta-heuristic method: Ray optimization, Comput. Struct., 112 (2012), 283-294. |
[60] | F. Huang, L. Wang, Q. He, An effective co-evolutionary differential evolution for constrained optimization, Appl. Math. Comput., 186 (2007), 340-356. |
[61] |
E. M. Montes, C. A. C. Coello, An empirical study about the usefulness of evolution strategies to solve constrained optimization problems, Int. J. Gen. Syst., 37 (2008), 443-473. doi: 10.1080/03081070701303470
![]() |
[62] |
S. Mirjalili, Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm, Knowl.-Based Syst., 89 (2015), 228-249. doi: 10.1016/j.knosys.2015.07.006
![]() |
[63] | J. S. Arora, Introduction to optimum design, New York: McGraw-Hill Book Co., 1989. |
[64] |
A. A. Heidari, R. A. Abbaspour, A. R. Jordehi, An efficient chaotic water cycle algorithm for optimization tasks, Neural Comput. Appl., 28 (2017), 57-85. doi: 10.1007/s00521-015-2037-2
![]() |
[65] |
A. H. Gandomi, X. S. Yang, A. H. Alavi, S. Talatahari, Bat algorithm for constrained optimization tasks, Neural Comput. Appl., 22 (2013), 1239-1255. doi: 10.1007/s00521-012-1028-9
![]() |
[66] |
H. Rosenbrock, An automatic method for finding the greatest or least value of a function, Comput. J., 3 (1960), 175-184. doi: 10.1093/comjnl/3.3.175
![]() |
[67] | L. dos Santos Coelho, Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems, Expert Syst. Appl., 37 (2010), 1676-1683. |
[68] |
E. Mezura-Montes, C. A. C. Coello, A simple multimembered evolution strategy to solve constrained optimization problems, IEEE Trans. Evol. Comput., 9 (2005), 1-17. doi: 10.1109/TEVC.2004.836819
![]() |
[69] | F. Huang, L. Wang, Q. He, An effective co-evolutionary differential evolution for constrained optimization, Appl. Math. Comput., 186 (2007), 340-356. |
[70] |
M. Montemurro, A. Vincenti, P. Vannucci, The automatic dynamic penalisation method (ADP) for handling constraints with genetic algorithms, Comput. Methods Appl. Mech. Eng., 256 (2013), 70-87. doi: 10.1016/j.cma.2012.12.009
![]() |
[71] |
K. Deb, Optimal design of a welded beam via genetic algorithms, AIAA J., 29 (1991), 2013-2015. doi: 10.2514/3.10834
![]() |
[72] |
A. Kaveh, S. Talatahari, A novel heuristic optimization method: Charged system search, Acta Mech., 213 (2010), 267-289. doi: 10.1007/s00707-009-0270-4
![]() |
[73] |
B. K. Kannan, S. N. Kramer, An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, J. Mech. Des., 116 (1994), 405-411. doi: 10.1115/1.2919393
![]() |
[74] |
C. Ozturk, E. Hancer, D. Karaboga, Dynamic clustering with improved binary artificial bee colony algorithm, Appl. Soft Comput., 28 (2015), 69-80. doi: 10.1016/j.asoc.2014.11.040
![]() |
[75] |
X. Kong, L. Gao, H. Ouyang, S. Li, A simplified binary harmony search algorithm for large scale 0-1 knapsack problems, Expert Syst. Appl., 42 (2015), 5337-5355. doi: 10.1016/j.eswa.2015.02.015
![]() |
[76] |
M. Abdel-Basset, D. El-Shahat, H. Faris, S. Mirjalili, A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems, Comput. Ind. Eng., 132 (2019), 187-206. doi: 10.1016/j.cie.2019.04.025
![]() |
[77] |
P. Brucker, R. Qu, E. K. Burke, Personnel scheduling: Models and complexity, Eur. J. Oper. Res., 210 (2011), 467-473. doi: 10.1016/j.ejor.2010.11.017
![]() |
[78] |
M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper. Res., 35 (1987), 254-265. doi: 10.1287/opre.35.2.254
![]() |
[79] |
P. V. Laarhoven, E. Aarts, J. K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res., 40 (1992), 113-125. doi: 10.1287/opre.40.1.113
![]() |
[80] | J. Zhang, J. Zhang, T. Lok, M. R. Lyu, A hybrid particle swarm optimization-back-propagation algorithm for feedforward neural network training, Appl. Math. Comput., 185 (2007), 1026-1037. |
[81] |
K. Socha, C. Blum, An ant colony optimization algorithm for continuous optimization: Application to feed-forward neural network training, Neural Comput. Appl., 16 (2007), 235-247. doi: 10.1007/s00521-007-0084-z
![]() |
[82] | K. Y. Leong, A. Sitiol, K. S. M. Anbananthen, Enhance neural networks training using GA with chaos theory, 3Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. |
[83] |
X. Wang, J. Yang, X. Teng, W. Xia, R. Jensen, Feature selection based on rough sets and particle swarm optimization, Pattern Recognit. Lett., 28 (2007), 459-471. doi: 10.1016/j.patrec.2006.09.003
![]() |
[84] | M. Ghaemi, M. R. Feizi-Derakhshi, Feature selection using forest optimization algorithm, Pattern Recognit., 60 (2016), 121-129. |
[85] |
P. R. Varma, V. V. Kumari, S. S. Kumar, Feature selection using relative fuzzy entropy and ant colony optimization applied to real-time intrusion detection system, Procedia Comput. Sci., 85 (2016), 503-510. doi: 10.1016/j.procs.2016.05.203
![]() |
1. | Xinna Mao, Hongwei Feng, Maryam A. Al-Towailb, Hassan Saberi-Nik, Dynamical analysis and boundedness for a generalized chaotic Lorenz model, 2023, 8, 2473-6988, 19719, 10.3934/math.20231005 |
a | LE1 | LE2 | LE3 | LE4 | Dynamics |
1.08 | 0.000 | −0.075 | −4.661 | −2.538 | Periodic |
2 | 0.090 | 0.000 | −0.395 | −3.696 | Chaos |
4 | 0.325 | 0.047 | −0.000 | −6.373 | Hyperchaos |