Abstract
This paper presents a reconfiguration algorithm that is specially suited to large-scale distribution systems. The algorithm uses a heuristic strategy that starts with the system in a meshed status, with all maneuverable switches closed. The choice of the switches to be opened is based on the calculation of the minimum total system losses, using a load-flow program. A refinement on this procedure, based on branch status exchange, is described. The paper includes results and comparisons on test systems utilized in three classical papers published in the technical literature. Results obtained on a real large-scale distribution system are also presented.
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.
