TY - JOUR
T1 - Data-Driven Planning for Renewable Distributed Generation Integration
AU - Fathabad, Abolhassan Mohammadi
AU - Cheng, Jianqiang
AU - Pan, Kai
AU - Qiu, Feng
N1 - Funding Information:
Manuscript received July 13, 2019; revised February 26, 2020; accepted May 10, 2020. Date of publication June 9, 2020; date of current version November 4, 2020. This work was supported in part by the Bisgrove Scholars program (sponsored by Science Foundation Arizona). The work of Kai Pan was supported in part by the Hong Kong Polytechnic University under Grant G-UAFD and in part by the Research Grants Council of Hong Kong under Grant PolyU 155077/18B. The work of Feng Qiu’s was supported by the Advanced Grid Modeling Program at the U.S. Department of Energy Office of Electricity under Grant DE-OE0000875. Paper no. TPWRS-01009-2019. (Corresponding author: Feng Qiu.) Abolhassan Mohammadi Fathabad and Jianqiang Cheng are with the Department of Systems and Industrial Engineering, University of Arizona, Tu-cosn, AZ 85721 USA (e-mail: [email protected]; jqcheng@ email.arizona.edu).
Publisher Copyright:
© 1969-2012 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020/11
Y1 - 2020/11
N2 - As significant amounts of renewable distributed generation (RDG) are installed in the power grid, it becomes increasingly important to plan RDG integration to maximize the utilization of renewable energy and mitigate unintended consequences, such as phase unbalance. One of the biggest challenges in RDG integration planning is the lack of sufficient information to characterize uncertainty (e.g., load and renewable output). In this paper, we propose a two-stage data-driven distributionally robust optimization model (O-DDSP) for the optimal placement of RDG resources, with both load and generation uncertainties described by a data-driven ambiguity set that both enables more flexibility than stochastic optimization (SO) and allows less conservative solutions than robust optimization (RO). The objective is to minimize the total cost of RDG installation plus the total operational cost on the planning horizon. Furthermore, we introduce a tight approximation of O-DDSP based on principal component analysis (leading to a model called P-DDSP), which reduces the original problem size by keeping the most valuable data in the ambiguity set. The performance of O-DDSP and P-DDSP is compared with SO and RO on the IEEE 33-bus radial network with a real data set, where we show that P-DDSP significantly speeds up the solution procedure, especially when the problem size increases. Indeed, as compared to SO and RO, which become computationally impractical for solving problems with large sample sizes, our proposed P-DDSP can use large samples to increase solution accuracy without increasing the solution time. Finally, extensive numerical experiments demonstrate that optimal RDG planning decisions lead to significant savings as well as increased renewable penetration.
AB - As significant amounts of renewable distributed generation (RDG) are installed in the power grid, it becomes increasingly important to plan RDG integration to maximize the utilization of renewable energy and mitigate unintended consequences, such as phase unbalance. One of the biggest challenges in RDG integration planning is the lack of sufficient information to characterize uncertainty (e.g., load and renewable output). In this paper, we propose a two-stage data-driven distributionally robust optimization model (O-DDSP) for the optimal placement of RDG resources, with both load and generation uncertainties described by a data-driven ambiguity set that both enables more flexibility than stochastic optimization (SO) and allows less conservative solutions than robust optimization (RO). The objective is to minimize the total cost of RDG installation plus the total operational cost on the planning horizon. Furthermore, we introduce a tight approximation of O-DDSP based on principal component analysis (leading to a model called P-DDSP), which reduces the original problem size by keeping the most valuable data in the ambiguity set. The performance of O-DDSP and P-DDSP is compared with SO and RO on the IEEE 33-bus radial network with a real data set, where we show that P-DDSP significantly speeds up the solution procedure, especially when the problem size increases. Indeed, as compared to SO and RO, which become computationally impractical for solving problems with large sample sizes, our proposed P-DDSP can use large samples to increase solution accuracy without increasing the solution time. Finally, extensive numerical experiments demonstrate that optimal RDG planning decisions lead to significant savings as well as increased renewable penetration.
KW - delayed constraint generation algorithm
KW - Distributionally robust optimization
KW - principal component analysis
KW - renewable distributed generation
KW - semidefinite programming
UR - http://www.scopus.com/inward/record.url?scp=85095970106&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2020.3001235
DO - 10.1109/TPWRS.2020.3001235
M3 - Journal article
AN - SCOPUS:85095970106
SN - 0885-8950
VL - 35
SP - 4357
EP - 4368
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 6
M1 - 9112707
ER -