IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i4p897-d496273.html
   My bibliography  Save this article

An Efficient Backward/Forward Sweep Algorithm for Power Flow Analysis through a Novel Tree-Like Structure for Unbalanced Distribution Networks

Author

Listed:
  • Stefanos Petridis

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

  • Orestis Blanas

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

  • Dimitrios Rakopoulos

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

  • Fotis Stergiopoulos

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

  • Nikos Nikolopoulos

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

  • Spyros Voutetakis

    (Centre for Research and Technology Hellas, Chemical Process and Energy Resources Institute, 6th km Charilaou-Thermi Road, GR-57001 Thermi, Thessaloniki, Greece)

Abstract

The increase of distributed energy resources (DERs) in low voltage (LV) distribution networks requires the ability to perform an accurate power flow analysis (PFA) in unbalanced systems. The characteristics of a well performing power flow algorithm are the production of accurate results, robustness and quick convergence. The current study proposes an improvement to an already used backward-forward sweep (BFS) power flow algorithm for unbalanced three-phase distribution networks. The proposed power flow algorithm can be implemented in large systems producing accurate results in a small amount of time using as little computational resources as possible. In this version of the algorithm, the network is represented in a tree-like structure, instead of an incidence matrix, avoiding the use of redundant computations and the storing of unnecessary data. An implementation of the method was developed in Python programming language and tested for 3 IEEE feeder test cases (the 4 bus feeder, the 13 bus feeder and the European Low Voltage test feeder), ranging from a low (4) to a very high (907) buses number, while including a wide variety of components witnessed in LV distribution networks.

Suggested Citation

  • Stefanos Petridis & Orestis Blanas & Dimitrios Rakopoulos & Fotis Stergiopoulos & Nikos Nikolopoulos & Spyros Voutetakis, 2021. "An Efficient Backward/Forward Sweep Algorithm for Power Flow Analysis through a Novel Tree-Like Structure for Unbalanced Distribution Networks," Energies, MDPI, vol. 14(4), pages 1-20, February.
    • Handle: RePEc:gam:jeners:v:14:y:2021:i:4:p:897-:d:496273
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/4/897/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/14/4/897/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sepideh Radhoush & Maryam Bahramipanah & Hashem Nehrir & Zagros Shahooei, 2022. "A Review on State Estimation Techniques in Active Distribution Networks: Existing Practices and Their Challenges," Sustainability, MDPI, vol. 14(5), pages 1-16, February.
    2. Maen Z. Kreishan & Ahmed F. Zobaa, 2022. "Mixed-Integer Distributed Ant Colony Optimization of Dump Load Allocation with Improved Islanded Microgrid Load Flow," Energies, MDPI, vol. 16(1), pages 1-30, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:14:y:2021:i:4:p:897-:d:496273. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.