Connectivity-and-hop-constrained design of electricity distribution networks

This paper addresses the problem of designing the configuration of an interconnected electricity distribution network, so as to maximize the minimum power margin over the feeders. In addition to the limitation of feeder power capacity, the distance (as hop count) between any customer and its allocated feeder is also limited for preventing power losses and voltage drops. Feasibility conditions are studied and a complexity analysis is performed before introducing a heuristic algorithm and two integer linear programming formulations for addressing the problem. A cutting-plane algorithm relying on the generation of two classes of cuts for enforcing connectivity and distance requirements respectively is proposed for solving the second integer linear programming formulation. All the approaches are then compared on a set of 190 instances before discussing their performances.

► We introduce and model an electricity distribution network with special hop-constraints. ► A complexity analysis, a heuristic and two exact formulations are proposed. ► An original cutting-plane approach is proposed for the second formulation. ► Numerical results show the advantage of this formulation and its solution approach.