GC_DistributionNetworkReconfiguration module

class GC_DistributionNetworkReconfiguration.DistributionNetworkReconfiguration(grid=None, verbose_logging=20)

Bases: object

Library of Distribution Network Reconfiguration algorithms Constraints : radial topology without unconnected nodes Available algorithms : - Heuristic : Baran (1989), Merlin (1975), Morton (2000), MSTgreedy, Salkuti (2021) - Metaheuristic : Jakus (2020), Khalil-Gorpinich (2012) - Mathematical : Jabr-Taylor (2012), Taylor-gurobi (2012), Taylor-pyomo 2012)

The input is the grid The output is the list of disabled lines

example: mst = sp.src(G) mst_Prim_edges = mst.Solve(‘Prim’)

Solve(method='Baran', *args, **kwargs)

once the class is initialize, the only available function is the Solve function, which obtains the MST based on the algorithm given by the argument ‘method’, which is ‘Kruskal’ by default

__init__(grid=None, verbose_logging=20)

to initialize the class requires the grid format (openDSS, GridCal or PandaPower) and the grid file name