Beam-ACO applied to assembly line balancing

Authors:
Christian Blum;Joaquín Bautista;Jordi Pereira
Affiliations:
ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain;ETSEIB, Nissan Chair, Universitat Politècnica de Catalunya, Barcelona, Spain;ETSEIB, Dept. d’Organitzacíó d’Empreses, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2006

Citing 10
Cited 3

A comparative evaluation of heuristic line balancing techniques

Management Science
Optimally balancing large assembly lines with `FABLE'

Management Science
Eureka: a hybrid system for assembly line balancing

Management Science
A Hybrid Genetic Algorithm for Assembly Line Balancing

Journal of Heuristics
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Ant Algorithms for Assembly Line Balancing

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant Colony Optimization

Ant Colony Optimization
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
Parametrized greedy heuristics in theory and practice

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Incorporating Preferences to a Multi-objective Ant Colony Algorithm for Time and Space Assembly Line Balancing

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
An extended beam-ACO approach to the time and space constrained simple assembly line balancing problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Multiobjective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.