Beam-ACO Applied to Assembly Line Balancing

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 meta-heuristic for this problem.

[1]  José Fernando Gonçalves,et al.  A Hybrid Genetic Algorithm for Assembly Line Balancing , 2002, J. Heuristics.

[2]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Arno Sprecher,et al.  Dynamic search tree decomposition for balancing assembly lines by parallel search , 2003 .

[4]  Armin Scholl,et al.  SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing , 1997, INFORMS J. Comput..

[5]  Roger V. Johnson,et al.  Optimally balancing large assembly lines with `FABLE' , 1988 .

[6]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[7]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[8]  Armin Scholl,et al.  Simple assembly line balancing—Heuristic approaches , 1997, J. Heuristics.

[9]  Krzysztof Socha,et al.  ACO for Continuous and Mixed-Variable Optimization , 2004, ANTS Workshop.

[10]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[11]  Angel B. Ruiz,et al.  Balancing assembly lines with tabu search , 2006, Eur. J. Oper. Res..

[12]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[13]  Thomas R. Hoffman.  Eureka: a hybrid system for assembly line balancing , 1992 .

[14]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[15]  Pedro M. Vilarinho,et al.  A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations , 2002 .

[16]  Joaquín Bautista,et al.  Ant Algorithms for Assembly Line Balancing , 2002, Ant Algorithms.

[17]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

[18]  Joaquín Bautista,et al.  Ant algorithms for a time and space constrained assembly line balancing problem , 2007, Eur. J. Oper. Res..

[19]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[20]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[21]  Armin Fügenschuh.  Parametrized Greedy Heuristics in Theory and Practice , 2005, Hybrid Metaheuristics.