【24h】

The fast algorithm of short-term unit commitment

机译:短期单位承诺的快速算法

获取原文

摘要

The power industry is one of the major energy industries, and how to dispatch the generators to minimize the operation cost with system security is the most important target for power dispatchers. When power dispatchers propose a day-ahead generation plan, they usually consider load balanced, unit characteristics, fuel consumption and other system constraints, that are also considered in the short-term unit commitment problem. This paper proposes the short-term unit commitment model with mixed integer linear programming that the objective function is total generation cost with unit constraints and system constraints. Due to the computing time of solving the unit commitment problem with a complete model is very long; it cannot support a proposal to the power dispatchers in a short time. So this paper also proposes the simplified model combined with a two-stage algorithm and using the simplified model's solution as the parameter of the complete model to speed up the solution. And this paper uses Taipower's nine thermal units to verify accuracy.
机译:电力行业是主要的能源行业之一,如何调度发电机以最大限度地减少系统安全性的运营成本是功率调度仪最重要的目标。当电力调度员提出一天的一代发电计划时,他们通常会考虑负载平衡,单位特征,燃料消耗和其他系统限制,这些系统也在短期单位承诺问题中考虑。本文提出了具有混合整数线性规划的短期单位承诺模型,目标函数是单位限制和系统约束的总成成本。由于使用完整模型解决单位承诺问题的计算时间很长;它无法在短时间内支持对电力调度员的提议。因此,本文还提出了简化模型与两阶段算法相结合,并使用简化的模型解决方案作为完整模型的参数,以加快解决方案。本文采用Taipower的九个热单元来验证精度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号