Benders decomposition; security-constrained optimal power flow; contingency filtering
Abstract :
[en] This paper deals with techniques to solve the corrective security-constrained
optimal power flow (CSCOPF) problem. To this end, we propose
a new iterative approach that comprises four modules: a CSCOPF which
considers only a subset of potentially binding contingencies among
the postulated ones, a (steady-state) security analysis (SSSA), a
contingency filtering (CF) technique, and an OPF variant to check
post-contingency state feasibility when taking into account
post-contingency corrective actions. We compare performances of our
approach and its possible variants with classical CSCOPF approaches such
as the direct approach and Benders decomposition (BD), on three systems
of 60, 118, and 1203 buses.
Disciplines :
Electrical & electronics engineering
Author, co-author :
Capitanescu, Florin ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation
Wehenkel, Louis ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation
Language :
English
Title :
A new iterative approach to the corrective security-constrained optimal power flow problem
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
O. Alsac and B. Stott, "Optimal load flow with steady-state security," IEEE Trans. Power App. Syst., vol. PAS-93, no. 3, pp. 745-751, May/Jun. 1974.
A. J. Monticelli, M. V. P. Pereira, and S. Granville, "Security-constrained optimal power flow with post-contingency corrective rescheduling," IEEE Trans. Power Syst., vol. 2, no. 1, pp. 175-182, Feb. 1987.
B. Stott, O. Alsac, and A. J. Monticelli, "Security analysis and optimization (Invited Paper)," Proc. IEEE, vol. 75, no. 12, pp. 1623-1644, Dec. 1987.
S. M. Shahidehpour et al., "Nonlinear programming algorithms and decomposition strategies for optimal power flow," IEEE Tutorial, Optimal Power Flow: Solution Techniques, Requirements and Challenges, 1996.
J. A. Momoh, R. J. Koessler, M. S. Bond, B. Stott, D. Sun, A. Papalexopoulos, and P. Ristanovic, "Challenges to optimal power flow," IEEE Trans. Power Syst., vol. 12, no. 1, pp. 444-455, Feb. 1997.
J. F. Benders, "Partitioning procedure for solving mixed variables programming problems," Numer. Math., vol. 4, pp. 238-252, 1962.
A. M. Geoffrion, "Generalized Benders decomposition," J. Optim. Theory Appl., vol. 10, no. 4, pp. 237-260, 1972.
T. Gomez, I. J. Perez-Arriaga, J. Lumbreras, and V. M. Parra, "A security-constrained decomposition approach to optimal reactive power planning," IEEE Trans. Power Syst., vol. 6, no. 3, pp. 1069-1076, Aug. 1991.
S. Granville and M. C. A. Lima, "Application of decomposition techniques to var planning: Methodological and computational aspects," IEEE Trans. Power Syst., vol. 9, no. 4, pp. 1780-1787, Nov. 1994.
G. Strbac, S. Ahmed, D. Kirschen, and R. Allan, "A method for computing the value of corrective security," IEEE Trans. Power Syst., vol. 13, no. 3, pp. 1096-1102, Aug. 1998.
R. A. Schlueter, S. Liu, and N. Alemadi, "Preventive and corrective open access system dispatch based on the voltage stability security assessment and diagnosis," Elect. Power Syst. Res., vol. 60, pp. 17-28, 2001.
W. Li, M. Shaaban, Z. Yan, Y. Ni, and F. F. Wu, "Available transfer capability calculation with static security constraints," in Proc. IEEE Power Eng. Soc. General Meeting, Jul. 2003, pp. 306-310.
F. Bouffard, F. D. Galiana, and A. J. Conejo, "Market-clearing with stochastic security (parts I and II)," IEEE Trans. Power Syst., vol. 20, no. 4, pp. 1818-1835, Nov. 2005.
M. Shahidehpour and Z. Li, "Ac contingency dispatch based on security-constrained unit commitment," IEEE Trans. Power Syst., vol. 21, no. 2, pp. 897-908, May 2006.
J. Martinez-Crespo, J. Usaola, and J. L. Fernandez, "Security-constrained optimal generation scheduling in large-scale power systems," IEEE Trans. Power Syst., vol. 21, no. 1, pp. 321-332, Feb. 2006.
M. Shahidehopour and Y. Fu, "Benders decomposition: Applying Benders decomposition to power systems," IEEE Power Energy Mag., vol. 3, no. 2, pp. 20-21, Mar./Apr. 2005.
F. Capitanescu, M. Glavic, D. Ernst, and L. Wehenkel, "Interior-point based algorithms for the solution of optimal power flow problems," Elect. Power Syst. Res., vol. 77, no. 5-6, pp. 508-517, Apr. 2007.
F. Capitanescu, M. Glavic, D. Ernst, and L. Wehenkel, "Contingency filtering techniques for preventive security-constrained optimal power flow," IEEE Trans. Power Syst., vol. 22, no. 4, pp. 1690-1697, Nov. 2007.
Long-Term Dynamics, Phase II, CIGRE Task Force 38.02.08, 1995.
IEEE-118 Bus System, 1996. [Online]. Available: http://www.ee. washington.edu.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.
