The assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is the allocation of tasks to an ordered sequence of stations subject to the precedence constraints with the objective of minimizing the number of stations. In a U-line the line is configured into a U-shape topology.In this research, a new heuristic, Ant Colony Optimization (ACO) meta-heuristic, and its variants are proposed for the single model U-type assembly line balancing problem (UALBP). We develop a number of algorithms that can be grouped as:(i) direct methods, (ii) modified methods and (iii) methods in which ACO approach is augmented with some metaheuristic.We also construct an extensive experimental study and compare the performance of the proposed algorithms against the procedures reported in the literature. Ayrıca kapsamlı bir deneysel çalışma yapılmış ve önerilen algoritmaların performansı literatürdeki diğer metodlarla karşılaştırılmıştır.Anahtar sözcükler: U-tipi montaj hattı dengelenmesi problemi, Karınca KolonisiOptimizasyonu meta-sezgiseli.iv
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.