Skip to main content
SpringerLink
Log in

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

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

References

  1. Amen M (2000) Heuristic methods for cost-oriented assembly line balancing: a survey. Int J Prod Econ 68:1–14

    Article  Google Scholar 

  2. Amen M (2000) An exact method for cost-oriented assembly line balancing. Int J Prod Econ 64:187–195

    Article  Google Scholar 

  3. Amen M (2006) Cost-oriented assembly line balancing model formulations, solution difficulty, upper and lower bounds. Eur J Oper Res 168:747–770

    Article  MathSciNet  MATH  Google Scholar 

  4. Antony J, Kaye M (1999) Experimental quality-a strategic approach to achieve and improve quality. Kluwer Academic Publishers, Norwell

    Google Scholar 

  5. Askin R, Zhou M (1997) A parallel station heuristic for the mixed-model production line balancing problem. Int J Prod Res 35:3095–105

    Article  MATH  Google Scholar 

  6. Atasagun Y, Kara Y (2014) Bacterial foraging optimization algorithm for assembly line balancing. Neural Comput Appl 25(1):237–250

    Article  Google Scholar 

  7. Bai Y, Zhao H, Zhu L (2009) Mixed-model assembly line balancing using the hybrid genetic algorithm. ICMTMA 3:242–245

    Google Scholar 

  8. Battaïa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259–277

    Article  Google Scholar 

  9. Baykasoglu A, Dereli T (2008) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36:582–588

    Article  Google Scholar 

  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–232

    Article  Google Scholar 

  11. Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694–715

    Article  MathSciNet  MATH  Google Scholar 

  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-7

  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–300

    Article  Google Scholar 

  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–188

    Article  MATH  Google Scholar 

  15. Eroglu Y, Seçkiner SU (2012) Design of wind farm layout using ant colony algorithm. Renew Energy 44:53–62

    Article  Google Scholar 

  16. Erel E, Sarin SC (1998) A survey of the assembly line balancing procedures. Prod Plan Control 9(5):414–434

    Article  Google Scholar 

  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–378

    Article  Google Scholar 

  18. Glover F (1989) Tabu search, part i. ORSA J Comput 1(3):190–206

    Article  MATH  Google Scholar 

  19. Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308–315

    Article  MathSciNet  MATH  Google Scholar 

  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–68

    Article  Google Scholar 

  21. Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge

    MATH  Google Scholar 

  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

    Article  Google Scholar 

  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–1122

    Article  Google Scholar 

  24. Kim YK, Kim YJU, Kim Y (1996) Genetic algorithms for assembly line balancing with various objectives. Comput Ind Eng 30(3):397–409

    Article  MathSciNet  Google Scholar 

  25. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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–3340

    Article  Google Scholar 

  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–685

    Article  Google Scholar 

  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–12031

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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–1393

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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–54

    Article  Google Scholar 

  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–136

    Article  Google Scholar 

  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–352

    Article  Google Scholar 

  37. Rosenberg O, Ziegler H (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Math Methods Oper Res 36(6):477–495

    Article  MATH  Google Scholar 

  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–715

    Article  Google Scholar 

  39. Rubinnovitz J, Levitin G (1995) Genetic algorithm for assembly line balancing. Int J Prod Econ 41(1):343–354

    Article  Google Scholar 

  40. Sabuncuoglu I, Erel R, Tanyer M (2000) Assembly line balancing using genetic algorithm. J Intell Manuf 11:295–310

    Article  Google Scholar 

  41. Sahin R (2011) A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Syst Appl 38(4):4460–4465

    Article  Google Scholar 

  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–313

    Article  Google Scholar 

  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–6873

    Article  MATH  Google Scholar 

  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–1018

    Article  Google Scholar 

  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–105

    Article  Google Scholar 

  46. Scholl A, Becker C (2005) A note on “an exact method for cost-oriented assembly line balancing”. Int J Prod Econ 97:343–352

    Article  Google Scholar 

  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–693

    Article  MathSciNet  MATH  Google Scholar 

  48. Scholl A (1997) Data of assembly line balancing problems. Technische Hochschule Darmstadt, Institut für Betriebswirtschaftslehre Hochschulstraße 1, D-64289 Darmstadt, Germany

  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–4175

    MathSciNet  MATH  Google Scholar 

  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–825

    Article  Google Scholar 

  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

    Article  Google Scholar 

  52. Sungur B, Yavuz Y (2015) Assembly line balancing with hierarchical worker assignment. J Manuf Syst 37:290–298

    Article  Google Scholar 

  53. Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization/UNIPUB, White Plains

    Google Scholar 

  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–750

    Article  Google Scholar 

  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–454

    MathSciNet  MATH  Google Scholar 

  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–556

    Article  Google Scholar 

  57. Turky A, Salwani A (2014) A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf Sci 272:84–95

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Shiraz University of Technology, Shiraz, Iran

    Maryam Salehi & Hamid Reza Maleki

  2. Department of Industrial Engineering, Firouzabad Institute of Higher Education, Firuzabad, Fars, Iran

    Sadegh Niroomand

Authors
  1. Maryam Salehi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamid Reza Maleki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sadegh Niroomand
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Reza Maleki.

Ethics declarations

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.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Salehi, M., Maleki, H.R. & Niroomand, S. Solving a new cost-oriented assembly line balancing problem by classical and hybrid meta-heuristic algorithms. Neural Comput & Applic 32, 8217–8243 (2020). https://doi.org/10.1007/s00521-019-04293-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-019-04293-8

Keywords

Search

Navigation