Professional Documents
Culture Documents
Calculations
1. Sampling of States
2. Evaluation of States
This step consists of determining whether the load of all buses can be
satisfied given the status of generators and transmission lines.
3. Estimation of Indices
Reliability indices are estimated from the repeated use of steps 1 and 2.
The stopping criterion is based on the coefficient of variation being less
than a specified value.
210
3. If no area has a negative margin (capacity - load), then the simulation
proceeds to the next hour, otherwise the state evaluation module is
called.
4. If all area loads are satisfied, then the simulation proceeds to the next
hour. If there is a loss of load in one or more areas then this is counted
as loss of load for those areas and the system and area loss of load
magnitudes are computed.
Convergence of results:
Let Ii = value of reliability index obtained from simulation data for year
i
and
_____
SI = √(S2/N)
211
where
N _
S = ∑ ( Ii - I )2 /N
2
i=1
_
Note that standard dev of I , varies as the inverse of square root of N.
Clearly, SI can never be made zero in practice and so the computed
value of reliability indices (mean or expected values) will always
contain some uncertainty. The goal here is to reduce the uncertainty in
the computed reliability indices to an acceptable level and to
understand the degree of uncertainty that remains. The NARP model
stops until one of the following criteria is satisfied.
2. If the load in each area can be satisfied by the capacity in each area
together with the feasible scheduled transfers determined in step 1, then
further computation is not required, otherwise go to step 3.
212
3.First, the net injections are assigned to each area:
Mi = injection at bus i
= margin in area i
The network flow model is called to determine the loss of load. The line
flows calculated in this step are algebraically added to line flows
calculated in step 1.
Bθ=M
213
where B matrix is such that
if i ≠ j
If the flows are within the tie capacity constraints, then a feasible flow
has been found otherwise the program proceeds to the next stage to find
a feasible flow.
subject to:
B θ + G +C =D
214
G ≤ Gmax
C≤D
F ≤ Ff
-F ≤ Fr
S ≤ Smax
where
Ci = ith element of C
F= vector of flows
215