This paper presents a nested approach for generating long-term, medium-term, and short-term reservoir scheduling models, which is based on the actual needs of the scheduling operation of the Three Gorges–Gezhouba (TG-GZB) cascade reservoirs. The approach has established a five-tier optimal scheduling model in which the time interval of the scheduling plan prepared by the model can be as short as 15 min, meeting the real-time scheduling requirements of the cascade hydropower station system. This study also presents a comparatively comprehensive introduction to all solving algorithms that have ever been adopted in the multi-time scale coordinated and optimized scheduling model. Based on that, some practical and efficient solving algorithms are developed for the characteristics of the scheduling model, including the coupled iterative method of alternating reservoirs (CIMAR)—the improved dynamic programming (IDP) algorithm and the improved genetic algorithm (IGA). In addition, optimized-scheduling solutions were generated by each of the three algorithms and were compared in terms of their convergence rate, calculation time, electric energy generated, and standard deviation of the algorithm. The results based on the Cascade Scheduling and Communication System (CSCS) of Three Gorges–Gezhouba, China, which includes two interlinked mega-scale reservoir projects, show that scheduling models have better efficiency and good convergence, and more importantly, the maximization of the power generation benefits of the hydropower plants has been achieved without violating any of the reservoir scheduling regulations.
31 December 2025 in Information Processing & Management
This paper is intended to study the method of solving the economic load dispatch problem (ELDP) of hydropower plants via using memetic algorithm. Based on characteristics of economical operation of the hydropower plant, this paper proposes an improvement method of mutation operator and selection operator of memetic algorithm. Taking Three Gorges hydropower station in China as an example, the performance of memetic algorithm before and after improvement is tested separately. The test result shows that the average water consumption for simulation of the improved memetic algorithm is less than that for simulation of the standard memetic algorithm by 1.35%–16.19%. When the total load of the hydropower station is low (8GW-10GW), the water consumption for the improved memetic algorithm is less than that for the standard memetic algorithm by more than 10%. When the total load of the hydropower station is high (11GW-16GW), the water consumption for the improved memetic algorithm is less than that for the standard memetic algorithm by more than 1%. This shows that improvement of mutation operator and selection operator can improve the global and local optimization capacity of memetic algorithm a lot indeed. In addition, by comparing the optimization result of memetic algorithm with that of DP algorithm, it finds that the optimization result of improved memetic algorithm can reach the same precision of optimization result of DP algorithm. Therefore, using the improved memetic algorithm to solve the ELDP problem of large hydropower stations is practical and feasible. Since “curse of dimensionality” may occur frequently while using DP algorithm to solve the ELDP problem of large hydropower plants, as a new heuristic algorithm, memetic algorithm has obvious advantages in solving large-scale, complex, highly-dimensional and dynamic problems.