Abstract
This article introduces the Grey Wolf Optimizer (GWO) algorithm, a novel method aimed at tackling the challenges posed by the multi-objective Optimal Power Flow (OPF) problem. Drawing inspiration from the foraging behavior of grey wolves, GWO stands apart from traditional approaches by enhancing initial solutions without relying on gradient data collection from the objective function. In the domain of power system optimization, the OPF problem is widely acknowledged, involving constraints related to generator parameters, valve-point loading, reactive power, and active power. The proposed GWO technique is applied to IEEE 14-bus and 30-bus power systems, targeting four case objectives: minimizing cost with quadratic cost function, minimizing cost with inclusion of valve point, minimizing power loss, and minimizing both cost and losses simultaneously. For the IEEE-14 bus system, which requires meeting a power demand of 259 MW, GWO yields optimal costs of 827.0056 $hr, 833.4691 $hr, 1083.2410 $hr, and 852.2255 $hr across the four cases. Similarly, for the IEEE-30 bus system aiming to satisfy a demand of 283.4 MW, GWO achieves optimal costs of 801.8623 $hr, 825.9321 $hr, 1028.6309 $hr, and 850.4794 $hr for the respective cases. These optimal results are then compared with existing research outcomes, highlighting the efficiency and cost-effectiveness of the GWO algorithm when juxtaposed with alternative methods for solving the OPF problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Intelligent Systems and Internet of Things
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.