Mathematical representation of radiality constraint in distribution system reconfiguration problem
Distribution systems are modeled as planar graphs. The proposed model is used to formulate radiality constraint for network optimization. This formulation is proven to be more efficient than other variants. Network reconfiguration is formulated as a mixed-integer programming problem. The formulated problem can be solved to its global optimum using available solvers.
radiality constraint distribution system reconfiguration planar graph mixed-integer programming dual graph minimum spanning tree