首页> 外文会议>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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号