An extended beam-ACO approach to the time and space constrained simple assembly line balancing problem

Christian Blum, Joaquín Bautista, Jordi Pereira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Assembly line balancing problems are concerned with the distribution of work required to assemble a product in mass or series production among a set of work stations on an assembly line. The specific problem considered here is known as the time and space constrained simple assembly line balancing problem. Among several possible objectives we consider the one of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 in the literature. For tackling this problem we propose an extended version of our Beam-ACO approach published in [3]. Beam-ACO algorithms are hybrid techniques that result from combining ant colony optimization with beam search. The experimental results show that our algorithm is able to find 128 new best solutions in 269 possible cases.

Original languageEnglish
Title of host publicationEvolutionary Computation in Combinatorial Optimization - 8th European Conference, EvoCOP 2008, Proceedings
Pages85-96
Number of pages12
DOIs
StatePublished - 2008
Externally publishedYes
Event8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008 - Naples, Italy
Duration: 26 Mar 200828 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4972 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008
Country/TerritoryItaly
CityNaples
Period26/03/0828/03/08

Fingerprint

Dive into the research topics of 'An extended beam-ACO approach to the time and space constrained simple assembly line balancing problem'. Together they form a unique fingerprint.

Cite this