Solving Mixed-Model Assembly Lines Using a Hybrid of Ant Colony Optimization and Greedy Algorithm

Al-Khazraji, Huthaifa; Khlil, Sohaib; Alabacy, Zina

doi:10.30684/etj.v40i1.2153

	Solving Mixed-Model Assembly Lines Using a Hybrid of Ant Colony Optimization and Greedy Algorithm
Engineering and Technology Journal
Article 20, Volume 40, Issue 1, January 2022, Pages 172-180 PDF (910.18 K)
DOI: 10.30684/etj.v40i1.2153
Authors
Huthaifa Al-Khazraji^* ¹; Sohaib Khlil²; Zina Alabacy¹
¹Control and System Engineering Dept.,University of Technology-Iraq, Alsina’a street, P.O Box 10066 Baghdad, Iraq.
²Department of Applied Mechanics, University of Technology-Iraq, Alsina’a street, P.O. Box 10066 Baghdad, Iraq.
Abstract
The assembly line balancing problem deals with the assignment of tasks to work stations. Mixed-model assembly line problem is a type of assembly line balancing problem at which two or more models of the same product are assembled sequentially at the same line. To achieve optimality and efficiency of solving this problem, tasks at each work station have to be well balanced satisfying all constraints. This paper deals with the mixed-model assembly line balancing problem (MALBP) in which the objective is to minimize the cycle time for a given number of work stations. The problem is solved by using a hybrid of an ant colony optimization and a greedy algorithm (Ant-Greedy). MATLAB Software is used to perform the proposed method. Then, the proposed method is applied to a real case problem found in the literature for the assembly line of automatic changeover in the Electronic Industries Company in Iraq. The results of the proposed method are compared with the performance of the Merging Shortest and Longest Operation (MMSLO) method. The comparison shows that the Ant-Greedy optimization method is more efficient, where the efficiency increased from 93.53% for MMSLO method to 97.26% for the Ant-Greedy method.
Highlights
Mixed-model assembly line problem is a type of assembly line balancing problem at which two or more models of the same product are assembled sequentially at the same line. A hybrid of an Ant Colony Optimization and a Greedy Algorithm (Ant-Greedy) is presented for mixed-model assembly line balancing problem. The proposed approach is compared with the performance of the Merging Shortest and Longest Operation (MMSLO) method.
Keywords
Mixed-Model Assembly Line; Ant Colony Optimization; Greedy Algorithm; Automatic Changeover

References
[1] J. I. Van Zante-de Fokkert and de T. G. Kok. The mixed and multi model line balancing problem: a comparison. European Journal of Operational Research, 100 (1997) 399-412. [2] H. Güden and S. Meral. An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study. The International Journal of Advanced Manufacturing Technology, 84 (2016) 1539-1559. [3] S. R. Ashraf and S. N. Abbas. Mixed Model Assembly Line Balancing by Using of Sub-Assembly Parallel Shop. Proceedings of the First International Conference on Industrial Engineering and Management Applications, (2017) 93-97. [4] S. Akpınar and G. M. Bayhan. A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints. Engineering Applications of Artificial Intelligence, 24 (2011) 449-457. [5] S. S. Al-Zubaidy, M. A. Mahmoud and I. D. Khalaf. Balancing Mixed-Model Assembly line in Electronic Industries Company. Engineering and Technology Journal, 34 (2016) 233-244. [6] A. Scholl. Balancing and sequencing of assembly lines (No. 10881). Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL), 1999. [7] M. E. Salveson. The Assembly Line Balancing Problem. Journal of Industrial Engineering, 6 (1955) 18–25. [8] N. T. Thomopoulos. Line balancing-sequencing for mixed-model assembly. Management Science, 14 (1967) 59. [9] P. M. Vilarinho and A. S. Simaria. ANTBAL: an ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations. International journal of production research, 44 (2006) 291-303. [10] R. Hwang and H. Katayama. A multi-decision genetic approach for workload balancing of mixed-model U-shaped assembly line systems. International Journal of Production Research, 47 (2009) 3797-3822. [11] U. Özcan, H. Çerçioğlu, H. Gökçen and B. Toklu. Balancing and sequencing of parallel mixed-model assembly lines. International Journal of Production Research, 48 (2010) 5089-5113. [12] B. Yagmahan. Mixed-model assembly line balancing using a multi-objective ant colony optimization approach. Expert Systems with Applications, 38 (2011) 12453-12461. [13] S. AkpıNar, G. M. Bayhan and A. Baykasoglu. Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks. Applied Soft Computing, 13 (2013) 574-589. [14] A. S. Simaria and P. M. Vilarinho. A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II. Computers & Industrial Engineering, 47 (2004) 391-407. [15] A. V. Raj, J. Mathew, P. Jose and G. Sivan. Optimization of cycle time in an assembly line balancing problem. Procedia Technology, 25 (2016) 1146-1153. [16] Z. A. Çil, S. Mete and K. Ağpak. Analysis of the type II robotic mixed-model assembly line balancing problem. Engineering Optimization, 49 (2017) 990-1009. [17] Z. A. Çil, Z. Li, S. Mete, and E. Özceylan. Mathematical model and bee algorithms for mixed-model assembly line balancing problem with physical human–robot collaboration. Applied Soft Computing, 39 (2020) 106394. [18] W. Zhang, L. Hou, Y.Gan, C. Xu, X. Bu, and H. Lin. Parallel Optimization of the Balancing and Sequencing for Mixed-model Assembly Lines. Manufacturing Technology, 19 (2019) 537-544. [19] S. Khlil, H. Al-Khazraji, and Z. Alabacy, Solving Assembly Production Line Balancing Problem Using Greedy Heuristic Method. MS&E, 745 (2020) 012068.
Statistics Article View: 285 PDF Download: 219