A Novel Strategy to Reduce Computational Burden of the Stochastic Security Constrained Unit Commitment Problem

Cristian Camilo Marín-Cano, Juan Esteban Sierra-Aguilar, Jesús M. López-Lezama, Álvaro Jaramillo-Duque and Juan G. Villegas
Additional contact information
Cristian Camilo Marín-Cano: Research Group in Efficient Energy Management (GIMEL), Departamento de Ingeniería Eléctrica, Universidad de Antioquia, Calle 67 No. 53-108, 050010 Medellín, Colombia
Juan Esteban Sierra-Aguilar: Research Group in Efficient Energy Management (GIMEL), Departamento de Ingeniería Eléctrica, Universidad de Antioquia, Calle 67 No. 53-108, 050010 Medellín, Colombia
Jesús M. López-Lezama: Research Group in Efficient Energy Management (GIMEL), Departamento de Ingeniería Eléctrica, Universidad de Antioquia, Calle 67 No. 53-108, 050010 Medellín, Colombia
Álvaro Jaramillo-Duque: Research Group in Efficient Energy Management (GIMEL), Departamento de Ingeniería Eléctrica, Universidad de Antioquia, Calle 67 No. 53-108, 050010 Medellín, Colombia
Juan G. Villegas: ALIADO—Analytics and Research for Decision Making, Department of Industrial Engineering, Universidad de Antioquia, Calle 67 No. 53-108, 050010 Medellín, Colombia

Energies, 2020, vol. 13, issue 15, 1-19

Abstract: The uncertainty related to the massive integration of intermittent energy sources (e.g., wind and solar generation) is one of the biggest challenges for the economic, safe and reliable operation of current power systems. One way to tackle this challenge is through a stochastic security constraint unit commitment (SSCUC) model. However, the SSCUC is a mixed-integer linear programming problem with high computational and dimensional complexity in large-scale power systems. This feature hinders the reaction times required for decision making to ensure a proper operation of the system. As an alternative, this paper presents a joint strategy to efficiently solve a SSCUC model. The solution strategy combines the use of linear sensitivity factors (LSF) to compute power flows in a quick and reliable way and a method, which dynamically identifies and adds as user cuts those active security constraints N − 1 that establish the feasible region of the model. These two components are embedded within a progressive hedging algorithm (PHA), which breaks down the SSCUC problem into computationally more tractable subproblems by relaxing the coupling constraints between scenarios. The numerical results on the IEEE RTS-96 system show that the proposed strategy provides high quality solutions, up to 50 times faster compared to the extensive formulation (EF) of the SSCUC. Additionally, the solution strategy identifies the most affected (overloaded) lines before contingencies, as well as the most critical contingencies in the system. Two metrics that provide valuable information for decision making during transmission system expansion are studied.

Keywords: power system optimization; Security-Constraint Unit Commitment; progressive hedging algorithm (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/1996-1073/13/15/3777/pdf (application/pdf)
https://www.mdpi.com/1996-1073/13/15/3777/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:13:y:2020:i:15:p:3777-:d:388479

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().