Maximizing Power System Loadability by Optimal Allocation of SVC Using Mixed Integer Linear Programming
Maximizing Power System Loadability by Optimal Allocation of SVC Using Mixed Integer Linear Programming
+ +
+ 2 2
2 2
2 2
PV
T
PV
V A T = (7)
where
A Bus incidence matrix
A Modified A matrix all elements of -1 set to zero
PV
A Bus incidence matrix corresponding to PV buses
+
PQ
A Modified A matrix corresponding to PQ buses all
elements of -1 set to zero
PQ
A Modified A matrix corresponding to PQ buses all
elements of +1 set to zero
R Diagonal matrix of line resistance
X Diagonal matrix of line reactance
H Diagonal matrix of bus charging and compensating
susceptance
2
T Diagonal matrix of line transformer tap values squared
GL
P Vector of bus active power injection (generation minus
consumption)
GL
Q Vector of bus reactive power injection
2
V Vector of bus voltage magnitude squared
2
PV
V Vector of PV bus voltage magnitude squared
2
PQ
V Vector of PQ bus voltage magnitude squared
p Vector of active power flow at line receiving end
q Vector of reactive power flow at line receiving end
l Vector of active power loss in each line
m Vector of reactive power loss in each line
k Vector of composite variables, one for each line
The bus incidence matrix A (not to be confused with the
constraint matrix in (3)) is a matrix of size
br bus
n n which
describes branch connections in the system. Each branch in
the system has a corresponding index and it is assumed that
each branch also has an associated direction which is
arbitrarily set. For example, an entry in the A matrix could be
as follows: for a given system where line number five leaves
bus number three and enters bus number six
35
A would have a
value of 1 and
65
A will have a value of -1. Elements not
associated with a bus or branch remain as zero so that the
incidence matrix is almost always sparse.
Equations (5) and (6) above describe the real and reactive
power balance in a system with respect to line power flows
and losses and power generated at each bus. Equation (7)
relates to the line voltage drop equations in a system. In a
3
given system there will be exactly
bus
n equations in each of
(5) and (6) and
br
n equations in (7). The formulas for
calculating l , mand k are given below:
ij
j
ij ij
ij
r
v
q p
l
2
2 2
+
=
(8)
ij
j
ij ij
ij
x
v
q p
m
2
2 2
+
=
(9)
( )
2 2
2
2 2
ij ij
j
ij ij
ij
x r
v
q p
k +
+
=
(10)
where subscripts i and j indicate sending end and receiving
end buses respectively.
III. SVC ALLOCATION PROBLEM FORMULATION
A. Steady State SVC Model
The focus of this paper will be on the optimal placement of
SVCs. For the problem formulation an SVC is modelled in
steady state as a variable shunt susceptance. This model is
shown in the two bus transmission line diagram of Fig 1.
Modeling the SVC as a voltage regulating reactive power
source will be done in the next step of this ongoing work.
Fig. 1. Ideal model of SVC installed at bus j
The variable vectors and with lengths of
bus
n are
used in the formulation. For the purpose of SVC placement,
j
is a binary integer variable which when set to 1 indicates
an SVC located at bus j . The variable
j
is the compensating
susceptance setting at bus j . For the rest of this paper the
notation will represent the element-wise multiplication of
these two vectors.
B. MILP Constraint Equations
Equations (11)-(13) describe the line power flow and
voltage equations as equality constraints. As in [13] a load
multiplier or loadability factor denoted by is introduced,
which describes the increase in active and reactive loads. The
objective of the optimization is to maximize the load which
can be supplied, or in other words to maximize .
0
2
= + + +
L G
P P GM l A V S p A (11)
0
2
= + +
L G
Q P GM m A V H q A (12)
0
2
1
2
2
1
= + + k V CM q X p R (13)
where
G G
Q P , Vectors of generator active and reactive power
generations
L L
Q P , Vectors of bus active and reactive power
consumptions
GM Coefficient matrix to adjust dimensions of the
G
P
and
G
Q vectors
CM Coefficient matrix combining the effects of terms
(
T
PQ
T
PQ
A A T
+
+
2
) and (
T
PV
A T
2
) in equation (7)
Due to the linear nature of the formulation non-linear
equations (8)-(10) cannot be represented as they are. Through
algebraic manipulations linear relationships can be obtained
from these equations:
0 = m R l X (14)
0 = + k m X l R (15)
To introduce an SVC at a given bus in the form of a
variable shunt impedance, alterations must be made to the H
matrix of equation (12). This H matrix is diagonal and each
diagonal element
j
h corresponds to the sum of line charging
susceptances
2
ij
y
of every branch connected to bus j . With
the addition of an SVC the compensating susceptance must
also be added to form a new element
j
h . Effectively the bus
shunt susceptance value becomes:
j j j j
h h + =
(16)
Substituting (16) into (12) gives:
0
2 2
= + + V Q P GM m A V H q A
L G
(17)
The term
2
V represents the element-wise multiplication
of
2
V and . This quadratic product must be converted to
linear relationships for a MILP formulation. This is done by
using the limits of
2
V to obtain two linear inequality
constraints:
0
2
max
2
+ + V Q P GM m A V H q A
L G
(18)
0
2
min
2
+ + V Q P GM m A V H q A
L G
(19)
For this approximated relationship it is assumed that only
buses lacking reactive power in steady state require
compensation so that only capacitive compensation is required
4
and the value of is always positive.
The non-linear element-wise product of and integer
vector can be replaced by four linear constraints following
the binary variables theorem [16]. The product of is
represented by the variable z and the constraints are as
follows:
0
max
z
(20)
0
min
+ z
(21)
min min
z
(22)
max max
+ + z
(23)
Equations (11), (13)-(15) and (18)-(23) represent the linear
constraints represented by equation (3) of the MILP problem.
The vector x contains variables as follows:
{ } z k m l Q P V q p x
G G
T
, , , , , , , , , , ,
2
=
This vector of variables is subject to the bounds in (2). The
vector is a vector of binary integer variables.
It should be noted that additional constraints on the limits of
p and q exist:
2 2
max
2
max T
R q p + (24)
where
T
R is the transmission line thermal ratings. This non-
linear constraint is implemented here by searching for
solutions iteratively. Each iteration,
max
p and
max
q are
reduced for lines which violate this constraint.
Additional constraints may be added from a practical
perspective:
max
N A , { }
bus
n N ,..., 2 , 1 , 0
max
=
(25)
max
C z A
(26)
where
max
N is the maximum allowed device number and
max
C is the maximum investment cost. Vector is the
associated investment costs at each bus. These constraints,
(25) and (26) limit the device numbers and total investment
costs respectively. For this initial study the investment
constraints are not yet considered and will be investigated in
ongoing work.
C. Objective Function
The objective function in this optimization problem is to
maximize , the loadability factor. This objective function is
defined as:
( )
= z x f max
(27)
It has been shown that for a given system loadability does not
improve beyond a certain limit produced by a number of well
located devices [3, 13]. This limit was found in [13] by
iteratively adjusting the device number limits and observing
the point where loadability begins to level off. By introducing
the additional term