• English
    • español
  • English 
    • English
    • español
  • Login
View Item 
  •   Home
  • 2.- Investigación
  • Documentos de Trabajo
  • View Item
  •   Home
  • 2.- Investigación
  • Documentos de Trabajo
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Two-stage recombinatory benders decomposition

Thumbnail
View/Open
IIT-16-101A_abstract.pdf (66.88Kb)
Author
Díaz Duran, Cristian
Correa-Posada, Carlos M.
Ramos Galán, Andrés
Latorre Canteli, Jesús María
Tejada Arango, Diego Alejandro
Estado
info:eu-repo/semantics/draft
Metadata
Show full item record
Mostrar METS del ítem
Ver registro en CKH

Refworks Export

Abstract
 
 
The main goal of the power systems planning is the optimal management of the energy resources in order to ensure a safe and reliable operation. Otherwise, the system operation and reliability will be compromised, as happened in Colombian between 1992 and 1993 due to a high dry period. The planning process must be anticipative to the uncertainty, obtaining a solution accounting for multiple future scenarios. This uncertainty is commonly represented by scenario trees [?]. The simultaneous consideration of all the future scenarios usually leads to apply mathematical decomposition techniques due to computational burdensome. The main decomposition techniques are the Benders' decomposition, [?], and the Stochastic Dual Dynamic Programming, [?]. Real applications of these methods have as main disadvantage the strong dependence of the solution on random processes, requiring to reduce the number of scenarios. As a consequence, the robustness of the solution is not guaranteed, especially when draws are made in the early stages of the optimization horizon. The approach presented here has two main characteristics. Firstly, when the forward pass needs draws due to the tree size, they are made as far as possible to the star of the horizon. This decreases the number of stages for the decomposition algorithm, improving the runtimes. Secondly, recombining trees are applied for the uncertainty representation. This improves the backward pass by obtaining more future information to be considered in the previous stages, helping to the convergence speed. This approach is being used for planning the Colombian electric system, showing results consistent with other commercial tools, but with much lower execution times.
 
URI
http://hdl.handle.net/11531/14273
Two-stage recombinatory benders decomposition
Palabras Clave


Collections
  • Documentos de Trabajo

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contact Us | Send Feedback
 

 

Búsqueda semántica (CKH Explorer)


Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_advisorxmlui.ArtifactBrowser.Navigation.browse_typeThis CollectionBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_advisorxmlui.ArtifactBrowser.Navigation.browse_type

My Account

LoginRegister

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contact Us | Send Feedback