Ant colony optimization for the single model U-type assembly line balancing problem
Author
Sabuncuoglu, I.
Erel, E.
Alp, A.
Date
2009Source Title
International Journal of Production Economics
Print ISSN
0925-5273
Publisher
Elsevier
Volume
120
Issue
2
Pages
287 - 300
Language
English
Type
ArticleItem Usage Stats
123
views
views
232
downloads
downloads
Abstract
An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject to precedence constraints with the objective of optimizing a performance measure. In this paper, we propose ant colony algorithms to solve the single-model U-type assembly line balancing problem. We conduct an extensive experimental study in which the performance of the proposed algorithm is compared against best known algorithms reported in the literature. The results indicate that the proposed algorithms display very competitive performance against them. © 2009 Elsevier B.V. All rights reserved.
Keywords
Ant colony optimizationGeneral assignments problem
Metaheuristic
U-type assembly line balancing problem
Ant colony algorithms
Ant colony optimization
Assembly machines