Chapter

Ant Colony Optimization and Swarm Intelligence

Volume 4150 of the series Lecture Notes in Computer Science pp 96-107

Beam-ACO Applied to Assembly Line Balancing

  • Christian BlumAffiliated withALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya
  • , Joaquín BautistaAffiliated withETSEIB, Nissan Chair, Universitat Politècnica de Catalunya
  • , Jordi PereiraAffiliated withETSEIB, Dept. d’Organitzacíó d’Empreses, Universitat Politècnica de Catalunya

* Final gross prices may vary according to local VAT.

Get Access

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.