Abstract

Distribution system reconfiguration is achieved by changing the statuses of the switches. A number of targets of distribution system operation can be achieved after feeder reconfiguration operation. In general, while constructing the feeder reconfiguration, some factors need be considered. For example, primary feeder losses minimization, the number of switch actions reduction and voltage profile. Weighted sum method is used when multiple objective problems have to be solved. However, through the use of the weighted sum method, only one solution can be found. This is not preferred by distribution systems operators. So as to provide multiple compromise solutions, the multi-objective approach is one of the methods. In order to provide operators with different compromise solutions, A Non-Dominated Sorting Charged System Search (NDSCSS) is proposed to solve the multi-objective problems of distribution systems. Because the values of different factors are made using diverse topologies, these topologies can find different solutions. In order to generate a legal topology, the Zone Real Number Strings (ZRNS) encoding/decoding scheme is used. The 33-bus is implemented. The performance of Non-Dominated Sorting Evolutionary Programming (NSEP), Multi-Objective Particle Swarm Optimization (MOPSO) and Non-Dominated Sorting Charged System search (NDSCSS) are compared. The results indicate that NDSCSS can search for the best solutions among the three considered algorithms for distribution system reconfiguration problems.

Full Text
Paper version not known

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 call

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.