Ant colony optimization for the single model U-type assembly line balancing problem

Date
2009
Authors
Sabuncuoglu, I.
Erel, E.
Alp, A.
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
International Journal of Production Economics
Print ISSN
0925-5273
Electronic ISSN
Publisher
Elsevier
Volume
120
Issue
2
Pages
287 - 300
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
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.

Course
Other identifiers
Book Title
Keywords
Ant colony optimization, General assignments problem, Metaheuristic, U-type assembly line balancing problem, Ant colony algorithms, Ant colony optimization, Assembly machines
Citation
Published Version (Please cite this version)