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

Joaquín Bautista; Jordi Pereira

doi:10.1016/j.ejor.2005.12.017

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

Joaquín Bautista, Jordi Pereira

Resultado de la investigación: Contribución a una revista › Artículo › revisión exhaustiva

152 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 original	Inglés
Páginas (desde-hasta)	2016-2032
Número de páginas	17
Publicación	European Journal of Operational Research
Volumen	177
N.º	3
DOI	https://doi.org/10.1016/j.ejor.2005.12.017
Estado	Publicada - 16 mar. 2007
Publicado de forma externa	Sí

Acceder al documento

10.1016/j.ejor.2005.12.017

Citar esto

@article{82810780f0324b4a871bb2a4cdffa894,

title = "Ant algorithms for a time and space constrained assembly line balancing problem",

abstract = "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.",

keywords = "Artificial intelligence, Manufacturing, Metaheuristics, Production",

author = "Joaqu{\'i}n Bautista and Jordi Pereira",

note = "Funding Information: We acknowledge the Spanish Operation of Nissan as well as the UPC Nissan Chair for partially funding this research work as well as providing real data. This research paper has also been partially funded by DPI2004-03475 Grant from the Spanish government. We are also grateful to two anonymous referees and the editor of this special issue for providing us with several suggestions which have improved the quality of the paper. ",

year = "2007",

month = mar,

day = "16",

doi = "10.1016/j.ejor.2005.12.017",

language = "English",

volume = "177",

pages = "2016--2032",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

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

AU - Bautista, Joaquín

AU - Pereira, Jordi

N1 - Funding Information: We acknowledge the Spanish Operation of Nissan as well as the UPC Nissan Chair for partially funding this research work as well as providing real data. This research paper has also been partially funded by DPI2004-03475 Grant from the Spanish government. We are also grateful to two anonymous referees and the editor of this special issue for providing us with several suggestions which have improved the quality of the paper.

PY - 2007/3/16

Y1 - 2007/3/16

N2 - 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.

AB - 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.

KW - Artificial intelligence

KW - Manufacturing

KW - Metaheuristics

KW - Production

UR - http://www.scopus.com/inward/record.url?scp=33751255097&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2005.12.017

DO - 10.1016/j.ejor.2005.12.017

M3 - Article

AN - SCOPUS:33751255097

SN - 0377-2217

VL - 177

SP - 2016

EP - 2032

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

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

Resumen

Acceder al documento

Huella

Citar esto