• English
    • español
  • español 
    • English
    • español
  • Login
Ver ítem 
  •   DSpace Principal
  • 2.- Investigación
  • Artículos
  • Ver ítem
  •   DSpace Principal
  • 2.- Investigación
  • Artículos
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analysis of stochastic problem decomposition algorithms in computational grids

Thumbnail
Ver/
IIT-09-002A.pdf (418.0Kb)
Fecha
2009-02-01
Autor
Latorre Canteli, Jesús María
Cerisola Lopez De Haro, Santiago
Ramos Galán, Andrés
Palacios Hielscher, Rafael
Estado
info:eu-repo/semantics/publishedVersion
Metadatos
Mostrar el registro completo del ítem
Mostrar METS del ítem
Ver registro en CKH

Refworks Export

Resumen
 
 
Stochastic programming usually represents uncertainty discretely by means of a scenario tree. This representation leads to an exponential growth of the size of stochastic mathematical problems when better accuracy is needed. Trying to solve the problem as a whole, considering all scenarios together, yields to huge memory requirements that surpass the capabilities of current computers. Thus, decomposition algorithms are employed to divide the problem into several smaller subproblems and to coordinate their solution in order to obtain the global optimum. This paper analyzes several decomposition strategies based on the classical Benders decomposition algorithm, and applies them in the emerging computational grid environments. Most decomposition algorithms are not able to take full advantage of all the computing power available in a grid system because of unavoidable dependencies inherent to the algorithms. However, a special decomposition method presented in this paper aims at reducing dependency among subproblems, to the point where all the subproblems can be sent simultaneously to the grid. All algorithms have been tested in a grid system, measuring execution times required to solve standard optimization problems and a real-size hydrothermal coordination problem. Numerical results are shown to confirm that this new method outperforms the classical ones when used in grid computing environments.
 
URI
https:doi.org10.1007s10479-008-0476-1
Analysis of stochastic problem decomposition algorithms in computational grids
Tipo de Actividad
Artículos en revistas
ISSN
0254-5330
Materias/ categorías / ODS
Instituto de Investigación Tecnológica (IIT)
Palabras Clave

Stochastic programming. Linear programming. Benders decomposition. Grid computing. Performance analysis
Colecciones
  • Artículos

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contacto | Sugerencias
 

 

Búsqueda semántica (CKH Explorer)


Listar

Todo DSpaceComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosMateriasPor DirectorPor tipoEsta colecciónPor fecha de publicaciónAutoresTítulosMateriasPor DirectorPor tipo

Mi cuenta

AccederRegistro

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contacto | Sugerencias