Parallel Evolutionary Algorithms for the Reconfigurable Transfer Line Balancing Problem

Authors

  • Pavel Borisovsky Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

DOI:

https://doi.org/10.2298/YJOR230415018B

Keywords:

CNC machines, partial order, setup times, split decoder, parallel computing, scalability

Abstract

This paper deals with an industrial problem of machining line design, which consists in partitioning a given set of operations into several subsets corresponding to workstations and sequencing the operations to satisfy the technical requirements and achieve the best performance of the line. The problem has a complex set of constraints that include partial order on operations, part positioning, inclusion, exclusion, cycle time, and installation of parallel machines on a workstation. The problem is NP-hard and even finding a feasible solution can be a difficult task from the practical point of view. A parallel evolutionary algorithm (EA) is proposed and implemented for execution on a Graphics Processing Unit (GPU). The parallelization in the EA is done by working on several parents in one iteration and in multiple application of mutation operator to the same parent to produce the best offspring. The proposed approach is evaluated on large scale instances and demonstrated superior performance compared to the algorithms from the literature in terms of running time and ability to obtain feasible solutions. It is shown that in comparison to the traditional populational EA scheme the newly proposed algorithm is more suitable for advanced GPUs with a large number of cores.

References

O. Bataïa and A. Dolgui, “Hybridizations in line balancing problems: A comprehensive review on new trends and formulations,” International Journal of Production Economics, vol. 250, no. 5, p. 108673, 2022. doi: https://doi.org/10.1016/j.ijpe.2022.108673

Ö. Hazir, X. Delorme, and A. Dolgui, “A review of cost and profit oriented line design and balancing problems and solution approaches,” Annual Reviews in Control, vol. 40, pp. 14-24, 2015. doi: https://doi.org/10.1016/j.arcontrol.2015.09.001

P. Chutima, “A comprehensive review of robotic assembly line balancing problem,” Journal of Intelligent Manufacturing, vol. 33, pp. 1-34, 2022. doi: https://doi.org/10.1007/s10845- 020-01641-7

A. Scholl, N. Boysen, and M. Fliedner, “The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics,” OR Spectrum, vol. 35, pp. 291-320, 2013. doi: https://doi.org/10.1007/s00291- 011-0265-0

A. Yelles-Chaouche, E. Gurevsky, N. Brahimi, and A. Dolgui, “Reconfigurable manufacturing systems from an optimisation perspective: a focused review of literature,” International Journal of Production Research, vol. 59, no. 21, pp. 6400-6418, 2021. doi: https://doi.org/10.1080/00207543.2020.1813913

X. Delorme, A. Dolgui, M. Essafi, L. Linxe, and D. Poyard, “Machining lines automation,” in S.Y. Nof (ed.) Springer handbook of automation. Springer, New York, 2009, pp. 599-617. [Online]. Available: https://doi.org/10.1007/978-3-540-78831-7 35

M. Essafi, X. Delorme, A. Dolgui, and O. Guschinskaya, “A MIP approach for balancing transfer lines with complex industrial constraints,” Computers and Industrial Engineering, vol. 58, pp. 393-400, 2010. doi: https://doi.org/10.1016/j.cie.2009.04.009

M. Essafi, X. Delorme, and A. Dolgui, “Balancing machining lines: a two-phase heuristic,” Studies in Informatics and Control, vol. 19, no. 3, pp. 243-252, 2010. doi: https://doi.org/10.24846/v19i3y201004

M. Essafi, X. Delorme, and A. Dolgui, “Balancing lines with CNC machines: A multi-start ant based heuristic,” CIRP Journal of Manufacturing Science and Technology, vol. 2, no. 3, pp. 176-182, 2010. doi: https://doi.org/10.1016/j.cirpj.2010.05.002

P. Borisovsky, X. Delorme, and A. Dolgui, “Genetic algorithm for balancing reconfigurable machining lines,” Computers and Industrial Engineering, vol. 66, no. 3, pp. 541-547, 2013. doi: https://doi.org/10.1016/j.cie.2012.12.009

Y. Lahrichi, N. Grangeon, L. Deroussi, and S. Norre, “A new split-based hybrid metaheuristic for the reconfigurable transfer line balancing problem,” International Journal of Production Research, vol. 59, no. 4, pp. 1127-1144, 2021. doi: https://doi.org/10.1080/00207543.2020.1720929

T. Vidal, T. Crainic, M. Gendreau, and C. Prins, “A unified solution framework for multiattribute vehicle routing problems,” European Journal of Operational Research, vol. 234, no. 3, pp. 658-673, 2014. doi: https://doi.org/10.1016/j.ejor.2013.09.045

M. Haouari and M. Serairi, “Heuristics for the variable sized bin-packing problem,” Computers and Operations Research, vol. 36, no. 10, pp. 2877-2884, 2009. doi: https://doi.org/10.1016/j.cor.2008.12.016

P. Borisovsky, “Genetic algorithm for one machining line balancing problem with setup times,” in 2020 Dynamics of Systems, Mechanisms and Machines (Dynamics), Omsk, Russia. IEEE, 2020. doi: https://doi.org/10.1109/Dynamics50954.2020.9306146 pp. 1-5.

J. Cheng and M. Gen, “Accelerating genetic algorithms with GPU computing: A selective overview,” Computers and Industrial Engineering, vol. 128, pp. 514-525, 2019. doi: https://doi.org/10.1016/j.cie.2018.12.067

C. Schulz, G. Hasle, A. Brodtkorb, and T. Hagen, “GPU computing in discrete optimization. Part II: Survey focused on routing problems,” EURO Journal on Transportation and Logistics, vol. 2, no. 1-2, pp. 159-186, 2013. doi: https://doi.org/10.1007/s13676-013-0026-0

T. Bäck, D. Fogel, and Z. Michalewicz, Evolutionary Computation 1: Basic Algorithms and Operators. CRC Press, 2000. [Online]. Available: https://doi.org/10.1201/9781482268713

F. Neri, C. Cotta, and P. Moscato, Handbook of memetic algorithms. Springer, 2012. [Online]. Available: https://doi.org/10.1007/978-3-319-07153-4 29-1

V. Hrbek and T. Brandejsk´y, “Memetic algorithm with GPU optimization,” in Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Data Science and Algorithms in Systems. CoMeSySo 2022. Lecture Notes in Networks and Systems. Springer, Cham, 2023. doi: https://doi.org/10.1007/978-3-031-21438-7 15 pp. 174-185.

Downloads

Published

2023-08-29

Issue

Section

Research Articles