Hydropower Unit Commitment Using a Genetic Algorithm with Dynamic Programming

Abstract

This study presents a genetic algorithm integrated with dynamic programming to address the challenges of the hydropower unit commitment problem, which is a nonlinear, nonconvex, and discrete optimization, involving the hourly scheduling of generators in a hydropower system to maximize benefits and meet various constraints. The introduction of a progressive generating discharge allocation enhances the performance of dynamic programming in fitness evaluations, allowing for the fulfillment of various constraints, such as unit start-up times, shutdown/operating durations, and output ranges, thereby reducing complexity and improving the efficiency of the genetic algorithm. The application of the genetic algorithm with dynamic programming and progressive generating discharge allocation at the Manwan Hydropower Plant in Yunnan Province, China, showcases increased flexibility in outflow allocation, reducing spillages by 79%, and expanding high-efficiency zones by 43%.

Keywords

• hydropower unit commitment (HUC)
• dynamic programming (DP)
• genetic algorithm (GA)
• progressive generating discharge allocation (PGDA)