.png){kind=icon}
返回
Self-Scheduling Short-Term Unit Commitment and Loading Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2014.2383911.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new method for solving the short-term unit commitment and loading problem for a specific hydropower system. Dynamic programming is used to compute maximum power output generated by a power plant. This information is then used as input of a two-phase optimization process. The first phase solves the relaxation of a nonlinear mixed-integer program in order to obtain the water discharge, reservoir volume and number of units working at each period in the planning horizon. The second stage solves a linear integer problem to determine which combination of turbines to use at each period. The goal is to maximize total energy produced over all periods of the planning horizon which consists of a week divided in hourly periods. Start-up of turbines are penalized. Numerical experiments are conducted on thirty different test cases for two Rio Tinto Alcan power plants with five turbines each.
Keyword:
Hydro unit commitment and loading problem
linear integer programming
nonlinear programming
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容