Modeling and balancing of parallel U-shaped assembly line based on improved genetic algorithms

Abstract

Aiming at the improvement of the efficiency of the assembly line in the intelligent manufacturing field, a parallel U-shaped assembly line balancing problem (PUALBP) appears. In this paper, a mathematical model of the PUALBP-I is established, and an improved genetic algorithm (IGA) is innovatively designed based on the allocation strategy. Combined with 56 classic examples, the IGA is used to solve the mathematical models of SUAL and PUAL respectively, and the balance results and the balance effect evaluation indicators are obtained. The comparison with Parallel U-line Heuristic (PUH) shows that the results of PUAL are better than SUAL, and verifies that the IGA is effective. The results demonstrate that the IGA in calculating large-scale problems is superior to the small-scale problems, which provides a useful reference for solving PUALBP.

Keywords

Industrial engineering parallel U-shaped assembly line balancing problem (PUALBP)improved genetic algorithms (IGA)collaborative optimization mathematical modeling

Get full access to this article

View all access options for this article.

References

Miltenburg

Wijngaard

The U-line line balancing problem. Manag Sci 1994; 40(10): 1378–1388.

Ajenblit

Wainwright

. Applying genetic algorithms to the U-shaped assembly line balancing problem. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), Anchorage, AK, USA, 4–9 May 1998, pp.96–101. New York: IEEE.

Şahin

Kellegöz

Increasing production rate in U-type assembly lines with sequence-dependent set-up times. Eng Optim 2017; 49(8): 1401–1419.

Şahin

Kellegöz

An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate. Memet Comput 2017; 9(3): 213–229.

Babazadeh

Alavidoost

Zarandi

MHF

, et al. An enhanced NSGA-II algorithm for fuzzy bi-objective assembly line balancing problems. Comput Ind Eng 2018; 123: 189–208.

Gökçen

Ağpak

Benzer

Balancing of parallel assembly lines. Int J Prod Econ 2006; 103(2): 600–609.

Scholl

Boysen

Designing parallel assembly lines with split workplaces: model and optimization procedure. Int J Prod Econ 2009; 119(1): 90–100.

Çerçioğlu

Ozcan

Gokcen

, et al. A simulated annealing approach for parallel assembly line balancing problem. J Fac Eng Archit Gazi Univ 2009; 24(2): 331–341.

Özcan

Çerçioğlu

Gökçen

, et al. A tabu search algorithm for the parallel assembly line balancing problem. Gazi Univ J Sci 2009; 22(4): 313–323.

10.

Kara

Gökçen

Atasagun

Balancing parallel assembly lines with precise and fuzzy goals. Int J Prod Res 2010; 48(6): 1685–1703.

11.

Küçükkoç

Zhang

DZ.

Balancing of parallel U-shaped assembly lines. Comput Oper Res 2015; 64: 233–244.

12.

Küçükkoç

Zhang

DZ.

Coping with model variations on parallel U-shaped assembly line configurations. IFAC-PapersOnLine 2015; 48(3): 2030–2035.

13.

Küçükkoç

Zhang

DZ.

Balancing of mixed-model parallel U-shaped assembly lines considering model sequences. Int J Prod Res 2017; 55(20): 5958–5975.

14.

Jiao

Wang

, et al. Random double U-shaped assembly line balancing method using priority value. J Jilin Univ (Eng Technol Ed) 2020; 50(6): 2087–2093. (in Chinese)

15.

Jiao

Deng

, et al. Balancing of parallel U-shaped assembly lines with a heuristic algorithm based on bidirectional priority values. Concurr Eng Res Appl 2022; 30(1): 80–92.

16.

Chutima

and Khotsaenlee

Multi-objective parallel adjacent U-shaped assembly line balancing collaborated by robots and normal and disabled workers. Comput Oper Res 2022; 143: 105775.

17.

Ramli

Ab Rashid

MFF

. A review of assembly line balancing optimisation with energy consideration using meta-heuristic algorithms. Proc IMechE, Part B: J Engineering Manufacture 2022; 236(5): 475–485.