PNNL

Abstract

Interconnection studies for distributed energy resources (DERs) is a time-intensive process, primarily due to the necessity of solving large number of power flow scenarios. Hosting capacity analysis (HCA) is a time-consuming aspect of interconnection studies that is divided into single-site HCA (SHCA) and multi-site HCA (MHCA). From a computational and understandable standpoint, the industry seeks iteration-based solutions for SHCA, although it doesn't maximize the total DER hosting capacity (DERHC) of the grid, as MHCA does. While non-iterative solutions are available for MHCA, they involve a trade-off between the modeling accuracy of the distribution system, solution quality, and ease of understanding. In this work, we present a fast iterative solution for MHCA, reducing computational complexity by eliminating the need to solve power flows for a large amount of search space, thus making iterative solutions feasible. This iterative approach guarantees both a global optimal solution with sufficient time and a fast, close-to-optimal solution through efficient search space pruning. It also easily integrates with existing utility HCA tools. The results are demonstrated on select locations in the IEEE-123 bus system for community-scale interconnection studies. We highlight the benefits of skipping the need to solve millions of power flows, all while maximizing the grid's total DERHC.