Optimal security-constrained power scheduling by Benders decomposition

This paper presents a Benders decomposition approach to determine the optimal day-ahead power scheduling in a pool-organized power system, taking into account dispatch, network and security constraints. The study model considers the daily market and the technical constraints resolution as two differ...

Full description

Saved in:
Bibliographic Details
Published inElectric power systems research Vol. 77; no. 7; pp. 739 - 753
Main Authors Martínez-Crespo, Jorge, Usaola, Julio, Fernández, José L.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2007
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper presents a Benders decomposition approach to determine the optimal day-ahead power scheduling in a pool-organized power system, taking into account dispatch, network and security constraints. The study model considers the daily market and the technical constraints resolution as two different and consecutive processes. The daily market is solved in a first stage subject to economical criteria exclusively and then, the constraints solution algorithm is applied to this initial dispatch through the redispatching method. The Benders partitioning algorithm is applied to this constraints solution process to obtain an optimal secure power scheduling. The constraints solution includes a full AC network and security model to incorporate voltages magnitudes as they are a critical factor in some real power systems. The algorithm determines the active power committed to each generator 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 generators, the value of the transformers taps and the committed voltage control devices. The model has been tested in the IEEE 24-bus Reliability Test System and in an adapted IEEE 118-bus Test System. It is programmed in GAMS mathematical modeling language. Some relevant results are reported.
ISSN:0378-7796
1873-2046
DOI:10.1016/j.epsr.2006.06.009