4.7 Article

Spark-based parallel dynamic programming and particle swarm optimization via cloud computing for a large-scale reservoir system

Journal

JOURNAL OF HYDROLOGY
Volume 598, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.jhydrol.2021.126444

Keywords

Large-scale reservoir operation; Curse of dimensionality; Dynamic programming; Particle swarm optimization; Parallel computing; Cloud computing

Funding

  1. National Key R&D Program of China [2017YFC0405606]
  2. National Natural Science Foundation of China [52079037, 52009029]
  3. Fundamental Research Funds for the Central Universities [B210203012, B200202032]
  4. China Postdoctoral Science Foundation [2020T130169, 2019M661715]

Ask authors/readers for more resources

This study compares parallel dynamic programming (SPDP) with parallel particle swarm optimization (SPPSO) via cloud computing for the optimal operation of a large-scale reservoir system. The results show that SPDP outperforms SPPSO in terms of parallel performance and precision, with SPPSO having faster convergence speed but lower precision compared to SPDP. Overall, DP solves more accurately and efficiently than PSO via parallel cloud computing, ensuring global search capability of the algorithm. Cloud computing is highlighted as flexible, economical, safe, and with high practical value and application prospects.
The joint optimal operation of a large-scale reservoir system is a complex optimization problem with highdimensional, multi-stage, and nonlinear features. As the number of reservoirs and discrete states increase, the runtime of optimal operation model increases exponentially, leading to the phenomenon of curse of dimensionality. Traditional multi-core parallel computing can improve the efficiency to a certain extent, but it is difficult to expand and break through the hardware limitation, which is not suitable for the optimization of the large-scale reservoir system and its refined management. Different from the current literature about reservoir operations that focus on the comparisons of dynamic programming (DP) with particle swarm optimization (PSO) algorithm in serial mode, this paper pays emphasis on a comparison study of parallel DP with parallel PSO via cloud computing. This study proposes the spark-based parallel dynamic programming (SPDP) and spark-based parallel particle swarm optimization (SPPSO) methods via cloud computing. Taking the cascade eightreservoir system in the Yuanshui basin in China as an example, simulation experiments are carried out for the comparison between SPDP and SPPSO in terms of parallel performance, precision, efficiency, and stability. The results are as follows: (1) The parallel performance of SPDP in the cloud environment is better than SPPSO. (2) Under the same runtime, the precision of SPDP is generally higher than that of SPPSO. (3) Setting the same precision, the runtime of SPPSO is on average 255.18% longer than SPDP, and it does not reach the precision of SPDP. (4) SPPSO has a fast convergence speed and the ability to jump out of the local optimal solution, but its precision increases by 0.41%, while the runtime increases by 229.55% with the increase of iterations. DP solves more accurately and efficiently than PSO via parallel cloud computing, which ensures the global search capability of the algorithm. Moreover, cloud computing is flexible, economical, and safe, with high practical value and application prospects.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available