...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Power and Energy Engineering >Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints
【24h】

Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints

机译：具有最优潮流约束的，基于自适应动态规划的安全受限单元组合的扩展顺序截断技术

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well.
机译：考虑到电力系统运行的经济性和安全性，本文提出了一种针对安全约束单元承诺（SCUC）问题的新型自适应动态规划方法。为响应动态规划的“尺寸诅咒”问题，该方法通过解决一系列简化的单阶段优化问题来近似解决SCUC的Bellman方程。提出了一种扩展的顺序截断技术来探索该方法的状态空间，该方法在单元承诺的每日成本方面优于传统的顺序截断。分析了24小时内从30到300辆公交车的不同测试案例。大量的数值比较表明，所提出的方法能够获得最佳的机组承诺计划，而不会违反任何网络和总线电压，并将运行成本降到最低。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号