Security-Constrained Unit Commitment

安全约束单位承诺

• 批准号: 9160169
• 负责人: John Shaw
• 金额: $ 5万
• 依托单位: Alphatech Inc
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-01-15 至 1992-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9160169&HistoricalAwards=false
• 关键词: Security; Constrained; Unit; Commitment

The objective of the research is to develop scheduling algorithms for electric generation that account directly for system security requirements. Virtually all algorithms in use currently do not optimize generating unit commitment decisions against security requirements from the outset and yield, therefore, suboptimal results when the commitment decisions must be adjusted to comply with these requirements. Utilities can obtain significantly better results if they use optimal scheduling algorithms that comply directly with security requirements. While algorithms of this type had severe computational requirements, five-to-ten years ago, recent advances in network programming have now made these algorithms more attractive. The PI proposes to demonstrate the practical feasibility of a new algorithm for solving the security-constrained unit scheduling problem. The innovation of our approach is to capture the system security requirements within a network flow subproblem that is solved in conjunction with the unit commitment problem. In Phase One of this effort we will develop a prototype implementation of this method by integrating a state-of-the-art network flow algorithm into an advanced unit commitment algorithm. We will demonstrate the cost savings possible with this algorithm on realistic test cases using representative utility data.

研究的目的是发展调度 发电的算法， 系统安全要求。 几乎所有 目前使用的算法不能优化生成 机组安全投入决策 从一开始就要求，因此， 当承诺决策 必须进行调整以符合这些要求。 公用事业公司可以获得更好的结果，如果他们 使用直接符合的最佳调度算法 安全要求。 虽然这种算法 类型有严格的计算要求，5到10 几年前，网络编程的最新进展 使得这些算法更有吸引力。 PI建议证明实际可行性 一个新的算法来解决安全约束 单元调度问题 我们的创新 方法是捕获系统安全需求 在网络流子问题中， 与单位承诺问题相结合。 在 在第一阶段，我们将开发一个原型 通过集成一个 将最先进网络流算法 先进的机组组合算法 我们将 展示了通过这种方式可能节省的成本 算法在实际测试用例上使用代表性 实用数据。