Open AccessSemidefinite relaxation and generalised benders decomposition to solve the transmission expansion network and reactive power planning
Author(s) -
Alvarez Erik F.,
Paredes Miguel,
Rider Marcos J.
Publication year - 2020
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2019.0331
Subject(s) - semidefinite programming , mathematical optimization , benders' decomposition , relaxation (psychology) , ac power , convergence (economics) , integer programming , semidefinite embedding , power transmission , electric power system , linear programming , economic dispatch , transmission (telecommunications) , mathematics , integer (computer science) , power (physics) , computer science , quadratically constrained quadratic program , voltage , engineering , quadratic programming , telecommunications , electrical engineering , physics , quantum mechanics , psychology , social psychology , programming language , economic growth , economics
This study presents a methodology to solve simultaneously the alternating current (AC) transmission network expansion and reactive power planning problems, considering multiple stages and operating conditions. A mixed‐integer non‐linear programming model for the proposed planning problem is presented and rewritten with semidefinite structures. Then, the generalised Benders decomposition is used to separate the overall problem into an upper‐level (master) problem and several lower‐level (slaves) problems. The master problem is a mixed‐integer linear programming problem that optimises the investment cost and constraints of the multistage expansion. Each slave problem minimises the operating costs associated with each stage and operating condition (normal operation or contingency), considering the AC power flow via semidefinite relaxation. With the proposed methodology, the global optimality of generalised Benders decomposition can be preserved due to the use of semidefinite relaxation in each slave problem. Garver's 6‐bus system and an IEEE 118‐bus system are used to show the precision and convergence to near‐global optimal solutions with small relaxation gaps through the proposed approach.