Optimizing Hydropower Reservoirs Operation via an Orthogonal Progressive Optimality Algorithm

Abstract

The progressive optimality algorithm (POA) is commonly used to identify optimal hydropower operation schedules in China. However, POA may not converge within a reasonable time for large and complex problems because its computational burden grows exponentially with the expansion of system scale. In order to effectively alleviate the dimensionality problem of POA, an improved POA variant called orthogonal progressive optimality algorithm (OPOA) is introduced in this paper. In the OPOA, an orthogonal experimental design is used to replace the exhaustive combinatorial evaluation at each POA two-stage subproblem. The theoretical analysis shows that POA and OPOA have exponential and approximately polynomial growth in computational complexity, respectively. The proposed method is applied to a large-scale multireservoir system located on the Wu River in China. The results indicate that, compared with POA, OPOA can remarkably enhance the computing efficiency in different cases, showing its practicability and feasibility for multireservoir system operation.