Skip to Main content Skip to Navigation
Conference papers

Fast dynamic programming with application to storage planning

Abstract : In this paper we propose a new class of algorithms that allows to solve a class of optimization problems including that of finding an optimal storage policy. The proposed algorithm is fast with a quadratic time or even quasi linear time in some cases. The gain in term of complexity with regard to the use of a commercial linear solver is shown empirically. A freely available package in the R statistical software has been implemented and is presented here. Possible extension to more complex framework are presented. This paper ends with an example of application for the determination of the market revenue of a storage device in a local price market as a function of location, energy capacity and power limits.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-mines-paristech.archives-ouvertes.fr/hal-01110689
Contributor : Magalie Prudon <>
Submitted on : Friday, March 6, 2020 - 8:45:54 PM
Last modification on : Tuesday, December 8, 2020 - 10:25:47 AM
Long-term archiving on: : Sunday, June 7, 2020 - 4:13:34 PM

File

postprint.pdf
Files produced by the author(s)

Identifiers

Citation

Robin Girard, Vincent Barbesant, Fiona Foucault, Georges Kariniotakis. Fast dynamic programming with application to storage planning. 2014 IEEE PES T&D Conference and Exposition, IEEE, Apr 2014, Chicago, IL, United States. ⟨10.1109/TDC.2014.6863551⟩. ⟨hal-01110689⟩

Share

Metrics

Record views

337

Files downloads

234