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

被引:21
|
作者
Ma, Yufei [1 ]
Zhong, Ping-an [1 ,2 ]
Xu, Bin [1 ,3 ]
Zhu, Feilin [1 ]
Lu, Qingwen [1 ]
Wang, Han [1 ]
机构
[1] Hohai Univ, Coll Hydrol & Water Resources, 1 Xikang Rd, Nanjing 210098, Peoples R China
[2] Hohai Univ, Natl Engn Res Ctr Water Resources Efficient Utili, 1 Xikang Rd, Nanjing 210098, Peoples R China
[3] Nanjing Hydraul Res Inst, State Key Lab Hydrol Water Resources & Hydraul En, 223 Guangzhou Rd, Nanjing 210029, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金; 国家重点研发计划;
关键词
Large-scale reservoir operation; Curse of dimensionality; Dynamic programming; Particle swarm optimization; Parallel computing; Cloud computing; GENETIC ALGORITHM; WATER-RESOURCES; OPERATION; PERFORMANCE; PLANTS;
D O I
10.1016/j.jhydrol.2021.126444
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
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.
引用
收藏
页数:15
相关论文
共 50 条
  • [31] Automated Negotiation using Parallel Particle Swarm Optimization for Cloud Computing Applications
    Alkayal, Entisar S.
    Jennings, Nicholas R.
    Abulkhair, Maysoon F.
    [J]. 2017 INTERNATIONAL CONFERENCE ON COMPUTER AND APPLICATIONS (ICCA), 2017, : 26 - 35
  • [32] A Distributed Quantum-Behaved Particle Swarm Optimization Using Opposition-Based Learning on Spark for Large-Scale Optimization Problem
    Zhang, Zhaojuan
    Wang, Wanliang
    Pan, Gaofeng
    [J]. MATHEMATICS, 2020, 8 (11) : 1 - 21
  • [33] Large-scale global optimization via swarm intelligence
    20162102421146
    [J]. (1) International Doctoral Innovation Centre, The University of Nottingham, Ningbo, United Kingdom; (2) Division of Computer Science, The University of Nottingham, Ningbo, United Kingdom; (3) Department of Electrical and Electronic Engineering, Xi’an Jiaotong-Liverpool University, Suzhou, China; (4) School of Science and Technology, Middlesex University, The Burroughs, London; NW4 4BT, United Kingdom, 1600, (Springer Science and Business Media, LLC):
  • [34] A Dual-Competition-Based Particle Swarm Optimizer for Large-Scale Optimization
    Gao, Weijun
    Peng, Xianjie
    Guo, Weian
    Li, Dongyang
    [J]. MATHEMATICS, 2024, 12 (11)
  • [35] Cooperative Particle Swarm Optimization Decomposition Methods for Large-scale Optimization
    Clark, Mitchell
    Ombuki-Berman, Beatrice
    Aksamit, Nicholas
    Engelbrecht, Andries
    [J]. 2022 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2022, : 1582 - 1591
  • [36] Dynamic multi-swarm particle swarm optimizer using parallel PC cluster systems for global optimization of large-scale multimodal functions
    Fan, Shu-Kai S.
    Chang, Ju-Ming
    [J]. ENGINEERING OPTIMIZATION, 2010, 42 (05) : 431 - 451
  • [38] Improved dynamic programming for parallel reservoir system operation optimization
    Zeng, Xiang
    Hu, Tiesong
    Cai, Ximing
    Zhou, Yuliang
    Wang, Xin
    [J]. ADVANCES IN WATER RESOURCES, 2019, 131
  • [39] A Novel Architecture for Task Scheduling Based on Dynamic Queues and Particle Swarm Optimization in Cloud Computing
    Ben Alla, Hicham
    Ben Alla, Said
    Ezzati, Abdellah
    [J]. 2016 2ND INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGIES AND APPLICATIONS (CLOUDTECH), 2016, : 108 - 114
  • [40] Distributed Parallel Particle Swarm Optimization for Multi-Objective and Many-Objective Large-Scale Optimization
    Cao, Bin
    Zhao, Jianwei
    Lv, Zhihan
    Liu, Xin
    Yang, Shan
    Kang, Xinyuan
    Kang, Kai
    [J]. IEEE ACCESS, 2017, 5 : 8214 - 8221