Practical Solution for the Reconfiguration Problem in Electrical Distribution Networks: A Constructive Heuristic Approach

Abstract

The problem regarding the reconfiguration of electrical distribution grids is addressed in this research through the implementation of a practical solution using a constructive heuristic algorithm. The most important characteristic of the proposed heuristic approach is its low-computation effort, given that few power flow solutions are required in order to solve the reconfiguration problem. The constructive algorithm starts its exploration of the solution space by closing all the tie lines form a fully meshed distribution network. The distribution line with the minimum current is permanently opened. A new power flow evaluation is made for the new distribution system, and the distribution line with the minimum current is opened if and only if this action does not generate isolated nodes. This procedure is repeated until the number of closed lines is equal to the number of nodes minus one, which is a condition required to maintain a radial configuration. Numerical validations in test feeders composed of 16, 33, 69, 84, 136, and 415 nodes demonstrate that the proposed constructive algorithm finds adequate solutions with minimum processing times. The proposed approach is practical for distribution companies since its implementation only requires a power flow tool for distribution networks that can deal with radial and meshed configurations.

Keywords

• Constructive heuristic algorithm
• Power flow solution
• Radial and meshed distribution grids
• Minimum current concept
• Nodal ordering algorithm