SECURITY-CONSTRAINED UNIT COMMITMENT

THE OBJECTIVE OF THE RESEARCH IS TO DEVELOP SCHEDULING ALGORITHMS FOR ELECTRIC GENERATION THAT ACCOUNT DIRECTLY FORSYSTEM SECURITY REQUIREMENTS. VIRTUALLY ALL ALGORITHMS IN USE CURRENTLY DO NOT OPTIMIZE GENERATING UNIT COMMITMENT DECISIONS AGAINST SECURITY REQUIREMENTS FROM THE OUTSET AND YIELD, THEREFORE, SUBOPTIMAL RESULTS WHEN THE COMMITMENT DECISIONS MUST BE ADJUSTED TO COMPLY WITH THESE REQUIREMENTS. UTILITIES CAN OBTAIN SIGNIFICANTLY BETTER RESULTS IF THEY USE OPTIMAL SCHEDULING ALGORITHMS THAT COMPLY DIRECTLY WITH SECURITY REQUIREMENTS. WHILE ALGORITHMS OF THIS TYPE HAD SEVERE COMPUTATIONAL REQUIREMENTS FIVE-TO-TEN YEARS AGO, RECENT ADVANCES IN NETWORK PROGRAMMING HAVE NOW MADE THESE ALGORITHMS MORE ATTRACTIVE. WE PROPOSE TO DEMONSTRATE THE PRACTICAL FEASIBILITY OF A NEW ALGORITHM FOR SOLVING THE SECURITY-CONSTRAINED UNIT SCHEDULING PROBLEM. THE INNOVATION OF OUR APPROACH IS TO CAPTURE THE SYSTEM SECURITY REQUIREMENTS WITHIN A NETWORK FLOW SUBPROBLEM THAT IS SOLVED IN CONJUNCTION WITH THE UNIT COMMITMENT PROBLEM. IN PHASE ONE OF THIS EFFORT WE WILL DEVELOP A PROTOTYPE IMPLEMENTATION OF THIS METHOD BY INTEGRATING A STATE-OF-THE-ART NETWORK FLOW ALGORITHM INTO AN ADVANCED UNIT COMMITMENT ALGORITHM. WE WILL DEMONSTRATE THE COST SAVINGS POSSIBLE WITH THIS ALGORITHM ON REALISTIC TEST CASES USING REPRESENTATIVE UTILITY DATA.