Abstract
The problem of the optimal placement of sectionalizing switches in radial distribution networks is studied. Tree-structure based algorithms for the computation of performance indexes for the given positions of sectionalizing switches are presented. It is shown that the algorithms are very efficient and can be useful in search methods that require the evaluation of reliability indexes for a large number of test selections. Efficient deterministic algorithms are presented to find the optimal allocation of a given number of sectionalizing switches to minimize a selected performance/reliability index. The performance of the algorithms is assessed using the existing distribution networks of various sizes. It is shown that the proposed algorithms outperform the state-of-the-art approaches in terms of computational efficiency.
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.
