Fast dynamic programming with application to storage planning - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Fast dynamic programming with application to storage planning


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.
Fichier principal
Vignette du fichier
postprint.pdf (336.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01110689 , version 1 (06-03-2020)



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⟩
220 Consultations
141 Téléchargements



Gmail Facebook Twitter LinkedIn More