An Algorithmic View on Optimal Storage Sizing
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FPK7MNXOrecord.jsonopen to challenge →
read the original abstract
Users can arbitrage against Time-of-Use (ToU) pricing with storage by charging in off-peak period and discharge in peak periods. In this paper we design the optimal control policy and the solve optimal investment for general ToU scheme. We formulate the problem as dynamic programming for efficient solution. Our result is feasible facing multi-peaked ToU scheme. Simulation studies examine how the user's cost varies with respect to the user's demand randomness; we also demonstrate the performance of our scheme when aggregating users for extra savings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.