Approach To Automatic Contingency Selection by
Approach To Automatic Contingency Selection by
Authorized licensed use limited to: PONTIFICIA UNIVERSIDADE CATOLICA DO RIO DE JANEIRO. Downloaded on November 27, 2009 at 11:03 from IEEE Xplore. Restrictions apply.
As a contingency that causes a line MW overload M - 1 is a specialised linear programming model.
problem may not necessarily cause a bus voltage According to the dual theory, we can derive the condi-
problem, and vice versa, both problems should be studied tions for optimality. For convenience, we define the rela-
simultaneously. Two different rankings can be carried out tive cost Cij = C i j + ni - n j , where n is the dual variable
separately, based on the decoupling of the real and reac- (node parameter). Then, the complementary slackness
tive power in power systems. The existing methods for conditions for optimality [6] can be written as
solving these two problems are quite different. To form a
unified ranking model and algorithm with Reference, 6, = L i j for Cij > O (5)
we use the same form of the performance index to study Cij = O for Lij <fij < Uij (6)
the voltage ranking method.
Let Qg be the total reactive load in the precontingency f i j = U i j for Cij < O (7)
state, which is the sum of reactive power in all load Eqns. 5-7 correspond to three ‘in-kilter’ states of arc. In
branches. In the branch outage, if all the reactive loads addition, there exist six’ out-of-kilter’ states that do not
remain at precontingency values, the voltage at some satisfy eqns. 5-7. If all arcs are in kilter, then the optimal
buses and the reactive flow in some branches (which are solution is obtained; otherwise, we should vary the flows
associated with bus voltages) could violate their security or potentials (node parameter n) by a labelling technique
constraints. In other words, if the contraints are satisfied, to bring the out-of-kilter states into in-kilter states of arc.
the reactive power supply may be limited. Consequently, In comparison with a general algorithm of the
the reactive load may be curtailed or additional reactive minimum cost flow, the features of OKA are:
sources (local compensation) may need to be installed. (i) the lower bound of flows may be nonzero
The more severe the contingency is, the greater the (ii) the initial flow does not need to be a feasible or
amount the load needs to be curtailed. Hence we define a zero flow
new performance index using the total reactive load cur- (iii) non-negative constraints,hj 2 0, are not necessary
tailment to evaluate the relative severity of continency, (iv) it is easy to imitate the change of the network
i.e. topology, by changing the values of flow bound.
Qg - QDK(I)
PI&) = x 100% (1) 3.2 Network model of reactive power
Q: A power system is a particular network which consists of
where Q D K ( I ) is the reactive power in load branch k as generation, transmission and load arcs. The reactive
line I outage appears, the value of which is calculated power optimisation model for the contingency selection
using the reactive optimisation model (see Section 3.2). is proposed as follows:
To build a list of ACS, an appropriate threshold value
of P I , need be stipulated (e.g. 7%). Thus the slight con- minF,= IAV,l
jsNT
tingencies are filtered.
The form of eqn. 1 is the same as PI,(() (for real types) such that
i-w
Qci + j-w
QTj
in Reference 6.
+ C Q D k = O w e n , k ~ N D (9)
k-rw
3 Mathematical model
M - 2< -
Qci d QGi d Qci i E N G ( i # N L ) (10)
3.1 Brief statement of OKA model
For a network with n nodes and m arcs of a minimum -
QTj QTj QTj j E N T ( j # N L ) (11)
cost flow problem, we can transform the original network
into an OKA network by introducing a ‘return arc’ from AV, d AV,,,, (12)
sink node t to source node s, and the internal flows QDK
- d QDK d QDK k E N D (k # N L ) (13)
remain unchanged. The return arc flowf,, equals the orig-
inal network flow r. The OKA network model is shown
in Fig. 1, and its mathematical model [12, 131 can be
written as where, Q G i , QDk are the reactive power of generation
(concluding compensation capacitor), transmission and
min F = CijAj load branch, respectively; i, j , k are their corresponding
ijsm+l
subscript. The positive direction of reactive power flows
M -
{
1 such that c(fij
ien
-fji) =0 i E n (3) is specified when the power enters the node, while the
negative is specifed when the power leaves the node. N G ,
(Lijdfij d uij i j ~ m1+ (4) N T and N D represent the corresponding number of the
three arcs, i.e. the set of indices i , j , k . The total number of
nodes is n. Q and Q are the lower and upper bound of the
original network
(n nodes m arcs)
reactive power, respectively. The symbol i + w represents
that branch i is adjacent to node w . N L represents the set
of outage branches. I AV, I is the absolute value of voltage
=
,f
-r
A drop in the line j .
Fig. 1 O K A network model The objective function F , is the sum of branch voltage
drops that are associated with, and hence reflect, the
whereLj is the flow in arc ij, Lij and U i j is its lower and node voltage deviations. The voltage drop in branch j
upper bound, respectively; C i j is the arc cost per unit can be expressed by [141
flow; F is a cost function; n is the total number of nodes;
m is the total number of arcs (or branches) in the return
arc; i , j are the terminals of line i j , respectively.
66 I E E PROCEEDINGS-C, Vol. 138, NO. 1, J A N U A R Y I991
Authorized licensed use limited to: PONTIFICIA UNIVERSIDADE CATOLICA DO RIO DE JANEIRO. Downloaded on November 27, 2009 at 11:03 from IEEE Xplore. Restrictions apply.
where R j , X j , P T j and Q T j is the resistance, reactance, revised ; using the labelling technique, when an incremen-
real a d reactive power flow in branch j , respectively; VTj tal loop of flow exists the arc flow fij in this loop is
is the rated voltage of line j and can be set equal to 1 in varied; if there is no incremental loop, the values of n at
P.u.; then eqn. 15 can be written as unlabelled nodes, are varied, and cij
is changed; once the
arc state has been revised, go back to step (2).
A Y = P T jR j + Q T j X j (16)
for reactive power optimisation, the real power P , and 4.2 Analogue of branch outage
parameter R j are kept constant. Thus, to minimise The outage simulation is an important problem in ACS.
-
the objective xjcNT I A 5 1 is equivalent to minimising In general, the outages of the generating units or loss of
loads need a modification of the bus injection vector. For
L j e N T IQTjXjl.
Eqn. 9 is the reactive power balance equation for each the line outage case, the base-case admittance matrix has
node: Eqns. 1&13 are the inequality constraints of the to be modified. In network flow programming, it is pos-
corresponding variables. The inequality constraint of the sible to imitate the contingencies in the same manner for
reactive power flow in the return arc in an O K A network various outages, depending on whether a load or a gener-
is given in eqn. 14. Eqn. 14 is redundant, as it is incorpo- ating unit is regarded as a branch or a transmission line.
If an element is in outage, the flow in the corresponding
rated in eqn. 13.
On deleting the P T jR j component in the voltage drop, branch is zero. It is obtained by setting the upper and
eqn. 16, the inequalities of eqn. 11 and 12 can be com- lower bound of the flow in that line to zero. The imita-
bined. Hence we have tion of the multiple branch outage is treated in the same
way. Hence, this is a more straightforward and easier
method than the general methods.
4.3 Selection of factor k,
It should be pointed out that the voltage drops in It is very important to select the factor kj as it effects the
branches differ in value significantly for different configu- proper filtering and ranking of contingencies.
rations and R / X ratios of the networks as well as the The value of kj is obtained by the following experi-
performance of the power systems. It is quite difficult to mental formula:
specify a value of AY,,, for every branch which can
properly reflect the node voltage deviations. The values
of AY,,, determine the feasible domain of the opti-
kj = J(3)
misation problem directly. If the value of AF,,, is too
large, it could lead to the filtering out of some critical
-
Here, AY,,, can be specified to be 4 5%. If AV: z 0,
we assume AV: = E (a small positive value) to calculate
contingency, caused by a wide band of the reactive power factor k j .
flow restriction. O n the other hand, if AV,,,, is set too As an exception, in the radial network with homoge-
small, then some 'no problem' contingencies could not be neous line ( R / X = constant) and almost the same power
filtered out. For the reasons mentioned above, instead of
AY,,,, we adopt the voltage drop AV: in branch j ,
based on the power flow of the normal state multiplied
-
factor (cos $), we use AV,,,, directly, and set its value
equal to 1 3% in an approximate calculation for con-
tingency selection.
by a factor kj i.e.
4.4 Numerical examples
AV,,,, = kjAVg (18) The proposed ACS technique, including the network flow
The optimisation model M - 2 can be rewritten as model and its algorithm, are examined with IEEE 5-bus,
14-bus, 30-bus, 57-bus and 118-bus test systems on
M-340. The value of AV,,,, for calculating factor kj is
5%. The threshold value of the performance index P I ,
for filtering is 7%. The numerical results solved by the
O K A are given in Tables 1-3.
Authorized licensed use limited to: PONTIFICIA UNIVERSIDADE CATOLICA DO RIO DE JANEIRO. Downloaded on November 27, 2009 at 11:03 from IEEE Xplore. Restrictions apply.
Table 3: Computational time of several systems China for the financial assistance in support of this
project.
~~
Authorized licensed use limited to: PONTIFICIA UNIVERSIDADE CATOLICA DO RIO DE JANEIRO. Downloaded on November 27, 2009 at 11:03 from IEEE Xplore. Restrictions apply.