Skip to Main Content
Distribution network reconfiguration for loss minimization can is realized by changing the status of sectionalizing switch (close) and tie switch (open) while keeping the network configuration radial. The distribution reconfiguration belongs to multi constraints, high dimensions and none-linear combinatorial optimization problem. These characteristics determine solution space would increase explosively as the increase of switch numbers and infeasible solution would be produced largely in the process of switch combination. In this paper, an efficient searching algorithm is presented for distribution network optimization. This method combines the advantages of Switch group and Tabu searching. Switch group concept is adopted as coding for reducing infeasible solution candidates; Tabu search algorithm is applied for searching the best solution among candidates. At last, the presented method is validated by typical testing system and the comparison with other searching strategies is made to illustrate the effectiveness and reliability.