首页> 外文期刊>Journal of Electrical Engineering >An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints
【24h】

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints

机译:带有冷却库约束的机组组合问题基于进化规划的禁忌搜索方法

获取原文
       

摘要

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.
机译:带有冷却库约束的机组承诺问题的基于进化规划的禁忌搜索方法本文提出了一种基于带有冷却和库岸约束的基于进化规划的禁忌搜索方法来解决短期机组承诺问题的新方法。显示了数值结果,比较了使用进化规划方法和其他常规方法(例如动态规划,拉格朗日松弛)获得的成本解决方案和计算时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号