In recent years, the use of renewable energy sources in micro-grids has become an effectivemeans of power decentralization especially in remote areas where the extension of the main power gridis an impediment. Despite the huge deposit of natural resources in Africa, the continent still remains inenergy poverty. Majority of the African countries could not meet the electricity demand of their people.Therefore, the power system is prone to frequent black out as a result of either excess load to the systemor generation failure. The imbalance of power generation and load demand has been a major factor inmaintaining the stability of the power systems and is usually responsible for the under frequency andunder voltage in power systems. Currently, load shedding is the most widely used method to balancebetween load and demand in order to prevent the system from collapsing. But the conventional methodof under frequency or under voltage load shedding faces many challenges and may not perform asexpected. This may lead to over shedding or under shedding, causing system blackout or equipmentdamage. To prevent system cascade or equipment damage, appropriate amount of load must beintentionally and automatically curtailed during instability. In this paper, an effective load sheddingtechnique for micro-grids using artificial neural network and adaptive neuro-fuzzy inference system isproposed. The combined techniques take into account the actual system state and the exact amount ofload needs to be curtailed at a faster rate as compared to the conventional method. Also, this methodis able to carry out optimal load shedding for any input range other than the trained data. Simulationresults obtained from this work, corroborate the merit of this algorithm.
Citation: Foday Conteh, Shota Tobaru, Mohamed E. Lotfy, Atsushi Yona, Tomonobu Senjyu. An effective Load shedding technique for micro-grids using artificial neural network and adaptive neuro-fuzzy inference system[J]. AIMS Energy, 2017, 5(5): 814-837. doi: 10.3934/energy.2017.5.814
Related Papers:
[1]
Shenglun Yan, Wanqian Zhang, Weiyuan Zou .
Multi-cluster flocking of the thermodynamic Cucker-Smale model with a unit-speed constraint under a singular kernel. Networks and Heterogeneous Media, 2024, 19(2): 547-568.
doi: 10.3934/nhm.2024024
[2]
Hyunjin Ahn .
Non-emergence of mono-cluster flocking and multi-cluster flocking of the thermodynamic Cucker–Smale model with a unit-speed constraint. Networks and Heterogeneous Media, 2023, 18(4): 1493-1527.
doi: 10.3934/nhm.2023066
[3]
Hyunjin Ahn .
Asymptotic flocking of the relativistic Cucker–Smale model with time delay. Networks and Heterogeneous Media, 2023, 18(1): 29-47.
doi: 10.3934/nhm.2023002
[4]
Hyunjin Ahn, Se Eun Noh .
Finite-in-time flocking of the thermodynamic Cucker–Smale model. Networks and Heterogeneous Media, 2024, 19(2): 526-546.
doi: 10.3934/nhm.2024023
[5]
Hyeong-Ohk Bae, Seung Yeon Cho, Jane Yoo, Seok-Bae Yun .
Effect of time delay on flocking dynamics. Networks and Heterogeneous Media, 2022, 17(5): 803-825.
doi: 10.3934/nhm.2022027
[6]
Hyunjin Ahn .
Uniform stability of the Cucker–Smale and thermodynamic Cucker–Smale ensembles with singular kernels. Networks and Heterogeneous Media, 2022, 17(5): 753-782.
doi: 10.3934/nhm.2022025
[7]
Young-Pil Choi, Cristina Pignotti .
Emergent behavior of Cucker-Smale model with normalized weights and distributed time delays. Networks and Heterogeneous Media, 2019, 14(4): 789-804.
doi: 10.3934/nhm.2019032
[8]
J. J. P. Veerman, B. D. Stošić, A. Olvera .
Spatial instabilities and size limitations of flocks. Networks and Heterogeneous Media, 2007, 2(4): 647-660.
doi: 10.3934/nhm.2007.2.647
[9]
Young-Pil Choi, Dante Kalise, Andrés A. Peters .
Collisionless and decentralized formation control for strings. Networks and Heterogeneous Media, 2025, 20(3): 844-867.
doi: 10.3934/nhm.2025036
[10]
Yipeng Chen, Yicheng Liu, Xiao Wang .
The critical delay of the consensus for a class of multi-agent system involving task strategies. Networks and Heterogeneous Media, 2023, 18(2): 513-531.
doi: 10.3934/nhm.2023021
Abstract
In recent years, the use of renewable energy sources in micro-grids has become an effectivemeans of power decentralization especially in remote areas where the extension of the main power gridis an impediment. Despite the huge deposit of natural resources in Africa, the continent still remains inenergy poverty. Majority of the African countries could not meet the electricity demand of their people.Therefore, the power system is prone to frequent black out as a result of either excess load to the systemor generation failure. The imbalance of power generation and load demand has been a major factor inmaintaining the stability of the power systems and is usually responsible for the under frequency andunder voltage in power systems. Currently, load shedding is the most widely used method to balancebetween load and demand in order to prevent the system from collapsing. But the conventional methodof under frequency or under voltage load shedding faces many challenges and may not perform asexpected. This may lead to over shedding or under shedding, causing system blackout or equipmentdamage. To prevent system cascade or equipment damage, appropriate amount of load must beintentionally and automatically curtailed during instability. In this paper, an effective load sheddingtechnique for micro-grids using artificial neural network and adaptive neuro-fuzzy inference system isproposed. The combined techniques take into account the actual system state and the exact amount ofload needs to be curtailed at a faster rate as compared to the conventional method. Also, this methodis able to carry out optimal load shedding for any input range other than the trained data. Simulationresults obtained from this work, corroborate the merit of this algorithm.
1.
Introduction
In the last decades, mathematical models have played a very important role on the study of the analysis of the spread of infectious diseases. One of those infectious diseases, is the acquired immunodeficiency syndrome (AIDS), which is caused by the infection with the human immunodeficiency virus (HIV). HIV continues to be a major global public health issue, having claimed more than 35 million lives so far. In 2017,940 000 people died from HIV-related causes globally. There were approximately 36.9 million people living with HIV, at the end of 2017, with 1.8 million people becoming newly infected in 2017 globally [29]. HIV is spread all over the world, however the World Health Organization African Region is the most affected region, with 25.7 million people living with HIV in 2017. The African region also accounts for over two thirds of the global total of new HIV infections [29]. In this context, numerous mathematical models have been proposed for HIV/AIDS transmission and other infectious diseases, but although they can incorporate important informations about the characteristics of epidemic outbreaks, many of them do not take into account the heterogeneity of the geographical landscape (see e.g. [14,15,22,23,25,26]). However, this geographical heterogeneity, which seems to represent a key factor in understanding the spreading of infectious diseases, can be studied through the complex networks approach, which combines dynamical systems with graph theory, in order to propose refined mathematical models.
Usually, a complex network is built by considering a graph, given by a set of vertices and a set of edges, and by coupling each vertex with an instance of a given dynamical system, which can be determined by a set of differential equations. Recent works have been devoted to complex networks for studying real-world applications, like neural networks [6,7,9,28], behavioral networks [4,5] or biological networks [18,19]. Other works have also been dedicated to the study of epidemiological problems and their relationship with social networks [13,20,21]. The effect of the topology of the graph, which is determined by the disposal of its edges, on the dynamics of the network and the possible synchronization state are widely studied [1,2,3,10], but it is still unknown for complex networks of nonidentical systems if one can find some topology that favors a particular dynamics.
In this paper, we propose an original model of complex network of nonidentical dynamical systems, in order to analyze the spread of epidemics within an heterogeneous geographical zone. To this end, we consider a recent HIV/AIDS model, proposed in [26], given by a system of ordinary differential equations, for which a basic reproduction number R0 can be determined. It has been proved in [27] that this refined model admits a disease-free equilibrium (DFE), which is globally asymptotically stable if R0<1, and an endemic equilibrium (EE), which is globally asymptotically stable if R0>1. Thus we construct a complex network by coupling nonidentical instances of the HIV/AIDS system proposed in [26], that is, multiple instances of the epidemiological system with distinct parameters values. We construct the complex network so that it can take into account the situation where a part of the population is not concerned with the migrations. Moreover, we assume that the displacements can be different in some places of the network, that migrations are instantaneous, and that individuals are not subject to an evolution from one compartment to another during migration from one node to another. Up to our knowledge, these assumptions are a novelty on the mathematical modeling of the spread of HIV/AIDS epidemics. We consider a graph G=(V,E), where the set of vertices V models the zones of high population concentration, and the set of edges E corresponds to human displacements among those separated zones. We focus on the situation where the set of vertices of the graph G is split into at least two subsets: the first subset being coupled with instances of the HIV model for which the basic reproduction number satisfies R0<1, thus admitting a unique equilibrium which is a DFE; and the second subset being coupled with instances of the HIV model for which R0>1, thus presenting the coexistence of a DFE and an EE. We address the following questions. Does the coupling between the two subsets of vertices create new equilibrium points?Is it possible to eliminate the endemic equilibriums with a suitable disposition of the couplings?If not, is it possible to minimize the propagation of the epidemic in the network by searching an optimal topology?
Those questions are of great interest, and still have not been deeply studied. Recently, it has been proved, in the particular case of a behavioral model [5], that oriented chains play an important role for reaching an expected equilibrium. Here, the equilibrium we aim to favor in the network is the DFE. The main goal of this paper is to find a topology for which the DFEs of a given subset of the network drive the whole network to a global DFE.
This paper is organized as follows. In Section 2, we recall the equations and stability results of the HIV/AIDS model proposed in [26] and analyzed in [27] that is considered in our study, and we improve the previous model by constructing a novel complex network model. In Section 3, we show that the complex network model is well-posed, by proving the existence of a positively invariant region that guarantees the non-negativity of the solutions, together with their boundedness and global existence. In Section 4, we explore the influence of the coupling on the equilibrium points of the network, by computing the global basic reproduction number for particular small networks, and prove under reasonable assumptions that the network admits a unique DFE which is globally asymptotically stable. A case study is considered in Section 5, where the HIV/AIDS epidemic in the Cape Verde archipelago is analyzed and relevant numerical simulations are presented. Moreover, the existence of an optimal topology minimizing the level of infection in the network is investigated. We end our paper with Section 6 with conclusions and discussion of possible future works.
2.
Problem statement
In this section, we recall the HIV/AIDS compartmental model, given by a system of differential equations firstly proposed in [26], which describes the transmission dynamics of HIV in a homogeneous population with variable size. In Subsection 2.2 we explicit the construction of a complex network determined with nonidentical instances of the previous HIV/AIDS model.
2.1. HIV/AIDS model
We consider a human population affected by a HIV/AIDS epidemics, from [26]. The total population is divided into four mutually-exclusive compartments: susceptible individuals (S); HIV-infected individuals with no clinical symptoms of AIDS (the virus is living or developing in the individuals but without producing symptoms or only mild ones) but able to transmit HIV to other individuals (I); HIV-infected individuals under ART treatment (the so called chronic stage) with a viral load remaining low (C); and HIV-infected individuals with AIDS clinical symptoms (A). The total population at time t, denoted by N(t), is given by
N(t)=S(t)+I(t)+C(t)+A(t).
The SICA model is given by a system of four ordinary differential equations that can be written as follows (see [27]):
We recall that system (2.1) admits a disease-free equilibrium (DFE) given by
Σ0=(S0,I0,C0,A0)=(Λμ,0,0,0).
(2.2)
We introduce the basic reproduction number R0, which represents the expected average number of new HIV infections produced by a single HIV-infected individual when in contact with a completely susceptible population, given by
Nonidentical instances of system (2.4) can be coupled with the vertices of a graph in order to give rise to a complex network, as we are going to see in the coming subsection.
2.2. Construction of the complex network
Let us consider a graph G=(V,E) made of a finite set V of n vertices, where n denotes an integer greater than 2, and a finite set E of m edges, where m denotes a positive integer. This graph models the geographical zone which is affected by the epidemics. We assume that V can be split into at least two subsets of vertices V1 and V2. We couple the vertices of V1 with an instance of system (2.4) for which R0<1, and the vertices of V2 with an instance of system (2.4) for which R0>1. The complex network is determined by the following non-linear and autonomous differential system:
and F determines the internal dynamic of each vertex:
F(X,P)=(f(x1,p1),…,f(xn,pn))T.
Furthermore, L is the matrix of connectivity, which is defined as follows. For each edge (k,j)∈E, k≠j, we have Lj,k>0. If (k,j)∉E, k≠j, we set Lj,k=0. The diagonal coefficients satisfy
Lj,j=−n∑k=1k≠jLk,j.
Finally, H is the matrix of the coupling strengths and it is given by
H=[εS0000εI0000εC0000εA],
with non negative coefficients εS, εI, εC and εA.
In this complex network model, we consider that an edge (k,j)∈E, k≠j, models a connection between two vertices k and j, which corresponds to human displacements from vertex k towards vertex j. Moreover, the parameter εS models the rate of susceptible individuals on vertex k which migrate towards vertex j. The parameters εI, εC and εA are defined analogously for the compartments I, C and A respectively. This implies that our model can take into account the situation where a part of the population is not concerned with the migrations. Additionally, each connection (k,j) is weighted by a positive coefficient Lj,k, which means that the displacements can be different in some places of the network. It is worth emphasizing that the migrations are assumed to be instantaneous, and that individuals are not subject to an evolution from one compartment to another during migration from one node to another.
Next we explicit the equations which describe the state of vertex j∈{1,…,n}:
where the time dependence is omitted, in order to lighten the notations. The coupling terms can be divided into fluxes exiting from vertex j and fluxes entering in vertex j, that is
In this section, we prove that the complex network problem (2.5) is well posed, and admits a positively invariant region. This property is obtained as a consequence of the conservation of the couplings terms in system (2.5), which corresponds to the fact that the matrix of connectivity L is a zero column sum matrix.
3.1. Preliminary results
We begin recalling two preliminary results. Since their proofs are well-known, we omit it.
Lemma 2.Let us consider the Cauchy problem
{˙ζ(t)=f(t)ζ(t)+g(t),t>t0,ζ(t0)=ζ0,
(3.1)
where f and g are two continuous functions defined on R, and t0∈R.We assume that g(t)≥0 for all t∈R, and that ζ(t0)≥0.Let ζ(t) be a solution of (3.1) defined on [t0,t0+τ]with τ>0, such that ζ(t0)≥0.
Then we have ζ(t)≥0, for all t∈[t0,t0+τ].
Lemma 3.Let ζ be a continuous function defined on [0,T], with T>0,continuously differentiable on ]0,T],and satisfying the differential inequality
˙ζ(t)+δ1ζ(t)≤δ2,0<t≤T,
with two positive coefficients δ1, δ2.
Then we have
ζ(t)≤[ζ(0)−δ2δ1]e−δ1t+δ2δ1,0≤t≤T.
3.2. Non-negativity of the solutions of the complex network problem
The next theorem guarantees the non-negativity of the solutions of the complex network problem (2.5), which is an obvious property to be satisfied for population dynamics models. Since the proof uses classical techniques [11,17], we only give the main steps.
Theorem 3.For any initial condition X0∈(R+)4n, the Cauchy problem
{X(t)=F(X,P)+LHX,t>0,X(0)=X0,
(3.2)
where F, P, L and H are defined as above (see Section 2.2),admits a unique solution defined on [0,T] with T>0, whose components are non-negative on [0,T].
Proof. Let us consider an initial condition X0∈(R+)4n. We denote by X(t,X0) the solution of the Cauchy problem (3.2), defined on [0,T] with T>0.
for each j∈{1,…,n}, where the coefficient γj corresponds to the fluxes exiting from node j, and is given by
γj=n∑k=1k≠jLk,j.
Let us denote by ˜X(t,X0) the solution of the auxiliary problem (3.3), stemming from the same initial condition X0∈(R+)4n, defined on [0,˜T].
Applying Lemma 2, we easily prove that the components of ˜X(t,X0) are non-negative. This implies that ˜X(t,X0) is also a solution of the Cauchy problem (3.2) on [0,˜T]. By uniqueness, we have ˜X(t,X0)=X(t,X0) for all t∈[0,T]∩[0,˜T]. Finally, it is seen that T=˜T, which achieves the proof.
3.3. Boundedness of the solutions of the complex network problem
Let us introduce the minimum mortality rate μ0 defined by
μ0=min1≤j≤nμj,
the positive coefficient Λ0 defined by
Λ0=n∑j=1Λj,
and the compact region
Ω={(xj)1≤j≤4n∈(R+)4n;4n∑j=1xj≤Λ0μ0}.
(3.4)
The total population in the complex network, defined by
N(t)=n∑j=1[Sj(t)+Ij(t)+Cj(t)+Aj(t)],t∈[0,T],
satisfies
˙N(t)≤−μ0N(t)+Λ0,t∈[0,T],
since the matrix of connectivity L is a zero column sum matrix. Applying Lemma 3 leads to
N(t)≤[N(0)−Λ0μ0]e−μ0t+Λ0μ0,t∈[0,T],
thus we obtain the following theorem.
Theorem 4.The region Ω defined by (3.4) is positively invariant under the flow inducedby the complex network (2.5).
Remark 1.It is easily seen that the positively invariant region Ω for the complex network problem (2.5) satisfies
n∏i=1Ωi⊂Ω,
where Ωi={(xj)1≤j≤4∈(R+)4;4∑j=1xj≤Λiμi} corresponds to the positively invariant region of the node (i) in absence of coupling. Roughly speaking, the couplings can enlarge the phase space of the flow induced by the network problem.
4.
Stability analysis of the complex network
In this section, we explore the effect of the couplings on the dynamics of the complex network (2.5). We use symbolic computational methods, in the case of small networks. Furthermore, we prove the existence of a unique disease-free equilibrium which is globally asymptotically stable.
4.1. Asymmetric two-nodes network
Let us consider a two-nodes networks, with one vertex (1) for which R0<1, another vertex (2) for which R0>1, and a directed connection from vertex (1) towards vertex (2) (see Figure 1). In that case, the matrix of connectivity is given by
L=[−L2,10+L2,10],
Figure 1.
Asymmetric two-nodes network, built with two nonidentical instances of system (2.1). The green node (1) is associated with an instance of system (2.1) for which the basic reproduction number R0 satisfies R0<1, whereas the red node (2) is coupled with an instance of system (2.1) for which R0>1.
where we omit the dependence in t in order to lighten our notations.
Roughly speaking, the coupling coefficient L2,1 acts on vertex (1) as if the mortality rate μ1 increases, which changes the value of the basic reproduction number on vertex (1). Thus the following question arises. How does R0 vary when L2,1 increases? Proposition 1 below partly answers this question.
First, we easily prove that system (4.1) admits a disease-free equilibrium point Σ0 given by
Proof. Let Fi(t) be the rate at which new infections appear in the i-th compartment and V+i(t) be the "individuals" transfer rate into the i-th compartment in all other ways. Similarly, let V−i(t) denote the "individuals" transfer rate out of the i-th compartment, for which
The basic reproduction number is given by the dominant eigenvalue of the matrix F0V−10, that is, R0 takes the value given by (4.3).
Remark 2.We emphasize that R0,1 and R0,2 correspond to the basic reproduction numbers of nodes (1) and (2) respectively, in absence of coupling (that is εS=εI=εC=εA=0). Thus, the expression R0=max(R0,1,R0,2) implies that if R0,1>1 or R0,2>1, then R0>1. In other words, the node admitting a basic reproduction number R0>1 drives the other node to a global Endemic Equilibrium (EE). It is a work in progress to generalize this pattern to more general topologies (e.g. chain networks). However, one should not conclude for the general case that the good solution is to "cut" the couplings (there may exist an optimal coupling topology which globally tempers the level of infected individuals, as we are going to show in Section 5 below).
We easily prove that R0,2 is an increasing function of L2,1. Indeed, we have
R0,2=kd1L2,1+d2d3L2,1+d4,
with k=N2D2μ2, d1=εS(Λ1+Λ2), d2=Λ2μ1, d3=εS and d4=μ1. Since d1d4−d2d3=μ1εSΛ1>0, we can conclude that R0,2 is an increasing function of L2,1. Figure 2(a) illustrates this increasing shape of R0,2 with respect to L2,1 for the following parameters values:
Figure 2.
Influence of the coupling on the basic reproduction numbers R0,1 and R0,2 of system (4.1) for different parameters values. R0,2 is an increasing function of the coupling strength L2,1 (a), whereas R0,1 can admit a maximum (b).
At the opposite, one can find parameters values for which R0,1 is a decreasing function of L2,1, but also other parameters values for which R0,1 is an increasing function of L2,1 in a neighborhood of 0. Figure 2(b) presents an example for which R0,1 admits a maximum with respect to L2,1; this example has been obtained for the following parameters values:
In parallel, the coupling strengths εS, εI, εC and εA, stored in matrix H (see section 2.2), are also observed to play an important role (see Figure 3). For the same set of parameters as above, and a frozen coefficient L2,1=0.15, we have computed the values of the basic reproduction numbers R0,1 and R0,2 with respect to a variation of εS, εI, εC and εA. It seems that R0,1 and R0,2 are robust to a variation of the coupling strengths εI and εA, whereas a variation of εS or εC can induce an important variation in R0,1 and R0,2, which can imply a change in the dynamics of both nodes in the complex network (4.1). Moreover, the coupling strengths εS and εC seem to play antagonistic roles, since an increase of εS provokes an increase of R0,2, whereas an increase of εC provokes an increase of R0,1.
Figure 3.
Influence of the coupling strengths εS, εI, εC and εA on the basic reproduction numbers R0,1 and R0,2 of system (4.1). A variation of εS or εC can induce a remarkable change in the values of R0,1 and R0,2 [(a), (c)]. At the opposite, R0,1 and R0,2 seem to be robust to a variation of εI or εA [(b), (d)].
Remark 3.After tedious symbolical computations, it is possible to obtain the expressions of the basic reproduction numbers in the case of a symmetric two-nodes network (see Figure 4). However, the output is unreadable, even with relevant simplifications of the parameters of the system.
In the same manner, it is possible to obtain the complete symbolical expression of the disease-free equilibrium Σ0 of a three-nodes chain (see Figure 5):
Similarly, the global basic reproduction number of a three-nodes chain reveals that the couplings coefficients L2,1 and L3,2 affect the dynamics of each node of the network, and are likely to produce undesirable phenomenon. But its nebulous expression seems to forbid any relevant interpretation. However, we are going to see in the next subsection, that the existence of a unique stable disease-free equilibrium for the network is guaranteed under reasonable assumption.
4.2. Disease-Free equilibrium of the complex network
Here, our aim is to overcome the computational difficulties met in the previous subsections. Thus we establish in the general case that the complex network (2.5) admits a unique stable disease-free equilibrium under reasonable assumption.
Theorem 5.The complex network (2.5) admits a unique disease-free equilibrium Σ0,which is globally asymptotically stable in the region Ω defined by (3.4),provided
The latter system is a linear system which can be written
BY=Λ,Y=(S1,…,Sn)T,Λ=(Λ1,…,Λn)T,
with B=B1−εSL, L being the matrix of connectivity defined as in Section 2.2, and B1 is a diagonal matrix storing the mortality rates, that is B1=diag{μ1,…,μn}. L being a zero column-sum matrix, it follows that B is a strictly diagonally dominant matrix. By virtue of Levy-Desplanques Theorem [12], B is an invertible matrix. Hence, system (4.9) admits a unique solution, which corresponds to the unique disease-free equilibrium Σ0 of the network problem (2.5).
Next, we introduce the Lyapunov functional V defined by
V=n∑i=1Vi,
where Vi is the Lyapunov function introduced in [27] (proof of Theorem 1), given by
Vi=k1,iIi+k2,iCi+k3,iAi,1≤i≤n,
where the coefficients k1,i, k2,i and k3,i are determined by (4.8). We compute the orbital derivative ˙V of the Lyapunov functional V along a solution X starting in Ω :
which guarantees that ˙V≤0, since we assume that Λ0μ0NiDi<1 for all i∈{1,…,n}.
Finally, it is seen that ˙V=0 if and only if Ii=Ci=Ai=0 for all i∈{1,…,n}. The conclusion follows from LaSalle invariance principle [16].
Remark 4.Since we have Λi≤Λ0 and μi≥μ0 for all i∈{1,…,n}, assumption (4.7) implies that
ΛiμiNiDi<1,1≤i≤n.
As it is relevant to introduce again R0,i=ΛiμiNiDi for each i∈{1,…,n}, it is seen that assumption (4.7) is a sufficient condition for the existence of a unique stable disease-free equilibrium in the network, which requires that every node in the network has a "small" basic reproduction number R0,i. If only one node violates this condition, then the network is likely to exhibit undesirable equilibrium states. In other words, Theorem 5 generalizes the pattern discovered with a two-nodes network in Proposition 1.
5.
A case study: Cape Verde archipelago
In this section, we study the case of Cape Verde archipelago, which has been affected by HIV/AIDS epidemics for several decades. Our aim is to determine a topology which could temper the spreading of the epidemics.
5.1. Geographical background
Cape Verde is an archipelago of 10 volcanic islands, located in the Atlantic Ocean, at about 570 kilometers from the Northwest African coast. Since 1 of those 10 islands has no inhabitants, we propose to model this archipelago with a 9 nodes network (Table 2) (see Figure 6 below). We assume that the network is divided into 3 groups of nodes: group 1 is composed with nodes 1, 2, 3, 4, 5, group 2 with nodes 6, 7, 8, and group 3 with single node 9, corresponding to Santiago island which is the most important island in the archipelago, with the greatest number of HIV infected inhabitants. The parameters values are given in Table 3. In absence of coupling, it is relevant to compute the basic reproduction number R0 for each group: R0≃0.914 for group 1, R0≃1.371 for group 2 and R0≃7.312 for group 3.
Table 2.
Cape Verde archipelago modeled by a 9 nodes complex network. Official 2015 data [24] are marked with a star. Other numerical data have been chosen arbitrarily.
Remark 5.The value of the basic reproduction number for group 3 implies that assumption (4.7) of Theorem 5 may not be fulfilled, which could lead to the emergence of undesirable equilibrium states, with a persistence of the infection within the population for instance. Thus it appears crucial to limit the spreading of the infection at a reasonable level, by finding a suitable topology of the network.
The coupling strengths are fixed as follows:
εS=0.02,εI=0.01,εC=0.01,εA=0.01,
in the case of weak coupling, or
εS=0.2,εI=0.3,εC=0.1,εA=0.3,
in the case of strong coupling. The initial condition X0 partially corresponds to official data: approximate values of the total population Nj(0) for each node (1≤j≤9) in 2015 can be found in [24], as well as approximate values of infected individuals Ij(0). The values of Cj(0) and Aj(0) have been assumed, so that the corresponding subpopulations are in proportionality with the total population.
5.2. Randomly generated topologies
The numerical integration on a finite time interval [0,T] of the complex network (2.5) modeling Cape Verde archipelago has been performed using the python language, in a GNU/LINUX environment. For each set of parameters, let us introduce the final level of infected individuals, given by
Lf=n∑j=1[Ij(T)+Cj(T)+Aj(T)].
(5.1)
In absence of coupling (see Figure 6(a)), we obtain Lf≃9112.77 with T=200, whereas the complete graph topology (see Figure 6(b)) leads to Lf≃9161.02. Since the couplings are likely to produce emerging equilibria, we propose to explore the possible topologies for the complex network modeling Cape Verde archipelago. The set of possible topologies being finite, there obviously exists an optimal topology minimizing the level of infection Lf. Thus our goal is to determine a near-optimal topology. However, it is easily seen that a 9 nodes network can admit at most 72 edges, assuming that there are no loops nor parallel edges. The total number of possible topologies is given by the sum of binomial coefficients
72∑k=1(72k)≃4.72.1021,
thus it is not reasonable to explore the total set of topologies. We propose to investigate a sample of randomly generated topologies, by choosing a random number of edges 1≤|E|≤72, and a random subset of |E| edges. We have computed the final level Lf of infected individuals for a sample of 1400 randomly generated topologies. The result is depicted in Figure 7, where each red cross has coordinates (Lf,|E|). The green dotted vertical line corresponds to the level of infected individuals for an empty topology.
Figure 7.
Numerical results for two samples of 1400 randomly generated topologies modeling Cape Verde (9 islands). The green dotted vertical line of equation x=9113 shows the level of infected individuals without coupling. The optimal topology is marked with a green circle. (a) Weak coupling: εS=0.02, εI=εC=εA=0.01. (b) Strong coupling: εS=0.2, εI=εA=0.3, εC=0.1.
We observe that the final level of infected individuals Lf varies a lot with respect to the number |E| of edges. It seems that a dense topology, with a number of edges neighbor to the maximal number 72, corresponding to the complete graph topology, produces a high level of infection. Meanwhile, a weakly dense topology is not a warranty for a low final level of infection. However, this random simulation has detected an optimal topology (marked with a green circle in Figure 7) for which the final level of infection is lesser than the benchmark Lf≃9113 obtained for an empty topology. Furthermore, we observe that the two clouds of points obtained for weak or strong coupling roughly admit similar shapes. In other words, the topology seems to be more important than the coupling strength.
5.3. Weakly dense topologies
The random simulation presented in the previous section seems to exclude dense topologies. The question of how to select a weakly dense topology, in order to temper the final level of infected individuals Lf remains delicate. Finally, we present the times series corresponding to two weakly dense topologies.
The first weakly dense topology we aim to analyze is a near-optimal topology detected by the random simulation (see Figure 6(c)); it admits a set of 14 edges, given by
The time series of the corresponding complex network are shown in Figure 8. The final level of infected individuals for that optimal topology is Lf≃9085.09.
The time series of the corresponding complex network are shown in Figure 9. The final level of infected individuals for that second weakly dense topology is Lf≃9087.50.
Remark 6.The numerical results presented in this section can help finding a favorable situation for limiting the level of infection in Cape Verde archipelago. Indeed, the results of the simulation of randomly generated topologies appear to exclude dense topologies, which means that one should avoid important human migrations from one island to another. In the mean time, weakly dense topologies (c) and (d) presented in Figure 6 seem to favor migrations stemming from islands admitting a small basic reproduction number. Nevertheless, those interpretations should be prudently nuanced, since they are the result of a mathematical model whose scope is necessarily limited.
6.
Conclusion
In this work, we presented the analysis of a complex network of dynamical systems for the study of the spread of HIV/AIDS epidemics. Built with nonidentical instances of a compartmental model for which a disease-free equilibrium and an endemic equilibrium can coexist, this complex network exhibits a positively invariant region and presents a unique disease-free equilibrium which is globally asymptotically stable, under the assumption that each node composing the network admits a small basic reproduction number. However, emerging equilibria are likely to appear if this assumption is not fulfilled, and we proposed a numerical strategy in order to detect a near-optimal topology for which the level of infection is minimized. This method has been applied to the case of the Cape Verde archipelago, and we exhibited a near-optimal topology which seems to be robust with respect to a variation of the coupling strength. However, it seems delicate to identify the characteristic features of such a near-optimal topology, since weakly dense topologies can produce a high level of infection as well as limit the infection at a low level.
In a future work, we aim to deepen this subtle question, which could lead to establishing a necessary and sufficient condition of synchronization in the network. In parallel, we propose to improve our model by applying an optimal control process, in order to reach a global disease-free equilibrium, in spite of the risk that a small group of nodes in the network could admit a high basic reproduction number. This control process could be introduced at a double scale, with control actions exerted into the dynamics of each node, and simultaneously control actions exerted along the connections of the network.
As a final perspective, we also intend to study of the effect of introducing delays in the migrations supported by the connections of the network, since it is likely to reveal new dynamics which might be hidden at this stage.
Acknowledgments
The authors are very grateful to the anonymous reviewers whose comments greatly improved the presentation of the paper.
This research was partially supported by the Portuguese Foundation for Science and Technology (FCT) within projects UID/MAT/04106/2019 (CIDMA) and PTDC/EEI-AUT/2933/2014 (TOCCATTA), co-funded by FEDER funds through COMPETE2020 – Programa Operacional Competitividade e Internacionalização (POCI) and by national funds (FCT). Silva is also supported by national funds (OE), through FCT, I.P., in the scope of the framework contract foreseen in the numbers 4, 5 and 6 of the article 23, of the Decree-Law 57/2016, of August 29, changed by Law 57/2017, of July 19.
Conflict of interest
The authors declare there is no conflict of interest in this paper.
References
[1]
Bakar NNA, Hassan MY, Sulaima MF, et al. (2017) Microgrid and load shedding scheme during islanded mode: A review. Renew S ust Energ Rev 71: 161-169. doi: 10.1016/j.rser.2016.12.049
[2]
Laghari JA, Mokhlis H, Bakar AHA, et al. (2013) Application of computational intelligence techniques for load shedding in power systems. Energy Convers Manage 75: 130-140. doi: 10.1016/j.enconman.2013.06.010
[3]
Pushpanjali M, Sujatha MS (2015) A novel multi objective under frequency load shedding in a micro-grid using genetic algorithm. Int J Advan Res Electri Electro Instru Eng 4: 5037-5038.
[4]
Kaffashan I, Mortezaee SMTM, Amraee T (2016) A robust under voltage load shedding scheme against voltage. Turk J Electr Eng Comp S ci 24: 3310-3311.
[5]
Hooshmand R, Moazzami M (2012) Optimal design of adaptive under frequency load shedding using artificial neural networks in isolated power system. Int J Elec Power 42: 220-228. doi: 10.1016/j.ijepes.2012.04.021
[6]
Boland J, Burdett R, Edwards C (2015) Optimization techniques for planning automatic under frequency load shedding in New Zealand's power system. Anziam J 57: M3-M4.
[7]
Suwanasri C, Suwanasri T, Prachuab N (2013) Load shedding control strategy in an electric distribution system. GMS RAN Int J 7: 47-52.
[8]
Moazzami M, Morshed MJ, Fekih A, et al. (2016) A new optimal unified power flow controller placement and load shedding coordination approach using the hybrid imperialist competitive algorithm-pattern search method for voltage collapse prevention in power system Int J Elec Power 79: 263-274.
[9]
Aponte EE, Nelson JK (2006) Time optimal shedding for distributed power systems. IEEE T Power S yst 21: 269-277. doi: 10.1109/TPWRS.2005.857826
[10]
Das K, Nitsas A, Altin M, et al. (2016) Improved load shedding scheme considering distributed generation. IEEE T Power Delivery, 1-4.
[11]
Malekpour AR, Seifi AR, Hesamzadeh MR, et al. (2008) An optimal load shedding approach for distribution networks with DGs considering capacity deficiency modelling of bulked power supply. World Academic S ci Eng Tech 22: 825-826.
[12]
Marzband M, Moghaddm MM, Akorede MF, et al. (2016) Adaptive load shedding scheme for frequency stability enhancement in micro-grids. Electr Pow S yst Res 140: 78-86. doi: 10.1016/j.epsr.2016.06.037
[13]
Tahir MF, Tehzeeb-ul-Hassan, Saqib MA (2016) Optimal scheduling of electrical power in energy-deficiency scenarios using artificial neural network and bootstrap aggregation. Int J Elec Power 83: 49-53. doi: 10.1016/j.ijepes.2016.03.046
[14]
Kuriakose E, Francis F (2013) Enhancement of power system stability by optimal adaptive under frequency load shedding using artificial neural networks. Int J Advan Res Electri Electro Instru Eng 2: 12-20.
[15]
Amooshahi H, Rahmat-Allah H, Khodabakhshian A, et al. (2016) A new load-shedding approach for micro-grids in the presence of wind turbines. Electr Pow Compo S ys 44: 1-11. doi: 10.1080/15325008.2015.1091861
[16]
Koohi-Kamali S, Rahim NA (2016) Coordinated control of smart micro-grid during and after is landing operation to prevent under frequency load shedding using energy storage system. Energ Convers Manage 127: 623-646. doi: 10.1016/j.enconman.2016.09.052
[17]
Laghari JA, Mokhlis H, Karimi M, et al. (2015) A new under-frequency load shedding technique based on combination of fixed and random priority of loads for smart grid applications. IEEE T Power S yst 30: 2507-2515. doi: 10.1109/TPWRS.2014.2360520
[18]
Sapari NM, Mokhlis H, Laghari JA, et al. (2017) Load shedding scheme based on frequency and voltage stability for islanding operation of distribution network connected to mini-hydro generation. Turk J Electr Eng Co 25: 1852-1863. doi: 10.3906/elk-1601-111
[19]
Karimi M, Mohamad H, Mokhlis H, et al. (2012) Under-Frequency load Shedding scheme for islanded distribution network connected to mini-hydro generation. Electrical Power Energy S ystems 42: 127-138. doi: 10.1016/j.ijepes.2012.03.017
[20]
Khezri R, Golshannavaz S, Vakili R, et al. (2017) Multi-layer fuzzy-based under-frequency load shedding in back-pressure smart industrial microgrids. Energy 132: 96-105. doi: 10.1016/j.energy.2017.05.059
[21]
Dragomir OE, Dragomir F, Stefan V, et al. (2014) Adaptive neuro-fuzzy inference systems as a strategy for predicting and controlling the energy produced from renewable sources. Energies 8: 13047-13061.
[22]
Bhatnagar S, Chopra S, Bhati S, et al. (2015) Under frequency load shedding using adaptive neuro-fuzzy inference system. IJEEE 7: 99.
[23]
Lakra P, Kirar M (2015) Load shedding techniques for system with cogeneration: A review. ELELIJ 4: 83-96. doi: 10.14810/elelij.2015.4307
[24]
Khamis A, Shareef H, Mohamed A, et al. (2015) A load shedding scheme for DG integrated islanded power system utilizing backtracking search algorithm. Ain S hams Eng J, 2-3.
[25]
Swetha GC, Sudarshana RHR (2017) Voltage stability assessment in power network using artificial neural network. Int J Advan Res Electri Electro and Instru Eng, 7993-8002.
[26]
Kuriakose E, Francis F (2017) Enhancement of power system stability by optimal adaptive under frequency load shedding using artificial neural networks. Int J Advan Res Electri Electro Instru Eng, 12-20.
Table 2.
Cape Verde archipelago modeled by a 9 nodes complex network. Official 2015 data [24] are marked with a star. Other numerical data have been chosen arbitrarily.