Abstract
In this paper, a new U-shaped assembly line balancing problem is studied. For the first time, the criteria such as equipment cost, number of stations and activity performing quality level are considered to be optimized simultaneously by activity to station and worker to station decisions. For this aim, a multi-objective nonlinear formulation is proposed and its linearized version is also presented. Since, according to the literature, the U-shaped assembly line balancing problem with equipment requirements is an NP-hard problem, the problem of this study is NP-hard too. Because of this complexity, the classical algorithms like simulated annealing, variable neighborhood search, and classical genetic algorithm with a novel encoding/decoding scheme are used as solution approaches. As an extension, two hybrid versions of the proposed classical algorithms are proposed according to the characteristics of the problem. In order to evaluate the proposed meta-heuristics, because the problem is new, some test problems are generated randomly. Computational study of the paper, including sensitivity analysis of the proposed meta-heuristics and final experiments on the test problems, proves the superiority of the hybrid versions of the classical algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ağpak K, Yegül MF, Gökçen H (2012) Two-sided U-type assembly line balancing problem. Int J Prod Res 50(18):5035–5047. https://doi.org/10.1080/00207543.2011.631599
Aigbedo H, Monden Y (1997) A parametric procedure for multicriterion sequence scheduling for Just-In-Time mixed-model assembly lines. Int J Prod Res 35(9):2543–2564. https://doi.org/10.1080/002075497194651
Ajenblit DA, Wainwright RL (1998) Applying genetic algorithms to the U-shaped assembly line balancing problem. In: Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence, The 1998 IEEE International Conference on (pp. 96–101). IEEE. https://doi.org/10.1109/ICEC.1998.699329
Alavidoost MH, Zarandi MF, Tarimoradi M, Nemati Y (2017) Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times. J Intell Manuf 28(2):313–336. https://doi.org/10.1007/s10845-014-0978-4
Baybars I (1986) A survey of exact algorithms for the simple assembly line balancing problem. Manage Sci 32(8):909–932. https://doi.org/10.1287/mnsc.32.8.909
Baykasoglu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17(2):217–232. https://doi.org/10.1007/s10845-005-6638-y
Boros P, Fehér O, Lakner Z, Niroomand S, Vizvári B (2016) Modeling supermarket re-layout from the owner’s perspective. Ann Oper Res 238(1–2):27–40
Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res Logist Q 9(3–4):181–186. https://doi.org/10.1002/nav.3800090303
Chica M, Cordon O, Damas S (2011) An advanced multiobjective genetic algorithm design for the time and space assembly line balancing problem. Comput Ind Eng 61(1):103–117. https://doi.org/10.1016/j.cie.2011.03.001
Delice Y, Aydoğan EK, Özcan U, İlkay MS (2017) Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm. 4OR. https://doi.org/10.1007/s10288-016-0320-4
Erel E, Sabuncuoglu I, Aksu BA (2001) Balancing of U-type assembly systems using simulated annealing. Int J Prod Res 39(13):3003–3015. https://doi.org/10.1080/00207540110051905
Foroughi A, Gökçen H, Tiacci L (2016) The cost-oriented stochastic assembly line balancing problem: a chance constrained programming approach. Int J Ind Eng, 23(6)
Foroughi A, Gökçen H (2018) A multiple rule-based genetic algorithm for cost-oriented stochastic assembly line balancing problem. Assem Autom. https://doi.org/10.1108/AA-03-2018-050
Gen M, Cheng R, Wang D (1997) Genetic algorithms for solving shortest path problems. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97) (pp. 401–406). IEEE
Gökçen H, Kara Y, Atasagun Y (2010) Integrated line balancing to attain Shojinka in a multiple straight line facility. Int J Comput Integr Manuf 23(5):402–411. https://doi.org/10.1080/09511921003642162
Hadi-Vencheh A (2011) A new nonlinear model for multiple criteria supplier-selection problem. Int J Comput Integr Manuf 24(1):32–39. https://doi.org/10.1080/0951192X.2010.527372
Hadi-Vencheh A, Mohamadghasemi A (2013) An integrated AHP–NLP methodology for facility layout design. J Manuf Syst 32(1):40–45. https://doi.org/10.1016/j.jmsy.2012.07.009
Hamta N, Ghomi SF, Jolai F, Shirazi MA (2013) A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect. Int J Prod Econ 141(1):99–111. https://doi.org/10.1016/j.ijpe.2012.03.013
Hamta N, Ghomi SF, Tavakkoli-Moghaddam R, Jolai F (2014) A hybrid meta-heuristic for balancing and scheduling assembly lines with sequence-independent setup times by considering deterioration tasks and learning effect Scientia Iranica. Trans E, Ind Eng 21(3):963
Kara Y, Paksoy T, Chang CT (2009) Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing. Eur J Oper Res 195(2):335–347. https://doi.org/10.1016/j.ejor.2008.01.003
Khorram M (2018) A cost based mathematical formulation for U-type assembly line balancing problem. Ann Optim Theory and Pr 1(1):11–21
Kim YK, Kim Y, Kim YJ (2000) Two-sided assembly line balancing: a genetic algorithm approach. Prod Plan Control 11(1):44–53. https://doi.org/10.1080/095372800232478
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680. https://doi.org/10.1126/science.220.4598.671
Kovács G, Nagy B, Vizvári B (2017) An integer programming approach to characterize digital disks on the triangular grid. In: International Conference on Discrete Geometry for Computer Imagery (pp. 94–106). Springer, Cham. https://doi.org/10.1007/978-3-319-66272-5_9
Li Z, Kucukkoc I, Tang Q (2017) New MILP model and station-oriented ant colony optimization algorithm for balancing U-type assembly lines. Comput Ind Eng 112:107–121. https://doi.org/10.1016/j.cie.2017.07.005
Li Z, Kucukkoc I, Zhang Z (2018) Branch, bound and remember algorithm for U-shaped assembly line balancing problem. Comput Ind Eng 124:24–35
Li Z, Janardhanan MN, Ashour AS, Dey N, Li Z, Janardhanan MN, Ashour AS, Dey N (2019) Mathematical models and migrating birds optimization for robotic U-shaped assembly line balancing problem. Neural Comput Appl 31(12):9095–9111. https://doi.org/10.1007/s00521-018-3957-4
Li Z, Janardhanan MN, Rahman HF (2021) Enhanced beam search heuristic for U-shaped assembly line balancing problems. Eng Optim 53(4):594–608
Make MRA, Rashid MFFA, Razali MM (2017) A review of two-sided assembly line balancing problem. Int J Adv Manuf Technol 89(5–8):1743–1763. https://doi.org/10.1007/s00170-016-9158-3
Manavizadeh N, Hosseini NS, Rabbani M, Jolai F (2013) 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 64(2):669–685. https://doi.org/10.1016/j.cie.2012.11.010
McMullen PR, Frazier GV (1998) Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations. Int J Prod Res 36(10):2717–2741. https://doi.org/10.1080/002075498192454
Miltenburg J (2002) Balancing and scheduling mixed-model U-shaped production lines. Int J Flex Manuf Syst 14(2):119–151. https://doi.org/10.1023/A:1014434117888
Miltenburg GJ, Wijngaard J (1994) The U-line line balancing problem. Manage Sci 40(10):1378–1388. https://doi.org/10.1287/mnsc.40.10.1378
Mirzaei N, Niroomand S, Zare R (2016) Application of statistical process control in service industry. J Model Manag 11(3):763–782
Niroomand S, Vizvari B (2015) Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry. Int Trans Oper Res 22(3):519–544. https://doi.org/10.1111/itor.12096
Niroomand S, Hadi-Vencheh A, Şahin R, Vizvári B (2015) Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems. Exp Syst Appl 42(19):6586–6597
Niroomand S, Hadi-Vencheh A, Mirzaei N, Molla-Alizadeh-Zavardehi S (2016) Hybrid greedy algorithms for fuzzy tardiness/earliness minimisation in a special single machine scheduling problem: case study and generalisation. Int J Comput Integr Manuf 29(8):870–888
Nourmohammadi A, Zandieh M (2011) Assembly line balancing by a new multi-objective differential evolution algorithm based on TOPSIS. Int J Prod Res 49(10):2833–2855. https://doi.org/10.1080/00207540903473367
Ogan D, Azizoglu M (2015) A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements. J Manuf Syst 36:46–54. https://doi.org/10.1016/j.jmsy.2015.02.007
Özcan U, Toklu B (2009a) Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming models. Comput Oper Res 36(6):1955–1965. https://doi.org/10.1016/j.cor.2008.06.009
Özcan U, Toklu B (2009b) A tabu search algorithm for two-sided assembly line balancing. Int J Adv Manuf Technol 43(7–8):822. https://doi.org/10.1007/s00170-008-1753-5
Pattanaik LN, Jena A (2019) Tri-objective optimisation of mixed model reconfigurable assembly system for modular products. Int J Comput Integr Manuf 32(1):72–82. https://doi.org/10.1080/0951192X.2018.1550673
Ponnambalam SG, Aravindan P, Naidu GM (2000) A multi-objective genetic algorithm for solving assembly line balancing problem. Int J Adv Manuf Technol 16(5):341–352. https://doi.org/10.1007/s001700050166
Rabbani M, Moghaddam M, Manavizadeh N (2012) Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout. Int J Adv Manuf Technol 59(9–12):1191–1210. https://doi.org/10.1007/s00170-011-3545-6
Roshani A, Fattahi P, Roshani A, Salehi M, Roshani A (2012) Cost-oriented two-sided assembly line balancing problem: a simulated annealing approach. Int J Comput Integr Manuf 25(8):689–715. https://doi.org/10.1080/0951192X.2012.664786
Saif U, Guan Z, Wang B, Mirza J, Huang S (2014) A survey on assembly lines and its types. Front Mech Eng 9(2):95–105. https://doi.org/10.1007/s11465-014-0302-1
Saif U, Guan Z, Zhang L, Mirza J, Lei Y (2017) Hybrid Pareto artificial bee colony algorithm for assembly line balancing with task time variations. Int J Comput Integr Manuf 30(2–3):255–270. https://doi.org/10.1080/0951192X.2016.1145802
Salehi M, Maleki HR, Niroomand S (2020) Solving a new cost-oriented assembly line balancing problem by classical and hybrid meta-heuristic algorithms. Neural Comput Appl 32(12):8217–8243
Sanei M, Mahmoodirad A, Niroomand S (2016) Two-stage supply chain network design problem with interval data. Int J e-Navigation and Maritime Econom 5:74–84
Scholl A, Klein R (1999) ULINO: optimally balancing U-shaped JIT assembly lines. Int J Prod Res 37(4):721–736. https://doi.org/10.1080/002075499191481
Suresh G, Sahu S (1994) Stochastic assembly line balancing using simulated annealing. Int J Prod Res 32(8):1801–1810. https://doi.org/10.1080/00207549408957042
Taassori M, Taassori M, Niroomand S, Vizvári B, Uysal S, Hadi-Vencheh A (2015) OPAIC: an optimization technique to improve energy consumption and performance in application specific network on chips. Measurement 74:208–220
Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes (No. 658.562 T3).
Yavari M, Marvi M, Akbari AH (2019) Semi-permutation-based genetic algorithm for order acceptance and scheduling in two-stage assembly problem. Neural Comput Appl. https://doi.org/10.1007/s00521-019-04027-w
Yuan B, Zhang C, Shao X, Jiang Z (2015) An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines. Comput Oper Res 53:32–41. https://doi.org/10.1016/j.cor.2014.07.011
Zhang W, Gen M (2011) An efficient multiobjective genetic algorithm for mixed-model assembly line balancing problem considering demand ratio-based cycle time. J Intell Manuf 22(3):367–378. https://doi.org/10.1007/s10845-009-0295-5
Zhou BH, Tan F (2018) Electric vehicle handling routing and battery swap station location optimisation for automotive assembly lines. Int J Comput Integr Manuf 31(10):978–991. https://doi.org/10.1080/0951192X.2018.1493229
Funding
This study was not funded by any organization.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Author Morteza Khorram declares that he has no conflict of interest. Author Mahmood Eghtesadifard declares that he has no conflict of interest. Author Sadegh Niroomand declares that he has no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Khorram, M., Eghtesadifard, M. & Niroomand, S. Hybrid meta-heuristic algorithms for U-shaped assembly line balancing problem with equipment and worker allocations. Soft Comput 26, 2241–2258 (2022). https://doi.org/10.1007/s00500-021-06472-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-021-06472-z