【24h】

Challenge: Modelling Unit Commitment as a Planning Problem

机译:挑战:将单位承诺建模为计划问题

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

摘要

Unit Commitment is a fundamental problem in power systems engineering, deciding which generating units to switch on, and when to switch them on, in order to efficiently meet anticipated demand. It has traditionally been solved as a Mixed Integer Programming (MIP) problem but upcoming changes to the power system drastically increase the MIP solution time. In this paper, we discuss the benefits that using planning may have over the established methods. We provide a formal description of Unit Commitment, and we present its formulation as MIP and as a planning problem. This is a novel and interesting application area for planning, with features that make the domain challenging for current planners.
机译:机组承诺是电力系统工程中的一个基本问题,它决定要打开哪些发电机组以及何时打开它们,以便有效地满足预期的需求。传统上,它已解决为混合整数编程(MIP)问题,但即将对电源系统进行的更改极大地增加了MIP解决方案的时间。在本文中,我们讨论了使用计划相对于既定方法可能带来的好处。我们提供单位承诺的正式描述,并将其表述为MIP和计划问题。这是一个新颖而有趣的规划应用程序领域,其功能使该领域对当前的规划者具有挑战性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号