By Topic

Two-Stage Stochastic Programming Model for Market Clearing With Contingencies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Saric, A.T. ; Coll. of Eng., Northeastern Univ., Boston, MA, USA ; Murphy, F.H. ; Soyster, A.L. ; Stanković, A.M.

Planning for contingencies typically results in the use of more expensive facilities before disruptions. It leads to different prices and energy availability at various network locations depending on how the contingency analysis is performed. In this paper we present a two-stage stochastic programming model for incorporating contingencies. The model is computationally demanding, and made tractable by using an interior-point log-barrier method coupled with Benders decomposition. The second-stage optimal recourse function (RF) defines the most economically efficient actions in the post-contingency state for returning the system back to normal operating conditions. The approach is illustrated with for two examples: small (with 8 buses/11 branches) and IEEE medium-scale (with 300 buses/411 branches).

Published in:

Power Systems, IEEE Transactions on  (Volume:24 ,  Issue: 3 )