z-logo
open-access-imgOpen Access
Communication‐efficient distributed strategy for reactive power optimisation considering the uncertainty of renewable generation
Author(s) -
Li Jing,
Xin Huanhai,
Wei Wei,
Dai Wenzhan
Publication year - 2016
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.2015.1317
Subject(s) - renewable energy , computer science , ac power , distributed generation , electricity generation , power (physics) , distributed computing , mathematical optimization , engineering , electrical engineering , mathematics , physics , quantum mechanics
Due to the non‐linear power flow equality constraints and uncertain injected power of renewable generation, the reactive power optimisation problem is stochastic and non‐convex, which is hard to be solved efficiently. Therefore, the discrete probability model of renewable generation is utilised to build the multi‐scenario deterministic formulation of the stochastic problem, which is further changed to a conic optimisation model via the second‐order conic relaxation. By using the skill of splitting buses and the augmented Lagrangian decomposition, the problem is separated into several smaller manageable sub‐problems. Moreover, on the basis of the accelerated local augmented Lagrangian, a fully distributed conic optimisation algorithm is developed and the global optimal solution can be obtained iteratively in a parallel fashion. During the iterative procedure of the algorithm, only partial local message, without central coordination, need to be exchanged between the neighbouring subsystems. Each subsystem is interested in knowing only some components rather than the entire information, which improves communication efficiency. Simulations verify the effectiveness of the proposed algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here