Rightsizing the Design of a Hybrid Microgrid

Selecting the sizes of distributed energy resources is a central planning element when designing a microgrid. Decision makers may consider several important factors, including, but not limited to, capacity, cost, reliability and sustainability. We introduce a method for rightsizing capacity that presents a range of potential microgrid design solutions, allowing decision makers to weigh their upsides and downsides based on a variety of measurable factors. We decouple component-specific modeling assumptions, energy management system logic and objective measurements from our simulation-based nested binary search method for rightsizing to meet power loads. In doing so, we develop a flexible, customizable and extensible approach to microgrid design planning. Aspects which have traditionally been incorporated directly in optimization-centric frameworks, such as resilience and reliability, can be treated as complementary analyses in our decoupled approach. This enables decision makers to gain exposure to a wide range of relevant information and actively participate in the microgrid design assessment process.

Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design

Microgrids are frequently employed in remote regions, in part because access to a larger electric grid is impossible, difficult, or compromises reliability and independence. Although small microgrids often employ spot generation, in which a diesel generator is attached directly to a load, microgrids that combine these individual loads and augment generators with photovoltaic cells and batteries as a distributed energy system are emerging as a safer, less costly alternative. We present a model that seeks the minimum-cost microgrid design and ideal dispatched power to support a small remote site for one year with hourly fidelity under a detailed battery model; this mixed-integer nonlinear program (MINLP) is intractable with commercial solvers but loosely coupled with respect to time. A mixed-integer linear program (MIP) approximates the model, and a partitioning scheme linearizes the bilinear terms. We introduce a novel policy for loosely coupled MIPs in which the system reverts to equivalent conditions at regular time intervals; this separates the problem into subproblems that we solve in parallel. We obtain solutions within 5% of optimality in at most six minutes across 14 MIP instances from the literature and solutions within 5% of optimality to the MINLP instances within 20 minutes.