A Systematic Method for Constructing Feasible Solution to SCUC Problem With Analytical Feasibility Conditions
- 23 September 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 27 (1), 526-534
- https://doi.org/10.1109/tpwrs.2011.2165087
Abstract
Obtaining high-quality feasible solution is the core and the major difficulty in solving security-constrained unit commitment (SCUC) problems. This paper presents a systematic method for constructing feasible solutions to SCUC problem based on a group of analytical feasibility conditions. The feasibility check is performed based on the analytical necessary conditions such that most of infeasible UC states can be identified without solving LP problem. If a UC state is infeasible, it is adjusted with the possibly minimal operating cost increase based on the cost information. This UC adjusting issue is formulated as a zero-one programming problem and a branch and bound (B&B) method is established based on these feasibility conditions. Numerical testing is performed for a 31-bus system, an IEEE 24-bus system, and an IEEE 118-bus system. The testing results suggest that over 95% of infeasible UC states are identified by the analytical necessary conditions. The near-optimal feasible schedules for SCUC problem can be obtained efficiently by the proposed method. The feasible schedules obtained are compared with those obtained from mixed integer programming-based method in the IEEE 118-bus system. It is shown that the new method can produce competitive results in terms of solution quality and computational efficiency.Keywords
This publication has 22 references indexed in Scilit:
- Analytical conditions for determining feasible commitment states of SCUC problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- New Local Search Methods for Improving the Lagrangian-Relaxation-Based Unit Commitment SolutionIEEE Transactions on Power Systems, 2010
- Tighter Approximated MILP Formulations for Unit Commitment ProblemsIEEE Transactions on Power Systems, 2008
- The Conditions for Obtaining Feasible Solutions to Security-Constrained Unit Commitment ProblemsIEEE Transactions on Power Systems, 2005
- Modeling of Start-Up and Shut-Down Power Trajectories of Thermal UnitsIEEE Transactions on Power Systems, 2004
- Optimal response of a thermal unit to an electricity spot marketIEEE Transactions on Power Systems, 2000
- An evolutionary programming solution to the unit commitment problemIEEE Transactions on Power Systems, 1999
- Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxationIEEE Transactions on Power Systems, 1995
- An optimization-based method for unit commitmentInternational Journal of Electrical Power & Energy Systems, 1992
- Towards a more rigorous and practical unit commitment by Lagrangian relaxationIEEE Transactions on Power Systems, 1988