Self-Scheduling Short-Term Unit Commitment and Loading Problem

作     者：Seguin, Sara Cote, Pascal Audet, Charles 

作者机构：Ecole Polytech Gerad Montreal PQ H3C 3A7 Canada Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Gerad Saguenay PQ G7S 4R5 Canada Rio Tinto Alcan Saguenay PQ G7S 4R5 Canada 

出 版 物：《IEEE TRANSACTIONS ON POWER SYSTEMS》 (IEEE Trans Power Syst)

年 卷 期：2016年第31卷第1期

页      面：133-142页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 

基　　金：FQRNT (fonds quebecois de la recherche sur la nature et les technologies) NSERC (natural sciences and engineering research council of Canada) Rio Tinto Alcan 

主　　题：Hydro unit commitment and loading problem linear integer programming nonlinear programming optimization 

摘      要：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.