Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Power Systems
Article . 2017 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Data-Driven DG Capacity Assessment Method for Active Distribution Networks

Authors: Wenchuan Wu; Boming Zhang; Xin Chen; Chenhui Lin;

Data-Driven DG Capacity Assessment Method for Active Distribution Networks

Abstract

This paper proposes a data-driven method based on distributionally robust optimization to determine the maximum penetration level of distributed generation (DG) for active distribution networks. In our method, the uncertain DG outputs and load demands are formulated as stochastic variables following some ambiguous distributions. In addition to the given expectations and variances, the polyhedral uncertainty intervals are employed for the construction of the probability distribution set to restrict possible distributions. Then, we decide the optimal sizes and locations of DG to maximize the total DG hosting capacity under the worst-case probability distributions among this set. Since more information is utilized, our proposed model is expected to be less conservative than the robust optimization method and the traditional distributionally robust method. Using the CVaR (Conditional Value at Risk) reformulation technique and strong duality, we transform the proposed model into an equivalent bilinear matrix inequality problem, and a sequential convex optimization algorithm is applied for solution. Our model guarantees that the probability of security constraints being violated will not exceed a given risk threshold. Besides, the predefined risk level can be tuned to control the conservativeness of our model in a physically meaningful way. The effectiveness and robustness of this proposed method are demonstrated numerically on the two modified IEEE test systems.

Related Organizations
  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    99
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 1%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 1%
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
99
Top 1%
Top 10%
Top 1%