AC Transmission Network Expansion Planning: A Semidefinite Programming Branch-and-Cut Approach
Preprint
Abstract
Transmission network expansion planning is a mixed-integer optimization problem, whose solution is used to guide future investment in transmission equipment. An approach is presented to find the global solution of the transmission planning problem using an AC network model. The approach builds on the semidefinite relaxation of the AC optimal power flow problem (ACOPF); its computational engine is a new specialized branch-and-cut algorithm for transmission expansion planning to deal with the underlying mixed-integer ACOPF problem. Valid inequalities that are based on specific knowledge of the expansion problem are employed to improve the solution quality at any node of the search tree, and thus significantly reduce the overall computational effort of the branch-and-bound algorithm. Additionally, sparsity of the semidefinite relaxation is exploited to further reduce the computation time at each node of the branch-and-cut tree. Despite the vast number of publications on transmission expansion planning, the proposed approach is the first to provide expansion plans that are globally optimal using a solution approach for the mixed-integer ACOPF problem. The results on standard networks serve as important benchmarks to assess the solution quality from existing techniques and simplified models.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- MILP branch flow model for concurrent AC multistage transmission expansion and reactive power planning with security constraintsIET Generation, Transmission & Distribution, 2016
- Efficient Benders cuts for transmission expansion planningElectric Power Systems Research, 2016
- Efficient method for AC transmission network expansion planningElectric Power Systems Research, 2010
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completionMathematical Programming, 2010
- Semidefinite programming for optimal power flow problemsInternational Journal of Electrical Power & Energy Systems, 2008
- Power system transmission network expansion planning using AC modelIET Generation, Transmission & Distribution, 2007
- Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planningIET Generation, Transmission & Distribution, 2007
- Branch and bound algorithm for transmission system expansion planning using a transportation modelIEE Proceedings - Generation, Transmission and Distribution, 2000
- Transmision system expansion planning by an extended genetic algorithmIEE Proceedings - Generation, Transmission and Distribution, 1998
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984