A Multiobjective Heuristic for Reconfiguration of the Electrical Radial Network

Abstract

This paper proposes a new reconfiguration heuristic in order to reduce the total power loss and the maximum current of electrical radial networks. It is based on the branch-and-bound strategy, which is an implicit enumeration method that uses a tree structure and bounds to organize the searching process. The search tree in this paper is constructed by subdividing the feasible set using the branch-exchange technique in the networks. The constraints and the Pareto dominance are responsible for pruning the search tree. The heuristic also returns a feasible switching plan for each solution. The algorithm was successfully applied to medium- and large-scale problems.