首页> 外文会议>2010 Sixth International Conference on Natural Computation >New genetic algorithm for hydropower plants unit commitment optimization
【24h】

New genetic algorithm for hydropower plants unit commitment optimization

机译:水电厂机组组合优化的新遗传算法

获取原文

摘要

Unit commitment for daily generation scheduling of hydropower plants is a very important issue, and reasonable unit commitment running can bring obvious economic profit, so research of daily generation scheduling has great and far-reaching real-life significance. Through taking the minimum water consumption as objective, the mathematic model is established under daily load task, which is described to two aspects, including state combination and load distribution of units. A new genetic algorithm (NGA) is presented, which adopts dual coding with binary coding and real coding, and performs dual genetic operation with a double crossover and a double mutation for each individual. Realization method of NGA is also designed. In this method, penalty function is used as constraints to reduce the production of non-feasible solution. The result of calculation example shows that NGA is feasible and efficient for daily commitment optimization and its convergence performance is better than GA, with a broad search space and fast convergence and good solution quality.
机译:水电厂日发电调度的机组承诺是一个非常重要的问题,合理的机组运行可以带来明显的经济效益,因此对日发电调度的研究具有重大而深远的现实意义。通过以最小耗水量为目标,建立了日负荷任务下的数学模型,从状态组合和机组负荷分布两个方面对数学模型进行了描述。提出了一种新的遗传算法(NGA),该算法采用二进制编码和实数编码双重编码,并对每个个体进行双重交叉和双重突变的双重遗传运算。还设计了NGA的实现方法。在这种方法中,惩罚函数被用作约束,以减少不可行解的产生。算例结果表明,NGA在日常承诺优化中是可行且高效的,其收敛性能优于GA,具有广阔的搜索空间,收敛速度快,求解质量好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号