An enhanced dynamic programming approach for unit commitment

To investigate modeling problems with predefined unit hourly start-up ramps, the authors look at the method by which dynamic programming (DP) considers and reject combinations. An enhanced DP approach which saves predecessor options was developed and implemented in an online energy-management system. The method not only supports realistic modelling of unit start-up ramps, but it also involves the analysis of solution paths that may have been eliminated under traditional methods, thereby making better solutions possible. Sample results are given to demonstrate the benefits of the proposed algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>