Optimal Unit Commitment with Transmission and Energy Constraints

具有传输和能源约束的最佳机组承诺

• 批准号: 9219151
• 负责人: Kevin Clements
• 金额: $ 20万
• 依托单位: Worcester Polytechnic Institute
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-08-01 至 1997-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9219151&HistoricalAwards=false
• 关键词: Optimal; Unit; Commitment; Transmission; Energy

9219151 Clements The research addresses the difficult problem of optimizing generation scheduling with full network transmission constraints. The problem is intractable as stated. The approach taken here is to decompose the large problem into three related subproblems. One is the familiar optimal power flow problem. Another incorporates minimum up-time and down-time constraints; it is a relatively simple dynamic programming problem. The third, a quadratic programming problem, is subject to "ramping" and energy constraints. Efficient iterative solution of these three subproblems requires the development of specially tailored interior point algorithms and the use of innovative new ideas for adjusting the augmented Lagragian penalty parameter. ***

9219151克莱门茨的研究解决了困难的问题，优化发电调度与全网络传输约束。 如前所述，这个问题很难解决。 这里采取的方法是将大问题分解为三个相关的子问题。 一个是常见的最优潮流问题。 另一个包含最小的启动时间和停机时间的限制，这是一个相对简单的动态规划问题。 第三，一个二次规划问题，是受“斜坡”和能源的限制。 这三个子问题的有效迭代求解需要开发专门定制的内点算法和使用创新的新思路来调整增广拉格朗日罚参数。 ***