Abstract
Network reconfiguration is of theoretical and practical significance to guarantee safe and economical operation of distribution system. In this paper, based on all spanning trees of undirected graph, a novel genetic algorithm for electric distribution network reconfiguration is proposed. Above all, all spanning trees of simplified graph of distribution network are found. Tie branches are obtained with spanning tree subtracted from simplified graph. There is one and only one switch open on each tie branch. Decimal identity number of open switch on each tie branch is taken as the optimization variable. Therefore, the length of chromosome is very short. Each spanning tree corresponds to one subpopulation. Gene operations of each subpopulation are implemented with parallel computing method. Individuals of offspring after gene operation automatically meet with radial and connected constraints for distribution network operation. Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation, which result in very low searching efficiency, are completely overcome. High calculation speed and superior capability of the proposed method are validated by two test cases.
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 callDisclaimer: 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.
