Advertisement

Solving a new cost-oriented assembly line balancing problem by classical and hybrid meta-heuristic algorithms

  • Maryam Salehi
  • Hamid Reza MalekiEmail author
  • Sadegh Niroomand
Original Article

Abstract

In this study, a new cost-oriented assembly line balancing problem is proposed and formulated. A single objective function consisting of minimizing the cost associated with equipment, labor wage, and station establishment is considered for the problem. This problem is more complicated comparing to the literature as worker qualification is considered for determining his/her wage. As this problem is of NP-hard optimization problems, some meta-heuristic solution approaches, e.g., simulated annealing, variable neighborhood search, genetic algorithm, tabu search, population-based simulated annealing, and their hybrid versions are proposed. In the proposed algorithms, a novel encoding–decoding scheme is applied. This scheme uses the Hungarian method to assign the workers to the station to reduce the total wage of the workers. To study the performance of the proposed meta-heuristic algorithms, ten test problems are generated randomly, and using one of them the parameters of the algorithms are tuned by the Taguchi method. The final experiments on the proposed algorithms and the test problems show that in the most of the experiments, among the proposed algorithms, the single-solution-based algorithms, except TS, perform better than the population-based algorithms, especially for the case of large size test problems.

Keywords

Assembly line balancing problem Meta-heuristic algorithm Taguchi method Hungarian method 

Notes

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

