iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.48550/arXiv.2207.03686
[2207.03686] ATC-Based Scenario Decomposition Algorithm for Optimal Power Flow of Distribution Networks Considering High Photovoltaic Penetration
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Electrical Engineering and Systems Science > Systems and Control

arXiv:2207.03686 (eess)
[Submitted on 8 Jul 2022]

Title:ATC-Based Scenario Decomposition Algorithm for Optimal Power Flow of Distribution Networks Considering High Photovoltaic Penetration

Authors:Xiemin Mo, Tao Liu, Xue Lyu
View PDF
Abstract:This paper focuses on the analytical target cascading (ATC) based scenario decomposition method which applies to the stochastic OPF problem of distribution networks with high photovoltaic penetration. The original two-stage stochastic OPF model is decomposed into a master problem in the upper level and multiple subproblems in the lower level. This decomposition makes subproblems easier to be solved and can also effectively overcome the curse of dimensionality in the traditional scenario-based model. The global optimal solution can be obtained by only transferring some necessary coupling information between the upper and lower levels. Moreover, all the subproblems in the lower level can be solved in a parallel manner which improves the computational efficiency, in particular, for cases with a larger number of scenarios. Case studies on the IEEE 33-bus system and various larger systems verify the effectiveness and adaptability of the proposed algorithm.
Comments: In proceedings of the 11th Bulk Power Systems Dynamics and Control Symposium (IREP 2022), July 25-30, 2022, Banff, Canada
Subjects: Systems and Control (eess.SY)
Report number: IREP2022-32
Cite as: arXiv:2207.03686 [eess.SY]
  (or arXiv:2207.03686v1 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2207.03686

Submission history

From: Xiemin Mo [view email]
[v1] Fri, 8 Jul 2022 04:49:10 UTC (698 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
eess.SY
< prev   |   next >
new | recent | 2022-07
Change to browse by:
cs
cs.SY
eess

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)