Improving Large Scale Day-Ahead Security Constrained Unit Commitment Performance
- 25 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 31 (6), 4732-4743
- https://doi.org/10.1109/tpwrs.2016.2530811
Abstract
As part of the day-ahead market clearing process, MISO solves one of the most challenging Security Constrained Unit Commitment (SCUC) models. With footprint expansions and increased activity from financial traders, the day-ahead market unit commitment encounters significant performance challenges from time to time. This paper reviews MISO's day-ahead market clearing process and identifies the factors contributing to these performance challenges. It then shares techniques that have been developed to overcome these challenges. Three alternative backup solving approaches were developed. An incremental solving algorithm is proposed to better handle the iterative market clearing process and to perform solution polishing and commitment reason identification. Numerical results based on MISO data are presented.Keywords
This publication has 18 references indexed in Scilit:
- Exact Penalty Function Based Constraint Relaxation Method for Optimal Power Flow Considering Wind Generation UncertaintyIEEE Transactions on Power Systems, 2014
- A Systematic Method for Constructing Feasible Solution to SCUC Problem With Analytical Feasibility ConditionsIEEE Transactions on Power Systems, 2011
- Tight Mixed Integer Linear Programming Formulations for the Unit Commitment ProblemIEEE Transactions on Power Systems, 2011
- Formulation of Unit Commitment (UC) problems and analysis of available methodologies used for solving the problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- An Evolutionary Algorithm for Polishing Mixed Integer Programming SolutionsINFORMS Journal on Computing, 2007
- Progress in computational mixed integer programming—A look back from the other side of the tipping pointAnnals of Operations Research, 2007
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004
- Unit Commitment—A Bibliographical SurveyIEEE Transactions on Power Systems, 2004
- Market Operations in Electric Power SystemsPublished by Wiley ,2002
- A direct method for security-constrained unit commitmentIEEE Transactions on Power Systems, 1995