Abstract
This article addresses the distribution network reconfiguration problem (DNRP) and the power flow method. The studied DNRP operates on standard configurations of electrical networks. The main objectives handled are the minimization of power loss, the number of switching operations and the deviations of bus voltages from their rated values. Metaheuristic approaches based on Greedy Iterated Local Search where proposed to solve the DNRP. A benchmarking testbed on standard systems well illustrates the incentive behind using GrILS for solving the DNRP. In addition, the proposed approaches and the power flow method where implemented on GPU architecture. The GPU implementation shows its effectiveness against the CPU in terms of time consuming specially for large-scale bus systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Energy Optimization and Engineering
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.
