Solving Discrete Optimal Power Flow Problem via Power Gird Topology Exploitation

Solving the optimal power flow problem can entail a heavy computational burden, especially pronounced when considering non-convex cost functions and many generators. In this paper, a divide-and-conquer strategy for power grids with discretised generator power output is proposed. The presented strategy allows for more efficient management and reduction of the associated search space. The ‘division’ is based on the power grid's topology. More specifically, considering a power grid an undirected graph, the proposed ‘division’ is based on vector cut sets of cardinality one. An analysis discussing when a ‘division’ of the power grid is beneficial and the uniqueness of the derived optimal ‘division’ as well as a case study are provided, too.