期刊文献+

流域梯级水库防洪优化调度数学模型及PSODP解法 被引量:9

Mathematical Model and PSODP Solution Method for Optimal for Flood Control Dispatching of Cascaded Reservoirs
在线阅读 下载PDF
导出
摘要 根据最大削峰准则,建立流域梯级水库防洪优化调度数学模型,采用马斯京根方程模拟梯级水库间洪水流动。引入粒子群优化(PSO)与死亡罚函数相结合的混合算法PSODP求解模型。实例计算表明,模型不仅有效地减小了整个流域梯级水库的洪灾损失风险,而且提高了流域梯级水电站的经济效益,同时验证了PSODP算法是可行、有效的,是求解此类问题的一种新的高效计算方法。 An optimal dispatching model of cascaded reservoirs for flood control according to the principle of the best flood peak reduction is proposed in this paper. The Muskingum Method is used to simulate flood routing in river reaches between upstream and downstream reservoirs. A hybrid algorithm of combining Particle Swarm Optimization with Death Penalty (PSODP)is presented to solve this model. The results of a case study show that the model not only decreases the risk of flood damage losses efficiently, but also increases the economic benefit of the cascaded hydropower plants. Furthermore, PSODP, a new method for solving this kind of problems, is highly effective and feasible.
出处 《水电能源科学》 2007年第1期34-37,共4页 Water Resources and Power
关键词 流域梯级水库 防洪优化调度 优化模型 粒子群优化算法 死亡罚函数 cascaded reservoirs optimal dispatching for flood control optimization model particle swarm optimization death penalty function
  • 相关文献

参考文献7

二级参考文献48

  • 1陈建春,马光文,王黎,过夏明,徐刚.梯级水电厂日竞价优化运行方式研究[J].水力发电学报,2004,23(4):11-15. 被引量:7
  • 2李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 3Eberhart R, Kennedy J. A New Optimizer Using Particles Swarm Theory[C]. Proc Sixth International Symposium on Micro Machine and Human Science. Nagoya, Japan: IEEE Service Center, Piseataway.1995.39-43.
  • 4Xie X, Zhang W, Yang Z. Adaptive Particle Swarm Optimization on Individual Level[C]. International Conference on Signal Processing (ICSP 2002). Beijing: 2002. 1215-1218.
  • 5Parsopoulos K E, Vrahatis M N. Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization[J]. Natural Computing, 2002, 1(2-3): 235-306.
  • 6Ray T, Liew K M. A Swarm Metaphor for Multiobjective Design Optimization [J]. Engineering Optimization,2002, 34(2): 141-153.
  • 7Lin S, Kernighan B W. An Effective Heuristic Algorithm for the Traveling Salesman Problem[J]. Operations Res, 1973, 21: 498-516.
  • 8黄岚 王康平 周春光.Hybrid Ant Colony Algorithm for Traveling Salesman Problem (基于蚂蚁算法的混合方法求解旅行商问题).Journal of Jilin Unlversity(Science Edition)[吉林大学学报(理学版)],2002,40(4):369-373.
  • 9Kennedy J, EberhartR. Particle swarm optimization[A]. Proceedings of IEEE Conference on Neural Networks[C]. Perth, Australia, 1995,4: 1942-1948.
  • 10Sensarma P S, Rahmani M. A comprehensive method for optimal expansion planning using particle swarm optimization [A]. Proceedings of the IEEE Power Engineering Society Transmission and Distribution Conference[C]. NewYork, USA, 2002: 1317-1322.

共引文献402

同被引文献124

引证文献9

二级引证文献234

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部