Applying different decomposition schemes using the progressive hedging algorithm to the operation planning problem of a hydrothermal system

被引:31
作者
Goncalves, Raphael E. C. [1 ]
Finardi, Erlon Cristian [1 ]
da Silva, Edson Luiz [1 ]
机构
[1] Univ Fed Santa Catarina, CTC, EEL, LabPlan,Elect Syst Planning Res Lab, BR-88040900 Florianopolis, SC, Brazil
关键词
Hydrothermal systems; Medium-term operation planning; Multi-stage linear stochastic optimization; Progressive hedging method; TRANSMISSION; OPTIMIZATION; AGGREGATION; CONSTRAINTS;
D O I
10.1016/j.epsr.2011.09.006
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses the solution of the Medium-Term Operation Planning (MTOP) problem. This operation scheduling problem aims to define the output of each power plant to minimize the expected production cost over a medium-term planning horizon. In hydrothermal systems, the MTOP is strongly influenced by the amount of water inflow to the reservoirs of hydroelectric plants, which is uncertain. Thus, the System Operator (SO) must consider these uncertainties in the problem resolution, which can be solved by means of Stochastic Programming (SP) techniques, such as the Progressive Hedging (PH) proposed in this paper. This paper presents suitable decomposition schemes to reduce the CPU time, such that it is possible to use a detailed model for the problem. Additionally, a parallel computational approach based on the PH algorithm is also implemented. To demonstrate the efficiency of the proposed schemes, a large hydrothermal system is investigated in the case studies. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:19 / 27
页数:9
相关论文
共 25 条
[1]  
[Anonymous], 1997, Introduction to stochastic programming
[2]   DAILY GENERATION SCHEDULING OPTIMIZATION WITH TRANSMISSION CONSTRAINTS - A NEW CLASS OF ALGORITHMS [J].
BATUT, J ;
RENAUD, A .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1992, 7 (03) :982-989
[3]   Unit commitment by augmented Lagrangian relaxation: Testing two decomposition approaches [J].
Beltran, C ;
Heredia, FJ .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2002, 112 (02) :295-314
[4]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[5]  
Berger A.J., 1994, SIAM J. Optim, V4, P735
[6]   A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs [J].
Birge, JR ;
Donohue, CJ ;
Holmes, DF ;
Svintsitski, OG .
MATHEMATICAL PROGRAMMING, 1996, 75 (02) :327-352
[7]  
da Costa J.P., 1997, 12 S BRAS REC HIDR A, P391
[8]  
da Silva EL, 2003, IEEE T PARALL DISTR, V14, P721, DOI 10.1109/TPDS.2003.1225052
[9]   Parallelization and aggregation ofnested Benders decomposition [J].
M. A. H. Dempster ;
R. T. Thompson .
Annals of Operations Research, 1998, 81 (0) :163-188
[10]   A parallel computation approach for solving multistage stochastic network problems [J].
Escudero, LF ;
De la Fuente, JL ;
García, C ;
Prieto, FJ .
ANNALS OF OPERATIONS RESEARCH, 1999, 90 (0) :131-160