ArticlePDF Available

Adjusting non-pharmaceutical interventions based on hospital bed capacity using a multi-operator differential evolution

Authors:

Abstract

Without vaccines and medicine, non-pharmaceutical interventions (NPIs) such as social distancing, have been the main strategy in controlling the spread of COVID-19. Strict social distancing policies may lead to heavy economic losses, while relaxed social distancing policies can threaten public health systems. We formulate optimization problems that minimize the stringency of NPIs during the prevaccination and vaccination phases and guarantee that cases requiring hospitalization will not exceed the number of available hospital beds. The approach utilizes an SEIQR model that separates mild from severe cases and includes a parameter µ that quantifies NPIs. Payoff constraints ensure that daily cases are decreasing at the end of the prevaccination phase and cases are minimal at the end of the vaccination phase. Using a penalty method, the constrained minimization is transformed into a non-convex, multi-modal unconstrained optimization problem. We solve this problem using the improved multi-operator differential evolution, which fared well when compared with other optimization algorithms. We apply the framework to determine optimal social distancing strategies in the Republic of Korea given different amounts and types of antiviral drugs. The model considers variants, booster shots, and waning of immunity. The optimal µ values show that fast administration of vaccines is as important as using highly effective vaccines. The initial number of infections and daily imported cases should be kept minimum especially if the bed capacity is low. In Korea, a gradual easing of NPIs without exceeding the bed capacity is possible if there are at least seven million antiviral drugs and the effectiveness of the drug in reducing severity is at least 86%. Model parameters can be adapted to a specific region or country, or other infectious diseases. The framework can be used as a decision support tool in planning economic policies, especially in countries with limited healthcare resources.
http://www.aimspress.com/journal/Math
AIMS Mathematics, 7(11): 19922–19953.
DOI: 10.3934/math.20221091
Received: 06 July 2022
Revised: 28 August 2022
Accepted: 01 September 2022
Published: 09 September 2022
Research article
Adjusting non-pharmaceutical interventions based on hospital bed capacity
using a multi-operator dierential evolution
Victoria May P. Mendoza1,2, Renier Mendoza1,2, Jongmin Lee1and Eunok Jung1,*
1Department of Mathematics, Konkuk University, Seoul, 05029, Republic of Korea
2Institute of Mathematics, University of the Philippines Diliman, Quezon City, 1101, Philippines
*Correspondence: Email: junge@konkuk.ac.kr
Abstract: Without vaccines and medicine, non-pharmaceutical interventions (NPIs) such as social
distancing, have been the main strategy in controlling the spread of COVID-19. Strict social distancing
policies may lead to heavy economic losses, while relaxed social distancing policies can threaten public
health systems. We formulate optimization problems that minimize the stringency of NPIs during
the prevaccination and vaccination phases and guarantee that cases requiring hospitalization will not
exceed the number of available hospital beds. The approach utilizes an SEIQR model that separates
mild from severe cases and includes a parameter µthat quantifies NPIs. Payoconstraints ensure
that daily cases are decreasing at the end of the prevaccination phase and cases are minimal at the
end of the vaccination phase. Using a penalty method, the constrained minimization is transformed
into a non-convex, multi-modal unconstrained optimization problem. We solve this problem using
the improved multi-operator dierential evolution, which fared well when compared with other
optimization algorithms. We apply the framework to determine optimal social distancing strategies
in the Republic of Korea given dierent amounts and types of antiviral drugs. The model considers
variants, booster shots, and waning of immunity. The optimal µvalues show that fast administration
of vaccines is as important as using highly eective vaccines. The initial number of infections and
daily imported cases should be kept minimum especially if the bed capacity is low. In Korea, a gradual
easing of NPIs without exceeding the bed capacity is possible if there are at least seven million antiviral
drugs and the eectiveness of the drug in reducing severity is at least 86%. Model parameters can be
adapted to a specific region or country, or other infectious diseases. The framework can be used as
a decision support tool in planning economic policies, especially in countries with limited healthcare
resources.
Keywords: COVID-19; social distancing; mathematical model; metaheuristic algorithm; improved
multi-operator dierential evolution; optimal control
Mathematics Subject Classification: 34A55, 34H05, 90C26, 92-10
19923
1. Introduction
In the early outbreaks of COVID-19, many countries have banned public gatherings, closed down
schools, restaurants, land, and sea borders, and forced people to stay at home in an attempt to curb
the spread of this disease [1–3]. Few countries such as the Republic of Korea and Singapore focused
their control measures on intensive contact tracing and testing [2,4]. Without vaccines and medicine,
controlling the spread of COVID-19 relied mainly on non-pharmaceutical interventions (NPIs). These
control measures were essential to public health but have caused an immense burden on the social and
economic aspects of life [5, 6].
During the early stages of COVID-19, most countries have monitored incidence cases and deaths
and relied on this information in crafting policies [2, 3]. The development of vaccines and oral
antiviral drugs greatly impacted public health by reducing the severity of infections [7]. The fast
rollout of vaccines, use of highly eective vaccines and medicine, and implementation of strict social
distancing policies are expected to greatly minimize infections [8–10]. However, the protection given
by pharmaceutical interventions alone did not guarantee the suppression of COVID-19 as variants of
the virus continued to emerge. During the highly-transmissible omicron wave, the focus of control
shifted to managing severe cases and minimizing deaths. The timing of lifting and intensity of easing
NPIs have been important policy questions during the course of the COVID-19 pandemic. To this
end, mathematical models that incorporate various aspects of COVID-19 and NPIs are proving to be
important decision support tools [11–14].
Motivated by the events of the COVID-19 pandemic, we aim to provide a framework for planning
social distancing policies based on the number of infections requiring hospitalization. The approach
utilizes a Susceptible-Exposed-Infected-Isolated-Recovered (SEIQR) model that distinguishes mild
from severe cases and includes a parameter that quantifies NPIs. The policy period is divided into two
phases: a prevaccination phase, where only NPIs are implemented, followed by a vaccination phase,
where vaccines are assumed to be available as additional control measures. We formulate optimization
problems that minimize the stringency of NPIs during the prevaccination and vaccination phases and
guarantee that cases requiring hospitalization will not exceed the number of available hospital beds. A
measure of cost-eectiveness is presented as a basis for the choice of the frequency of policy change.
To solve the optimization problems, we transform the constrained problems into unconstrained ones
and implement a metaheuristic algorithm called the improved multi-operator dierential evolution
(IMODE) [15]. We compare IMODE with 20 other global optimization algorithms to demonstrate
its eectiveness.
The presented framework can address key policy issues on the timing and level of adjusting NPIs.
It is most relevant during an early epidemic phase, wherein pharmaceutical interventions are not yet
available but managing the number of infections is a top priority. The timing of easing of NPIs is crucial
at the start of vaccination in order not to compromise the benefits of vaccines [16–18]. Since a time-
dependent epidemiological model is embedded in the method, data can be readily updated to fit the
country or region where the framework is applied. As an application, we forecast the optimal intensity
and timing of social distancing policies in Korea. An extended, more elaborate epidemiological model
is adopted that includes variants, vaccination with primary and booster shots, waning of immunity,
and administration of oral antiviral drugs [19]. Optimal solutions during the vaccination phase are
determined under dierent scenarios.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19924
2. Materials and methods
In this section, we present the epidemiological models utilized in the optimization problems. We
formulate the optimization framework and transform the constrained into unconstrained problems via
the penalty method. We also present a measure of the cost-eectiveness of the strategies and discuss
IMODE in more detail.
2.1. Epidemiological model
The mathematical model, illustrated in Figure 1, follows an SEIQRD structure. Susceptible class
(S) can be eectively (V) or ineectively (U) vaccinated with vaccine eectiveness e. The subscript
vdenotes vaccination and θis the number of people vaccinated per day. After an average of 1
days, individuals in Vdevelop full immunity to the disease (P). Without full immunity, susceptible
individuals (S,U,V) can become exposed (E) with a force of infection λ(t), infectious (I) after 1
days, confirmed and isolated in 1 days on average. Infection can be classified as mild (Qm) or severe
(Qs). The parameter prepresents the severe rate or the proportion of infected individuals that becomes
severe. Isolated individuals can recover (R) at a rate γmor γs. A proportion fof severe cases is assumed
to die (D). We assume that the severity of symptoms is reduced by a factor of 1 esfor the vaccinated
classes. The number of daily imported cases (ξ) is depicted by the red dashed arrow going into E.
Figure 1. The SEIQRD model used in the optimization problem. Vaccinated compartments
are denoted by the subscript v. The compartments V,U,and Prepresent the eectively
vaccinated, ineectively vaccinated, and fully protected groups, respectively, while the
isolated mild and severe groups are denoted Qmand Qs, respectively. The other subclasses
are susceptible (S), exposed (E), infectious (I), recovered (R), and death (D).
The non-infected compartments are described by the following dierential equations
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19925
dS
dt =λ(t)Sθ,
dU
dt =(1 e)θλ(t)U,
dV
dt =eθλ(t)VωV,
dP
dt =ωV.
(2.1)
The infected, recovered, and death compartments are given by
dE
dt =λ(t)(S+V)κE+ξ,
dI
dt =κEαI,
dQm
dt =(1 p)αIγmQm,
dQs
dt =pαIγsQs,
dR
dt =γmQm+(1 f)γsQs,
dD
dt =fγsQs,
dEv
dt =λ(t)UκEv,
dIv
dt =κEvαIv,
dQm
v
dt =(1 (1 es)p)αIvγmQm
v,
dQs
v
dt =(1 es)pαIvγsQs
v,
dRv
dt =γmQm
v+(1 f)γsQs
v,
dDv
dt =fγsQs
v.
(2.2)
The force of infection λ(t) is defined as
λ(t)=(1 µ(t))R0αI+Iv
N,(2.3)
where N=S+V+U+P+E+Ev+I+Iv+R+Rv,µ(t)(0,1) is a time-dependent parameter representing
the intensity of NPIs, and R0is the basic reproductive number. A µvalue close to 1 translates to a high
reduction in transmission, which is assumed to be a result of strict implementation of NPIs. On the
other hand, a µvalue close to 0 implies more relaxed NPIs. The model parameters are summarized in
Table 1.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19926
Table 1. Description and values of the epidemiological model parameters.
Parameter Description (unit) Value Ref.
R0Basic reproductive number 3.17 [20–22]
1 Mean period to develop full immunity (day) 40 [19, 23, 24]
1 Mean latent period (day) 4 [25, 26]
pProportion of infections that becomes severe 2.28% [27]
fMean fatality rate in severe cases 0.439 [19, 27]
eVaccine eectiveness against infection 0.91 (high) [28]
0.468 (low) [29]
esVaccine eectiveness against severe disease 0.96 (high) [30]
0.555 (low) [29]
1mMean duration of hospitalization for mild cases (day) 11.7 [31]
1sMean duration of hospitalization for severe cases (day) 14 [19, 32]
1 Mean infectious period (day) 4 [25, 33]
The number of administered vaccines per day (θ), imported cases (ξ), periods from confirmation to
isolation (1), and hospitalization (γm, γs) are specific to a country’s policies and resources. In the
prevaccination phase, we simply set θto zero. If ξis zero, then screening measures are assumed to
detect all non-locally transmitted cases. Other parameters in Table 1 can be obtained from the literature.
Because vaccines have dierent eectiveness, we considered low and high values for eand es. The
initial susceptible, exposed E0, and infectious I0population are set to 999945, 50, and 5, respectively.
The rest of the state variables are initially set to zero. The initial total population N0is 1000000.
2.2. Formulation of the optimization problem
The stringency of NPIs is incorporated into the model as a factor in (2.3) that reduces transmission
by 1 µ(t). In the optimization problem, we aim to determine the least value of µ(t) such that the
number of severe patients Qs(t)+Qs
v(t) throughout the policy period does not exceed the maximum
severe bed capacity Hmax. Payoconstraints to ensure that daily cases are decreasing at the end of the
prevaccination period and there are minimal cases at the end of the vaccination period are incorporated.
A gradual easing of policies during the vaccination phase is also added as a constraint.
Suppose that the prevaccination phase is divided into n1equal periods P1(t),P2(t), . . . , Pn1(t) and
the vaccination phase into n2equal periods Pn1+1(t),Pn1+2(t), . . . , Pn1+n2(t). We assume that µ(t) is a
piecewise constant function over disjoint periods given by
µ(t)=
n1+n2
X
i=1
µiχi(t),
where χi(t) is the characteristic function of Pi(t),i=1,2,...,n1+n2. Note that each µiassumes a
constant value between 0.05 and 0.95. The goal in the prevaccination phase is to
min
[0,1]n1
1
n1
n1
X
i=1
µi(2.4)
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19927
such that
max
tQs(t;µ)<Hmax.(2.5)
The objective in (2.4) means that we want to find the set of µi(i=1,...,n1) that gives the minimum
average value. Here, Qs(t;µ) is solved from (2.1) to (2.3). Constraint (2.5) ensures that the number
of severe cases at any time during the prevaccination period does not exceed the threshold value Hmax.
Furthermore, we include a payoconstraint which guarantees that the number of cases at the end of
the prevaccination phase is decreasing. That is,
Rt(Pend
n1)<ρ<1,(2.6)
where Pend
n1is the last time point on period Pn1,ρis a constant less than 1, and Rt(t) is the eective
reproduction number given by
Rt(t)=R0(1 µ(t))S+U+V
N.
Hence, the optimization problem for the prevaccination phase consists of (2.1) to (2.6).
For the vaccination phase, we consider the following objective function,
min
[0,1]n2
1
n2
n1+n2
X
i=n1+1
µi(2.7)
such that
max
tQs(t;µ)+Qs
v(t;µ)<Hmax (2.8)
and
Qs(Pend
n2)+Qs
v(Pend
n2)<˜
H,(2.9)
where Pend
n2denotes the last time point on period Pn2. The payoconstraint (2.9) ensures that the
number of severe patients by the end of the vaccination phase is less than a constant ˜
H, with ˜
H<Hmax.
To have a gradual easing of policies during the vaccination phase, we further impose that
µn1µn1+1µn1+2. . . µn1+n2.(2.10)
This means that successive values of µiin the vaccination phase are decreasing. The full optimization
problem for the vaccination phase is given by (2.7)–(2.10) and the model (2.1)–(2.3).
To solve the constrained optimization problems, we use a penalty method and convert them into
unconstrained problems. For the prevaccination phase, we minimize over [0,1]n1the objective function
1
n1
n1
X
i=1
µi+η1max max
tQs(t;µ)Hmax,0
| {z }
constraint (2.5)
+η2max Rt(Pend
n1)ρ, 0
| {z }
constraint (2.6)
,(2.11)
where the penalty terms η1, η2>> 1. For the vaccination phase, the unconstrained problem is to
minimize
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19928
1
n2
n1+n2
X
i=n1+1
µi+η1max max
tQs(t;µ)+Qs
v(t;µ)Hmax,0
| {z }
constraint (2.8)
+η3max Qs(Pend
n2)+Qs
v(Pend
n2)˜
H,0
| {z }
constraint (2.9)
+
η4max
max
µn1+1µn1
.
.
.
µn1+n2µn1+n21
,0
| {z }
constraint (2.10)
(2.12)
over [0,1]n2, where η3, η4>> 1. Note that the penalty terms chosen are exact [34], which means that
the solution of the unconstrained problem is the same as the constrained one.
The lengths of the prevaccination and vaccination periods and frequency of policy change are
decided by the user. In the simulations, we assume that the entire policy period is 18 months (540
days), consisting of 9-month prevaccination and 9-month vaccination phases. In the prevaccination
phase, we vary the frequency of policy change, that is, we set n1=1 (uniform), n1=3 (quarterly),
n1=9 (monthly), n1=18 (biweekly), or n1=36 (weekly). We assume that the severe bed capacity
Hmax is 100, which is 0.01% of the initial total population N0, and the number of severe cases by
the end of the vaccination phase ˜
His 1% of Hmax. Moreover, vaccination is assumed to proceed at
a constant rate of θ=0.8N0/30σ, where σis the number of months it takes to vaccinate 80% of
N0. Dierent speeds of vaccination is considered: σ=6,9,12,or 24 months. To investigate the
eect of importation, we also perform simulations on varying ξ. Because the constraints have dierent
magnitudes relative to the objective functions, we chose appropriate weight constants ηi. The parameter
settings used in the simulations are summarized in Table 2. To solve (2.11) and (2.12), we implement
the metaheuristic algorithm IMODE.
Table 2. Description and values of the parameters in the optimization problem. The
parameter N0denotes the initial total population which is set to 1000000.
Parameter Description (unit) Value
Hmax Severe bed capacity 0.0001N0
˜
HThreshold on the number of severe cases by 0.01Hmax
the end of vaccination phase
θNumber of vaccines administered per day (1/day) 0.8N0
30σ,σ {6,9,12,24}
ξNumber of imported cases per day (1/day) 0,10,15,20
ηi,i=1,2,3,4 Penalty weight constants 106,103,103,1010
2.3. Mathematical model of COVID-19 in Korea
As variants, booster vaccines, antiviral drugs, and waning of immunity have emerged as critical
drivers of infection, a model that captures these factors is considered. We adopt the model in [19],
which is an extension of the previously presented model to describe COVID-19 transmission in Korea.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19929
The model illustrated in Figure 2 is divided into two parts: infection flow (top) and vaccination
flow (bottom). In the vaccination flow, Sdenotes the susceptible group with no vaccine- or infection-
induced immunity. The number of people administered with primary and booster vaccines per day
are denoted by θvand θb, respectively. The protected class for the pre-delta and delta variants is P2,
and against all variants is P3. Note that e1is the primary vaccine eectiveness and e
3=e3/e1is
a conditional probability depending on the vaccine eectiveness against the dierent variants. We
assume that vaccine-induced immunity of the protected groups wanes after 1vdays on average.
Those in the waned group Wwill go to Vbafter getting a booster shot three or four months after
completing the primary vaccines. After an average of 1bdays, those in Vbmove back to the protected
groups depending on the probabilities e
b,j, which are computed similarly as before.
Figure 2. Flowchart of the COVID-19 model considering variants, waning of immunity,
booster vaccines, and antiviral drugs.
In Figure 2, the variable Xdenotes the class where the infection was from and it can be sus (from
Sor V), U(from U), or P(from P1,W, or Vb). The subscript jdenotes the variant and it can be 1
(infected by pre-delta), 2 (infected by delta), or 3 (infected by omicron). The reason for dividing the
infectious group is to distinguish the dierent characteristics of infection, e.g. eect of vaccines for
those infected, and the transmissibility and latent period of the variants. The E,I,Qm,Qs,R, and D
classes are the same as in the simple model, each having nine variations depending on the subscripts.
The probability of getting severe symptoms is assumed to be reduced by a factor (1 es
X,j)(1 epill)
due to the antiviral drugs. To include the waning of natural immunity depicted by the green arrow in
Figure 2, individuals in Rare assumed to have immunity only for 1X,ndays on average. Note that the
natural waning rate and vaccine eectiveness against severe disease are dierent for sus,V,and P. The
system of dierential equations describing the model is in Appendix A.
Before applying the optimization framework using model (A.1), we first establish the baseline value
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19930
for µin Korea by fitting the model to the cumulative confirmed cases data from February 26, 2021,
when vaccination began, until February 3, 2022, when the testing method was changed. We then
forecast the number of infections given a fixed µvalue and dierent amounts of antiviral drugs and
compare the results to the forecasts using the optimal µvalues.
The estimation period covered four distinct social distancing phases in Korea: Social Distancing
level 2 (SD2) from February 26 until July 11, 2021, Social Distancing level 4 (SD4) from July 12
until October 31, 2021, Gradual Recovery (GR) from November 1 until December 17, 2021, and
Suspended Gradual Recovery (SGR) from December 18, 2021 to February 3, 2022. These phases do
not directly reflect the stringency of NPIs. For example, the number of people in a private gathering,
which is an important policy in controlling transmission, changed multiple times during SGR. We
divide the estimation period every two weeks and determine µon each interval by fitting the model
to the cumulative confirmed data (Y(t)) using IMODE. That is, we look for the best-fitted µvalue by
minimizing the objective functional
N
X
t=1
Y(t)
3
X
j=1αjIsus,j(t)+αjIU,j(t)+αjIP,j(t)
2
.(2.13)
As of April 29, 2022, Korea had used 2504630 drugs (Paxlovid: 2328610, Lagevrio: 176020) and
has a remaining supply of 5775670 drugs (Paxlovid: 4942710, Lagevrio: 832960) [35]. This means
that the proportion of Paxlovid among the used antiviral drugs is 93%, among the reserve antiviral
drugs is 86%, and the total supply is 88%. We investigate future scenarios by first considering a fixed
µ=0.1, 0.3, 0.5, 0.7 and setting the number of antiviral drugs to five or seven million. Then we apply
the optimization framework to determine the optimal µwith varying amounts of antiviral drugs (five
million, six million, and seven million) and proportions of Paxlovid φ(80%, 84%, 88%, 92%, 96%,
and 100%) among the antiviral drugs used. We assume that the reduction in severity by Paxlovid and
Lagevrio are 89% [36] and 30% [37], respectively. Simulation for the forecast starts on February 3,
2022, which is the final time of estimation, and ends on December 31, 2022. The threshold value on
the number of severe cases at the end of the simulation period ˜
His set to 500.
2.4. Measure of cost-eectiveness
To determine the frequency of policy change, we adopt a measure of cost-eectiveness based on the
cost of implementation of NPIs and the number of cases averted by the intervention strategy [38]. The
cost-eectiveness ratio (CER) is the basis for choosing n1,n2=9 (monthly policy change) and is used
to compare the optimal strategies under dierent amounts of antiviral drugs in Korea.
The total cost of implementation of NPIs is given by C · 1
n1
n1
P
i=1
ui=C · µave, where Cis the average
cost of implementation of NPIs for the whole population for n1periods and µave is the average of all
the µiin the prevaccination phase. The CER is computed as
CER =Cµave
Ak
,(2.14)
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19931
where k=1 or 2,
A1=Ztf
t0
pαI(t;µ=0) dt Ztf
t0
pαI(t;µ=µ?)dt
Ztf
t0
pαI(t;µ=0) dt
,
A2=
Ztf
t0X
X,j
(1 es
X,j)αjIX(t;µ=0; ϕ=0) dt A?
2
Ztf
t0X
X,j
(1 es
X,j)αjIX(t;µ=0; ϕ=0) dt
,
and
A?
2=Ztf
t0X
X,j
(1 es
X,j)(1 epill)αjIX(t;µ=µ?, ϕ =ϕ?)dt.
The number of averted severe cases Akis computed as the relative dierence between the number of
severe cases when there are no NPIs and when there are NPIs with intensity µ?. In A2,ϕdenotes
the number of antiviral drugs and ϕ?can be five, six, or seven million. We use A2in comparing the
optimal strategies in Korea depending on the supply of antiviral drugs (Figure 2 model). Meanwhile,
A1is used in comparing the strategies resulting from dierent frequencies of policy change (Figure 1
model). For simplicity of calculations, we set C=1 since it only appears as a factor in the CER in
(2.14) and will not aect the ranking of the dierent policies.
2.5. Improved multi-operator dierential evolution
In Figure 3, we observe a non-convex and multi-modal surface plot of the objective function (2.11)
with n1=2. Since the surface has many local minima near the global minimum, a local optimizer is
not suitable for this problem. Evolutionary algorithms have become popular because of their capability
of obtaining global minimum and ease of use. They only use function evaluations and do not require
the derivative of the function. Applications of these algorithms have been explored in many areas of
science and engineering [39–45].
Several algorithms are continuously being developed that can obtain the global minimum with
high accuracy and low computational time [46–51]. In 2020, the Competition on Single Objective
Bound Constrained Numerical Optimization was held and the Improved multi-operator dierential
evolution (IMODE) [15] ranked first in this competition. Hence, we use IMODE in solving the
minimization problems (2.11) and (2.12). Since evolutionary algorithms have been shown to be
eective in estimating parameters of biological systems [52–56], we also use IMODE in estimating
the parameters for Korea using (A.1) by minimizing (2.13).
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19932
Figure 3. Surface plot in log-scale of the objective function in (2.11) for n1=2. The
objective function is non-convex, multi-modal, and has many local minima near the global
minimum.
The inputs of IMODE are the objective function, dimension, and bound constraints. At the
beginning of the IMODE process, an initial population from the search space is generated. The
objective function using each population member is calculated and then sorted in ascending order.
IMODE divides the population into several sub-populations, which are all evolved using three mutation
operators. To preserve population diversity, archiving is done. The three operators are given as follows:
Operator 1 : vi,j=xi,j+Fi×(xφ, jxi,j+xr1,jxr2,j),
Operator 2 : vi,j=xi,j+Fi×(xφ, jxi,j+xr1,jxr3,j),
Operator 3 : vi,j=Fi×(xr1,j+(xφ, jxr3,j)),
where r1,r2,r3,iare randomly generated integers, ~
xr1,~
xr3are randomly chosen from the population,
~
xφis selected from the top 10% members of the population, and ~
xr2is randomly selected from the
union of the archive and the population. The scaling factor Fiis assigned based on success-historical
memory [57]. Operators 1 and 2 move the member in the current population to the best points
with and without archiving, respectively [58]. Operator 3 is a weighted random-member-to-best
operator [15]. The size of each sub-population (N Po p,op =1,2,3) is iteratively adjusted based on
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19933
the diversity of the sub-populations and the quality of the solutions. The size of the population per
generation (NPG) is also reduced linearly [57]. After the mutation operators are carried out, crossover
is implemented randomly to create a new set of solutions. To speed up the convergence of IMODE, a
local search is implemented when the number of function evaluations exceeds 85% of the maximum
function evaluations (MAXFE S ). Figure 4 shows the flowchart of the IMODE algorithm. For a detailed
discussion of the IMODE, we refer the readers to [15].
Begin
Input:
objective function
f, dimension
D, search space
bounds Xmin,Xmax
Set G=1, ls =0.1,
maximum function
evaluations
MAXFES, initial
population
size NPG
Evaluate
f(X) and sort
GG+1
FES MAXFES ?
Update NPGand
assign the number
of solutions NPop
to each operator
Operator 2:
current-to-φbest
without archive
Operator 1:
current-to-φbest
with archive
Operator 3:
weighted-
rand-to-φbest
Generate the
new population
based on the
operators and
update the archive
Calculate
NPop based on
solutions’ quality
and diversity
Sort new
population
FES >
0.85 MAXFES
and rand <ls?
Local search from
the best point in
current population
Did the local
search improve
the solution?
Update the
best solution
ls 0.1
ls 0.01
Output:
best solution
End
Yes
Yes
Yes
No
No
No
Figure 4. Flowchart of IMODE algorithm.
We compare IMODE to 20 other global optimization techniques in Appendix B by solving (2.11)
for n1=3. The best, worst, mean, median, and standard deviation of the cost function values obtained
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19934
from the 20 independent runs of each algorithm are computed. The hyperparameters of the algorithms
are set to their default values except for the maximum function evaluations (MAXFES ), which is set
to 10000. If the stopping criterion of the algorithm is based on the number of iterations, we fix the
population (or swarm) size (NP) to the default value and set the maximum number of iterations to
dMAXFE S /N Pe. For (2.11), (2.12), and (2.13), we use IMODE and set MAXF ES to 20000 times the
dimension of the problem. The other hyperparameters are fixed to their default values.
3. Results
3.1. Comparative analysis of performance of IMODE with other metaheuristic algorithms
Appendix B summarizes the results using various metaheuristic algorithms. The top five with the
least cost function values for each metric are written in boldface. Notably, IMODE ranked first in the
mean and median. Eight other algorithms, RACS [59], LSHADE-cnEpSin [60], EBOwithCMAR [61],
LSHADE-SPACMA [62], WFS [63], ABC [64], GBO [65], and AMO [66], have obtained 100%
feasibility rate and have metric scores of less than 1. These algorithms may also perform well in solving
the optimization problems given enough function evaluations or tuning of some hyperparameters.
3.2. Optimal solutions and cost-eectiveness analysis during the prevaccination phase
Figure 5 shows the results of the optimization problem (2.11) during the prevaccination phase for
dierent frequencies of policy change. Here we considered uniform (n1=1), quarterly (n1=3),
monthly (n1=9), biweekly (n1=18), or weekly (n1=36) policy changes in a span of nine months.
The black curves are the plots of the severe patients Qs(t) and the colored lines are the optimal values
of µper period.
In the uniform policy, the optimal value of µthat should be maintained throughout the
prevaccination phase is 0.630. The number of severe patients grew exponentially, almost reaching
Hmax =100 by the end of this phase. Having two constraints on a one-dimensional optimization
problem may result in an infeasible solution. For this reason, although the severe patients did not
exceed Hmax, the payoconstraint, which ensures that incidence cases are decreasing by the end of the
period, is not satisfied.
If the policy is changed every three months, the resulting optimal values of µon the three
consecutive periods are 0.873, 0.214, and 0.708. If the policy is changed monthly, the optimal values of
µon the consecutive months are 0.363, 0.812, 0.355, 0.944, 0.778, 0.917, 0.207, 0.085, and 0.787. The
optimal solutions for the biweekly and weekly policies are illustrated in Figure 5. The average values
of µand the corresponding CER for the dierent policies are calculated using (2.14). The resulting
CER are 0.016, 0.017, 0.012, 0.014, and 0.031 and are shown at the bottom right panel in Figure 5. In
the succeeding simulations, we set n1,n2=9, which translates to a monthly policy change.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19935
Figure 5. Severe patients, optimal µvalues, and cost-eectiveness ratio (CER) for dierent
frequencies of policy change. The policy changes once (uniform) if n1=1, quarterly if
n1=3, monthly if n1=9, biweekly if n1=18, or weekly if n1=36. The black curves are
the severe patients Qs(t), while the colored lines correspond to the optimal values of µ. The
bottom right panel shows the CER for the dierent policies.
3.3. Optimal policy strategies during the vaccination phase
Figure 6 shows the optimal solutions and number of severe patients (Qs(t)+Qs
v(t)) considering high
(solid) or low (dashed) vaccine eectiveness (eand es) and speeds of vaccination depending on the
value of σ.
If vaccination proceeds at a speed equivalent to vaccinating 80% of the initial total population in
six months (red solid) using a highly eective vaccine, the optimal strategy is to keep the value of µ
at around 0.785 from the start of the vaccination phase until day 359, when the first small noticeable
reduction in µto 0.733 is observed. This value of µis reduced further to 0.05 on day 390. If the speed
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19936
of vaccination is slowed down and vaccinating 80% of the initial total population is achieved in 9
(black solid), 12 (blue solid), or 24 months (green solid), the first observable easing of NPIs is delayed
to day 419, 449, and 479, respectively. Despite the delay, the corresponding reduction in the value of
µis greater. The value of µdecreased to 0.530 (black solid), 0.303 (blue solid), or 0.146 (green solid).
In all scenarios, the number of severe patients by day 540 is around ˜
H=1. Notably, a small peak in
severe patients is observed on day 480 when the speed of vaccination is the fastest (red solid).
Figure 6. Optimal strategies considering dierent values for vaccine eectiveness and speed
of vaccination. The optimal values of µper month for highly (solid) and low (dashed)
eective vaccines are shown on the top panel, while the corresponding number of severe
patients is shown on the bottom panel. The red, black, blue, and green curves correspond to
vaccinating 80% of the initial total population in 6, 9, 12, and 24 months, respectively.
When a low eective vaccine is used, the first significant reductions in NPIs are further delayed.
From around µ=0.785 at the start of the vaccination phase, the value of µnoticeably reduced to 0.145
(red dashed) or 0.687 (black dashed) on day 450. Meanwhile, if the speed of vaccination is slower,
the first noticeable reduction in µis on day 480 to 0.075 (blue dashed) or 0.403 (green dashed). In all
cases, the number of severe patients declined.
3.4. Eects of importation and initial number of infection on NPIs
On the left panel in Figure 7, we set the severe bed capacity Hmax to 50, 100, 150, and 200, and
vary the initial number of infected individuals I0. We assume that the daily imported cases ξis zero
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19937
and E0=10 ·I0. For simplicity, we assume that there is a uniform policy (n1=1) throughout the
prevaccination phase. Results show that for Hmax =150 or 200, the optimal values of µrange from
0.61 to 0.69 as the initial number of infections varies from 0 to 500. If Hmax =100, the optimal values
of µcan climb to 0.7 or higher if I0is at least 350. If Hmax =50 and the initial number of infections is
at least 420, the maximum value for µis reached.
Figure 7. Optimal values of µconsidering imported cases, initial number of infections, and
severe bed capacity. The left panel shows the optimal value of µfor varying initial number
of infectious individuals I0and Hmax, while the right panel shows the optimal value of µfor
varying severe bed capacity Hmax and daily imported cases ξ.
On the right panel in Figure 7, we fix ξto 0, 5, 10, or 20, and vary Hmax . If Hmax is only 0.001%
of the total population, then the optimal values of µare 0.818, 0.750, 0.714, and 0.657 if ξ=20,10,5,
or 0, respectively. Meanwhile, if Hmax is increased to 0.025% of the total population, then the optimal
values of µrange from 0.689 to 0.704 as ξvaries from 0 to 20. As Hmax goes to 0.1% of the total
population, all four cases converge to an optimal µvalue of about 0.6.
3.5. Application of the framework using COVID-19 data of Korea
The estimation results for µfrom February 26, 2021, when vaccination was begun, until February 3,
2022, when the testing method changed are shown in Figure 8 and summarized in Table 3. The lowest
µvalue was 0.590 during GR, and the highest value was 0.795 during SD4. Considering the average
values in each phase, GR (0.623) was the most relaxed, followed by SD2 (0.665), SGR (0.682), and
SD4 (0.744). If we compare the length of time for the variants to reach 90% of the infections, delta
took 16 weeks while omicron took 10 weeks. In the final two weeks of the estimation period (January
19 to February 3, 2022), daily cases exceeded 30000 and µwas estimated at 0.653.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19938
Figure 8. Fitting results. Model simulation (black curve) and data points (circles) for the
daily (top panel) and cumulative (middle panel) cases. The bottom panel shows the fitted
values of µ(t) (blue lines) and the proportion of delta (green) and omicron (brown) variants.
Table 3. Estimated µ(t) values on each SD phase from February 26, 2021 to February 3,
2022.
Period SD Policy Average µ(t) Range of µ(t)
Feb 26 to Jul 11, 2021 SD2 (Level 2) 0.665 (0.596,0.737)
Jul 12 to Oct 31, 2021 SD4 (Level 4) 0.744 (0.653,0.795)
Nov 1 to Dec 18, 2021 GR (Gradual Recovery) 0.623 (0.590,0.653)
Dec 19, 2021 to Feb 3, 2022 SGR (Suspended GR) 0.682 (0.653,0.791)
Figure 9 shows the forecasts for the daily confirmed cases and severe patients for dierent values
of µand amounts of antiviral drugs from February 3 to December 31, 2022. In this simulation, the
amount of antiviral drugs is set to seven million (solid) or five million (dashed), and µis kept constant
until the end of the year. The horizontal line on the right panel depicts the severe bed capacity on
February 3, 2022 equal to 2825. Note that the drugs only aect the severe patients and not the daily
confirmed cases since the drugs are assumed to reduce the severity of infections. If µis fixed at 0.10 or
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19939
0.30, the number of severe patients surpasses the threshold. If the amount of antiviral drugs is limited
to five million, a surge in severe infections starting from around July 2022 may occur if µ=0.10,0.30,
or 0.50. Moreover, if µ=0.10 and with five million antiviral drugs, the number of severe patients may
once more exceed the threshold. In the next simulations, we apply the framework and investigate when
and by how much should NPIs be eased given dierent amounts of antiviral drugs.
Figure 9. Daily cases and severe patients for dierent amounts of antiviral drugs and levels
of NPIs. Red, black, blue, and green curves correspond to the constant values µ=0.1,
µ=0.3, µ=0.5, and µ=0.7, respectively. The supply of antiviral drugs is set to seven
million (solid) or five million (dash-dot).
Because Korea is in the vaccination phase, the optimal µis solved by minimizing (2.12), where the
number of severe patients is obtained by solving system (A.1). We set the upper bound for µto 0.653,
which was the last estimated value of µ, and set dierent amounts of antiviral drugs (five, six, or seven
million). Figure 10 shows that if the amount of drugs is five million (red), the optimal values of µare
around 0.6 until July 2022, then around 0.48 until the end of the year. A rise in severe patients may
occur towards the last quarter of the year when the supplies are all used up. Meanwhile, if the amount
of drugs is six million (blue), the optimal values of µrange from 0.487 to 0.438 until around October
2022 before it is reduced to 0.365. If the supply of antiviral drugs is seven million (green), the optimal
values of µare 0.534 at the beginning, eased to 0.318 from March 2022, then reduced significantly to
0.05 from April 2022. At the end of the forecast period, the cumulative severe cases are 18494, 11152,
and 13233 for the five, six, and seven million supply of antiviral drugs, respectively. The corresponding
CER values are 0.652, 0.493, and 0.124.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19940
Figure 10. Forecast results using the optimal values of µgiven dierent amounts of antiviral
drugs. Panels on the left show the number of severe patients and optimal values of µfrom
February 3 to December 31, 2022, if the supply of antiviral drugs is five million (red), six
million (blue), or seven million (green). The bar plots show the cumulative severe cases by
the end of the forecast period and the corresponding cost-eectiveness ratio (CER) for ve,
six, or seven million antiviral drugs.
Figure 11 shows the optimal policy plans and the resulting number of severe and cumulative severe
patients from February 3 until December 31, 2022, assuming dierent proportions φof administered
antiviral drug Paxlovid. Since the eectiveness of Paxlovid (89%) is assumed to be much higher than
Lagevrio (30%), the net eectiveness of using both antiviral drugs would vary depending on how much
of each drug is administered. For example, φ=0.8 means out of all the administered antiviral drugs,
80% is Paxlovid and 20% is Lagevrio. This results in a net eectiveness of 77%. In the forecast,
the optimal values of µon the first period, if φ=1 (green) or φ=0.96 (teal), are 0.534 or 0.617,
respectively. On the other hand, if φ=0.92,0.88,0.84 and 0.8, the optimal values of µare 0.674,
0.706, 0.728, and 0.743, respectively, which are higher than the estimated value of µ=0.653 before
February 3, 2022. At the end of the forecast period, the optimal value of µreached the minimum (0.05)
in all scenarios and the cumulative severe cases are 23861, 21815, 20100, 17922, 15656, and 13231
for φ=0.8,0.84,0.88,0.92,0.96,and 1, respectively. The corresponding CER values are 0.290, 0.272,
213, 0.181, 0.166, and 0.124.
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19941
Figure 11. Forecast results using the optimal values of µgiven dierent proportions of the
antiviral drugs. Panels on the left show the number of severe patients and optimal values of
µfrom February 3 to December 31, 2022 if the proportion of Paxlovid φused among the
antiviral drugs is 80% (red), 84% (purple), 88% (black), 92% (blue), 96% (teal), or 100%
(green). The bar plots show the cumulative severe cases by the end of the forecast period and
the corresponding cost-eectiveness ratio (CER) for dierent values of φ.
4. Discussion
In Figure 5, the oscillating values of µ, which results in the shifts in the number of severe patients,
are observed on the quarterly, monthly, biweekly, and weekly policy changes. In the quarterly
policy change (n1=3), relaxation of NPIs is suggested to be implemented from months 3 to 6.
Correspondingly, we observe a very small number of severe cases until towards the end of the sixth
month. Under this strategy, NPIs should be intensified in the last period as the number of severe cases
increased and peaked at almost the capacity Hmax before it declined. As the frequency of policy change
is increased, there are more frequent adjustments in the intensity of NPIs, depicted by the jumps in the
values of µ. Consequently, more peaks in the number of severe patients occur. Naturally, a rise or drop
in cases follows when the policy is eased or relaxed. In all cases, Hmax is always almost reached to
allow the most relaxed level of NPIs possible, as long as the number of severe cases is kept below the
capacity. Results of the cost-eectiveness analysis show that the monthly policy change has the least
CER (0.012) and hence, the most cost-eective strategy. On the other hand, the weekly policy change
is the least cost-eective (0.031).
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19942
In Figure 6, we see that a gradual easing of NPIs (or decreasing values of µ) is possible in all
scenarios. We observe that NPIs can be noticeably eased much earlier if the vaccines used are highly
eective. Moreover, if vaccination is slow (green curves), then strict NPIs (µ0.78) are maintained
longer, even if the vaccine has high or low eectiveness (easing on day 479 for high and day 480 for
low vaccine eectiveness). These emphasize the importance of not only using highly eective vaccines
but also fast administration of the vaccines to the population.
In Figure 7, results show that with higher Hmax, a lower value for the optimal µis possible. For
low values of initial infections (I0less than 150), the level of NPIs is relatively stable (µfrom 0.61 to
0.69). As I0increases and Hmax reduces, the importance of maintaining strict NPIs is more evident. For
example, if I0=500 (or 0.05% of N0) and Hmax =50 (or 0.005% of N0), the healthcare capacity can be
overwhelmed with severe cases even with the most strict level of NPIs (µ0.95). This approach can
serve as a guide in assessing the adequacy of severe beds given that the initial number of infections is
known. Furthermore, the impact of daily imported cases on the optimal values of µis more apparent
for smaller values of Hmax. Here, the severe bed capacity Hmax is presented as a percentage of the
total population. For example, in Germany and the USA in 2020, the number of ICU beds is more
than 0.025% of the population, while in most African and Southeast Asian countries, this percentage
is less than 0.001% [67]. In Figure 7, if the severe bed capacity is 0.001% of the initial population,
the intensity of NPIs is less if there are fewer imported cases (µ=0.657 if ξ=0, while µ=0.818 if
ξ=20). Therefore, for countries with a low number of severe beds, NPIs such as screening measures
at the border are crucial in keeping a minimal number of imported cases and preventing strict NPIs.
From February 26, 2021 to February 3, 2022, the estimated µvalues in Korea and the number of
daily confirmed cases during SD2 and SD4 were relatively stable except around July 12, 2021, when
the proportion of the delta variant among the infections increased rapidly. On November 1, 2021,
GR was implemented and the maximum number of people allowed in a private gathering increased to
eight. As a result, daily confirmed cases soared, even though the proportion of omicron among the
cases was still below 10%. As daily confirmed cases reached 7000, the government suspended the GR
policy. Since SGR initially had a stricter private gathering policy, the daily confirmed cases decreased.
However, the daily confirmed cases increased again as the proportion of the omicron variant rose to
over 50%. Despite the increasing number of cases towards the end of the estimation period, policies in
Korea kept easing.
Furthermore, we investigate the eects of antiviral drugs and the easing of NPIs in the number of
severe patients. We see in Figure 9 that for non-optimal µvalues of 0.1 or 0.3, even with seven million
antiviral drugs, the number of severe patients may surpass the severe bed capacity. Moreover, with
µ=0.5 or lower and five million antiviral drugs, a surge in severe patients is likely to happen. Results
in Figure 10 with the optimal µvalues show that in all three cases, a gradual easing of NPIs is possible
without exceeding the severe bed capacity, even during the second surge of cases when all the five
million supply of antiviral drugs are used up. We note that all the obtained optimal µvalues are less
than the estimated µvalues during SD2, SD4, GR, and GR (see Table 3). Although the cumulative
cases by the end of the year when the antiviral drugs are six million (11152) are less compared to when
the supply is seven million (13233), the CER for the seven million supply (0.124) is considerably less
than the six million supply (0.493). Finally, we see on the bottom left panel in Figure 11 that if the
proportion of administered Paxlovid is 92% or less (blue, black, purple, and red), then more strict NPIs,
greater than the previously estimated µ=0.653, should be implemented at the beginning of the forecast
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19943
period so that the number of severe patients will not exceed the set threshold of 2825 beds. In all cases,
a relaxed level of NPIs (µ=0.05) is possible starting June 2022. A lower proportion φmay delay the
peak of severe infections but the wave is wider resulting in higher cumulative cases. For instance, if
φ=0.80, the predicted cumulative severe cases are almost double compared to when φ=1. This is
interesting because social distancing policies are more relaxed if φ=1 compared to when φ=0.8.
Thus, the use of highly eective antiviral drugs not only reduces the number of severe cases but may
also lead to earlier easing and less strict intensity of NPIs. In Korea, COVID-19 restrictions were eased
in April 2022, while the relaxation of mask mandates began in May 2022. Since 93% of antiviral drugs
used in Korea were Paxlovid, the results of the simulations support the Korean policies on the easing
of restrictions.
5. Conclusions
In this work, we have formulated nonlinear optimization problems that minimize the intensity
of NPIs (such as social distancing and mask-wearing) and ensure that the number of severe cases
will not surpass the severe bed capacity during the prevaccination and vaccination phases. An
epidemiological model that considers vaccination, reduction in transmission due to NPIs, and severe
cases is embedded in the optimization problem. The constrained optimization problem is transformed
into an unconstrained one using the penalty method. Because we use exact penalty functions,
the resulting objective function is non-dierentiable, non-convex, and highly multi-modal. The
metaheuristic optimization algorithm IMODE, which is capable of obtaining the global minimum,
is used to solve the problems.
In the simulations, we observed in the prevaccination phase that more frequent policy changes result
in more oscillations in the number of severe cases and a lower average µ. However, results of the cost-
eectiveness analysis show that a monthly policy change is the most cost-eective. In the vaccination
phase, faster administration of highly eective vaccines results in the earlier easing of NPIs. If vaccine
rollout is slow (80% of the population is vaccinated in 24 months), vaccine eectiveness does not
impact the timing of easing of NPIs. Moreover, we have demonstrated that the initial number of
infected individuals and daily imported cases should be kept at a minimum value especially when the
severe bed capacity is low.
As an application, we determine optimal social distancing policy plans in Korea considering
dierent amounts and types of antiviral drugs. A mathematical model that includes variants, booster
vaccines, antiviral drugs, and waning of immunity was used. To establish the relationship between
social distancing policies and the values of µ, the model is first fitted to the data on confirmed cases by
minimizing a least-squares formulation using IMODE. Forecast results for the optimal µvalues show
that gradual easing of policies is possible and the number of severe patients can be maintained below
capacity even with at most ve million antiviral drugs, compared to when µis kept fixed to 0.3 or
below. The easing of NPIs may occur earlier and with less intensity, if the supply of antiviral drugs is
enough and the antiviral drugs are highly eective in reducing the severity of the disease.
Results in Appendix B show that recent algorithms performed better compared to classical
algorithms when solving the proposed optimization problem. Hence, this study contributes to the
growing importance of optimization algorithms that converge faster with more accurate solutions.
Since the study of evolutionary algorithms is an active research area, we expect that new algorithms
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19944
will be developed which can be used to solve the constrained problems. In our simulations, a constant
value for the severe bed capacity Hmax was assumed. However, the optimization problem can be
reformulated to allow Hmax to be time-dependent, as in the case when there is a surge of infections
and hospital bed capacity needs to be increased to accommodate more patients. A study that considers
a time-dependent Hmax can be done in future work. One can also consider a more general optimization
problem that allows for a non-constant duration of policies (e.g. P1is 30 days, P2is 15 days, and
so on). Furthermore, we assumed that both the prevaccination and vaccination phases span 9 months.
Depending on the capability to implement and availability of resources of a region or country, the
length of these phases can be modified, and consequently, the optimal strategies will change. In the
application using COVID-19 data of Korea, second booster shots and possible underreporting of cases
were not considered. Nevertheless, the epidemiological model can be modified to incorporate these and
other factors, and the framework is still applicable. The proposed scheme is general enough that it can
be applied to any model, regardless of complexity, as long as NPIs are quantified as a reduction in the
force of infection, and the severe case has a separate compartment. Finally, the presented framework
may be applied to other variants of COVID-19 or other infectious diseases.
Acknowledgments
This paper is supported by the Korea National Research Foundation (NRF) grant funded by the
Korean government (MEST) (NRF-2021M3E5E308120711). This paper is also supported by the
Korea National Research Foundation (NRF) grant funded by the Korean government (MEST) (NRF-
2021R1A2C100448711).
Conflict of interest
All authors declare no conflicts of interest in this paper.
References
1. N. Haider, A. Y. Osman, A. Gadzekpo, G. O. Akipede, D. Asogun, R. Ansumana, et al., Lockdown
measures in response to COVID-19 in nine sub-Saharan African countries, BMJ Glob. Health, 5
(2020), e003319. http://dx.doi.org/10.1136/bmjgh-2020-003319
2. J. Cohen, K. Kupferschmidt, Countries test tactics in ‘war’against COVID-19, Science, 367 (2020),
1287–1288. http://dx.doi.org/10.1126/science.367.6484.1287
3. T. P. B. Thu, P. N. H. Ngoc, N. M. Hai, Eect of the social distancing measures on the
spread of COVID-19 in 10 highly infected countries, Sci. Total. Environ., 742 (2020), 140430.
http://dx.doi.org/10.1016/j.scitotenv.2020.140430
4. N. Lu, K. W. Cheng, N. Qamar, K. C. Huang, J. A. Johnson, Weathering COVID-19 storm:
Successful control measures of five Asian countries, Am. J. Infect. Control, 48 (2020), 851–852.
http://dx.doi.org/10.1016/j.ajic.2020.04.021
5. P. Deb, D. Furceri, J. D. Ostry, N. Tawk, The economic eects of COVID-19 containment
measures, Open Econ. Rev., 33 (2022), 1–32. http://dx.doi.org/10.1007/s11079-021-09638-2
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19945
6. A. Demirg¨
uc¸-Kunt, M. Lokshin, I. Torre, The sooner, the better: The early
economic impact of non-pharmaceutical interventions during the COVID-19 pandemic,
Policy Research Working Paper, World Bank, Washington, DC, 9257 (2020).
https://openknowledge.worldbank.org/handle/10986/33820
7. C. Stokel-Walker, What do we know about covid vaccines and preventing transmission?, BMJ, 376
(2022), o298. http://dx.doi.org/10.1136/bmj.o298
8. S. Guerstein, V. Romeo-Aznar, M. Dekel, O. Miron, N. Davidovitch, R. Puzis, et al., The interplay
between vaccination and social distancing strategies aects COVID-19 population-level outcomes,
PLoS Comput. Biol., 17 (2021), e1009319. http://dx.doi.org/10.1371/journal.pcbi.1009319
9. M. Dashtbali, M. Mirzaie, A compartmental model that predicts the eect of social
distancing and vaccination on controlling COVID-19, Sci. Rep., 11 (2021), 1–11.
http://dx.doi.org/10.1038/s41598-021-86873-0
10. M. F. Good, M. T. Hawkes, The interaction of natural and vaccine-induced immunity with social
distancing predicts the evolution of the COVID-19 pandemic, mBio., 11 (2020), e02617–20.
http://dx.doi.org/10.1128/mBio.02617-20
11. M. J. Keeling, E. M. Hill, E. E. Gorsich, B. Penman, G. Guyver-Fletcher, A.
Holmes, et al., Predictions of COVID-19 dynamics in the UK: Short-term forecasting
and analysis of potential exit strategies, PLoS Comput. Biol., 17 (2021), e1008619.
http://dx.doi.org/10.1371/journal.pcbi.1008619
12. R. Chowdhury, K. Heng, M. S. R. Shawon, G. Goh, D. Okonofua, C. Ochoa-Rosales,
et al., Dynamic interventions to control COVID-19 pandemic: A multivariate prediction
modelling study comparing 16 worldwide countries, Eur. J. Epidemiol., 35 (2020), 389–399.
http://dx.doi.org/10.1007/s10654-020-00649-w
13. T. Oraby, M. G. Tyshenko, J. C. Maldonado, K. Vatcheva, S. Elsaadany, W. Q. Alali, et al.,
Modeling the eect of lockdown timing as a COVID-19 control measure in countries with diering
social contacts, Sci. Rep., 11 (2021), 1–13. http://dx.doi.org/10.1038/s41598-021-82873-2
14. I. U. Haq, N. Ali, H. Ahmad, T. A. Nofal, On the fractional-order mathematical model of COVID-
19 with the eects of multiple non-pharmaceutical interventions, AIMS Math., 7(2022), 16017–
16036. http://dx.doi.org/10.3934/math.2022877
15. K. M. Sallam, S. M. Elsayed, R. K. Chakrabortty, M. J. Ryan, Improved multi-operator dierential
evolution algorithm for solving unconstrained problems, 2020 IEEE Congress on Evolutionary
Computation (CEC), (2020), 1–8. http://dx.doi.org/10.1109/CEC48606.2020.9185577
16. N. Gozzi, P. Bajardi, N. Perra, The importance of non-pharmaceutical interventions
during the COVID-19 vaccine rollout, PLoS Comput. Biol., 17 (2021), e1009346.
http://dx.doi.org/10.1371/journal.pcbi.1009346
17. J. Pan, W. Zhu, J. Tian, Z. Liu, A. Xu, Y. Yao, et al., Vaccination as an alternative to non-drug
interventions to prevent local resurgence of COVID-19, Infect. Dis. Poverty, 11 (2022), 1–13.
http://dx.doi.org/10.1186/s40249-022-00960-6
18. I. M. Batiha, A. A. Al-Nana, R. B. Albadarneh, A. Ouannas, A. Al-Khasawneh, S. Momani,
Fractional-order coronavirus models with vaccination strategies impacted on Saudi Arabia’s
infections, AIMS Math., 7(2022), 12842–12858. http://dx.doi.org/10.3934/math.2022711
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19946
19. J. Lee, R. Mendoza, V. M. P. Mendoza, Y. Ko, J. Lee, Y. Seo, et al., Modelling the eects of social
distancing, antiviral therapy, and booster shots on mitigating omicron spread, preprint (Version 1)
available at Research Square, (09 February 2022). http://dx.doi.org/10.21203/rs.3.rs-1322738/v1
20. Y. Alimohamadi, M. Taghdir, M. Sepandi, Estimate of the basic reproduction number for COVID-
19: A systematic review and meta-analysis, J. Prev. Med. Public Health, 53 (2020), 151–157.
http://dx.doi.org/10.3961/jpmph.20.076
21. Y. Liu, A. A. Gayle, A. Wilder-Smith, J. Rockl¨
ov, The reproductive number of
COVID-19 is higher compared to SARS coronavirus, J. Travel Med., 27 (2020), 1–4.
http://dx.doi.org/10.1093/jtm/taaa021
22. W. He, G. Y. Yi, Y. Zhu, Estimation of the basic reproduction number, average incubation time,
asymptomatic infection rate, and case fatality rate for COVID-19: Meta-analysis and sensitivity
analysis, J. Med. Virol., 92 (2020), 2543–2550. http://dx.doi.org/10.1002/jmv.26041
23. Daily vaccination situation, Korea Disease Control and Prevention Agency (KDCA), 2021.
https://ncv.kdca.go.kr/vaccineStatus.es?mid=a11710000000
24. COVID-19 vaccine weekly surveillance report week 1, UK Health Security Agency (UKHSA),
2022. https://assets.publishing.service.gov.uk/government/uploads/system/uploads/attachment data
/file/1045329/Vaccine surveillance report week 1 2022.pdf
25. WHO Communicable Diseases, Emergencies Preparedness, Infection Prevention and Control
UHL, Mask use in the context of COVID-19: Interim Guidance, World Health Organization, 2020,
1–22. WHO/2019-nCoV/IPC Masks/2020.5
26. Y. Wang, R. Chen, F. Hu, Y. Lan, Z. Yang, C. Zhan, et al., Transmission, viral kinetics and clinical
characteristics of the emergent SARS-CoV-2 Delta VOC in Guangzhou, China, EClinicalMedicine,
40 (2021), 101129. http://dx.doi.org/10.1016/j.eclinm.2021.101129
27. The eectiveness for severity and death of COVID-19 vaccine from May to July 2021, Korea
Disease Control and Prevention Agency (KDCA), 2022. Available from: https://www.kdca.
go.kr/board/board.es?mid=a20602010000&bid=0034&list_no=716913&act=view
28. E. S. Rosenberg, V. Dorabawila, D. Easton, U. E. Bauer, J. Kumar, R. Hoen, et al.,
COVID-19 vaccine eectiveness in New York State, N. Engl. J. Med., 386 (2022), 116–127.
http://dx.doi.org/10.1056/NEJMoa2116063
29. O. T. Ranzani, M. D. Hitchings, M. Dorion, T. L. D’Agostini, R. C. de Paula, O. F. P. de
Paula, et al., Eectiveness of the CoronaVac vaccine in older adults during a gamma variant
associated epidemic of covid-19 in Brazil: Test negative case-control study, BMJ, 374 (2021).
http://dx.doi.org/10.1136/bmj.n2015
30. N. M. Lewis, E. A. Naioti, W. H. Self, A. A. Ginde, D. J. Douin, H. K. Talbot, et al., Eectiveness
of mRNA vaccines in preventing COVID-19 hospitalization by age and burden of chronic medical
conditions among immunocompetent US adults, March-August 2021, J. Infect. Dis., 225 (2022),
1694–1700. http://dx.doi.org/10.1093/infdis/jiab619
31. Y. H. Lee, C. M. Hong, D. H. Kim, T. H. Lee, J. Lee, Clinical course of asymptomatic and mildly
symptomatic patients with coronavirus disease admitted to community treatment centers, South
Korea, Emerg. Infect. Dis., 26 (2020), 2346–2352. http://dx.doi.org/10.3201/eid2610.201620
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19947
32. The weekly news review, Seoul Metropolitan Government, Citizen’s health department,
2021. https://www.seoul.go.kr/seoulcom/fileDownload.do?fileName=corona/daily-news-
review 211210 447.pdf
33. M. Ki, Epidemiologic characteristics of early cases with 2019 novel coronavirus
(2019-nCoV) disease in Korea, Epidemiol. Health, 42 (2020), e2020007.
http://dx.doi.org/10.4178/epih.e2020007
34. G. Di Pillo, L. Grippo, Exact penalty functions in constrained optimization, SIAM
Journal on control and optimization, SIAM J. Control Optim., 27 (1989), 1333–1360.
http://dx.doi.org/10.1137/0327068
35. Current status of COVID-19 outbreak and vaccination in Korea (4.29.), Korea Disease Control and
Prevention Agency (KDCA), 2022. Available from: https://kdca.go.kr/board/board.es?
mid=a20501010000&bid=0015&list_no=719429&cg_code=&act=view&nPage=9#
36. E. Mahase, Covid-19: Pfizer’s paxlovid is 89% eective in patients at risk of serious illness,
company reports, BMJ, 375 (2021). http://dx.doi.org/10.1136/bmj.n2713
37. Y. Jo, S. B. Kim, M. Radnaabaatar, K. Huh, J. H. Yoo, K. R. Peck, et al., Model-based cost-
eectiveness analysis of oral antivirals against SARS-CoV-2 in Korea, Epidemiol. Health, 44
(2022), e2022034. http://dx.doi.org/10.4178/epih.e2022034
38. F. Agusto, M. Leite, Optimal control and cost-eective analysis of the 2017 meningitis outbreak in
Nigeria, Infect. Dis. Model, 4(2019), 161–187. http://dx.doi.org/10.1016/j.idm.2019.05.003
39. X. Zhang, Z. Zhu, C. Zhang, Multi-stage dierential evolution algorithm for constrained D-optimal
design, AIMS Math., 6(2021), 2956–2969. http://dx.doi.org/10.3934/math.2021179
40. P. Wang, J. Huang, W. He, J. Zhang, F. Guo, Maximum likelihood DOA estimation based on
improved invasive weed optimization algorithm and application of MEMS vector hydrophone
array, AIMS Math., 7(2022), 12342–12363. http://dx.doi.org/10.3934/math.2022685
41. S. Zhu, A. P. Piotrowski, M. Ptak, J. J. Napiorkowski, J. Dai, Q. Ji, How does the calibration
method impact the performance of the air2water model for the forecasting of lake surface water
temperatures?, J. Hydrol., 597 (2021), 126219. http://dx.doi.org/10.1016/j.jhydrol.2021.126219
42. A. Ferrolino, R. Mendoza, I. Magdalena, J. E. Lope, Application of particle swarm
optimization in optimal placement of tsunami sensors, Peer J. Comput. Sci., 6(2020), e333.
http://dx.doi.org/10.7717/peerj-cs.333
43. A. C. Velasco, M. Darbas, R. Mendoza, M. Bacon, J. C. de Leon, Comparative study of heuristic
algorithms for electrical impedance tomography, Philipp. J. Sci., 149 (2020), 747–772.
44. X. Li, M. Yin, Design of a reconfigurable antenna array with discrete phase shifters
using dierential evolution algorithm, Prog. Electromagn. Res. B, 31 (2011), 29–43.
http://dx.doi.org/10.2528/PIERB11032902
45. X. Li, X. Zhang, M. Yin, J. Wang, A genetic algorithm for the distributed assembly permutation
flowshop scheduling problem, 2015 IEEE Congress on Evolutionary Computation (CEC), (2015),
3096–3101. http://dx.doi.org/10.1109/CEC.2015.7257275
46. I. M. Hezam, O. Abdul-Raof, A. Foul, F. Aqlan, A quantum-inspired sperm motility algorithm,
AIMS Math., 7(2022), 9057–9088. http://dx.doi.org/10.3934/math.2022504
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19948
47. B. She, A. Fournier, M. Yao, Y. Wang, G. Hu, A self-adaptive and gradient-based
cuckoo search algorithm for global optimization, Appl. Soft Comput., 122 (2022), 108774.
http://dx.doi.org/10.1016/j.asoc.2022.108774
48. E. A. T. Enriquez, R. G. Mendoza, A. C. T. Velasco, Philippine Eagle optimization algorithm, IEEE
Access, 10 (2022), 29089–29120. http://dx.doi.org/10.1109/ACCESS.2022.3158357
49. X. Li, J. Wang, J. Zhou, M. Yin, A perturb biogeography based optimization with
mutation for global numerical optimization, Appl. Math. Comput., 218 (2011), 598–609.
http://dx.doi.org/10.1016/j.amc.2011.05.110
50. X. Li, S. Ma, J. Hu, Multi-search dierential evolution algorithm, Appl. Intell., 47 (2017), 231–256.
http://dx.doi.org/10.1007/s10489-016-0885-9
51. X. Li, M. Yin, Modified cuckoo search algorithm with self adaptive parameter method, Inf. Sci.,
298 (2015), 80–97. http://dx.doi.org/10.1016/j.ins.2014.11.042
52. P. Yarsky, Using a genetic algorithm to fit parameters of a COVID-19 SEIR model for US states,
Math. Comput. Simul., 185 (2021), 687–695. http://dx.doi.org/10.1016/j.matcom.2021.01.022
53. C. U. Jamilla, R. G. Mendoza, V. M. P. Mendoza, Parameter estimation in neutral delay dierential
equations using genetic algorithm with multi-parent crossover, IEEE Access, 9(2021), 131348–
131364. http://dx.doi.org/10.1109/ACCESS.2021.3113677
54. Windarto, M. A. Khan, Fatmawati, Parameter estimation and fractional derivatives of dengue
transmission model, AIMS Math., 5(2020), 2758–2779. http://dx.doi.org/10.3934/math.2020178
55. B. Ma, J. Qi, Y. Wu, P. Wang, D. Li, S. Liu, Parameter estimation of the COVID-19 transmission
model using an improved quantum-behaved particle swarm optimization algorithm, Digit. Signal
Process., 127 (2022), 103577. http://dx.doi.org/10.1016/j.dsp.2022.103577
56. X. Li, M. Yin, Parameter estimation for chaotic systems by hybrid dierential evolution
algorithm and artificial bee colony algorithm, Nonlinear Dyn., 77 (2014), 61–71.
http://dx.doi.org/10.1007/s11071-014-1273-9
57. R. Tanabe, A. S. Fukunaga, Improving the search performance of SHADE using linear population
size reduction, 2014 IEEE Congress on Evolutionary Computation (CEC), (2014), 1658-1665.
http://dx.doi.org/10.1109/CEC.2014.6900380
58. K. M. Sallam, S. M. Elsayed, R. A. Sarker, D. L. Essam, Landscape-based adaptive
operator selection mechanism for dierential evolution, Inf. Sci., 418-419 (2017), 383–404.
http://dx.doi.org/10.1016/j.ins.2017.08.028
59. J. Wei, H. Niu, A ranking-based adaptive cuckoo search algorithm for unconstrained optimization,
Expert Syst. Appl., 204 (2022), 117428. http://dx.doi.org/10.1016/j.eswa.2022.117428
60. N. H. Awad, M. Z. Ali, P. N. Suganthan, Ensemble sinusoidal dierential covariance
matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark
problems, 2017 IEEE Congress on Evolutionary Computation (CEC), (2017), 372–379.
http://dx.doi.org/10.1109/CEC.2017.7969336
61. A. Kumar, R. K. Misra, D. Singh, Improving the local search capability of Eective Butterfly
Optimizer using Covariance Matrix Adapted Retreat Phase, 2017 IEEE Congress on Evolutionary
Computation (CEC), (2017), 1835–1842. http://dx.doi.org/10.1109/CEC.2017.7969524
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19949
62. A. W. Mohamed, A. A. Hadi, A. M. Fattouh, K. M. Jambi, LSHADE with semi-
parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark
problems, 2017 IEEE Congress on Evolutionary Computation (CEC), (2017), 145–152.
http://dx.doi.org/10.1109/CEC.2017.7969307
63. N. Covic, B. Lacevic, Wingsuit Flying Search–A Novel Global Optimization Algorithm, IEEE
Access, 8(2020), 53883–53900. http://dx.doi.org/10.1109/ACCESS.2020.2981196
64. Artificial Bee Colony Optimization, SKS Labs, 2022. Available from: https://www.mathworks.
com/matlabcentral/fileexchange/74122-artificial-bee-colony-optimization
65. I. Ahmadianfar, O. Bozorg-Haddad, X. Chu, Gradient-based optimizer: A new metaheuristic
optimization algorithm, Inf. Sci., 540 (2020), 131–159. http://dx.doi.org/10.1016/j.ins.2020.06.037
66. X. Li, J. Zhang, M. Yin, Animal migration optimization: An optimization algorithm
inspired by animal migration behavior, Neural Comput. Applic., 24 (2014), 1867–1877.
http://dx.doi.org/10.1007/s00521-013-1433-8
67. X. Ma, D. Vervoort, Critical care capacity during the COVID-19 pandemic: global availability of
intensive care beds, J. Crit. Care., 58 (2020), 96–97. http://dx.doi.org/10.1016/j.jcrc.2020.04.012
68. F. Campbell, B. Archer, H. Laurenson-Schafer, Y. Jinnai, F. Konings, N. Batra, et al., Increased
transmissibility and global spread of SARS-CoV-2 variants of concern as at June 2021, Euro
Surveill., 26 (2021), 2100509. http://dx.doi.org/10.2807/1560-7917.ES.2021.26.24.2100509
69. R. C. Barnard, N. G. Davies, C. A. Pearson, M. Jit, W. J. Edmunds, Projected
epidemiological consequences of the Omicron SARS-CoV-2 variant in England,
December 2021 to April 2022, preprint available at medRxiv, (16 December 2021).
http://dx.doi.org/10.1101/2021.12.15.21267858
70. Report 50-Hospitalisation risk for Omicron cases in England, Imperial College London (22-12-
2021), N. Ferguson, A. Ghani, W. Hinsley, E. Volz, on behalf of the Imperial College COVID-19
response team, 2021. Available from: http://hdl.handle.net/10044/1/93035
71. V. Gupta, R. C. Bhoyar, A. Jain, S. Srivastava, R. Upadhayay, M. Imran et al.,
Asymptomatic Reinfection in 2 Healthcare Workers From India With Genetically Distinct
Severe Acute Respiratory Syndrome Coronavirus 2, Clin. Infect. Dis., 73 (2021), e2823–e2825.
http://dx.doi.org/10.1093/cid/ciaa1451
72. P. Colson, M. Finaud, N. Levy, J. C. Lagier, D. Raoult, Evidence of SARS-CoV-2 re-infection with
a dierent genotype, J. Infect., 82 (2021), 84–123. http://dx.doi.org/10.1016/j.jinf.2020.11.011
73. P. Brouqui, P. Colson, C. Melenotte, L. Houhamdi, M. Bedotto, C. Devaux, et al., COVID-19
re-infection, Eur. J. Clin. Invest., 51 (2021), e13537. http://dx.doi.org/10.1111/eci.13537
74. P. C. Resende, J. F. Bezerra, R. Vasconcelos, I. Arantes, L. Appolinario, A. C.
Mendonc¸a, et al., Severe acute respiratory syndrome coronavirus 2 P. 2 lineage associated
with reinfection case, Brazil, June–October 2020, Emerg. Infect. Dis., 27 (2021), 1789.
http://dx.doi.org/10.3201/eid2707.210401
75. J. P. Townsend, H. B. Hassler, Z. Wang, S. Miura, J. Singh, S. Kumar, et al., The durability of
immunity against reinfection by SARS-CoV-2: A comparative evolutionary study, Lancet Microbe,
2(2021), e666–e675. http://dx.doi.org/10.1016/S2666-5247(21)00219-6
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19950
76. B. J. Gardner, A. M. Kilpatrick, Estimates of reduced vaccine eectiveness against hospitalization,
infection, transmission and symptomatic disease of a new SARS-CoV-2 variant, Omicron
(B.1.1.529), using neutralizing antibody titers, preprint available at medRxiv, (12 December 2021).
http://dx.doi.org/10.1101/2021.12.10.21267594
77. S. Mirjalili, The Ant Lion Optimizer, Adv. Eng. Softw., 83 (2015), 80–98.
http://dx.doi.org/10.1016/j.advengsoft.2015.01.010
78. R. Victor, Z. Nahorski, R. V. V. Vidal, Simulated Annealing Applied to Combinatorial
Optimization, Special Issue of the Journal of Control and Cybernetics, Warszawa, 25 (1996).
79. J. Kennedy, R. Eberhart, Particle swarm optimization, Proceedings of
ICNN’95-International Conference on Neural Networks, 4(1995), 1942–1948.
http://dx.doi.org/10.1109/ICNN.1995.488968
80. S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey Wolf Optimizer, Adv. Eng. Softw., 69 (2014), 46–61.
http://dx.doi.org/10.1016/j.advengsoft.2013.12.007
81. G. G. Wang, S. Deb, L. d. S. Coelho, Elephant Herding Optimization, 2015 3rd
International Symposium on Computational and Business Intelligence (ISCBI), (2015), 1–5.
http://dx.doi.org/10.1109/ISCBI.2015.8
82. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-
Wesley Longman Publishing Co., Inc., USA, 1989.
83. Y. Villuendas-Rey, J. L. Vel´
azquez-Rodr´
ıguez, M. D. Alanis-Tamez, M. A. Moreno-Ibarra, C.
Y´
a˜
nez-M´
arquez, Mexican Axolotl Optimization: A Novel Bioinspired Heuristic, Mathematics,
9(2021), 781. http://dx.doi.org/10.3390/math9070781
84. 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.
http://dx.doi.org/10.1016/j.future.2019.02.028
85. C. Audet, J. E. Dennis, Analysis of Generalized Pattern Searches, SIAM J. Optim., 13 (2002),
889–903. http://dx.doi.org/10.1137/S1052623400378742
86. S. Mirjalili, A. Lewis, The Whale Optimization Algorithm, Adv. Eng. Softw., 95 (2016), 51–67.
http://dx.doi.org/10.1016/j.advengsoft.2016.01.008
87. M. Khishe, M. R. Mosavi, Chimp optimization algorithm, Expert Syst. Appl., 149 (2020), 113338.
http://dx.doi.org/10.1016/j.eswa.2020.113338
88. X. S. Yang, A New Metaheuristic Bat-Inspired Algorithm, In: J. R. Gonz´
alez, D. A. Pelta, C.
Cruz, G. Terrazas, N. Krasnogor, Eds, Nature Inspired Cooperative Strategies for Optimization
(NICSO 2010), Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg, 2010.
http://dx.doi.org/10.1007/978-3-642-12538-6 6
Supplementary
A. Equations of the COVID-19 model in the application using data of Korea
The system of dierential equations describing the model are given by
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19951
dEX,j
dt =λjSXκjEX,j,
dIX,j
dt =κjEαjI,
dQm
X,j
dt =11es
X,j1epill αjIγmQm,
dQs
X,j
dt =1es
X,j1epill αjIγsQs,
dRX,j
dt =γmQm
X,j+(1 f)γsQs,
dDX,j
dt =fγsQs
X,j,
dS
dt =θvX
j∈{1,2,3}
λjS+X
j∈{1,2,3}
τnRsus,j
dU
dt =e1θvX
j∈{1,2,3}
λjU+X
j∈{1,2,3}
τnRU,j,
dV
dt =(1 e1)θvωVX
j∈{1,2,3}
λjV,
P2
dt =ω(1 e
3)V+ωb(1 e
b,3)Vbτv,2P2λ3P2,
P3
dt =ωe
3V+ωbe
b,3Vbτv,3P3,
W
dt =τv,2P2+τv,3P3qθbW+X
j∈{1,2,3}
τnRP,j,
Vb
dt =qθbWωbVb,
(A.1)
where
X {sus,U,P},j {1,2,3},
Ssus =S+V,SU=U,SP=P2+W+Vb,
λj=(1 µ)R0,jαj
Isus,j+ηIU,j+ηIP,j
N
N=S+U+V+P2+P3+W+Vb+X
j∈{1,2,3}
X
X∈{sus,U,P}EX,j+IX,j+RX,j
.
The model parameters and their values considering the pre-delta, delta, and omicron variants are
shown in Table S1. The parameters ω,f,p, and vaccine eectiveness (e,eb,es) are from the literature
and adjusted to fit Korea (e.g. vaccines administered, age structure, etc.).
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19952
Table S1. List of parameters in the COVID-19 model for Korea.
Symbol Description (unit) pre-δ δ ø Ref.
R0Basic reproductive number 3.17 6.24 8.11 [20–22, 68, 69]
1 Mean infectious period (day) 4 6 6 [25, 33]
1 Mean period to develop 40 40 40 [19,23,24]
full immunity (day)
1jMean latent period (day) 4 2 2 [25, 26]
pjProportion of infections 2.28% 2.28% 0.57% [27, 70]
that becomes severe
1mMean duration of hospitalization 11.7 11.7 11.7 [31]
for mild cases (day)
1sMean duration of hospitalization 14 14 14 [19,32]
for severe cases (day)
fMean fatality rate among 0.439 0.439 0.439 [19, 27]
severe cases
ejAdjusted eectiveness of 0.85 0.85 0.53 [23, 24]
primary vaccines
eb,jAdjusted eectiveness of 0.96 0.96 0.67 [23, 24]
booster vaccines
esVaccine eectiveness against 0.73 0.73 0.73 [30]
severe disease
epill Eectiveness of antiviral pills [0.30,0.89] [0.30,0.89] [0.30,0.89][36, 37]
against severe infections
τnWaning rate of infection-induced 1/120 1/120 1/120 [71–74]
immunity (1/day)
τv,jWaning rate of vaccine-induced 1/480 1/480 1/480 [75]
immunity (1/day)
ηVaccine-induced reduction in 23% 23% 4.2% [76]
transmission
E0Initial exposed population 0 1 50 Assumed
B. Application of dierent metaheuristic algorithms in solving the prevaccination phase
optimization problem
Table S2 summarizes the results of the 21 metaheuristic algorithms in solving (2.11) for n1=3. The
following abbreviations are used: Improved Multi-operator Dierential Evolution (IMODE), Ranking-
based Adaptive Cuckoo Search (RACS), Ensemble sinusoidal dierential covariance matrix adaptation
with Euclidean neighborhood (LSHADE-cnEpSin), Eective Butterfly Optimizer with Covariance
Matrix Adapted Retreat Phase (EBOwithCMAR), LSHADE with Semi-Parameter Adaptation Hybrid
with CMA-ES (LSHADE-SPACMA), Wingsuit Flying Search (WFS), Artificial Bee Colony(ABC),
Gradient-based Optimizer (GBO), Animal Migration Optimization (AMO), Ant Lion Optimizer
(ALO), Simulated Annealing (SA), Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO),
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
19953
Elephant Herding Optimization (EHO), Genetic Algorith, (GA), Mexican Axolotl Optimization
(MAO), Harris Hawks Optimizer (HHO), Generalized Pattern Search (GPS), Whale Optimization
Algorithm (WOA), Chimp Optimization Algorithm (ChOA), Bat Algorithm (BA).
Table S2. Mean, median, best, worst, and standard deviation (SD) of the cost function values
resulting from 20 independent runs of some known and recent metaheuristic algorithms. The
top five least values in each metric are written in boldface. The year when the algorithm was
published and references are also listed.
Algorithm Mean Median Best Worst SD Year Ref.
IMODE 6.09E-01 6.07E-01 5.60E-01 6.42E-01 2.13E-02 2020 [15]
RACS 6.14E-01 6.22E-01 5.59E-01 6.47E-01 2.58E-02 2022 [59]
LSHADE-cnEpSin 6.20E-01 6.34E-01 5.65E-01 6.34E-01 2.34E-02 2017 [60]
EBOwithCMAR 6.23E-01 6.29E-01 5.88E-01 6.37E-01 1.42E-02 2017 [61]
LSHADE-SPACMA 6.29E-01 6.34E-01 5.80E-01 6.38E-01 1.31E-02 2017 [62]
WFS 6.23E-01 6.30E-01 5.68E-01 6.77E-01 3.23E-02 2020 [63]
ABC 6.24E-01 6.32E-01 5.85E-01 6.44E-01 2.10E-02 2022 [64]
GBO 6.23E-01 6.35E-01 5.73E-01 6.39E-01 2.48E-02 2020 [65]
AMO 6.25E-01 6.35E-01 5.77E-01 6.50E-01 2.10E-02 2014 [66]
ALO 5.14E+01 6.60E-01 5.64E-01 5.05E+02 1.36E+02 2015 [77]
SA 5.54E+01 6.36E-01 5.64E-01 1.10E+03 2.45E+02 1996 [78]
PSO 2.65E+01 6.34E-01 5.65E-01 5.17E+02 1.16E+02 1995 [79]
GWO 6.59E+01 6.37E-01 5.68E-01 1.08E+03 2.44E+02 2014 [80]
EHO 2.20E+01 6.71E-01 6.29E-01 4.26E+02 9.52E+01 2015 [81]
GA 3.03E+02 6.73E-01 5.82E-01 1.62E+03 4.58E+02 1989 [82]
MAO 1.17E+02 7.04E-01 6.34E-01 7.34E+02 2.15E+02 2021 [83]
HHO 2.45E+02 7.10E-01 6.28E-01 2.05E+03 4.97E+02 2019 [84]
GPS 4.25E+02 1.37E+02 6.07E-01 1.81E+03 6.18E+02 2002 [85]
WOA 4.46E+02 1.70E+02 6.19E-01 1.58E+03 5.44E+02 2016 [86]
ChOA 1.14E+03 1.58E+03 5.88E-01 1.95E+03 8.14E+02 2020 [87]
BA 2.96E+03 1.07E+03 6.45E-01 1.25E+04 3.61E+03 2010 [88]
©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)
AIMS Mathematics Volume 7, Issue 11, 19922–19953.
... As an application, we use SASS-CMODE to solve a constrained optimization problem that minimizes the intensity of non-pharmaceutical interventions (NPIs), while keeping the number of severe cases below the bed capacity and ensuring that daily cases are decreasing at the end of a policy period. This problem has been solved in [27] by transforming it into an unconstrained problem via a penalty method with predetermined weights and employing IMODE. Here, we briefly describe the mathematical model and the constrained problem. ...
... Constraint (11) ensures that the number of severe cases is always less than the threshold H max and constraint (12) guarantees that the daily cases at the end of the policy period are decreasing. SASS-CMODE is used to solve the constrained problem (10)- (12) and the results are compared with those presented in [27] using other known and recent metaheuristic algorithms. ...
... Table IV summarizes the objective function values obtained from 20 independent runs of each algorithm for the infectious disease control problem. Except for SASS-CMODE, the results using the other algorithms are obtained from [27]. ...
Preprint
Full-text available
p>This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Metaheuristic algorithms for constrained optimiza- tion problems have become popular because of their ease of use and capability to obtain global solutions. However, these population-based algorithms can be computationally expensive and may suffer from low accuracy due to the difficulty in obtaining feasible points. We present a novel algorithm, re- ferred to as SASS-CMODE, by integrating a modified Improved Multi-Operator Differential Evolution (IMODE) algorithm with the Self-Adaptive Spherical Search (SASS) method. IMODE is modified to make it suitable for solving constrained problems, leading to a new algorithm termed Constrained Multi-Operator Differential Evolution (CMODE). SASS-CMODE is capable of achieving solutions with high feasibility rate and high accuracy by utilizing SASS to identify good feasible points and CMODE to achieve accurate solutions with fewer function evaluations. To evaluate its performance, we test SASS-CMODE to 57 engi- neering problems. The results demonstrate its superiority over other state-of-the-art optimization algorithms. SASS-CMODE is also employed to solve a constrained optimization problem on identifying optimal levels of non-pharmaceutical interventions to control an epidemic, showcasing its versatility and applicability in real-world scenarios.</p
... As an application, we use SASS-CMODE to solve a constrained optimization problem that minimizes the intensity of non-pharmaceutical interventions (NPIs), while keeping the number of severe cases below the bed capacity and ensuring that daily cases are decreasing at the end of a policy period. This problem has been solved in [27] by transforming it into an unconstrained problem via a penalty method with predetermined weights and employing IMODE. Here, we briefly describe the mathematical model and the constrained problem. ...
... Constraint (11) ensures that the number of severe cases is always less than the threshold H max and constraint (12) guarantees that the daily cases at the end of the policy period are decreasing. SASS-CMODE is used to solve the constrained problem (10)- (12) and the results are compared with those presented in [27] using other known and recent metaheuristic algorithms. ...
... Table IV summarizes the objective function values obtained from 20 independent runs of each algorithm for the infectious disease control problem. Except for SASS-CMODE, the results using the other algorithms are obtained from [27]. ...
Preprint
Full-text available
p>This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Metaheuristic algorithms for constrained optimiza- tion problems have become popular because of their ease of use and capability to obtain global solutions. However, these population-based algorithms can be computationally expensive and may suffer from low accuracy due to the difficulty in obtaining feasible points. We present a novel algorithm, re- ferred to as SASS-CMODE, by integrating a modified Improved Multi-Operator Differential Evolution (IMODE) algorithm with the Self-Adaptive Spherical Search (SASS) method. IMODE is modified to make it suitable for solving constrained problems, leading to a new algorithm termed Constrained Multi-Operator Differential Evolution (CMODE). SASS-CMODE is capable of achieving solutions with high feasibility rate and high accuracy by utilizing SASS to identify good feasible points and CMODE to achieve accurate solutions with fewer function evaluations. To evaluate its performance, we test SASS-CMODE to 57 engi- neering problems. The results demonstrate its superiority over other state-of-the-art optimization algorithms. SASS-CMODE is also employed to solve a constrained optimization problem on identifying optimal levels of non-pharmaceutical interventions to control an epidemic, showcasing its versatility and applicability in real-world scenarios.</p
... The standard deviation of this noise is initialized based on the population range and gradually decreases over generations. Figure 3. Flowchart of IMODE algorithm [46,72]. ...
Preprint
Precise and accurate estimation of cosmological parameters is crucial for understanding the Universe's dynamics and addressing cosmological tensions. In this methods paper, we explore bio-inspired metaheuristic algorithms, including the Improved Multi-Operator Differential Evolution scheme and the Philippine Eagle Optimization Algorithm (PEOA), alongside the relatively known genetic algorithm, for cosmological parameter estimation. Using mock data that underlay a true fiducial cosmology, we test the viability of each optimization method to recover the input cosmological parameters with confidence regions generated by bootstrapping on top of optimization. We compare the results with Markov chain Monte Carlo (MCMC) in terms of accuracy and precision, and show that PEOA performs comparably well under the specific circumstances provided. Understandably, Bayesian inference and optimization serve distinct purposes, but comparing them highlights the potential of nature-inspired algorithms in cosmological analysis, offering alternative pathways to explore parameter spaces and validate standard results.
Article
Full-text available
Due to the relatively low severity and fatality rates of the omicron variant of COVID-19, strict non-pharmaceutical interventions (NPIs) with high economic costs may not be necessary. We develop a mathematical model of the COVID-19 outbreak in Korea that considers NPIs, variants, medical capacity, and economic costs. Using optimal control theory, we propose an optimal strategy for the omicron period. To suggest a realistic strategy, we consider limited hospital beds for severe cases and incorporate it as a penalty term in the objective functional using a logistic function. This transforms the constrained problem into an unconstrained one. Given that the solution to the optimal control problem is continuous, we propose the adoption of a sub-optimal control as a more practically implementable alternative. Our study demonstrates how to strategically balance the trade-off between minimizing the economic cost for NPIs and ensuring that the number of severe cases in hospitals is manageable.
Article
Full-text available
In this article, the Caputo fractional derivative operator of different orders 0 < α ≤ 1 is applied to formulate the fractional-order model of the COVID-19 pandemic. The existence and boundedness of the solutions of the model are investigated by using the Gronwall-Bellman inequality. Further, the uniqueness of the model solutions is established by using the fixed-point theory. The Laplace Adomian decomposition method is used to obtain an approximate solution of the nonlinear system of fractional-order differential equations of the model with a different fractional-order α for every compartment in the model. Finally, graphical presentations are presented to show the effects of other fractional parameters α on the obtained approximate solutions.
Article
Full-text available
Several newly nonlinear models for describing dynamics of COVID-19 pandemic have been proposed and investigated in literature recently. In light of these models, we attempt to reveal the role of fractional calculus in describing the growth of COVID-19 dynamics implemented on Saudi Arabia's society over 107 days; from 17 Dec 2020 to 31 March 2021. Above is achieved by operating two fractional-order differential operators, Caputo and the Caputo-Fabrizio operators, instead of the classical one. One of expanded SEIR models is utilized for achieving our purpose. With the help of using the Generalized Euler Method (GEM) and Adams-Bashforth Method (ABM), the numerical simulations are performed respectively in view of the Caputo and Caputo-Fabrizio operators. Accordance with said, the stability analysis of the two proposed fractional-order models is discussed and explored in view of obtaining the equilibrium points, determining the reproductive number (R0 R_0 ) and computing the elasticity indices of R0 R_0 . Several numerical comparisons reveal that the fractional-order COVID-19 models proposed in this work are better than that of classical one when such comparisons are performed between them and some real data collected from Saudi Arabia's society. This inference together with the cases predictions that could easily deduced from the proposed fractional-order models can allow primary decision makers and influencers to set the right plans and logic strategies that should be followed to face this pandemic.
Article
Full-text available
Direction of arrival (DOA) estimation based on Maximum Likelihood is a common method in array signal processing, with many practical applications, but the huge amount of calculation limits the practical application. To deal with such an Maximum Likelihood (ML) DOA estimation problem, firstly, the DOA estimation model with ML for acoustic vector sensor array is developed, where the optimization standard in various cases can be unified by converting the maximum of objective function to the minimum. Secondly, based on the Invasive Weed Optimization (IWO) method which is a novel biological evolutionary algorithm, a new Improved IWO (IIWO) algorithm for DOA estimation of the acoustic vector sensor array is proposed by using ML estimation. This algorithm simulates weed invasion process for DOA estimation by adjusting the non-linear harmonic exponent of IWO algorithm adaptively. The DOA estimation accuracy has been improved, and the computation of multidimensional nonlinear optimization for the ML method has been greatly reduced in the IIWO algorithm. Finally, compared with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE) method and Tuna Swarm Optimization(TSO) algorithm, numerical simulations show that the proposed algorithm has faster convergence rate, improved accuracy in terms of Root Mean Square Error (RMSE), lower computational complexity and more robust estimation performance for ML DOA estimation. The experiment with tracking the orientation of the motorboat by Microelectronic mechanical systems (MEMS) vector hydrophone array shows the superior performance of proposed IIWO algorithm in engineering application. Therefore, the proposed ML-DOA estimation with IIWO algorithm can take into account both resolution and computation. which can meet the requirements of real-time calculation and estimation accuracy in the actual environment.
Article
Full-text available
Background While a COVID-19 vaccine protects people from serious illness and death, it remains a concern when and how to lift the high-cost and strict non-pharmaceutical interventions (NPIs). This study examined the joint effect of vaccine coverage and NPIs on the control of local and sporadic resurgence of COVID-19 cases. Methods Between July 2021 and January 2022, we collected the large-scale testing information and case number of imported COVID-19 patients from the website of the National Health Commission of China. A compartment model was developed to identify the level of vaccine coverage that would allow safe relaxation of NPIs, and vaccination strategies that can best achieve this level of coverage. We applied Monte Carlo simulation 50 000 times to remove random fluctuation effects and obtain fitted/predicted epidemic curve based on various parameters with 95% confidence interval at each time point. Results We found that a vaccination coverage of 50.4% was needed for the safe relaxation of NPIs, if the vaccine effectiveness was 79.3%. The total number of incidence cases under the key groups firstly strategy was 10 ³ times higher than that of accelerated vaccination strategy. It needed 35 months to fully relax NPIs if the key groups firstly strategy was implemented, and 27 months were needed with the accelerated vaccination strategy. If combined the two strategies, only 8 months are needed to achieve the vaccine coverage threshold for the fully relaxation of NPIs. Sensitivity analyses results shown that the higher the transmission rate of the virus and the lower annual vaccine supply, the more difficult the epidemic could be under control. When the transmission rate increased 25% or the vaccination effectiveness rate decreased 20%, 33 months were needed to reduce the number of total incidence cases below 1000. Conclusions As vaccine coverage improves, the NPIs can be gradually relaxed. Until that threshold is reached, however, strict NPIs are still needed to control the epidemic. The more transmissible SARS-CoV-2 variant led to higher resurgence probability, which indicates the importance of accelerated vaccination and achieving the vaccine coverage earlier. Graphical Abstract
Article
Full-text available
Objectives: Countries authorized the emergency use of oral antiviral agents in patients with mild-to-moderate COVID-19. We assessed the cost-effectiveness of introducing these novel oral antiviral agents to reduce the number of severe patients infected with SARS-CoV-2 and the burden of the medical systems. Methods: From the existing COVID-19 Epidemiology Model, we projected the number of people who require hospital/ICU admissions in Korea in 2022. Treatment scenarios included (i) all adults, (ii) elderly, and (iii) adult patients with underlying diseases administered molnupiravir or nirmatrelvir/ritonavir vis-a-vis standard care. Under the current health systems capacity, we calculate the incremental cost per severe patient averted and per net admission for each scenario relative to standard care. Results: An estimated, 236,510 COVID-19 patients would require hospital/ICU in Korea in 2022 with standard care. Nirmatrelvir/ritonavir (87% efficacy) is expected to reduce the number of severe patients requiring hospital/ICU admissions by 80%, 24%, and 17% (25%, 8%, and 4% by molnupiravir with 30% efficacy) when targeting all adults, adults with underlying diseases, and elderly patients, respectively. Administration of Nirmatrelvir/ritonavir may be cost-effective as 1,454, 8,878, and 8,964(whilemolnupiravirmaybelesslikelycosteffectiveas8,964 (while molnupiravir may be less likely cost-effective as 7,915, 28,492, 29,575) per severe patient averted if targeted respectively to the target group mentioned above, compared to standard care. Conclusion: In Korea, oral nirmatrelvir/ritonavir treatment of symptomatic COVID-19 patients can be highly cost-effective if targeted to elderly patients while substantially reducing hospital admission demand below the health systems capacity limit if all adult patients are targeted compared to standard care.
Article
Full-text available
We propose the Philippine Eagle Optimization Algorithm (PEOA), which is a meta-heuristic and population-based search algorithm inspired by the territorial hunting behavior of the Philippine Eagle. From an initial random population of eagles in a given search space, the best eagle is selected and undergoes a local food search using the interior point method as its means of exploitation. The population is then divided into three subpopulations, and each subpopulation is assigned an operator which aids in the exploration. Once the respective operators are applied, the new eagles with improved function values replace the older ones. The best eagle of the population is then updated and conducts a local food search again. These steps are done iteratively, and the food searched by the final best eagle is the optimal solution of the search space. PEOA is tested on 20 optimization test functions with different modality, separability, and dimension properties. The performance of PEOA is compared to 13 other optimization algorithms. To further validate the effectiveness of PEOA, it is also applied to image reconstruction in electrical impedance tomography and parameter identification in a neutral delay differential equation model. Numerical results show that PEOA can obtain accurate solutions to various functions and problems. PEOA proves to be the most computationally inexpensive algorithm relative to the others examined, while also helping promote the critically endangered Philippine Eagle.
Article
Full-text available
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.
Article
Cuckoo search (CS) has been proven to be one of the most efficient metaheuristic algorithms in solving global optimization problems. However, it suffers from a slow convergence speed and premature convergence, especially when the complexity of the problem increases. To address these shortcomings, a ranking-based adaptive cuckoo search algorithm, called RACS, is proposed in this paper. Specifically, a novel ranking-based mutation strategy is designed at first, which is inspired by the natural phenomenon that good species or individuals always contain good information and thus have better odds of guiding others. In the proposed ranking-based mutation strategy, the global search equation is modified in combination with a ranking-based vector selection method, where some of the parent vectors are proportionally selected according to their rankings. The higher ranking a parent vector obtains, the more opportunity it will be chosen. Secondly, a crossover operation with parameter adaptation is employed after the Lévy flights random walk to preserve some good elements of the current solutions from being changed. Furthermore, a replacement strategy is designed to update the solutions not improved through pre-determined cycles by exploiting the beneficial information from the discarded solutions saved in the external archive. To evaluate the comprehensive performance of RACS, extensive experiments are conducted on three well-known test suites and an application problem of identifying unknown parameters of fractional-order nonlinear systems. Simulation results demonstrate that the presented strategies bring a significant improvement in effectiveness and efficiency on CS. Besides, RACS is verified to be superior or at least comparable to other CS variants and state-of-the-art algorithms on most of the benchmark problems, and thus, can be regarded as a useful and promising technique for solving real-world complex optimization problems.
Article
The outbreak of coronavirus disease (COVID-19) and its accompanying pandemic have created an unprecedented challenge worldwide. Parametric modeling and analyses of the COVID-19 play a critical role in providing vital information about the character and relevant guidance for controlling the pandemic. However, the epidemiological utility of the results obtained from the COVID-19 transmission model largely depends on accurately identifying parameters. This paper extends the susceptible-exposed-infectious-recovered (SEIR) model and proposes an improved quantum-behaved particle swarm optimization (QPSO) algorithm to estimate its parameters. A new strategy is developed to update the weighting factor of the mean best position by the reciprocal of multiplying the fitness of each best particle with the average fitness of all best particles, which can enhance the global search capacity. To increase the particle diversity, a probability function is designed to generate new particles in the updating iteration. When compared to the state-of-the-art estimation algorithms on the epidemic datasets of China, Italy and the US, the proposed method achieves good accuracy and convergence at a comparable computational complexity. The developed framework would be beneficial for experts to understand the characteristics of epidemic development and formulate epidemic prevention and control measures.
Article
The stochastic global optimization (SGO) methods like particle swarm optimization (PSO), genetic algorithm (GA), and cuckoo search (CS) have been widely used in a variety of optimization problems partly because of the ability to find the global optimum. Most existing SGO algorithms are designed for gradient-free problems and ignore the gradient information even if the gradient is readily available, resulting in low efficiency and high computational cost. In this paper, we introduce a hybrid self-adaptive gradient-based cuckoo search (HAGCS) to tackle this limitation. HAGCS first takes a gradient-based local random walk to explore the search space, and then uses gradient-based local optimization (GBLO) to find a local minimum near to the current best solution, which is more efficient and precise than standard CS. Additionally, in order to avoid premature convergence potentially being caused by the use of the gradient, we introduce two novel self-adaptation and diversity promotion strategies onto HAGCS. These help HAGCS find proper control parameters and prevent HAGCS from getting stuck at local minima or stationary points. Lastly, we compare HAGCS with PSO, GA, CS, and 5 refinements of CS on 12 benchmark functions. Compared to the other methods, the experiment results show that the proposed method HAGCS has about 2 times faster convergence speed, higher accuracy, and 27.5% higher success rate of finding the global minimum in high-dimension problems. Even when the dimension of the problem is 1000, HAGCS still offers a success rate of 64% to find the global minima accurately.