A Fast Relax-and-Round Approach to Unit Commitment for Data Center Own Generation

TL;DR

This paper introduces a fast relax-and-round method for the unit commitment problem in data center generation, significantly reducing solution time while maintaining accuracy, and scalable to large systems.

Contribution

It presents a novel relaxation and rounding approach for large-scale unit commitment problems, enabling rapid solutions suitable for data center energy management.

Findings

Solution time reduced from 10 hours to less than a second for 276 units.

Method scales efficiently to tens of thousands of generators.

Approach is parallel and GPU compatible for further acceleration.

Abstract

The rapid growth of data centers increasingly requires data center operators to "bring own generation" to complement the available utility power plants to supply all or part of data center load. This practice sharply increases the number of generators on the bulk power system and shifts operational focus toward fuel costs rather than traditional startup and runtime constraints. Conventional mixed-integer unit commitment formulations are not well suited for systems with thousands of flexible, fast-cycling units. We propose a unit commitment formulation that relaxes binary commitment decisions by allowing generators to be fractionally on, enabling the use of algorithms for continuous solvers. We then use a rounding approach to get a feasible unit commitment. For a 276-unit system, solution time decreases from 10 hours to less than a second, with no accuracy degradation. Our approach scales with no issues to tens of thousands of generators, which allows solving problems on the scale of the major North America interconnections. The bulk of computation is parallel and GPU compatible, enabling further acceleration in future work.