Saved in:
Bibliographic Details
Main Authors: Regev, Shaked, Tsybina, Eve, Peles, Slaven
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.03977
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915890485788672
author Regev, Shaked
Tsybina, Eve
Peles, Slaven
author_facet Regev, Shaked
Tsybina, Eve
Peles, Slaven
contents We propose a novel computational method for unit commitment UC, which does not require linearized approximation and provides several orders of magnitude performance improvement over current state-of-the-art. The performance improvement is achieved by introducing a heuristic tailored for UC problems. The method can be implemented using existing continuous optimization solvers and adapted for different applications. We demonstrate value of the new method in examples of advanced UC analyses at the scale where use of current state-of-the-art tools is infeasible. We expect that the capability demonstrated in this paper will be critical to address emerging power systems challenges with more volatile large loads, such as data centers, and generation that is composed of larger number of smaller units, including significant behind-the-meter generation.
format Preprint
id arxiv_https___arxiv_org_abs_2602_03977
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Fast Relax-and-Round Unit Commitment with Sub-hourly Mechanical and Ramp Constraints
Regev, Shaked
Tsybina, Eve
Peles, Slaven
Optimization and Control
Mathematical Software
90C26
G.4; G.2; J.2
We propose a novel computational method for unit commitment UC, which does not require linearized approximation and provides several orders of magnitude performance improvement over current state-of-the-art. The performance improvement is achieved by introducing a heuristic tailored for UC problems. The method can be implemented using existing continuous optimization solvers and adapted for different applications. We demonstrate value of the new method in examples of advanced UC analyses at the scale where use of current state-of-the-art tools is infeasible. We expect that the capability demonstrated in this paper will be critical to address emerging power systems challenges with more volatile large loads, such as data centers, and generation that is composed of larger number of smaller units, including significant behind-the-meter generation.
title Fast Relax-and-Round Unit Commitment with Sub-hourly Mechanical and Ramp Constraints
topic Optimization and Control
Mathematical Software
90C26
G.4; G.2; J.2
url https://arxiv.org/abs/2602.03977