Tight Mixed-Integer Linear Programming Formulation for Energy Storage Assets in NCUC Problem

This paper presents a tight model of ideal and generic storage systems in the network-constrained unit commitment (NCUC) problem. Specifically, compared with the basic storage model, the minimum charging and discharging time requirement as well as the cycle limit of energy storage assets are introduced. Moreover, we introduce a new class of inequality constraints to provide a tighter description of feasible operation strategies. Numerical experiments on a modified IEEE 118-bus system with energy storage systems demonstrate the significant reduction in switching times and computational efforts to reach optimal solutions.