Fast Identification of Inactive Security Constraints in SCUC Problems

Security constrained unit commitment (SCUC) is one of the most important daily tasks that independent system operators (ISOs) or regional transmission organizations (RTOs) must accomplish in daily electric power market. Security constraints have long been regarded as difficult constraints for unit commitment problems. If the inactive security constraints can be identified and eliminated, the SCUC problem can be greatly simplified. In this paper, a necessary and sufficient condition for a security constraint to be inactive is established. It is proved that all inactive constraints can be identified by solving a series of small-scale mixed integer linear programming (MILP) problems. More importantly, an analytical sufficient condition is established and most of the inactive constraints can be quickly identified without solving MILP or linear programming (LP) problems. A very important feature of the conditions obtained is that they are only related to the load demands and parameters of the transmission network. Numerical testing is performed for three power grids and the results are impressive. Over 85% of the security constraints are identified as inactive and the crucial transmission lines affecting the total operating cost are among those associated with the remaining security constraints, providing useful information for transmission planning.

[1]  M. Shahidehpour,et al.  Unit commitment with flexible generating units , 2005, IEEE Transactions on Power Systems.

[2]  P. S. Dokopoulos,et al.  Network-Constrained Economic Dispatch Using Real-Coded Genetic Algorithm , 2002, IEEE Power Engineering Review.

[3]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[4]  S. Al-Agtash,et al.  Hydrothermal Scheduling by Augmented Lagrangian: Consideration of Transmission Constraints and Pumped-Storage Units , 2001, IEEE Power Engineering Review.

[5]  A. Papalexopoulos,et al.  Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[6]  S. M. Shahidehpour,et al.  Unit commitment with transmission security and voltage constraints , 1999 .

[7]  M. Shahidehpour,et al.  Fast SCUC for Large-Scale Power Systems , 2007, IEEE Transactions on Power Systems.

[8]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[9]  Mohammad Shahidehpour,et al.  Market operations in electric power systems , 2002 .

[10]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[11]  Probability Subcommittee,et al.  IEEE Reliability Test System , 1979, IEEE Transactions on Power Apparatus and Systems.

[12]  N.P. Padhy,et al.  Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.

[13]  S. M. Shahidehpour,et al.  Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation , 1995 .

[14]  Zwe-Lee Gaing,et al.  Particle swarm optimization to solving the economic dispatch considering the generator constraints , 2003 .

[15]  J. J. Shaw,et al.  A direct method for security-constrained unit commitment , 1995 .

[16]  X. Guan,et al.  The conditions for obtaining feasible solutions to security-constrained unit commitment problems , 2005 .

[17]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[18]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[19]  J. Usaola,et al.  Security-constrained optimal generation scheduling in large-scale power systems , 2006, IEEE Transactions on Power Systems.

[20]  A.I. Cohen,et al.  Optimization-based methods for operations scheduling , 1987, Proceedings of the IEEE.