...
首页> 外文期刊>Journal of Water Resources Planning and Management >Research and Application of Multidimensional Dynamic Programming in Cascade Reservoirs Based on Multilayer Nested Structure
【24h】

Research and Application of Multidimensional Dynamic Programming in Cascade Reservoirs Based on Multilayer Nested Structure

机译:基于多层嵌套结构的梯级水库多维动态规划研究与应用

获取原文
获取原文并翻译 | 示例
           

摘要

The multidimensional dynamic programming (MDP) algorithm is a traditional method used to solve cascade reservoir operation optimization (CROO) problems, but the high dimensionality called the curse of dimensionalitycannot be ignored. In order to alleviate this problem, this paper proposes a new MDP algorithm named multilayer nested multidimensional dynamic programming (MNDP), which is based on a multilayered, nested structure. MNDP is mainly used to deal with computer memory space and computation complexity problems of MDP in CROO, and its recursive equation of reverse recursion calculation and specific calculation steps are presented in detail. This paper takes the cascade reservoirs of the Li Xianjiang River in China as an example to solve the CROO problem with the proposed MNDP. By comparing with the dynamic programming with successive approximations (DPSA) method, MNDP presents better performance in terms of power generation and the assurance rate in wet, normal, dry, and average years. The global optimality of MNDP is validated by MDP, and the parallel computing results of MNDP are shown in a case study. The MNDP proposed in this paper can reduce not only the programming complexity of MDP, but also the storage of intermediate variables during calculation, thus effectively solving the curse of dimensionality of MDP in CROO and keeping the global convergence feature of MDP.
机译:多维动态规划(MDP)算法是用于解决级联储层作业优化(CROO)问题的传统方法,但是称为维数诅咒的高维数不能忽略。为了缓解这个问题,本文提出了一种新的基于多层嵌套结构的MDP算法,称为多层嵌套多维动态规划(MNDP)。 MNDP主要用于处理CROO中MDP的计算机存储空间和计算复杂性问题,详细介绍了其反向递归计算的递推方程和具体的计算步骤。本文以中国漓江的梯级水库为例,通过提出的MNDP解决了CROO问题。通过与逐次逼近动态规划(DPSA)方法进行比较,MNDP在发电量,正常,正常,干燥和平均年份的发电率和保证率方面都表现出更好的性能。通过MDP验证了MNDP的全局最优性,并在案例研究中显示了MNDP的并行计算结果。本文提出的MNDP不仅可以降低MDP的编程复杂度,而且可以减少计算过程中中间变量的存储,从而有效地解决了CROO中MDP维数的诅咒,并保持了MDP的全局收敛性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号