Metraipolis › archive › dc_7e18845ea457

Fast and Accurate Hydro Unit Commitment — arXiv:2610.40918

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40918
License (as archived)
CC0-1.0
Archived
2026-11-02T04:57:17.576Z
SHA-256 of the archived text
d36fa50697220d31ec1020abe193db2151945d216ccc4943f349a176d7f8887a
Stable URL of this page
https://metraipolis.com/documento/dc_7e18845ea457

How to cite

Fast and Accurate Hydro Unit Commitment — arXiv:2610.40918 — arXiv (en), https://arxiv.org/abs/2610.40918 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e18845ea457 (Metraipolis archive dc_7e18845ea457, sha256 d36fa50697220d31ec1020abe193db2151945d216ccc4943f349a176d7f8887a)
BibTeX
@misc{dc7e18845ea457,
  title = {Fast and Accurate Hydro Unit Commitment — arXiv:2610.40918},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40918},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e18845ea457; sha256 d36fa50697220d31ec1020abe193db2151945d216ccc4943f349a176d7f8887a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40918. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Mathematical Software (cs.MS); Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.40918 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:46:57.639Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).