Day‐ahead unit commitment for hydro‐thermal coordination with high participation of wind power

The variability and uncertainty of renewable resources impose new challenges in the operational planning related to the unit commitment of generation units. The development of day‐ahead multi‐period optimal power flow, under integration of wind power, requires modelling of multiple scenarios in orde...

Full description

Saved in:
Bibliographic Details
Published in:Energy systems integration 2023-06, Vol.5 (2), p.119-127
Main Authors: Zuluaga, Jorge, Murillo‐Sanchez, Carlos E., Moreno‐Chuquen, Ricardo, Chamorro, Harold R., Sood, Vijay K.
Format: Article
Language:English
Subjects:
Algorithms
Alternative energy sources
Computing time
day‐ahead dispatch
Decomposition
Electricity
hydro power
Integer programming
Linear programming
Power flow
progressive hedging
Renewable resources
Stochastic programming
Strategic planning
Unit commitment
Variables
Wind power
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The variability and uncertainty of renewable resources impose new challenges in the operational planning related to the unit commitment of generation units. The development of day‐ahead multi‐period optimal power flow, under integration of wind power, requires modelling of multiple scenarios in order to ensure an optimal power flow minimising the generation cost. A progressive hedging approach has been proposed and developed to solve efficiently the unit commitment problem as a two‐stage stochastic programming problem to update each stage in parallel. The performance of progressive hedging is compared with a standard mixed‐integer linear programming problem. The results indicate that the computation time is 50 times faster than standard mixed‐integer linear programming. The test case system is based on a reduced version of the interconnected Colombian system. The comparative results indicate an important reduction in computational time.
ISSN:2516-8401
2516-8401
DOI:10.1049/esi2.12078