首页> 外文会议>Swarm, evolutionary, and memetic computing >Hydro-thermal Commitment Scheduling by Tabu Search Method with Cooling-Banking Constraints
【24h】

Hydro-thermal Commitment Scheduling by Tabu Search Method with Cooling-Banking Constraints

机译:基于禁忌搜索的冷却库约束水热发电调度

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

摘要

This paper presents a new approach for developing an algorithm for solving the Unit Commitment Problem (UCP) in a Hydro-thermal power system. Unit Commitment is a nonlinear optimization problem to determine the minimum cost turn on/off schedule of the generating units in a power system by satisfying both the forecasted load demand and various operating constraints of the generating units. The effectiveness of the proposed hybrid algorithm is proved by the numerical results shown comparing the generation cost solutions and computation time obtained by using Tabu Search Algorithm with other methods like Evolutionary Programming and Dynamic Programming in reaching proper unit commitment.
机译:本文提出了一种开发算法的新方法,该算法可以解决水火电系统中的机组承诺问题(UCP)。机组承诺是一个非线性优化问题,它通过满足预测的负荷需求和发电机组的各种运行约束来确定电力系统中发电机组的最小成本开/关时间表。数值结果比较了禁忌搜索算法与进化规划和动态规划等其他方法获得的发电成本解决方案和计算时间以达到适当的单位承诺,从而证明了该混合算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号