SciELO - Scientific Electronic Library Online

 
vol.82 número191Algoritmo genético para resolver el problema de localización de instalaciones capacitado en una cadena de tres eslabones para un centro de distribución dentro de un sistema de gestión de residuos sólidos en la región norte de Veracruz, MéxicoEficiencia técnica de unidades de generación termoeléctrica mediante una frontera estocástica índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • No hay articulos similaresSimilares en SciELO
  • En proceso de indezaciónSimilares en Google

Compartir


DYNA

versión impresa ISSN 0012-7353

Resumen

MARMOLEJO-SAUCEDO, José Antonio  y  RODRIGUEZ-AGUILAR, Román. Short-term generation planning by primal and dual decomposition techniques. Dyna rev.fac.nac.minas [online]. 2015, vol.82, n.191, pp.58-62. ISSN 0012-7353.

This paper addresses the short-term generation planning (STGP) through thermoelectric units. The mathematical model is presented as a Mixed Integer Non Linear Problem (MINLP). Several works on the state of art of the problem have revealed that the computational effort of this problem grows exponentially with the number of time periods and number of thermoelectric units. Therefore, we present two alternatives to solve a STGP based on Benders' partitioning algorithm and Lagrangian relaxation in order to reduce the computational effort. The proposal is to apply primal and dual decomposition techniques, which exploit the structure of the problem to reduce solution time by decomposing the STGP into a master problem and a subproblem. For Benders' algorithm, the master problem is a Mixed Integer Problem (MIP) and for the subproblem, it is a Non Linear Problem (NLP). For Lagrangian relaxation, the master problem and the subproblem are MINLP. The computational experiments show the performance of both decomposition techniques applied to the STGP. These techniques allow us to save computation time when compared to some high performance commercial solvers.

Palabras clave : Benders' algorithm; Lagrangian relaxation; subgradient; decomposition techniques; power generation.

        · resumen en Español     · texto en Inglés     · Inglés ( pdf )