Fast and Accurate Hydro Unit Commitment
Abstract
We introduce a fast novel algorithm to commit hydro-generators. We show that our algorithm can commit 56 generators for 200 days 10,000 times faster than Hexaly, the leading commercial solver for scheduling problems, without sacrificing solution quality. Our method can commit 1792 generators for an entire year in approximately 20 seconds on commodity hardware. Hexaly is unable to solve problems of this size in reasonable time. We attain this runtime improvement by introducing a greedy-heuristic tailored for hydro units. We provide a direction for a possible proof that the error our solver makes decreases with the problem size. This is supported by our experimental results. We prove that our solver's runtime scales log-linearly in the number of generators and time periods.
Related
- Fast Relax-and-Round Unit Commitment with Topological Constraints
- Dynamic Operational Reserve Margin Assessment from Risk-Constrained Unit Commitment States
- Reinforcement learning on the EPRI AI-ccelerating Unit Commitment benchmark: diagnosing over-commitment and guiding MILP with learned policies
- Learning to Solve Two-Stage Stochastic Unit Commitment Problems with Quality Guarantees
- Unit commitment constrained Nash equilibrium in power markets
BibTeX
@misc{regev2026fast,
title = {{Fast and Accurate Hydro Unit Commitment}},
author = {Shaked Regev and Evan J. R. Brody},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40918},
eprint = {2610.40918},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40918},
}
RIS
TY - UNPB
TI - Fast and Accurate Hydro Unit Commitment
AU - Shaked Regev
AU - Evan J. R. Brody
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40918
UR - https://arxiv.org/abs/2610.40918
AB - We introduce a fast novel algorithm to commit hydro-generators. We show that our algorithm can commit 56 generators for 200 days 10,000 times faster than Hexaly, the leading commercial solver for scheduling problems, without sacrificing solution quality. Our method can commit 1792 generators for an entire year in approximately 20 seconds on commodity hardware. Hexaly is unable to solve problems of this size in reasonable time. We attain this runtime improvement by introducing a greedy-heuristic tailored for hydro units. We provide a direction for a possible proof that the error our solver makes decreases with the problem size. This is supported by our experimental results. We prove that our solver's runtime scales log-linearly in the number of generators and time periods.
ER -