Lecture Note2
Lecture Note2
the bad or likely trouble cases from the full outage case list is not an exact
procedure and has been the subject of intense research for the past 15 years.
Two sources of error can arise.
1. Placing too many cases on the short list: this is essentially the “conservative”
approach and simply leads to longer run times for the security analysis
procedure to execute.
2. Skipping cases: here, a case that would have shown a problem is not placed
on the short list and results in possibly having that outage take place and
cause trouble without the operators being warned.
If n is a large number, the PI will be a small number if all flows are within
limit, and it will be large if one or more lines are overloaded. The problem then
is how to use this performance index.
Various techniques have been tried to obtain the value of PI when a branch
is taken out. These calculations can be made exactly if n = 1; that is, a table
of PI values, one for each line in the network, can be calculated quite quickly.
The selection procedure then involves ordering the PI table from largest value to
least. The lines corresponding to the top of the list are then the candidates for
the short list. One procedure simply ordered the PI table and then picked the
top N, entries from this list and placed them on the short list (see reference 8).
However when n = 1, the PI does not snap from near zero to near infinity
as the branch exceeds its limit. Instead, it rises as a quadratic function. A line
that is just below its limit contributes to PI almost equal to one that is just
over its limit. The result is a PI that may be large when many lines are loaded
just below their limit. Thus the PI’S ability to distinguish or detect bad cases
is limited when ti = 1. Ordering the PI values when n = 1 usually results in a
list that is not at all representative of one with the truly bad cases at the top.
Trying to develop an algorithm that can quickly calculate PI when n = 2 or
larger has proven extremely difficult.
One way to perform an outage case selection is to perform what has been
references 9 and 10). Here, a decoupled power flow
called the I P l Q tiic~t/~od(see
is used. As shown in Figure 11.10, the solution procedure is interrupted after
one iteration (one P - c) calculation and one Q - Vcalculation; thus, the name
1 P1 Q). With this procedure, the PI can use as large an n value as desired, say
n = 5. There appears to be sufficient information in the solution at the end of
.
Begin power flow solution
Full outage
case list
J=====+ L
Model outage case
I
the first iteration of the decoupled power flow to give a reasonable PI. Another
advantage to this procedure is the fact that the voltages can also be included
in the PI. Thus, a different PI can be used, such as:
where AIEil is the difference between the voltage magnitude as solved at the
end of the l P l Q procedure and the base-case voltage magnitude. A/(E("""is a
value set by utility engineers indicating how much they wish to limit a bus
voltage from changing on one outage case.
To complete the security analysis, the PI list is sorted so that the largest PI
appears at the top. The security analysis can then start by executing full power
flows with the case which is at the top of the list, then solve the case which is
second, and so on down the list. This continues until either a fixed number of
cases is solved, or until a predetermined number of cases are solved which do
not have any alarms.