首页> 外文期刊>Water Resources Management >Reducing Irrigation Deficiencies Based Optimizing Model for Multi-Reservoir Systems Utilizing Spider Monkey Algorithm
【24h】

Reducing Irrigation Deficiencies Based Optimizing Model for Multi-Reservoir Systems Utilizing Spider Monkey Algorithm

机译:基于蜘蛛猴算法的多水库减灌亏缺优化模型

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

摘要

Continuous droughts and water scarcity have led to the need for optimal exploitation of dams' reservoirs. Thus, the new meta-heuristic algorithm, spider monkey, is suggested for complex modeling of the multi-reservoir system in Iran with the aim of decreasing irrigation deficiencies. Golestan and Voshmgir dams' operations are optimized with the spider monkey algorithm. The algorithm based on the exchange of information between local and global leaders with the other monkeys which improves the convergence speed. Average deficiencies for Golestan dam is computed as 2.1 and 1.9 MCM by spider monkey algorithm while it is respectively computed as 6.7, 16.4, 11.1, 4.1, 14.6, 19 MCM by particle swarm algorithm, harmony search algorithm, imperialist competitive algorithm, water cycle algorithm, genetic algorithm, and standards operation policy method. Also, the computation time of the spider monkey algorithm is 50 and 47 s for the Golestan and Voshmgir dams while the genetic algorithm optimizes the problem in 172.6 s and 112 s and the particle swarm algorithm needs 117.4 s and 100 s for the Golestan and Voshmgir, respectively. Also, root means square error (RMSE) and mean absolute error between demand and released water for the spider monkey algorithm have the least values among the applied evolutionary algorithms. Thus, the spider monkey algorithm is suggested as an appropriate method for optimizing the operation policy for the dam and reservoir systems.
机译:持续的干旱和缺水导致需要对大坝水库进行最佳开发。因此,建议采用新的元启发式算法“蜘蛛猴”对伊朗的多水库系统进行复杂建模,以减少灌溉不足。 Golestan和Voshmgir大坝的运行通过蜘蛛猴算法进行了优化。该算法基于本地和全球领导者与其他猴子之间的信息交换,从而提高了收敛速度。蜘蛛猴算法将Golestan大坝的平均缺陷计算为2.1和1.9 MCM,而粒子群算法,和声搜索算法,帝国主义竞争算法,水循环算法分别将其计算为6.7、16.4、11.1、4.1、14.6、19 MCM ,遗传算法和标准操作策略方法。同样,对于Golestan和Voshmgir大坝,蜘蛛猴算法的计算时间分别为50和47 s,而遗传算法在172.6 s和112 s中对问题进行了优化,对于Golestan和Voshmgir,粒子群算法需要117.4 s和100 s , 分别。而且,在应用的进化算法中,蜘蛛猴算法的均方根误差(RMSE)和需求量与释放水量之间的平均绝对误差值最小。因此,建议将蜘蛛猴算法作为优化大坝和水库系统运行策略的适当方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号