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

被引:121
|
作者
Bautista, Joaquin [1 ]
Pereira, Jordi [1 ]
机构
[1] Univ Politecn Cataluna, Nissan Chair ETSEIB, E-08028 Barcelona, Spain
关键词
artificial intelligence; manufacturing; metaheuristics; production;
D O I
10.1016/j.ejor.2005.12.017
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:2016 / 2032
页数:17
相关论文
共 50 条