SciELO - Scientific Electronic Library Online

 
vol.13 número2Desempeño de la combustión de desechos industriales en un reactor de lecho fluidizado burbujeanteSíntesis de imágenes a partir de imágenes reales de una escena mediante un algoritmo parcialmente autónomo í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


Ingeniería y Universidad

versión impresa ISSN 0123-2126

Resumen

RUBIANO-OVALLE, Óscar  y  ARROYO-ALMANZA, Alonso. Solving a Two-Sided Assembly Line Balancing Problem using Memetic Algorithms. Ing. Univ. [online]. 2009, vol.13, n.2, pp.267-280. ISSN 0123-2126.

This research explores a characterization of the Two-Sided Assembly Line Problem (TALBP). There is a growing interest among researchers and assembly line practitioners in the solution to this problem, because it is more related to real-life situations than the Simple Assembly Line Balancing Problem (SALBP). Since the complexity of the TALBP is superior to that of the SALBP, this research emphasizes both the construction and the use of metaheuristics as memetic algorithms for finding a very good solution. Memetic algorithms are supported by genetic algorithms. The solution proposed was implemented in Matlab for a motorcycle assembly line at a local firm. Compared to other recognized heuristics and optimization methods, a most suitable solution was obtained in a shorter time through the use of the constructed algorithm. With this, all the restrictions and complexities inherent to the problem were overcome.

Palabras clave : MATLAB (computer program); assembly-line methods; assembly-line balancing; algorithms.

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

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons