Abstract
This paper presents a graph-based forward looking algorithm applied to distribution planning in the context of distributed photovoltaic penetration. We study the target hosting capacity problem where the objective is to find the least-cost sequence of system upgrades to reach a predefined hosting capacity target value. We show that commonly used short-term cost minimization approaches often lead to suboptimal long-term solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Because hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate that heuristics using domain-specific knowledge can be efficiently used to improve the algorithm performance, such that real distribution systems can be studied.
Original language | American English |
---|---|
Article number | 8721148 |
Pages (from-to) | 1051-1056 |
Number of pages | 6 |
Journal | IEEE Journal of Photovoltaics |
Volume | 9 |
Issue number | 4 |
DOIs | |
State | Published - Jul 2019 |
Bibliographical note
See NREL/CP-5D00-71565 for related conference paper preprintNREL Publication Number
- NREL/JA-5D00-74325
Keywords
- Decisions
- hosting capacity
- optimization
- shortest path