Fast SCUC for large-scale power systems

被引:124
作者
Fu, Yong [1 ]
Shahidehpour, Mohammad [1 ]
机构
[1] IIT, Dept Elect & Comp Engn, Chicago, IL 60616 USA
关键词
Benders decomposition; mixed-integer programming; network security constraints; restructured power systems; security-constrained unit commitment;
D O I
10.1109/TPWRS.2007.907444
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In restructured power systems, independent system operators (ISOs) or regional transmission organizations (RTOs) execute the security-constrained unit commitment (SCUC) program to plan a secure and economical hourly generation schedule for the daily/weekly-ahead market. As the size of ISO/RTO increases, the current SCUC algorithms could face critical challenges ranging from modeling accuracy to calculation complexity. This paper introduces an efficient fast SCUC (F-SCUC) for large-scale power systems. Main components used in the proposed approach include single-hour unit commitment with network security, single-hour unit commitment adjustment, unit commitment, economic dispatch, and hourly network security check. A reasonable and operational strategy for fixing and unlocking the generating units is explored. The iterative SCUC solution is controlled efficiently to accelerate the execution. Finally, the quality of F-SCUC solution is improved by executing a quick MIP-based SCUC solution according to the F-SCUC results. A 1168-bus system Nvith 169 thermal units, a 4672-bus system with 676 thermal units, and two large systems with 1352 and 2704 thermal units are analyzed to exhibit the effectiveness of the proposed approach.
引用
收藏
页码:2144 / 2151
页数:8
相关论文
共 17 条
[1]  
[Anonymous], J OPT THEORY APPL
[2]   Optimal response of a thermal unit to an electricity spot market [J].
Arroyo, JM ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (03) :1098-1104
[3]   Modeling of start-up and shut-down power trajectories of thermal units [J].
Arroyo, JM ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2004, 19 (03) :1562-1568
[4]   A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem [J].
Carrion, Miguel ;
Arroyo, Jose M. .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (03) :1371-1378
[5]   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
[6]   Security-constrained unit commitment with AC constraints [J].
Fu, Y ;
Shahidehpour, M ;
Li, ZY .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (03) :1538-1550
[7]   The conditions for obtaining feasible solutions to security-constrained unit commitment problems [J].
Guan, XH ;
Guo, SG ;
Zhai, QZ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (04) :1746-1756
[8]   Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming [J].
Guan, XH ;
Zhai, QZ ;
Papalexopoulos, A .
2003 IEEE POWER ENGINEERING SOCIETY GENERAL MEETING, VOLS 1-4, CONFERENCE PROCEEDINGS, 2003, :1095-1100
[9]  
GUIGNARD M, LAGRANGEAN RELAXATIO
[10]   Price-based unit commitment: A case of Lagrangian relaxation versus mixed integer programming [J].
Li, T ;
Shahidehpour, M .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (04) :2015-2025