Solving optimal power dispatch using artificial algorithm for Nordic 44 network

Optimal power flow (OPF) problems play a central role in planning and operating a transmission power system in a reliable, flexible and secure manner. In this paper, a significant intelligent algorithm based on the Particle Swarm Optimization method is proposed for solving the optimal reactive power...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of high speed networks 2019-01, Vol.25 (3), p.301-310
Hauptverfasser: Monshizadeh, Shohreh, Hegglid, Gunne John, Hagen, Svein Thore
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Optimal power flow (OPF) problems play a central role in planning and operating a transmission power system in a reliable, flexible and secure manner. In this paper, a significant intelligent algorithm based on the Particle Swarm Optimization method is proposed for solving the optimal reactive power dispatch (ORPD) problem by adjusting equality and inequality constraints. The objective function which is considered for optimal active and reactive power dispatch is the minimization of transmission power losses. In order to solve ORPD problems, Particle Swarm Optimization (PSO) based on the Newton Raphson method is coded with MATLAB software and the results of the simulation are compared to the Interior Point method as the classical method for minimization transmission losses in the Nordic 44 system. The Nordic 44 system consists of three countries, including Norway, Finland, and Sweden, and has 44 buses, 67 branches and 61 generators. The results illustrate the effectiveness of the proposed algorithm compared to the other methods for the minimization of total power losses for Nordic 44. The simulation results of the proposed method for the Nordic 44 system are compared to the results of the PSO algorithm for the ORPD problem in several networks, including IEEE 14 buses, 30 buses, and 57 buses.
ISSN:0926-6801
1875-8940
DOI:10.3233/JHS-190617