A Distributed Algorithm for Distribution Network Reconfiguration

Distribution network reconfiguration algorithms change the status of sectionalizing and tie switches to reduce network line losses, relieve network overloads, minimize loss of load, or increase hosting capacity for distributed energy resources. Most of the existing work adopt centralized or hierarch...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 China International Conference on Electricity Distribution (CICED) s. 1730 - 1734
Hlavní autoři: Gao, Yuanqi, Wang, Peng, Yu, Nanpeng
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2018
Témata:
Conferences
Control systems
Convex functions
Distributed algorithms
distributed optimization
Distribution network reconfiguration
Load flow
Mathematical model
mixed-integer programming
Optimization
ISSN:2161-749X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Distribution network reconfiguration algorithms change the status of sectionalizing and tie switches to reduce network line losses, relieve network overloads, minimize loss of load, or increase hosting capacity for distributed energy resources. Most of the existing work adopt centralized or hierarchical approaches to solve the network reconfiguration problem. This paper proposes a distributed scheme for network reconfiguration. In the distributed approach, the switches are represented by edge computing agents who communicate and work collectively with their neighbors to find the optimal reconfiguration solution. This scheme breaks the complex computation tasks required by centralized algorithms into much smaller ones. It also relieves the communication and data sharing burden via neighbor-to-neighbor communication. Simulation results on a 16-bus distribution test feeder demonstrate that the quality of the distributed solution is comparable to that of the centralized approach.
ISSN:2161-749X
DOI:10.1109/CICED.2018.8592171