Improved adaptive gaining-sharing knowledge algorithm with FDB-based guiding mechanism for optimization of optimal reactive power flow problem
Optimal reactive power flow (ORPF) is of great importance for the electrical reliability and economic operation of modern power systems. The integration of distributed generations (DGs) and two-terminal high voltage direct current (HVDC) systems into electrical networks has further complicated the O...
Gespeichert in:
Veröffentlicht in: | Electrical engineering 2023-10, Vol.105 (5), p.3121-3160 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Optimal reactive power flow (ORPF) is of great importance for the electrical reliability and economic operation of modern power systems. The integration of distributed generations (DGs) and two-terminal high voltage direct current (HVDC) systems into electrical networks has further complicated the ORPF problem. Due to the high computational complexity of the ORPF problem, a powerful and robust optimization algorithm is required to solve it. This paper proposes a powerful metaheuristic algorithm namely fitness-distance balance-based adaptive gaining-sharing knowledge (FDBAGSK). In the performance evaluation, 39 IEEE CEC benchmark functions are used to compare FDBAGSK with the original AGSK algorithm. Moreover, the proposed algorithm is applied to perform the ORPF task in modified IEEE 30- and IEEE 57-bus test systems. The effectiveness of the FDBAGSK method was tested for the optimization of three non-convex objectives: active power loss, voltage deviation and voltage stability index. The ORPF results obtained from the FDBAGSK algorithm are compared with other optimization algorithms in the literature. Given that all results are together, it has been observed that FDBAGSK is an effective method that can be used in solving global optimization and constrained real-world engineering problems. |
---|---|
ISSN: | 0948-7921 1432-0487 |
DOI: | 10.1007/s00202-023-01803-9 |