Dynamic planning dimension reduction reservoir scheduling method based on dynamic search and discrete mechanism

Abstract

The invention belongs to the technical field related to reservoir scheduling, and particularly relates to a dynamic planning dimension reduction reservoir scheduling method based on a dynamic search and discrete mechanism. The method comprises the following steps: S1, determining an upper limit and a lower limit of an initial reservoir capacity of a reservoir to be processed; S2, dispersing the continuous curve of the storage capacity and the time into a plurality of moments, and updating the upper limit and the lower limit of the storage capacity corresponding to each moment; S3, dividing a part between the upper limit and the lower limit of the storage capacity at each moment into a plurality of equal parts to obtain the number of discrete points so as to obtain the number of the required discrete points; and S4, inputting the required discrete points and the upper limit and the lower limit of the reservoir capacity corresponding to each moment into a target function corresponding to the maximum peak clipping criterion of the reservoir so as to obtain the maximum discharge flow and the calculation time of the reservoir. By means of the method, the problems that in the dynamic planning calculation process, the number of discrete points is small, the discharged flow is negative, the dispersion degree is large, and the calculation time is long are solved.

Description

Technical field [0001] The present invention belongs to the technical field related to the scheduling reservoir, and more particularly, to a method of scheduling reservoir dynamic programming based search and discrete dynamic yield dimensionality reduction mechanism. Background technique [0002] Reservoir operation is usually a multi-target, multi-attribute, multi-stage complex decision-making process, direct impact on the overall efficiency of the management of critical reservoir plays, the level of the reservoir operation level for the entire run of the reservoir, while the traditional linear optimization, nonlinear Although optimized scheduling model can be used to solve the reservoirs, but there is often simplified or solving problems such as ineffective. [0003] Dynamic programming model is RESERVOIR scheduling algorithm for solving one of the most classic algorithm has the advantage of global convergence and no initial solutions and the like, the segment dimension reducti...

AI Technical Summary

Problems solved by technology

[0004] Aiming at the above defects or improvement needs of the prior art, the present invention provides a dynamic planning and dimensionality reduction reservoir dispatching method based on the dynamic retrieval and discrete mechanism, so as to solve the problem that there are few discrete points in the dynamic planning and calculation process, and the discharge flow Negative, and the dispersion is very large, the calculation time is very long

Images