首页> 外文会议>2011 International Conference on Communication Systems and Network Technologies >Dynamic Programming Approach for Large Scale Unit Commitment Problem
【24h】

Dynamic Programming Approach for Large Scale Unit Commitment Problem

机译:大规模机组组合问题的动态规划方法

获取原文

摘要

In this paper, the large scale Unit Commitment (UC) problem has been solved using Dynamic Programming (DP) and the test results for conventional DP, Sequential DP and Truncation DP are compared with other stochastic techniques. The commitment is such that the total cost is minimal. The total cost includes both the production cost and the costs associated with start-up and shutdown of units. DP is an optimization technique which gives the optimal solution.
机译:本文使用动态规划(DP)解决了大规模单位承诺(UC)问题,并将常规DP,顺序DP和截断DP的测试结果与其他随机技术进行了比较。这样的承诺是总成本最小。总成本包括生产成本以及与设备启动和关闭相关的成本。 DP是一种提供最佳解决方案的优化技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号