Difference between revisions of "DER VET User Guide/Model Details"

From EPRI Storage Wiki
Jump to navigation Jump to search
m (1 revision imported)
m
Line 1: Line 1:
{{DISPLAYTITLE: {{SUBPAGENAME}}}}
{{DISPLAYTITLE: {{SUBPAGENAME}}}}


This section of the DER-VET User Guide will contain details about the implementation of the models in DER-VET. This section can help users build intuition about how to use DER-VEt, understand the background processes that yield their results, interrogate unexpected results, and set themselves up to modify the code.
This section of the DER-VET User Guide will contain details about the implementation of the models in DER-VET. This section can help users build intuition about how to use DER-VET, understand the background processes that yield their results, interrogate unexpected results, and set themselves up to modify the code.


tldr; DER-VET, by default, provides an upper bound on the value a set of DERs can achieve and corresponding optimal DER size by meaningfully stacking services and coordinating DER operation.
tldr; DER-VET, by default, provides an upper bound on the value a set of DERs can achieve and corresponding optimal DER size by meaningfully stacking services and coordinating DER operation.

Revision as of 12:12, 4 May 2021


This section of the DER-VET User Guide will contain details about the implementation of the models in DER-VET. This section can help users build intuition about how to use DER-VET, understand the background processes that yield their results, interrogate unexpected results, and set themselves up to modify the code.

tldr; DER-VET, by default, provides an upper bound on the value a set of DERs can achieve and corresponding optimal DER size by meaningfully stacking services and coordinating DER operation.

DER-VET Model Overview

DER-VET is an optimization-based value estimating model (see Perfect Foresight Optimization) for energy storage systems and other DERs. DER-VET models the operation of DERs at a user-input time scale (time steps are typically 15 minutes to 1 hour) and optimizes their size by solving a net present cost minimizing optimization problem that simultaneously solves for the operation of each DER at each time step and their size, when applicable. This optimization problem is constrained by the technical capabilities/limitations of the DERs and by constraints imposed by services, such as a reliability objective (see Services).

Index

Perfect Foresight Optimization

Optimization Horizon

Optimization Years

Mixed Integer Optimization

Benefit Cost Analysis

Size Optimization

Service Stacking