Ant algorithms for a time and space constrained assembly line balancing problem

Joaquín Bautista, Jordi Pereira

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

164 Citas (Scopus)

Resumen

The present article focuses on the application of a procedure based on ant colonies to solve an assembly line balancing problem. After an introduction to assembly line problems, the problem under study is presented: the Time and Space constrained Assembly Line Balancing Problem (TSALBP); and a basic model of one of its variants is put forward for study. Subsequently, an ant algorithm is presented that incorporates some ideas that have offered good results with simple balancing problems. Finally, the validity of the proposed algorithms is tested by means of a computational experience with reference instances, and the conclusions of the study are presented.

Idioma originalInglés
Páginas (desde-hasta)2016-2032
Número de páginas17
PublicaciónEuropean Journal of Operational Research
Volumen177
N.º3
DOI
EstadoPublicada - 16 mar. 2007
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Ant algorithms for a time and space constrained assembly line balancing problem'. En conjunto forman una huella única.

Citar esto