Beam-ACO for Simple Assembly Line Balancing

Beam-ACO for Simple Assembly Line Balancing

0.00 Avg rating0 Votes
Article ID: iaor200952641
Country: United States
Volume: 20
Issue: 4
Start Page Number: 618
End Page Number: 627
Publication Date: Sep 2008
Journal: INFORMS Journal On Computing
Authors:
Keywords: heuristics: ant systems
Abstract:

Assembly line balancing problems are concerned with the optimization of manufacturing processes. In this paper we consider the so–called simple assembly line balancing problem with the objective of minimizing the number of used workstations. This problem is denoted by SALB–1 in the literature. For tackling this problem, we present a so–called Beam–ACO approach. This technique results from hybridizing the metaheuristic ant colony optimization with beam search. The experimental results show that our algorithm is a state–of–the–art method for this problem. It can solve 263 of 269 existing benchmark instances to optimality.

Reviews

Required fields are marked *. Your email address will not be published.