...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Electric power systems research >Optimization of unit commitment problem with ramp-rate constraint and wrap-around scheduling
【24h】

Optimization of unit commitment problem with ramp-rate constraint and wrap-around scheduling

机译：带有斜坡速率约束和环绕调度的单元承诺问题的优化

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The unit commitment problem (UCP) is one of the most studied problems in power systems. The scheduling of the units to meet the forecasted power demand at each time instant at the minimum production cost, subject to a set of system constraints, makes it a complex nonlinear mixed-integer optimization problem. The complexity of the UCP increases further if the dynamic power limit based ramp-rate constraint is also taken into account. In the present work, the problem is made even more complicated by implementing the concept of wrap-around in scheduling, which allows to handle another practical scenario that a planning horizon is the repetition of a production cycle, e.g., a week in the UCP can be handled as the repetition of days, or a month as the repetition of weeks or days. Owing the inadequacy of deterministic methods to tackle this complicated model of the UCP, real-binary variants of three evolutionary algorithms are investigated and their comparative performances on some benchmark instances are analyzed.
机译：单位承诺问题（UCP）是电力系统中研究最多的问题之一。受到一系列系统约束的调度，以最小的生产成本满足每个时刻的预测功率需求，这使其成为一个复杂的非线性混合整数优化问题。如果还考虑了基于动态功率限制的斜坡速率约束，则UCP的复杂性将进一步增加。在当前工作中，通过在计划中实施环绕式概念使问题变得更加复杂，该概念允许处理另一种实际情况，即计划范围是生产周期的重复，例如在UCP中可以工作一周被视为几天的重复，或者一个月被视为几周或几天的重复。由于确定性方法不足以解决这种复杂的UCP模型，因此研究了三种进化算法的实际二进制变体，并分析了它们在某些基准实例上的比较性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号