Integration N-1 of Contingency Analysis With Systematic Transmission Capacity Expansion Planning: ERCOT Case Study

In this paper, we propose a method for N - 1 contingency constrained transmission capacity expansion planning (TCEP), which is formulated as a mixed-integer programming (MIP) problem. In relatively well-designed power systems, a single outage of a majority of lines will not usually cause overload on other lines in most loading conditions. Thus they will not affect the feasible region and the optimal answer of the TCEP optimization problem, and can be safely removed from contingency analysis if we can identify them. A contingency identification index is developed to detect these lines and create variable contingency lists (VCL) for different network loading conditions. In our proposed method, we use results of a relaxed version of the original problem as a lower bound answer in the first step, and integrate contingencies into TCEP in the next steps to solve this optimization problem faster while still satisfying N - 1 criterion. For solving TCEP with contingencies, two options are offered, i. e., option A that uses an updated system as its base case (original existing network together with selected lines by the relaxed problem) and option B that uses the original existing network as its base case (without results of the relaxed problem). Option A is faster than option B because it usually should select fewer new lines compared to B, but cannot guarantee optimality. Option B provides the optimal answer while taking more computational time. An ERCOT case study is used to show capabilities of the proposed method for solving large scale problems, and the numerical result demonstrates this method is much faster than the integrated MIP method that directly incorporates all contingencies.