院报 ›› 2017, Vol. 34 ›› Issue (7): 149-154.DOI: 10.11988/ckyyb.20151020

• 水利工程建设与管理 • 上一篇    

粗粒度并行自适应混合粒子群算法及其在梯级水库群优化调度中的应用

王 森1a,1b, 马志鹏1a, 李善综2, 熊 静1a   

  1. 1.珠江水利科学研究院 a.资源与环境研究所;b.水利部珠江河口动力学及伴生过程调控重点实验室,广州 510611;
    2.水利部 珠江水利委员会技术咨询中心,广州 510611
  • 收稿日期:2015-12-03 出版日期:2017-07-01 发布日期:2017-07-10
  • 通讯作者: 马志鹏(1979-),男,江苏江都人,高级工程师,博士,主要从事水文水资源系统分析等研究,(电话)020-87117019(电子信箱)zhipengma@163. com。
  • 作者简介:王 森(1986-),男,江西万载人,工程师,博士,主要从事水库群联合优化调度及水利信息化等研究,(电话)020-87117637(电子信箱)wangsen19861227@163.com。
  • 基金资助:
    国家重点研发计划资助项目(2017YFC0405905);水利部公益性行业科研专项(201401013,201501010)

Coarse-grained Parallel Adaptive Hybrid Particle Swarm Optimization Algorithm and Its Application to Optimal Operation of Cascaded Reservoirs

WANG Sen1,2, MA Zhi-peng1, LI Shan-zong3, XIONG Jing1   

  1. 1.Resources and Environment Department, Pearl River Water Conservancy Science Research Institute, Guangzhou 510611, China;
    2.Key Laboratory of Pearl River Estuarine Dynamics and Associated Process Regulation of the Ministry of Water Resources, Pearl River Water Conservancy Science Research Institute, Guangzhou 510611, China;
    3.Technical Advisory Center of Pearl River Resources Commission of the Ministry of Water Resources, Guangzhou 510611, China
  • Received:2015-12-03 Online:2017-07-01 Published:2017-07-10

摘要: 为了充分利用现今普及的多核配置计算机,提高大规模梯级水库群优化调度问题的求解效率,提出了梯级水库群优化调度的粗粒度并行自适应混合粒子群算法。该方法以自适应混合粒子群算法为求解基础,采用粗粒度并行设计模式,利用Fork/Join多核并行框架的分治策略,将其初始种群递归划分为多个子种群,平均分配到不同的内核逻辑线程中实现并行计算,并在各子种群优化结束后,合并优化结果集从而输出全局最优解。以澜沧江下游梯级水库群发电优化调度为例,利用该方法进行计算。结果表明,该方法能充分发挥多核配置的计算性能,在4核环境下最大加速比达到3.97,缩短计算耗时1 787.2 s,计算效率显著提高,为我国不断扩张的大规模梯级水库群优化调度提供了一种切实可行的高效求解途径。

关键词: 梯级水库群, 优化调度, 粗粒度, 多核并行, Fork/Join, 粒子群算法

Abstract: To improve the computing efficiency of optimal operation of large-scale cascaded reservoirs, a coarse-grained parallel adaptive hybrid particle swarm optimization (PAHPSO) algorithm is proposed in full use of the popular multi-core computers. The method is based on adaptive hybrid particle swarm optimization (AHPSO) algorithm, and adopts the coarse-grain model and divide-and-conquer strategy of Fork/Join multi-core parallel framework to divide the initial population into multiple small-scale subpopulations, which are assigned to different logical threads averagely for parallel computing. After the optimization computation for all subpopulations, the optimization result sets are merged to obtain the globally optimal solution. The proposed algorithm is applied to the generation and operation of cascaded reservoirs located on the lower stream of Lancang River. Results show that the method gives full play to multi-core computer performance, and the maximum speedup in 4-core parallel environment reaches 3.97 with the time-consuming cutting down by 1 787.2 s. The computing efficiency has improved significantly and it provides a feasible and efficient solution for the optimal operation of increasingly expanding large-scale cascaded reservoirs in China.

Key words: cascaded reservoirs, optimal operation, coarse-grain, multi-core parallel, Fork/Join, particle swarm optimization algorithm

中图分类号: 

Baidu
map