An efficient algorithm for network reconfiguration in large scale distribution systems

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of simulated annealing, we may use modified simulated annealing. All constraints are divided into two constraint groups by using a perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approach results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using KEPCO´s distribution systems