前言在过去十年中,人们应用包括从模拟到最优化的数学技术对水库调度进行了研究。由于水库调度要进行连续判断和解非线性方程,所以一般采用动态规划方法(简称 DP法)。DP 法存在的主要缺点是维数问题。为了选择四座水库系统每小时调度方案,Larson 和 Keckler 应用增态 DP 法,使四座水库的日运行费用最省。将水库看作 DP 状态,Meredith 用离散微分 DP 方法求得了串联水库的泄水方案。因大部分水库是多目标服务(如:发电,防洪和供水)水库,所以要求有多目标的水库调度模型变得更加突出。为了寻求单座水库的月放水方案,Tauxe 等 Preface Over the past decade, research has been conducted on reservoir dispatch using mathematical techniques ranging from simulation to optimization. As the reservoir scheduling to reconcile and reconcile the nonlinear equation, so the general use of dynamic programming (referred to as the DP method). The main disadvantage of the DP method is the dimensionality problem. In order to select an hourly schedule for four reservoir systems, Larson and Keckler applied the incremental DP method to minimize the daily operating costs of the four reservoirs. Taking the reservoir as the DP state, Meredith obtained the drainage scheme of the series reservoir by using the discrete differential DP method. Because most of the reservoirs are reservoirs for multi-objective services such as power generation, flood control and water supply, the multi-objective reservoir scheduling model is becoming more prominent. In an effort to find a monthly drainage program for single-seaters, Tauxe et al