Maximum number of starts and stops of a unit in unit commitment problem

Recieved: 09/05/2024

Accepted: 09/20/2024

Published: 01/31/2025

Keywords: wholesale electricity market, energy system scheduling, unit commitment, nonlinear optimization, mixed-integer programming

To cite this article

Davidson M.R. Maximum number of starts and stops of a unit in unit commitment problem. // Moscow University Journal. Series 15. Computational Mathematics and Cybernetics. 2025. N 1, p.43-48 https://doi.org/10.55959/MSU/0137–0782–15–2025–49–1–43–48.

This work is licensed under a Сreative Commons Atribiution - NonCommercial 4.0 International (CC BY-NC 4.0)

Davidson M.R. (Lomonosov Moscow State University (MSU))

Abstract

The paper studies unit max switch constraints in unit commitment problem. The unit commitment is a mixed integer problem widely used in short term energy system scheduling. Its computational complexity strongly depends on its dimension. According to Russian power energy market regulations max switch constraint is submitted by a participant and is active for arbitrary seven day time period. In the paper it is shown however
that it is sufficient to set this constraint in the model for only certain time periods. These are determined by times in seven day prehistory of the planning horizon where the unit changed state. Hence, vast majority of constraints of this type are redundant and could be safely removed from the model. This increases efficiency of the methods used to solve the resulting problem.