Recent Results on Approximate Optimization Methods for the Unit Commitment Problem

摘要

This work provides an account of recently proposed methods to address the Unit Commitment (UC) problem. In the UC problem, the goal is to schedule a subset of a given group of electrical power generating units and also to determine their production output in order to meet energy demands at minimum cost. In addition, the solution must satisfy a set of technological and operational constraints. Here, computational results are reported for the most effective methodologies. Amongst the problems chosen to report the computational results are the most frequently used benchmark problems, due to Kazarlis, Bakirtzis and Petridis. In the problems considered, the units, which can be up to 100, have to be scheduled for 24-hour period.