Research article Special Issues

IHAOAVOA: An improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems


  • Aquila Optimizer (AO) and African Vultures Optimization Algorithm (AVOA) are two newly developed meta-heuristic algorithms that simulate several intelligent hunting behaviors of Aquila and African vulture in nature, respectively. AO has powerful global exploration capability, whereas its local exploitation phase is not stable enough. On the other hand, AVOA possesses promising exploitation capability but insufficient exploration mechanisms. Based on the characteristics of both algorithms, in this paper, we propose an improved hybrid AO and AVOA optimizer called IHAOAVOA to overcome the deficiencies in the single algorithm and provide higher-quality solutions for solving global optimization problems. First, the exploration phase of AO and the exploitation phase of AVOA are combined to retain the valuable search competence of each. Then, a new composite opposition-based learning (COBL) is designed to increase the population diversity and help the hybrid algorithm escape from the local optima. In addition, to more effectively guide the search process and balance the exploration and exploitation, the fitness-distance balance (FDB) selection strategy is introduced to modify the core position update formula. The performance of the proposed IHAOAVOA is comprehensively investigated and analyzed by comparing against the basic AO, AVOA, and six state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Experimental results demonstrate that IHAOAVOA achieves superior solution accuracy, convergence speed, and local optima avoidance than other comparison methods on most test functions. Furthermore, the practicality of IHAOAVOA is highlighted by solving five engineering design problems. Our findings reveal that the proposed technique is also highly competitive and promising when addressing real-world optimization tasks. The source code of the IHAOAVOA is publicly available at https://doi.org/10.24433/CO.2373662.v1.

    Citation: Yaning Xiao, Yanling Guo, Hao Cui, Yangwei Wang, Jian Li, Yapeng Zhang. IHAOAVOA: An improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems[J]. Mathematical Biosciences and Engineering, 2022, 19(11): 10963-11017. doi: 10.3934/mbe.2022512

    Related Papers:

    [1] Anatoliy Martynyuk, Gani Stamov, Ivanka Stamova, Yulya Martynyuk–Chernienko . On the regularization and matrix Lyapunov functions for fuzzy differential systems with uncertain parameters. Electronic Research Archive, 2023, 31(10): 6089-6119. doi: 10.3934/era.2023310
    [2] Vo Van Au, Hossein Jafari, Zakia Hammouch, Nguyen Huy Tuan . On a final value problem for a nonlinear fractional pseudo-parabolic equation. Electronic Research Archive, 2021, 29(1): 1709-1734. doi: 10.3934/era.2020088
    [3] Yuan Tian, Hua Guo, Wenyu Shen, Xinrui Yan, Jie Zheng, Kaibiao Sun . Dynamic analysis and validation of a prey-predator model based on fish harvesting and discontinuous prey refuge effect in uncertain environments. Electronic Research Archive, 2025, 33(2): 973-994. doi: 10.3934/era.2025044
    [4] Víctor León, Bruno Scárdua . A geometric-analytic study of linear differential equations of order two. Electronic Research Archive, 2021, 29(2): 2101-2127. doi: 10.3934/era.2020107
    [5] Eteri Gordadze, Alexander Meskhi, Maria Alessandra Ragusa . On some extrapolation in generalized grand Morrey spaces with applications to PDEs. Electronic Research Archive, 2024, 32(1): 551-564. doi: 10.3934/era.2024027
    [6] Liju Yu, Jingjun Zhang . Global solution to the complex short pulse equation. Electronic Research Archive, 2024, 32(8): 4809-4827. doi: 10.3934/era.2024220
    [7] José Luis Díaz Palencia, Saeed Ur Rahman, Saman Hanif . Regularity criteria for a two dimensional Erying-Powell fluid flowing in a MHD porous medium. Electronic Research Archive, 2022, 30(11): 3949-3976. doi: 10.3934/era.2022201
    [8] Vo Van Au, Jagdev Singh, Anh Tuan Nguyen . Well-posedness results and blow-up for a semi-linear time fractional diffusion equation with variable coefficients. Electronic Research Archive, 2021, 29(6): 3581-3607. doi: 10.3934/era.2021052
    [9] Noelia Bazarra, José R. Fernández, Ramón Quintanilla . Numerical analysis of a problem in micropolar thermoviscoelasticity. Electronic Research Archive, 2022, 30(2): 683-700. doi: 10.3934/era.2022036
    [10] Hua Qiu, Zheng-An Yao . The regularized Boussinesq equations with partial dissipations in dimension two. Electronic Research Archive, 2020, 28(4): 1375-1393. doi: 10.3934/era.2020073
  • Aquila Optimizer (AO) and African Vultures Optimization Algorithm (AVOA) are two newly developed meta-heuristic algorithms that simulate several intelligent hunting behaviors of Aquila and African vulture in nature, respectively. AO has powerful global exploration capability, whereas its local exploitation phase is not stable enough. On the other hand, AVOA possesses promising exploitation capability but insufficient exploration mechanisms. Based on the characteristics of both algorithms, in this paper, we propose an improved hybrid AO and AVOA optimizer called IHAOAVOA to overcome the deficiencies in the single algorithm and provide higher-quality solutions for solving global optimization problems. First, the exploration phase of AO and the exploitation phase of AVOA are combined to retain the valuable search competence of each. Then, a new composite opposition-based learning (COBL) is designed to increase the population diversity and help the hybrid algorithm escape from the local optima. In addition, to more effectively guide the search process and balance the exploration and exploitation, the fitness-distance balance (FDB) selection strategy is introduced to modify the core position update formula. The performance of the proposed IHAOAVOA is comprehensively investigated and analyzed by comparing against the basic AO, AVOA, and six state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Experimental results demonstrate that IHAOAVOA achieves superior solution accuracy, convergence speed, and local optima avoidance than other comparison methods on most test functions. Furthermore, the practicality of IHAOAVOA is highlighted by solving five engineering design problems. Our findings reveal that the proposed technique is also highly competitive and promising when addressing real-world optimization tasks. The source code of the IHAOAVOA is publicly available at https://doi.org/10.24433/CO.2373662.v1.



    It is well known that the general approaches in fuzzy differential systems are established using the concept of fuzzy sets, as introduced by Zadeh [1] in 1965. The theory of fuzzy sets and some of their applications have been developed in a number of books and papers. We will refer the readers to [2,3,4] and the references cited there.

    On the other hand, the notions of an HHukuhara derivative and H differentiability were introduced in 1983 for fuzzy mappings [5], and the notion of integrals in [6]. Since then, the investigations of fuzzy differential equations have undergone rapid development. See, for example, [7,8,9,10,11,12,13,14] and the references therein. The theory of fuzzy differential equations is still a hot topic for research [15,16,17,18,19] including numerous applications considering fuzzy neural networks and fuzzy controllers [20,21,22,23,24,25].

    It is also well known that the functionality of many complex engineering systems, as well as, the long life of their practical operation are provided under the conditions of uncertainties [26]. In fact, due to inaccuracy in the measurements of the model parameters, data input and different types of unpredictability, uncertain parameters occur in a real system [27]. It is, therefore, clear that the study of the effects of uncertain values of the parameters on the fundamental and qualitative behavior of a system is of significant interest for theory and applications [28,29,30,31,32,33,34], including fuzzy modeling [35]. Considering the high importance of considering uncertain parameters, the theory of uncertain fuzzy differential equations needs future development and this is the basic aim and contribution of our research.

    This paper deals with systems of fuzzy differential equations that simulate the perturbed motion of a system with uncertain values of parameters that belong to a certain domain. A regularization procedure is proposed for the family of differential equations under consideration with respect to the uncertain parameter. An analysis of some fundamental properties of the solutions is performed for both, the original fuzzy system of differential equations and the intermediate families of differential equations. The introduced regularization scheme expands the horizon for the extension of the fundamental and qualitative theory of fuzzy differential equations to the equations involving uncertain parameters. The authors expect that the proposed results will be of particular interest to researchers in the study of the qualitative properties of such systems, including equations with delays and some modifications of the Lyapunov theory. In addition, the engineering applications of such results to the design of efficient fuzzy controllers are numerous.

    The innovation and practical significance of our research are as follows:

    (ⅰ) we introduce a new regularization scheme for uncertain fuzzy differential equations;

    (ⅱ) new existence criteria of the solutions of the regularized fuzzy differential equations are proposed;

    (ⅲ) the distance between two solutions is estimated;

    (ⅳ) the offered regularization scheme reduces a family of fuzzy differential equations to a simple form that allows analysis of the properties of solutions of both the original fuzzy system of differential equations, as well as the intermediate families of differential equations.

    The rest of the paper is organized according to the following scenario. In Section 2 we provide the necessary preliminary notes from the theory of fuzzy sets. Some main properties of fuzzy functions and HHukuhara derivatives are also given. In Section 3 we introduce a regularization procedure for uncertain fuzzy systems of differential equations, and the basic problem of analyzing such systems based on the developed procedure is presented. In Section 4 conditions for existence of the solutions of the regularized fuzzy differential equations are established. In Section 5 we offer an estimate of the distance between solutions of the regularized equations. The closing Section 6 provides some comments and future directions for research.

    This section is mainly based on the results in [2,4,14].

    The use of fuzzy sets introduced in [1] has facilitated the mathematical modeling and analysis of real processes that involve uncertain parameters. Recently, the fuzzy set approach achieved significant development. In this section, we will present some elements from the fuzzy set theory and fuzzy functions that are necessary for the analysis of uncertain systems.

    Consider a basic set X with elements of an arbitrary nature. To each element xX a value of a membership function ξ(x) is assigned, and the function ξ(x) takes its values from the closed interval [0,1].

    Following [1], for a function ξ:X[0,1], we consider a fuzzy subset of the set X as a nonempty subset with elements {(x,ξ(x)):xX} from X×[0,1].

    For a fuzzy set with a membership function ξ on X its ϰ-level sets [ξ]ϰ are defined by

    [ξ]ϰ={xX:  ξ(x)ϰ}for anyϰ(0,1].

    The closure of the union of all ϰ-level sets for a fuzzy set with a membership function ξ in the general topological space X is called its support, and it is denoted by [ξ]0, i.e.,

    [ξ]0=¯ϰ(0,1][ξ]ϰ.

    Note that most often, the space X is the N-dimensional Euclidean space RN equipped with a norm .

    Next, the Hausdorff distance between two nonempty subsets U and V of RN is defined as

    ΔH(U,V)=min{r0:U{VVr(0)},V{UVr(0)}},

    where Vr(0)={xRN:x<r}, r0.

    The above distance is symmetric with respect to both subsets U and V. For more properties of ΔH(U,V) we refer the reader to [2,4,14].

    We will next need the space EN of functions ξ:RN[0,1], which satisfy the following conditions (cf. [2]):

    1) ξ is upper semicontinuous;

    2) there exists an x0RN such that ξ(x0)=1;

    3) ξ is fuzzy convex, i. e.,

    ξ(νx+(1ν)y)min[ξ(x),ξ(y)]

    for any values of ν[0,1];

    4) the closure of the set {xRN:ξ(x)>0} is a compact subset of RN.

    It is well known that [7,8,9,10,11,12,13,14] and [15,16,17,18,19], if a fuzzy set with a membership function ξ is a fuzzy convex set, then [ξ]ϰ is convex in RN for any ϰ[0,1].

    Since EN is a space of functions ξ:RN[0,1], then a metric in it can be determined as

    Δ(ξ,η)=sup{|ξ(x)η(x)|: xRN}.

    The least upper bound of ΔH on EN is defined by

    d[ξ,η]=sup{ΔH([ξ]ϰ,[η]ϰ): ϰ[0,1]}

    for ξ,ηEN. The above defined d[ξ,η] satisfies all requirements to be a metric in EN [2].

    Consider a compact T=[α,β], β>α>0.

    The mapping F:TEN is strictly measurable, if for any ϰ[0,1] the multivalued mapping Fϰ:TPk(RN), defined as Fϰ(τ)=[F(τ)]ϰ, is measurable in the sense of Lebesgue under the condition that Pk(RN) is equipped with a topology generated by the Hausdorff metric, where Pk(RN) denotes the family of all nonempty compact convex subsets of RN [11,36].

    The mapping F:TEN is integrally bounded if there exists an integrable function ω(τ) such that xω(τ) for xF0(τ).

    We will denote by βαF(τ)dτ the integral of F on the interval T defined as

    TF(τ)dτ={Tˉf(τ)dtˉf: IRN is a measurable selection forFϰ}

    for any 0<ϰ1.

    The strictly measurable and integrally bounded mapping F:TRN is integrable on I, if TF(τ)dτEN.

    Numerous important properties of fuzzy functions are given in [2,4,11].

    Let ξ,ηEN. If there exists ζEN such that ξ=η+ζ, ζ is determined as the Hukuhara-type difference of the subsets ξ and η and is denoted by ξη.

    If both limits in the metric space (EN,Δ)

    lim{[F(τ0+h)F(τ0)]h1:h0+} and lim{[F(τ0)F(τ0h)]h1:h0+}

    exist and are equal to L, then the mapping F:TEN is differentiable at the point τ0T, and L=F(τ0)EN.

    The family {DHFϰ(τ):ϰ[0,1]} determines an element F(τ)EN. If Fϰ is differentiable, then the multivalued mapping Fϰ is differentiable in the sense of Hukuhara for all ϰ[0,1] and

    DHFϰ(τ)=[F(τ)]ϰ,

    where DHFϰ is the Hukuhara-type derivative of Fϰ.

    Several basic properties of differentiable mappings F:IEN in the Hukuhara sense are given below:

    1) F is continuous on T;

    2) For τ1,τ2T and τ1τ2 there exists an ιEN such that F(τ2)=F(τ1)+ι;

    3) If the derivative F is integrable on T, then

    F(σ)=F(α)+σαF(τ)dτ;

    4) If θ0EN and θ0(x)={1,forx=0,0,xRN{0}, then

    Δ(F(β),F(α))(βα)supτTΔ(F(τ),θ0). (2.1)

    In this section, we will introduce a regularization scheme for a system of fuzzy differential equations with respect to an uncertain parameter.

    Consider the following fuzzy system with an uncertain parameter

    dξdτ=f(τ,ξ,μ),ξ(τ0)=ξ0, (3.1)

    where τ0R+, ξEN, fC(R+×EN×S,EN), μS is an uncertain parameter, S is a compact set in Rl.

    The parameter vector μ that represents the uncertainty in system (3.1) may vary in nature and can represent different characteristics. More precisely, the uncertainty parameter μ:

    (a) may represent an uncertain value of a certain physical parameter;

    (b) may describe an estimate of an external disturbance;

    (c) may represent an inaccurate measured value of the input effect of one of the subsystems on the other one;

    (d) may represent some nonlinear elements of the considered mechanical system that are too complicated to be measured accurately;

    (e) may be an indicator of the existence of some inaccuracies in the system (3.1);

    (f) may be a union of the characteristics (a)–(e).

    Denote

    fm(τ,ξ)=¯coμSf(τ,ξ,μ),SRl, (3.2)
    fM(τ,ξ)=¯coμSf(τ,ξ,μ),SRl (3.3)

    and suppose that fm(τ,ξ), fM(τ,ξ)C(R+×EN,EN). It is clear that

    fm(τ,ξ)f(τ,ξ,μ)fM(τ,ξ) (3.4)

    for (τ,ξ,μ)R+×EN×S.

    For (τ,η)R+×EN and 0ϰ1, we introduce a family of mappings fϰ(τ,η) by

    fϰ(τ,η)=fM(τ,η)ϰ+(1ϰ)fm(τ,η) (3.5)

    and, we will introduce a system of fuzzy differential equations corresponding to the system (3.1) as

    dηdτ=fϰ(τ,η),η(τ0)=η0, (3.6)

    where fϰC(T×EN,EN), T=[τ0,τ0+a], τ00, a>0, ϰ[0,1].

    We will say that the mapping η:TEN is a solution of (3.6), if it is weakly continuous and satisfies the integral equation

    η(τ)=η0+ττ0fϰ(σ,η(σ))dσ (3.7)

    for all τT and any value of ϰ[0,1].

    The introduced fuzzy system of differential equations (3.6) is considered as a regularized system of the system (3.1) with respect to the uncertain parameter.

    It is clear that for all τT we have diam[ξ(τ)]ϰdiam[ξ0]ϰ, for any value of ϰ[0,1], where diam denotes the set diameter of any level [2,4,11].

    The main goal and contribution of the present paper are to investigate some fundamental properties of the regularized system (3.6) on T and [τ0,).

    In this section we will state criteria for the existence and uniqueness of the solutions of the introduced regularized problem (3.6).

    Theorem 4.1. If the family fϰ(τ,η)C(T×EN,EN) for any ϰ[0,1] and there exists a positive constant Lϰ such that

    d[fϰ(τ,η),fϰ(τ,ˉη)]Lϰd[η,ˉη], τT,η,ˉηEN,

    then for the problem (3.6) there exists a unique solution defined on T for any ϰ[0,1].

    Proof. We define a metric in C(T,EN) as:

    H[η,ˉη]=supTd[η(τ),ˉη(τ)]eλτ

    for all η,ˉηEN, where λ=2maxLϰ, ϰ[0,1]. The completeness of (EN,d)implies the completeness of the space (C(T,EN),H).

    Let ξϰC(T,EN) for any ϰ[0,1] and the mapping Tξϰ is defined as

    Tξϰ(τ)=ξ0+ττ0fϰ(σ,ξϰ(σ))dσ,ϰ[0,1].

    From the above definition we have that TξϰC(T,EN) and

    d[Tη(τ),Tˉη(τ)]=d[η0+ττ0fϰ(σ,η(σ))dσ,η0+ττ0fϰ(σ,ˉη(σ))dσ]
    =d[ττ0fϰ(σ,η(σ))dσ,ττ0fϰ(σ,ˉη(σ))dσ]
    ττ0d[fϰ(σ,η(σ)),fϰ(σ,ˉη(σ))]dσ<maxϰLϰττ0d[η(σ),ˉη(σ)]dσ,τT, ϰ[0,1].

    Since d[η,ˉη]=H[η,ˉη]eλτ, we have

    eλτd[Tη(τ),Tˉη(τ)]<maxϰLϰeλτH[η,ˉη]ττ0eλσdσmaxϰLϰλH[η,ˉη]. (4.1)

    Given the choice of λ, from (4.1) we obtain

    H[Tη,Tˉη]<12H[η,ˉη].

    The last inequality implies the existence of a unique fixed point ξϰ(τ) for the operator Tξϰ which is the solution of the initial value problem (3.6) for ϰ[0,1].

    Now, let us define a second metric in C(T,EN) as follows:

    H[η,ˉη]=supTd[η(τ),ˉη(τ)],

    where η,ˉηEN, and consider a family of continuous functions that have equal variation over a given neighborhood. Such a family of functions is know to be equi-continuous [11].

    Theorem 4.2. If the family fϰ(τ,η)C(T×EN,EN) for any ϰ[0,1] and there exists a positive constant Ωϰ>0 such that

    d[fϰ(τ,η),θ0]Ωϰ, τT, η,θ0EN,

    then for the problem (3.6) there exists a unique solution defined on T for any ϰ[0,1].

    Proof. Let the set B, BC(T,EN) be bounded. Then, according to the definition of the mapping T, the set TB={Tξϰ:ξϰB,ϰ[0,1]} is bounded, if it is equi-continuous, and for any τT the set [TB](τ)={[Tξϰ](τ):τT,ϰ[0,1]} is a bounded subset of EN.

    For τ1<τ2T and ηB, we have from (2.1) that

    d[Tη(τ1),Tη(τ2)]|τ2τ1|maxTd[f(τ,η(τ)),θ0]|τ2τ1|Ωϰ<|τ2τ1|¯Ω, (4.2)

    where ¯Ω=maxϰΩϰ. This implies the equi-continuity of the set TB.

    Also, for any fixed τT we have that

    d[Tη(τ),Tη(τ1)]<|ττ1|¯Ω (4.3)

    for τ1T, ηB.

    From the above inequality, we conclude that the set {[Tξϰ](τ):ξϰB,ϰ[0,1]} is bounded in the space EN, which, according to the Arzela–Ascoli theorem, implies that the set TB is a relatively compact subset of C(T,EN).

    Next, for ϰ[0,1] and M>0 we define B={ξϰC(T,EN):H[ξϰ,θ0]<M¯Ω, B(C(T,EN),H).

    Obviously, TBB, since ξϰC(T,EN), ϰ[0,1] and d[Tξϰ(τ),Tξϰ(τ0)]=d[Tξϰ(τ),θ0]|ττ0|Ωϰ<M¯Ω, ϰ[0,1]. Let θ0(τ)=θ0 for τT, where θ0(τ):TEN. Then

    H[Tξϰ,Tθ0]=supTd[(Tξϰ)(τ),(Tθ0)(τ)]|ττ0|Ωϰ<M¯Ω.

    Hence, T is compact. Therefore, it has a fixed point ξϰ(t), and according to the definition of T, ξϰ(t) is the solution of the initial value problem (3.6) for ϰ[0,1]. This completes the proof.

    Remark 4.3. Theorems 4.1 and 4.2 offered new existence criteria for the regularized system (3.6). The proposed criteria show that the idea to use a family of mappings and regularize the fuzzy system (3.1) with respect to uncertain parameters greatly benefits its analysis. Note that due to some limitations and difficulties in the study of fuzzy differential systems with uncertain parameters, the published results in this direction are very few [11,18]. Hence, the proposed regularization procedure complements such published accomplishments and, due to the offered advantages is more appropriate for applications.

    Remark 4.4. The proposed existence results also extend and generalize some recently published existence results for differential systems with initial and nonlocal boundary conditions [37], where the fixed-point argument plays a crucial role in manipulating the integral equation, to the fuzzy case.

    The validity of Theorem 4.1 is demonstrated by the next example.

    Example 4.5. Let fϰ(τ,η)=Aϰη+Bϰ for any value of ϰ[0,1] and Aϰ,BϰE1. Consider the initial value problem

    dηdτ=Aϰη+Bϰ, (4.4)
    η(τ0)=η0D0E1. (4.5)

    It is easy to show that

    AϰηAϰˉη∣≤Lϰd[η,ˉη],

    where Lϰ=maxAϰ for ϰ[0,1].

    Therefore, all conditions of Theorem 4.1 are satisfied, and hence there exists a unique solution of the initial value problem (4.4)-(4.5). The unique solution is of the type

    η(τ,τ0,η0)=ϰ[0,1][ηϰ(τ,τ0,η0),η0D0], (4.6)

    where

    ηϰ(τ,τ0,η0)=η0expAϰ(ττ0)+(BϰAϰ)[expAϰ(ττ0)1]

    for any value of ϰ[0,1]. A solution in the form of (4.6) is compact for all tT and the union contains all upper and lower solutions of the problem (4.4)-(4.5). For the rationale for this approach, see [11], pp. 150–155).

    Remark 4.6. The conditions of Theorem 4.1 imply the following estimate

    d[fϰ(τ,η),fϰ(τ,ˉη)]d[fϰ(τ,η),θ0]+[θ0,fϰ(τ,ˉη]2Ωϰ

    for all tT, η,ˉηE1 and any value of ϰ[0,1]. Hence, for Ωϰ=12Lϰd[η,ˉη] all conditions of Theorem 4.1. are also satisfied. Therefore, the conditions of Theorem 4.2 are some modifications of these of Theorem 4.1.

    Given that the inequalities

    fm(τ,η)fϰ(τ,η)fM(τ,η),ϰ[0,1]

    are satisfied for all (τ,η)T×EN, it is important and interesting to evaluate the distance between two solutions η(τ), ˉη(τ) of the regularized system (3.6) depending on the initial data. This is the aim of the present section.

    Theorem 5.1. Assume the following:

    1) The family fϰC(T×EN,EN) for any ϰ[0,1].

    2) There exists a continuous function g(τ,ζ), g: T×R+R, which is nondecreasing with respect to its second variable ζ for any τT, and such that for (τ,η),(τ,ˉη)T×EN and ϰ[0,1],

    d[fϰ(τ,η),fϰ(τ,ˉη)]g(τ,d[η,ˉη]).

    3) The maximal solution u(τ,τ0,y0) of the scalar problem

    dy/dτ=g(τ,y),y(τ0)=y00

    exists on T.

    4) The functions η(τ) and ˉη(τ) are any two solutions of the problem (3.6) defined on T, corresponding to initial data (η0,ˉη0) such that d[η0,ˉη0]y0.

    Then,

    d[η(τ),ˉη(τ)]u(τ,τ0,y0), τT. (5.1)

    Proof. Set d[η(τ),ˉη(τ)]=ρ(τ). Then, ρ(τ0)=d[η0,ˉη0]. Also, from (3.7), for any ϰ[0,1] we obtain

    ρ(τ)=d[η0+ττ0fϰ(σ,η(σ))dσ,ˉη0+ττ0fϰ(σ,ˉη(σ))dσ]  d[ττ0fϰ(σ,η(σ))dσ,ττ0fϰ(σ,ˉη(σ))dσ]+d[η0,ˉη0]. (5.2)

    Using (5.2) we get

    ρ(τ)ρ(τ0)+ττ0d[fϰ(σ,η(σ)),fϰ(σ,ˉη(σ))]dσρ(τ0)+ττ0g(σ,d[η(σ),ˉη(σ)])dσ=ρ(τ0)+ττ0g(σ,ρ(σ))dσ,τT. (5.3)

    Applying to (5.3) Theorem 1.6.1 from [38], we conclude that the estimate (5.1) is satisfied for any τT and ϰ[0,1].

    Remark 5.2. The estimate offered in Theorem 5.1 is based on the integral equation, and on the existence and uniqueness results established in Section 4. Such estimations are crucial in the investigation of the qualitative properties of the solutions when the Lyapunov method is applied. Hence, the proposed result can be developed by the use of the Lyapunov technique in the study of the stability, periodicity and almost periodicity behavior of the states of the regularized system (3.6).

    Condition 2 of Theorem 5.1 can be weakened while maintaining its statement.

    Theorem 5.3. Assume that Condition 1 of Theorem 5.1 holds, and that the following are true:

    1) There exists a family of functions gϰC(T×R+,R) such that

    limsup{[d[η+hfϰ(τ,η),ˉη+hfϰ(τ,ˉη)]]h1d[η,ˉη]:h0+}gϰ(τ,d[η,ˉη])

    for any ϰ[0,1] and (τ,η),(τ,ˉη)R+×EN.

    2) The maximal solution uϰ(τ,τ0,y0) of the scalar problem

    dy/dτ=gϰ(τ,y),y(τ0)=y00. (5.4)

    is defined on T.

    Then,

    d[η(τ),ˉη(τ)]¯u(τ,τ0,y0), τT,

    where η(τ) and ˉη(τ) are any two solutions of the problem (3.6) defined on T, corresponding to initial data (η0,ˉη0) such that d[η0,ˉη0]y0 and ¯u(τ,τ0,y0)=maxϰuϰ(τ,τ0,y0).

    Proof. Denote again ρ(t)=d[η(τ),ˉη(τ)]. Then, for the difference ρ(τ+h)ρ(τ), h>0, we have

    ρ(τ+h)ρ(τ)=d[η(τ+h),ˉη(τ+h)]d[η(τ),ˉη(τ)]
    d[η(τ+h),η(τ)+hfϰ(τ,η(τ))]+d[ˉη(τ)+hfϰ(τ,ˉη(τ)),ˉη(τ+h)]
    +d[hfϰ(τ,η(τ)),hfϰ(τ,ˉη(τ))]d[η(τ),ˉη(τ)],ϰ[0,1].

    From the above inequalities, we get

    D+ρ(τ)=limsup{[ρ(τ+h)ρ(τ)]h1:h0+}limsup{[d[η(τ)+hfϰ(τ,η(τ)),ˉη(τ)+hfϰ(τ,ˉη(τ))]]h1:h0+}d[η(τ),ˉη(τ)]+limh0+sup{[d[η(τ+h)η(τ)h,fϰ(τ,η(τ))]]}+limh0+sup{d[fϰ(τ,ˉη(τ)),ˉη(τ+h)ˉη(τ)h]}gϰ(τ,d[η,ˉη])=gϰ(τ,ρ(τ)),τTfor allϰ[0,1]. (5.5)

    The conclusion of Theorem 5.3 follows in the same way as in Theorem 5.1 by applying Theorem 1.6.1 from [38] to (5.5). Hence, for any ϰ[0,1] we get

    d[η(τ),ˉη(τ)]uϰ(τ,τ0,y0)

    and, therefore, d[η(τ),ˉη(τ)]¯u(τ,τ0,y0) for τT. The proof of Theorem 5.2 is complete.

    Theorems 5.1 and 5.3 offer also the opportunities for estimating the distance between an arbitrary solution η(τ) of the regularized problem (3.6) and the "steady state" θ0EN of (3.6).

    Corollary 5.4. Assume that Condition 1 of Theorem 5.1 holds, and that the family of functions gϰC(T×R+,R) is such that

    (a) d[fϰ(τ,η),θ0]gϰ(τ,d[η,θ0]) or

    (b) limsup{[d[η+hfϰ(τ,η),θ0]d[η,θ0]]h1:h0+}gϰ(τ,d[η,θ0]) for all τT, ϰ[0,1].

    Then d[η0,θ0]y0 implies

    d[η(τ),θ0]¯u(τ,τ0,y0),τT, (5.6)

    where ¯u(τ,τ0,y0)=maxϰuϰ(τ,τ0,y0), uϰ(τ,τ0,y0) is the maximal solution of the family of comparison problem

    dy/dτ=gϰ(τ,y),y(τ0)=y00,

    and η(τ) is an arbitrary solution of the problem (3.6) defined on T, corresponding to the initial value η0.

    Corollary 5.5. If in Corollary 5.4, gϰ(τ,d[η,θ0])=λ(τ)d[η,θ0] with λ(τ)>0 for τT, then the estimate (5.6) has the form

    d[η(τ),θ0]d[η0,θ0]exp(ττ0λ(σ)dσ),τT

    for any ϰ[0,1].

    Remark 5.6. All established results for the regularized system (3.6) can be applied to obtain corresponding results for the uncertain fuzzy problem (3.1). Thus, the proposed regularized scheme offers a new approach to study a class of fuzzy differential systems with uncertainties via systems of type (3.6), which significantly simplifies their analysis and is very appropriate for applied models of type (3.1). This will be demonstrated by the next example.

    Remark 5.7. The proposed regularized scheme and the corresponding approach can be extended to more general systems considering delay effects, impulsive effects and fractional-order dynamics.

    Example 5.8. We will apply Theorem 5.1 to estimate the distance between a solution of the problem (3.1) and the equilibrium state θ0. To this end, we consider a particular function g(τ,ζ) from Condition 2 of Theorem 5.1. We transform the fuzzy equation in (3.1) by using the regularized process to the form

    dξdτ=fϰ(τ,ξ)+g(τ,ξ,μ), (5.7)

    where g(τ,ξ,μ)=f(τ,ξ,μ)fϰ(τ,ξ) for all μS. Further we will suppose that fϰC(T×EN,EN) for all ϰ[0,1] and gC(T×EN×S,EN), T[τ0,α], g(τ,0,μ)0 for all ττ0.

    Let fϰ(τ,ξ) and g(τ,ξ,μ) be such that for all τT there exist continuous positive functions Ω(τ) and o(τ) satisfying the hypotheses

    1) d[fϰ(τ,ξ),θ0]Ω(τ)d[ξ,θ0] for all ϰ[0,1];

    2) d[g(τ,ξ,μ),θ0]o(τ)dq[ξ,θ0] for all μS;

    3) ψ(τ0,τ)=(q1)dq1[ξ0,θ0]ττ0o(σ)exp[(q1)στ0Ω(υ)dυ]dσ<1, q>1.

    For the family of equations (5.7), we assume that Hypotheses 13 are fulfilled for all τ,σ[τ0,α].

    Then, the deviations of any solution ξ(τ) of (5.7) from the state θ0EN are estimated as follows

    d[ξ(τ),θ0]d[ξ0,θ0]exp(ττ0Ω(σ)dσ)(1ψ(τ0,τ))1q1 (5.8)

    for all τ[τ0,α].

    From (5.7), we have

    ξ(τ)=ξ(τ0)+ττ0fϰ(σ,ξ(σ))dσ+ττ0g(σ,ξ(σ),μ)dσ. (5.9)

    Let z(t)=d[ξ(τ),θ0]. Then z(τ0)=d[ξ0,θ0], and

    d[ξ(τ),θ0]d[ξ0,θ0]+d[(ττ0fϰ(σ,ξ(σ))dσ+ττ0g(σ,ξ(σ),μ)dσ),θ0]d[ξ0,θ0]+ττ0d[fϰ(σ,ξ(σ)),θ0]dσ+ττ0d[g(σ,ξ(σ),μ),θ0]dσ. (5.10)

    In view of Hypotheses 1 and 2, the inequality (5.10) yields

    d[ξ(τ),θ0]d[ξ0,θ0]+ττ0(Ω(σ)d[ξ(σ),θ0]+o(σ)dq[ξ(σ),θ0])dσ

    or

    z(τ)z(τ0)+ττ0(Ω(σ)+o(σ)zq1(σ))z(σ)dσ, τ[τ0,α]. (5.11)

    Applying the estimation technique from [39] to inequality (5.11), we obtain the estimate

    zq1(τ)zq1(τ0)exp((q1)ττ0Ω(σ)dσ)1ψ(τ0,τ), τ[τ0,α]. (5.12)

    From (5.12) we obtain (5.8).

    If the Hypotheses 1 and 2 are satisfied and 0<q<1, then by applying Theorem 2.2 from [40] to the inequality (5.11), we get the estimate (5.8) in the form

    d[ξ(τ),θ0]d[ξ0,θ0]exp(1ψ(τ0,τ))1q1 (5.13)

    for all τ[τ0,α].

    In this paper we investigate some fundamental properties of fuzzy differential equations using a new approach. We introduce a regularization scheme for systems of fuzzy differential equations with uncertain parameters. Existence and uniqueness criteria for the regularized equations are established. Estimates about the distance between solutions of the regularized equations are also proposed. The proposed technique and the new results will allow us to consider the qualitative properties of the solutions such as stability, boundedness, periodicity, etc. The introduced approach can also be extended to study delayed systems and impulsive control systems via modifications of the Lyapunov theory [41,42,43,44]. The advantages of the proposed regularization procedure can be implemented in various fuzzy models such as fuzzy neural networks with uncertain parameters, fuzzy models in biology with uncertain parameters, fuzzy models in economics with uncertain parameters, and much more. Numerical applications of our finding in a way that is similar to [45] are also interesting and challenging further directions of research.

    The authors declare no conflict of interest.



    [1] Y. Xiao, X. Sun, Y. Guo, S. Li, Y. Zhang, Y. Wang, An improved gorilla troops optimizer based on lens opposition-based learning and adaptive β-Hill climbing for global optimization, CMES-Comput. Model. Eng. Sci., 131 (2022), 815–850. https://doi.org/10.32604/cmes.2022.019198 doi: 10.32604/cmes.2022.019198
    [2] Y. Xiao, X. Sun, Y. Guo, H. Cui, Y. Wang, J. Li, et al., An enhanced honey badger algorithm based on Lévy flight and refraction opposition-based learning for engineering design problems, J. Intell. Fuzzy Syst., (2022), 1–24. https://doi.org/10.3233/JIFS-213206 doi: 10.3233/JIFS-213206
    [3] Q. Liu, N. Li, H. Jia, Q. Qi, L. Abualigah, Y. Liu, A hybrid arithmetic optimization and golden sine algorithm for solving industrial engineering design problems, Mathematics, 10 (2022), 1567. https://doi.org/10.3390/math10091567 doi: 10.3390/math10091567
    [4] A. S. Sadiq, A. A. Dehkordi, S. Mirjalili, Q. V. Pham, Nonlinear marine predator algorithm: a cost-effective optimizer for fair power allocation in NOMA-VLC-B5G networks, Expert Syst. Appl., 203 (2022), 117395. https://doi.org/10.1016/j.eswa.2022.117395 doi: 10.1016/j.eswa.2022.117395
    [5] G. Hu, J. Zhong, B. Du, G. Wei, An enhanced hybrid arithmetic optimization algorithm for engineering applications, Comput. Methods Appl. Mech. Eng., 394 (2022), 114901. https://doi.org/10.1016/j.cma.2022.114901 doi: 10.1016/j.cma.2022.114901
    [6] A. A. Dehkordi, A. S. Sadiq, S. Mirjalili, K. Z. Ghafoor, Nonlinear-based Chaotic harris hawks optimizer: algorithm and internet of vehicles application, Appl. Soft Comput., 109 (2021), 107574. https://doi.org/10.1016/j.asoc.2021.107574 doi: 10.1016/j.asoc.2021.107574
    [7] W. Zhao, L. Wang, S. Mirjalili, Artificial hummingbird algorithm: a new bio-inspired optimizer with its engineering applications, Comput. Methods Appl. Mech. Eng., 388 (2022), 114194. https://doi.org/10.1016/j.cma.2021.114194 doi: 10.1016/j.cma.2021.114194
    [8] K. Sun, H. Jia, Y. Li, Z. Jiang, Hybrid improved slime mould algorithm with adaptive β hill climbing for numerical optimization, J. Intell. Fuzzy Syst., 40 (2021), 1667–1679. https://doi.org/10.3233/jifs-201755 doi: 10.3233/JIFS-201755
    [9] K. Zhong, G. Zhou, W. Deng, Y. Zhou, Q. Luo, MOMPA: multi-objective marine predator algorithm, Comput. Methods Appl. Mech. Eng., 385 (2021), 114029. https://doi.org/10.1016/j.cma.2021.114029 doi: 10.1016/j.cma.2021.114029
    [10] Q. Fan, H. Huang, K. Yang, S. Zhang, L. Yao, Q. Xiong, A modified equilibrium optimizer using opposition-based learning and novel update rules, Expert Syst. Appl., 170 (2021), 114575. https://doi.org/10.1016/j.eswa.2021.114575 doi: 10.1016/j.eswa.2021.114575
    [11] L. Abualigah, A. Diabat, M. A. Elaziz, Improved slime mould algorithm by opposition-based learning and Levy flight distribution for global optimization and advances in real-world engineering problems, J. Ambient Intell. Humanized Comput., (2021), https://doi.org/10.1007/s12652-021-03372-w doi: 10.1007/s12652-021-03372-w
    [12] S. Wang, H. Jia, L. Abualigah, Q. Liu, R. Zheng, An improved hybrid aquila optimizer and harris hawks algorithm for solving industrial engineering optimization problems, Processes, 9 (2021), 1551. https://doi.org/10.3390/pr9091551 doi: 10.3390/pr9091551
    [13] L. Abualigah, A. A. Ewees, M. A. A. Al-qaness, M. A. Elaziz, D. Yousri, R. A. Ibrahim, et al., Boosting arithmetic optimization algorithm by sine cosine algorithm and levy flight distribution for solving engineering optimization problems, Neural Comput. Appl., 34 (2022), 8823–8852. https://doi.org/10.1007/s00521-022-06906-1 doi: 10.1007/s00521-022-06906-1
    [14] Y. Zhang, Y. Wang, L. Tao, Y. Yan, J. Zhao, Z. Gao, Self-adaptive classification learning hybrid JAYA and Rao-1 algorithm for large-scale numerical and engineering problems, Eng. Appl. Artif. Intell., 114 (2022), 105069. https://doi.org/10.1016/j.engappai.2022.105069 doi: 10.1016/j.engappai.2022.105069
    [15] D. Wu, H. Jia, L. Abualigah, Z. Xing, R. Zheng, H. Wang, et al., Enhance teaching-learning-based optimization for tsallis-entropy-based feature selection classification approach, Processes, 10 (2022), 360. https://doi.org/10.3390/pr10020360 doi: 10.3390/pr10020360
    [16] H. Jia, W. Zhang, R. Zheng, S. Wang, X. Leng, N. Cao, Ensemble mutation slime mould algorithm with restart mechanism for feature selection, Int. J. Intell. Syst., 37 (2021), 2335–2370. https://doi.org/10.1002/int.22776 doi: 10.1002/int.22776
    [17] H. Jia, K. Sun, Improved barnacles mating optimizer algorithm for feature selection and support vector machine optimization, Pattern Anal. Appl., 24 (2021), 1249–1274. https://doi.org/10.1007/s10044-021-00985-x doi: 10.1007/s10044-021-00985-x
    [18] C. Kumar, T. D. Raj, M. Premkumar, T. D. Raj, A new stochastic slime mould optimization algorithm for the estimation of solar photovoltaic cell parameters, Optik, 223 (2020), 165277. https://doi.org/10.1016/j.ijleo.2020.165277 doi: 10.1016/j.ijleo.2020.165277
    [19] Y. Zhang, Y. Wang, S. Li, F. Yao, L. Tao, Y. Yan, et al., An enhanced adaptive comprehensive learning hybrid algorithm of Rao-1 and JAYA algorithm for parameter extraction of photovoltaic models, Math. Biosci. Eng., 19 (2022), 5610–5637. https://doi.org/10.3934/mbe.2022263 doi: 10.3934/mbe.2022263
    [20] M. Eslami, E. Akbari, S. T. Seyed Sadr, B. F. Ibrahim, A novel hybrid algorithm based on rat swarm optimization and pattern search for parameter extraction of solar photovoltaic models, Energy Sci. Eng., (2022). https://doi.org/10.1002/ese3.1160 doi: 10.1002/ese3.1160
    [21] J. Zhao, Y. Zhang, S. Li, Y. Wang, Y. Yan, Z. Gao, A chaotic self-adaptive JAYA algorithm for parameter extraction of photovoltaic models, Math. Biosci. Eng., 19 (2022), 5638–5670. https://doi.org/10.3934/mbe.2022264 doi: 10.3934/mbe.2022264
    [22] X. Bao, H. Jia, C. Lang, A novel hybrid harris hawks optimization for color image multilevel thresholding segmentation, IEEE Access, 7 (2019), 76529–76546. https://doi.org/10.1109/access.2019.2921545 doi: 10.1109/ACCESS.2019.2921545
    [23] S. Lin, H. Jia, L. Abualigah, M. Altalhi, Enhanced slime mould algorithm for multilevel thresholding image segmentation using entropy measures, Entropy, 23 (2021), 1700. https://doi.org/10.3390/e23121700 doi: 10.3390/e23121700
    [24] M. Abd Elaziz, D. Mohammadi, D. Oliva, K. Salimifard, Quantum marine predators algorithm for addressing multilevel image segmentation, Appl. Soft Comput., 110 (2021), 107598. https://doi.org/10.1016/j.asoc.2021.107598 doi: 10.1016/j.asoc.2021.107598
    [25] J. Yao, Y. Sha, Y. Chen, G. Zhang, X. Hu, G. Bai, et al., IHSSAO: An improved hybrid salp swarm algorithm and aquila optimizer for UAV path planning in complex terrain, Appl. Sci., 12 (2022), 5634. https://doi.org/10.3390/app12115634 doi: 10.3390/app12115634
    [26] J. H. Holland, Genetic algorithms, Sci. Am., 267 (1992), 66–72. https://doi.org/10.1038/scientificamerican0792-66 doi: 10.1038/scientificamerican0792-66
    [27] P. J. Angeline, Genetic programming: On the programming of computers by means of natural selection, Biosystems, 33 (1994), 69–73. https://doi.org/10.1016/0303-2647(94)90062-0 doi: 10.1016/0303-2647(94)90062-0
    [28] R. Storn, K. Price, Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 11 (1997), 341–359. https://doi.org/10.1023/A:1008202821328 doi: 10.1023/A:1008202821328
    [29] H. G. Beyer, H. P. Schwefel, Evolution strategies-A comprehensive introduction, Nat. Comput., 1 (2002), 3–52. https://doi.org/10.1023/A:1015059928466 doi: 10.1023/A:1015059928466
    [30] 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
    [31] 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
    [32] E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, GSA: a gravitational search algorithm, Inf. Sci., 179 (2009), 2232–2248. https://doi.org/10.1016/j.ins.2009.03.004 doi: 10.1016/j.ins.2009.03.004
    [33] S. Mirjalili, S. M. Mirjalili, A. Hatamlou, Multi-Verse Optimizer: a nature-inspired algorithm for global optimization, Neural Comput. Appl., 27 (2016), 495–513. https://doi.org/10.1007/s00521-015-1870-7 doi: 10.1007/s00521-015-1870-7
    [34] W. Zhao, L. Wang, Z. Zhang, Atom search optimization and its application to solve a hydrogeologic parameter estimation problem, Knowl.-Based Syst., 163 (2019), 283–304. https://doi.org/10.1016/j.knosys.2018.08.030 doi: 10.1016/j.knosys.2018.08.030
    [35] A. Hatamlou, Black hole: a new heuristic optimization approach for data clustering, Inf. Sci., 222 (2013), 175–184. https://doi.org/10.1016/j.ins.2012.08.023 doi: 10.1016/j.ins.2012.08.023
    [36] S. Mirjalili, SCA: a sine cosine algorithm for solving optimization problems, Knowl.-Based Syst., 96 (2016), 120–133. https://doi.org/10.1016/j.knosys.2015.12.022 doi: 10.1016/j.knosys.2015.12.022
    [37] A. Kaveh, A. Dadras, A novel meta-heuristic optimization algorithm: thermal exchange optimization, Adv. Eng. Software, 110 (2017), 69–84. https://doi.org/10.1016/j.advengsoft.2017.03.014 doi: 10.1016/j.advengsoft.2017.03.014
    [38] L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz, A. H. Gandomi, The arithmetic optimization algorithm, Comput. Methods Appl. Mech. Eng., 376 (2021), 113609. https://doi.org/10.1016/j.cma.2020.113609 doi: 10.1016/j.cma.2020.113609
    [39] 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
    [40] M. Dorigo, M. Birattari, T. Stutzle, Ant colony optimization, IEEE Comput. Intell. Mag., 1 (2006), 28–39. https://doi.org/10.1109/MCI.2006.329691 doi: 10.1109/MCI.2006.329691
    [41] S. Mirjalili, Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems, Neural Comput. Appl., 27 (2015), 1053–1073. https://doi.org/10.1007/s00521-015-1920-1 doi: 10.1007/s00521-015-1920-1
    [42] S. Mirjalili, The ant lion optimizer, Adv. Eng. Software, 83 (2015), 80–98. https://doi.org/10.1016/j.advengsoft.2015.01.010 doi: 10.1016/j.advengsoft.2015.01.010
    [43] S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Software, 95 (2016), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008 doi: 10.1016/j.advengsoft.2016.01.008
    [44] S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Software, 69 (2014), 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007 doi: 10.1016/j.advengsoft.2013.12.007
    [45] 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. https://doi.org/10.1016/j.advengsoft.2017.07.002 doi: 10.1016/j.advengsoft.2017.07.002
    [46] F. Glover, Tabu search—Part Ⅰ, ORSA J. Comput., 1 (1989), 190–206. https://doi.org/10.1287/ijoc.1.3.190 doi: 10.1287/ijoc.1.3.190
    [47] D. Manjarres, I. Landa-Torres, S. Gil-Lopez, J. Del Ser, M. N. Bilbao, S. Salcedo-Sanz, et al., A survey on applications of the harmony search algorithm, Eng. Appl. Artif. Intell., 26 (2013), 1818–1831. https://doi.org/10.1016/j.engappai.2013.05.008 doi: 10.1016/j.engappai.2013.05.008
    [48] M. S. Gonçalves, R. H. Lopez, L. F. F. Miguel, Search group algorithm: a new metaheuristic method for the optimization of truss structures, Comput. Struct., 153 (2015), 165–184. https://doi.org/10.1016/j.compstruc.2015.03.003 doi: 10.1016/j.compstruc.2015.03.003
    [49] E. Atashpaz-Gargari, C. Lucas, Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, 2007 IEEE Congr. Evol. Comput., (2007), 4661–4667. https://doi.org/10.1109/CEC.2007.4425083 doi: 10.1109/CEC.2007.4425083
    [50] 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. https://doi.org/10.1016/j.cad.2010.12.015 doi: 10.1016/j.cad.2010.12.015
    [51] 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
    [52] S. Li, H. Chen, M. Wang, A. A. Heidari, S. Mirjalili, Slime mould algorithm: a new method for stochastic optimization, Future Gener. Comput. Syst., 111 (2020), 300–323. https://doi.org/10.1016/j.future.2020.03.055 doi: 10.1016/j.future.2020.03.055
    [53] S. Kaur, L. K. Awasthi, A. L. Sangal, G. Dhiman, Tunicate swarm algorithm: a new bio-inspired based metaheuristic paradigm for global optimization, Eng. Appl. Artif. Intell., 90 (2020), 103541. https://doi.org/10.1016/j.engappai.2020.103541 doi: 10.1016/j.engappai.2020.103541
    [54] 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
    [55] B. Abdollahzadeh, F. Soleimanian Gharehchopogh, S. Mirjalili, Artificial gorilla troops optimizer: a new nature‐inspired metaheuristic algorithm for global optimization problems, Int. J. Intell. Syst., 36 (2021), 5887–5958. https://doi.org/10.1002/int.22535 doi: 10.1002/int.22535
    [56] H. Jia, X. Peng, C. Lang, Remora optimization algorithm, Expert Syst. Appl., 185 (2021), 115665. https://doi.org/10.1016/j.eswa.2021.115665 doi: 10.1016/j.eswa.2021.115665
    [57] Y. Yang, H. Chen, A. A. Heidari, A. H. Gandomi, Hunger games search: visions, conception, implementation, deep analysis, perspectives, and towards performance shifts, Expert Syst. Appl., 177 (2021), 114864. https://doi.org/10.1016/j.eswa.2021.114864 doi: 10.1016/j.eswa.2021.114864
    [58] L. Abualigah, M. A. Elaziz, P. Sumari, Z. W. Geem, A. H. Gandomi, Reptile search algorithm (RSA): a nature-inspired meta-heuristic optimizer, Expert Syst. Appl., 191 (2022), 116158. https://doi.org/10.1016/j.eswa.2021.116158 doi: 10.1016/j.eswa.2021.116158
    [59] Y. Xiao, X. Sun, Y. Zhang, Y. Guo, Y. Wang, J. Li, An improved slime mould algorithm based on Tent chaotic mapping and nonlinear inertia weight, Int. J. Innovative Comput. Inf. Control, 17 (2021), 2151–2176. https://doi.org/10.24507/ijicic.17.06.2151 doi: 10.24507/ijicic.17.06.2151
    [60] R. Zheng, H. Jia, L. Abualigah, Q. Liu, S. Wang, Deep ensemble of slime mold algorithm and arithmetic optimization algorithm for global optimization, Processes, 9 (2021), 1774. https://doi.org/10.3390/pr9101774 doi: 10.3390/pr9101774
    [61] H. Jia, K. Sun, W. Zhang, X. Leng, An enhanced chimp optimization algorithm for continuous optimization domains, Complex Intell. Syst., 8 (2022), 65–82. https://doi.org/10.1007/s40747-021-00346-5 doi: 10.1007/s40747-021-00346-5
    [62] A. S. Sadiq, A. A. Dehkordi, S. Mirjalili, J. Too, P. Pillai, Trustworthy and efficient routing algorithm for IoT-FinTech applications using non-linear Lévy brownian generalized normal distribution optimization, IEEE Internet Things J., (2021), 1–16. https://doi.org/10.1109/jiot.2021.3109075 doi: 10.1109/jiot.2021.3109075
    [63] 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
    [64] S. Chakraborty, A. K. Saha, R. Chakraborty, M. Saha, S. Nama, HSWOA: an ensemble of hunger games search and whale optimization algorithm for global optimization, Int. J. Intell. Syst., 37 (2022), 52–104. https://doi.org/10.1002/int.22617 doi: 10.1002/int.22617
    [65] P. Pirozmand, A. Javadpour, H. Nazarian, P. Pinto, S. Mirkamali, F. Ja'fari, GSAGA: A hybrid algorithm for task scheduling in cloud infrastructure, J. Supercomput., (2022). https://doi.org/10.1007/s11227-022-04539-8 doi: 10.1007/s11227-022-04539-8
    [66] H. Abdel-Mawgoud, S. Kamel, A. A. A. El-Ela, F. Jurado, Optimal allocation of DG and capacitor in distribution networks using a novel hybrid MFO-SCA method, Electr. Power Compon. Syst., 49 (2021), 259–275. https://doi.org/10.1080/15325008.2021.1943066 doi: 10.1080/15325008.2021.1943066
    [67] L. Abualigah, D. Yousri, M. Abd Elaziz, A. A. Ewees, M. A. A. Al-qaness, A. H. Gandomi, Aquila optimizer: a novel meta-heuristic optimization algorithm, Comput. Ind. Eng., 157 (2021), 107250. https://doi.org/10.1016/j.cie.2021.107250 doi: 10.1016/j.cie.2021.107250
    [68] 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
    [69] Z. Guo, B. Yang, Y. Han, T. He, P. He, X. Meng, et al., Optimal PID tuning of PLL for PV inverter based on aquila optimizer, Front. Energy Res., 9 (2022), 812467. https://doi.org/10.3389/fenrg.2021.812467 doi: 10.3389/fenrg.2021.812467
    [70] M. R. Hussan, M. I. Sarwar, A. Sarwar, M. Tariq, S. Ahmad, A. Shah Noor Mohamed, et al., Aquila optimization based harmonic elimination in a modified H-bridge inverter, Sustainability, 14 (2022), 929. https://doi.org/10.3390/su14020929 doi: 10.3390/su14020929
    [71] G. Vashishtha, R. Kumar, Autocorrelation energy and aquila optimizer for MED filtering of sound signal to detect bearing defect in Francis turbine, Meas. Sci. Technol., 33 (2021), 015006. https://doi.org/10.1088/1361-6501/ac2cf2 doi: 10.1088/1361-6501/ac2cf2
    [72] A. M. AlRassas, M. A. A. Al-qaness, A. A. Ewees, S. Ren, M. Abd Elaziz, R. Damaševičius, et al., Optimized ANFIS model using Aquila optimizer for oil production forecasting, Processes, 9 (2021), 1194. https://doi.org/10.3390/pr9071194 doi: 10.3390/pr9071194
    [73] A. K. Khamees, A. Y. Abdelaziz, M. R. Eskaros, A. El-Shahat, M. A. Attia, Optimal power flow solution of wind-integrated power system using novel metaheuristic method, Energies, 14 (2021), 6117. https://doi.org/10.3390/en14196117 doi: 10.3390/en14196117
    [74] J. Zhao, Z. M. 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
    [75] M. Kandan, A. Krishnamurthy, S. A. M. Selvi, M. Y. Sikkandar, M. A. Aboamer, T. Tamilvizhi, Quasi oppositional Aquila optimizer-based task scheduling approach in an IoT enabled cloud environment, J. Supercomput., 78 (2022), 10176–10190. https://doi.org/10.1007/s11227-022-04311-y doi: 10.1007/s11227-022-04311-y
    [76] X. Li, S. Mobayen, Optimal design of a PEMFC‐based combined cooling, heating and power system based on an improved version of Aquila optimizer, Concurrency Comput. Pract. Exper., 34 (2022), e6976. https://doi.org/10.1002/cpe.6976 doi: 10.1002/cpe.6976
    [77] J. Zhao, Z. M. Gao, H. F. Chen, The simplified aquila optimization algorithm, IEEE Access, 10 (2022), 22487–22515. https://doi.org/10.1109/access.2022.3153727 doi: 10.1109/ACCESS.2022.3153727
    [78] S. Mahajan, L. Abualigah, A. K. Pandit, M. Altalhi, Hybrid Aquila optimizer with arithmetic optimization algorithm for global optimization tasks, Soft Comput., 26 (2022), 4863–4881. https://doi.org/10.1007/s00500-022-06873-8 doi: 10.1007/s00500-022-06873-8
    [79] Y. Zhang, Y. Yan, J. Zhao, Z. Gao, AOAAO: The hybrid algorithm of arithmetic optimization algorithm with aquila optimizer, IEEE Access, 10 (2022), 10907–10933. https://doi.org/10.1109/access.2022.3144431 doi: 10.1109/ACCESS.2022.3144431
    [80] G. Vashishtha, S. Chauhan, A. Kumar, R. Kumar, An ameliorated African vulture optimization algorithm to diagnose the rolling bearing defects, Meas. Sci. Technol., 33 (2022), 075013. https://doi.org/10.1088/1361-6501/ac656a doi: 10.1088/1361-6501/ac656a
    [81] M. R. Kaloop, B. Roy, K. Chaurasia, S. M. Kim, H. M. Jang, J. W. Hu, et al., Shear strength estimation of reinforced concrete deep beams using a novel hybrid metaheuristic optimized SVR models, Sustainability, 14 (2022), 5238. https://doi.org/10.3390/su14095238 doi: 10.3390/su14095238
    [82] M. Manickam, R. Siva, S. Prabakeran, K. Geetha, V. Indumathi, T. Sethukarasi, Pulmonary disease diagnosis using African vulture optimized weighted support vector machine approach, Int. J. Imaging Syst. Technol., 32 (2022), 843–856. https://doi.org/https://doi.org/10.1002/ima.22669 doi: 10.1002/ima.22669
    [83] J. Fan, Y. Li, T. Wang, An improved African vultures optimization algorithm based on tent chaotic mapping and time-varying mechanism, PLoS One, 16 (2021), e0260725. https://doi.org/10.1371/journal.pone.0260725 doi: 10.1371/journal.pone.0260725
    [84] H. R. Tizhoosh, Opposition-based learning: a new scheme for machine intelligence, in International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, (2005), 695–701. https://doi.org/10.1109/CIMCA.2005.1631345
    [85] N. A. Alawad, B. H. Abed-alguni, Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments, Arabian J. Sci. Eng., 46 (2021), 3213–3233. https://doi.org/10.1007/s13369-020-05141-x doi: 10.1007/s13369-020-05141-x
    [86] T. T. Nguyen, H. J. Wang, T. K. Dao, J. S. Pan, J. H. Liu, S. Weng, An improved slime mold algorithm and its application for optimal operation of cascade hydropower stations, IEEE Access, 8 (2020), 226754–226772. https://doi.org/10.1109/access.2020.3045975 doi: 10.1109/access.2020.3045975
    [87] Y. Zhang, Y. Wang, Y. Yan, J. Zhao, Z. Gao, LMRAOA: an improved arithmetic optimization algorithm with multi-leader and high-speed jumping based on opposition-based learning solving engineering and numerical problems, Alexandria Eng. J., 61 (2022), 12367–12403. https://doi.org/10.1016/j.aej.2022.06.017 doi: 10.1016/j.aej.2022.06.017
    [88] S. Wang, H. Jia, Q. Liu, R. Zheng, An improved hybrid Aquila optimizer and Harris Hawks optimization for global optimization, Math. Biosci. Eng., 18 (2021), 7076–7109. https://doi.org/10.3934/mbe.2021352 doi: 10.3934/mbe.2021352
    [89] Q. Fan, Z. Chen, W. Zhang, X. Fang, ESSAWOA: Enhanced whale optimization algorithm integrated with salp swarm algorithm for global optimization, Eng. Comput., 38 (2022), 797–814. https://doi.org/10.1007/s00366-020-01189-3 doi: 10.1007/s00366-020-01189-3
    [90] F. Yu, Y. Li, B. Wei, X. Xu, Z. Zhao, The application of a novel OBL based on lens imaging principle in PSO, Acta Electron. Sin., 42 (2014), 230–235. https://doi.org/10.3969/j.issn.0372-2112.2014.02.004 doi: 10.3969/j.issn.0372-2112.2014.02.004
    [91] W. Long, J. Jiao, X. Liang, S. Cai, M. Xu, A random opposition-based learning grey wolf optimizer, IEEE Access, 7 (2019), 113810–113825. https://doi.org/10.1109/access.2019.2934994 doi: 10.1109/access.2019.2934994
    [92] H. T. Kahraman, H. Bakir, S. Duman, M. Katı, S. Aras, U. Guvenc, Dynamic FDB selection method and its application: modeling and optimizing of directional overcurrent relays coordination, Appl. Intell., 52 (2022), 4873–4908. https://doi.org/10.1007/s10489-021-02629-3 doi: 10.1007/s10489-021-02629-3
    [93] H. T. Kahraman, S. Aras, E. Gedikli, Fitness-distance balance (FDB): a new selection method for meta-heuristic search algorithms, Knowl.-Based Syst., 190 (2020), 105169. https://doi.org/10.1016/j.knosys.2019.105169 doi: 10.1016/j.knosys.2019.105169
    [94] S. Aras, E. Gedikli, H. T. Kahraman, A novel stochastic fractal search algorithm with fitness-distance balance for global numerical optimization, Swarm Evol. Comput., 61 (2021), 100821. https://doi.org/10.1016/j.swevo.2020.100821 doi: 10.1016/j.swevo.2020.100821
    [95] S. Duman, H. T. Kahraman, U. Guvenc, S. Aras, Development of a Lévy flight and FDB-based coyote optimization algorithm for global optimization and real-world ACOPF problems, Soft Comput., 25 (2021), 6577–6617. https://doi.org/10.1007/s00500-021-05654-z doi: 10.1007/s00500-021-05654-z
    [96] S. García, A. Fernández, J. Luengo, F. Herrera, Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power, Inf. Sci., 180 (2010), 2044–2064. https://doi.org/10.1016/j.ins.2009.12.010 doi: 10.1016/j.ins.2009.12.010
    [97] E. Theodorsson-Norheim, Friedman and Quade tests: basic computer program to perform nonparametric two-way analysis of variance and multiple comparisons on ranks of several related samples, Comput. Biol. Med., 17 (1987), 85–99. https://doi.org/10.1016/0010-4825(87)90003-5 doi: 10.1016/0010-4825(87)90003-5
    [98] K. V. Price, N. H. Awad, M. Z. Ali, P. N. Suganthan, The 100-digit challenge: problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. Technical Report Nanyang Technological University, Singapore, (2018).
    [99] C. A. Coello Coello, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art, Comput. Methods Appl. Mech. Eng., 191 (2002), 1245–1287. https://doi.org/10.1016/S0045-7825(01)00323-1 doi: 10.1016/S0045-7825(01)00323-1
  • This article has been cited by:

    1. Anatoliy Martynyuk, Gani Stamov, Ivanka Stamova, Yulya Martynyuk–Chernienko, On the regularization and matrix Lyapunov functions for fuzzy differential systems with uncertain parameters, 2023, 31, 2688-1594, 6089, 10.3934/era.2023310
    2. Anatoliy Martynyuk, Gani Stamov, Ivanka Stamova, Yulya Martynyuk-Chernienko, On the Analysis of Regularized Fuzzy Systems of Uncertain Differential Equations, 2023, 25, 1099-4300, 1010, 10.3390/e25071010
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(5323) PDF downloads(705) Cited by(42)

Figures and Tables

Figures(15)  /  Tables(17)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog