Sabuncuoglu, I.Erel, E.Alp, A.2016-02-082016-02-0820090925-5273http://hdl.handle.net/11693/22671An 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.EnglishAnt colony optimizationGeneral assignments problemMetaheuristicU-type assembly line balancing problemAnt colony algorithmsAnt colony optimizationAssembly machinesArticle10.1016/j.ijpe.2008.11.017