References

  1. 1.
    Amen M (2000) Heuristic methods for cost-oriented assembly line balancing: a survey. Int J Prod Econ 68:1–14CrossRefGoogle Scholar
  2. 2.
    Amen M (2000) An exact method for cost-oriented assembly line balancing. Int J Prod Econ 64:187–195CrossRefGoogle Scholar
  3. 3.
    Amen M (2006) Cost-oriented assembly line balancing model formulations, solution difficulty, upper and lower bounds. Eur J Oper Res 168:747–770MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Antony J, Kaye M (1999) Experimental quality-a strategic approach to achieve and improve quality. Kluwer Academic Publishers, NorwellGoogle Scholar
  5. 5.
    Askin R, Zhou M (1997) A parallel station heuristic for the mixed-model production line balancing problem. Int J Prod Res 35:3095–105zbMATHCrossRefGoogle Scholar
  6. 6.
    Atasagun Y, Kara Y (2014) Bacterial foraging optimization algorithm for assembly line balancing. Neural Comput Appl 25(1):237–250CrossRefGoogle Scholar
  7. 7.
    Bai Y, Zhao H, Zhu L (2009) Mixed-model assembly line balancing using the hybrid genetic algorithm. ICMTMA 3:242–245Google Scholar
  8. 8.
    Battaïa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259–277CrossRefGoogle Scholar
  9. 9.
    Baykasoglu A, Dereli T (2008) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36:582–588CrossRefGoogle Scholar
  10. 10.
    Baykasoglu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17:217–232CrossRefGoogle Scholar
  11. 11.
    Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694–715MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Chong KE, Omar, MK, Baker NA (2008) Solving assembly line balancing problem using genetic algorithm with heuristic treated initial population. In: Proceedings of the world congress on engineering. ISBN:978-988-17012-3-7Google Scholar
  13. 13.
    Cuoglu IS, Erel E, Alp A (2009) Ant colony optimization for the single model U-type assembly line balancing problem. Int J Prod Econ 120:287–300CrossRefGoogle Scholar
  14. 14.
    Deming L, Xiuping G (2016) Variable neighborhood search for the second type of two-sided assembly line balancing problem. Comput Oper Res 72:183–188zbMATHCrossRefGoogle Scholar
  15. 15.
    Eroglu Y, Seçkiner SU (2012) Design of wind farm layout using ant colony algorithm. Renew Energy 44:53–62CrossRefGoogle Scholar
  16. 16.
    Erel E, Sarin SC (1998) A survey of the assembly line balancing procedures. Prod Plan Control 9(5):414–434CrossRefGoogle Scholar
  17. 17.
    Fattahi P, Roshani A, Roshani A (2011) A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem. Int J Adv Manuf Technol 53:363–378CrossRefGoogle Scholar
  18. 18.
    Glover F (1989) Tabu search, part i. ORSA J Comput 1(3):190–206MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308–315MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Heydari A, Mahmoodirad A, Niroomand S (2016) An entropy-based mathematical formulation for straight assembly line balancing problem. Int J Strat Decision Sci (IJSDS) 7(2):57–68CrossRefGoogle Scholar
  21. 21.
    Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, CambridgezbMATHGoogle Scholar
  22. 22.
    Hsu C (2013) Application of SVR, Taguchi loss function, and the artificial bee colony algorithm to resolve multiresponse parameter design problems: a case study on optimizing the design of a TIR lens. Neural Comput Appl.  https://doi.org/10.1007/s00521-013-1357-3 CrossRefGoogle Scholar
  23. 23.
    Kazemi SM, Ghodsi R, Rabbani M, Tavakkoli-Moghaddam R (2011) A novel two-stage genetic algorithm for a mixed-model U-line balancing problem with duplicated tasks. Int J Adv Manuf Technol 55:1111–1122CrossRefGoogle Scholar
  24. 24.
    Kim YK, Kim YJU, Kim Y (1996) Genetic algorithms for assembly line balancing with various objectives. Comput Ind Eng 30(3):397–409MathSciNetCrossRefGoogle Scholar
  25. 25.
    Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Li Z, Dey N, Ashour AS, Tang Q (2017) Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Comput Appl.  https://doi.org/10.1007/s00521-017-2855-5 CrossRefGoogle Scholar
  27. 27.
    Mahmoodi-Rad A, Molla-Alizadeh-Zavardehi S, Dehghan R, Sanei M, Niroomand S (2014) Genetic and differential evolution algorithms for the allocation of customers to potential distribution centers in a fuzzy environment. Int J Adv Manuf Technol 70:1939–1954.  https://doi.org/10.1007/s00170-013-5383-1 CrossRefGoogle Scholar
  28. 28.
    Maleki HR, Khanduzi R, Akbari R (2017) A novel hybrid algorithm for solving continuous single-objective defensive location problem. Neural Comput Appl 28(11):3323–3340CrossRefGoogle Scholar
  29. 29.
    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 JustIn-time approach. Comput Ind Eng 64:669–685CrossRefGoogle Scholar
  30. 30.
    Manavizadeh N, Rabbani M, Moshtaghi D, Jolai F (2012) Mixed-model assembly line balancing in the make-to-order and stochastic environment using multi-objective evolutionary algorithms. Expert Syst Appl 39:12026–12031CrossRefGoogle Scholar
  31. 31.
    Molla-Alizadeh-Zavardehi S, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2011) Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Syst Appl 38:10462–10474.  https://doi.org/10.1016/j.eswa.2011.02.093 CrossRefGoogle Scholar
  32. 32.
    Mukund Nilakantan J, Ponnambalam SG, Jawahar N et al (2015) Bio-inspired search algorithms to solve robotic assembly line balancing problems. Neural Comput Appl 26(6):1379–1393CrossRefGoogle Scholar
  33. 33.
    Naderi B, Zandieh M, Ghoshe Balagh AK, Roshanaei V (2009) An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625–9633.  https://doi.org/10.1016/j.eswa.2008.09.063 CrossRefGoogle Scholar
  34. 34.
    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–54CrossRefGoogle Scholar
  35. 35.
    Ozcan U, Toklu B (2009) A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems. J Intell Manuf 20:123–136CrossRefGoogle Scholar
  36. 36.
    Ponnambalam SG, Aravindan P, Naidu GM (2000) A multiobjective genetic algorithm for solving assembly line balancing problem. Int J Adv Manuf Technol 16:341–352CrossRefGoogle Scholar
  37. 37.
    Rosenberg O, Ziegler H (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Math Methods Oper Res 36(6):477–495zbMATHCrossRefGoogle Scholar
  38. 38.
    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–715CrossRefGoogle Scholar
  39. 39.
    Rubinnovitz J, Levitin G (1995) Genetic algorithm for assembly line balancing. Int J Prod Econ 41(1):343–354CrossRefGoogle Scholar
  40. 40.
    Sabuncuoglu I, Erel R, Tanyer M (2000) Assembly line balancing using genetic algorithm. J Intell Manuf 11:295–310CrossRefGoogle Scholar
  41. 41.
    Sahin R (2011) A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Syst Appl 38(4):4460–4465CrossRefGoogle Scholar
  42. 42.
    Sahin R, Ertogral K, Türkbey O (2010) A simulated annealing heuristic for the dynamic layout problem with budget constraint. Comput Ind Eng 59(2):308–313CrossRefGoogle Scholar
  43. 43.
    Sahin R, Türkbey O (2009) A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem. Int J Prod Res 47(24):6855–6873zbMATHCrossRefGoogle Scholar
  44. 44.
    Sahin R, Türkbey O (2009) A simulated annealing algorithm to find approximate Pareto optimal solutions for the multi-objective facility layout problem. Int J Adv Manuf Technol 41:1003–1018CrossRefGoogle Scholar
  45. 45.
    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–105CrossRefGoogle Scholar
  46. 46.
    Scholl A, Becker C (2005) A note on “an exact method for cost-oriented assembly line balancing”. Int J Prod Econ 97:343–352CrossRefGoogle Scholar
  47. 47.
    Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666–693MathSciNetzbMATHCrossRefGoogle Scholar
  48. 48.
    Scholl A (1997) Data of assembly line balancing problems. Technische Hochschule Darmstadt, Institut für Betriebswirtschaftslehre Hochschulstraße 1, D-64289 Darmstadt, GermanyGoogle Scholar
  49. 49.
    Seçkiner SU, Eroglu Y, Emrullah M, Dereli T (2013) Ant colony optimization for continuous functions by using novel pheromone updating. Appl Math Comput 219:4163–4175MathSciNetzbMATHGoogle Scholar
  50. 50.
    Seyed-Alagheband SA, Ghomi SMTF, Zandieh M (2011) A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Int J Prod Res 49(3):805–825CrossRefGoogle Scholar
  51. 51.
    Simaria AS, Vilarinho PM (2009) 2-ANTBAL: an ant colony optimization for balancing two-sided assembly lines. Comput Ind Eng 56(2):489–506.  https://doi.org/10.1016/j.cie.2007.10.007 CrossRefGoogle Scholar
  52. 52.
    Sungur B, Yavuz Y (2015) Assembly line balancing with hierarchical worker assignment. J Manuf Syst 37:290–298CrossRefGoogle Scholar
  53. 53.
    Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization/UNIPUB, White PlainsGoogle Scholar
  54. 54.
    Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS. Int J Adv Manuf Technol 53:733–750CrossRefGoogle Scholar
  55. 55.
    Tavakkoli-Moghaddam R, Safaei N, Gholipour Y (2006) A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl Math Comput 176(2):445–454MathSciNetzbMATHGoogle Scholar
  56. 56.
    Tavakkoli-Moghaddam R, Safarib J, Sassani F (2008) Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm. Reliab Eng Syst Saf 93(4):550–556CrossRefGoogle Scholar
  57. 57.
    Turky A, Salwani A (2014) A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf Sci 272:84–95CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2019

Authors and Affiliations

  • Maryam Salehi
    • 1
  • Hamid Reza Maleki
    • 1
    Email author
  • Sadegh Niroomand
    • 2
  1. 1.Faculty of MathematicsShiraz University of TechnologyShirazIran
  2. 2.Department of Industrial EngineeringFirouzabad Institute of Higher EducationFiruzabadIran

Personalised recommendations