基于RAGA的供水库群水资源配置模型研究

Optimal operation of feeding reservoir group based on RAGA

针对动态规划在供水库群优化调度中存在"维数灾",且难以获得真正最优解这一缺点,将改进的加速遗传算法应用到供水库群的水资源优化配置之中。在加速遗传算法中,嵌入局部搜索,以加强算法的全局寻优能力。以库群间的水利联系为线索,设计了相应的算法框架,并提出了供水策略区间的概念。为了体现该算法的优越性,以二个串联供水水库的水资源优化配置为例,选用该方法与基于动态规划的轮库迭代法进行比较研究。结果表明该方法合理可行、收敛速度快,有一定的实用性。

The paper presents an improved real allocation based accelerating genetic algorithm （RAGA） and its application to optimal feeding reservoir group operation, which overcomes the shortcoming of dynamic plan in the reservoir group operation, such as ＂dimension difficulty＂ or the problems of obtaining global optimum solution. The local search is embedded into RAGA to accelerate its convergence and enhance its global optimization ability. According to the water conservancy contact among reservoirs, an algorithm frame is designed base on RAGA and an idea of water supply strategy interval is put forward. To reveal its outstanding characters, the algorithm is contrasted with optimization by reservoir turns based on the dynami the optimal operation of the two reservoirs in series. The results show that it is reasonable and feasible and its cal planning in convergence is quite fast, which proves its advantages of the computing speed and global optimization.