Fast distribution network reconfiguration algorithm based on minus feasibility analysis unit

Because of the defects of the nonlinear optimization algorithm and the complexity of the physical constraints of the distribution network reconfiguration, the speed and the convergence of the algorithms are usually poor. A fast algorithm for distribution network reconfiguration based on feasibility...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing Jg. 76; H. 5; S. 3252 - 3265
Hauptverfasser: He, Yuqing, Lu, Pingjiang, Deng, Lujiu, Yin, Jianguo, He, Yuanyuan, Zhang, Zhenghua, He, Hongbin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.05.2020
Springer Nature B.V
Schlagworte:
Algorithms
Branch exchange method
Compilers
Computer Science
Dissipation factor
Feasibility studies
Impedance matrix
Interpreters
Optimization
Power loss
Processor Architectures
Programming Languages
Reconfiguration
Power loss
Branch exchange method
Network reconfiguration
Distribution network
Nodal impedance matrix
ISSN:0920-8542, 1573-0484
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Because of the defects of the nonlinear optimization algorithm and the complexity of the physical constraints of the distribution network reconfiguration, the speed and the convergence of the algorithms are usually poor. A fast algorithm for distribution network reconfiguration based on feasibility analysis unit is presented. Firstly, the network simplification method is presented based on the radial construction of the distribution network, and then the conception of basic loop is proved by using the impedance-branch dissipation power theory. By analyzing the quantitative relationship between load and branch power loss and the characteristics of the nodal impedance matrix, the basic loop that is just the minus feasibility analysis unit of the physical reconfiguration optimization is verified. Based on this theory, the path dissipation factor is presented which formed a novel heuristic rules and an improved branch exchange method in order to solve the distribution network reconfiguration problem. In this proposed method, the processing sequence of all the basic loops is firstly defined by the load dissipation component, and then optimal reconfiguration scheme is simply obtained by repeating the above operation until there is no branch need to exchange. Test results of IEEE-69 buses system verified the efficiency and reliably of the proposed method.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-018-2544-x