TY - GEN
T1 - An extended beam-ACO approach to the time and space constrained simple assembly line balancing problem
AU - Blum, Christian
AU - Bautista, Joaquín
AU - Pereira, Jordi
N1 - Funding Information:
This work was supported by grants TIN-2005-08818-C04-01 and DPI2004-03475 of the Spanish government, and by the Ramón y Cajal program of the Spanish Ministry of Science and Technology of which Christian Blum is a research fellow. Moreover, we acknowledge Nissan Spain and the UPC Nissan Chair for partially funding this work.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=47349111032&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78604-7_8
DO - 10.1007/978-3-540-78604-7_8
M3 - Conference contribution
AN - SCOPUS:47349111032
SN - 3540786031
SN - 9783540786030
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 96
BT - Evolutionary Computation in Combinatorial Optimization - 8th European Conference, EvoCOP 2008, Proceedings
T2 - 8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008
Y2 - 26 March 2008 through 28 March 2008
ER -