Application Research of Improved Dynamic Programming for Economic Operation of Gezhouba Hydropower Station

This paper presents a algorithm based on priority list coupled with successive approximation dynamic programming for solving unit commitment problems of GeZhouba hydropower station to minimize water consumption as the optimization criterion, which can resolve effectively the “dimension disaster” problem in traditional dynamic programming. It is confirmed that the optimization speed of the algorithm improve significantly under the premise of the same optimal water consumption by comparing the water consumption and the optimization time with the traditional dynamic programming, successive approximation dynamic programming, priority list dynamic programming. The algorithm meets the daily operational requirements of Gezhouba hydropower station.