Optimal long-term distributed generation planning and reconfiguration of distribution systems: An accelerating Benders' decomposition approach
Journal of Optimization Theory and Applications, 2018•Springer
In this paper, we study the multi-period distributed generation planning problem in a
multistage hierarchical distribution network. We first formulate the problem as a non-convex
mixed-integer nonlinear programming problem. Since the proposed model is non-convex
and generally hard to solve, we convexify the model based on semi-definite programming.
Then, we use a customized Benders' decomposition method with valid cuts to solve the
convex relaxation model. Computational results show that the proposed algorithm provides …
multistage hierarchical distribution network. We first formulate the problem as a non-convex
mixed-integer nonlinear programming problem. Since the proposed model is non-convex
and generally hard to solve, we convexify the model based on semi-definite programming.
Then, we use a customized Benders' decomposition method with valid cuts to solve the
convex relaxation model. Computational results show that the proposed algorithm provides …
Abstract
In this paper, we study the multi-period distributed generation planning problem in a multistage hierarchical distribution network. We first formulate the problem as a non-convex mixed-integer nonlinear programming problem. Since the proposed model is non-convex and generally hard to solve, we convexify the model based on semi-definite programming. Then, we use a customized Benders’ decomposition method with valid cuts to solve the convex relaxation model. Computational results show that the proposed algorithm provides an efficient way to solve the problem for relatively large-scale networks.
Springer