Fast Relax-and-Round Unit Commitment with Sub-hourly Mechanical and Ramp Constraints
This addresses critical challenges in power systems with volatile loads and distributed generation, though it appears incremental as a heuristic improvement on existing methods.
The paper tackles the unit commitment problem in power systems by proposing a novel computational method that avoids linearized approximations, achieving several orders of magnitude performance improvement over state-of-the-art tools. This enables advanced analyses at scales previously infeasible.
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.