OPTIMAL NETWORK RECONFIGURATIONS IN DISTRIBUTION-SYSTEMS .2. SOLUTION ALGORITHMS AND NUMERICAL RESULTS

In this paper, based on a two-stage solution methodology and a modified simulated annealing technique, we develop a solution algorithm to the network reconfiguration problem which is a constrained, multi-objective, non-differentiable optimization problem. This solution algorithm allows the designer to obtain a desirable, global non-inferior point in a reasonable computation time. Also, given a desired number of switch-on/switch-off operations involved in the network reconfiguration, the solution algorithm can identify the most effective operations. In order to speed up the computation time required, the idea of approximate calculations is explored and incorporated into the solution algorithm, where two efficient load flow methods are employed; one for high temperature and the other for low temperature. The solution algorithm has been implemented in a software package and tested on a 69-bus system with very promising results. © 1990 IEEE