...
首页> 外文期刊>Electric power systems research >Unit commitment by genetic algorithm with specialized search operators
【24h】

Unit commitment by genetic algorithm with specialized search operators

机译:通过遗传算法与专门的搜索运算符进行单位承诺

获取原文
获取原文并翻译 | 示例
           

摘要

An approach for solving the unit commitment problem based on genetic algorithm with new search operators is presented. These operators, specific to the problem, are mutation with a probability of bit change depending on load demand, production and start-up costs of the generating units and transposition. The method incorporates time-dependent start-up costs, demand and reserve constraints, minimum up and down time constraints and units power generation limits. Repair algorithms or penalty factors in the objective function are applied to the infeasible solutions. Numerical results showed an improvement in the solution cost compared to the results obtained from genetic algorithm with standard operators and other techniques.
机译:提出了一种基于遗传算法的带有新搜索算子的机组承诺问题解决方法。这些操作员(具体针对该问题)会根据负载需求,发电机组的生产和启动成本以及换位而发生比特变化概率的突变。该方法结合了与时间有关的启动成本,需求和储备约束,最小的上下时间约束以及单位发电限制。目标函数中的修复算法或惩罚因子被应用于不可行的解决方案。数值结果表明,与使用标准算子和其他技术从遗传算法获得的结果相比,解决方案的成本有所提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号