Hydrothermal scheduling using Benders decomposition: Accelerating techniques

被引:65
作者
Sifuentes, Wilfredo S. [1 ]
Vargas, Alberto [1 ]
机构
[1] Univ Nacl San Juan, Inst Energia Elect, San Juan, Argentina
关键词
Benders decomposition; hydrothermal scheduling; optimal power flow; unit commitment;
D O I
10.1109/TPWRS.2007.901751
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new decomposition method is presented that includes the network through ac modeling within the hydrothermal scheduling optimization process including the losses. In short-term hydrothermal scheduling, the transmission network is typically modeled with dc power flow techniques. Such modeling, however, can lead to impractical solutions when it is verified with ac power flow. Another proposal considers in thermal systems the ac network modeling but not the optimization of losses. The approach presented here addresses issues such as congestion management and control of service quality that often arise in large and weakly meshed networks-the typical pattern of power systems in Latin America. Generalized Benders decomposition and traditional, well-known optimization techniques are used to solve this problem. The master problem stage defines the generation levels by regarding the inter-temporal constraints, whereas the subproblem stage determines both the active and the reactive economical dispatches for each time interval of the load curve. It meets the electrical constraints through a modified ac optimal power flow (OPF). Another important contribution is the inclusion of accelerating techniques aimed at reducing the number of iterations and CPU time. The methodology was proven in a real system and test systems. Results are discussed in this paper.
引用
收藏
页码:1351 / 1359
页数:9
相关论文
共 25 条
[1]   Hydrothermal scheduling by augmented Lagrangian: Consideration of transmission constraints and pumped-storage units [J].
Al-Agtash, S .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2001, 16 (04) :750-756
[2]   Multiperiod optimal power flow using benders decomposition [J].
Alguacil, N ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (01) :196-201
[3]   THE GENERALIZED UNIT COMMITMENT PROBLEM [J].
BALDICK, R .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1995, 10 (01) :465-475
[4]   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
[5]  
DAN S, 2005, P IEEE POW ENG SOC G, V3, P2724
[6]  
DOFIA VM, 2001, 9 ERLAC FOZ IG BRAZ
[7]  
El-Hawary ME, 1996, OPTIMAL POWER FLOW S
[8]   AC contingency dispatch based on security-constrained unit commitment [J].
Fu, Y ;
Shahidehpour, M ;
Li, ZY .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (02) :897-908
[9]   Security-constrained unit commitment with AC constraints [J].
Fu, Y ;
Shahidehpour, M ;
Li, ZY .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (03) :1538-1550
[10]  
GARCIAGONZALEZ J, 2001, POW TECH P 2001 IEEE, V3, P6