Fast Relax-and-Round Unit Commitment with Sub-hourly Mechanical and Ramp Constraints

TL;DR

This paper introduces a fast heuristic method for unit commitment that avoids linearization, significantly improving computational performance and enabling advanced analyses of complex power systems with high volatility.

Contribution

The paper presents a novel heuristic for unit commitment that enhances computational efficiency without linear approximation, suitable for large-scale, complex power system problems.

Findings

Achieves several orders of magnitude speedup over existing methods.

Enables analysis of power systems with high volatility and many small units.

Compatible with existing optimization solvers.

Abstract

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.