Abstract

The optimal reconfiguration of a distribution network is a constrained combinatorial problem where the open branches and the state of the switches are identified in order to maintain the radial configuration of the network and to minimise a specified objective function. Simulated annealing-based algorithms have been proposed as a useful technique for computing near-optimal solutions. The performance of these algorithms depends on the choice of several parameters. This paper deals with the effects of the parameter choice on the computation time and on the effectiveness of the solutions. Results of extensive tests performed on real urban distribution systems are presented and discussed.

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.