A Mixed-Integer Linear Programming Approach for Multi-Stage Security-Constrained Transmission Expansion Planning

By Hui Zhang, Vijay Vittal, Gerald Thomas Heydt, J. Quintero. IEEE Transactions on Power Systems, 2012

263 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Multi-Stage Flexible Expansion Co-Planning Under Uncertainties in a Combined Electricity and Gas Market (2015, background): “al, 2012 [86] linear programming approach that considers generator costs, transmission losses and the N-1 security constraints for multi-stage transmission expansion problems.”
A Linearized OPF Model With Reactive Power and Voltage Magnitude: A Pathway to Improve the MW-Only DC OPF (2018, methodology): “An improved linearized network model based on the Taylor series expansion is used for the OPF problem in [25], [26].”
Security Constrained Multi-Stage Transmission Expansion Planning Considering a Continuously Variable Series Reactor (2017, background): “Checking N − 1 security constraints iteratively is an effective way to reduce the computational burden in the TEP problem [3], [30].”
Strategies to Reduce the Number of Variables and the Combinatorial Search Space of the Multistage Transmission Expansion Planning Problem (2013, background): “The N-1/N-2 contingencies [24], the uncertainty of future scenarios [25], the environmental impacts [26] and market considerations [27] can all change the constraints or objectives of the planning: among them, the N-1 security is one of the most important issues in transmission planning that has bee”