🤖 AI Summary
This work addresses the computational challenges of solving unit commitment (UC) problems under high-volatility load and distributed generation scenarios, where conventional approaches struggle with sub-hourly mechanical and ramping constraints and suffer from slow solution times. To overcome these limitations, the paper proposes a heuristic relaxation-and-rounding method that avoids linear approximations and instead leverages existing continuous optimization solvers enhanced with tailored heuristics to efficiently handle complex operational constraints. The approach preserves model fidelity while achieving speedups of several orders of magnitude. Experimental results demonstrate that the method successfully solves large-scale, sub-hourly UC instances that are intractable for current state-of-the-art tools, thereby substantially improving computational feasibility and practical applicability.
📝 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.