Assessment of metaheuristic algorithms to optimize of mixed-model assembly line balancing problem with resource constraints
DOI:
https://doi.org/10.15282/jmmst.v4i2.4787Keywords:
Mixed-model assembly; Line balancing; Metaheuristic optimization.Abstract
Mixed-model assembly line balancing problem (MMALBP) is an NP-hard problem which requires an effective algorithm for solution. In this study, an assessment of metaheuristic algorithms to optimize MMALBP is conducted using four popular metaheuristics for this problem, namely Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO) and Genetic Algorithm (GA). Three categories of test problem (small, medium, and large) were used ranging from 8 to 100 number of tasks. For computational experiment, MATLAB software is used in investigate the metaheuristic algorithms performances to optimize the designated objective functions. The results reveal that ACO algorithm performed better in term of finding the best fitness functions when dealing with a large number of tasks. Averagely, it has produces better solution quality than PSO by 5.82%, GA by 9.80%, and SA by 7.66%. However, PSO more superior in term of processing time compared to ACO by 29.25%, GA by 40.54%, and SA by 73.23%. Hence, future research directions such as using the actual manufacturing assembly line data to test the algorithm performances are likely to happen.
References
M. Rabbani, M. Moghaddam, and N. Manavizadeh, “Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout,” Int. J. Adv. Manuf. Technol., vol. 59, no. 9–12, pp. 1191–1210, Apr. 2012, doi: 10.1007/s00170-011-3545-6.
Z. Yuguang, A. Bo, and Z. Yong, “A PSO algorithm for multi-objective hull assembly line balancing using the stratified optimization strategy,” Comput. Ind. Eng., vol. 98, pp. 53–62, 2016, doi: 10.1016/j.cie.2016.05.026.
I. Kucukkoc and D. Z. Zhang, “Mathematical model and agent based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines,” Int. J. Prod. Econ., vol. 158, pp. 314–333, 2014, doi: https://doi.org/10.1016/j.ijpe.2014.08.010.
O. Battaïa et al., “Workforce minimization for a mixed-model assembly line in the automotive industry,” Int. J. Prod. Econ., vol. 170, pp. 489–500, Jun. 2015, doi: 10.1016/j.ijpe.2015.05.038.
X. Zhao, C.-Y. Hsu, P.-C. Chang, and L. Li, “A genetic algorithm for the multi-objective optimization of mixed-model assembly line based on the mental workload,” Eng. Appl. Artif. Intell., vol. 47, pp. 140–146, Jan. 2016, doi: 10.1016/J.ENGAPPAI.2015.03.005.
E. Elbeltagi, T. Hegazy, and D. Grierson, “Comparison among five evolutionary-based optimization algorithms,” Adv. Eng. Informatics, vol. 19, no. 1, pp. 43–53, Jan. 2005, doi: 10.1016/j.aei.2005.01.004.
S. Akpınar and G. M. Bayhan, “A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints,” Eng. Appl. Artif. Intell., vol. 24, no. 3, pp. 449–457, 2011, doi: 10.1016/j.engappai.2010.08.006.
N. Manavizadeh, N. Hosseini, M. Rabbani, and F. Jolai, “Computers & Industrial Engineering A Simulated Annealing algorithm for a mixed model assembly U-line balancing type-I problem considering human efficiency and Just-In-Time approach,” Comput. Ind. Eng., vol. 64, no. 2, pp. 669–685, 2013, doi: 10.1016/j.cie.2012.11.010.
M. M. Razali, M. Fadzil, F. Ab, and M. Razif, “Mathematical Modelling of Mixed-Model Assembly Line Balancing Problem with Resources Constraints,” vol. 012002, doi: 10.1088/1757-899X/160/1/012002.
B. Yagmahan, “Mixed-model assembly line balancing using a multi-objective ant colony optimization approach,” Expert Syst. Appl., vol. 38, no. 10, pp. 12453–12461, Sep. 2011, doi: 10.1016/j.eswa.2011.04.026.
N. Manavizadeh, L. Tavakoli, M. Rabbani, and F. Jolai, “A multi-objective mixed-model assembly line sequencing problem in order to minimize total costs in a Make-To-Order environment, considering order priority,” J. Manuf. Syst., vol. 32, no. 1, pp. 124–137, Jan. 2013, doi: 10.1016/j.jmsy.2012.09.001.
Y. Kara, U. Ozcan, and A. Peker, “Balancing and sequencing mixed-model just-in-time U-lines with multiple objectives,” Appl. Math. Comput., vol. 184, no. 2, pp. 566–588, Jan. 2007, doi: 10.1016/j.amc.2006.05.185.
M. M. Razali, N. H. Kamarudin, M. F. F. Ab. Rashid, and A. N. Mohd Rose, “Recent trend in mixed-model assembly line balancing optimization using soft computing approaches,” Eng. Comput., vol. 36, no. 2, pp. 622–645, Jan. 2019, doi: 10.1108/EC-05-2018-0205.
A. a. Mamun, A. a. Khaled, S. M. Ali, and M. M. Chowdhury, “A heuristic approach for balancing mixed-model assembly line of type I using genetic algorithm,” Int. J. Prod. Res., vol. 50, no. 18, pp. 5106–5116, 2012, doi: 10.1080/00207543.2011.643830.
R. Hassan and B. Cohanim, “A comparison of particle swarm optimization and the genetic algorithm,” 1st AIAA Multidiscip. Des. Optim. Spec. Conf., pp. 1–13, 2005, doi: 10.2514/6.2005-1897.
M. Dorigo and G. DiCaro, “The Ant Colony Optimization meta-heuristic,” pp. 11–32, 1999.
J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of International Conference on Neural Networks, 1995, vol. 4, pp. 1942–1948, doi: 10.1109/ICNN.1995.488968.
J. H. Holland, Adaptation in Natural and Artificial Systems, no. 1. MIT CogNet, 1992.
A. Hamzadayi and G. Yildiz, “A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines,” Comput. Ind. Eng., vol. 66, no. 4, pp. 1070–1084, Dec. 2013, doi: 10.1016/j.cie.2013.08.008.
Q. Bai, “Analysis of Particle Swarm Optimization Algorithm,” Comput. Inf. Sci., vol. 3, no. 1, pp. 180–184, 2010, doi: 10.5539/cis.v3n1P180.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Journal of Modern Manufacturing Systems and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
