Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger
Contributeur : Magalie Prudon <>
Soumis le : vendredi 6 mars 2020 - 20:45:54
Dernière modification le : mercredi 14 octobre 2020 - 04:02:33
Archivage à long terme le : : dimanche 7 juin 2020 - 16:13:34


Fichiers produits par l'(les) auteur(s)



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⟩



Consultations de la notice


Téléchargements de fichiers