z-logo
open-access-imgOpen Access
Toward coordinated look‐ahead reactive power optimisation for distribution networks with minimal control
Author(s) -
Ding Min,
Chiang HsiaoDong,
Li Peng
Publication year - 2018
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.2017.1367
Subject(s) - ac power , mathematical optimization , partition (number theory) , integer programming , computer science , transformer , voltage , time horizon , power flow , linear programming , control theory (sociology) , capacitor , power (physics) , engineering , electric power system , control (management) , mathematics , electrical engineering , physics , quantum mechanics , artificial intelligence , combinatorics
A coordinated look‐ahead reactive power optimisation method is proposed to minimise the required number of operating control devices for a time horizon of 24 h. The aim is to determine, via solving a mixed integer non‐linear programming (MINLP) problem, optimum value settings of transformer taps, capacitor banks and reactive power output of distributed generators (DGs) based on the day‐ahead load demand and active power output of DGs satisfying the engineering and operational constraints. The proposed method employs a three‐stage method: assessment stage, time‐period‐partitioning stage, and coordinated reactive power optimisation stage. The first stage assesses the hourly voltage profile and available delivery capability margin of the system, while the time‐period‐partitioning stage uses clustering algorithm based on power‐flow solution to partition time periods into coherent time durations. The MINLP problem is solved in the proposed coordinated optimisation stage. A modified IEEE13 case and IEEE123 case are used to verify the effectiveness of the proposed three‐stage method.

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