首页> 外文会议>2000 International Conference on Power System Technology >A Solution of Unit Commitment with Transmission and Voltage Constraints by Heuristic Method and Optimal Power Flow
【24h】

A Solution of Unit Commitment with Transmission and Voltage Constraints by Heuristic Method and Optimal Power Flow

机译:启发式法和最优潮流求解带电压约束的机组组合问题。

获取原文

摘要

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. In recent years, we have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we will propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to IEEE 118 test system with 36 generator over 24-period. The result shows that the proposed algorithm is capable to obtain satisfactory schedules without any constraint violation.
机译:针对具有传输和电压约束的短期机组承诺问题,提出了一种结合OPF的启发式算法。作为一个非常复杂的组合优化问题,单位承诺很难解决,特别是对于具有网络约束的大型电力系统。近年来,我们提出了一种基于平均满负荷成本而没有网络约束的启发式算法。在这项研究中,我们将结合启发式算法和OPF提出具有网络约束的单位承诺问题的解决方案。所提出的算法已应用于24周期内具有36个生成器的IEEE 118测试系统。结果表明,所提出的算法能够获得令人满意的调度,而没有任何约束冲突。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号