Fast Identification of Inactive Security Constraints in SCUC Problems
Authors:
- 25 March 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 25 (4) , 1946-1954
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment ProblemIEEE Transactions on Power Systems, 2006
- The Conditions for Obtaining Feasible Solutions to Security-Constrained Unit Commitment ProblemsIEEE Transactions on Power Systems, 2005
- Unit Commitment With Flexible Generating UnitsIEEE Transactions on Power Systems, 2005
- Unit Commitment—A Bibliographical SurveyIEEE Transactions on Power Systems, 2004
- Particle swarm optimization to solving the economic dispatch considering the generator constraintsIEEE Transactions on Power Systems, 2003
- Hydrothermal scheduling by augmented Lagrangian: consideration of transmission constraints and pumped-storage unitsIEEE Transactions on Power Systems, 2001
- Unit commitment with transmission security and voltage constraintsIEEE Transactions on Power Systems, 1999
- A direct method for security-constrained unit commitmentIEEE Transactions on Power Systems, 1995
- Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxationIEEE Transactions on Power Systems, 1995
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962