TY - JOUR
T1 - A mixed-integer linear programming approach for multi-stage security-constrained transmission expansion planning
AU - Zhang, Hui
AU - Vittal, Vijay
AU - Heydt, Gerald Thomas
AU - Quintero, Jaime
N1 - Funding Information:
Manuscript received September 12, 2011; revised November 04, 2011; accepted November 18, 2011. Date of publication December 26, 2011; date of current version April 18, 2012. This work was supported in part by the U.S. Department of Energy funded project denominated “Regional Transmission Expansion Planning in the Western Interconnection” under contract DOE-FOA0000068. This is a project under the American Recovery and Reinvestment Act. Paper no. TPWRS-00862-2011.
PY - 2012/5
Y1 - 2012/5
N2 - The transmission expansion planning (TEP) problem in modern power systems is a large-scale, mixed-integer, non-linear and non-convex problem. Although remarkable advances have been made in optimization techniques, finding an optimal solution to a problem of this nature can still be extremely challenging. Based on the linearized power flow model, this paper presents a mixed-integer linear programming (MILP) approach that considers losses, generator costs and the $N - 1$ security constraints for the multi-stage TEP problem. The losses and generator cost are modeled as piecewise linear functions of the line flows and the generator outputs, respectively. The IEEE 24-bus system is used to compare the lossy and the lossless model. The results show that the lossy model provides savings in total cost in the long run. The selection of the best number of piecewise linear sections L is also shown. Then a complete planning framework is presented and a multi-stage TEP is performed on the IEEE 118-bus test system. Simulation results show that the proposed approach is accurate and efficient, and has the potential to be applied to large-scale power system planning problems.
AB - The transmission expansion planning (TEP) problem in modern power systems is a large-scale, mixed-integer, non-linear and non-convex problem. Although remarkable advances have been made in optimization techniques, finding an optimal solution to a problem of this nature can still be extremely challenging. Based on the linearized power flow model, this paper presents a mixed-integer linear programming (MILP) approach that considers losses, generator costs and the $N - 1$ security constraints for the multi-stage TEP problem. The losses and generator cost are modeled as piecewise linear functions of the line flows and the generator outputs, respectively. The IEEE 24-bus system is used to compare the lossy and the lossless model. The results show that the lossy model provides savings in total cost in the long run. The selection of the best number of piecewise linear sections L is also shown. Then a complete planning framework is presented and a multi-stage TEP is performed on the IEEE 118-bus test system. Simulation results show that the proposed approach is accurate and efficient, and has the potential to be applied to large-scale power system planning problems.
KW - $N - 1$ contingency modeling
KW - Generator cost modeling
KW - loss modeling
KW - mixed-integer linear programming
KW - piecewise linearization
KW - transmission engineering
KW - transmission expansion planning
UR - http://www.scopus.com/inward/record.url?scp=84860232036&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860232036&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2011.2178000
DO - 10.1109/TPWRS.2011.2178000
M3 - Article
AN - SCOPUS:84860232036
SN - 0885-8950
VL - 27
SP - 1125
EP - 1133
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 2
M1 - 6112698
ER -