Abstract
This paper proposes an emended snake optimizer (ESO) for solving hydrothermal, pumped hydro, and solar generators? non-convex, highly constrained, and non-linear power generation scheduling problem. The generation scheduling problem aims to reduce thermal generator operating costs and pollutants by maximizing hydro volume and utilizing solar power generation. The minimization of operating costs and pollutants is subjected to various constraints, like meeting load demand, active power generation violations, water volume utilization, etc. The conflicting objectives of the multiobjective generation scheduling are handled using the non-interactive approach exploiting the price-penalty method. The direct heuristics search is utilized to satisfy the load demand and water volume constraints. The snake optimization algorithm (SOA) often gets stuck in the local minima while solving complex engineering optimization problems, resulting in sluggish convergence behavior. The basic SOA is emended through simple search and opposition-based learning, enhancing exploitation, convergence behavior, and procuring near to global solutions. The simulation studies involve solving unconstrained standard benchmark problems and electric power system problems. The proposed emended snake optimizer offers significant cost savings for electric power systems ranging from 10-15%. Statistical analysis using Wilcoxon signed-rank test and Friedman?s test justifies the amendment. The rapid convergence behavior and Whisker box plots justify the proposed ESO?s robustness.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.