An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems
In this work, a new strategy based on dynamic programming is proposed to solve the power flow (PF) problem in radial distribution systems using the backward/forward sweep method (BFSM). The strategy consists of a dynamic tree of varied children to represent the radial configuration of the system, al...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10815725/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841563343604678656 |
|---|---|
| author | Max R. Marinho Eliane S. Souza Lucas K. Sperotto Ruben Romero |
| author_facet | Max R. Marinho Eliane S. Souza Lucas K. Sperotto Ruben Romero |
| author_sort | Max R. Marinho |
| collection | DOAJ |
| description | In this work, a new strategy based on dynamic programming is proposed to solve the power flow (PF) problem in radial distribution systems using the backward/forward sweep method (BFSM). The strategy consists of a dynamic tree of varied children to represent the radial configuration of the system, allowing a new way of storing and accessing the system information for the PF calculation. This strategy avoids both the bus renumbering procedure for branch ordering used in different BFSMs (due to their branch-oriented characteristic) and the matrix inversion procedure, also used in different BFSMs. The proposed strategy is innovative, since PF problems have been solved in the literature by methods based on static programming. Tests with 14-bus, 33-bus, 84-bus, 136-bus, and 417-bus systems were carried to evaluate both the performance of the construction procedure of the dynamic tree in comparison to the classical branch ordering procedure and the performance of the PF calculation procedure using the proposed dynamic tree in contrast to traditional BFSMs. Promising results were obtained in both evaluated aspects. Therefore, this work contributes to the opening of new studies for a dynamic approach aimed at calculating the PF in radial distribution systems. |
| format | Article |
| id | doaj-art-19053d56d67d494eb0fef365c050ad3e |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-19053d56d67d494eb0fef365c050ad3e2025-01-03T00:01:29ZengIEEEIEEE Access2169-35362025-01-01131012102510.1109/ACCESS.2024.352284510815725An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution SystemsMax R. Marinho0https://orcid.org/0000-0002-6904-2722Eliane S. Souza1https://orcid.org/0000-0002-1091-5760Lucas K. Sperotto2https://orcid.org/0000-0002-4941-7398Ruben Romero3https://orcid.org/0000-0002-7744-254XDepartment of Computing, Mato Grosso State University (UNEMAT), Alto Araguaia, BrazilDepartment of Computing, Mato Grosso State University (UNEMAT), Alto Araguaia, BrazilDepartment of Computing, Mato Grosso State University (UNEMAT), Alto Araguaia, BrazilDepartment of Electrical Engineering, São Paulo State University (UNESP), Ilha Solteira, BrazilIn this work, a new strategy based on dynamic programming is proposed to solve the power flow (PF) problem in radial distribution systems using the backward/forward sweep method (BFSM). The strategy consists of a dynamic tree of varied children to represent the radial configuration of the system, allowing a new way of storing and accessing the system information for the PF calculation. This strategy avoids both the bus renumbering procedure for branch ordering used in different BFSMs (due to their branch-oriented characteristic) and the matrix inversion procedure, also used in different BFSMs. The proposed strategy is innovative, since PF problems have been solved in the literature by methods based on static programming. Tests with 14-bus, 33-bus, 84-bus, 136-bus, and 417-bus systems were carried to evaluate both the performance of the construction procedure of the dynamic tree in comparison to the classical branch ordering procedure and the performance of the PF calculation procedure using the proposed dynamic tree in contrast to traditional BFSMs. Promising results were obtained in both evaluated aspects. Therefore, this work contributes to the opening of new studies for a dynamic approach aimed at calculating the PF in radial distribution systems.https://ieeexplore.ieee.org/document/10815725/Backward/forward sweep methoddynamic programmingpower flow problemradial electric distribution systems |
| spellingShingle | Max R. Marinho Eliane S. Souza Lucas K. Sperotto Ruben Romero An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems IEEE Access Backward/forward sweep method dynamic programming power flow problem radial electric distribution systems |
| title | An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems |
| title_full | An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems |
| title_fullStr | An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems |
| title_full_unstemmed | An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems |
| title_short | An Innovative Strategy Based on Dynamic Programming to Solve Power Flow Problems in Radial Electric Distribution Systems |
| title_sort | innovative strategy based on dynamic programming to solve power flow problems in radial electric distribution systems |
| topic | Backward/forward sweep method dynamic programming power flow problem radial electric distribution systems |
| url | https://ieeexplore.ieee.org/document/10815725/ |
| work_keys_str_mv | AT maxrmarinho aninnovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT elianessouza aninnovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT lucasksperotto aninnovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT rubenromero aninnovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT maxrmarinho innovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT elianessouza innovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT lucasksperotto innovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems AT rubenromero innovativestrategybasedondynamicprogrammingtosolvepowerflowproblemsinradialelectricdistributionsystems |