Research article Special Issues

A Quantum-Inspired Sperm Motility Algorithm

  • Sperm Motility Algorithm (SMA), inspired by the human fertilization process, was proposed by Abdul-Raof and Hezam [1] to solve global optimization problems. Sperm flow obeys the Stokes equation or the Schrۤinger equation as its derived equivalent. This paper combines a classical SMA with quantum computation features to propose two novel Quantum-Inspired Evolutionary Algorithms: The first is called the Quantum Sperm Motility Algorithm (QSMA), and the second is called the Improved Quantum Sperm Motility Algorithm (IQSMA). The IQSMA is based on the characteristics of QSMA and uses an interpolation operator to generate a new solution vector in the search space. The two proposed algorithms are global convergence guaranteed population-based optimization algorithms, which outperform the original SMA in terms of their search-ability and have fewer parameters to control. The two proposed algorithms are tested using thirty-three standard dissimilarities benchmark functions. Performance and optimization results of the QSMA and IQSMA are compared with corresponding results obtained using the original SMA and those obtained from three state-of-the-art metaheuristics algorithms. The algorithms were tested on a series of numerical optimization problems. The results indicate that the two proposed algorithms significantly outperform the other presented algorithms.

    Citation: Ibrahim M. Hezam, Osama Abdul-Raof, Abdelaziz Foul, Faisal Aqlan. A Quantum-Inspired Sperm Motility Algorithm[J]. AIMS Mathematics, 2022, 7(5): 9057-9088. doi: 10.3934/math.2022504

    Related Papers:

    [1] Weili Kong, Yuanfu Shao . The effects of fear and delay on a predator-prey model with Crowley-Martin functional response and stage structure for predator. AIMS Mathematics, 2023, 8(12): 29260-29289. doi: 10.3934/math.20231498
    [2] Ting Gao, Xinyou Meng . Stability and Hopf bifurcation of a delayed diffusive phytoplankton-zooplankton-fish model with refuge and two functional responses. AIMS Mathematics, 2023, 8(4): 8867-8901. doi: 10.3934/math.2023445
    [3] Fatao Wang, Ruizhi Yang, Yining Xie, Jing Zhao . Hopf bifurcation in a delayed reaction diffusion predator-prey model with weak Allee effect on prey and fear effect on predator. AIMS Mathematics, 2023, 8(8): 17719-17743. doi: 10.3934/math.2023905
    [4] Weijie Lu, Yonghui Xia . Periodic solution of a stage-structured predator-prey model with Crowley-Martin type functional response. AIMS Mathematics, 2022, 7(5): 8162-8175. doi: 10.3934/math.2022454
    [5] Jorge Luis Ramos-Castellano, Miguel Angel Dela-Rosa, Iván Loreto-Hernández . Bifurcation analysis for the coexistence in a Gause-type four-species food web model with general functional responses. AIMS Mathematics, 2024, 9(11): 30263-30297. doi: 10.3934/math.20241461
    [6] Reshma K P, Ankit Kumar . Stability and bifurcation in a predator-prey system with effect of fear and additional food. AIMS Mathematics, 2024, 9(2): 4211-4240. doi: 10.3934/math.2024208
    [7] Yaping Wang, Yuanfu Shao, Chuanfu Chai . Dynamics of a predator-prey model with fear effects and gestation delays. AIMS Mathematics, 2023, 8(3): 7535-7559. doi: 10.3934/math.2023378
    [8] Yingyan Zhao, Changjin Xu, Yiya Xu, Jinting Lin, Yicheng Pang, Zixin Liu, Jianwei Shen . Mathematical exploration on control of bifurcation for a 3D predator-prey model with delay. AIMS Mathematics, 2024, 9(11): 29883-29915. doi: 10.3934/math.20241445
    [9] Qinghui Liu, Xin Zhang . Chaos detection in predator-prey dynamics with delayed interactions and Ivlev-type functional response. AIMS Mathematics, 2024, 9(9): 24555-24575. doi: 10.3934/math.20241196
    [10] Ruizhi Yang, Dan Jin, Wenlong Wang . A diffusive predator-prey model with generalist predator and time delay. AIMS Mathematics, 2022, 7(3): 4574-4591. doi: 10.3934/math.2022255
  • Sperm Motility Algorithm (SMA), inspired by the human fertilization process, was proposed by Abdul-Raof and Hezam [1] to solve global optimization problems. Sperm flow obeys the Stokes equation or the Schrۤinger equation as its derived equivalent. This paper combines a classical SMA with quantum computation features to propose two novel Quantum-Inspired Evolutionary Algorithms: The first is called the Quantum Sperm Motility Algorithm (QSMA), and the second is called the Improved Quantum Sperm Motility Algorithm (IQSMA). The IQSMA is based on the characteristics of QSMA and uses an interpolation operator to generate a new solution vector in the search space. The two proposed algorithms are global convergence guaranteed population-based optimization algorithms, which outperform the original SMA in terms of their search-ability and have fewer parameters to control. The two proposed algorithms are tested using thirty-three standard dissimilarities benchmark functions. Performance and optimization results of the QSMA and IQSMA are compared with corresponding results obtained using the original SMA and those obtained from three state-of-the-art metaheuristics algorithms. The algorithms were tested on a series of numerical optimization problems. The results indicate that the two proposed algorithms significantly outperform the other presented algorithms.



    Henkin and Skolem introduced Hilbert algebras in the fifties for investigations in intuitionistic and other non-classical logics. Diego [5] proved that Hilbert algebras form a variety which is locally finite. Bandaru et al. introduced the notion of GE-algebras which is a generalization of Hilbert algebras, and investigated several properties (see [1,2,3,8,9]). The notion of interior operator is introduced by Vorster [13] in an arbitrary category, and it is used in [4] to study the notions of connectedness and disconnectedness in topology. Interior algebras are a certain type of algebraic structure that encodes the idea of the topological interior of a set, and are a generalization of topological spaces defined by means of topological interior operators. Rachůnek and Svoboda [7] studied interior operators on bounded residuated lattices, and Svrcek [12] studied multiplicative interior operators on GMV-algebras. Lee et al. [6] applied the interior operator theory to GE-algebras, and they introduced the concepts of (commutative, transitive, left exchangeable, belligerent, antisymmetric) interior GE-algebras and bordered interior GE-algebras, and investigated their relations and properties. Later, Song et al. [10,11] introduced the notions of an interior GE-filter, a weak interior GE-filter, a belligerent interior GE-filter, prominent interior GE-filter and investigate their relations and properties. They provided relations between a belligerent interior GE-filter and an interior GE-filter and conditions for an interior GE-filter to be a belligerent interior GE-filter is considered. Also, they provided relations between a prominent interior GE-filter and an interior GE-filter and conditions for an interior GE-filter to be a prominent interior GE-filter is considered. Given a subset and an element, they established an interior GE-filter, and they considered conditions for a subset to be a belligerent interior GE-filter. They studied the extensibility of the belligerent interior GE-filter and established relationships between weak interior GE-filter and belligerent interior GE-filter of type 1–type 3. Also, they introduced the concept of a prominent interior GE-filter of type 1 and type 2, and investigate their properties. They studied the relationship between a prominent interior GE-filter and a prominent interior GE-filter of type 1.

    In this manuscript, we introduce the concept of an imploring interior GE-filter, and investigate their properties. We discuss the relationship between an interior GE-filter and an imploring interior GE-filter. We provide conditions for an interior GE-filter to be an imploring interior GE-filter and give examples to show that an imploring interior GE-filter is independent to a belligerent interior GE-filter. We provide conditions for an imploring interior GE-filter to be a belligerent interior GE-filter. We discuss the relationship between imploring interior GE-filter and prominent interior GE-filter and give example to show that any imploring interior GE-filter is not a prominent interior GE-filter. We provide conditions for an imploring interior GE-filter to be a prominent interior GE-filter. Also, we consider conditions under which an interior GE-filter larger than a given interior GE-filter to become an imploring interior GE-filter.

    Definition 2.1 ([1]). By a GE-algebra we mean a non-empty set X with a constant 1 and a binary operation satisfying the following axioms:

    (GE1) ˜x˜x=1,

    (GE2) 1˜x=˜x,

    (GE3) ˜x(˜y˜z)=˜x(˜y(˜x˜z)),

    for all ˜x,˜y,˜zX.

    In a GE-algebra X, a binary relation "" is defined by

    (˜x,˜yX)(˜x˜y˜x˜y=1). (2.1)

    Definition 2.2 ([1,2]). A GE-algebra X is said to be

    transitive if it satisfies:

    (˜x,˜y,˜zX)(˜x˜y(˜z˜x)(˜z˜y)); (2.2)

    belligerent if it satisfies:

    (˜x,˜y,˜zX)(˜x(˜y˜z)=(˜x˜y)(˜x˜z)). (2.3)

    Proposition 2.3 ([1]). Every GE-algebra X satisfies the following items.

    (˜xX)(˜x1=1). (2.4)
    (˜x,˜yX)(˜x(˜x˜y)=˜x˜y). (2.5)
    (˜x,˜yX)(˜x˜y˜x). (2.6)
    (˜x,˜y,˜zX)(˜x(˜y˜z)˜y(˜x˜z)). (2.7)
    (˜xX)(1˜x˜x=1). (2.8)
    (˜x,˜yX)(˜x(˜y˜x)˜x). (2.9)
    (˜x,˜yX)(˜x(˜x˜y)˜y). (2.10)
    (˜x,˜y,˜zX)(˜x˜y˜z˜y˜x˜z). (2.11)

    If X is transitive, then

    (˜x,˜y,˜zX)(˜x˜y˜z˜x˜z˜y,˜y˜z˜x˜z). (2.12)
    (˜x,˜y,˜zX)(˜x˜y(˜y˜z)(˜x˜z)). (2.13)
    (˜x,˜y,˜zX)(˜x˜y,˜y˜z˜x˜z). (2.14)

    Lemma 2.4 ([1]). A GE-algebra X is transitive if and only if X satisfies the condition (2.13).

    Definition 2.5 ([1]). A subset F of a GE-algebra X is called a GE-filter of X if it satisfies:

    1F, (2.15)
    (˜x,˜yX)(˜x˜yF,˜xF˜yF). (2.16)

    Lemma 2.6 ([1]). In a GE-algebra X, every GE-filter F of X satisfies:

    (˜x,˜yX)(˜x˜y,˜xF˜yF). (2.17)

    Definition 2.7 ([2,8,9]). A subset F of a GE-algebra X containing the constant 1 is called:

    A belligerent GE-filter of X if it satisfies

    (˜x,˜y,˜zX)(˜x(˜y˜z)F,˜x˜yF˜x˜zF). (2.18)

    A prominent GE-filter of X if it satisfies

    (˜x,˜y,˜zX)(˜x(˜y˜z)F,˜xF((˜z˜y)˜y)˜zF). (2.19)

    An imploring GE-filter of X if it satisfies

    (˜x,˜y,˜zX)(˜x((˜y˜z)˜y)F,˜xF˜yF). (2.20)

    Lemma 2.8 ([8]). Let F be a GE-filter of a GE-algebra X. Then F is a prominent GE-filter of X if and only if it satisfies:

    (˜x,˜yX)(˜x˜yF((˜y˜x)˜x)˜yF). (2.21)

    Definition 2.9 ([6]). By an interior GE-algebra we mean a pair (X,ξ) in which X is a GE-algebra and ξ:XX is a mapping such that

    (˜xX)(˜xξ(˜x)), (2.22)
    (˜xX)((ξξ)(˜x)=ξ(˜x)), (2.23)
    (˜x,˜yX)(˜x˜yξ(˜x)ξ(˜y)). (2.24)

    Definition 2.10 ([6]). An interior GE-algebra (X,ξ) is said to be

    transitive if it satisfies:

    (˜x,˜y,˜zX)(ξ(˜x˜y)ξ((˜z˜x)(˜z˜y))); (2.25)

    belligerent if it satisfies:

    (˜x,˜y,˜zX)(ξ(˜x(˜y˜z))=ξ((˜x˜y)(˜x˜z))). (2.26)

    Definition 2.11 ([11]). Let (X,ξ) be an interior GE-algebra. A GE-filter F of X is said to be interior if it satisfies:

    (˜xX)(ξ(˜x)F˜xF). (2.27)

    Definition 2.12 ([11]). Let (X,ξ) be an interior GE-algebra. Then a subset F of X is called a belligerent interior GE-filter in (X,ξ) if F is a belligerent GE-filter of X which satisfies the condition (2.27).

    Definition 2.13 ([10]). Let (X,ξ) be an interior GE-algebra. Then a subset F of X is called a prominent interior GE-filter in (X,ξ) if F is a prominent GE-filter of X which satisfies the condition (2.27).

    Definition 3.1. An interior GE-algebra (X,ξ) is said to be pre-transitive (resp., pre-belligerent, if X itself is transitive (resp., belligerent).

    It is clear that every pre-transitive (resp., pre-belligerent) interior GE-algebra is a transitive (resp., belligerent) interior GE-algebra, but the converse is not true (see [6]).

    In what follows, let (X,ξ) denote an interior GE-algebra unless otherwise specified.

    Definition 3.2. A subset F of X in (X,ξ) is called an imploring interior GE-filter in (X,ξ) if F contains the constant "1" and satisfies (2.20) and (2.27).

    Example 3.3. Consider a set X={1,a,b,c,d} with the binary operation given as follows:

    1abcd11abcda111ccb111ddc1aa11d1aa11

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if ˜x=1,aif ˜x{a,b},cif ˜x{c,d},

    then (X,ξ) is an interior GE-algebra and F:={1,a,b} is an imploring interior GE-filter in in (X,ξ).

    We first discuss the relationship between interior GE-filter and imploring interior GE-filter.

    Theorem 3.4. Every imploring interior GE-filter is an interior GE-filter.

    Proof. Let F be an imploring interior GE-filter in (X,ξ). Then 1F and (2.27) is clearly true. Let x,yX be such that xyF and xF. The combination of (GE1) and (GE2) leads to

    x((yy)y)=xyF.

    It follows from (2.20) that yF. Hence F is an interior GE-filter in (X,ξ).

    The following example shows that the converse of Theorem 3.4 is not true.

    Example 3.5. Let X={1,a,b,c,d} and consider a binary operation and a mapping ξ on X given as follows:

    1abcd11abcda111cdb111cdc1aa1dd1bb11

    and

    ξ:XX,x{1if ˜x=1,aif ˜x{a,b},cif ˜x{c,d}.

    Then (X,ξ) is an interior GE-algebra and the set F:={1,a,b} is an interior GE-filter in (X,ξ). But it is not imploring interior GE-filter in (X,ξ) since

    1((cd)c)=1(dc)=11=1F

    and 1F but cF.

    We find and present the conditions under which interior GE-filter becomes imploring interior GE-filter.

    Theorem 3.6. Given an interior GE-filter F in (X,ξ), the following arguments are equivalent.

    (i) F is an imploring interior GE-filter in (X,ξ). (ii) F satisfies:

    (x,yX)(ξ((xy)x)FxF). (3.1)

    Proof. Assume that F is an imploring interior GE-filter in (X,ξ) and let x,yX be such that ξ((xy)x)F. Then

    1((xy)x)=(xy)xF

    by (GE2) and (2.27). It follows from (2.20) that xF.

    Conversely, let F be an interior GE-filter in (X,ξ) which satisfies the condition (3.1). It is clear that F contains the constant 1 and satisfies the condition (2.27). Let x,y,zX be such that x((yz)y)F and xF. Then (yz)yF by (2.16), and so (yz)yξ((yz)y) by (2.22). Hence ξ((yz)y)F since F is a GE-filter of X. Thus yF by (2.27). Therefore F is an imploring interior GE-filter in (X,ξ).

    Given a subset F of X in (X,ξ), consider the following argument.

    (x,yX)(ξ((xy)y)F(yx)xF). (3.2)

    The following example shows that (imploring) interior GE-filter F in (X,ξ) does not satisfy the argument (3.2).

    Example 3.7. (1) If we consider the interior GE-algebra (X,ξ) in Example 3.5, then the set F:={1,a,b} is an interior GE-filter in (X,ξ). But it does not satisfy the argument (3.2) since ξ((cd)d)=ξ(dd)=ξ(1)=1F but (dc)c=1c=cF.

    (2) Let X={1,a,b,c,d,e} and define binary operation as follows:

    1abcde11abcdea111cddb111cddc1aa1eed1aa111e1aac11

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if ˜x=1,aif ˜x{a,b},cif ˜x=c,dif ˜x{d,e},

    then (X,ξ) is an interior GE-algebra and the set F:={1,a,b} is an imploring interior GE-filter in (X,ξ). But it does not satisfy the argument (3.2) since ξ((cd)d)=ξ(ed)=ξ(1)=1F but (dc)c=1c=cF.

    We explore conditions under which imploring interior GE-filter can satisfy the argument (3.2).

    Proposition 3.8. If (X,ξ) is a pre-transitive interior GE-algebra, then every imploring interior GE-filter F satisfies the argument (3.2).

    Proof. Let F be an imploring interior GE-filter in a pre-transitive interior GE-algebra (X,ξ). Then F is an interior GE-filter in (X,ξ) by Theorem 3.4. Let x,yX be such that ξ((xy)y)F. Then (xy)yF by (2.27). Since x(yx)x by (2.9), it follows from (2.12) that ((yx)x)yxy. Hence

    (xy)y(yx)((xy)x)(xy)((yx)x)(((yx)x)y)((yx)x)

    by (2.7), (2.12) and (2.13). Using (GE2) and Lemma 2.6 derive

    1((((yx)x)y)((yx)x))=(((yx)x)y)((yx)x)F,

    which implies from (2.20) that (yx)xF.

    Corollary 3.9. If (X,ξ) is a pre-belligerent interior GE-algebra, then every imploring interior GE-filter F satisfies the argument (3.2).

    Question. If (X,ξ) is a pre-transitive interior GE-algebra, then

    1. is any interior GE-filter an imploring interior GE-filter?

    2. does any interior GE-filter F satisfy the argument (3.2)?

    The following example provides a negative answer to the above Question.

    Example 3.10. Let X={1,a,b,c,d} and define binary operation as follows:

    1abcd11abcda111cdb111cdc1aa1dd1ab11

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if x=1,aif x{a,b},cif x{c,d},

    then (X,ξ) is a pre-transitive interior GE-algebra. It is routine to verify that the set F:={1,a,b} is an interior GE-filter in (X,ξ). But it is not an imploring interior GE-filter in (X,ξ) since 1((cd)c)=1(dc)=11=1F and 1F but cF. Also, it does not satisfy (3.2) since ξ((cd)d)=ξ(dd)=ξ(1)=1F but (dc)c=1c=cF.

    We consider conditions for an interior GE-filter to be an imploring interior GE-filter.

    Theorem 3.11. Let F be an interior GE-filter in a pre-transitive interior GE-algebra (X,ξ). If F satisfies the argument (3.2), then it is an imploring interior GE-filter in (X,ξ).

    Proof. Assume that F is an interior GE-filter in a pre-transitive interior GE-algebra (X,ξ) which satisfies the argument (3.2). Let x,yX be such that ξ((xy)x)F. Since the combination of (2.5), (2.10) and (2.12) induces

    (xy)x(xy)((xy)y)=(xy)y,

    we get ξ((xy)y)F by (2.24) and Lemma 2.6. Hence (yx)xF by (3.2). Combining (2.6) and (2.12), we get (xy)xyx, and so ξ((xy)x)ξ(yx) by (2.24). Since ξ((xy)x)F, we obtain ξ(yx)F by Lemma 2.6. If follows from (2.27) that yxF. Since (yx)xF, we have xF by (2.16). Therefore F is an imploring interior GE-filter in (X,ξ) by Theorem 3.6.

    Corollary 3.12. Let F be an interior GE-filter in a pre-belligerent interior GE-algebra (X,ξ). If F satisfies the the argument (3.2), then it is an imploring interior GE-filter in (X,ξ).

    In the following example, we can confirm that an imploring interior GE-filter is independent to a belligerent interior GE-filter.

    Example 3.13. (1) Let X={1,a,b,c,d,e} and define binary operation as follows:

    1abcde11abcdea111cddb111cddc1aa1ddd1aac11e1aa111

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if x=1,aif x{a,b},cif x=c,dif x=d,eif x=e,

    then (X,ξ) is an interior GE-algebra which is not pre-transitive since

    (ec)((ae)(ac))=1(dc)=1c=c1.

    We can observe that the set F:={1,a,b} is an imploring interior GE-filter in (X,ξ). But F can not be a belligerent interior GE-filter in (X,ξ) because d(ec)=d1=1F and de=1F but dc=cF.

    (2) Let X={1,a,b,c,d} and define binary operation as follows:

    1abcd11abcda111cdb111cdc1ab1dd11b11

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if x=1,aif x{a,b},cif x=c,dif x=d,

    then (X,ξ) is an interior GE-algebra which is not pre-transitive since

    (ab)((da)(db))=1(1b)=1b=b1.

    Let F={1,a,b}. Then we can observe that F is a belligerent interior GE-filter in (X,ξ). But F is not imploring interior GE-filter in (X,ξ) since 1((cd)c)=1(dc)=11=1F and 1F but cF.

    We explore the conditions under which imploring interior GE-filter becomes belligerent interior GE-filter.

    Lemma 3.14. Let (X,ξ) be a pre-transitive interior GE-algebra. Then every interior GE-filter is a belligerent interior GE-filter.

    Proof. Let F be an interior GE-filter in (X,ξ). Clearly the argument (2.27) is valid and F contains the constant 1. Let x,y,zX be such that x(yz)F and xyF. By (2.7), (2.12) and (2.5), we have

    x(yz)y(xz)(xy)(x(xz))=(xy)(xz).

    Since F is a GE-filter of X and x(yz)F, we get (xy)(xz)F. Hence xzF by Lemma 2.6. Therefore F is a belligerent interior GE-filter in (X,ξ).

    Corollary 3.15. In a pre-transitive interior GE-algebra, every imploring interior GE-filter is a belligerent interior GE-filter.

    Corollary 3.16. In a pre-belligerent interior GE-algebra, every imploring interior GE-filter is a belligerent interior GE-filter.

    The following example shows that the converse of Corollary 3.15 and Corollary 3.16 is not true in general.

    Example 3.17. (1) Consider the pre-transitive interior GE-algebra (X,ξ) which is described in Example 3.10. As

    d(cb)=da=ab=1b=(dc)(db),

    it is not pre-belligerent. Then we can observe that F:={1,a,b} is a belligerent interior GE-filter in (X,ξ). But F is not imploring interior GE-filter in (X,ξ) since 1((cd)c)=1(dc)=11=1F and 1F but cF.

    (2) Let X={1,a,b,c,d} and define binary operation as follows:

    1abcd11abcda111cdb111cdc1aa1dd1aa11

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if x=1,aif x{a,b},cif x{c,d},

    then (X,ξ) is a pre-belligerent interior GE-algebra. Let F={1,a,b}. Then we can observe that F is a belligerent interior GE-filter in (X,ξ). But F is not imploring interior GE-filter in (X,ξ) since 1((cd)c)=1(dc)=11=1F and 1F but cF.

    We establish a relationship between imploring interior GE-filter and prominent interior GE-filter.

    Theorem 3.18. In a GE-algebra, every prominent interior GE-filter is an imploring interior GE-filter.

    Proof. Let F be a prominent interior GE-filter in (X,ξ). Then it is an interior GE-filter in (X,ξ) (see Theorem 3.4 in [10]), and so 1F and F satisfies (2.27). Let x,y,zX be such that x((yz)y)F and xF. Since F is a GE-filter of X, we have (yz)yF. Since F is a prominent GE-filter of X, it follows from (GE1), (GE2), (2.5) and Lemma 2.8 that

    y=1y=((yz)(yz))y=(((y(yz))(yz))yF.

    Therefore F is an imploring interior GE-filter in (X,ξ).

    The converse of Theorem 3.18 is not true as seen in the following example.

    Example 3.19. Consider the interior GE-algebra (X,ξ) in Example 3.7(2). It is not pre-transitive because

    (dc)((ed)(ec))=1(1c)=1c=c1.

    Let F:={1,a,b}. Then we can observe that F is an imploring interior GE-filter in (X,ξ). But F is not a prominent interior GE-filter in (X,ξ) since 1(dc)=11=1F and 1F but ((cd)d)c=(ed)c=1c=cF.

    The combination of Theorem 3.18 and Corollary 3.15 induces the next corollary.

    Corollary 3.20. In a pre-transitive GE-algebra, every prominent interior GE-filter is a belligerent interior GE-filter.

    Consider the pre-transitive interior GE-algebra (X,ξ) which is described in Example 3.10. As

    d(cb)=da=ab=1b=(dc)(db),

    it is not pre-belligerent. Then we can observe that F:={1,a,b} is a belligerent interior GE-filter in (X,ξ). But F is not a prominent interior GE-filter in (X,ξ) since 1(dc)=11=1F and 1F but ((cd)d)c=(dd)c=1c=cF. Hence we know that the converse of Corollary 3.20 is not true in general.

    We can strengthen the conditions of interior GE-algebra so that imploring interior GE-filter becomes prominent interior GE-filter.

    Theorem 3.21. If (X,ξ) is a pre-transitive interior GE-algebra, then every imploring interior GE-filter is a prominent interior GE-filter.

    Proof. Let F be an imploring interior GE-filter in a pre-transitive interior GE-algebra (X,ξ). Then F satisfies (2.27) and it is an interior GE-filter in (X,ξ) (see Theorem 3.4), and so F is a GE-filter of X. Let x,yX be such that xyF. Note that y((yx)x)y by (2.6), and thus (((yx)x)y)xyx by (2.12). It follows from (2.2), (2.7) and (2.12) that

    xy((yx)x)((yx)y)(yx)(((yx)x)y)((((yx)x)y)x)(((yx)x)y).

    Hence ((((yx)x)y)x)(((yx)x)y)F by Lemma 2.6, and so

    1(((((yx)x)y)x)(((yx)x)y))=((((yx)x)y)x)(((yx)x)y)F

    by (GE2). Since 1F, we have ((yx)x)yF by (2.20). This shows that F is a prominent GE-filter of X by Lemma 2.8, and therefore F is a prominent interior GE-filter in (X,ξ).

    Corollary 3.22. If (X,ξ) is a pre-belligerent interior GE-algebra, then every imploring interior GE-filter is a prominent interior GE-filter.

    The following example shows that prominent interior GE-filter and belligerent interior GE-filter are independent of each other.

    Example 3.23. (1) Let X={1,a,b,c,d,e} and define binary operation as follows:

    1abcde11abcdea111cdeb111cdec1aa1d1d1aac11e1aa111

    If we define a mapping ξ on X as follows:

    ξ:XX,x{1if x=1,aif x{a,b},cif x=c,dif x=d,eif x=e,

    then (X,ξ) is an interior GE-algebra. We can observe that the set F:={1,a,b} is a prominent interior GE-filter in (X,ξ). But it is not a belligerent interior GE-filter in (X,ξ) because of d(ec)=d1=1F and de=1F but dc=cF.

    (2) In Example 3.13(2), we can observe that F:={1,a,b} is a belligerent interior GE-filter in (X,ξ). But it is not a prominent interior GE-filter in (X,ξ) since 1(dc)=11=1F and 1F but ((cd)d)c=(dd)c=1c=cF.

    We build the extension property of imploring interior GE-filter.

    Lemma 3.24. In a pre-transitive interior GE-algebra (X,ξ), every interior GE-filter F satisfies:

    (x,y,zX)(ξ(x(yz))F(xy)(xz)F). (3.3)

    Proof. Let x,y,zX be such that ξ(x(yz))F. Since

    x(yz)x((xy)(xz))x(x((xy)z))=x((xy)z)(xy)(xz),

    we get ξ(x(yz))ξ((xy)(xz)) by (2.24). It follows from Lemma 2.6 and (2.27) that (xy)(xz)F.

    Theorem 3.25. Let F and G be interior GE-filters in a pre-transitive interior GE-algebra (X,ξ). If F is contained in G and F is an imploring interior GE-filter in (X,ξ), then G is also an imploring interior GE-filter in (X,ξ).

    Proof. Assume that FG and F is an imploring interior GE-filter in (X,ξ). Let x,yX be such that ξ((xy)y)G. Then (xy)yG by (2.27). Since ξ(((xy)y)((xy)y))=ξ(1)=1F, It follows from Lemma 3.24 that (((xy)y)(xy))(((xy)y)y)F. Using (2.7) and (2.12), we have

    (((xy)y)(xy))(((xy)y)y)(x(((xy)y)y))(((xy)y)y).

    Hence (x(((xy)y)y))(((xy)y)y)F by Lemma 2.6, and so

    ξ((x(((xy)y)y))(((xy)y)y))F

    by (2.22) and Lemma 2.6. Since F is an imploring interior GE-filter in (X,ξ), we have

    ((((xy)y)y)x)xFG

    by Proposition 3.8. Note that

    (xy)y(((xy)y)y)y(yx)((((xy)y)y)x)(((((xy)y)y)x)x)((yx)x).

    It follows from Lemma 2.6 that

    (((((xy)y)y)x)x)((yx)x)G.

    Thus (yx)xG, and consequently G is an imploring interior GE-filter in (X,ξ) by Theorem 3.11.

    Corollary 3.26. Let F and G be interior GE-filters in a pre-belligerent interior GE-algebra (X,ξ). If F is contained in G and F is an imploring interior GE-filter in (X,ξ), then G is also an imploring interior GE-filter in (X,ξ).

    We have introduced the concept of an imploring interior GE-filter and investigated their properties. We have discussed the relationship between an interior GE-filter and an imploring interior GE-filter. We have given an example to show that any interior GE-filter is not an imploring interior GE-filter. We have given conditions for an interior GE-filter to be an imploring interior GE-filter. We have provided examples to show that an imploring interior GE-filter is independent to a belligerent interior GE-filter. Conditions for an imploring interior GE-filter to be a belligerent interior GE-filter are given. We have discussed the relationship between imploring interior GE-filter and prominent interior GE-filter. We have provided an example to show that any imploring interior GE-filter is not a prominent interior GE-filter. Conditions for an imploring interior GE-filter to be a prominent interior GE-filter are given. Also, we have considered the conditions under which an interior GE-filter larger than a given interior GE-filter can become an imploring interior GE-filter. In future, we will study the prime and maximal imploring interior GE-filters and their topological properties. Moreover, based on the ideas and results obtained in this paper, we will study the interior operator theory in related algebraic systems such as MV-algebra, BL-algebra, EQ-algebra, etc. It will also be used for pseudo algebra systems and further to conduct research related to the very true operator theory.

    The authors wish to thank the anonymous reviewers for their valuable suggestions.

    All authors declare no conflicts of interest in this paper.



    [1] O. A. Raouf, I. M. Hezam, Sperm Motility Algorithm: A novel metaheuristic approach for global optimisation, Int. J. Oper. Res., 28 (2017), 143. https://doi.org/10.1504/IJOR.2017.081473 doi: 10.1504/IJOR.2017.081473
    [2] A. K. Mandal, R. Sen, S. Goswami, A. Chakrabarti, B. Chakraborty, A new approach for feature subset selection using quantum inspired owl search algorithm, In: 2020 10th International Conference on Information Science and Technology (ICIST), 2020,266-273. https://doi.org/10.1109/ICIST49303.2020.9202140
    [3] M. Mirhosseini, M. Fazlali, H. T. Malazi, S. K. Izadi, H. Nezamabadi-pour, Parallel Quadri-valent Quantum-Inspired Gravitational Search Algorithm on a heterogeneous platform for wireless sensor networks, Comput. Electr. Eng., 92 (2021), 107085. https://doi.org/10.1016/j.compeleceng.2021.107085 doi: 10.1016/j.compeleceng.2021.107085
    [4] L. Gyongyosi, S. Imre, A survey on quantum computing technology, Comput. Sci. Rev., 31 (2019), 51-71. https://doi.org/10.1016/j.cosrev.2018.11.002 doi: 10.1016/j.cosrev.2018.11.002
    [5] A. W. Harrow, A. Montanaro, Quantum computational supremacy, Nature, 549 (2017), 203-209. https://doi.org/10.1038/nature23458 doi: 10.1038/nature23458
    [6] L. Gyongyosi, S. Imre, Scalable distributed gate-model quantum computers, Sci. Rep., 11 (2021), 5172. https://doi.org/10.1038/s41598-020-76728-5 doi: 10.1038/s41598-020-76728-5
    [7] F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, et al., Quantum supremacy using a programmable superconducting processor, Nature, 574 (2019), 505-510. https://doi.org/10.1038/s41586-019-1666-5 doi: 10.1038/s41586-019-1666-5
    [8] J. Preskill, Quantum computing in the NISQ era and beyond, Quantum, 2 (2018), 79. https://doi.org/10.22331/q-2018-08-06-79 doi: 10.22331/q-2018-08-06-79
    [9] S. Aaronson, L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, In: 32nd Computational Complexity Conference (CCC 2017), 2017. https://doi.org/10.4230/LIPIcs.CCC.2017.22
    [10] Y. Alexeev, D. Bacon, K. R. Brown, R. Calderbank, L. D. Carr, F. T. Chong, et al., Quantum computer systems for scientific discovery, PRX Quantum, 2 (2021), 017001. https://doi.org/10.1103/PRXQuantum.2.017001 doi: 10.1103/PRXQuantum.2.017001
    [11] D. Awschalom, K. K. Berggren, H. Bernien, S. Bhave, L. D. Carr, P. Davids, et al., Development of quantum interconnects (QuICs) for next-generation information technologies, PRX Quantum, 2 (2021), 017002. https://doi.org/10.1103/PRXQuantum.2.017002 doi: 10.1103/PRXQuantum.2.017002
    [12] E. Farhi, H. Neven, Classification with quantum neural networks on near termprocessors, arXiv, 2018. Available from: http://arXiv.org/abs/1802.06002.
    [13] S. Lloyd, Quantum approximate optimization is computationally universal, 2018. Available from: http://arXiv.org/abs/1812.11075.
    [14] A. Manju, M. J. Nigam, Applications of quantum inspired computational intelligence: A survey, Artif. Intell. Rev., 42 (2014), 79-156. https://doi.org/10.1007/s10462-012-9330-6 doi: 10.1007/s10462-012-9330-6
    [15] G. Zhang, Quantum-Inspired Evolutionary Algorithms: A survey and empirical study, J. Heuristics, 17 (2011), 303-351. https://doi.org/10.1007/s10732-010-9136-0 doi: 10.1007/s10732-010-9136-0
    [16] D. Johannsen, P. P. Kurur, J. Lengler, Evolutionary algorithms for quantum computers, 68 (2014), 152-189. https://doi.org/10.1007/s00453-013-9784-1
    [17] E. R. Johnston, Programming quantum computers: Essential algorithms and code samples, O'Reilly Media, 2019.
    [18] D. Goswami, Quantum distributed computing applied to Grover'search algorithm, In: Computing with new resources, Lecture Notes in Computer Science, Springer, 2014. https://doi.org/10.1007/978-3-319-13350-8_14
    [19] A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, J. D. Doll, Quantum annealing: A new method for minimizing multidimensional functions, Chem. Phys. Lett., 219 (1994), 343-348. https://doi.org/10.1016/0009-2614(94)00117-0 doi: 10.1016/0009-2614(94)00117-0
    [20] M. Steffen, W. van Dam, T. Hogg, G. Breyta, I. Chuang, Experimental implementation of an adiabatic quantum optimization algorithm, Phys. Rev. Lett., 90 (2003), 067903. https://doi.org/10.1103/PhysRevLett.90.067903 doi: 10.1103/PhysRevLett.90.067903
    [21] A. Narayanan, M. Moore, Quantum-Inspired Genetic Algorithms, In: Proceedings of the IEEE Conference on Evolutionary Computation, 1996, 61-66. https://doi.org/10.1109/icec.1996.542334
    [22] H. Kundra, W. Khan, M. Malik, K. P. Rane, R. Neware, V. Jain, Quantum-Inspired Firefly Algorithm integrated with cuckoo search for optimal path planning, Int. J. Mod. Phys. C, 33 (2021), 2250018. https://doi.org/10.1142/S0129183122500188 doi: 10.1142/S0129183122500188
    [23] N. R. Eluri, G. R. Kancharla, S. Dara, V. Dondeti, Cancer data classification by quantum-inspired immune clone optimization-based optimal feature selection using gene expression data: Deep learning approach, Date Technol. Appl., 2021. https://doi.org/10.1108/DTA-05-2020-0109 doi: 10.1108/DTA-05-2020-0109
    [24] B. Arun, Quality materialised view selection using quantum inspired artificial bee colony optimisation, Int. J. Intell. Inf. Database Syst., 13 (2020), 33-60. https://doi.org/10.1504/IJIIDS.2020.108215 doi: 10.1504/IJIIDS.2020.108215
    [25] Z. Gao, Y. Zhang, S. Zhou, W. Lyu, An enhanced Quantum-Inspired Gravitational Search Algorithm for color prediction based on the absorption spectrum, Text. Res. J., 91 (2021), 1211-1226. https://doi.org/10.1177/0040517520977007 doi: 10.1177/0040517520977007
    [26] Y. Meraihi, D. Acheli, A. R. Cherif, M. Mahseur, A Quantum-Inspired Binary Firefly Algorithm for QoS multicast routing, Int. J. Metaheuristics, 6 (2017), 309-333. https://doi.org/10.1504/IJMHEUR.2017.086980 doi: 10.1504/IJMHEUR.2017.086980
    [27] T. C. Lu, J. C. Juang, Quantum-Inspired Space Search Algorithm (QSSA) for global numerical optimization, Appl. Math. Comput., 218 (2011), 2516-2532. https://doi.org/10.1016/j.amc.2011.07.067 doi: 10.1016/j.amc.2011.07.067
    [28] A. Layeb, A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems, J. Comput. Appl. Math., 253 (2013), 14-25. https://doi.org/10.1016/j.cam.2013.04.004 doi: 10.1016/j.cam.2013.04.004
    [29] R. K. Agrawal, B. Kaur, P. Agarwal, Quantum Inspired Particle Swarm Optimization with guided exploration for function optimization, Appl. Soft Comput., 102 (2021), 107122. https://doi.org/10.1016/j.asoc.2021.107122 doi: 10.1016/j.asoc.2021.107122
    [30] A. S. Thakur, T. Biswas, P. Kuila, Binary quantum-inspired gravitational search algorithm-based multi-criteria scheduling for multi-processor computing systems, J. Supercomput., 77 (2021), 796-817. https://doi.org/10.1007/s11227-020-03292-0 doi: 10.1007/s11227-020-03292-0
    [31] K. Mishra, R. Pradhan, S. K. Majhi, Quantum-Inspired Binary Chaotic Salp Swarm Algorithm (QBCSSA)-based dynamic task scheduling for multiprocessor cloud computing systems, J. Supercomput., 77 (2021), 10377-10423. https://doi.org/10.1007/s11227-021-03695-7 doi: 10.1007/s11227-021-03695-7
    [32] R. Pradhan, M. R. Khan, P. K. Sethy, S. K. Majhi, QALO-MOR: Improved antlion optimizer based on quantum information theory for model order reduction, J. Intell. Fuzzy Syst., 41 (2021), 5747-5757. https://doi.org/10.3233/JIFS-189894 doi: 10.3233/JIFS-189894
    [33] S. A. Mohsin, A. Younes, S. M. Darwish, Dynamic cost ant colony algorithm to optimize query for distributed database based on quantum-inspired approach, Symmetry, 13 (2021), 1-20. https://doi.org/10.3390/sym13010070 doi: 10.3390/sym13010070
    [34] V. P. Soloviev, C. Bielza, P. Larranaga, Quantum-Inspired Estimation of Distribution Algorithm to solve the travelling salesman problem, In: 2021 IEEE Congress on Evolutionary Computation (CEC), 2021,416-425. https://doi.org/10.1109/CEC45853.2021.9504821
    [35] M. Soleimanpour-Moghadam, H. Nezamabadi-Pour, An improved quantum behaved gravitational search algorithm, In: ICEE 2012-20th Iranian Conference on Electrical Engineering, (2012), 711-715. https://doi.org/10.1109/IranianCEE.2012.6292446
    [36] A. S. Hesar, S. R. Kamel, M. Houshmand, A quantum multi-objective optimization algorithm based on harmony search method, Soft. Comput., 25 (2021), 9427-9439. https://doi.org/10.1007/s00500-021-05799-x doi: 10.1007/s00500-021-05799-x
    [37] X. Liu, G. G. Wang, L. Wang, LSFQPSO: Quantum particle swarm optimization with optimal guided Léyy flight and straight flight for solving optimization problems, Eng. Comput., 2021. https://doi.org/10.1007/s00366-021-01497-2 doi: 10.1007/s00366-021-01497-2
    [38] X. Zhang, S. Xia, X. Li, Quantum behavior-based enhanced fruit fly optimization algorithm with application to UAV path planning, Int. J. Comput. Intell. Syst., 13 (2020), 1315. https://doi.org/10.2991/ijcis.d.200825.001 doi: 10.2991/ijcis.d.200825.001
    [39] X. Zhang, S. Xia, Quantum behaved fruit fly optimization algorithm for continuous function optimization problems, In: Advances in swarm intelligence, Lecture Notes in Computer Science, Springer, 2019,331-340. https://doi.org/10.1007/978-3-030-26369-0_31
    [40] A. Kaveh, M. Kamalinejad, H. Arzani, Quantum evolutionary algorithm hybridized with Enhanced colliding bodies for optimization, Structures, 28 (2020), 1479-1501. https://doi.org/10.1016/j.istruc.2020.09.079 doi: 10.1016/j.istruc.2020.09.079
    [41] N. R. Zhou, S. H. Xia, Y. Ma, Y. Zhang, Quantum particle swarm optimization algorithm with the truncated mean stabilization strategy, Quantum Inf. Process., 21 (2022), 42. https://doi.org/10.1007/s11128-021-03380-x doi: 10.1007/s11128-021-03380-x
    [42] M. S. Alvarez-Alvarado, F. E. Alban-Chacón, E. A. Lamilla-Rubio, C. D. Rodríguez-Gallegos, W. Velásquez, Three novel quantum-inspired swarm optimization algorithms using different bounded potential fields, Sci. Rep., 11 (2021), 11655. https://doi.org/10.1038/s41598-021-90847-7 doi: 10.1038/s41598-021-90847-7
    [43] A. T. Khan, X. Cao, S. Li, B. Hu, V. N. Katsikis, Quantum beetle antennae search: a novel technique for the constrained portfolio optimization problem, Sci. China Inf. Sci., 64 (2021), 152204. https://doi.org/10.1007/s11432-020-2894-9 doi: 10.1007/s11432-020-2894-9
    [44] S. Palosaari, S. Parviainen, J. Hironen, J. Reunanen, P. Neittaanmaki, A random search algorithm for constrained global optimization, Acta Polytech. Scand.-Chem. Technol., 172 (1986), 2-45.
    [45] N. Manzanares-Filho, R. B. F. Albuquerque, B. S. Sousa, L. G. C. Santos, A comparative study of controlled random search algorithms with application to inverse aerofoil design, Eng. Optim., 50 (2018), 996-1015. https://doi.org/10.1080/0305215X.2017.1359584 doi: 10.1080/0305215X.2017.1359584
    [46] Y. Sun, T. Yang, Z. Liu, A whale optimization algorithm based on quadratic interpolation for high-dimensional global optimization problems, Appl. Soft Comput., 85 (2019), 105744. https://doi.org/10.1016/j.asoc.2019.105744 doi: 10.1016/j.asoc.2019.105744
    [47] D. Singh, S. Agrawal, Self organizing migrating algorithm with quadratic interpolation for solving large scale global optimization problems, Appl. Soft Comput., 38 (2016), 1040-1048. https://doi.org/10.1016/j.asoc.2015.09.033 doi: 10.1016/j.asoc.2015.09.033
    [48] A. Kaveh, M. I. Ghazaan, F. Saadatmand, Colliding bodies optimization with Morlet wavelet mutation and quadratic interpolation for global optimization problems, Eng. Optim., 2021. https://doi.org/10.1007/s00366-020-01236-z doi: 10.1007/s00366-020-01236-z
    [49] Y. Sun, Y. Chen, Multi-population improved whale optimization algorithm for high dimensional optimization, Appl. Soft Comput., 112 (2021), 107854. https://doi.org/10.1016/j.asoc.2021.107854 doi: 10.1016/j.asoc.2021.107854
    [50] H. Nezamabadi-pour, A Quantum-Inspired Gravitational Search Algorithm for binary encoded optimization problems, Eng. Appl. Artif. Intell., 40 (2015), 62-75. https://doi.org/10.1016/j.engappai.2015.01.002 doi: 10.1016/j.engappai.2015.01.002
    [51] D. J. Smith, E. A. Gaffney, J. R. Blake, J. C. Kirkman-Brown, Human sperm accumulation near surfaces: A simulation study, J. Fluid Mech., 621 (2009), 289-320. https://doi.org/10.1017/S0022112008004953 doi: 10.1017/S0022112008004953
    [52] D. J. Smith, A boundary element regularized Stokeslet method applied to cilia-and flagella-driven flow, Proc. R. Soc. A, Math. Phys. Eng. Sci., 465 (2009), 3605-3626. https://doi.org/10.1098/rspa.2009.0295 doi: 10.1098/rspa.2009.0295
    [53] V. Christianto, F. Smarandache, An exact mapping from Navier-Stokes equation to Schrödinger equation via Riccati equation, Prog. Phys., 1 (2007), 38-39.
    [54] K. Dietrich, D. Vautherin, Sur l'équivalence entre des types particuliers des équations de Navier-Stokes et de Schrödinger non linéaire, J. Phys., 46 (1985), 313-316. https://doi.org/10.1051/jphys:01985004603031300 doi: 10.1051/jphys:01985004603031300
    [55] V. V. Kulish, J. L. Lage, Exact solutions to the Navier-Stokes equation for an incompressible flow from the interpretation of the Schroedinger wave function, arXiv, 2013. Available from: https://arXiv.org/abs/1301.3586.
    [56] T. Schürmann, I. Hoffmann, A closer look at the uncertainty relation of position and momentum, Found. Phys., 39 (2009), 958-963. https://doi.org/10.1007/s10701-009-9310-0 doi: 10.1007/s10701-009-9310-0
    [57] N. Manzanares-Filho, C. A. A. Moino, A. B. Jorge, An Improved Controlled Random Search Algorithm for inverse airfoil cascade design, In: Proceedings of 6th World Congresses of Structural and Multidisciplinary Optimization, 2005.
    [58] M. Pant, R. Thangaraj, A. Abraham, A new quantum behaved particle swarm optimization, In: GECCO?8: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, 2008, 87-94. https://doi.org/10.1145/1389095.1389108
    [59] A. Manju, M. J. Nigam, An improved quantum inspired firefly algorithm with interpolation operator, In: Proceedings of the Third International Conference on Soft Computing for Problem Solving, Advances in Intelligent Systems and Computing, Springer, 2014. https://doi.org/10.1007/978-81-322-1771-8_7
    [60] N. Manzanares-Filho, R. B. F. Albuquerque, Accelerating controlled random search algorithms using a distribution strategy, EngOpt 2008-Int. Conf. Eng. Optim., 2008.
    [61] B. S. De Sousa, N. Manzanares-Filho, A. B. Jorge, Multiobjective laminar-flow airfoil shape optimization using a controlled random search algorithm, EngOpt 2008-Int. Conf. Eng. Optim., 2008.
    [62] A. H. Gandomi, A. H. Alavi, Krill herd: A new bio-inspired optimization algorithm, Commun. Nonlinear Sci. Numer. Simul., 17 (2012), 4831-4845. https://doi.org/10.1016/j.cnsns.2012.05.010 doi: 10.1016/j.cnsns.2012.05.010
    [63] I. M. Hezam, O. A. Raouf, M. M. Hadhoud, A new compound swarm intelligence algorithms for solving global optimization problems, Int. J. Comput. Technol., 10 (2013), 2010-2020. https://doi.org/10.24297/ijct.v10i9.1389 doi: 10.24297/ijct.v10i9.1389
    [64] M. Jamil, X. S. Yang, A literature survey of benchmark functions for global optimisation problems, Int. J. Math. Model. Numer. Optim., 4 (2013), 150-194. https://doi.org/10.1504/IJMMNO.2013.055204 doi: 10.1504/IJMMNO.2013.055204
    [65] K. V. Price, N. H. Awad, M. Z. Ali, P. N. Suganthan, Problem definitions and 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, Singapore: Nanyang Technological University, 2018.
    [66] A. Faramarzi, M. Heidarinejad, B. Stephens, S. Mirjalili, Equilibrium optimizer: A novel optimization algorithm, Knowl.-Based Syst., 191 (2020), 105190. https://doi.org/10.1016/j.knosys.2019.105190 doi: 10.1016/j.knosys.2019.105190
    [67] 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
    [68] S. Mirjalilia, A. H. Gandomibf, S. Z, Mirjalilic, S. Saremi, H. Farisd, S. M. Mirjalilie, Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems, Adv. Eng. Softw., 114 (2017), 163-191. https://doi.org/10.1016/j.advengsoft.2017.07.002 doi: 10.1016/j.advengsoft.2017.07.002
  • 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(2687) PDF downloads(85) Cited by(4)

Figures and Tables

Figures(3)  /  Tables(7)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog