Quadratic approximate dynamic programming for scheduling water resources: a case study
Authors:
- 28 September 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
We address the problem of scheduling water re-sources in a power system via approximate dynamic programming. To this goal, we model a finite horizon economic dispatch problem with convex stage cost and affine dynamics, and consider a quadratic approximation of the value functions. Evaluating the achieved policy entails solving a quadratic program at each time step, while value function fitting can be cast as a semidefinite program. We test our proposed algorithm on a simplified version of the Uruguayan power system, achieving a four percent cost reduction with respect to the myopic policy.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued ControlsIEEE Transactions on Automatic Control, 2013
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversionEuropean Journal of Operational Research, 2012
- Principal component analysisWIREs Computational Statistics, 2010
- Simulation–Optimization Modeling: A Survey and Potential Application in Reservoir Systems OperationWater Resources Management, 2009
- An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition ProblemMathematics of Operations Research, 2009
- Optimal Operation of Multireservoir Systems: State-of-the-Art ReviewJournal of Water Resources Planning and Management, 2004
- Semidefinite ProgrammingSIAM Review, 1996
- Multi-stage stochastic optimization applied to energy planningMathematical Programming, 1991
- Principal component analysisChemometrics and Intelligent Laboratory Systems, 1987
- Reservoir Management and Operations Models: A State‐of‐the‐Art ReviewWater Resources Research, 1985