An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem
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 . 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.
KeywordsWork Station Problem Instance Assembly Line Partial Solution Priority Rule
Unable to display preview. Download preview PDF.
- 2.Bautista, J., Pereira, J.: Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research (2007)Google Scholar
- 10.Merkle, D., Middendorf, M.: An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Oates, M.J., Lanzi, P.L., Li, Y., Cagnoni, S., Corne, D.W., Fogarty, T.C., Poli, R., Smith, G.D. (eds.) EvoIASP 2000, EvoWorkshops 2000, EvoFlight 2000, EvoSCONDI 2000, EvoSTIM 2000, EvoTEL 2000, and EvoROB/EvoRobot 2000. LNCS, vol. 1803, pp. 287–296. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- 16.Talbot, F.B., Patterson, J.H., Gehrlein, J.H.: A comparative evaluation of heuristic line balancing techniques. Management Science 32, 430–454 (1986)Google Scholar
- 17.Vilarinho, P.M., Simaria, A.: A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations. International Journal of Production Research, 1405–1420 (2002)Google Scholar