A comparison of convex formulations for the joint planning of microgrids

(2017) 24th International Conference & Exhibition on Electricity Distribution (CIRED) — Location: Glasgow (12.June.2017)

Files

oap-cired2017.pdf
  • Open Access
  • Adobe PDF
  • 136.39 KB

Details

Authors
Abstract
Planning of autonomous microgrids differs from traditional distribution planning because of the need to plan investments not only in the network but also in generation capacity. Generation and distribution planning, traditionally performed separately should be done simultaneously in this case to provide a cost-effective planning solution. Joint planning of generation and distribution can be cast as mixed-integer non-linear integer program and is difficult to solve due to the presence of both integer variables and non-linear constraints. In this study, we use the framework of convex programming to tackle the joint planning problem. The study presents four different convex relaxations of this problem, with different levels of accuracy. We compare their results in terms of computation time and solution quality in order to determine the most relevant formulation to use in function of the problem size.
Affiliations

Citations

Martin, B., De Jaeger, E., & Glineur, F. (2017). A comparison of convex formulations for the joint planning of microgrids. CIRED, Open Access Proc. J, 2017, 2174-2178. https://doi.org/10.1049/oap-cired.2017.0841 (Original work published 2017)