Abstract
We study the evolution of rules that define how to assign tasks to workstations in heuristic procedures for assembly line balancing. In assembly line balancing, a set of partially ordered tasks has to be assigned to workstations. The variant we consider, known as the assembly line worker assignment and balancing problem (ALWABP), has a fixed number of machines and workers, and different workers need different times to execute the tasks. A solution is an assignment of tasks and workers to workstations satisfying the partial order of the tasks, and the problem is to find a solution that maximizes the production rate of the assembly line. These problems are often solved by station-based assignment procedures, which use heuristic rules to select the tasks to be assigned to stations. There are many selection rules available in the literature. We show how efficient rules can be evolved, and demonstrate that rules evolved for simple assignment procedures are also effective in stochastic heuristic procedures using beam search, leading to improved heuristics.
Our research has been supported by CNPq (grant 420348/2016-6), Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, and by Google Research Latin America (grant 25111).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We write \([n]=\{1,2,\ldots ,n\}\).
References
Blum, C., Miralles, C.I.: On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38(2), 328–339 (2011)
Borba, L.M., Ritt, M.: A task-oriented branch-and-bound method for the assembly line worker assignment and balancing problem. In: XLIV Simpósio Brasileiro de Pesquisa Operacional, pp. 3192–3291 (2012)
Borba, L.M., Ritt, M.: A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem. Comput. Oper. Res. 45, 87–96 (2014). https://doi.org/10.1016/j.cor.2013.12.002. Online supplement: http://www.inf.ufrgs.br/algopt/alwabp2
Chaves, A.A., Lorena, L.A.N., Miralles, C.I.: Clustering search approach for the assembly line worker assignment and balancing problem. In: International Conference on Computers and Industrial Engineering, Alexandria, Egypt, pp. 1469–1478, October 2007
Chaves, A.A., Lorena, L.A.N., Miralles, C.I.: Hybrid metaheuristic for the assembly line worker assignment and balancing problem. In: 6th International Workshop on Hybrid Metaheuristics, pp. 1–12 (2009)
Estrada, T., Wyatt, M., Taufer, M.: A genetic programming approach to design resource allocation policies for heterogeneous workflows in the cloud. In: 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp. 372–379 (2015). https://doi.org/10.1109/ICPADS.2015.54
Gonçalves, J.P., Ritt, M.: Evolving task priority rules for heterogeneous assembly line balancing. In: Proceedings of IEEE Congress on Evolutionary Computation, Wellington, pp. 1423–1430 (2019). https://doi.org/10.1109/CEC.2019.8790332
Langdon, W.B.: Genetic programming and evolvable machines at 20. Genet. Program. Evol. Mach. 21(1–2), 205–217 (2020). https://doi.org/10.1007/s10710-019-09344-6
Lowerre, B.: The Harpy speech recognition system. Ph.D. thesis, CMU (1976)
Miralles, C.I., Garcia-Sabater, J.P., Andrés, C., Cardos, M.: Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study. Int. J. Prod. Res. 110(2), 187–197 (2007)
Moreira, M.C.O., Ritt, M., Costa, A.M., Chaves, A.A.: Simple heuristics for the assembly line worker assignment and balancing problem. J. Heuristics 18(3), 505–524 (2012). https://doi.org/10.1007/s10732-012-9195-5
Mutlu, O., Polat, O., Ayca, A.: An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Comput. Oper. Res. 40(1), 418–426 (2013). https://doi.org/10.1016/j.cor.2012.07.010
Otto, A., Otto, C.: How to design effective priority rules: example of simple assembly line balancing. Comput. Ind. Eng. 69, 43–52 (2014)
Polat, O., Kalayci, C.B., Özcan Mutlu, Gupta, S.M.: A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study. Int. J. Prod. Res. 54(3), 722–741 (2016). https://doi.org/10.1080/00207543.2015.1055344
Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu (2008)
Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6(3), 18–25 (1955)
Scholl, A.: Data of assembly line balancing problems. Technical Report 16/1993, TH Darmstadt (1993). Schriften zur Quantitativen Betriebswirtschaftslehre
Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3), 666–693 (2006)
Tan, B., Ma, H., Mei, Y.: A hybrid genetic programming hyper-heuristic approach for online two-level resource allocation in container-based clouds. In: Coello, C.A.C. (ed.) Proceedings of the IEEE Congress on Evolutionary Computation, Wellington, New Zealand, pp. 2681–2688 (2019). https://doi.org/10.1109/CEC.2019.8790220
Yska, D., Mei, Y., Zhang, M.: Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., García-Sánchez, P. (eds.) Genetic Programming - 21st European Conference, Parma, Italy, pp. 306–321 (2018)
Paquete, L., Zarges, C. (eds.): EvoCOP 2020. LNCS, vol. 12102. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43680-3
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Gonçalves Moreira, J.P., Ritt, M. (2021). Evolving Allocation Rules for Beam Search Heuristics in Assembly Line Balancing. In: Hu, T., Lourenço, N., Medvet, E. (eds) Genetic Programming. EuroGP 2021. Lecture Notes in Computer Science(), vol 12691. Springer, Cham. https://doi.org/10.1007/978-3-030-72812-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-72812-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72811-3
Online ISBN: 978-3-030-72812-0
eBook Packages: Computer ScienceComputer Science (R0)