z-logo
open-access-imgOpen Access
Data‐driven distributionally robust economic dispatch for distribution network with multiple microgrids
Author(s) -
Wang Lingling,
Jiang Chuanwen,
Gong Kai,
Si Ruihua,
Shao Hongbo,
Liu Wanxun
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.2020.0861
Subject(s) - mathematical optimization , computer science , economic dispatch , benders' decomposition , constraint (computer aided design) , renewable energy , robust optimization , norm (philosophy) , electric power system , power (physics) , mathematics , engineering , quantum mechanics , geometry , political science , law , electrical engineering , physics
With a high penetration level of renewable energy resources (RESs) in the distribution network (DN) and microgrids (MGs), how to realise the coordination between the two entities while takes the uncertain RESs into consideration becomes an urgent problem. A data‐driven distributionally robust economic dispatch (DRED) model for both DN and MGs is proposed in this study, wherein the 1‐norm and ∞‐norm are used to construct the confidence set for the probability distribution of the uncertainties based on historical data. The DN and each MG are considered as independent entities to minimise their own operation cost. The alternating direction method of multipliers is utilised to coordinate the power exchange between DN and MGs and realise the autonomy of each entity. The column and constraint generation algorithm is used to solve the proposed data‐driven DRED model for each entity. Considering the special structure of the proposed DRED problem, a duality‐free decomposition method is adopted. Thus the computational burden is reduced. Numerical results on a modified IEEE 33‐bus DN with three MGs validate the effectiveness of the proposed 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