Next Article in Journal
Method of Early Detection of Cyber-Attacks on Telecommunication Networks Based on Traffic Analysis by Extreme Filtering
Next Article in Special Issue
Stochastic Mixed-Integer Programming (SMIP)-Based Distributed Energy Resource Allocation Method for Virtual Power Plants
Previous Article in Journal
Optimization Design of the Impeller Based on Orthogonal Test in an Ultra-Low Specific Speed Magnetic Drive Pump
Previous Article in Special Issue
Multi-Site Photovoltaic Forecasting Exploiting Space-Time Convolutional Neural Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fault Current Constraint Transmission Expansion Planning Based on the Inverse Matrix Modification Lemma and a Valid Inequality

1
Korea Power Exchange, Jeollanam-do 58322, Korea
2
Department of Electrical and Computer Engineering, Pusan National University, Busan 46241, Korea
*
Author to whom correspondence should be addressed.
Energies 2019, 12(24), 4769; https://doi.org/10.3390/en12244769
Submission received: 24 October 2019 / Revised: 29 November 2019 / Accepted: 5 December 2019 / Published: 13 December 2019

Abstract

:
In the transmission expansion planning (TEP) problem, it is challenging to consider a fault current level constraint due to the time-consuming update process of the bus impedance matrix, which is required to calculate the fault currents during the search for the optimal solution. In the existing studies, either a nonlinear update equation or its linearized version is used to calculate the updated bus impedance matrix. In the former case, there is a problem in that the mathematical formulation is derived in the form of mixed-integer nonlinear programming. In the latter case, there is a problem in that an error due to the linearization may exist and the change of fault currents in other buses that are not connected to the new transmission lines cannot be detected. In this paper, we use a method to obtain the exact updated bus impedance matrix directly from the inversion of the bus admittance matrix. We propose a novel method based on the inverse matrix modification lemma (IMML) and a valid inequality is proposed to find a better solution to the TEP problem with fault current level constraint. The proposed method is applied to the IEEE two-area reliability test system with 96 buses to verify the performance and effectiveness of the proposed method and we compare the results with the existing methods. Simulation results show that the existing TEP method based on impedance matrix modification method violates the fault current level constraint in some buses, while the proposed method satisfies the constraint in all buses in a reasonable computation time.

Graphical Abstract

1. Introduction

Because electricity is difficult to store economically, and it can only be delivered through transmission lines, transmission networks must be expanded in proportion to the increase in electricity demand. Even though the expansion of a transmission network provides positive effects, such as reduction of congestion, an increase in system reliability, and a reduction of transmission loss, a side effect of fault current increase (especially near large metropolitan areas) occurs due to the decrease in the impedance of the overall system [1].
Most of the widely used methods solve this problem by splitting buses, installing additional equipment such as a superconducting current limiter, or upgrading the circuit breaker with a higher breaking capacity. However, one of the more fundamental solutions to solve this problem is to consider the fault current level during transmission expansion planning (TEP), which is the main topic of this paper.
In general, the capacity of a circuit breaker is chosen to be greater than the three-phase line-to-ground fault current, which is calculated as the pre-fault voltage divided by the Thévenin equivalent impedance. In power system optimization problems with short time horizons, such as the optimal power flow or security constraint unit commitment, it can be assumed that the network configuration is fixed, and the fault current can be considered as linear constraint or upper bound on the bus voltage magnitude [2,3,4]. However, in a problem with a relatively long time horizon, it becomes mathematically challenging to consider the fault current in the optimization problem, because the bus impedance matrix is continuously changing.
Research on the TEP problem that considers fault current has been published only recently, and there are two reasons why the fault current has not been studied in the TEP problem in the past. The first is that the commercially available circuit breaker has a sufficient breaking capability margin, compared to the fault current possible in the system, and the second is that the computational burden has been too large to account for the fault current in the TEP problem. There is limited research on the fault current in the TEP problem [5,6,7,8]. The most important feature of these studies is summarizing how to reduce the calculation burden due to updating the system matrix (the bus impedance matrix), which is essential for calculation of the fault current.
For example, in order to overcome this problem, previous research used a metaheuristic algorithm such as the genetic algorithm (GA), removed infeasible cases by applying the Benders cut, or simplified the problem by linear approximation. However, the GA algorithm has a problem in that it cannot reproduce the same results due to the inherent randomness of the algorithm, not to mention its slow convergence [5]. Additionally, methods based on Benders decomposition must solve the problem repeatedly until infeasible cases do not occur, and hence, the number of iterations required to find the optimal solution increases exponentially as the number of candidates for the new transmission line increases [6]. In the linear approximation method, even though the method can find the solution in a relatively short period of time, there is a disadvantage in that the calculation result of the fault current may differ significantly from the actual value due to the model error brought about by the linearization process [7,8]. As a result, most of the existing methods have a problem in that the calculation time is too slow or the accuracy is too limited to be applied to an actual large-scale power system. It should be noted that our study is confined to the balanced fault such as three-phase line-to-ground fault. For power systems where the unbalanced faults are dominant, such as distribution systems, special methods are employed to calculate power flow and fault current, as described in [9,10].
Therefore, the main purpose of this paper is to propose a more exact and efficient method to solve the TEP problem with a fault current level constraint based on the inverse matrix modification lemma (IMML) and a valid inequality. The proposed method consists of the following two steps.
The first is to efficiently calculate the diagonal terms of the bus impedance matrix, which is the Thévenin equivalent impedance of the system [11], and this bus impedance matrix should be recalculated repeatedly during the optimization process. In the existing research [7], a linearized and simplified version of the nonlinear impedance update equation is used to formulate the resulting optimization problem into mixed integer linear programming (MILP) form. The authors of [7] concluded that the normalized root mean square (RMS) error of about 2–3% due to linearization is a minor problem from a practical standpoint. However, in some power systems, such as those in South Korea, where the margins between the fault current and the circuit breaking capability are very narrow, more exact calculation of the fault current is required. Another problem with the method used in [7] is that it cannot guarantee the accuracy of the fault current calculation results at other buses to which the new transmission lines are not connected directly.
In this paper, in order to avoid these problems, the updated bus impedance matrix is calculated from the inversion of the bus admittance matrix. As will be explained in the following sections, this method does not require the nonlinear update equation for calculating the bus impedance matrix, and therefore, the overall optimization problem can be formulated as a MILP optimization problem without linearization. Additionally, the fault currents at the other buses to which the added transmission line is not directly connected can also be calculated without error.
The disadvantage of this method is obviously that the inverse of the bus admittance matrix must be calculated repeatedly in the search for the optimal solution to the TEP problem. In order to mitigate the computational burden of computing the inverse of the bus admittance matrix at every step to find the optimal solution to the TEP problem, we apply the inverse matrix modification lemma (IMML) and the valid inequality.
Due to the nature of the TEP problem, only a part of the transmission network is slightly changed during the search for the optimal solution. Therefore, it has a structure that is well suited to applying the well-known IMML, which can help to calculate the inverse of the bus admittance matrix efficiently [12]. A linear update equation for the diagonal terms of the bus impedance matrix will be explained in detail in the later sections.
Even though the time to calculate the updated impedance can be reduced greatly by using the IMML, the overall computation time to find the optimal solution to the TEP problem still becomes intractable as the number of candidates for new transmission lines increase. Thus, in this paper, we have devised a new method based on a valid inequality to reduce the feasible area of the problem. The valid inequalities are generated every search step during the optimization and added as additional inequality constraints to branch-and-cut (B&C) algorithm to reduce the feasible search region. As shown in the simulation section, the combination of the IMML and the proposed valid inequality can find the optimal solution to the TEP problem with consideration of the fault current very accurately in a reasonable calculation time.
The rest of this paper is organized as follows: Section 2 explains the MILP formulation of the TEP problem with the fault current level constraint. The method used for the solution in this study, based on the B&C algorithm, and the suggested valid inequality method are explained in Section 3. The proposed method is applied to IEEE Reliability Test System with 96 buses (RTS-96), which is frequently used in studies for the TEP problem. The simulation results and the concluding remarks are summarized in Section 4 and Section 5, respectively. Nomenclature describes of all parameters and variables used in this paper.

