Solving Hydropower Unit Commitment Problem Using a Novel Sequential Mixed Integer Linear Programming Approach

Abstract

Hydro Unit Commitment (HUC) is an important problem of power systems and when it is dealt with via a mathematical programming approach and optimization, it leads to the complicated class of mixed-integer nonlinear programming (MINLP). Many attempts have been made to solve the problem efficiently, while there is still ongoing research to come up with better solution schemes in terms of runtime and optimality. Highly nonlinear nature of the relationships and constraints in the optimization problem have forced the researchers to deal with the HUC problem in simplified manners which may result in impractical and unreliable solutions, i.e. schedules. Here in this paper we proposed a new method based on sequential mixed-integer linear programming (MILP) for solving a more realistic version of the HUC problem efficiently. We applied the proposed method to a cascade of two hydropower plants, Karun-3 and Karun-4, located in the Southwest of Iran. The sequential MILP approach was compared with several MINLP solvers of the GAMS optimization package. The results indicated that the proposed methodology outperformed the MINLP solvers in terms of efficiency, with solution time of less than 30 s, compared to 10 min that were given to the solvers, and in terms of optimality with more than 20 thousand cubic meters per day in water release. Additionally, we have explored the effect of penalizing the total number of startups on the total release, convergence of the algorithm, and the computation time. In all of the cases the total number of startups was reduced more than three times.