In the traditional particle swarm optimization algorithm, the particles always choose to learn from the well-behaved particles in the population during the population iteration. Nevertheless, according to the principles of particle swarm optimization, we know that the motion of each particle has an impact on other individuals, and even poorly behaved particles can provide valuable information. Based on this consideration, we propose Lévy flight-based inverse adaptive comprehensive learning particle swarm optimization, called LFIACL-PSO. In the LFIACL-PSO algorithm, First, when the particle is trapped in the local optimum and cannot jump out, inverse learning is used, and the learning step size is obtained through the Lévy flight. Second, to increase the diversity of the algorithm and prevent it from prematurely converging, a comprehensive learning strategy and Ring-type topology are used as part of the learning paradigm. In addition, use the adaptive update to update the acceleration coefficients for each learning paradigm. Finally, the comprehensive performance of LFIACL-PSO is measured using 16 benchmark functions and a real engineering application problem and compared with seven other classical particle swarm optimization algorithms. Experimental comparison results show that the comprehensive performance of the LFIACL-PSO outperforms comparative PSO variants.
Citation: Xin Zhou, Shangbo Zhou, Yuxiao Han, Shufang Zhu. Lévy flight-based inverse adaptive comprehensive learning particle swarm optimization[J]. Mathematical Biosciences and Engineering, 2022, 19(5): 5241-5268. doi: 10.3934/mbe.2022246
[1] | Tahir Khan, Fathalla A. Rihan, Muhammad Ibrahim, Shuo Li, Atif M. Alamri, Salman A. AlQahtani . Modeling different infectious phases of hepatitis B with generalized saturated incidence: An analysis and control. Mathematical Biosciences and Engineering, 2024, 21(4): 5207-5226. doi: 10.3934/mbe.2024230 |
[2] | Xichao Duan, Sanling Yuan, Kaifa Wang . Dynamics of a diffusive age-structured HBV model with saturating incidence. Mathematical Biosciences and Engineering, 2016, 13(5): 935-968. doi: 10.3934/mbe.2016024 |
[3] | Kaushik Dehingia, Anusmita Das, Evren Hincal, Kamyar Hosseini, Sayed M. El Din . Within-host delay differential model for SARS-CoV-2 kinetics with saturated antiviral responses. Mathematical Biosciences and Engineering, 2023, 20(11): 20025-20049. doi: 10.3934/mbe.2023887 |
[4] | Balázs Csutak, Gábor Szederkényi . Robust control and data reconstruction for nonlinear epidemiological models using feedback linearization and state estimation. Mathematical Biosciences and Engineering, 2025, 22(1): 109-137. doi: 10.3934/mbe.2025006 |
[5] | Yoichi Enatsu, Yukihiko Nakata . Stability and bifurcation analysis of epidemic models with saturated incidence rates: An application to a nonmonotone incidence rate. Mathematical Biosciences and Engineering, 2014, 11(4): 785-805. doi: 10.3934/mbe.2014.11.785 |
[6] | Mengya Huang, Anji Yang, Sanling Yuan, Tonghua Zhang . Stochastic sensitivity analysis and feedback control of noise-induced transitions in a predator-prey model with anti-predator behavior. Mathematical Biosciences and Engineering, 2023, 20(2): 4219-4242. doi: 10.3934/mbe.2023197 |
[7] | Zhenzhen Shi, Huidong Cheng, Yu Liu, Yanhui Wang . Optimization of an integrated feedback control for a pest management predator-prey model. Mathematical Biosciences and Engineering, 2019, 16(6): 7963-7981. doi: 10.3934/mbe.2019401 |
[8] | Jiying Ma, Shasha Ma . Dynamics of a stochastic hepatitis B virus transmission model with media coverage and a case study of China. Mathematical Biosciences and Engineering, 2023, 20(2): 3070-3098. doi: 10.3934/mbe.2023145 |
[9] | Guirong Jiang, Qishao Lu, Linping Peng . Impulsive Ecological Control Of A Stage-Structured Pest Management System. Mathematical Biosciences and Engineering, 2005, 2(2): 329-344. doi: 10.3934/mbe.2005.2.329 |
[10] | Pan Yang, Jianwen Feng, Xinchu Fu . Cluster collective behaviors via feedback pinning control induced by epidemic spread in a patchy population with dispersal. Mathematical Biosciences and Engineering, 2020, 17(5): 4718-4746. doi: 10.3934/mbe.2020259 |
In the traditional particle swarm optimization algorithm, the particles always choose to learn from the well-behaved particles in the population during the population iteration. Nevertheless, according to the principles of particle swarm optimization, we know that the motion of each particle has an impact on other individuals, and even poorly behaved particles can provide valuable information. Based on this consideration, we propose Lévy flight-based inverse adaptive comprehensive learning particle swarm optimization, called LFIACL-PSO. In the LFIACL-PSO algorithm, First, when the particle is trapped in the local optimum and cannot jump out, inverse learning is used, and the learning step size is obtained through the Lévy flight. Second, to increase the diversity of the algorithm and prevent it from prematurely converging, a comprehensive learning strategy and Ring-type topology are used as part of the learning paradigm. In addition, use the adaptive update to update the acceleration coefficients for each learning paradigm. Finally, the comprehensive performance of LFIACL-PSO is measured using 16 benchmark functions and a real engineering application problem and compared with seven other classical particle swarm optimization algorithms. Experimental comparison results show that the comprehensive performance of the LFIACL-PSO outperforms comparative PSO variants.
In the past decade, information technology has gotten a rapid development, and is playing an important role in industry, commerce and humans' daily life. Computers, the most primary carriers of the advanced technique, are the requisite hardware of the modern science. However, computers have to face the threaten of worm and virus which are the biggest menace to the normal operation[16,14]. Generally, the operators do not know the existence of the computer worm, least of all how and when their computers have been infected. Worm and virus are always attached to a junk mail, masqueraded as innocent files for downloading, even ensconced in a code spreading through the Internet[5]. The dissemination of the worm and virus only needs someone to open the host file, then the worm and virus can transmit automatically without any additional operation[30]. Up to now, computer worm and virus can averagely cause billions of economic damage every year. To the operators, the direct results caused by infectious, such as causing system collapse, occupying computer RAM and demolishing existence data etc, always make them pay a heavy price. In response, updating antivirus software and patching operating system are two primary protections.
Recently, some researchers described the transmission and prevention of computer worm and virus with the state feedback compulsive model, and they have got some interesting results[7,12,27]. In their models, when the number of infected computers reaches a certain level the impulsive control will be triggered. Then new antivirus software will be published and installed, operating system will be patched to the latest version. All those activities happened instantaneously, and they are depicted as an impulse in the model.
However, the published researches all assume the diffusion of worm and virus is linear with the number of infected and susceptible computers which goes against the truth. In fact, at the initial period of a certain transmission, among the huge number of healthy computers connected with the Internet, only few of them have the opportunity to touch the virus[9,22,31]. And following the development, the infectious rate can not keep being linear with the infected and susceptible ones if the infected computers are numerically superior. So it is proper to describe the infectious with saturated transmission, and we will study the impulsive control of computer virus under this spreading fashion.
The remaining of this paper is arranged as follows: we set up the model and introduce some preliminaries in section 2; the existence, uniqueness and stability of order-1 limit cycle are analyzed in section 3; finally, some numerical simulation are showed to confirm the result and some deeper discussion is carried out in section 4.
Enlightened by the development in the field of impulsive control and the progress of infectious disease study [19,29,25,26], all the computers connected with the Internet are divided into two disjoint groups:
Considering objectively, we make the following assumptions:
(1) all the new emerging computers are susceptible ones, and the rate is
(2) rejection rate is not affected by the computer worm and virus, and both suceptibles and infectives are sifted out from the Internet at rate
(3) the transmission incidence is
(4)
When infectives is less than
{dSdt=K−βSI1+αS−μS,dIdt=βSI1+αS−μI,I<ˉI, ΔS=−σ1S, ΔI=−σ2I,I=ˉI. | (1) |
Considering the practical significance, all the parameters in this paper are positive,
In the reminder part of this section, we introduce some definitions and lemmas to support the proof of the existence and stability of the order-1 limit cycle of system (1).
Definition 2.1 (19-25) A typical state feedback impulsive differential model can be defined as
{dxdt=P(x,y), dydt=Q(x,y), (x,y)∉M{x,y},Δx=α(x,y), Δy=β(x,y), (x,y)∈M{x,y}, | (2) |
and can be denoted by
Definitions of successor function and order-1 periodic solution of state feedback impulsive dynamic system are also vitally important in the research.
Definition 2.2. [2,21,15] Simply suppose the impulse set
Remark 1. The necessary and sufficient condition that the solution passing point
Lemma 2.3. [2,21,15] To a state feedback impulsive dynamic system
Without counting the impulsive control measure, system (1) can be simplified as
{dSdt=K−βSI1+αS−μS,dIdt=βSI1+αS−μI, | (3) |
system (3) is called uncontrolled system of (1). Change the variables with linear transform
{dSdt=−βSI+(K−μS)(1+αS),dIdt=βSI−μI(1+αS). | (4) |
It is obvious that system (4) has two equilibria
S∗=μβ−μα and I∗=(K−μS∗)(1+αS∗)βS∗=Kμ−μβ−μα. |
β>μ2K+μα. | (5) |
In the following discussions, we assume condition (5) is satisfied consistently. The Jacobian matrix of
JE1=(−μ−αK−βKμ0βKμ−μ−αK), |
JE2=(−Kμ(β−μα)−αμ2β−μα−βμβ−μαKμ(β−μα)−μ0). |
Assume
λ1+λ2=−Kμ(β−μα)−αμ2β−μα<0 and λ1⋅λ2=βμβ−μα(Kμ(β−μα)−μ)>0, |
so
In this part, we will consider the uniform boundedness in the first quadrant. From system (4), we can find that
I=−μαβS+Kβ1S+Kα−μβ |
is vertical isoclinic line, and
S=μβ−μα and I=0 |
are horizontal isoclinic lines.
Following the succeeded statement, we select a piece of bounded region (see Fig. 3). Designate a line
Assume
dφdt=dIdt−adSdt=(1+a)aβ⋅x2+[bβ(1+a)−α(aK+bμ)]⋅x−(aK+bμ). | (6) |
Set
Assume Dulac function
{dSdt=−βSI+(K−μS)(1+αS)Δ=P(S,I),dIdt=βSI−μI(1+αS)Δ=Q(S,I), | (7) |
then
{dSdt=u(S,I)P(S,I)=−βSI+(K−μS)(1+αS)Δ=P1(S,I),dIdt=u(S,I)Q(S,I)=βSI−μI(1+αS)Δ=Q1(S,I). | (8) |
It is obvious that
Basing on the above discussion, if condition (5) is satisfied, then there exists only one positive equilibrium
In this section, we will certificate the existence and uniqueness of order-1 limit cycle of system (1). In reality, it is unreasonable that a single kind of computer virus lasts for long time without being detected. So we assume
The existence of order-1 limit cycle is studied in this subsection.
Theorem 4.1. If condition (5) holds, for any
Proof. In system (1), to any
Assume the intersection of imagine set
Case of
Case of
Basing on the above discussion, to any
Since the order-1 periodic solution is isolated, its trajectory and the proper impulsive line can form order-1 limit cycle of system(1).
In this part we prove the uniqueness of the order-1 limit cycle with the homogeneous of successor function.
Theorem 4.2. The order-1 limit cycle of system (1) is unique.
Proof. Select two points
The above content has proved the existence and uniqueness of order-1 limit cycle. In this subsection, we discuss the stability of the order-1 limit cycle of system (1). Unlike the case of continuous dynamic system, the stability proof of impulsive dynamic system is quite complex. Some definition and lemma which are significant in the proof will be illustrated first.
Definition 4.3. [24] The order-1 limit cycle
Basing on the theorem of subsection 4.1 and 4.2, to any
S0,S1,⋯,Sk,Sk+1,⋯, |
where
sk={−dk,Sk is on left side of A,dk,Sk is on right side of A, |
where
Lemma 4.4. [24] Denote the mapping of the general impulsive dynamic system (2) as
|dˉsds|s=0<1(>1). |
It is not easy to prove the stability of order-1 limit cycle of system (2) only with the previous lemma, so we set up an orthogonal coordinate
Without loss of generality, we assume that functions
To any point in that region, there exists a certain point in the closed orbit
x=ϕ(s),y=ψ(s), | (9) |
where
Then the rectangular coordinate
x=ϕ(s)−nψ′(s),y=ψ(s)+nϕ′(s), | (10) |
Following (2) and (10), we have
dnds=Qϕ′−Pψ′−n(Pϕ″+Qψ″)Pϕ′+Qψ′Δ=F(s,n). | (11) |
It is apparent that
dnds=Fn′(s,n)|n=0⋅n+o(n). | (12) |
Following (11), we can calculate
Fn′(s,n)|n=0=P20Qy0−P0Q0(Py0+Qx0)+Q20Px0(P20+Q20)32Δ=H(s), |
where
dnds=H(s)n, | (13) |
and its solution is
n=n0e∫T0H(s′)ds′,n0=n(0). | (14) |
Theorem 4.5. Assume
∫h0H(s)ds<0(>0). |
Theorem 4.6. Suppose the region closed by order-1 periodic solution
The proofs of Theorem 4.5 and Theorem 4.6 are similar with that in [27], and omitted here.
Then we can draw the corollary naturally.
Corollary 1. Suppose the area closed by order-1 limit cycle
In this section, we present and discuss a special example to check the theoretical results in section 3 and section 4.
The uncontrolled part of system (1) is numerically calculated with fourth-order Runge-Kutta of Matlab software package. In the following, we discuss the solution of system (1), considering the parameters
From Fig. (10), it is obvious that system (1) has an order-1 limit cycle with the parameters mentioned above. We can also find that the limit cycle forms soon after the trajectory initiate from the original point which means that the impulsive patching and updating of antivirus software is quite effective. During the first period of the transmission, the worm or the virus spreads freely, the number represents susceptible computers decreases rapidly and the number stands for the infectious ones increased sharply. The developing trend of
We would like to sincerely thank the reviewers for their careful reading and constructive opinions of the original manuscript. This work is supported by NSFC(No.11671346, No.61751317, No.11701026), the Twin Tower Excellent Teacher supporting program (BUCEA2016) and the Fundamental Research Funds for Beijing University of Civil Engineering and Architecture (X18225, X18080) for M. Zhang. M. Zhang would like to thank the China Scholarship Council for financial support of her overseas study(No.201808110071).
[1] | J. Kennedy, R. Eberhart, Particle swarm optimization, in Icnn95-international Conference on Neural Networks, 4 (1995), 1942–1948. https://doi.org/10.1109/ICNN.1995.488968 |
[2] |
S. M. 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
![]() |
[3] |
X. S. Yang, Firefly algorithm, stochastic test functions and design optimisation, Int. J. Bio-Inspired Comput., 2 (2010), 78–84. https://doi.org/10.1504/IJBIC.2010.032124 doi: 10.1504/IJBIC.2010.032124
![]() |
[4] |
S. M. 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
![]() |
[5] | R. Rajabioun, Cuckoo optimization algorithm, Appl. Soft Comput., 11 (2011), 5508–5518. https://doi.org/0.1016/j.asoc.2011.05.008 |
[6] |
D. E. Goldberg, J. H. Holland, Genetic algorithms and machine learning, Mach. Learn., 3 (2005), 95–99. https://doi.org/10.1023/A:1022602019183 doi: 10.1023/A:1022602019183
![]() |
[7] |
G. G. Wang, S. Deb, Z. H. Cui, Monarch butterfly optimization, Neural Comput. Appl., 31 (2019), 1995–2014. https://doi.org/10.1007/s00521-015-1923-y doi: 10.1007/s00521-015-1923-y
![]() |
[8] |
G. G. Wang, S. Deb, L. D. S. Coelho, Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems, Int. J. Bio-Inspired Comput., 12 (2018), 1–22. https://doi.org/10.1504/IJBIC.2015.10004283 doi: 10.1504/IJBIC.2015.10004283
![]() |
[9] | G. G. Wang, S. Deb, L. D. S. Coelho, Elephant herding optimization, in 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI), (2015), 1–5. https://doi.org/10.1109/ISCBI.2015.8 |
[10] |
G. G. Wang, Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems, Memetic Comput., 10 (2018), 151–164. https://doi.org/10.1007/s12293-016-0212-3 doi: 10.1007/s12293-016-0212-3
![]() |
[11] | R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, (1995), 39–43. https://doi.org/10.1109/MHS.1995.494215 |
[12] |
W. Li, G. G. Wang, A. H. Gandomi, A survey of learning-based intelligent optimization algorithms, Arch. Comput. Methods Eng., 28 (2021), 3781–3799. https://doi.org/10.1007/S11831-021-09562-1 doi: 10.1007/S11831-021-09562-1
![]() |
[13] |
Y. Feng, S. Deb, G. G. Wang, A. H. Gandomi, Monarch butterfly optimization: a comprehensive review, Exp. Syst. Appl., 168 (2021), 114418. https://doi.org/10.1016/j.eswa.2020.114418 doi: 10.1016/j.eswa.2020.114418
![]() |
[14] |
S. Zhou, Y. Han, L. Sha, S. Zhu, A multi-sample particle swarm optimization algorithm based on electric field force, Math. Biosci. Eng., 18 (2021), 7464–7489. https://doi.org/10.3934/mbe.2021369 doi: 10.3934/mbe.2021369
![]() |
[15] |
Y. Feng, G. G. Wang, S. Deb, M. Lu, X. J. Zhao, Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization, Neural Comput. Appl., 28 (2017), 1619–1634. https://doi.org/10.1007/s00521-015-2135-1 doi: 10.1007/s00521-015-2135-1
![]() |
[16] |
Y. Feng, G. G. Wang, J. Dong, L. Wang, Opposition-based learning monarch butterfly optimization with gaussian perturbation for large-scale 0-1 knapsack problem, Comput. Electr. Eng., 67 (2018), 454–468. https://doi.org/10.1016/j.compeleceng.2017.12.014 doi: 10.1016/j.compeleceng.2017.12.014
![]() |
[17] |
F. Liu, Y. Sun, G. Wang, T. Wu, An artificial bee colony algorithm based on dynamic penalty and lévy flight for constrained optimization problems, Arabian J. Sci. Eng., 43 (2018), 7189–7208. https://doi.org/10.1007/S13369-017-3049-2 doi: 10.1007/S13369-017-3049-2
![]() |
[18] |
L. Guo, G. G. Wang, A. H. Gandomi, A. H. Alavi, H. Duan, A new improved krill herd algorithm for global numerical optimization, Neurocomputing, 138 (2014), 392–402. https://doi.org/10.1016/j.neucom.2014.01.023 doi: 10.1016/j.neucom.2014.01.023
![]() |
[19] |
I. Hanafi, F. M. Cabrera, F. Dimane, J. T. Manzanares, Application of particle swarm optimization for optimizing the process parameters in turning of peek cf30 composites, Proc. Technol., 22 (2016), 195–202. https://doi.org/10.1016/J.PROTCY.2016.01.044 doi: 10.1016/J.PROTCY.2016.01.044
![]() |
[20] |
J. Lu, J. Zhang, J. Sheng, Enhanced multi-swarm cooperative particle swarm optimizer, Swarm Evol. Comput., 69 (2022), 100989. https://doi.org/10.1016/j.swevo.2021.100989 doi: 10.1016/j.swevo.2021.100989
![]() |
[21] |
H. Zhang, M. Yuan, Y. Liang, L. Qi, A novel particle swarm optimization based on prey-predator relationship, Appl. Soft Comput., 68 (2018), 202–218. https://doi.org/10.1016/j.asoc.2018.04.008 doi: 10.1016/j.asoc.2018.04.008
![]() |
[22] |
J. J. Liang, A. K. Qin, P. N. Suganthan, S. Baskar, Comprehensive learning particle swarm optimizer for global optimization of multimodal functions, IEEE Trans. Evol. Comput., 10 (2006), 281–295. https://doi.org/10.1109/TEVC.2005.857610 doi: 10.1109/TEVC.2005.857610
![]() |
[23] |
X. Xia, L. Gui, F. Yu, H. Wu, B. Wei, Y. Zhang, et al., Triple archives particle swarm optimization, IEEE Trans. Cyber., 50 (2020), 4862–4875. https://doi.org/10.1109/TCYB.2019.2943928 doi: 10.1109/TCYB.2019.2943928
![]() |
[24] |
N. Lynn, P. N. Suganthan, Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation, Swarm Evol. Comput., 24 (2015), 11–24. https://doi.org/10.1016/j.swevo.2015.05.002 doi: 10.1016/j.swevo.2015.05.002
![]() |
[25] |
X. Zhang, W. Sun, M. Xue, A. Lin, Probability-optimal leader comprehensive learning particle swarm optimization with bayesian iteration, Appl. Soft Comput., 103 (2021), 107132. https://doi.org/10.1016/j.asoc.2021.107132 doi: 10.1016/j.asoc.2021.107132
![]() |
[26] | Y. Shi, R. C. Eberhart, A modified particle swarm optimizer, in 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), (1998), 69–73. https://doi.org/10.1109/ICEC.1998.699146 |
[27] |
X. Xia, L. Gui, G. He, B. Wei, Y. Zhang, F. Yu, et al., An expanded particle swarm optimization based on multi-exemplar and forgetting ability, Inf. Sci., 508 (2020), 105–120. https://doi.org/10.1016/j.ins.2019.08.065 doi: 10.1016/j.ins.2019.08.065
![]() |
[28] |
G. G. Wang, A. H. Gandomi, X. S. Yang, A. H. Alavi, A novel improved accelerated particle swarm optimization algorithm for global numerical optimization, Eng. Comput., 2014 (2014). https://doi.org/10.1108/EC-10-2012-0232 doi: 10.1108/EC-10-2012-0232
![]() |
[29] |
S. Mirjalili, G. G. Wang, L. D. S. Coelho, Binary optimization using hybrid particle swarm optimization and gravitational search algorithm, Neural Comput. Appl., 25 (2014), 1423–1435. https://doi.org/10.1007/s00521-014-1629-6 doi: 10.1007/s00521-014-1629-6
![]() |
[30] |
O. Kahouli, H. Alsaif, Y. Bouteraa, N. B. Ali, M. Chaabene, Power system reconfiguration in distribution network for improving reliability using genetic algorithm and particle swarm optimization, Appl. Sci., 11 (2021), 3092. https://doi.org/10.3390/APP11073092 doi: 10.3390/APP11073092
![]() |
[31] |
A. Lin, W. Sun, H. Yu, G. Wu, H. Tang, Global genetic learning particle swarm optimization with diversity enhancement by ring topology, Swarm Evol. Comput., 44 (2019), 571–583. https://doi.org/10.1016/j.swevo.2018.07.002 doi: 10.1016/j.swevo.2018.07.002
![]() |
[32] |
E. Naderi, M. Pourakbari-Kasmaei, M. Lehtonen, Transmission expansion planning integrated with wind farms: a review, comparative study, and a novel profound search approach, Int. J. Electr. Power Energy Syst., 115 (2020), 05460. https://doi.org/10.1016/J.IJEPES.2019.105460 doi: 10.1016/J.IJEPES.2019.105460
![]() |
[33] |
R. Jamous, H. Alrahhal, M. El-Darieby, A new ann-particle swarm optimization with center of gravity (ann-psocog) prediction model for the stock market under the effect of covid-19, Sci. Prog., 2021 (2021), 6656150. https://doi.org/10.1155/2021/6656150 doi: 10.1155/2021/6656150
![]() |
[34] |
B. Mohammadi, Y. Guan, R. Moazenzadeh, M. J. S. Safari, Implementation of hybrid particle swarm optimization-differential evolution algorithms coupled with multi-layer perceptron for suspended sediment load estimation, Catena, 198 (2020), 105024. https://doi.org/10.1016/j.catena.2020.105024 doi: 10.1016/j.catena.2020.105024
![]() |
[35] | M. Clerc, The swarm and the queen: towards a deterministic and adaptive particle swarm optimization, in Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 3 (1999), 1951–1957. https://doi.org/10.1109/CEC.1999.785513 |
[36] |
M. Asada, Modeling early vocal development through infantaregiver interaction: a review, IEEE Trans. Cognit. Dev. Syst., 8 (2016), 128–138. https://doi.org/10.1109/TCDS.2016.2552493 doi: 10.1109/TCDS.2016.2552493
![]() |
[37] |
A. Baeck, K. Maes, C. V. Meel, H. P. O. de Beeck, The transfer of object learning after training with multiple exemplars, Front. Psychol., 7 (2016), 1386. https://doi.org/10.3389/fpsyg.2016.01386 doi: 10.3389/fpsyg.2016.01386
![]() |
[38] |
K. E. Twomey, S. Ranson, J. S. Horst, That's more like it: Multiple exemplars facilitate word learning, Infant Child Dev., 23 (2014), 105–122. https://doi.org/10.1002/ICD.1824 doi: 10.1002/ICD.1824
![]() |
[39] | X. S. Yang, S. Deb, Cuckoo search via lévy flights, in 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), (2009), 210–214. https://doi.org/10.1109/NABIC.2009.5393690 |
[40] |
O. Aoun, M. Sarhani, A. E. Afia, Particle swarm optimisation with population size and acceleration coefficients adaptation using hidden markov model state classification, Int. J. Metaheuristics, 7 (2018), 1–29. https://doi.org/10.1504/IJMHEUR.2018.10012905 doi: 10.1504/IJMHEUR.2018.10012905
![]() |
[41] |
A. T. Kiani, M. F. Nadeem, A. N. Ahmed, I. Khan, H. I. Alkhammash, I. A. Sajjad, et al., An improved particle swarm optimization with chaotic inertia weight and acceleration coefficients for optimal extraction of pv models parameters, Energies, 14 (2021), 2980. https://doi.org/10.3390/EN14112980 doi: 10.3390/EN14112980
![]() |
[42] |
Z. H. Zhan, J. Zhang, Y. Li, H. S. H. Chung, Adaptive particle swarm optimization, IEEE Trans. Syst. Man Cybern. B, 39 (2009), 1362–1381. https://doi.org/10.1109/TSMCB.2009.2015956 doi: 10.1109/TSMCB.2009.2015956
![]() |
[43] | J. J. Liang, P. N. Suganthan, Dynamic multi-swarm particle swarm optimizer, in Proceedings 2005 IEEE Swarm Intelligence Symposium, (2005), 124–129. https://doi.org/10.1109/SIS.2005.1501611 |
[44] |
G. Xu, Q. Cui, X. Shi, H. W. Ge, Z. H. Zhan, H. P. Lee, et al., Particle swarm optimization based on dimensional learning strategy, Swarm Evol. Comput., 45 (2019), 33–51. https://doi.org/10.1016/J.SWEVO.2018.12.009 doi: 10.1016/J.SWEVO.2018.12.009
![]() |
[45] |
K. Zhang, Q. Huang, Y. Zhang, Enhancing comprehensive learning particle swarm optimization with local optima topology, Inf. Sci., 471 (2019), 1–18. https://doi.org/10.1016/j.ins.2018.08.049 doi: 10.1016/j.ins.2018.08.049
![]() |
[46] | O.Olorunda, A. P. Engelbrecht, Measuring exploration/exploitation in particle swarms using swarm diversity, in 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), (2008), 1128–1134. https://doi.org/10.1109/CEC.2008.4630938 |
[47] |
M. L. Dukic, Z. S. Dobrosavljevic, A method of a spread-spectrum radar polyphase code design, IEEE J. Sel. Areas Commun., 8 (1990), 743–749. https://doi.org/10.1109/49.56381 doi: 10.1109/49.56381
![]() |
[48] |
S. Gil-Lopez, J. D. Ser, S. Salcedo-Sanz, Á. M. Pérez-Bellido, J. M. Cabero, J. A. Portilla-Figueras, A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem, Expert Syst. Appl., 39 (2012), 11089–11093. https://doi.org/10.1016/j.eswa.2012.03.063 doi: 10.1016/j.eswa.2012.03.063
![]() |
1. | Qingyi Zhu, Pingfan Xiang, Xuhang Luo, Chenquan Gan, Mamoun Alazab, Dynamical Behavior of Hybrid Propagation of Computer Viruses, 2022, 2022, 1939-0122, 1, 10.1155/2022/2576685 | |
2. | 秀秀 王, Impulsive State Feedback Control Model of Predator Population with Constant Release Rate in Polluted Water, 2022, 11, 2324-7991, 7302, 10.12677/AAM.2022.1110775 | |
3. | Tieying Wang, Microbial insecticide model and homoclinic bifurcation of impulsive control system, 2021, 14, 1793-5245, 2150043, 10.1142/S1793524521500431 | |
4. | Wenjie Li, Jinchen Ji, Lihong Huang, Global dynamics analysis of a water hyacinth fish ecological system under impulsive control, 2022, 359, 00160032, 10628, 10.1016/j.jfranklin.2022.09.030 | |
5. | 烁烁 王, Study on the Second Model of State Feedback Impulsive Model of Red Squirrel Protection, 2021, 10, 2324-7991, 3640, 10.12677/AAM.2021.1011385 | |
6. | Qingyi Zhu, Pingfan Xiang, Kefei Cheng, Chenquan Gan, Lu-Xing Yang, Hybrid Propagation and Control of Network Viruses on Scale-Free Networks, 2022, 1556-5068, 10.2139/ssrn.4012957 | |
7. | Qingyi Zhu, Pingfan Xiang, Kefei Cheng, Chenquan Gan, Lu-Xing Yang, Hybrid Propagation and Control of Network Viruses on Scale-Free Networks, 2023, 49, 1017-060X, 10.1007/s41980-023-00834-z |