2. Mathematical Formulation

2.1. Objective Function

The objective function used in this paper has a form similar to that used in the general TEP problem, which is composed of generator operation cost, transmission line construction cost, and salvage value of the transmission lines, as follows:
M I N   J = t T s S g G f g ( P g t , s , g ) × t d s ( 1 + d r ) t + t T ( i , j ) i , j I C i , j × ( x l t , i x l t 1 , i ) ( 1 + d r ) t 1 t T ( i , j ) i , j I C i , j × ( x l t , i x l t 1 , i ) ( 1 + d r ) T × ( l i f e i , j T + t 1 ) l i f e i , j
where f g ( )   is the linearized generation cost function given as follows:
f g ( P g t , s , g ) = { b g P g t , s , g + c g i f x g t , s , g = 1 0 i f x g t , s , g = 0
which can be further simplified into the following equation:
f g ( P g t , s , g ) = b g P g t , s , g + c g x g t , s , g

2.2. Fault Current Constraints

2.2.1. Conventional Method for the Bus Impedance Update

Generally, the three-phase line-to-ground fault current can be calculated by the following equation:
V f p r e Z t h f = I f
where V f p r e and Z t h f are the pre-fault voltage and Thévenin equivalent impedance at bus f , respectively. Since Thévenin equivalent impedance is the same as the corresponding diagonal element of the bus impedance matrix Z if the pre-failure voltage is assumed to be 1.0 (pu), the three-phase line-to-ground fault current constraint in the TEP problem can be expressed as follows [13]:
| Z t , f , f n e w | 1 I f , m a x   for   f N f , t T
where Z t , i , j n e w is the (i,j)th element of bus impedance matrix Z t n e w in year t.
In the existing study, the following update equation is used to calculate each element of the bus impedance matrix after the transmission lines are added [7,8]:
1 Z i , i n e w = 1 C F A ( 1 Z i , i o l d + i , j N l 1 Z i , j n e w C F B × x l t , i )
Z i , i n e w 1 I i m a x
where C F A and C F B are the coefficients for linearization, which can be calculated using the following equations:
C F A = 1 C F 1 1 C F 2   ,   C F B = 1 Z j , j o l d Z i , j n e w
C F 1 = ( Z i , j o l d ) 2 Z i , i o l d Z j , j o l d + Z i , i o l d Z i , j n e w , C F 2 = 2 Z i , j o l d Z i , i o l d + Z j , j o l d + Z i , j n e w
In order to improve the computational speed in the process of applying the above equations, the existing studies [7,8] assume that the off-diagonal elements of the bus impedance matrix are negligibly smaller than the diagonal elements ( | Z i , j o l d | | Z i , i o l d | ), and the diagonal elements of the bus impedance matrix before the update are significantly smaller than the impedance of the new transmission lines that will be connected to the buses ( | Z i , i o l d | | Z i , j n e w | ). Hence, the values of C F A and C F B in Equation (8) are all assumed to be 1. This method has an advantage in that the computational burden for calculating the fault currents can be largely reduced, however, there is a problem in that it is impossible to consider the changes in the fault currents occurring on buses to which the new transmission lines are directly connected. Additionally, as the number of new transmission lines increases, the calculation error is cumulative.

2.2.2. Derivation of the Bus Impedance Update Equation Based on the IMML

In this paper, we adopt a method to directly calculate the bus impedance matrix by inversion of the bus admittance matrix of the new system with the added transmission line, as follows:
Z t n e w = ( Y t n e w ) 1
It is obvious that the calculation time will significantly increase due to the curse of dimensionality if the system becomes larger. Therefore, it is essential to calculate the inverse matrix more effectively to incorporate the fault current constraint (or Equation (5)). In order to find the optimal solution to the TEP problem, a new transmission network configuration for the next search step is constructed by adding one new transmission line to the network configured in the previous search step. The bus admittance matrix of the next search step will have almost the same value, and only small number of elements in the admittance matrix is changed from the bus admittance matrix of the previous step. Therefore, the following inverse matrix modification lemma can be applied in a very straightforward manner to acquire the updated bus impedance matrix.
The so-called Woodbury equation of the IMML can be described as the following generic equation [12]:
( A + U C V ) 1 = A 1 A 1 U ( C 1 + V A 1 U ) 1 V A 1
If Δ Y , the variation of the admittance matrix Y , can be decomposed into the product of three matrices, or M δ y M T , the new admittance matrix, Y n e w , can be expressed as follows:
Y n e w = Y o l d + Δ Y = Y o l d + M δ y M T
where δ y is the variation of matrix Y (m × m), M is the connection matrix (n × m), n is the number of total buses and m is the number of modified buses. Here, time index t is omitted for simplicity.
By applying the Woodbury equation of the IMML to Equation (12), a new impedance matrix, Z n e w , can be obtained as follows:
Z n e w = ( Y o l d + M δ y M T ) 1 = Z o l d Z o l d M c M T Z o l d
c = ( δ y 1 + z ) 1 = δ y ( I + z × δ y ) 1
z = M T Z o l d M
where Z o l d is the impedance matrix of the previous optimization step. In order to eliminate the unnecessary inverse operation, Equation (14) is replaced with the following equation:
δ y = c ( I + z × δ y )
Here, we apply an extra assumption that only one new transmission line can be added to the existing bus in order to derive a more compact formulation for Equation (16). In case that more than one transmission line should be added to a bus, the above assumption is still valid since we can insert a dummy bus between the new transmission line and the existing bus with small reactance between the buses. Therefore, most of the elements in matrix Y are not changed except for the corresponding elements of the pair of the buses to which the new transmission line candidate is connected. Thus, δ y can be expressed as the following equation:
δ y = [ δ y 1 , 1 δ y 1 , 2 δ y 2 , 1 δ y 2 , 2 0 0 0 0 0 0 0 0 0 0 0 0 δ y i , i δ y i , j δ y j , i δ y j , j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ] [ m   ×   m ]
= [ δ y A , A δ y A , B δ y B , A δ y B , B ] [ m   ×   m ] =   [ δ y A , A 0 0 δ y B , B ] [ m   ×   m ]
where δ y A , A and δ y B , B are [(m − 2) × (m − 2)] and [2 × 2] matrices, respectively. Furthermore, the following equations can be obtained by substituting Equation (18) into Equation (16) with appropriate partitioning:
[ δ y A , A 0 0 δ y B , B ] [ m   ×   m ] = [ c A , A c A , B c B , A c B , B ] [ m   ×   m ] ( [ I 0 0 I ] [ m   ×   m ] + [ z A , A z A , B z B , A z B , B ] [ m   ×   m ] [ δ y A , A 0 0 δ y B , B ] [ m   ×   m ] )
or
c A , A ( I + z A , A δ y A , A ) + c A , B z B , A δ y A , A = δ y A , A
c B , A ( I + z A , A δ y A , A ) + c B , B z B , A δ y A , A = 0
c A , B ( I + z B , B δ y B , B ) + c A , A z A , B δ y B , B = 0
c B , B ( I + z B , B δ y B , B ) + c B , A z A , B δ y B , B = δ y B , B
Without loss of generality, by appropriate indexing and simple matrix manipulation, we can define subscript A as the set of buses where the transmission line is constructed, and subscript B as the set of buses where the transmission line is not constructed, which means that all elements of δ y B , B in Equation (19) will be zero. Then the following equations can be easily derived from Equation (20) through Equation (23):
c A , A ( I + z A , A δ y A , A ) = δ y A , A
c B , A ( I + z A , A δ y A , A ) = δ y B , A
c A , B = c B , B = 0
It should be noted that both Equation (24) and Equation (25) should be regarded as nonlinear, because they contain terms in the production of two variables: c and δ y . In this paper, we apply the following algorithm, which has the same effect as the above equations, so that the resulting optimization problem becomes a MILP formulation.
If x l j = 1 , then:
c i , j r e + k N l ( c i , k r e × z δ y k , j r e c i , k i m × z δ y k , j i m ) = δ y i , j r e   f o r   i , j N l
c i , j i m + k N l ( c i , k r e × z δ y k , j i m + c i , k i m × z δ y k , j r e ) = δ y i , j i m     f o r   i , j N l ,
And if xlj = 0, then:
c i , j r e = 0 ,   c i , j i m = 0   f o r   i , j N l
In the above equations, z δ y r e and z δ y i m denote the real and imaginary parts of the product of matrix z and matrix δ y , respectively. All logic expressions in the above are implemented using the indicator constraint option of the CPLEX solver incorporated in the General Algebraic Modeling System (GAMS) [14]. Once all the elements of c are calculated using Equations (27)−(29), they can be entered into Equation (12), and the equation to calculate the diagonal element of the new bus impedance matrix (or the Thévenin equivalent impedance) is derived as follows:
Z f , f n e w = Z f , f o l d i N l { Z f , i o l d j N l ( c i , j × Z j , f o l d ) } f N f
Generally, the reactance is more dominant than the resistance of the transmission line, thus, it can be assumed that i m { Z f , f n e w } r e { Z f , f n e w } without significant loss of generality. Hence, the constraint given by Equation (5) can be rewritten as follows:
i m { Z f , f n e w } 1 I f m a x     f N f

2.3. Other Constraints

The following constraints are incorporated into the model to account for the technical limitations of the power system and its components.

2.3.1. Power Flow Equation

The following typical DC power flow equations are included in the model [13]:
P t , s , i j = B i j × ( θ t , s , i θ t , s , j )   for   t T , s S , i , j N
{ n P t , s , i j = n B i j × ( θ t , s , i θ t , s , j ) i f x l t , i = 1 n P t , s , i j = 0 i f x l t , i = 0 for     t T , s S , i , j N l
Equation (32) is the DC power flow equation for the existing transmission lines, and Equation (33) is for the candidates to be newly constructed. For the latter, in the search process, constructing ( x l t , i = 1 ) and not constructing ( x l t , i = 0 ) are expressed separately.

2.3.2. Node Balance Equation

The demand and supply condition at each bus is represented as the following equality constraint:
g G i P g t , s , g P d t , s , i j N , j i P t , s , i j j N l , j i n P t , s , i j = 0   for   t T , s S , i N

2.3.3. Limit on Generator Output

All the generators should satisfy the following inequality constraints for the limits on the active power output:
{ P g m i n P t , s , g P g m a x i f x g t , s , g = 1 P t , s , g = 0 i f x g t , s , g = 0 for     t T , s S , g G
In general, in the TEP problem, the on/off status of generator is not considered due to the computational burden. In this paper, for slight improvement of the accuracy of the generation cost, the on/off status of generator is included in the model. However, if the overall computation time is crucial during the simulation, Equation (35) can be simplified to 0 P t , s , g P g m a x without significant problem.

2.3.4. Transmission Limit

The following inequality constraints should be satisfied to limit the apparent power flow through the transmission lines:
P i j m a x P t , s , i j P i j m a x   for   t T , s S , i , j N
n P i j m a x P t , s , i j n P i j m a x   for   t T , s S , i , j N l

2.3.5. Bus Voltage Angel Limit

The following inequality constraint is included to limit the bus voltage angles:
θ i m i n θ t , s , i θ i m a x   for   t T , s S , i N

2.3.6. New Transmission Line Constraint

In this study, we assume that both existing and newly constructed transmission lines will be maintained until the end of the planning period once they are constructed. The following constraints are included in the model for this purpose:
x l t , i x l t 1 , i   for   i N l , t T
x l i = x l j   for   ( i , j ) i , j

3. Solution Methods

The TEP problem with the fault current constraint formulated in the previous section is a typical MILP optimization problem. One of the most commonly used methods to find the optimal solution of the MILP problem is the branch-and-cut algorithm. In general, the B&C algorithm is known to be able to obtain the optimal solution for a relatively small-scale MILP problem, but as explained in the simulation section, the curse of dimensionality still occurs in the TEP problem when considering the proposed fault current constraint. As a result, when the scale of the system increases, the optimal solution cannot be searched for within a reasonable period of time.
In this section, we propose a valid inequality method that can help efficiently find the optimal solution to a given TEP problem. The valid inequality method is one of the ways to improve the search speed by removing the search space from the feasible region where there is no possibility of the solution in a given optimization problem. For example, valid inequalities are effectively used to improve the performance of the B&C algorithm to solve MILP problems such as the traveling salesman problem [15], unit commitment [16], and the oil pipeline design problem [17]. Since most of the valid inequalities are very problem-specific in nature, the valid inequalities used in the previous studies cannot be applied to the TEP problem. Hence, this study proposes a new valid inequality that is well suited to the proposed TEP problem, and it shows through simulation results that the proposed valid inequality works efficiently. Next, we briefly describe the B&C algorithm and then explain the valid inequality suggested in this study.

3.1. Branch and Cut(B&C) Algorithm

The B&C algorithm is a combination of the branch-and-bound (B&B) algorithm and the cutting plane method. Figure 1 shows a flow diagram of the B&C algorithm used in this study [18].

3.2. Valid Inequalities

As mentioned above, it is assumed in this paper that the existing transmission lines are not decommissioned during the planning period. We believe that this assumption is reasonable because the existing transmission lines are rarely decommissioned even in an actual situation, and in most cases, the aged lines are maintained through reinforcement works.
The proposed model includes two binary variables, one related to transmission line construction ( x l ), and the other to generator operation status ( x g ). If a combinatorial set of x l does not satisfy the fault current constraint, a feasible solution does not exist, whatever values are assigned to x g . Additionally, in general, as more transmission lines are built, the fault current at each bus tends to increase.
Having said that, we can assert that at least one of the new transmission lines included in the expansion plan should be removed from the plan if a given combination of x l does not satisfy the fault current constraint. Therefore, the following valid inequality constraint can be added to the mathematical model if the fault current constraint or Equation (5) is not satisfied:
{ i | r o u n d ( x ^ l T , i ) = 1 } ( 1 x l T , i ) 1 ,   i N l
where round ( ) is the round-off operator. The valid inequality is added as a new constraint to the cutting plane. In this study, the above valid inequality is implemented using the branch-and-cut-and-heuristic (BCH) of GAMS [14].

4. Simulation Results

In order to verify the performance of the proposed method, several simulations were performed on the IEEE RTS-96 system, which is frequently used for the TEP problem [19]. The studied power system is depicted in Figure 2. Additionally, Figure 3 shows the load duration curve used in the study, where the durations of load blocks are 1752 hours for a 100% load, 5256 hours at 80%, and 1752 hours at 40%. The growth rate of annual electricity demand and the discount rate are arbitrarily set at 10% and 7%, respectively. The base power and the upper limit of the fault current in each bus are set to 100 MVA and 10 kA, respectively. Other technical parameters used in the simulations are listed separately in the Appendix A.
The proposed model was implemented using the CPLEX solver, which is one of the most frequently used MILP solvers available with the General Algebraic Modeling System (GAMS) [20]. In short, the mathematical formulation of the proposed method is modeled using GAMS to find the optimal solution to the TEP problem and the result from the GAMS model is entered into the PSS/e ASCC Psoftware package [21] to calculate the exact fault currents. For comparison, the existing method based on the linearized impedance update equation [7] is also simulated. The simulation study consists of the following three cases:
Case 1: TEP without fault current constraint
Case 2: TEP with both the fault current constraint and the valid inequality (proposed method)
Case 3: TEP with the fault current constraint based on the linearized impedance update equation (existing method) [7]
Table 1, Table 2 and Table 3 show the optimization results for the three cases. Figure 4 shows the fault current at each bus calculated by the PSS/e ASCC software package [21] using the transmission expansion plans acquired from the results of the three cases. In the figure, the Base case is the fault current before the transmission expansion planning starts and is included in the figure to show that the fault current increases monotonically when transmission lines are added to the system. Table 4 shows the calculation results for the fault current for each year on the bus with a fault current exceeding the upper limit (10 kA).
In Figure 4, the result of Case 1 yields fault currents that exceed 10 kA in the buses of 113, 203, 209, 215, 216, and 218 (blue and red circles). In view of the fault current, the biggest problem of Case 1 is that some of the new transmission lines are constructed on the bus 215, 216, and 218, which have the largest increase in fault currents. It is an obvious result because the fault current level constraint is not considered in the optimization model in Case 1.
On the other hand, any of the fault currents of Case 2 does not exceed the limit of the failure level and the new transmission lines are constructed on the buses 112, 211, and 224 with relatively low increase in fault current.
In Case 3, it can be observed that the fault current at bus 209 exceeds the upper limit as shown in Figure 4 (red circle) and Table 4, and the cause of this problem is due to the linearization of the bus impedance update equation explained in Section 2.2.1. This result can be seen to be due to a rather extreme setting, but we believe that there is always the possibility of this problem occurring in a real system considering the recent circumstances of the power system where the margin between the fault current level and the circuit breakers’ breaking capacity decreases gradually. One thing that should be noted in the result of Case 3 is that the fault current violation happened at bus 209, which is not connected to any of the new transmission lines as shown in Table 3. The reason for this problem is that when the impedance matrix is updated in Case 3 using Equations (6)–(9), the change of the impedance values between other buses that are not connected to the new transmission lines are ignored in order to reduce the calculation time. This problem does not occur in the proposed method (Case 2) because fault current is calculated using exact impedance matrices that reflect the change in the impedance of all buses.
The objective value and the calculation time for each case are shown in Table 5. As shown in the table, Case 2 (the proposed method) takes longer to find the optimal solution than other cases, and the objective function (construction, operation costs, and salvage values) shows that the proposed method is slightly improved compared to Case 3, but the differences are not significant considering the circumstances of the TEP problem. Therefore, the main advantage of the proposed method is that the TEP problem considering the fault current constraint can be solved more precisely by formulating it in MILP form without linearization.
One last analysis of the proposed method is the impact of the valid inequality on the time to convergence at the optimal solution. Figure 5 shows the results of comparing convergence times with and without using the valid inequality. As shown in the figure, the duality gap converges at 0 in about 267 seconds, but it takes longer than 1000 minutes when the valid inequality is not used. The results of the transmission expansion plan in both cases are exactly the same, and therefore, the effect of the valid inequality is clear.

5. Concluding Remarks

In this paper, we propose a new method to solve the TEP problem with more exact consideration of fault current level constraint. In the existing TEP studies, approximation errors occur due to the linearization of the impedance update equation, which is formulated as a nonlinear equation to calculate the fault current of a system. In this paper, we adopt a method of eliminating the approximation error by obtaining the updated impedance matrix directly from the inversion of the admittance matrix using the IMML.
This study also proposes a novel valid inequality method to reduce the computation time to find the optimal solution to the TEP problem with fault current level constraint. The concept of valid inequality is a way of reducing the overall computation time by adding an inequality constraint at every computation step that removes the infeasible region of the optimization problem from the search space. In this paper, the valid inequality is constructed using the characteristic that the fault current in the system generally increases due to the increase of the parallel circuit when new transmission lines are added. As shown in the simulation results, this valid inequality proves to be capable of reducing the overall computation time significantly.
The contribution of this study can be summarized as follows. First, the TEP problem considering the fault current constraint is formulated as a MILP optimization problem without linearization. Second, the convergence of the MILP optimization problem is greatly improved by reducing the feasible area through the valid inequality.
In addition to the TEP problem considering the fault current, the proposed method can be applied to studies on the economical evaluation problems of the newly discussed technologies in solving the fault current problem, such as the optimization of bus separation, the superconducting fault current limiter, and the usage of medium voltage direct current.

Author Contributions

Conceptualization, S.L.; methodology, S.L.; software, S.L.; validation, W.K. and H.K.; formal analysis, H.K.; investigation, H.S.; resources, S.L.; data curation, T.H.K.; writing—original draft preparation, S.L.; writing—review and editing, W.K.; visualization, T.H.K.; supervision, W.K.; project administration, W.K.; funding acquisition, W.K.

Funding

This research was supported by the Human Resources Program in Energy Technology of the Korea Institute of Energy Technology Evaluation and Planning (KETEP) granted financial resource from the Ministry of Trade, Industry & Energy, Republic of Korea (No.20174030201770), and also was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF 2019R1I1A3A01059931).

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

Indices
t : Index of years
s : Index of electricity load blocks
i , j , k : Index of buses
f : Sub-index of buses applying fault current constraint
g : Index of generators
Sets and Function
T : Set of all planning years
N : Set of all buses
N l : Set of buses connected to new line candidates
N f : Set of buses to which fault current constraints are applied
G : Set of all generators
G i : Set of generators connected to bus i
i , j : Bus pair of new line candidates between bus i and j
S : Set of all electricity load blocks
f g : Fuel cost of generator g
Variables and Time-varying Parameters
Y t n e w : Bus admittance matrix in year t
Z t n e w : Bus impedance matrix in year t
P g t , s , g : Active power output of generator g of load block s in year t
P t , s , i j : Active power flow of existing line from bus i to j of load block s in year t
n P t , s , i j : Active power flow of new line from bus i to j of load block s in year t
x g t , s , g : Binary variable for on/off status of generator g at bus i of load block s in year t
x l t , i : Binary variable for construction status of new transmission line at bus i in year t
θ t , s , i : Phase angle of bus i of load block s in year t
x ^ l t , i : Solution to the linear relaxation problem of B&C algorithm at bus i in year t
Fixed Parameters
I i m a x : Maximum fault current at bus i
Y i , j o l d : Bus admittance matrix between bus i and j in base year
Z i , j o l d : Bus impedance matrix between bus i and j in base year
Z i , j n e w : Impedance of new line candidate between bus i and j
I C i , j : Construction cost of new line candidate between i and j
l i f e i , j : Life span of new line candidate between i and j
t d s : Time duration of load block s
d r : Discount rate
b g , c g : Coefficients of the cost function of generator g
P d t , s , i : Active power demand at bus i of load block s in year t
P g m a x , P g m i n : Maximum/Minimum active power output of generator g
P i j m a x : Maximum active power transmission limit of existing line between bus i and j
n P i j m a x , n P i j m i n : Maximum/Minimum active power transmission limit of new line between bus i and j
B i j : Susceptance of transmission line between bus i and j
n B i j : Susceptance of new line candidate between bus i and j
θ i m a x , θ i m i n : Maximum/Minimum voltage angle at bus i

Appendix A. Parameters

The following tables show the parameters of the system used in the simulations.
Table A1. Transmission line data.
Table A1. Transmission line data.
BranchIDR (p.u.)X (p.u.)Limit (MW)BranchIDR (p.u.)X (p.u.)Limit (MW)
101-10210.0030.014175201-20210.0030.014175
101-10310.0550.211175201-20310.0550.211175
101-10510.0220.085175201-20510.0220.085175
102-10410.0330.127175202-20410.0330.127175
102-10610.0500.192175202-20610.0500.192175
103-10910.0310.119175203-20910.0310.119175
104-10910.0270.104175204-20910.0270.104175
105-11010.0230.088175205-21010.0230.088175
106-11010.0140.061175206-21010.0140.061175
107-10810.0160.061175207-20810.0160.061175
108-10910.0430.165175208-20910.0430.165175
108-11010.0430.165175208-21010.0430.165175
111-11310.0060.048500211-21310.0060.048500
111-11410.0050.042500211-21410.0050.042500
112-11310.0060.048500212-21310.0060.048500
112-12310.0120.097500212-22310.0120.097500
113-12310.0110.087500213-22310.0110.087500
114-11610.0050.059500214-21610.0050.059500
115-12110.0060.049500215-22110.0060.049500
115-12410.0070.052500215-22410.0070.052500
116-11710.0030.026500216-21710.0030.026500
116-11910.0030.023500216-21910.0030.023500
117-11810.0020.014500217-21810.0020.014500
117-12210.0140.105500217-22210.0140.105500
118-12110.0030.026500218-22110.0030.026500
119-12010.0050.040500219-22010.0050.040500
120-12310.0030.022500220-22310.0030.022500
107-20310.0420.161175
Table A2. Transformer data.
Table A2. Transformer data.
BranchR (p.u.)X (p.u.)Limit (MW)TrR (p.u.)X (p.u.)Limit (MW)
103-1240.0020.09400203-2240.0020.09400
109-1110.0020.09400209-2110.0020.09400
109-1120.0020.09400209-2120.0020.09400
110-1110.0020.09400210-2110.0020.09400
110-1120.0020.09400210-2120.0020.09400
Table A3. New line data.
Table A3. New line data.
BranchR (p.u.)X (p.u.)Limit (MW)Investment Cost (Million $)Life (year)
102-2010.090 0.346 17590,000,000 30
106-2040.072 0.276 17572,000,000 30
107-2030.042 0.161 17542,000,000 30
107-1080.016 0.061 17516,000,000 30
112-2240.011 0.089 500120,000,000 30
113-2150.010 0.075 50078,000,000 30
113-2170.042 0.161 17542,000,000 30
115-1160.002 0.017 50018,000,000 30
115-1210.006 0.049 50051,000,000 30
116-1170.003 0.026 50027,000,000 30
118-1210.003 0.026 50027,000,000 30
119-1200.005 0.040 50041,250,000 30
120-1230.003 0.022 50022,500,000 30
121-1220.009 0.068 50070,500,000 30
122-2180.009 0.068 50076,500,000 30
123-2170.010 0.074 50076,500,000 30
203-2090.031 0.119 17531,000,000 30
207-2080.016 0.061 17516,000,000 30
215-2160.002 0.017 50018,000,000 30
215-2210.006 0.049 50051,000,000 30
218-2210.003 0.026 50027,000,000 30
219-2200.005 0.040 50041,250,000 30
220-2230.003 0.022 50022,500,000 30
221-2220.009 0.068 50070,500,000 30
211-2240.0060.04650049,500,00030
Table A4. Generator data.
Table A4. Generator data.
Bus IDPmax (MW)Pmin (MW)Bg ($/MWh)Cg ($/h)Xd″ (p.u)Bus IDPmax (MW)Pmin (MW)Bg ($/MWh)Cg ($/h)Xd″ (p.u)
1011921545212200.19201192154429760.19
1021921545212200.19202192154429760.19
107300707813,1520.13207300706210,5210.13
11359135242810.0621359135232250.06
1152151527191160.172152151525672930.17
1161554411378100.24216155449162780.24
1184002442038480.122184002441730780.12
1214002442434520.122214002441927620.12
12230012212927780.1222230012210322220.12
12366056259470.0622366056247580.06
Table A5. Peak load data (MW).
Table A5. Peak load data (MW).
Bus IDkVPeak LoadBus IDkVPeak LoadBus IDkVPeak LoadBus IDkVPeak Load
1011389211123022520113846211230113
102138821122301672021384121223084
10313815311323022520313877213230113
104138631142301652041383121423082
1051386011523026920513830215230135
106138116116230852061385821623043
10713810611823028320713853218230142
1081381451192301542081387321923077
1091381491202301092091387422023054
110138166 21013883

References

  1. Sarmiento, H.G.; Castellanos, R.; Pampin, G.; Tovar, C.; Naude, J. An example in controlling short circuit levels in a large metropolitan area. In Proceedings of the 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491), Toronto, ON, Canada, 13–17 July 2003; Volume 2, pp. 589–594. [Google Scholar]
  2. Vovos, P.N.; Bialek, J.W. Direct incorporation of fault level constraints in optimal power flow as a tool for network capacity analysis. IEEE Trans. Power Syst. 2005, 20, 2125–2134. [Google Scholar] [CrossRef]
  3. Moon, G.; Wi, Y.; Lee, K.; Joo, S. Fault Current Constrained Decentralized Optimal Power Flow Incorporating Superconducting Fault Current Limiter (SFCL). IEEE Trans. Appl. Supercond. 2011, 21, 2157–2160. [Google Scholar] [CrossRef]
  4. Vovos, P.N.; Song, H.; Cho, K.; Kim, T. A network reconfiguration algorithm for the reduction of expected fault currents. In Proceedings of the 2013 IEEE Power Energy Society General Meeting, Vancouver, BC, Canada, 21–25 July 2013; pp. 1–5. [Google Scholar]
  5. Ngoc, P.T.; Singh, J.G. Short circuit current level reduction in power system by optimal placement of fault current limiter. Int. Trans. Electr. Energy Syst. 2017, 27, 2457. [Google Scholar] [CrossRef]
  6. Moon, G.; Lee, J.; Joo, S. Integrated Generation Capacity and Transmission Network Expansion Planning With Superconducting Fault Current Limiter (SFCL). IEEE Trans. Appl. Supercond. 2013, 23, 5000510. [Google Scholar] [CrossRef]
  7. Teimourzadeh, S.; Aminifar, F. MILP Formulation for Transmission Expansion Planning With Short-Circuit Level Constraints. IEEE Trans. Power Syst. 2016, 31, 3109–3118. [Google Scholar] [CrossRef]
  8. Gharibpour, H.; Aminifar, F.; Bashi, M.H. Short-circuit-constrained transmission expansion planning with bus splitting flexibility. IET Gener. Transm. Distrib. 2017, 12, 217–226. [Google Scholar] [CrossRef]
  9. Ghanaatian, M.; Lotfifard, S. Sparsity-Based Short-Circuit Analysis of Power Distribution Systems With Inverter Interfaced Distributed Generators. IEEE Trans. Power Syst. 2019, 34, 4857–4868. [Google Scholar] [CrossRef]
  10. Džafić, I.; Pal, B.C.; Gilles, M.; Henselmeyer, S. Generalized π Fortescue Equivalent Admittance Matrix Approach to Power Flow Solution. IEEE Trans. Power Syst. 2014, 29, 193–202. [Google Scholar] [CrossRef]
  11. Grainger, J.J.; Stevenson, W.D. Power System Analysis; Mcgrawhill: New York, NY, USA, 2003. [Google Scholar]
  12. Alsac, O.; Stott, B.; Tinney, W.F. Sparsity-Oriented Compensation Methods for Modified Network Solutions. IEEE Trans. Power Appar. Syst. 1983, 102, 1050–1060. [Google Scholar] [CrossRef]
  13. Glover, J.D.; Sarma, M.S.; Overbye, T.J. Power System Analysis and Design, 5th ed.; Cengage Learning: Boston, MA, USA, 2012. [Google Scholar]
  14. GAMS Solvers. Available online: https://www.gams.com/latest/docs/S_MAIN.html. (accessed on 17 January 2017).
  15. Gendreau, M.; Laporte, G.; Semet, F. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 1998, 32, 263–273. [Google Scholar] [CrossRef]
  16. Ostrowski, J.; Anjos, M.F.; Vannelli, A. Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem. IEEE Trans. Power Syst. 2012, 27, 39–46. [Google Scholar] [CrossRef]
  17. Brimberg, J.; Hansen, P.; Lin, K.-W.; Mladenović, N.; Breton, M. An Oil Pipeline Design Problem. Oper. Res. 2003, 51, 228–239. [Google Scholar] [CrossRef] [Green Version]
  18. Mitchell, J.E. Branch-and-cut algorithms for combinatorial optimization problems. Handb. Appl. Optim. 2002, 1, 65–77. [Google Scholar]
  19. Grigg, C.; Wong, P.; Albrecht, P.; Allan, R.; Bhavaraju, M.; Billinton, R.; Li, W. The IEEE Reliability Test System-1996. A report prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee. IEEE Trans. Power Syst. 1999, 14, 1010–1020. [Google Scholar] [CrossRef]
  20. Rosenthal, R.E. GAMS-A User’s Guide; GAMS Develop. Corpor.: Washington, DC, USA, 2016. [Google Scholar]
  21. PSS®E Homepage. Available online: New.siemens.com/global/en/products/energy/services/transmission-distribution-smart-grid/consulting-and-planning/pss-software/pss-e.html (accessed on 20 March 2019).
Figure 1. Flow chart of the branch-and-cut algorithm [18].
Figure 1. Flow chart of the branch-and-cut algorithm [18].
Energies 12 04769 g001
Figure 2. IEEE two-area RTS-96 system (solid: existing; dashed: candidates).
Figure 2. IEEE two-area RTS-96 system (solid: existing; dashed: candidates).
Energies 12 04769 g002
Figure 3. Load duration curve.
Figure 3. Load duration curve.
Energies 12 04769 g003
Figure 4. Fault current analysis using PSS/e ASCC.
Figure 4. Fault current analysis using PSS/e ASCC.
Energies 12 04769 g004
Figure 5. Impact of the valid inequality on convergence time.
Figure 5. Impact of the valid inequality on convergence time.
Energies 12 04769 g005
Table 1. Transmission Expansion Planning Result of Case 1.
Table 1. Transmission Expansion Planning Result of Case 1.
Branch (From Bus-to Bus)LineYear 1Year 2Year 3Year 4Year 5
107-2031
107-2032
107-1081
113-2151
122-2181
203-2091
207-2081
215-2161
Table 2. TEP Result of Case 2.
Table 2. TEP Result of Case 2.
Branch (From Bus-to Bus)LineYear 1Year 2Year 3Year 4Year 5
102-2011
107-2031
107-2032
107-1081
107-1082
112-2241
211-2241
Table 3. TEP Result of Case 3.
Table 3. TEP Result of Case 3.
Branch (From Bus-to Bus)LineYear 1Year 2Year 3Year 4Year 5
102-2011
106-2041
106-2042
107-2031
112-2242
207-2081
211-2241
Table 4. Fault current of buses (violated buses only, unit: A).
Table 4. Fault current of buses (violated buses only, unit: A).
Bus NumberCaseBaseYear 1Year 2Year 3Year 4Year 5
113Case 1877911,11611,15711,15711,16011,175
Case 2877994309430943394339474
Case 3877993859407940794079522
203Case 17254846785568556914510,231
Case 2725489578957953395339622
Case 3725486888719871987198995
209Case 19111937293859385947710,575
Case 2911196569656975297529833
Case 39111979598509850985010,356
215Case 1520011,04911,05011,05011,08711,543
Case 2520065296529654565456549
Case 3520059605961596159616540
216Case 1767011,15111,15211,15211,18011,772
Case 2767078597859786878687875
Case 3767077677773777377737887
218Case 18182875387538753876210,586
Case 2818283698369837683768379
Case 3818283698372837283728382
Table 5. Objective values and computation times.
Table 5. Objective values and computation times.
CaseObjective Value (Million $)Computation Time (Seconds)
Case 1205334
Case 22100267
Case 3212944

Share and Cite

MDPI and ACS Style

Lee, S.; Kim, H.; Kim, T.H.; Shin, H.; Kim, W. Fault Current Constraint Transmission Expansion Planning Based on the Inverse Matrix Modification Lemma and a Valid Inequality. Energies 2019, 12, 4769. https://doi.org/10.3390/en12244769

AMA Style

Lee S, Kim H, Kim TH, Shin H, Kim W. Fault Current Constraint Transmission Expansion Planning Based on the Inverse Matrix Modification Lemma and a Valid Inequality. Energies. 2019; 12(24):4769. https://doi.org/10.3390/en12244769

Chicago/Turabian Style

Lee, Sungwoo, Hyoungtae Kim, Tae Hyun Kim, Hansol Shin, and Wook Kim. 2019. "Fault Current Constraint Transmission Expansion Planning Based on the Inverse Matrix Modification Lemma and a Valid Inequality" Energies 12, no. 24: 4769. https://doi.org/10.3390/en12244769

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop