By Topic

Security-constrained optimal generation scheduling in large-scale power systems

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

3 Author(s)
Martinez-Crespo, J. ; Dept. of Electr. Eng., Univ. Carlos de Madrid, Spain ; Usaola, J. ; Fernandez, J.L.

This paper presents an approach to determine the optimal daily generation scheduling based on the Spanish electricity market rules. The Spanish power system considers the pool-based daily market and the technical constraints resolution as two different and consecutive processes. After the daily market has been cleared, a centralized constraints resolution process is applied to this initial scheduling through the redispatch of previously matched energy. In this paper, an algorithm based on Benders decomposition, arranged in three levels, is proposed to solve the technical constraints solution process in order to define a preventive secure dispatch. The constraints resolution process includes a full ac network and security model. This method determines the active power committed to each generating unit so as to minimize the energy redispatch cost subject to dispatch, network, and security constraints. The solution also provides the reactive power output of the generating units, the value of the transformers taps, and the committed voltage control devices. The model has been tested in an actual example of the Spanish power system. Some relevant results are reported.

Published in:

Power Systems, IEEE Transactions on  (Volume:21 ,  Issue: 1 )