...
首页> 外文期刊>Journal of control, automation and electrical systems >Memetic Algorithm for Solving Monthly Unit Commitment Problem Considering Uncertain Wind Power
【24h】

Memetic Algorithm for Solving Monthly Unit Commitment Problem Considering Uncertain Wind Power

机译:考虑不确定风力的月度单位承诺问题的遗漏算法

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

摘要

The continuous growth of wind power penetration has brought great challenges to the monthly unit commitment of power system. In order to deal with the monthly power generation schedule with large-scale wind power integration and maintain operating system economy and reliability, it is important to incorporate the interval prediction information of wind power under various confidence intervals into monthly unit commitment model considering risk costs caused by wind power curtailment and load shedding. To solve the above model, this paper proposes memetic algorithm based on a combination of global and local search, which introduces guided local search in the process of global search using genetic algorithm for the monthly unit commitment model with uncertain wind power. The excellent representatives selected from the local regions are used as the genetic operators to ensure the local extremum could be outputted in each iteration. In addition, the cost objective function is modified in time to change the terrain of search space, so as to avoid falling into the local optimal solution. Finally, the testing systems verify the validity and computation efficiency of the proposed method and algorithm.
机译:风力渗透率的持续增长为电力系统的月单位承诺带来了巨大的挑战。为了处理具有大规模风电集成的月发电计划并维持操作系统经济性和可靠性,考虑到造成风险成本,将风能的间隔预测信息纳入每月单位承诺模型。通过风力缩减和负载脱落。为了解决上述模型,本文提出了基于全局和本地搜索组合的迭代算法,其在全球搜索过程中介绍了使用遗传算法的遗传算法与不确定的风电。从当地区域中选择的优秀代表用作遗传操作员,以确保在每次迭代中可以输出局部极值。此外,成本目标函数及时修改以改变搜索空间的地形,以避免落入本地最佳解决方案。最后,测试系统验证了所提出的方法和算法的有效性和计算效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号