Beyond Hosting Capacity: Using Shortest-Path Methods to Minimize Upgrade Cost Pathways
| Autor: | Barry Mather, Nicolas Gensollen, Fei Ding, Kelsey A. W. Horowitz, Bryan Palmintier |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Sequence
Mathematical optimization Computer science 020209 energy Photovoltaic system Context (language use) 02 engineering and technology 010501 environmental sciences Condensed Matter Physics 01 natural sciences Electronic Optical and Magnetic Materials Upgrade Shortest path problem 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Minification Electrical and Electronic Engineering Heuristics 0105 earth and related environmental sciences |
| Zdroj: | IEEE Journal of Photovoltaics. 9:1051-1056 |
| ISSN: | 2156-3403 2156-3381 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|