针对在求解大规模水电站群短期优化调度问题过程中,随电站数和时段数的增加,算法解算能力和时效性难以保证的问题,提出了一种基于水电站群分解的并行求解方法.该方法首先按照一定规则对目标电站群进行分解,形成若干相对独立的计算单元;随后应用逐次逼近动态规划、逐步优化方法,结合并行计算技术对电站群进行并行求解;最后通过归约整合得到整个电站群的优化结果.通过实例计算,证明了该方法的可行性;与串行方法的模拟结果对比,说明了该方法的有效性和优越性. In order to solve the short-term optimal scheduling problem of large-scale hydropower stations, this paper proposes a parallel solution method based on group decomposition of hydropower stations with the increase of the number of stations and the number of periods, and the difficulty of guaranteeing the solvability and timeliness of the algorithm. Firstly, the target power plant group is decomposed according to certain rules to form a number of relatively independent calculation units. Then, successive approximation dynamic programming and stepwise optimization methods are used to solve the power plant groups in parallel. Finally, the entire power plant group The results of the optimization show that the proposed method is feasible. Compared with the simulation results of the serial method, the effectiveness and superiority of the proposed method are demonstrated.