A novel algorithm to the multi-stage grid expansion problem taking into account grid topology modifications and storage devices

In this paper an algorithm is introduced that solves the multi-stage grid expansion problem, which is extended by the following issues: Grid topology modifications in the form of dynamically added busses and electrical storage devices. The adapted mathematical formulation and the methodology to extend the conventional expansion problem as well as the algorithm to solve the resulting non-convex problem are presented. The computational results by drawing on test systems demonstrate the optimality of the solutions. The closing discussion illustrates the potentials and limitations of the methods developed.