2026-04-04T00:15:14Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/860332025-07-17T13:38:51Zcom_2072_1033col_2072_452950

00925njm 22002777a 4500 dc Blum, Christian author Bautista Valhondo, Joaquín author Pereira Gude, Jordi author 2006-05 Assembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 in the literature. For tackling this problem we propose a Beam-ACO approach, which is an algorithm that results from hybridizing ant colony optimization with beam search. The experimental results show that our algorithm is a state-of-the-art metaheuristic for this problem. Postprint (published version) Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica Assembly line balancing problems Beam search Ant algorithms Metaheuristics Beam-ACO applied to assembly line balancing