The Archimedes optimization algorithm (AOA) has attracted much attention for its few parameters and competitive optimization effects. However, all agents in the canonical AOA are treated in the same way, resulting in slow convergence and local optima. To solve these problems, an improved hierarchical chain-based AOA (HCAOA) is proposed in this paper. The idea of HCAOA is to deal with individuals at different levels in different ways. The optimal individual is processed by an orthogonal learning mechanism based on refraction opposition to fully learn the information on all dimensions, effectively avoiding local optima. Superior individuals are handled by an Archimedes spiral mechanism based on Levy flight, avoiding clueless random mining and improving optimization speed. For general individuals, the conventional AOA is applied to maximize its inherent exploration and exploitation abilities. Moreover, a multi-strategy boundary processing mechanism is introduced to improve population diversity. Experimental outcomes on CEC 2017 test suite show that HCAOA outperforms AOA and other advanced competitors. The competitive optimization results achieved by HCAOA on four engineering design problems also demonstrate its ability to solve practical problems.
Citation: Zijiao Zhang, Chong Wu, Shiyou Qu, Jiaming Liu. A hierarchical chain-based Archimedes optimization algorithm[J]. Mathematical Biosciences and Engineering, 2023, 20(12): 20881-20913. doi: 10.3934/mbe.2023924
[1] | Huiting He, Mohamed Ousbika, Zakaria El Allali, Jiabin Zuo . Non-trivial solutions for a partial discrete Dirichlet nonlinear problem with p-Laplacian. Communications in Analysis and Mechanics, 2023, 15(4): 598-610. doi: 10.3934/cam.2023030 |
[2] | Dan Li, Yuhua Long . On periodic solutions of second-order partial difference equations involving p-Laplacian. Communications in Analysis and Mechanics, 2025, 17(1): 128-144. doi: 10.3934/cam.2025006 |
[3] | Zhen Wang, Luhan Sun . The Allen-Cahn equation with a time Caputo-Hadamard derivative: Mathematical and Numerical Analysis. Communications in Analysis and Mechanics, 2023, 15(4): 611-637. doi: 10.3934/cam.2023031 |
[4] | Leandro Tavares . Solutions for a class of problems driven by an anisotropic (p,q)-Laplacian type operator. Communications in Analysis and Mechanics, 2023, 15(3): 533-550. doi: 10.3934/cam.2023026 |
[5] | Tianfang Wang, Wen Zhang . Existence and concentration of homoclinic orbits for first order Hamiltonian systems. Communications in Analysis and Mechanics, 2024, 16(1): 121-146. doi: 10.3934/cam.2024006 |
[6] | Xiulan Wu, Yaxin Zhao, Xiaoxin Yang . On a singular parabolic p-Laplacian equation with logarithmic nonlinearity. Communications in Analysis and Mechanics, 2024, 16(3): 528-553. doi: 10.3934/cam.2024025 |
[7] | Wang Xiao, Xuehua Yang, Ziyi Zhou . Pointwise-in-time α-robust error estimate of the ADI difference scheme for three-dimensional fractional subdiffusion equations with variable coefficients. Communications in Analysis and Mechanics, 2024, 16(1): 53-70. doi: 10.3934/cam.2024003 |
[8] | Katica R. (Stevanović) Hedrih, Gradimir V. Milovanović . Elements of mathematical phenomenology and analogies of electrical and mechanical oscillators of the fractional type with finite number of degrees of freedom of oscillations: linear and nonlinear modes. Communications in Analysis and Mechanics, 2024, 16(4): 738-785. doi: 10.3934/cam.2024033 |
[9] | Caojie Li, Haixiang Zhang, Xuehua Yang . A new α-robust nonlinear numerical algorithm for the time fractional nonlinear KdV equation. Communications in Analysis and Mechanics, 2024, 16(1): 147-168. doi: 10.3934/cam.2024007 |
[10] | Mohamed Karim Hamdani, Lamine Mbarki, Mostafa Allaoui . A new class of multiple nonlocal problems with two parameters and variable-order fractional p(⋅)-Laplacian. Communications in Analysis and Mechanics, 2023, 15(3): 551-574. doi: 10.3934/cam.2023027 |
The Archimedes optimization algorithm (AOA) has attracted much attention for its few parameters and competitive optimization effects. However, all agents in the canonical AOA are treated in the same way, resulting in slow convergence and local optima. To solve these problems, an improved hierarchical chain-based AOA (HCAOA) is proposed in this paper. The idea of HCAOA is to deal with individuals at different levels in different ways. The optimal individual is processed by an orthogonal learning mechanism based on refraction opposition to fully learn the information on all dimensions, effectively avoiding local optima. Superior individuals are handled by an Archimedes spiral mechanism based on Levy flight, avoiding clueless random mining and improving optimization speed. For general individuals, the conventional AOA is applied to maximize its inherent exploration and exploitation abilities. Moreover, a multi-strategy boundary processing mechanism is introduced to improve population diversity. Experimental outcomes on CEC 2017 test suite show that HCAOA outperforms AOA and other advanced competitors. The competitive optimization results achieved by HCAOA on four engineering design problems also demonstrate its ability to solve practical problems.
In this article, we study the existence of infinitely many homoclinic solutions of the following fractional discrete p-Laplacian equations:
(−Δ1)spu(a)+V(a)|u(a)|p−2u(a)=λf(a,u(a)),in Z, | (1.1) |
where s∈(0,1) and p∈(1,∞) are fixed constants, V(a)∈R+, λ is a positive parameter, f(a,⋅) is a continuous function for all a∈Z and (−Δ1)sp is the fractional discrete p-Laplacian given by
(−Δ1)spu(a)=2∑b∈Z,b≠a|u(a)−u(b)|p−2(u(a)−u(b))Ks,p(a−b),in Z, |
where the discrete kernel Ks,p has the following property: There exist two constants 0<cs,p≤Cs,p, such that
{cs,p|d|1+ps≤Ks,p(d)≤Cs,p|d|1+ps,for alld∈Z∖{0};Ks,p(0)=0. | (1.2) |
The fractional operator has received more attention recent decades because of its many applications in the real world. Many scholars have paid attention to this kind of problem, and have produced a lot of classical works, see for example [1,2,3]. As a classical fractional operator, the fractional Laplacian has wide applications in various fields such as optimization, population dynamics and so on. The fractional Laplacian on R can be defined for 0<s<1 and ν∈C∞0(RN) as
(−Δ)sν(x)=CN,sP.V.∫RNν(x)−ν(y)|x−y|N+2sdy,x∈RN, |
where CN,s is a positive constant and P.V. denotes the Cauchy principle value. In various cases involving differential equations, the Laplace operator is replaced by either the fractional Laplace operator or other more general operators, and hence the existence results have been obtained by employing variational approaches, see for instance [4,5,6,7]. These alternative approaches have been found to offer improved descriptions of numerous phenomena observed in the natural world. Correspondingly, it is necessary to give some qualitative results by employing numerical analysis. The nonlocal feature of the fractional Laplacian is one of the important aspects to be considered in numerical methods, which makes it necessary to study the existence of solutions.
Let ZH denote a grid of fixed size H>0 on R, i.e., ZH={Ha|a∈Z}. In [8], the definition of the fractional discrete Laplacian on ZH is given by
(−ΔH)sν(a)=∑b∈Z,b≠a(ν(a)−ν(b))KHs(a−b), |
where s∈(0,1), ν∈ℓs={ν:ZH→R|∑ω∈Z|ν(ω)|(1+|ω|)1+2s<∞} and
KHs(a)={4sΓ(1/2+s)√π|Γ(−s)|⋅Γ(|a|−s)H2sΓ(|a|+1+s),a∈Z∖{0},0,a=0. |
The above discrete kernel KHs has the following property: There exist two constants 0<cs≤Cs, such that for all a∈Z∖{0} there holds
csH2s|a|1+2s≤KHs(a)≤CsH2s|a|1+2s. |
In [8], Ciaurri et al. also proved that if ν is bounded then lims→1−(−ΔH)sν(a)=−ΔHν(a), where ΔH is there discrete Laplacian on ZH, i.e.
ΔHν(a)=1H2(ν(a+1)−2ν(a)+ν(a−1)). |
Moreover, under some suitable conditions and H→0, the fractional Laplacian can be approximated by the fractional discrete Laplacian.
Subsequently, let us give some existence results on the fractional difference equations. Xiang et al. [9] first investigated the fractional discrete Laplacian equations based on variational methods:
{(−Δ1)sν(a)+V(a)ν(a)=λf(a,ν(a)),fora∈Z,ν(a)→0,as|a|→∞, | (1.3) |
where f(a,⋅) is a continuous function for all a∈Z, λ>0, V(a)∈R+ and
(−Δ1)sν(a)=2∑b∈Z,b≠a(ν(a)−ν(b))Ks(a−b),in Z. |
Using the mountain pass theorem and Ekeland's variational principle under some suitable conditions, they obtained two homoclinic solutions for problem (1.3). It is evident that when p=2, the discrete fractional p-Laplace operator corresponds to the discrete fractional Laplace operator. After that, Ju et al. [10] studied the following fractional discrete p-Laplacian equations
{(−Δ1)spν(d)+V(d)|ν(d)|p−2ν(d)=λa(d)|ν(d)|q−2ν(d)+b(d)|ν(d)|r−2ν(d),ford∈Z,ν(d)→0,as|d|→∞, | (1.4) |
where a∈ℓpp−q, b∈ℓ∞, 1<q<p<r<∞, λ>0, V(a)∈R+, (−Δ1)sp is the fractional discrete p-Laplacian. Under certain conditions, they employed the Nehari manifold method to achieve the existence of at least two homoclinic solutions for problem (1.4). In [11], Ju et al. investigated the existence of multiple solutions for the fractional discrete p-Laplacian equations with various nonlinear terms via different Clark's theorems. In a recent study conducted by Ju et al. in [12], it was demonstrated that using the fountain theorem and the dual fountain theorem under the same hypotheses, two separate sequences of homoclinic solutions were derived for the fractional discrete Kirchhoff-Schrödinger equations. Based on the findings from [8], it could be deduced that Eq.(1.3) can be reformulated as the renowned discrete version of the Schrödinger equation
−Δμ(ξ)+V(ξ)μ(ξ)=λf(ξ,μ(ξ)),in Z. | (1.5) |
It is worth mentioning that in [13], Agarwal et al. first employed the variational methods to analyze Eq.(1.5). Here, We give some literature on the study of difference equations using the critical point theory, see [14,15,16].
In particular, we observe that both the nonlinear terms in [11,12] have the following symmetry condition:
(S) f(a,ν) is odd in ν.
Therefore, in this paper, we consider the nonlinear term without condition (S), and study the existence of multiple homoclinic solutions of problem (1.1). For this, let us first recall if the solution ν of Eq.(1.1) satisfies ν(d)→0 as |d|→∞, then ν is called a homoclinic solution. Suppose that V(a) and f(a,u(a)) in problem (1.1) satisfy the following assumptions:
(V) V∈ℓ1 and there is a constant V0∈(0,infa∈ZV(a)]; (ℓ1 is defined in next section)
(F) |f(a,u)|≤C(|u|p−1+|u|t−1) for any a∈Z and u∈R, where p<t<∞ and C>0 is a constant.
Set
A:=lim infτ→0+max|ζ|≤τ∑a∈ZF(a,ζ(a))τp,B:=lim supτ→0+∑a∈ZF(a,τ(a))τp,θ:=CsV0Cb‖V‖1, |
where F(a,u)=∫u0f(a,η)dη and Cs, Cb will appear in next section. Here we give the main conclusion of our paper as follows.
Theorem 1.1. Suppose that (V) and (F) are satisfied. Furthermore, the following inequality holds: A<θB. Then, for every λ∈(Cb‖V‖1pB,CsV0pA), problem (1.1) possesses infinitely many nontrivial homoclinic solutions. In addition, their critical values and their ℓ∞-norms tend to zero.
The rest of this article is arranged as follows: In Section 2, we introduce some definitions and give some preliminary results. In Section 3, we give the proof of Theorem 1.1. In Section 4, we give an example to demonstrate the main result.
Here we illustrate some notations used in this paper:
● C, Cs,ω, Cs, Cb and C∞ are diverse positive constants.
● ↪ denotes the embedding.
● → denotes the strong convergence.
First we give some basic definitions.
Let 1≤ω≤∞, we give the definition of the space (ℓω,‖⋅‖ω) as follows:
ℓω:={{μ:Z→R|∑a∈Z|μ(a)|ω<∞},if1≤ω<∞;{μ:Z→R|supa∈Z|μ(a)|<∞},ifω=∞; |
‖μ‖ω:={(∑a∈Z|μ(a)|ω)1/ω,if1≤ω<∞;supa∈Z|μ(a)|,ifω=∞. |
Through the corresponding conclusions in [17], we know that ℓω is a Banach space. Moreover, ℓω1↪ℓω2 and ‖μ‖ω2≤‖μ‖ω1 if 1≤ω1≤ω2≤∞.
Next, we give the variational framework and some lemmas of this paper.
The space (Q,‖⋅‖Q) is defined by
Q={σ:Z→R|∑a∈Z∑b∈Z|σ(a)−σ(b)|pKs,p(a−b)+∑d∈ZV(d)|σ(d)|p<∞}; |
‖σ‖pQ=[σ]ps,p+∑d∈ZV(d)|σ(d)|p=∑a∈Z∑b∈Z|σ(a)−σ(b)|pKs,p(a−b)+∑d∈ZV(d)|σ(d)|p. |
Lemma 2.1. (see [10, Lemma 2.1]) If ξ∈ℓω, then [ξ]s,ω≤Cs,ω‖ξ‖ω<∞.
Lemma 2.2. (see [11, Lemma 2.2]) Under the hypothesis (V), (Q,‖⋅‖Q) is a reflexive Banach space, and
‖σ‖:=(∑a∈ZV(a)|σ(a)|p)1/p. |
is an equivalent norm of Q.
Through Lemma 2.2, we obtain that there exist 0≤Cs≤Cb such that
Cs‖μ‖p≤‖μ‖pQ≤Cb‖μ‖p. | (2.1) |
Lemma 2.3. Under the hypothesis (V), Q↪ℓr is continuous for all p≤r≤∞.
Proof. Using the above conclusions and (V), we can deduce that
‖σ‖r≤‖σ‖p=(∑a∈Z|σ(a)|p)1p≤V−1p0(∑a∈ZV(a)|σ(a)|p)1p,∀σ∈Q. |
As desired.
Lemma 2.4. (see [10, Lemma 2.4]) If W⊂Q is a compact subset, then for ∀ι>0, ∃a0∈N such that
[∑|a|>a0V(a)|ξ(a)|p]1/p<ι,for eachξ∈W. |
For all u∈Q, we define
K(u)=D(u)−λE(u) |
where
D(u)=1p∑a∈Z∑b∈Z|u(a)−u(b)|pKs,p(a−b)+1p∑d∈ZV(d)|u(d)|p=1p‖u‖pQ |
and
E(u)=∑d∈ZF(d,u(d)). |
Clearly
infQD(μ)=infQ1p‖μ‖pQ=D(0)=0. | (2.2) |
Lemma 2.5. (see [10, Lemma 2.5]) Under the hypothesis (V), then D(σ)∈C1(Q,R) with
⟨D′(σ),ξ⟩=∑a∈Z∑b∈Z|σ(a)−σ(b)|p−2(σ(a)−σ(b))(ξ(a)−ξ(b))Ks,p(a−b)+∑d∈ZV(d)|σ(d)|p−2σ(d)ξ(d), |
for all σ,ξ∈Q.
Lemma 2.6. (see [12, Lemma 2.6]) Under the hypotheses (V) and (F), then E(σ)∈C1(Q,R) with
⟨E′(σ),ξ⟩=∑d∈Zf(d,σ(d))ξ(d) |
for all σ,ξ∈Q.
Combining Lemma 2.5 and Lemma 2.6, we know that K(σ)∈C1(Q,R).
Lemma 2.7. Under the hypotheses (V) and (F), then for ∀λ>0, every critical point of K is a homoclinic solution of problem (1.1).
Proof. Assume σ be a critical point of K, we get for ∀ξ∈Q
∑a∈Z∑b∈Z|σ(a)−σ(b)|p−2(σ(a)−σ(b))(ξ(a)−ξ(b))Ks,p(a−b)+∑a∈ZV(a)|σ(a)|p−2σ(a)ξ(a)=λ∑a∈Zf(a,σ(a))ξ(a). | (2.3) |
For each a∈Z, we define ed∈Q as follows:
ed(a):={0,ifa≠d;1,ifa=d. |
Taking ξ=ed in (2.3), we have
2∑b∈Z,b≠a|u(a)−u(b)|p−2(u(a)−u(b))Ks,p(a−b)+V(a)|u(a)|p−2u(a)=λf(a,σ(a)). |
So σ is a solution of problem (1.1). Moreover, by Lemma 2.3 and σ∈Q, we know σ(a)→0 as |a|→∞. Thus, σ is a homoclinic solution of problem (1.1).
In this section, we shall use the following Thoerem 3.1 to prove our main result. In fact, this theorem is a special version of Ricceri's variational principle [18, Lemma 2.5].
Theorem 3.1. (see [19, Lemma 2.1]) Let Q be a reflexive Banach space, K(μ):=D(μ)+λE(μ) for each μ∈Q, where D,E∈C1(Q,R), D is coercive, and λ is a real positive parameter. For every γ>infQD(μ), let
η(γ):=infμ∈D−1((−∞,γ))(supν∈D−1((−∞,γ))E(ν))−E(μ)γ−D(μ), |
and
ρ:=lim infγ→(infQD(μ))+η(γ) |
If ρ<+∞, then for every λ∈(0,1ρ), the following conclusions holds only one:
(a) there exists a global minimum of D which is a local minimum of K.
(b) there exists a sequence {μm} of pairwise distinct critical points (local minima) of K, with limm→∞D(μm)=infQD(μ), which converges to a global minimum of D.
Remark 3.1. Obviously, ρ≥0. In addition, when ρ=0, we think that 1ρ=+∞.
Proof of Theorem 1.1. Let us recall
A=lim infτ→0+max|ζ|≤τ∑a∈ZF(a,ζ(a))τp,B=lim supτ→0+∑a∈ZF(a,τ(a))τp,θ=CsV0Cb‖V‖1, |
where F(a,u)=∫u0f(a,ω)dω. Fix λ∈(Cb‖V‖1pB,CsV0pA) and set K,D,E as in Section 2. By Lemma 2.2, Lemma 2.5 and Lemma 2.6, we know Q be a reflexive Banach space and D,E∈C1(Q,R). Because of
D(μ)=1p∑a∈Z∑b∈Z|μ(a)−μ(b)|pKs,p(a−b)+1p∑d∈ZV(d)|μ(d)|p=1p‖μ‖pQ→+∞ |
as ‖μ‖Q→+∞, i.e. D is coercive. Now, we show that ρ<+∞. For this purpose, let {δn} be a positive sequence such that limn→∞δn=0 and
limn→∞max|ζ|≤δn∑a∈ZF(a,ζ(a))δpn=A. |
Put
γn:=CsV0pδpn, |
for all n∈N. Clearly, limn→∞γn=0. For n>0 is big enough, by Lemma 2.2 and (2.1), we can derive that
D−1((−∞,γn))⊂{ν∈Q:|ν(d)|≤δn,d∈Z}. | (3.1) |
Since D(0)=E(0)=0, for each n large enough, by (3.1), we get
η(γn)=infμ∈D−1((−∞,γn))(supν∈D−1((−∞,γn))∑a∈ZF(a,ν(a)))−E(μ)γn−D(μ)≤(supν∈D−1((−∞,γn))∑a∈ZF(a,ν(a)))−E(0)γn−D(0)=supν∈D−1((−∞,γn))∑a∈ZF(a,ν(a))γn≤max|w|≤δn∑a∈ZF(a,w(a))γn=pmax|w|≤δn∑a∈ZF(a,w(a))CsV0δpn. |
Therefore, by (2.2), we acquire that
ρ=lim infγ→(infQD(μ))+η(γ)=lim infγn→0+η(γn)≤limn→∞η(γn)≤limn→∞pmax|w|≤δn∑a∈ZF(a,w(a))CsV0δpn=pACsV0. | (3.2) |
From (3.2), we get
λ∈(Cb‖V‖1pB,CsV0pA)⊂(0,1ρ). |
Next, we verify that 0 is not a local minimum of K. First, suppose that B=+∞. Choosing M such that M>Cb‖V‖1pλ and let {hn} be a sequence of positive numbers, with limn→∞hn=0, there exists n1∈N such that for all n≥n1
∑a∈ZF(a,hn)>Mhpn. | (3.3) |
Therefore, let {ln} be a sequence in Q defined by
ln(a):=hn,for alla∈Z. |
It is easy to infer that ‖ln(a)‖Q→0 as n→∞. By (V), (2.1) and (3.3), we obtain
K(ln)=D(ln)−λE(ln)=1p‖ln‖pQ−λ∑a∈ZF(a,ln)=1p‖ln‖pQ−λ∑a∈ZF(a,hn)≤Cbp‖ln‖p−λ∑a∈ZF(a,hn)=Cbp∑a∈ZV(a)|ln(a)|p−λ∑a∈ZF(a,hn)=Cbp(∑a∈ZV(a))|hn|p−λ∑a∈ZF(a,hn)<Cbp‖V‖1hpn−λMhpn=(Cbp‖V‖1−λM)hpn. |
So, K(ln)<0=K(0) for each n≥n1 big enough. Next, suppose that B<+∞. Since λ>Cb‖V‖1pB, there exists ε>0 such that ε<B−Cb‖V‖1pλ. Hence, also choosing {hn} be a sequence of positive numbers, with limn→∞hn=0, there is n2∈N such that for all n≥n2
∑a∈ZF(a,hn)>(B−ε)hpn. | (3.4) |
Arguing as before and by choosing {ln} in Q as above, we get
K(ln)=D(ln)−λE(ln)=1p‖ln‖pQ−λ∑a∈ZF(a,ln)=1p‖ln‖pQ−λ∑a∈ZF(a,hn)≤Cbp‖ln‖p−λ∑a∈ZF(a,hn)=Cbp∑a∈ZV(a)|ln(a)|p−λ∑a∈ZF(a,hn)=Cbp(∑a∈ZV(a))|hn|p−λ∑a∈ZF(a,hn)<Cbp‖V‖1hpn−λ(B−ε)hpn=(Cbp‖V‖1−λ(B−ε))hpn. |
So, K(ln)<0=K(0) for each n≥n2 big enough. In general, 0 is not a local minimum of K. By Theorem 3.1, (a) is not valid, then we have a sequence {μn}⊂Q of critical points of K such that
limn→∞D(μn)=limn→∞1p‖μn‖Q=infQD(μ)=0 |
and
limn→∞K(μn)=infQD(μ)=0. |
By Lemma 2.3, we gain
‖μn‖∞≤C∞‖μn‖Q→0 |
as n→∞. By Lemma 2.7, the problem (1.1) admits infinitely many nontrivial homoclinic solutions. In addition, their critical values and their ℓ∞-norms tend to zero. This completes the proof.
Here, we give an example of a nonlinear term which can apply Theorem 1.1.
Example 4.1. We define
Ψ(n):=1333n,forn∈N+; |
Φ(n):=1333n−1,forn∈N+; |
χ(n):=13(p+1)33n−3,forn∈N+. |
Obviously, we know that Φ(n+1)<Ψ(n)<Φ(n) for all n∈N+ and limn→∞Ψ(n)=limn→∞Φ(n)=0. Set
f(a,u)=0,∀a∈Z∖N+. |
And for each a∈N+, let f(a,⋅) is a nonnegative continuous function such that
f(a,u)=0,∀u∈R∖(Ψ(a),Φ(a))and∫Φ(a)Ψ(a)f(a,η)dη=χ(a). |
There are many nonlinear terms that satisfy the above conditions. Here we give one of them as an example.
f(a,u)=∑n∈N+χ(n)2((u+Φ(n)+Ψ(n)2)2Φ2(n)−Ψ2(n))e{n}×[Ψ(n),Φ(n)](a,u) |
where eM×N is the indicator function on M×N. Then
A=lim infτ→0+max|ζ|≤τ∑a∈ZF(a,ζ(a))τp≤limn→∞max|ζ|≤Ψ(n)∑a∈ZF(a,ζ(a))Ψp(n)=limn→∞∑∞a=n+1F(a,ζ(a))Ψp(n)=limn→∞∑∞a=n+1χ(a)Ψp(n)≤limn→∞3χ(n+1)Ψp(n)=0 |
and
B=lim supτ→0+∑a∈ZF(a,ζ(a))τp≥limn→∞∑a∈ZF(a,ζ(a))Φp(n)≥limn→∞F(n,ζ(n))Φp(n)≥limn→∞χ(n)Φp(n)=+∞. |
Now it is easy to see that all the assumptions of Theorem 1.1 are satisfied, hence the corresponding conclusion can be delivered by Theorem 1.1.
B. Zhang was supported by the National Natural Science Foundation of China (No. 12171152), the Shandong Provincial Natural Science Foundation, PR China (No. ZR2023MA090) and the Cultivation Project of Young and Innovative Talents in Universities of Shandong Province.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
[1] |
X. Li, J. Gu, Z. Huang, W. Wang, J. Li, Optimal design of model predictive controller based on transient search optimization applied to robotic manipulators, Math. Biosci. Eng., 19 (2022), 9371–9387. https://doi.org/10.3934/mbe.2022436 doi: 10.3934/mbe.2022436
![]() |
[2] |
J. Wang, C. Zhan, S. Li, Q. Zhao, J. Liu, Z. Xie, Adaptive variational mode decomposition based on Archimedes optimization algorithm and its application to bearing fault diagnosis, Measurement, 191 (2022), 110798. https://doi.org/10.1016/j.measurement.2022.110798 doi: 10.1016/j.measurement.2022.110798
![]() |
[3] |
K. Balakrishnan, R. Dhanalakshmi, U. M. Khaire, Excogitating marine predators algorithm based on random opposition-based learning for feature selection, Concurr. Comput. Pract. Exp., 34 (2021), e6630. https://doi.org/10.1002/cpe.6630 doi: 10.1002/cpe.6630
![]() |
[4] |
A. Y. Mahdi, S. S. Yuhaniz, Optimal feature selection using novel flamingo search algorithm for classification of COVID-19 patients from clinical text, Math. Biosci. Eng., 20 (2022), 5268–5297. https://doi.org/10.3934/mbe.2023244 doi: 10.3934/mbe.2023244
![]() |
[5] |
S. Das, A. Bhattacharya, A. K. Chakraborty, Quasi-reflected ions motion optimization algorithm for short-term hydrothermal scheduling, Neural Comput. Appl., 29 (2018), 123–149. https://doi.org/10.1007/s00521-016-2529-8 doi: 10.1007/s00521-016-2529-8
![]() |
[6] |
H. D. Quoc, MEMINV: A hybrid efficient approximation method solving the multi skill-resource constrained project scheduling problem, Math. Biosci. Eng., 20 (2023), 15407–15430. https://doi.org/10.3934/mbe.2023688 doi: 10.3934/mbe.2023688
![]() |
[7] |
C. Wang, S. Jiao, Y. Li, Q. Zhang, Capacity optimization of a hybrid energy storage system considering wind-Solar reliability evaluation based on a novel multi-strategy snake optimization algorithm, Expert Syst. Appl., 231 (2023), 120602. https://doi.org/10.1016/j.eswa.2023.120602 doi: 10.1016/j.eswa.2023.120602
![]() |
[8] |
S. Jiao, C. Wang, R. Gao, Y. Li, Q. Zhang, A novel hybrid harris hawk sine cosine optimization algorithm for reactive power optimization problem, J. Exp. Theor. Artif. Intell., (2022), https://doi.org/10.1080/0952813X.2022.2115144 doi: 10.1080/0952813X.2022.2115144
![]() |
[9] |
S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Softw., 95 (2016), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008 doi: 10.1016/j.advengsoft.2016.01.008
![]() |
[10] |
Y. Xiao, X. Sun, Y. Guo, H. Cui, Y. Wang, J. Li, et al., An enhanced honey badger algorithm based on Levy flight and refraction opposition-based learning for engineering design problems, J. Intell. Fuzzy Syst., 43 (2022), 4517–4540. https://doi.org/10.3233/JIFS-213206 doi: 10.3233/JIFS-213206
![]() |
[11] |
S. Jiao, C. Wang, R. Gao, Y. Li, Q. Zhang, Harris Hawks optimization with multi-strategy search and application, Symmetry-Basel, 13 (2021), 2364. https://doi.org/10.3390/sym13122364 doi: 10.3390/sym13122364
![]() |
[12] |
J. H. Holland, Genetic algorithms, Sci. Am., 267 (1992), 66–73. https://doi.org/10.1038/scientificamerican0792-66 doi: 10.1038/scientificamerican0792-66
![]() |
[13] |
R. Storn, K. Price, Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim., 11 (1997), 341–359. https://doi.org/10.1023/A:1008202821328 doi: 10.1023/A:1008202821328
![]() |
[14] |
R. Nand, B. N. Sharma, K. Chaudhary, Stepping ahead firefly algorithm and hybridization with evolution strategy for global optimization problems, Appl. Soft Comput., 109 (2021), 107517. https://doi.org/10.1016/j.asoc.2021.107517 doi: 10.1016/j.asoc.2021.107517
![]() |
[15] |
X. Yao, Y. Liu, G. Lin, Evolutionary programming made faster, IEEE Trans. Evol. Comput., 3 (1999), 82–102. https://doi.org/10.1109/4235.771163 doi: 10.1109/4235.771163
![]() |
[16] | J. Kennedy, R. Eberhart, Particle swarm optimization, in Proceedings of ICNN'95 - International Conference on Neural Networks, (1995), 1942–1948. https://doi.org/10.1109/ICNN.1995.488968 |
[17] |
X. S. Yang, Firefly algorithm, stochastic test functions and design optimization, Int. J. Bio-Inspired Comput., 2 (2010), 78–84. https://doi.org/10.1504/IJBIC.2010.032124 doi: 10.1504/IJBIC.2010.032124
![]() |
[18] |
S. Zhao, T. Zhang, S. Ma, M. Wang, Sea-horse optimizer: A novel nature-inspired meta-heuristic for global optimization problems, Appl. Intell., 53 (2022), 11833–11860. https://doi.org/10.1007/s10489-022-03994-3 doi: 10.1007/s10489-022-03994-3
![]() |
[19] |
A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, H. Chen, Harris Hawks optimization: Algorithm and applications, Future Gener. Comput. Syst., 97 (2019), 849–872. https://doi.org/10.1016/j.future.2019.02.028 doi: 10.1016/j.future.2019.02.028
![]() |
[20] |
S. Arora, S. Singh, Butterfly optimization algorithm: A novel approach for global optimization, Soft Comput., 23 (2019), 715–734. https://doi.org/10.1007/s00500-018-3102-4 doi: 10.1007/s00500-018-3102-4
![]() |
[21] |
J. O. Agushaka, A. E. Ezugwu, L. Abualigah, Dwarf mongoose optimization algorithm, Comput. Methods Appl. Mech. Engrg., 391 (2022), 114570. https://doi.org/10.1016/j.cma.2022.114570 doi: 10.1016/j.cma.2022.114570
![]() |
[22] |
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science, 220 (1983), 671–680. https://doi.org/10.1126/science.220.4598.671 doi: 10.1126/science.220.4598.671
![]() |
[23] |
I. Ahmadianfar, O. Bozorg-Haddad, X. Chu, Gradient-based optimizer: A new metaheuristic optimization algorithm, Inf. Sci., 540 (2020), 131–159. https://doi.org/10.1016/j.ins.2020.06.037 doi: 10.1016/j.ins.2020.06.037
![]() |
[24] |
S. Talatahari, M. Azizi, A. H. Gandomi, Material generation algorithm: A novel metaheuristic algorithm for optimization of engineering problems, Processes, 9 (2021), 859. https://doi.org/10.3390/pr9050859 doi: 10.3390/pr9050859
![]() |
[25] |
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
![]() |
[26] |
V. Goodarzimehr, S. Talatahari, S. Shojaee, S. Hamzehei-Javaran, Special relativity search for applied mechanics and engineering, Comput. Meth. Appl. Mech. Eng., 403 (2023), 115734. https://doi.org/10.1016/j.cma.2022.115734 doi: 10.1016/j.cma.2022.115734
![]() |
[27] |
F. A. Hashim, K. Hussain, E. H. Houssein, M. S. Mabrouk, W. Al-Atabany, Archimedes optimization algorithm: A new metaheuristic algorithm for solving optimization problems, Appl. Intell., 51 (2020), 1531–1551. https://doi.org/10.1007/s10489-020-01893-z doi: 10.1007/s10489-020-01893-z
![]() |
[28] |
M. Jahangiri, M. A. Hadianfard, M. A. Najafgholipour, M. Jahangiri, M. R. Gerami, Interactive autodidactic school: A new metaheuristic optimization algorithm for solving mathematical and structural design optimization problems, Comput. Struct., 235 (2020), 106268. https://doi.org/10.1016/j.compstruc.2020.106268 doi: 10.1016/j.compstruc.2020.106268
![]() |
[29] |
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
![]() |
[30] |
A. Naik, S. C. Satapathy, Past present future: A new human-based algorithm for stochastic optimization, Soft Comput., 25 (2021), 12915–12976. https://doi.org/10.1007/s00500-021-06229-8 doi: 10.1007/s00500-021-06229-8
![]() |
[31] |
H. Bayzidi, S. Talatahari, M. Saraee, C. P. Lamarche, Social network search for solving engineering optimization problems, Comput. Intell. Neurosci., 2021 (2021), 8548639. https://doi.org/10.1155/2021/8548639 doi: 10.1155/2021/8548639
![]() |
[32] | Q. Zhang, R. Wang, J. Yang, K. Ding, Y. Li, J. Hu, Collective decision optimization algorithm: A new heuristic optimization method, Neurocomputing, 221 (2017), 123–137. ttps://doi.org/10.1016/j.neucom.2016.09.068 |
[33] |
M. A. Al-Betar, Z. A. A. Alyasseri, M. A. Awadallah, I. Abu Doush, Coronavirus herd immunity optimizer (CHIO), Neural Comput. Appl., 33 (2021), 5011–5042. https://doi.org/10.1007/s00521-020-05296-6 doi: 10.1007/s00521-020-05296-6
![]() |
[34] |
S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Softw., 69 (2014), 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007 doi: 10.1016/j.advengsoft.2013.12.007
![]() |
[35] |
D. H. Wolpert, W. G. Macready, No free lunch theorem for optimization, IEEE Trans. Evol. Comput., 1 (1997), 67–82. https://doi.org/10.1109/4235.585893 doi: 10.1109/4235.585893
![]() |
[36] |
H. T. K. Abdelbadie, A. T. M. Taha, H. M. Hasanien, R. A. Turky, S. M. Muyeen, Stability enhancement of wind energy conversion systems based on optimal superconducting magnetic energy storage systems using the Archimedes optimization algorithm, Processes, 10 (2022), 366. https://doi.org/10.3390/pr10020366 doi: 10.3390/pr10020366
![]() |
[37] |
I. Neggaz, H. Fizazi, An intelligent handcrafted feature selection using Archimedes optimization algorithm for facial analysis, Soft Comput., 26 (2022), 10435–10464. https://doi.org/10.1007/s00500-022-06886-3 doi: 10.1007/s00500-022-06886-3
![]() |
[38] |
J. Balakrishnan, C. Govindaraju, Multi-phase permanent magnet generator with Halbach array for direct driven wind turbine: a hybrid technique, Energy Sources Part A-Recovery Util. Environ. Eff., 44 (2022), 5699–5717. https://doi.org/10.1080/15567036.2022.2086324 doi: 10.1080/15567036.2022.2086324
![]() |
[39] |
J. Annrose, N. H. A. Rufus, C. R. E. S. Rex, D. G. Immanuel, A cloud-based platform for soybean plant disease classification using Archimedes optimization based hybrid deep learning model, Wirel. Pers. Commun., 122 (2021), 2995–3017. https://doi.org/10.1007/s11277-021-09038-2 doi: 10.1007/s11277-021-09038-2
![]() |
[40] | H. R. Tizhoosh, Opposition-based learning: A new scheme for machine intelligence, in Proceedings of International Conference on Computational Intelligence for Modelling, Control & Automation Jointly with International Conference on Intelligent Agents, Web Technologies & Internet Commerce, (2006), 695–701. https://doi.org/10.1109/CIMCA.2005.1631345 |
[41] |
B. S. Yildiz, N. Pholdee, S. Bureerat, A. R. Yildiz, S. M. Sait, Enhanced grasshopper optimization algorithm using elite opposition-based learning for solving real-world engineering problems, Eng. Comput., 38 (2021), 4207–4219. https://doi.org/10.1007/s00366-021-01368-w doi: 10.1007/s00366-021-01368-w
![]() |
[42] |
E. H. Houssein, B. E. D. Helmy, H. Rezk, A. M. Nassef, An efficient orthogonal opposition-based learning slime mould algorithm for maximum power point tracking, Neural Comput. Appl., 34 (2022), 3671–3695. https://doi.org/10.1007/s00521-021-06634-y doi: 10.1007/s00521-021-06634-y
![]() |
[43] |
A. Arcuri, G. Fraser, Parameter tuning or default values? An empirical investigation in search-based software engineering, Empir. Softw. Eng., 18 (2013), 594–623. https://doi.org/10.1007/s10664-013-9249-9 doi: 10.1007/s10664-013-9249-9
![]() |
[44] |
M. H. Nadimi-Shahraki, S. Taghian, S. Mirjalili, An improved grey wolf optimizer for solving engineering problems, Expert Syst. Appl., 166 (2021), 113917. https://doi.org/10.1016/j.eswa.2020.113917 doi: 10.1016/j.eswa.2020.113917
![]() |
[45] |
C. Ma, H. Huang, Q. Fan, J. Wei, Y. Du, W. Gao, Grey wolf optimizer based on Aquila exploration method, Expert Syst. Appl., 205 (2022), 117629. https://doi.org/10.1016/j.eswa.2022.117629 doi: 10.1016/j.eswa.2022.117629
![]() |
[46] |
O. E. Turgut, M. S. Turgut, Local search enhanced Aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems, Math. Comput. Simul., 206 (2022), 302–374. https://doi.org/10.1016/j.matcom.2022.11.020 doi: 10.1016/j.matcom.2022.11.020
![]() |
[47] |
E. V. Altay, Hybrid Archimedes optimization algorithm enhanced with mutualism scheme for global optimization problems, Artif. Intell. Rev., 56 (2022), 6885–6946. https://doi.org/10.1007/s10462-022-10340-z doi: 10.1007/s10462-022-10340-z
![]() |
[48] |
N. Chopra, M. M. Ansari, Golden jackal optimization: a novel nature-inspired optimizer for engineering applications, Expert Syst. Appl., 198 (2022), 116924. https://doi.org/10.1016/j.eswa.2022.116924 doi: 10.1016/j.eswa.2022.116924
![]() |
[49] |
B. Abdollahzadeh, F. S. Gharehchopogh, S. Mirjalili, African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems, Comput. Ind. Eng., 158 (2021), 107408. https://doi.org/10.1016/j.cie.2021.107408 doi: 10.1016/j.cie.2021.107408
![]() |
[50] |
S. Rajmohan, E. Elakkiya, S. R. Sreeja, Multi-cohort whale optimization with search space tightening for engineering optimization problems, Neural Comput. Appl., 35 (2023), 8967–8986. https://doi.org/10.1007/s00521-022-08139-8 doi: 10.1007/s00521-022-08139-8
![]() |
[51] |
F. S. Gharehchopogh, M. H. Nadimi-Shahraki, S. Barshandeh, B. Abdollahzadeh, H. Zamani, CQFFA: A chaotic quasi-oppositional farmland fertility algorithm for solving engineering optimization problems, J. Bionic Eng., 20 (2022), 158–183. https://doi.org/10.1007/s42235-022-00255-4 doi: 10.1007/s42235-022-00255-4
![]() |
[52] |
J. Zhao, Z. Gao, The heterogeneous Aquila optimization algorithm, Math. Biosci. Eng., 19 (2022), 5867–5904. https://doi.org/10.3934/mbe.2022275 doi: 10.3934/mbe.2022275
![]() |
[53] |
Y. Xiao, Y. Guo, H. Cui, Y. Wang, J. Li, Y. Zhang, IHAOAVOA: An improved hybrid Aquila optimizer and African vultures optimization algorithm for global optimization problems, Math. Biosci. Eng., 19 (2022), 10963–11017. https://doi.org/10.3934/mbe.2022512 doi: 10.3934/mbe.2022512
![]() |
[54] |
A. Seyyedabbasi, F. Kiani, Sand cat swarm optimization: A nature-inspired algorithm to solve global optimization problems, Eng. Comput., 39 (2022), 2627–2651. https://doi.org/10.1007/s00366-022-01604-x doi: 10.1007/s00366-022-01604-x
![]() |
[55] |
F. S. Gharehchopogh, An improved tunicate swarm algorithm with best-random mutation strategy for global optimization problems, J. Bionic Eng., 19 (2022), 1177–1202. https://doi.org/10.1007/s42235-022-00185-1 doi: 10.1007/s42235-022-00185-1
![]() |
[56] |
P. Chen, S. Zhou, Q. Zhang, N. Kasabov, A meta-inspired termite queen algorithm for global optimization and engineering design problems, Eng. Appl. Artif. Intell., 111 (2022), 104805. https://doi.org/10.1016/j.engappai.2022.104805 doi: 10.1016/j.engappai.2022.104805
![]() |
[57] |
S. Duan, H. Luo, H. Liu, An elastic collision seeker optimization algorithm for optimization constrained engineering problems, Math. Probl. Eng., 2022 (2022), 1344667. https://doi.org/10.1155/2022/1344667 doi: 10.1155/2022/1344667
![]() |
[58] |
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
![]() |
[59] |
H. Yu, S. Qiao, A. A. Heidari, C. Bi, H. Chen, Individual disturbance and attraction repulsion strategy enhanced seagull optimization for engineering design, Mathematics, 10 (2022), 276. https://doi.org/10.3390/math10020276 doi: 10.3390/math10020276
![]() |
[60] |
G. Hu, J. Zhong, B. Du, G. Wei, An enhanced hybrid arithmetic optimization algorithm for engineering applications, Comput. Meth. Appl. Mech. Eng., 394 (2022), 114901. https://doi.org/10.1016/j.cma.2022.114901 doi: 10.1016/j.cma.2022.114901
![]() |
1. | Meiqiang Feng, Nontrivial p-convex solutions to singular p-Monge-Ampère problems: Existence, Multiplicity and Nonexistence, 2024, 16, 2836-3310, 71, 10.3934/cam.2024004 | |
2. | Caihong Gu, Yanbin Tang, Well-posedness of Cauchy problem of fractional drift diffusion system in non-critical spaces with power-law nonlinearity, 2024, 13, 2191-950X, 10.1515/anona-2024-0023 | |
3. | Eleonora Amoroso, Angela Sciammetta, Patrick Winkert, Anisotropic (→p,→q)-Laplacian problems with superlinear nonlinearities, 2024, 16, 2836-3310, 1, 10.3934/cam.2024001 |