Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Parameters:
Lower and upper limits for voltage angle at Bus
.
NOMENCLATURE
Indices:
,
Variables:
,
in p.u.
Number of iteration.
in p.u.
in p.u.
Matrices:
Admittance matrix.
Susceptance matrix.
Manuscript received January 13, 2012; revised May 10, 2012 and June 18,
2012; accepted June 30, 2012. Date of publication July 30, 2012; date of current
version January 17, 2013. Paper no. TPWRS-00044-2012.
The authors are with the School of Electrical and Computer Engineering,
University of Tehran, Tehran, Iran (e-mail: m.khanabadi@alumni.ut.ac.ir;
h.ghasemi@ut.ac.ir; m.doostizadeh@alumni.ut.ac.ir).
Digital Object Identifier 10.1109/TPWRS.2012.2207464
Conductance matrix.
Admittance angle matrix.
,
KHANABADI et al.: OPTIMAL TRANSMISSION SWITCHING CONSIDERING VOLTAGE SECURITY AND N-1 CONTINGENCY ANALYSIS
I. INTRODUCTION
HE open access transmission plays a vital role in competitive electricity markets. As in these markets, it is always
desirable to transmit power to all parts of network without violating system security constraints. The electrical power that can
be transmitted between two locations in a network is limited
by several security criteria such as voltage limits, lines thermal
limits and stability limits. When power cannot be transmitted
to a part of network because of violating one or more of the
mentioned security criteria, the system is said to be congested
and consequently market power problem is likely to occur [1].
When congestion occurs, the most economical generation units
cannot be fully dispatched to meet the demand. Thus, expensive
generators have to be dispatched instead which would lead
to market inefficiency. Therefore, congestion problem in a
transmission system should be addressed, which is typically
handled by means of transmission congestion management
schemes. These schemes are mostly based on conventional
optimal power flow (OPF) with objective functions such as [2]:
minimizing the number of control actions;
minimizing the cost of re-dispatch [3];
minimizing the deviations between pre and post-dispatch
systems.
As one of the important and suitable solutions for congestion management, optimal network reconfiguration has
been employed by operators to improve operating conditions.
Generally, two types of switches are used for this purpose;
sectionalizing switches and tie switches, which are normally
closed or normally open, respectively. From time to time, the
network operators change the state of these switches in order
to enhance system security. The network switching can be
classified into two main categories [4]: 1) opening or closing
branches and 2) substation switching.
Since 1980, some research work has been conducted on using
switching for network reconfiguration. Switching was first introduced in [5], in which it was used as a tool for preventive control actions. The authors in [6] have used corrective switching
to relieve line overloading. Switching actions such as load shedding and network switching are formulated as a mixed-integer
problem (MIP) [7]. In [8], DC load flow and line outage distribution factors have been used to determine the line switching that
would eliminate network congestions without making overloads
in other parts of the system. The busbar reconfiguration is also
utilized to solve the branch overload problem [9]. The z-matrix
method is employed in [10] for finding the most influential lines
to be switched to resolve overloading problems.
The authors in [11] have employed the fuzzy set algorithm to
construct preventive and corrective switching actions in distribution network. In [12], in order to reconfigure and balance load
at a distribution system, a heuristic algorithm is used. In [13], a
sensitivity matrix is used to find which line(s) switching has the
highest impact on overloaded line(s). A discrete optimization
algorithm has been employed in [14] to find optimal switching
actions which alleviate overloads while avoiding potential overvoltage conditions. In [15], the authors have proposed a method
which uses analytical equivalence of corrective switching for a
systematic search to enhance system security. Reference [16]
543
544
certain levels. The line or lines that should be switched are determined by means of an ACOPF:
(1)
s.t.
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
where the voltage angle at each bus could change between
and
. Also,
,
and
is obtained from following equations:
(10)
KHANABADI et al.: OPTIMAL TRANSMISSION SWITCHING CONSIDERING VOLTAGE SECURITY AND N-1 CONTINGENCY ANALYSIS
545
s.t.
(11)
(14)
(15)
(16)
(17)
(18)
(19)
(12)
(20)
The results of this optimization problem determine which line
or lines have to be outaged.
III. SOLUTION METHOD
The TS problem formulated in the previous section is an
MINLP problem. It should be noted that available solvers for
MINLP problems, in particular BARON and DICOPT, do
not perform well to solve the proposed problem, in terms of
computational time and convergence characteristics [23]. Also,
in this case, the solution might not be a global one. To avoid
this issue, more practical search algorithms such as Benders
decomposition [24] have to be employed. Therefore, Benders
decomposition approach which has been used widely [25][29]
is applied here to solve the MINLP problem.
The first stage in Benders decomposition is a mixed integer
linear problem denoted as master problem and the second one
is a nonlinear subproblem. The master problem determines
system configuration and active power generation of each unit
(Fig. 1). Although line active power flow limits are checked
in the master problem, bus voltage limits and reactive power
distribution in power system are not considered in the master
problem. Therefore, the subproblem checks the feasibility
of the master problem solution from the viewpoint of AC
constraints. Then, violations could be relieved by adjusting the
power generation of existing units or modifying the list of lines
to be switched previously determined in the master problem.
It should be noted that this approach is incapable of finding
TS actions which are feasible and provide cost saving in ACOPF
perspective while being infeasible and/or not providing cost
saving in the DCOPF formulation. Note that these indicate the
cases that for instance, in the AC model, one line is loaded
very close to its limit while being overloaded in the DC model.
System operators usually use security margins, e.g., 5% to account for errors in models and data; therefore, these cases would
be likely to be filtered out. The TS subproblem consists of two
main blocks as shown in Fig. 2. The TS feasibility check examines the master problem solution to find whether a feasible TS
solution can be found in the base case. Furthermore, the subcontingencies.
problem performs security analysis for
More details about master problem and subproblems are provided in the following subsections.
(21)
is the subproblem cost at iteration
where
;
and
are the fixed values calculated by master
; and
in (18) and (19) is a large
problem at iteration
positive multiplier greater than or equal to
[21]. Note that when
, the value of
is not important
would impose a zero power flow on Line
whereas
(17) while allowing different angles on lines both ends using
(18) and (19).
The first term of the objective function (13) represents the
operation cost. The second one means, through the real variable
, the feasibility cost due to an underestimation of the subproblem cost (system losses). The (21), referred to as Benders
linear cut, couples master problem and subproblem by updating
through
and
at each iteration. The formulation uses
specifying which line or lines have to be
binary variables
outaged from the test system to relieve congestion. Besides, in
order to keep the system reliability on an acceptable level, the
number of lines connected to each bus is restricted to be higher
than or equal to two after any switching action. Note that for a
bus with only two connections, losing a connection would drastically reduce its reliability. Mathematically, one has
(22)
in which
B. Subproblem Formulation
As it was discussed earlier, TS subproblem consists of two
stages, TS feasibility check and security analysis:
1) Feasibility Check: It tests the feasibility of master
problem solution. This stage is an NLP problem and its objective function is
(23)
s.t.
(24)
546
(25)
(26)
(27)
where
and
are positive slack variables.
and
are the fixed value calculated by master problem. The other
constraints for this optimization problem are the same as (3) and
(5)(12). Note that the solution obtained for the NLP problem
may not be a global solution due to the non-convex, non-linear
nature of the problem. Also, if the solver is not able to find
a solution, it does not necessarily means that the problem is
infeasible.
The solution to the subproblem provides Lagrangian coeffiand dual values
in the current iteracients
and
are used in the benders cuts formulation
tion. Then,
in the following iteration (21). In this subproblem, transmission
flow and bus voltage violations are relieved by adjusting active
, Benders cut (21)
and reactive power injections. When
will be formed and added to Master problem. The subproblem
cuts are updated in each iteration leading to an update in the
master problem solution; this iterative procedure continues until
converged solution is obtained. The problem convergence criterion is defined as follows:
(28)
where is a small positive number adjusted by the user. The
lower the , the higher the accuracy and the program extra time.
2) Security Analysis: The solution of TS feasibility check
subproblem has to be checked from the viewpoint of system
security. At this stage, AC security criteria are tested for the
contingencies. The criteria include voltage levels and
is
AC line flows. For this purpose, a binary parameter
introduced to model each transmission lines status in Continrepresents the loss of Line in Contingency
gency .
:
if
(29)
if
This binary parameter is multiplied by admittance matrix and
consequently transmission line outages have been modeled
using a for loop over set of lines.
The objective of this stage is to solve a set of power flow
problems. This can be done based on Newton-Raphson method
by minimizing real and reactive power mismatches while representing voltage and flow limits. The feasibility cost is thus
minimized based on notation used in [26]:
(30)
,
,
, and
are positive slack
where
variables which model fictitious generation in each bus in order
to make the power flow equations feasible. The corresponding
constraints are
(31)
(32)
(33)
and
are the bus voltage and apparent power flow
where
after applying contingency , respectively.
Here, (30)(33) represent an LP problem which are used in
an iterative method yielding power flow solution. The iterative
method is as follows:
Step 1) Calculate Jacobian sub-matrices and the initial bus
and
based on the values
mismatches
calculated in the previous subproblem.
Step 2) Use an LP solver to minimize the objective function
(30) subject to the corresponding constraints.
, ,
, and
using calculated
Step 3) Update
and
.
Step 4) Stop the process, if the objective function is smaller
than a threshold and the mismatches are less than a
specified value. Otherwise, go to Step 2.
If for a specific contingency, the objective function (30) is
higher than the specified threshold after several iterations, it
means that the contingency does not pass the security analysis check. Therefore, the set of identified lines for switching
is invalid and should be removed from the search space. This
can be done by adding a new inequality constraint (34) to the
master problem. This new constraint prevents the program from
giving the previously identified invalid set of candidate lines for
switching:
(34)
where is the set of candidate lines leading to insecure system
conditions. In rare conditions, it is possible that by opening one
or more lines in addition to the lines in , the contingency
would pass the security analysis check. However, from practical point of view, the system operator has to open one line at a
time (not all identified lines simultaneously). Therefore, since
would lead to an insecure condiopening the set of lines
tion, they should be removed from the search space which is
addressed by (34).
IV. IEEE 57-BUS TEST SYSTEM
The feasibility of the mentioned method has been tested in the
IEEE 57-bus test system. System data for this test system is provided in [30] and bid information is given in the Appendix. In
this system, there are 7 generators along with 80 transmission
lines. Also, the system provides 1250.8 MW active power to
serve the loads. Here, both Gen. 1 and Gen. 8 have lower marginal prices compared to other generation units. Hence, these
generators are economical generation units and it is desirable
to fully dispatch without violating any security criteria. In this
section, first, based on the gathered bid information from generators, an ACOPF is run to identify the transmission congestion in the system. The results indicate that Lines 115, 89 and
729 are congested resulting in utilizing more expensive generators to meet the demand. In order to relieve congestion, the TS
problem has been utilized in two different forms: TS based on
DCOPF and TS based on proposed method with AC constraints.
The TS based on DCOPF has been used widely in the literature;
therefore, we here used it as well to demonstrate its shortcoming
and the necessity of checking AC constraints.
KHANABADI et al.: OPTIMAL TRANSMISSION SWITCHING CONSIDERING VOLTAGE SECURITY AND N-1 CONTINGENCY ANALYSIS
547
Fig. 3. Bus voltages for TS with AC constraints; the IEEE 57-bus test system.
TABLE I
DISPATCH RESULTS FOR PRE AND POST-TS SYSTEMS BASED
ON DCOPF; THE IEEE 57-BUS TEST SYSTEM
TABLE II
DISPATCH RESULTS FOR PRE AND POST-TS SYSTEMS WITH
AC CONSTRAINTS; THE IEEE 57-BUS TEST SYSTEM
A. TS Based on DCOPF
The problem is formulated as an MIP with binary variables
[19], [20] and is solved in BARON. The results indicate that
Lines 115, 729, 89, 2238, and 4849 are selected as candidate lines that have to be switched (opened) to remove transmission congestion problem. The results of opening these lines
are provided in Table I. By opening the mentioned lines, the
cheaper generators are dispatched to higher levels. Therefore,
the total generation cost has been decreased from $19 021/h to
$14 835/h. Also, the LMP at some buses will be lower compared to the case that congestion exist. Although this method
successfully removes congestion and dispatches as more economical units as possible, the system security is jeopardized. By
opening the identified lines in an AC power flow program, the
results show that this system would experience a voltage collapse, i.e., the solution diverges, which is not acceptable from
the viewpoint of the system operator.
B. TS With AC Constraints
In this part, TS is formulated as described in Section III and is
solved using Benders decomposition method. The results yield
that Lines 115 and 34 are identified as the ones to be outaged
in order to remove congestion while respecting security and AC
constraints across the system. The impact of TS is investigated
by means of some system variables such as generation dispatch,
system losses, LMP variations and voltage profile. Note that
only two lines (as opposed to five lines in the DCOPF case)
are selected as candidate lines for switching since opening more
number of lines would lead to insecure system.
1) Generation Dispatch and Losses: Table II shows the results of generation dispatch and total generation cost before and
548
Fig. 4. LMP variations at some load buses; the IEEE 57-bus test system.
TABLE III
LMP VARIATIONS; THE IEEE 57-BUS TEST SYSTEM
Fig. 5. Block diagram to find a priority list for opening candidate lines.
TABLE IV
GENERATION DISPATCH; THE IEEE 57-BUS TEST SYSTEM
WITH VOLTAGE BAND BEING
KHANABADI et al.: OPTIMAL TRANSMISSION SWITCHING CONSIDERING VOLTAGE SECURITY AND N-1 CONTINGENCY ANALYSIS
549
TABLE V
SYSTEM DISPATCH RESULTS; THE IEEE 300-BUS TEST SYSTEM
TABLE VI
SUPPLY BIDDING INFORMATION; THE IEEE 57-BUS TEST SYSTEM
550
[25] Y. Fu, M. shahidehpour, and Z. Li, Security-constrained unit commitment with AC constraints, IEEE Trans. Power Syst., vol. 20, no. 3, pp.
15381550, Aug. 2005.
[26] Y. Fu, M. shahidehpour, and Z. Li, AC contingency dispatch based
on security-constrained unit commitment, IEEE Trans. Power Syst.,
vol. 21, no. 2, pp. 897908, May 2006.
[27] M. Shahidehpour and Y. Fu, Benders decomposition, IEEE Power
and Energy Mag., vol. 3, no. 2, pp. 2021, Mar. 2005.
[28] M. Shahidehpour and V. Ramesh, Nonlinear programming algorithms
and decomposition strategies for OPF, IEEE/PES Tutorial on Optimal
Power Flow..
[29] H. Ma and M. Shahidehpour, Transmission constrained unit commitment based on benders decomposition, Elect. Power Energy Syst., vol.
20, no. 4, pp. 287294, Apr. 1998.
[30] Power System Test Case Archive, Univ. Washington, Dept. Elect.
Eng., 2007. [Online]. Available: https://www.ee.washington.edu/research/pstca/pf57/pg tca14bus.htm.
[31] D. S. Kirschen and G. Strbac, Fundamentals of Power System Economics. Chichester, U.K.: Wiley, 2004.
[32] Power System Test Case Archive. [Online]. Available: http://khorshid.ut.ac.ir/ h.ahmmadi/download.htm.